Mapping of subpackets to resources in a communication system
Abstract
MAPPING SUBPACKAGES ON RESOURCES IN A COMMUNICATION SYSTEM Techniques for transmitting data in a communication system are described. A package can be divided into multiple subpackages, and each subpackage can be coded separately. Subpackages can be mapped into resources assigned for transmitting the package, with at least one subpackage being mapped into a subset of the allocated resources. Assigned resources can include multiple tiles, with each tile corresponding to a block of time-frequency resources. Subpackages can be mapped to tiles so that (i) the subpackages are mapped on an equal number of tiles, in order to obtain similar decoding performance, (ii) each subpackage is mapped on at least NMIN tiles, if available , in order to obtain a certain order of minimum diversity for the subpackage, and / or (iii) each subpackage is mapped into a subset of the multiple tiles, if possible, so that the subpackage can be decoded without having to demodulate all tiles.

Term
1.3 yearsto projected expiry
Projected expiry 3 January 2028, counted from filing; an application has no term until it is granted.
- Priority
- Filed
- Published
- Today
- Projected expiry
38 claims: 10 independent, 28 dependent
- 1REIVINDICAÇÕES 1. Equipamento para comunicação, que compreende:pelo menos um processador configurado para determinar recursos atribuídos para transmissão de um pacote, para particionar o pacote em múltiplos subpacotes e para mapear os múltiplos subpacotes nos recursos atribuídos, com pelo menos um subpacote sendo mapeado em um subconjunto dos recursos atribuídos;e uma memória acoplada ao pelo menos um processador.
- 2Equipamento, de acordo com a reivindicação 1, no qual o pelo menos um processador é configurado para codificar cada subpacote com base em um código de correção de erros antecipada (FEC) para obter um subpacote codificado correspondente.
- 3Equipamento, de acordo com a reivindicação 1, no qual os recursos atribuídos compreendem múltiplos tiles, com cada tile correspondendo a um bloco de recursos de tempo-frequência.
- 4Equipamento, de acordo com a reivindicação 1, no qual cada tile corresponde a um bloco de recursos de tempo-frequência contíguos.
- 5Equipamento, de acordo com a reivindicação 1, no qual cada tile corresponde a um bloco de recursos de tempo-frequência distribuídos através da largura de banda do sistema.
- 6Equipamento, de acordo com a reivindicação 3, no qual o pelo menos um processador é configurado para mapear cada um dos múltiplos subpacotes em um subconjunto diferente das várias tiles.
- 7Equipamento, de acordo com a reivindicação 3, no qual o pelo menos um processador é configurado para 2/9 mapear cada um dos múltiplos subpacotes em um número mínimo específico de tiles ou em todas das múltiplos tiles se em menor número que o número mínimo específico de tiles.
- 8Equipamento, de acordo com a reivindicação 3, no qual o pelo menos um processador é configurado para mapear cada um dos múltiplos subpacotes em um número igual de tiles.
- 9Equipamento, de acordo com a reivindicação 3, no qual o pelo menos um processador é configurado para dispor os múltiplos tiles em cada tile do primeiro grupo e para mapear todos os múltiplos subpacotes em cada tile do segundo grupo.
- 10Equipamento, de acordo com a reivindicação 9, no qual o primeiro grupo inclui um número inteiro de t tiles, onde t é o número de subpacotes.
- 11Equipamento, de acordo com a reivindicação 3, no qual, para cada um dos múltiplos tiles, o pelo menos um processador é configurado para determinar pelo menos um subpacote mapeado no tile e para distribuir o pelo menos um subpacote através do tile.
- 12Equipamento, de acordo com a reivindicação 11, no qual, para cada um dos múltiplos tiles, o pelo menos um processador é configurado para distribuir o pelo menos um subpacote através do tile pela passagem através do pelo menos um subpacote e pelo menos de um subpacote em cada unidade de transmissão no tile.
- 13Método para transmitir dados, que compreende:determinar recursos atribuídos para transmissão de um pacote;particionar o pacote em múltiplos subpacotes;e mapear os múltiplos subpacotes nos recursos atribuídos, com pelo menos um subpacote sendo mapeado em um subconjunto dos recursos atribuídos. 3/9
- 14Método, de acordo com a reivindicação 13, que compreende também:codificar cada subpacote com base em um código de correção de erros antecipada (FEC) de modo a se obter um subpacote codificado correspondente.
- 15Método, de acordo com a reivindicação 13, no qual os recursos atribuídos compreendem múltiplos tiles, e no qual o mapeamento dos múltiplos subpacotes compreende:, o mapeamento de cada um dos múltiplos subpacotes em pelo menos um de um subconjunto diferente das várias tiles, em um número igual de tiles, em um número mínimo específico de tiles e em todas das várias tiles se em menor número que o número mínimo específico de tiles.
- 16Método, de acordo com a reivindicação 13, no qual os recursos atribuídos compreendem várias tiles, e no qual o mapeamento dos múltiplos subpacotes compreende dispor as várias tiles em um primeiro grupo de um número inteiro múltiplo de t tiles e um segundo grupo de tiles restantes, onde t é o número de subpacotes, mapear um subconjunto dos múltiplos subpacotes em cada tile do primeiro grupo e mapear todos os subpacotes dos múltiplos subpacotes em cada tile do segundo grupo.
- 17Equipamento para comunicação, que compreende:um dispositivo para determinar recursos atribuídos para transmissão de um pacote;um dispositivo para particionar o pacote em múltiplos subpacotes;e um dispositivo para mapear os múltiplos subpacotes nos recursos atribuídos, com pelo menos um subpacote sendo mapeado em um subconjunto dos recursos atribuídos.
- 18Equipamento, de acordo com a reivindicação ; 17, que compreende também:um dispositivo para codificar 4/9 cada subpacote com base em um código de correção de erros antecipada (FEC) de modo a se obter um subpacote codificado correspondente.
- 19Equipamento, de acordo com a reivindicação 17, no qual os recursos atribuídos compreendem múltiplos tiles, e no qual o dispositivo para mapear os múltiplos subpacotes compreende um dispositivo para mapear cada um dos múltiplos subpacotes em pelo menos um de um subconjunto diferente das várias tiles, em um número igual de tiles, em um número mínimo específico de tiles e em todas das várias tiles se em menor número que o número mínimo específico de tiles.
- 20Equipamento, de acordo com a reivindicação 17, no qual os recursos atribuídos compreendem múltiplos tiles, e no qual o dispositivo para mapear os múltiplos subpacotes compreende um dispositivo para dispor as várias tiles em um primeiro grupo de um número inteiro múltiplo de t tiles e um segundo grupo de tiles restantes, onde t é o número de subpacotes, um dispositivo para mapear um subconjunto dos múltiplos subpacotes em cada tile do primeiro grupo, e um dispositivo para mapear todos os subpacotes dos múltiplos subpacotes em cada tile do segundo grupo.'
- 21Produto de programa de computador, que compreende:um meio passível de leitura por computador que compreende: um código para fazer com que pelo menos um computador determine recursos atribuídos para transmissão de um pacote;um código para fazer com que o pelo menos um computador particione em múltiplos subpacotes;e 5/9 um código para fazer com que o pelo menos um computador mapeie os múltiplos subpacotes nos recursos atribuídos, com pelo menos um subpacote sendo mapeado em um subconjunto dos recursos atribuídos.
- 22Equipamento para comunicação, que compreende:pelo menos um processador configurado para determinar recursos atribuídos para transmissão de um pacote, para receber múltiplos subpacotes do pacote por meio dos recursos atribuídos, para demapear os múltiplos subpacotes dos recursos atribuídos, com pelo menos um subpacote sendo demapeado de um subconjunto dos recursos atribuídos e para processar os múltiplos subpacotes após o desmapeamento para recuperação do pacote;e uma memória acoplada ao pelo menos um processador.
- 23Equipamento, de acordo com a reivindicação 22, no qual o pelo menos um processador é configurado para decodificar cada subpacote com base em um código de correção de erros antecipada (FEC) para obter um subpacote decodificado correspondente.
- 24Equipamento, de acordo com a reivindicação 22, no qual os recursos atribuídos compreendem múltiplos tiles, cada tile correspondendo a um bloco de recursos de tempo-frequência.
- 25Equipamento, de acordo com a reivindicação 24, no qual o pelo menos um processador é configurado para efetuar demodulação para cada um dos múltiplos tiles e para efetuar decodificação para cada um dos múltiplos subpacotes quando todos os tiles nas quais o subpacote é mapeado tiverem sido demoduladas sem se aguardar a demodulação dos múltiplos tiles.
- 26Equipamento, de acordo com a reivindicação :24, no qual o pelo menos um processador é configurado para’ 6/9 demapear cada um dos múltiplos subpacotes de um subconjunto diferente dos múltiplos tiles.
- 27Equipamento, de acordo com a reivindicação 24, no qual o pelo menos um processador é configurado para demapear cada um dos múltiplos subpacotes de um número mínimo específico de tiles ou de todas dos múltiplos tiles se em menor número que o número mínimo específico de tiles.
- 28Equipamento, de acordo com a reivindicação 24, no qual o pelo menos um processador é configurado para demapear cada um dos múltiplos subpacotes de um número igual de tiles.
- 29Equipamento, de acordo com a reivindicação 24, no qual, para cada um dos múltiplos tiles, o pelo menos um processador é configurado para determinar pelo menos 1 um subpacote mapeado no tile e para demapear o pelo menos um subpacote de através do tile.
- 30Método para receber dados, que compreende:determinar os recursos atribuídos para transmissão de um pacote;receber múltiplos subpacotes do pacote por meio dos recursos atribuídos;demapear os múltiplos subpacotes dos recursos atribuídos, com pelo menos um subpacote sendo demapeado dè um subconjunto dos recursos atribuídos;e processar os múltiplos subpacotes após o desmapeamento com vistas à recuperação do pacote.
- 31Método, de acordo com a reivindicação 30, no qual o processamento dos múltiplos subpacotes compreende decodificar cada subpacote com base em um código de correção de erros antecipada (FEC) para obter um subpacote codificado correspondente.
- 32Método, de acordo com a reivindicação 30, no qual os recursos atribuídos compreendem várias tiles, e no 7/9 qual o processamento dos múltiplos subpacotes compreende efetuar demodulação para cada uma das várias tiles e efetuar decodificação para cada um dos múltiplos subpacotes quando todas as tiles nas quais o subpacote é mapeado tiverem sido demoduladas sem se aguardar a demodulação das várias tiles.
- 33Método, de acordo com a reivindicação 30, no qual os recursos atribuídos compreendem várias tiles, e no qual o desmapeamento dos múltiplos subpacotes compreendem demapear cada um dos múltiplos subpacotes de pelo menos uma de um subconjunto diferente das várias tiles, de um número igual de tiles, de um número mínimo específico de tiles e de todas das várias tiles se em menor número que o número mínimo especifico de tiles.
- 34Equipamento para comunicação, que compreende':um dispositivo para determinar recursos atribuídos para transmissão de um pacote;um dispositivo para receber múltiplos subpacotes do pacote por meio dos recursos atribuídos;um dispositivo para demapear os múltiplos subpacotes dos recursos atribuídos, com pelo menos um subpacote sendo demapeado de um subconjunto dos recursos atribuídos;e um dispositivo para processar os múltiplos subpacotes após o desmapeamento com vistas à recuperação do pacote.
- 35Equipamento, de acordo com a reivindicação 34, no qual o dispositivo para processar os múltiplos subpacotes compreende um dispositivo para decodificar cada subpacote com base em um código de correção de erros antecipada (FEC) para obter um subpacote decodificado correspondente. 8/9
- 36Equipamento, de acordo com a reivindicação 34, no qual os recursos atribuídos compreendem várias tiles, e no qual o dispositivo para processar os múltiplos subpacotes compreende um dispositivo para efetuar demodulação para cada uma das várias tiles, e um dispositivo para efetuar decodificação para cada um dos subpacotes quando todas as tiles nas quais o subpacote . é mapeado tiverem sido demoduladas sem se aguardar a demodulação das várias tiles.
- 37Equipamento, de acordo com a reivindicação 34, no qual os recursos atribuídos compreendem várias tiles, e no qual o dispositivo para demapear os múltiplos subpacotes compreende um dispositivo para demapear cada um dos múltiplos subpacotes de pelo menos um de um subconjunto diferente das várias tiles, de um número mínimo específico de tiles, de todas as várias tiles se em menor número que o número mínimo específico de tiles e de um número igual de tiles.
- 38Produto de programa de computador, que compreende:um meio passível de leitura por computador que compreende: um código para fazer com que pelo menos um computador determine recursos atribuídos para transmissão de um pacote;um código para fazer com que pelo menos um computador receba múltiplos subpacotes do pacote por meio dos recursos atribuídos;um código para fazer com que pelo menos um computador demapeie os múltiplos subpacotes dos recursos atribuídos, com pelo menos um subpacote sendo demapeado de um subconjunto dos recursos atribuídos;e ti um código para fazer com que o pelo menos computador processe os múltiplos subpacotes após desmapeamento com vistas à recuperação do pacote. um o 1/11 ο 1 C3DOC mm □ππο 1 πηηη ηπππ EOH 2/11 o Ό CM o Q. E φ H 1 L Freq S*— Um Quadro PHY->! índice de Quadro 3/11 Divisão/ z X .z /1 \ Particionamento S ' ' χ Z t \ de Pacotes z z z i ! X \ \ % \ Subpacote 0 Subpacote 1 ··· I Subpacote t-1 de Saída Codificação e 1 I Mapeamento 1 1 em símbolos ··· 1 1 Subpacote 0 de Saída Subpacote 1 de Saída Subpacote t-1 de Saída Mapeamento de Subpacotes em Tiles Link de Comunicação Desmapeamento de Tiles em Subpacotes -1 I -j -1 — ··· 1 1 Subpacote 0 Recebido Subpacote 1 Recebido Subpacote t-1 Recebido Desmapeamento _ Codificação de Símbolos l ··· I Subpacote 0 Decodificado Subpacote 1 Decodificado Subpacote t-1 Decodificado Montagem de Pacotes v % \ \ X z ί zz z z • 'x \\ / X ' ' 'x *. / Pacote Decodificado
Independent claims38
176 paragraphs in 5 sections, as filed
(54) Title: MAPPING SUBPACKAGES ON RESOURCES IN A COMMUNICATION SYSTEM (30) Unionist Priority: 02/01/2008 us 11 / 968,631, 01/05/2007 US 60 / 883,702, 01/05/2007 US 60 / 883,758 (73) Holder (s): Qualcomm Incorporated (72) Inventor (s): Aamod Khandekar, Alexei Gorokhov, Avneesh Agrawal, Jeremy H. Lin, Ravi Palanki (74) Attorney (s): Montaury Pimenta, Machado & Lioce (86) International Request: pct us2008050080 of 03/01/2008 (87) International Publication: wo 2008 / 086074de 17/07/2008 (57) Abstract: mapping of subpackages in RESOURCES IN A COMMUNICATION SYSTEM Techniques for transmitting data in a communication system are described. A package can be divided into multiple subpackages, and each subpackage can be coded separately. Subpackages can be mapped into resources assigned to transmit the package, with at least one subpackage being mapped into a subset of the allocated resources. Assigned resources can include multiple tiles, with each tile corresponding to a block of time frequency resources. Subpackages can be mapped to tiles so that (i) the subpackages are mapped on an equal number of tiles, in order to obtain similar decoding performance, (ii) each subpackage is mapped on at least NMIN tiles, if available , in order to obtain a certain order of minimum diversity for the subpackage, and / or (iii) each subpackage is mapped into a subset of the multiple tiles, if possible, so that the subpackage can be decoded without having to demodulate all tiles.
t = 3, «tiles · & ^, .- 4
<img file="BRPI0806485A2_D0001.tif" />
MAPPING SUBPACKAGES IN RESOURCES IN A COMMUNICATION SYSTEM
The present order claims priority for the provisional North American Order No. Serial No. 60/883 702, entitled SUBPACKAGES INTERCHANGE DCH, and for the provisional North American Order No. 60/883 758, entitled WIRELESS COMMUNICATION SYSTEM, both deposited on January 5, 2007, assigned to the transferee and incorporated here for reference.
FUNDAMENTALS
I. Field
The present disclosure relates generally to communications and, more specifically, to techniques for transmitting data in a communication system.
II. Foundations
In a communication system, a transmitter can encode a data packet in order to obtain code bits and generate symbols based on the code bits. The transmitter can then map the modulation symbols in time-frequency resources assigned to the packet and can also process and transmit the mapped modulation symbols via a communication channel. A receiver can obtain received symbols for data transmission and can carry out further processing in order to recover the transmitted packet.
It is desirable for the transmitter to process and transmit the packet so that good performance can be obtained for data transmission and so that the receiver can retrieve the packet effectively. There is, therefore, a need in the art for techniques to transmit effectively in a communication system.
SUMMARY
2/27
Techniques for transmitting packets are described here in order to achieve good performance and low decoding latency. In one respect, a packet can be partitioned into multiple subpackages, and each subpackage can be sent across all or a subset of the resources assigned for transmitting the packet. The mapping of subpackages to resources can be referred to as merging of subpackages. Each subpackage can be encoded separately and can be decoded separately. Assigned resources can include multiple tiles, with each tile corresponding to a block of time frequency resources. The subpackages can be mapped onto the tiles so that (i) the subpackages are mapped on an equal number of tiles in order to obtain similar decoding performance, (ii) each subpackage is mapped on at least N<sub>min</sub> tiles in order to obtain a certain order of minimum diversity for the subpackage and / or (iii) each subpackage is mapped into a subset of the tiles so that the subpackage can be decoded without having to demodulate all the tiles.
In a drawing, a transmitter can determine resources assigned to transmit a packet. The transmitter can partition the subpackage package, process (encode, by subpackage and map the multiple subpackages in the assigned resources. At least one subpackage can be mapped into a subset of the assigned resources, that is, in less than all assigned resources. For example , at least one subpackage can be mapped into a subset of the assigned tiles'.
in multiple 'example) each
In a drawing, a transmitter can determine the resources assigned to transmit a packet. The receiver can receive the multiple subpackages of the package by
3/27 means of the assigned resources and demap the subpackages of the assigned resources. At least one subpackage can be demapped from a subset of the assigned resources, such as, for example, a subset of the assigned tiles. The receiver can then process (decode, for example) the subpackages after demapping the package.
Several aspects and characteristics of the disclosure are described in more detail below.
BRIEF DESCRIPTION OF THE DRAWINGS Figure 1 shows a wireless communication system.
Figure 2 shows an exemplary frame structure.
Figure 3 shows the transmission and reception of a packet.
Figure 4 shows the mapping of three subpackages on eight tiles.
Figure 5 shows the mapping of three subpackages to transmission units on a tile.
Figure 6 shows the processing of the packet at a receiver.
Figure 7 shows a block diagram of a base station and a terminal.
Figure 8 shows a block diagram of a transmission data processor (TX).
Figure 9 shows a block diagram of a receiving data processor (RX).
Figure 10 shows a process for transmitting data.
Figure 11 shows a device for transmitting data.
Figure 12 shows a process for receiving data
4/27
Figure 13 shows a device for receiving data.
DETAILED DESCRIPTION
The techniques described here can be used in various wireless communication systems and networks. The terms system and network are often used interchangeably. The techniques described here can be used in several wireless communication systems, such as CDMA, TDMA, FDMA, OFDMA, SC-FDMA and other systems. The terms system and network are often used interchangeably. A CDMA system can implement radio technology such as Universal Land Radio Access (UTRA), cdma2000, etc. UTRA includes Broadband CDMA and other CDMA variants. Cdma2000 covers IS-2000, IS-95 and IS-856 standards. A TDMA system can implement radio technology such as the Global System for Mobile Communications (GSM). An OFDMS system can implement radio technology such as UTRA Evolved (E-UTRA), Ultra-Mobile Broadband (UMB), IEEE 802.11 (Wi-Fi), IEEE 802.16 (WiMAX), IEEE 802.20, FlashOFDM®, etc. UTRA, E-UTRA and GSM are part of the Universal Mobile Telecommunications System (UMTS). The Long Term Evolution (LTE) 3GPP is a future version of UMTS that uses E-UTRA, which uses OFDMA in the downlink and SCFDMA in the uplink. UTRA, E-UTRA, GSM, UMTS and LTE are described in documents from an organization called the 3-Year Partnership Project<sup>The</sup> Generation (3GPP). Cdma2000 and UMB are described in documents from an organization called<sup>The</sup> Generation 2 (3GPP2). These various radio technologies and standards are known in the art. For clarity, certain aspects of the techniques are described below for LTE, and LTE terminology is used in much of the following description.
5/27
Figure 1 shows a wireless communication system 100, which can also be referred to as an access network (AN). For simplicity, only one base station 110 and two terminals 120 and 130 are shown in Figure 1. 1. A base station is a station that communicates with the terminals. A base station can also be referred to as an access point, Node B, evolved Node B, etc. A terminal can be stationary or mobile and can also be referred to as an access terminal (AT), mobile station, user equipment, subscriber unit, station, etc. A terminal can be a cell phone, a personal digital assistant (PDA), a wireless communication device, a wireless modem, a handheld device, a laptop computer, a cordless phone, etc. A terminal can communicate with one or more base stations on the forward and / or reverse links at any given time. A terminal can communicate with one or more base stations on the forward and / or reverse links at any given time. The direct link (or downlink) refers to the communication link from the base stations to the terminals, and the reverse link (or uplink) refers to the communication link from the terminals to the base stations. In Figure 1, terminal 120 can receive data from base station 110 via forward link 122 and can transmit data via reverse link 124. Terminal 130 can receive data from base station 110 via forward link 132 and can transmit data via reverse link 134. The techniques described herein can be used for forward link as well as reverse link transmission.
The system can use orthogonal frequency division multiplexing (OFDM) and / or single carrier frequency division multiplexing (SC-FDM). OFDM and SC-FDM partition the system's bandwidth into several orthogonal (K) sub-carriers, which are also commonly referred to as tones, binaries, etc. Each sub6 / 27 carrier can be modulated with data. In general, modulation symbols are sent in the frequency domain with OFDM and in the time domain with SC-FDM. The spacing between adjacent subcarriers can be fixed, and the number of subcarriers can depend on the system's bandwidth.
Figure 2 shows a drawing of a frame structure 200 that can be used on the forward link and / or the reverse link. The transmission timeline for a given link can be partitioned into physical layer frame (PHY) units. Each PHY frame can cover a specific length of time, which can be fixed or configurable. In a drawing, each PHY frame covers N<sub>FRAMES</sub> OFDM symbol periods, where Nframe can be equal to 4, 6, 8 or some other value.
The time-frequency resources available for a given link can be partitioned into tiles. A tile can also be referred to as a time-frequency block, a resource block (in E-UTRA / LTE, for example), etc. A tile can cover a dimension of time and frequency, which can be fixed or configurable. In general, a tile can include physical resources or logical resources that can be mapped to physical resources. In a drawing, K jump gates can be defined and can be mapped to the total K subcarriers based on a known mapping. The tiles can then be defined based on either subcarriers (which are physical resources) or jump doors (which are logical resources).
In general, a tile can cover weather resources. of any size, dimension, conformation and characteristic. In a design, a tile can cover contiguous time-frequency resources. In another design / tile you can cover a block of time-frequency resources that can be distributed across the system's bandwidth and / or over time. In a drawing that
7/27 is assumed in much of the following description, each tile can cover N<sub>BLO</sub>co N jump doors<sub>FRAME</sub> OFDM symbol periods. In a drawing, each PHY frame covers 8 periods of OFDM symbols, and each tile covers N<sub>BLOC</sub>o = 16 jump ports on Nframe = 8 OFDM symbol periods. A PHY board and a tile can also have other sizes. In a drawing shown in Figure 2, each PHY frame includes L tiles with indexes from 0 to Ll. The number of tiles in each frame (L) may depend on the total number of sub-carriers (K), which in turn may depend on the system's bandwidth. As N<sub>BL</sub>hollow jump doors on each tile can be mapped on contiguous sub-carriers or sub-carriers distributed across the system's bandwidth.
Table 1 shows five different bandwidths that can be supported and the number of subcarriers / jump gates and the total number of tiles for each system bandwidth, according to a drawing. A terminal can have an assignment that is less than the total number of tiles in the system's bandwidth.
Table 1
<td>Bandwidth of the system</td><td>Number of Sub- carriers</td><td>Total number of Tiles</td>
<td>1.25 MHz</td><td> 128</td><td> 8</td>
<td>2.5 MHz</td><td> 256</td><td> 16</td>
<td>5 MHz</td><td> 512</td><td> 32</td>
<td>10 MHz</td><td> 1024</td><td> 64</td>
<td>20 MHz</td><td> 2048</td><td> 128</td>
The system can support global jumps and local jumps, which can also be referred to as SaltoDeTaxaDeSímbols and SaltoDeBloco, respectively. For global hops, a packet can be sent on Distributed Resource Channel (DRCH) resources, which can comprise a set of jump ports mapped to sub8 / 27 carriers distributed across all or a large part of the system's bandwidth. The mapping of jump ports on subcarriers can vary within a PHY frame for global jumps. For local hops, a packet can be sent on Block Resource Channel (BRCH) resources, which may comprise a set of jump ports mapped on contiguous subcarriers within a subzone. A sub-zone can cover a specific number (64 or 128, for example) of sub-carriers. The mapping of jump ports on subcarriers can be constant through a PHY frame for global jumps. Other jump schemes can also be supported for forward and reverse links.
system can support hybrid automatic retransmission (HARQ). For HARQ, a transmitter can send one or more transmissions to a packet until the packet is correctly decoded by a receiver or until. the maximum number of transmissions has been sent, or that some other completion condition has been met. HARQ can improve the security of data transmission.
Figure 2 shows a specific PHY board design / tile structure. Other frame structures can also be used to send data, signaling, pilot, etc. The available time-frequency resources can be partitioned in other ways. For clarity, the following description assumes the PHY / tile structure shown in Figure 2.
A transmitter (a base station or a terminal, for example) can transmit one or more packets to a receiver (a terminal or a base station) using time-frequency resources assigned to transmit the packet (s). It is desirable to transmit each packet so that good performance can be obtained for transmission
9/27 of packets and so that the receiver can retrieve the packet effectively.
In one respect, a package can be partitioned into t subpackages, where in general t> 1. Each subpackage can be encoded separately and shipped in all or a subset of the assigned resources. Assigned resources can include N tiles, where in general N<sub>TILES</sub> > 1. The t subpackages can be mapped in the N<sub>TILES</sub> tiles according to one or more of the following:
• Map the t subpackages on an equal number of tiles so that the t subpackages can achieve similar decoding performance, • Map each subpackage in a subset of the N<sub>TILES</sub> tiles, if possible, so that the subpackage can be decoded without having to demodulate all Ntiles tiles, and • Map each subpackage in at least N<sub>M</sub>in tiles in order to obtain a certain order of minimum diversity for the subpackage, where in general N<sub>min</sub> > 1.
The above mapping characteristics can be obtained as described below.
Figure 3 shows the transmission and reception of a packet. A transmitter can determine the size of a packet as follows:
PackageSize = 8 \ _p n<sub>Q</sub> N<sub>f</sub>/ 8j - N<sub>CRC</sub>,<sub>Date</sub>, Eq (1)
Where p is the spectral efficiency of the first transmission of the packet, n<sub>0</sub> is the number of hop ports usable for the first transmission of the packet,
N<sub>f</sub> is the number of PHY frames in which the packet is sent,
N<sub>Ç</sub>Rc, Data θ the number of cyclic redundancy check (CRC) bits for the packet,
10/27
PackageSize is the size of the package, and
LJ denotes a lower limit operator.
The spectral effectiveness p can be determined based on the channel conditions, which can be estimated by the receiver and sent to the transmitter. N<sub>f</sub> can be equal to 6N<sub>FRAME</sub> if the packet is part of a long-term transmission and can be equal to N<sub>FRAME</sub> otherwise. The packet size can also be determined in other ways.
The package can be partitioned or divided into t subpackages. In a drawing, the package can be partitioned if it is larger than a maximum subpackage size, as follows:
Size of cot et = -, Eq (2)
Size of subt sub and max where SubSizeSizeMax is the maximum subpackage size, and
Γ l · 'denotes an upper bound operator.
The package can be partitioned so that each subpackage contains approximately an equal number of bits or bytes. Each subpackage can be processed (coded, merged and mapped in symbols, for example) separately in order to obtain a corresponding output subpackage. The T subpackages can be mapped to N<sub>TILE</sub>s tiles based on a mapping of subpackages on tiles described below. The modulation symbols on the Ntiles tiles can be processed and transmitted via a communication link.
In the receiver, the transmission of packets from the transmitter can be processed in order to obtain detected symbols for the N<sub>T</sub>iles tiles used in the package. The detected symbols can be estimates of the
11/27 modulation symbols sent on the tiles. The receiver can map the t subpackages received from the N<sub>T</sub>x<sub>LES</sub> tiles in a complementary way to the mapping of subpackages on tiles carried out by the transmitter. Each received subpackage can be processed (mapped into symbols, deinterleaved and decoded, for example) separately in order to obtain a corresponding decoded subpackage. The decoded subpackages can then be assembled in order to obtain a decoded package.
The t subpackages can be mapped in the N<sub>TILES </sub>tiles in several ways. In a drawing, the package can be modulated on the jump doors assigned to this package according to the following procedure:
1. Initialize a gate counter from ia 0, a frame counter from fa 0 and an OFDM symbol counter from ja 0.
2. Arrange the set of usable balance ports assigned to this package in the f-th PHY transmission frame, for example, in ascending order. Let the resulting sequence be denoted by po, pi, ..., p<sub>n</sub>_ i, where n is the total number of jump gates assigned to this packet in the f-th transmission PHY frame.
3. Let that n<sub>sc</sub> is the sub-carrier index that corresponds to the jump port p ± in the j-th OFDM symbol of the f-th transmission PHY frame. Let q be the modulation order to be used in the f-th transmission PHY frame, which is a function of a packet format. If n<sub>sc</sub> is available for transmission, then a modulation symbol s with modulation order q is generated from subpackage m by a modulator, where m can be equal to:
m = (itiie * · (j + lmod N block) mo d NsuBpacoTEs-EM-TÍLE) mod t), Eq (3) where t is the total number of subpackages in the package,
Nblock is the number of jump doors on a tile,
Ítile is a tile index and given as' Ítile ~ Lí / Nbloco-L θ
12/27
Nsubpackages-on-tile is the number of subpackages on a tile. Nsubpackages-on-tile can be computed as follows:
The. Nsubpackages-on-tile ^ if Ítile <(Nitiles mod t), Eq (4) where Ntile - Ln / NgLoccd r θ
B.
z
FSUBPACOTES-EU-TILE ~ <sup>mU1</sup> hk
__
F / les - (Ftiles <sup>mod /</sup>) otherwise. Eq (5)
4. The modulation symbol s can be modulated with a power density P at the jump gate p<sub>iz</sub> and the value of the corresponding sub-carrier can be yfp. P can be the power density used for this assignment in the th transmission PHY frame. The modulation can be done on an antenna with k index if ile is a DRCH resource in JumpSteel Rate and on a tile antenna with k index if ile is a BRCH resource in JumpStep mode. In the symbol-hopping mode, the power density P can be constant across all the jump ports assigned to the package. In BlockLip mode, different power density values P can be used for BRCH resources.
5. Increment i. If i = n, increment j and set i =
0.
6. If j = N<sub>frame</sub>, set j = 0 and increment f.
7. If the last transmission PHY frame has been completed, then interrupt. Otherwise, repeat steps 2 through 6.
In the drawing described above, equations (4) and (5) determine the number of subpackages on each tile, and equation (3) determines which subpackage is sent on each jump door on each tile. In another design, the number of subpackages on each tile can be determined as follows:
13/27
Nsubpackages-on-tile - t if Ntiles <Nmin /
N =
SUBPACKAGES-IN-TILE if useful
N t
MIN<sup>1</sup>·
N / 'TILES J - ((Nmin t) mod Ntiles
Eq (6)
Eq (7)
Nmin - Ntiles <N<sub>M</sub>in t, or N
SUBPACKAGES-IN-TILE
N t MIN<sup>1</sup> l ^ TILES otherwise.
Eq (8)
Subpackages can also be mapped on tiles and jump doors based on other equations. In general, each subpackage can be mapped to all or a subset of the Ntiles tiles assigned to the package, and each tile can carry all or a subset of the t subpackages.
The mapping of subpackages on tiles in the equations of (3) and (5) can be exemplified with a specific example. In this example, t = 3 subpackages are sent in Ntiles - 8 tiles, with Nmin = 4.
Figure 4 shows a mapping of three subpackages 0, 1 and 2 in eight tiles from 0 to 7 based on the drawing with equations (3) to (5). In this example, (Ntiles mod t) is equal to 2, and the first two tiles 0 and 1 each include all three tile subpackages, as shown in equation (4). each remaining tile includes
<td rowspan="2">min</td><td rowspan="2"> 3,</td><td rowspan="2"> 8-</td><td rowspan="2">4 * 3 (8 mod 3)</td><td colspan="4"></td>
<td> = 2 /</td><td>subpackages,</td><td>as shown</td><td>at</td>
<td colspan="3">equation</td><td> (5) .</td><td></td><td></td><td></td><td></td>
<td></td><td></td><td></td><td>For</td><td>each</td><td>one of the two</td><td>first tiles 0 and</td><td> 1,</td>
<td colspan="3">Nsubpackages-</td><td>-EM-TILE <sup>=</sup></td><td> 3,</td><td>and the term (j</td><td>+ 1 mod Nbloco) mod 3</td><td>at</td>
equation (3) can assume values of 0, 1 and 2 once the OFDM symbol counter j and the port counter i are incremented. Therefore, all three subpackages are mapped to each of tiles 0 and 1, as shown in Figure 4.
14/27
For each of the remaining six tiles from 2 to 7, Nsubpackages-on-tile <sup>=</sup> 2, and the term (j + 1 mod Ν<sub>ΒΕ</sub>οοο) mod 2 in equation (3) can assume values of 0 and 1 since the OFDM symbol counter j and the door counter i are incremented. Therefore, only two subpackages are mapped on each of tiles 2 through 7. In particular, the subpackages (Ítile 3) and (i<sub>TILE</sub> + 1) mod 3) are mapped on the tile Tile · Thus, subpackages 0 and 2 are mapped on tile 2, subpackages 0 and 1 are mapped on tile 3, subpackages 1 and 2 are mapped on tile 4, etc., as shown in Figure 4.
In the drawing shown in equations (4) and (5), the Ntiles tiles are arranged in a first group of N<sub>x</sub> = M * t tiles and a second group of N<sub>2</sub> = N<sub>TIL</sub>es - Ni tiles, where M> 0, Ni is an integer multiple of t, and 0 <N<sub>2</sub> <t. The first group includes a multiple integer number of t tiles, and the second group includes zero or more remaining tiles. Each subpackage is mapped to the smallest of N<sub>min</sub> or Ni tiles from the first group. The smallest of t or Γν<sub>μιν</sub>/ μΊ subpackages are mapped on each tile of the first group.
All subpackages are mapped to each tile in the second group. Each of the subpackages is mapped to the same number of tiles regardless of the values of t and N<sub>TILES</sub>.,
In the example shown in Figure 4, Ni<sub>LE</sub>s = 8, N<sub>min</sub> = 4, Ni = 6, N<sub>2</sub> = 2 and M = 2. The first group includes Nj = 6 tiles, and the second group includes N<sub>2</sub> = tiles. Since N<sub>min </sub><Ni, each subpackage is mapped to N<sub>MI</sub>n = 4 tiles from the first group. Furthermore, since Γν<sub>μιν</sub> / m | <t, Γν<sub>μιν</sub> / M ~ | = .2 subpackages are mapped on each tile of the first group. All 3 subpackages are mapped to each tile in the second group.
15/27
In the drawing shown in equations (4) and (5), each subpackage is mapped to the smallest of N<sub>2</sub> + N<sub>M</sub>i<sub>N</sub> or N<sub>tiles</sub> tiles, where N<sub>2</sub> depends on the values of N<sub>TILES</sub> et. In another drawing, each subpackage is mapped to the smallest of N<sub>min</sub> or N<sub>tiles</sub> tiles. This can be achieved, for example, with the drawing shown in equations 6 to 8.
As shown in Figure 4, a given subpackage can be sent in a subset of the N<sub>mintiles</sub> tiles, without using all the resources allocated. Sending the subpackage in this way can provide the channel for demodulation and decoding tasks at the receiver and can improve latency latency. 4, the receiver can perform demodulation for tiles 0, 1, 2, 3, 5 and 6 in order to obtain symbols detected for subpackage 0, at the same time performing demodulation for the remaining two tiles 4 and 7. The receiver can then perform decoding for each of subpackages 1 and 2. In general, the amount of channeling may depend on the number of tiles on which each subpackage is sent, such as small N<sub>min</sub> and / or large N<sub>TILES</sub> may result in greater channeling. N<sub>min</sub> can be selected in order to obtain the desired diversity for each subpackage and can be equal to 4, 8, 16 or some other value
Figure 5 shows a drawing of a tile. In this design, a tile covers 16 jump doors in 8 OFDM symbol periods and includes 128 transmission units. A transmission unit can also be referred to as a resource element, can 'correspond to a sub-carrier in a period of OFDM symbols and can be used to send a symbol on each layer available for transmission. Pilot symbols can be sent on some of the transmission units, and other symbols can be sent on the remaining transmission units on the tile.
16/27
Figure 5 also shows the mapping of subpackages in transmission units on a tile based on equation (3). For the first tile with magnet<sub>T</sub>ile = 0, iej counters are both initialized to 0. For the first OFDM symbol period with j = 0, subpackage 0 is mapped on jump port 0, subpackage 1 is mapped on jump port 1, subpackage 2 is mapped to jump port 2, subpackage 0 is mapped to jump port 3, etc. For the second OFDM symbol period with j = 1, subpackage 1 is mapped on jump port 0, subpackage 2 is mapped on jump port 1, subpackage 0 is mapped on jump port 2, subpackage 1 is mapped in subpackage 3, etc. For the third OFDM symbol period with j = 2, subpackage 2 is mapped to jump port 0, subpackage 0 is mapped to jump port 1, subpackage 1 is mapped to jump port 2, subpackage 2 is mapped in subpackage 3, etc.
The design shown in equation (3) crosses the jump gates in each OFDM symbol period and also passes through the N<sub>s</sub>ubpackages-on-tile subpackages and maps a subpackage to each jump door. Different starting subpackages are used in different OFDM symbol periods. If only one subpackage is mapped on a given tile, then N<sub>s</sub>ubpackages-on-tile <sup>=</sup> 1 / 'the term ((j + 1 mod Nblock) mod
Npackets-in-tile) πη equation (3) is equal to 0 for all values of jei, and the same subpackage with index i<sub>TILE</sub> is mapped across all tile jump doors and OFDM symbol periods.
Multiple subpackage mapping designs on tiles have been described above. The t subpackages can also be mapped in the N<sub>TILES</sub> tiles and transmission units in other ways based on other equations, in order to obtain one or more of the mapping characteristics' described above.
17/27
Figure 6 shows a drawing of the processing at the receiver. The receiver can obtain received symbols for all N<sub>TILES</sub> tiles used for packets sent by the transmitter. A 610 detector / demodulator can perform detection / demodulation for each tile based on the symbols received on that tile. For example, detector / demodulator 610 can derive a channel estimate based on the received pilot symbols and then detect the received data symbols based on the channel estimate in order to obtain detected symbols for the tile. Detector 610 can store the detected symbols for each tile in a respective section of a 620 tile buffer.
An RX 630 data processor can perform decoding for each subpackage whenever all the tiles for that subpackage have been demodulated. The RX 630 data processor can retrieve the detected symbols for a subpackage from the appropriate sections of the 620 tile buffer and can process the detected symbols to obtain a corresponding decoded subpackage. Detector 610 can perform detection on a tile-by-tile basis, and the RX 630 data processor can perform decoding on a sub-package basis by sub-package.
The tile buffer 620 can provide the decoupling of the functioning of the detector 610 and the data processor RX 630 and can also provide the channeling of these two units. Detector 610 can perform detection for all tiles used for subpackage 0 and store the detected symbols in the tile buffer 620. The RX 63 0 data processor can then decode for subpackage 0, while detector 610 performs detection for the remaining tiles used for subpackage 1. Channeling can continue until all
18/27
Ntiles tiles have been detected and all subpackages have been decoded.
The techniques described here can be used for traffic data, signaling, erasure sequences, etc. Signaling is also referred to as control information, control data, overhead data, etc. An erasure sequence is a sequence transmitted on a channel to retain it in the absence of data. The techniques can also be used for unicast data sent to a specific receiver, multicast data sent to a group of receivers and broadcast data sent to all receivers. The techniques can be used for a direct link data channel, a reverse link data channel, a broadcast channel, a multicast channel, a superimposed channel, etc. Unicast data can be sent on a broadcast segment on the superimposed channel.
The techniques can also be used for transmitting multiple inputs and outputs (MIMO) from multiple antennas on the transmitter to multiple antennas on the receiver as well as for non-MIMO transmissions. Only one
<td>symbol of</td><td>modulation</td><td>Can be</td><td>Sent</td><td>in one unit</td><td>in</td>
<td>streaming</td><td colspan="2">in one layer to</td><td colspan="3">a non-MIMO transmission.</td>
<td colspan="2">Multiple symbols of</td><td>modulation</td><td>can</td><td>be sent in</td><td>an</td>
<td>unity of</td><td colspan="2">transmission in</td><td>various</td><td>layers for</td><td>an</td>
<td>streaming</td><td>MIMO. In</td><td>general,</td><td>one or</td><td>more symbols</td><td>in</td>
<td>modulation</td><td>can be</td><td>generated</td><td>for</td><td>each unit</td><td>in</td>
<td>streaming</td><td>(or each</td><td>door of</td><td>jump</td><td>of each period</td><td>in</td>
OFDM symbols) based on the subpackage mapped to that transmission unit. A sufficient number of bits in the subpackage can be used to generate the desired number of modulation symbols.
19/27
Figure 7 shows a block diagram of a drawing of base station 110 and terminal 120 of Figure 1. In this drawing, base station 110 is equipped with S antennas from 724a to 724 s, and the terminal is equipped with T antennas from 752a to 752t, where in general S> 1 and T> 1.
On the direct link, at base station 110, a TX 710 data processor can receive a data packet to terminal 120 from a data source 0880 and can partition the packet into multiple subpackages. The TX 710 data processor can then process (encode, merge and map into symbols) each subpackage in order to obtain a corresponding output subpackage and can map the multiple output subpackages on the tiles assigned for transmitting the packet. A MIMO TX 720 processor can multiplex the modulation symbols in the output subpackages with pilot symbols, perform direct MIMO mapping or pre-coding / beam formation if applicable and send S output symbol streams to S transmitters (TMTR) 722a a 722s. Each transmitter 722 can process its output symbol stream (for OFDM, for example) in order to obtain an output chip stream. Each 722 transmitter can also condition (convert to analog, filter, amplify and convert upwards) its output chip chain and generate a direct link signal. Direct link signals from transmitters 722a to 722s can be transmitted from S antennas 724a to 724s, respectively.
At terminal 120, T antennas 752a to 752t can receive direct link signals from base station 110, and each antenna 752 can send a received signal to a respective receiver (RCVR) 754. Each receiver 754 can condition (filter, amplify, effect downward conversion and digitize, for example) your received signal<sup>:</sup>
20/27 in order to obtain samples, process the samples (for OFDM, for example) in order to obtain received symbols and send the received symbols to a MIMO 756 detector. The MIMO 756 detector can perform MIMO detection on received symbols, if applicable , and generate detected symbols for the assigned tiles. An RX 760 data processor can demap the subpackages of the assigned tiles, process (demap symbols, interleave and decode, for example) each subpackage and send a decoded package to a 762 data warehouse. In general, processing by the MIMO 756 detector and by the RX 760 data processor it is complementary to the processing by the MIMO TX 720 processor and by the TX 710 data processor at the base station 110.
On the reverse link, at terminal 120, a TX 780 data processor can receive a package from data source 778, partition the package into subpackages, process each subpackage to obtain an outbound subpackage and map the outbound subpackages to the package in tiles assigned for transmitting the package. The output subpackages of the TX 780 data processor can be multiplexed with pilot symbols and spatially processed by a MIMO TX 782 processor and also processed by transmitters 754a to 754t in order to obtain T reverse link signals, which can be transmitted through antennas 752a to 752t. At base station 110, the reverse link signals from terminal 120 can be received by antennas 724a to 724s, processed by receivers 722a to 722s, detected by a MIMO detector 737 and also processed by an RX 740 data processor to retrieve the transmitted packet through terminal 120.
730 and 770 controllers / processors can guide operation on base station 110 and terminal
120, respectively. Memories 732 and 772 can be stored
21/27 data and program codes for base station 110 and terminal 120, respectively. A programmer 734 can program terminal 120 for data transmission on the direct link and / or the direct link and can assign resources, such as, for example, tiles, for data transmission.
Figure 8 shows a block diagram of a TX 710 data processor design, which can also be used for data processor 780 in Figure 7. Within the TX 710 data processor, a packet partitioning unit 810 can receive a package for transmission, partition the package into t subpackages, as shown in equation (2), for example, and send the t subpackages to processing sections 820a through 820 t.
Within processing section 820a for subpackage 0, a CRC generator 822 can generate a CRC for the subpackage and generate a subpackage formatted with the CRC attached to the subpackage. An early error correction (FEC) encoder 824 can receive the formatted subpackage, encode the subpackage according to an FEC code and generate an encoded subpackage. The FEC code can comprise a Turbo code, a convolutional code, a low density parity check code (LDPC), a block code, etc. An 826 interleaver can interleave or reorder the bits in the encoded subpackage based on an interleaving scheme. A repeating unit 828 can repeat interleaver bits 826, if necessary, in order to obtain the desired total number of bits. A scrambler 830 can scramble the bits of unit 828 in order to make the data random. The 830 scrambler can generate a scramble sequence based on a linear feedback displacement recorder (LFSR), which can be initialized at the beginning of the subpackage with a seed value based on a
22/27
Terminal 120 MAC ID, a sector ID or pilot phase of a sector / server base station (a), a packet format index for the packet, a frame index of the first PHY frame into which the packet is sent and / or some other parameter. An 832 symbol mapper can map the scrambled bits into modulation symbols based on a selected modulation scheme, such as QPSK, 16-QAM, 64-QAM, etc. The 832 symbol mapper can generate a modulation symbol output subpackage. Each remaining processing section 820 can also process its subpackage and generate a corresponding output subpackage of modulation symbols.
A subpackage mapper on 840 tiles can receive all t subpackages from processing sections 820a to 820t. Mapper 840 can map each subpackage into all of a subset of the N<sub>TILES</sub> tiles assigned to the package. For each tile, the 840 mapper can determine at least one subpackage mapped to that tile and can map the modulation symbols in at least one subpackage in the jump doors and 'in the appropriate OFDM symbol periods on the tile, as shown in equation (3) and in the Figure. 5.
Figure 9 shows a block diagram of an RX 760 data processor design, which can also be used for the RX 740 data processor of Figure 7; Within the RX 760 data processor, a tile demapper in subpackages 910 can receive detected symbols' for the N<sub>TILES</sub> tiles used for a package, perform demapping of tiles in subpackages and send the detected symbols to the subpackages through processing sections 920a to 920t.
Within processing section 920a for 6th subpackage 0, a likelihood ratio (LLR) computing unit 922 can receive the symbols
23/27 detected for subpackage 0 and can compute LLRs for the code bits for this subpackage based on the detected symbols. The LLR for each code bit can indicate the probability that that code bit is zero ('0') or ('1') given the detected symbol for the code bit. A 924 scrambler can unscramble the LLRs based on the scramble sequence used for the subpackage. A 926 LLR combiner can combine LLRs for repeated code bits, which may have been sent in later HARQ transmissions. A deinterleaver 928 can deinterleave the LLRs of the 926 unit in a manner complementary to the interleaver by the interleaver 826 of Figure
8. An FEC 930 decoder can decode the interleaved LLRs according to an FEC code used for the subpackage and generate a decoded subpackage. A CRC 932 checker can check the decoded subpackage and generate decode condition for the subpackage. Each remaining 920 processing section can also process its subpackage and generate a corresponding decoded subpackage.
A multiplexer (Mux) 940 can assemble all t decoded subpackages from processing sections 920a to 920t and generate a decoded subpackage. In a drawing, an acknowledgment (ACK) can be sent for each subpackage decoded correctly. All subpackages can be confirmed together. Incorrectly decoded subpackages can be resent in a subsequent HARQ transmission.
Figure 10 shows a drawing of a process 1000 for transmitting data. Process 1000 can be performed by a transmitter, which can be a base station for a direct link transmission or a terminal for a reverse link transmission. Can be determined
24/27 resources allocated for transmission of a packet (block 1012). The package can be partitioned into multiple subpackages (block 1014). Each subpackage can be coded based on an FEC code in order to obtain a corresponding coded subpackage (block 1016). Multiple coded subpackages can be mapped to the assigned resources, with at least one coded subpackage being mapped to a subset of the assigned resources (block 1018).
Assigned resources can include multiple tiles. For block 1018, each subpackage can be mapped into (i) a different subset of the various tiles, (ii) a specific minimum number of tiles, (iii) all the various tiles if less than the specific minimum number of tiles, (iv) an equal number of tiles or (v) a combination of them. The multiple tiles can be arranged in a first group of a multiple integer number of t tiles and a second group of remaining tiles, where t is the number of subpackages. A subset of the t subpackages can be mapped on each tile in the first group, and all t subpackages can be mapped on each tile in the second group. For each tile, at least one subpackage mapped to that tile can be determined and can be distributed across the tile, for example, by passing through at least one subpackage and by mapping a subpackage on each transmission unit available on the tile.
. Figure 11 shows a drawing of equipment 1100 for transmitting data. The 1100 equipment includes devices to determine resources allocated for transmitting a package (module 1112), devices for partitioning the package into multiple subpackages (module 1114), devices for encoding each subpackage based on a
25/27 FEC code in order to obtain a corresponding coded subpackage (module 1116) and devices to map the multiple coded subpackages in the assigned resources, with at least one coded subpackage being mapped into a subset of the assigned resources (module 1118).
Figure 12 shows a drawing of a process 1200 for receiving data. Process 1200 can be performed by a receiver, which can be a terminal for direct link transmission or a base station for reverse link transmission. Resources allocated for transmitting a packet can be determined (block 1212). Multiple subpackages of the package can be received via the assigned resources (block 1214). Multiple subpackages can be demapped from assigned resources, with at least one subpackage being demapped from a subset of assigned resources (block 1216). Multiple subpackages can be processed after demapping in order to recover the package (block 1218).
Assigned resources can include multiple tiles. For block 1216, each subpackage can be demapped from (i) a different subset of the various tiles, (ii) a specific minimum number of tiles, (iii) all the various tiles if less than the specific minimum number of tiles, (iv) an equal number of tiles or (v) a combination of them. For each tile, at least one subpackage mapped to that tile can be determined and can be demapped from across the tile.
For block 1218, demodulation can be done for each tile on a tile-by-tile basis. Decoding can be performed for each subpackage when all the tiles on which the subpackage is mapped have been demodulated, without waiting for demodulation of all assigned tiles. Each subpackage can be decoded with
26/27 based on an FEC code in order to obtain a corresponding decoded subpackage.
Figure 13 shows a drawing of a 1300 device for receiving data. 0 equipment 1300 includes devices for determining the resources allocated for transmitting a package (module 1312), devices for receiving subpackages of the package via the allocated resources (module 1314), devices for mapping the multiple subpackages of the assigned resources, with at least one subpackage being demapped from a subset of the assigned resources (module 1316) and devices for processing multiple subpackages after demapping with a view to retrieving the package (module 1318).
The modules in Figures 11 and 13 can comprise processors, electronic devices, hardware devices, electronic components, logic circuits, memories, etc., or any combination of them.
The techniques described here can be implemented by several devices. For example, these techniques can be implemented in hardware, firmware, software or a combination of them. For a hardware implementation, the processing units used to perform the techniques on an entity (a base station or a terminal, for example) can be implemented within one or more application-specific integrated circuits (ASICs), digital signal processors (DSPs), digital signal processing devices (DSPDs), processors, controllers, microcontrollers, microprocessors, electronic devices, other electronic units designed to perform the functions described here or a combination of them.
For a firmware and / or software implementation, the techniques can be implemented with code (such as, for example,
27/27 example, procedures, functions, modules, instructions, etc.) that perform the functions described here. In general, any medium that can be read by a machine / computer / processor that tangibly embodies instructions / firmware code and / or software can be used to implement the techniques described here. For example, the firmware and / or software code can be stored in memory (memory 732 or 772 in Figure 2) and executed by a processor (the 730 or 770 processor, for example). The memory can be implemented inside the processor or outside the processor. 0 firmware and / or software code can also be stored on a computer / processor readable medium, such as random access memory (RAM), read-only memory (ROM), non-volatile random access memory (NVRAM), programmable read-only memory (PROM), electrically erasable PROM (EEPROM), FLASH memory, floppy disk, compact disk (CD), digital versatile disk (DVD), magnetic or optical data storage device, etc. The code can be executed by one or more computers / processors and can cause the computer (s) / processor (s) to execute certain aspects of the functionality described here.
The previous description of the disclosure is presented to allow anyone skilled in the art to manufacture or use the disclosure. Several changes in the disclosure will be readily apparent to those skilled in the art, and the generic principles defined herein can be applied to other variations without abandoning the spirit or scope of the disclosure. Thus, the disclosure is not intended to be limited to the examples and drawings described here, but should receive the widest range compatible with the principles and unpublished aspects disclosed here.
Contents5
12 sheets
Sheet 1 Sheet 2 Sheet 3 Sheet 4 Sheet 5 Sheet 6 Sheet 7 Sheet 8 Sheet 9 Sheet 10 Sheet 11 Sheet 12
124 members in 17 offices
Priority claims7
| Document | Office | Kind | Date |
|---|---|---|---|
| 60883758 | United States of America | – | |
| 60883702 | United States of America | – | |
| 88375807 | United States of America | P | |
| 88370207 | United States of America | P | |
| 11968631 | United States of America | – | |
| 96863108 | United States of America | A | |
| 2008050080 | United States of America | W |
Members124
| Document | Office | Kind | |
|---|---|---|---|
| US2008165743A1 | United States of America | A1 | |
| US2008165969A1 | United States of America | A1 | |
| US2008166969A1 | United States of America | A1 | |
| US2008167040A1 | United States of America | A1 | |
| AU2008205022A1 | Australia | A1 | |
| CA2672317A1 | Canada | A1 | |
| CA2673872A1 | Canada | A1 | |
| CA2673873A1 | Canada | A1 | |
| CA2674616A1 | Canada | A1 | |
| CA2674617A1 | Canada | A1 | |
| WO2008086074A1 | World Intellectual Property Organization (WIPO) | A1 | |
| WO2008086143A1 | World Intellectual Property Organization (WIPO) | A1 | |
| WO2008086149A2 | World Intellectual Property Organization (WIPO) | A2 | |
| WO2008086163A2 | World Intellectual Property Organization (WIPO) | A2 | |
| WO2008086244A1 | World Intellectual Property Organization (WIPO) | A1 | |
| WO2008086244A1 | World Intellectual Property Organization (WIPO) | A1 | |
| TW200838173A | Taiwan Province of China | A | |
| TW200838236A | Taiwan Province of China | A | |
| US2008240159A1 | United States of America | A1 | |
| WO2008086149A3 | World Intellectual Property Organization (WIPO) | A3 | |
| TW200843386A | Taiwan Province of China | A | |
| WO2008086163A3 | World Intellectual Property Organization (WIPO) | A3 | |
| TW200845619A | Taiwan Province of China | A | |
| TW200845658A | Taiwan Province of China | A | |
| MX2009007039A | Mexico | A | |
| EP2100383A2 | European Patent Office (EPO) | A2 | |
| EP2100472A2 | European Patent Office (EPO) | A2 | |
| KR20090101279A | Republic of Korea | A | |
| KR20090106408A | Republic of Korea | A | |
| KR20090106593A | Republic of Korea | A | |
| KR20090106593A | Republic of Korea | A | |
| KR20090106594A | Republic of Korea | A | |
| KR20090107524A | Republic of Korea | A | |
| CN101578772A | China | A | |
| CN101578775A | China | A | |
| CN101578800A | China | A | |
| CN101578902A | China | A | |
| EP2115888A1 | European Patent Office (EPO) | A1 | |
| CN101589582A | China | A | |
| EP2122877A1 | European Patent Office (EPO) | A1 | |
| EP2122930A1 | European Patent Office (EPO) | A1 | |
| JP2010516109A | Japan | A | |
| JP2010516113A | Japan | A | |
| JP2010516114A | Japan | A | |
| JP2010516115A | Japan | A | |
| JP2010516121A | Japan | A | |
| HK1137265A | Hong Kong, China | A | |
| HK1137265A1 | Hong Kong, China | A1 | |
| RU2009129699A | Russian Federation | A | |
| RU2009129702A | Russian Federation | A | |
| RU2009129951A | Russian Federation | A | |
| RU2009129959A | Russian Federation | A | |
| RU2414051C1 | Russian Federation | C1 | |
| RU2420877C2 | Russian Federation | C2 | |
| AU2008205022B2 | Australia | B2 | |
| RU2427965C2 | Russian Federation | C2 | |
| BRPI0806293A2 | Brazil | A2 | |
| BRPI0806294A2 | Brazil | A2 | |
| BRPI0806295A2 | Brazil | A2 | |
| BRPI0806298A2 | Brazil | A2 | |
| BRPI0806485A2This record | Brazil | A2 | |
| RU2430491C2 | Russian Federation | C2 | |
| RU2433554C2 | Russian Federation | C2 | |
| KR101084390B1 | Republic of Korea | B1 | |
| KR101084390B1 | Republic of Korea | B1 | |
| KR101107897B1 | Republic of Korea | B1 | |
| EP2426848A2 | European Patent Office (EPO) | A2 | |
| KR101115071B1 | Republic of Korea | B1 | |
| CN101578902B | China | B | |
| UA98635C2 | Ukraine | C2 | |
| KR101162993B1 | Republic of Korea | B1 | |
| RU2011106281A | Russian Federation | A | |
| CA2672317C | Canada | C | |
| US2012218943A1 | United States of America | A1 | |
| JP5021763B2 | Japan | B2 | |
| TWI374618B | Taiwan Province of China | B | |
| JP5048788B2 | Japan | B2 | |
| JP2012199942A | Japan | A | |
| KR101194434B1 | Republic of Korea | B1 | |
| US8305999B2 | United States of America | B2 | |
| TWI377816B | Taiwan Province of China | B | |
| US8320407B2 | United States of America | B2 | |
| EP2426848A3 | European Patent Office (EPO) | A3 | |
| TWI381667B | Taiwan Province of China | B | |
| JP2013009374A | Japan | A | |
| CN101589582B | China | B | |
| EP2115888B1 | European Patent Office (EPO) | B1 | |
| US8433357B2 | United States of America | B2 | |
| ES2404672T3 | Spain | T3 | |
| US8457315B2 | United States of America | B2 | |
| CN101578800B | China | B | |
| TW201330524A | Taiwan Province of China | A | |
| JP5248522B2 | Japan | B2 | |
| US2013215760A1 | United States of America | A1 | |
| CN101578775B | China | B | |
| JP2013179608A | Japan | A | |
| US2013243039A1 | United States of America | A1 | |
| CN103441812A | China | A | |
| TWI422175B | Taiwan Province of China | B | |
| JP5425965B2 | Japan | B2 |
4 legal events, as the office reported them to INPADOC
Over the term
Point at a mark for the eventEvents
| Event | Code | |
|---|---|---|
| Others concerning applications: alteration of classificationB15K | B15K | |
| Others concerning applications: alteration of classificationPROCEDIMENTO AUTOMATICO DE RECLASSIFICACAO. A CLASSIFICACAO IPC ANTERIOR ERA H04L 12/56.B15K | B15K | |
| Patent lapsed as no evidence of payment of the annual fee has been furnished to inpi [chapter 8.11 patent gazette]LapsedB08K | B08K | |
| Application dismissed because of non-payment of annual fees [chapter 8.6 patent gazette]REFERENTE A 9A ANUIDADE.B08F | B08F |
Numbers
- Publication
- PI0806485
- Application
- 8064857
Titles2
- Portuguese
- MAPEAMENTO DE SUBPACOTES EM RECURSOS EM UM SISTEMA DE COMUNICAÇÃO
- English
- MAPPING SUBPACKAGES IN RESOURCES IN A COMMUNICATION SYSTEM
Classification
- CPC, 5
- H04L47/15
- H04L5/0044
- H04L47/70
- H04L5/0007
- H04L1/004
- IPC, 3
- H04L12 56
- H04L1 00
- H04L47 70