Control resource mapping for a wireless communication system
Abstract
CONTROL RESOURCE MAPPING FOR A WIRELESS COMMUNICATION SYSTEM. Techniques for sending control information in a wireless communication system are described. A control segment can include tiles, and each tile can include a number of transmission units. A number of control resources can be defined and mapped to the transmission units for the control segment. For symmetric mapping, multiple sets of control resources can be formed, and each batch of L consecutive sets of S control resources can be mapped to S transmission units at the same location on the L tiles. For localized mapping, each set of S control resources can be mapped to a cluster of adjacent S transmission units on a tile. For distributed mapping, each control feature can be mapped to a transmission unit on a tile. For diversity, each control resource can be mapped to multiple (for example, three) transmission units on at least one tile.
Term
1.3 yearsleft in the term
Expires 4 January 2028.
- Priority
- Filed
- Granted
- Today
- Expires
47 claims: 7 independent, 40 dependent
- 1REIVINDICAÇÕES 1. Um equipamento para comunicação sem fio, compreendendo:pelo menos um processador configurado para determinar um índice h de tile e um índice r de unidade de transmissão para um índice R de recurso de controle, e para mapear um recurso de controle com índice R para uma unidade de transmissão com índice r em um tile com índice h, o recurso de controle sendo um dentre uma pluralidade de recursos de controle para um segmento de controle compreendendo L tiles, onde L é um ou mais, e cada tile compreendendo uma pluralidade de unidades de transmissão;e uma memória acoplada a pelo menos um processador.
- 20 equipamento, de acordo com a reivindicação 1, em que o pelo menos um processador é configurado para determinar o índice h de tile e um índice r de unidade de transmissão para o índice R de recurso de controle com base em um esquema de mapeamento que distribui a pluralidade de recursos de controle através dos L tiles para qualquer valor de L.
- 30 equipamento, de acordo com a reivindicação 1, em que o pelo menos um processador é configurado para formar múltiplos conjuntos de S recursos de controle para uma pluralidade de recursos de controle, onde S é um ou mais, e para mapear cada batelada de L conjuntos consecutivos de S recursos de controle para S unidades de transmissão na mesma localização nos L tiles.
- 4O equipamento, de acordo com a reivindicação 1, em que o pelo menos um processador é configurado para formar múltiplos conjuntos de S recursos de controle para umà pluralidade de recursos de controle, onde S é maior do que um, e para mapear cada conjunto de S recursos de controle para um cluster de S unidades de transmissão 2/12 adjacentes em cada um de pelo menos um tile entre os L tiles.
- 5O equipamento, de acordo com a reivindicação 4, em que o pelo menos um processador é configurado para atravessar através dos múltiplos conjuntos de S recursos de controle, e para mapear cada conjunto de S recursos de controle para pelo menos um tile determinado realizando ciclo através dos L tiles.
- 6O equipamento, de acordo com a reivindicação 1, em que o pelo menos um processador é configurado para formar múltiplos conjuntos de quatro recursos de controle para uma pluralidade de recursos de controle, e para mapear cada conjunto de quatro recursos de controle para quatro unidades de transmissão adjacentes em cada um de pelo menos um tile entre os L tiles.
- 7O equipamento, de acordo com a reivindicação 1, em que o pelo menos um processador é configurado para atravessar através da pluralidade de recursos de controle, e para mapear cada recurso de controle para pelo menos um tile determinado realizando ciclo através dos L tiles.
- 8O equipamento, de acordo com a reivindicação 1, em que o pelo menos um processador é configurado para mapear o recurso de controle com índice R para múltiplas unidades de transmissão em pelo menos um tile entre os L tiles para obter diversidade para o recurso de controle, as múltiplas unidades de transmissão compreendendo uma unidade de transmissão com índice r no tile com índice h.
- 9O equipamento, de acordo com a reivindicação 8, em que o pelo menos um processador é configurado para mapear o recurso de controle com índice R para as múltiplas unidades de transmissão em diferentes localizações do pelo menos um tile. 3/12
- 10O equipamento, de acordo com a reivindicação 1, em que o pelo menos um processador é configurado para mapear o recurso de controle com índice R para três unidades de transmissão em pelo menos um tile entre os L tiles para obter diversidade de terceira ordem para o recurso de controle, as três unidades de transmissão compreendendo uma unidade de transmissão com índice r no tile com índice h.
- 11O equipamento, de acordo com a reivindicação 10, em que o pelo menos um processador é configurado para determinar índices das três unidades de transmissão no pelo menos um tile com base em um índice r de unidade de transmissão.
- 12O equipamento, de acordo com a reivindicação 10, em que as três unidades de transmissão estão em três diferentes Tiles quando L é igual para três ou maior.
- 13O equipamento, de acordo com a reivindicação 1, em que cada tile é associado com múltiplos segmentos de tile, cada segmento de tile incluindo um diferente subconjunto da pluralidade de unidades de transmissão no tile, e em que o pelo menos um processador é configurado para mapear o recurso de controle com índice R para uma unidade de transmissão em cada um dos múltiplos segmentos de tile para pelo menos um tile entre os L tiles.
- 14O equipamento, de acordo com a reivindicação 13, em que unidades de transmissão em cada segmento de tile têm índices pré-atribuídos.
- 15O equipamento, de acordo com a reivindicação 1, em que as unidades de transmissão disponíveis para uso em cada tile são atribuídos índices exclusivos, e em que o pelo menos um processador é configurado para mapear o recurso de controle com índice R para múltiplas unidades de transmissão com diferentes índices em pelo menos um tile 4/12 entre os L tiles, e para determinar os índices das múltiplas unidades de transmissão com base em um índice r de unidade de transmissão.
- 16O equipamento, de acordo com a reivindicação 15, em que os índices das múltiplas unidades de transmissão são afastados por M, onde M é maior do que um e determinado com base em o número de unidades de transmissão disponíveis para uso em cada tile e o número de unidades de transmissão aos quais o recurso de controle é mapeado.
- 17O equipamento, de acordo com a reivindicação 1, em que o pelo menos um processador é configurado para enviar informações de controle via o recurso de controle para pelo menos um terminal.
- 18O equipamento, de acordo com a reivindicação 1, em que o pelo menos um processador é configurado para receber informações de controle via o recurso de controle a partir de uma estação base.
- 19O equipamento, de acordo com a reivindicação 1, em que o pelo menos um processador é configurado para atribuir a pluralidade de recursos de controle a uma pluralidade de canais de controle, um canal de controle por vez e em uma ordem predeterminada.
- 20Um método para comunicação sem fio, compreendendo:determinar um índice h de tile e um índice r de unidade de transmissão para um índice R de recurso de controle;e mapear um recurso de controle com índice R para uma unidade de transmissão com índice r em um tile com índice h, o recurso de controle sendo um dentre uma pluralidade de recursos de controle para um segmento de controle compreendendo L tiles, onde L é um ou mais, e cada 5/12 tile compreendendo uma pluralidade de unidades de transmissão.
- 210 método, de acordo com a reivindicação 20, adicionalmente compreendendo:formar múltiplos conjuntos de S recursos de controle para uma pluralidade de recursos de controle, onde S é um ou mais;e mapear cada batelada de L conjuntos consecutivos de S recursos de controle para S unidades de transmissão na mesma localização nos L tiles.
- 22O método, de acordo com a reivindicação 20, adicionalmente compreendendo:formar múltiplos conjuntos de S recursos de controle para uma pluralidade de recursos de controle, onde S é maior do que um;e mapear cada conjunto de S recursos de controle para um cluster de S unidades de transmissão adjacentes em cada um de pelo menos um tile entre os L tiles.
- 23O método, de acordo com a reivindicação 20, adicionalmente compreendendo:formar múltiplos conjuntos de S recursos de controle para uma pluralidade de recursos de controle, onde S é um ou mais;atravessar através dos múltiplosconjuntos de S recursos de controle;e mapear cada conjunto de S recursos de controle para pelo menos um tile determinado realizando ciclo através dós L tiles.
- 24O método, de acordo com a reivindicação 20, adicionalmente compreendendo:mapear o recurso de controle com índice R para múltiplas unidades de transmissão em pelo menos um tile entre os L tiles para obter diversidade para o recurso de 6/12 controle, as múltiplas unidades de transmissão compreendendo uma unidade de transmissão com índice r no tile com índice h.
- 25O método, de acordo com a reivindicação 20, adicionalmente compreendendo:atribuir a pluralidade de recursos de controle to uma pluralidade de canais de controle, um canal de controle por vez e em uma ordem predeterminada.
- 26Um equipamento para comunicação sem fio, compreendendo:índice R para uma unidade de transmissão com índice r em um tile com índice h, o recurso de controle sendo um dentre uma pluralidade de recursos de controle para um segmento de controle compreendendo L tiles, onde L é um ou mais, e cada tile compreendendo uma pluralidade de unidades de transmissão.
- 27O equipamento, de acordo com a reivindicação 26, adicionalmente compreendendo:meios para formar múltiplos conjuntos de S recursos de controle para uma pluralidade de recursos de controle, onde S é um ou mais;e meios para mapear cada batelada de L conjuntos consecutivos de S recursos de controle para S unidades de transmissão na mesma localização nos L tiles.
- 28Ó equipamento, de acordo com a reivindicação 26, adicionalmente compreendendo:meios para formar múltiplos conjuntos de S recursos de controle para uma pluralidade de recursos de controle, onde S é maior do que um;e 7/12 meios para mapear cada conjunto de S recursos de controle para um cluster de S unidades de transmissão adjacentes em cada um de pelo menos um tile entre os L tiles.
- 29O equipamento, de acordo com a reivindicação 26, adicionalmente compreendendo:meios para formar múltiplos conjuntos de S recursos de controle para uma pluralidade de recursos de controle, onde S é um ou mais;meios para atravessar através dos múltiplos conjuntos de S recursos de controle;e meios para mapear cada conjunto de S recursos de controle para pelo menos um tile determinado realizando ciclo através dos L tiles.
- 30O equipamento, de acordo com a reivindicação 26, adicionalmente compreendendo:meios para mapear o recurso de controle com índice R para múltiplas unidades de transmissão em pelo menos um tile entre os L tiles para obter diversidade para o recurso de controle, as múltiplas unidades de transmissão compreendendo uma unidade de transmissão com índice r no tile com índice h.
- 31O equipamento, de acordo com a reivindicação 26, adicionalmente compreendendo:meios for atribuir a pluralidade de recursos de controle para uma pluralidade de canais de controle, um canal dè controle por vez e em uma ordem predeterminada.
- 32Um produto de programa de computador compreendendo:um meio legível por computador compreendendo: código para fazer com que pelo menos um computador determine um índice h de tile e um índice r de unidade de transmissão para um índice R de recurso de controle;e r 8/12 código para fazer com que pelo menos um computador mapeie um recurso de controle com índice R para uma unidade de transmissão com índice r em um tile com índice h, o recurso de controle sendo um dentre uma pluralidade de recursos de controle para um segmento de controle compreendendo L tiles, onde L é um ou mais, e cada tile compreendendo uma pluralidade de unidades de transmissão.
- 33Um equipamento para comunicação sem fio, compreendendo:pelo menos um processador configurado para determinar unidades de transmissão disponíveis para um canal de controle dentre todas as unidades de transmissão para um segmento de controle no qual o canal de controle é enviado e excluir unidades de transmissão não disponíveis para o canal de controle, para determinar um conjunto de unidades de transmissão para um pacote dentre as unidades de transmissão disponíveis para o canal de controle, e para enviar ou receber o pacote via o conjunto de unidades de transmissão;e uma memória acoplada a pelo menos um processador.
- 340 equipamento, de acordo com a reivindicação 33, em que o conjunto de unidades de transmissão para o pacote é distribuído por todas as unidades de transmissão disponíveis para o canal de controle.
- 350 equipamento, de acordo com a reivindicação 33, em que as unidades de transmissão não disponíveis para o canal de controle compreendem unidades de transmissão usadas para piloto, outros canais de controle, outras transmissões, ou uma combinação dos mesmos.
- 360 equipamento, de acordo com a reivindicação 33, em que o segmento de controle compreende pelo menos um 9/12 tile, cada tile compreendendo uma pluralidade de unidades de transmissão.
- 37O equipamento, de acordo com a reivindicação 36, em que pelo menos um tile tem o mesmo padrão de unidades de transmissão não disponíveis.
- 38O equipamento, de acordo com a reivindicação 36, em que o pelo menos um processador é configurado para atravessar através da pluralidade de unidades de transmissão em cada tile, e para atribuir cada unidade de transmissão para um pacote entre múltiplos pacotes para o canal de controle, o um pacote sendo determinado realizando ciclos através dos múltiplos pacotes.
- 39O equipamento, de acordo com a reivindicação 36, em que o pelo menos um processador é configurado para determinar unidades de transmissão em cada tile ao qual o pacote é mapeado, e para determinar o conjunto de unidades de transmissão para o pacote dentre as unidades de transmissão no pelo menos um tile ao qual o pacote é mapeado e excluir as unidades de transmissão não disponíveis para o canal de controle.
- 40O equipamento, de acordo com a reivindicação 33, em que o segmento de controle compreende uma pluralidade de tiles, cada tile compreendendo uma pluralidade de unidades de transmissão, e em que o conjunto de unidades de transmissão para o pacote está em um subconjunto da pluralidade de tiles.
- 41O equipamento, de acordo com a reivindicação 33, em que o segmento de controle compreende três tiles para cada um de pelo menos um segmento, cada tile compreendendo uma pluralidade de unidades de transmissão, e em que o conjunto de unidades de transmissão para o pacote está em três tiles para um segmento. 10/12
- 42Um método para comunicação sem fio, compreendendo:determinar unidades de transmissão disponíveis para um canal de controle dentre todas as unidades de transmissão para um segmento de controle no qual o canal de controle é enviado e excluir unidades de transmissão não disponíveis para o canal de controle;determinar um conjunto de unidades de transmissão para um pacote dentre as unidades de transmissão disponíveis para o canal de controle;e enviar ou receber o pacote via o conjunto de unidades de transmissão.
- 43O método, de acordo com a reivindicação 42, em que o segmento' de controle compreende pelo menos um tile, cada tile compreendendo uma pluralidade de unidades de transmissão, e em que o método adicionalmente compreende:atravessar através da pluralidade de unidades de transmissão em cada tile;e atribuir cada unidade de transmissão to um pacote entre múltiplos pacotes para o canal de controle, o um pacote sendo determinado realizando ciclos através dos múltiplos pacotes.
- 440 método, de acordo com a reivindicação 42, em que o segmento de controle compreende pelo menos um tile, cada tile compreendendo uma pluralidade de unidades de transmissão, e em que o método adicionalmente compreende:determinar unidades de transmissão em cada tile ao qual o pacote é mapeado;e determinar o conjunto de unidades de transmissão para o pacote dentre as unidades de transmissão no pelo menos um tile ao qual o pacote é mapeado e excluindo as 11/12 unidades de transmissão não disponíveis para o canal de controle.
- 45Um equipamento para comunicação sem fio, compreendendo:meios para determinar unidades de transmissão disponíveis para um canal de controle dentre todas as unidades de transmissão para um segmento de controle no qual o canal de controle é enviado e excluir unidades de transmissão não disponíveis para o canal de controle;meios para determinar um conjunto de unidades de transmissão para um pacote dentre as unidades de transmissão disponíveis para o canal de controle;e meios para enviar ou receber o pacote via o conjunto de unidades de transmissão.
- 46O equipamento, de acordo com a reivindicação 45, em que o segmento de controle compreende pelo menos um tile, cada tile compreendendo uma pluralidade de unidades de transmissão, e em que o equipamento adicionalmente compreende:meios para atravessar através da pluralidade de unidades de transmissão em cada tile;e meios for atribuir cada unidade de transmissão para um pacote entre múltiplos pacotes para o canal de controle, o um pacote sendo determinado realizando ciclos através dos múltiplos pacotes.
- 47O equipamento, de acordo com a reivindicação 45, em que o segmento de controle compreende pelo menos um tile, cada tile compreendendo uma pluralidade de unidades de transmissão, e em que o equipamento adicionalmente compreende:meios para determinar unidades de transmissão em cada tile ao qual o pacote é mapeado;e 12/12 meios para determinar o conjunto de unidades de transmissão para o pacote dentre as unidades de transmissão no pelo menos um tile ao qual o pacote é mapeado e excluir as unidades de transmissão não disponíveis para o canal de 5 controle. 1/13
Independent claims47
250 paragraphs in 17 sections, as filed
(54) Title: CONTROL RESOURCE MAPPING FOR A WIRELESS COMMUNICATION SYSTEM (30) Unionist Priority: 02/01/2008 us 11 / 968,642, 01/04/2007 US 60 / 883,387, 01/05/2007 US 60 / 883,758 (73) Holder (s): Qualcomm Incorporated (72) Inventor (s): Aamod Khandekar, Aleixei Gorokhov, Naga Bhushan, Ravi Palanki, Sandip Sarkar (74) Attorney (s): Montaury Pimenta, Machado & Lioce (86 ) International Order: pct us2008050187 of 04/01/2008 (57) Summary: control feature mapping FOR A WIRELESS COMMUNICATION SYSTEM. Techniques for sending control information in a wireless communication system are described. A control segment can include files, and each tile can include a number of transmission units. A number of control resources can be defined and mapped to the transmission units for the control segment. For symmetric mapping, multiple sets of control resources can be formed, and each batch of L consecutive sets of S control resources can be mapped to S transmission units at the same location in the L files. For localized mapping, each set of S control resources can be mapped to a cluster of adjacent S transmission units on a tile. For distributed mapping, each control feature can be mapped to a transmission unit on a tile. For diversity, each control resource can be mapped to multiple (for example, three) transmission units on at least one tile.
(87) International Publication: wo 2008 / 086i49de 17/07/2008
FLCS RESOURCE R INDEX
I
FLCS RESOURCE MAPPING
Γ
FLCS TILE h
<img file="BRPI0806294A2_D0001.tif" />
TILE SEGMENT TRANSMISSION UNIT R 0
UNIT H INDEX R DE
TILE FLCS STARTING SEGMENT TRANSMISSION
DE TILE
RESOURCE
R
FLCS
<img file="BRPI0806294A2_D0002.tif" />
TILE SEGMENT TRANSMISSION UNIT R 1
TILE 2 SEGMENT TRANSMISSION UNIT R
<img file="BRPI0806294A2_D0003.tif" />
ΡΙ0806294-3
CONTROL RESOURCE MAPPING FOR A WIRELESS COMMUNICATION SYSTEM
This order claims priority for Provisional US Order Serial No. 60 / 883,387, entitled METHOD AND APPARATUS FOR UTILIZING OTHER SECTOR INTERFERENCE (OSI) INDICATION, filed on January 4, 2007, and Provisional US Order Serial No. 60 / 883,758, entitled WIRELESS COMMUNICATION SYSTEM, filed on January 5, 2007, both assigned to the same assignee and incorporated here as a reference.
FUNDAMENTALS
I. Field
The present description refers generally to communication and, more specifically, to techniques for sending control information in a wireless communication system.
II. Foundations
Wireless communication systems are widely developed to provide various communication services such as voice, video, packet data, message exchange, broadcast, etc. These wireless systems can be multiple access systems capable of supporting multiple users by sharing available system resources. Examples of such multiple access systems include Code Division Multiple Access Systems (CDMA), Time Division Multiple Access Systems (TDMA), Frequency Division Multiple Access Systems (FDMA), Orthogonal Systems (FDMA) ( OFDMA), and FDMA Single Carrier Systems (SC-FDMA).
A wireless communication system can include many base stations that can support communication to many terminals on the forward and reverse links. The direct link (or downlink) refers to the communication link of the stations
2/38 base for the terminals, and the reverse link (or uplink) refers to the communication link from the terminals to the base stations. The system can use several control channels to support data transmission on the forward and reverse links. For example, a base station can transmit control information to allocate resources to terminals, to confirm packets received from the terminals, to inform the terminals of operating conditions at the base station, etc. the control information sent by the base station, although beneficial, represents overhead in the system.
SUMMARY
Techniques for using control features to send control information over a communication system are described here. A control segment can be used to send different control channels and can include L tiles, where L 1. Each tile can include a plurality of transmission units, and each transmission unit can correspond to (for example, it can be mapped) a subcarrier in a symbol period. A plurality of control features can be defined for the control segment and can be assigned to control channels for sending control information.
<td>In</td><td>one</td><td>aspect,</td><td>The</td><td>plurality of</td><td>resources of</td>
<td>control can</td><td>to be</td><td>mapped</td><td>for</td><td colspan="2">transmission units for</td>
<td>the segment</td><td>in</td><td>control</td><td>in</td><td>a way to</td><td>reach the</td>
<td>property</td><td colspan="3">climb to</td><td>the segment of</td><td>control,</td>
<td>diversity</td><td>for</td><td>each</td><td colspan="2">control feature,</td><td>mapping</td>
symmetrical of the plurality of control resources through the L tiles, localized mapping for the set of control resources, distributed mapping for the consecutive control resources, or any combination of these characteristics. In a mapping project
3/38 symmetrical, multiple sets of control resources S can be formed for the plurality of control resources, where S 1. Each batch of L consecutive sets of S control resources can be mapped to S transmission units at the same location in tiles L. in a localized mapping project, S □ 1, and each set of control S resources can be mapped to a group of adjacent S transmission units on a tile. In a distributed mapping project, S = 1, and consecutive control features can be mapped to different tiles. In a mapping project that can be used for both distributed and localized mappings, the multiple sets of S control resources can be crossed, where S> 1, and each set of S control resources can be mapped to S transmission units on a tile determined by cycling through L tiles. the first S control resources can map tile O, the next S control resources can map tile 1, etc. A balance between location versus diversity can be achieved by choosing an appropriate value of S. in a diversity project, each control resource can be mapped to multiple (for example, three) transmission units in different locations on at least one tile to obtain diversity for the control feature.
In a project, the tile index h and a transmission unit index r for a control resource index R can be determined based on a mapping scheme. A control resource with an R index can be mapped to a transmission unit with an R index on a tile with an h index. control information can be sent or received via the control resource.
In another aspect, transmission units available for a given control channel can be
4/38 determined among all transmission units for a control segment and can exclude transmission units for the control channel (for example, transmission units used for pilot, other control channels, and / or other transmissions). Multiple packets can be sent on the control channel in the control segment. Each packet can be mapped to a different set of transmission units, which can be distributed through the transmission units available to the control channel. In a project, the plurality of transmission units on each tile can be crossed, and each transmission unit can be assigned to a package cycling through multiple packages. Each packet can be sent via its set of transmission units.
Various aspects and characteristics of the description are described in further detail below.
BRIEF DESCRIPTION OF THE DRAWINGS
<td></td><td>THE</td><td>figure</td><td>1 illustrates a system of</td><td>communication without</td>
<td>thread.</td><td></td><td></td><td></td><td></td>
<td></td><td>THE</td><td>figure</td><td>2 illustrates a structure</td><td>superframe.</td>
<td></td><td>THE</td><td>figure</td><td>3 illustrates a structure</td><td>of tile.</td>
<td></td><td>THE</td><td>figure</td><td>4 illustrates a segment</td><td>control</td>
<td>link</td><td>direct</td><td colspan="2">(FL) (FLCS).</td><td></td>
<td></td><td>THE</td><td>figure</td><td>5 illustrates three segments</td><td>tile for one</td>
<td>tile</td><td>FLCS.</td><td></td><td></td><td></td>
<td></td><td>THE</td><td>figure</td><td>6 illustrates mapping of</td><td>an FLCS resource</td>
<td>for</td><td colspan="2">three units</td><td>transmission.</td><td></td>
Figure 7 illustrates localized mapping of FLCS resources.
Figure 8 illustrates an FLCS tile with available transmission units.
Figure 9 illustrates another mapping of an FLCS resource to three transmission units.
5/38
Figure 10 illustrates distributed mapping of FLCS resources.
Figure 11 illustrates the mapping of a package to transmission units.
Figure 12 illustrates a process for communicating control information.
Figure 13 illustrates equipment for communicating control information.
Figure 14 illustrates a process for changing a control package.
Figure 15 illustrates equipment to change a control package.
Figure 16 illustrates a block diagram of a base station and a terminal.
DETAILED DESCRIPTION
The techniques described here can be used for various wireless communication systems such as CDMA, TDMA, FDMA, OFDMA and SC-FDMA systems. The terms system and network are often used interchangeably. A CDMA system can implement rediotechnology such as cdma2000, Universal Terrestrial Radio Access (UTRA), etc. An OFDMA system can implement radiotechnology such as Ultra Mobile Broadband (UMB), Developed UTRA (E-UTRA), IEEE 802.16, IEEE 802.20, Flash-OFDM®, etc. UTRA and E-UTRA are described in a document from an organization called the 3rd Generation Partnership Project (3GPP). cdma2000 and UMB are described in an organization document called 3rd Generation 2 Partnership Project (3GPP2).
These various radio technologies and standards are known in the art. For clarity, certain aspects of the techniques are described below for UMB, and UMB terminology is used in many of the descriptions below. UMB is described in 3GPP2 C.S0084-001, entitled PHYSICAL LAYER FOR ULTRA MOBILE
6/38
BROADBAND (UMB) AIR INTERFACE SPECIFICATION, August 2007, which is publicly available.
FIG. 1 illustrates a wireless communication system 100, which can be referred to as an access network (AN). System 100 can include multiple base stations 110. A base station is a station that communicates with the terminals and can also be referred to as an access point, a Node B, a developed Node B 102. The term cell can refer to a base station and / or its coverage area depending on the context in which the term is used. To improve system capacity, a base station coverage area can be divided into multiple smaller areas, for example, three smaller areas 104a, 104b and 104c. Each smaller area can be served by a respective base station subsystem. The term sector can refer to the smallest coverage area of a base station and / or a base station subsystem that serves this coverage area.
Terminals 120 can be dispersed throughout the system, and each terminal can be stationary or mobile. A terminal can be referred to as an access terminal (AT), a mobile station, user equipment, a subscriber unit, a 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 corded phone, etc. A terminal can communicate with zero, one or multiple base stations on the forward and / or reverse link at any given time.
For a centralized architecture, a system controller 130 can couple with base stations 110 and provide coordination and control for those base stations. System controller 130 can be a single
7/38 network or a collection of network entities. For a distributed architecture, base stations can communicate with each other as needed.
FIG. 2 illustrates a superframe structure design 200 that can be used for the direct link. The transmission timeline can be divided into superframe units. Each superframe can measure a particular length of time, which can be fixed or configurable. Each superframe can include a preamble followed by Q physical layer frames (PHY), where Q can be any integer value. In one project, each superframe includes 25 PHY frames with indexes from 0 to 24. the superframe preamble can carry system information and acquisition pilots. Each PHY board can carry traffic data, control / signaling information, pilot, etc.
The time frequency features in each PHY frame can be divided into tiles. A tile can also be referred to as a temp frequency block, a resource block, etc. a tile can cover a particular frequency and time dimension, which can be fixed or configurable. In a project, a tile includes physical resources, for example, a block of subcarriers in one or more symbol periods. In another project, a tile includes logical resources that can be mapped to physical resources based on any mapping. In a project, a system bandwidth can be divided into multiple orthogonal subcarriers (K) with orthogonal frequency division multiplexing (OFDM). K-hoppers can be defined and can be mapped to K subcarriers based on a known mapping. Tiles can be defined based on subcarriers (which are physical resources) or heels (which are logical resources).
8/38
FIG. 3 illustrates a design of a tile 300. In this project, each PHY frame covers 8 periods of the OFDM symbol, and tile 300 covers 16 heels in 8 periods of the OFDM symbol and includes 128 transmission units. The 16 high doors for the tile can be mapped to 16 contiguous subcarriers or to 16 subcarriers distributed over all or a large part of the system's bandwidth. A transmission unit can correspond to a subcarrier in an OFDM symbol period and can be used to send a symbol, which can be a real or complex value. A transmission unit can also be referred to as a subcarrier symbol, a feature element, etc. Pilot symbols can be sent on the same transmission unit on the tile, and other symbols can be sent on the remaining transmission units on the tile. In the project illustrated in FIG. 3, the tile includes 18 transmission units for pilot symbols and 110 transmission units for other symbols.
Referring again to FIG. 2, each PHY frame includes T tiles with indexes 0 to Tl, where T can be dependent on the system bandwidth. The 16 tall gates on each tile can be mapped to contiguous subcarriers or to subcarriers distributed by the system's bandwidth.
The system can use a set of control channels to send different types of control information over the direct link. Table 1 lists an example set of control channels and provides a short description of each control channel. These control channels are described in detail in the aforementioned 3GPP2 C.S0084-001.
Table 1
9/38
<td>Symbol</td><td>Channel</td><td>description</td>
<td>F-ACKCH</td><td>Channel confirmation direct</td><td>Confirmation bit port (ACK) for packets received at the link reverse</td>
<td>F-SPCH</td><td>Direct start from package channel</td><td>Start indication port start signal packet new packages and / or to control resource assignments persistent.</td>
<td>F-RABCH</td><td>Bit channel activity direct reverse</td><td>Charging port on CDMA subscriptions at the link reverse.</td>
<td>F-PQICH</td><td>Indicator channel quality of direct pilot</td><td>Pilot intensity port received from link pilots reverse sent by terminals on the reverse link.</td>
<td>F-FOSICH</td><td>Channel interference from other sector fast direct</td><td>Level indication port interference observed in a sector coming from terminals in other sectors.</td>
<td>F-IOTCH</td><td>Interference direct about thermal channel</td><td>Level indication port interference observed in a sector.</td>
<td>F-PCCH</td><td>Channel Control of direct power</td><td>Port control commands power to adjust power terminal transmission.</td>
<td>F-SCCH</td><td>Channel control shared direct</td><td>Access concessions door, resource assignments, and other control information related to management of resource.</td>
In a project, control channels can be sent in an FL control segment in each PHY frame. The FL control segment can include a sufficient amount of resources, for example, a sufficient number
10/38 of tiles, to carry control information to all control channels.
FIG. 4 illustrates a design of a FL 400 control segment. In this project, the FL control segment includes a common segment and zero or more (K) link assignment block (LAB) segments with indexes from 0 to Kl. In the following description, the phrases element with index x and element x are used interchangeably, where element can refer to any quantity. The common segment can include L FLCS tiles with indexes from 0 to Ll, where L 1 and can be a configurable value. An FLCS tile is a tile used for the FL control segment. The K LAB segments can include 3 · K FLCS tiles, with each LAB segment including three FLCS tiles as illustrated in FIG. 4. The FL control segment can also be defined in other ways. In a project, the common segment carries all the control channels in table 1, possibly except for the F-SCCH. The F-SCCH can be sent in the K LAB segments if present or, otherwise, in the common segment.
In a project, the common segment can be divided into FLCS N resources<sub>F</sub>lcs FLCS resources, where N<sub>FLCS</sub> may be dependent on the number of FLCS Tiles for the common segment and possibly other factors. FLCS Resources are logical resources that can simplify the allocation and use of common segments. FLCS resources can be mapped to transmission units in the common segment in several ways. The resource mapping can be such that the common segment can achieve one or more of the following:
• Scalar property - the mapping of FLCS resources to transmission units on the L Tiles FLCS should scale promptly regardless of the number of FLCS Tiles,
11/38 • Diversity - each FLCS Resource can be mapped to multiple transmission units to achieve diversity for the FLCS Resource, • Symmetric mapping - L consecutive sets of S FLCS Resources can be mapped to the same location on the consecutive L Tiles FLCS before move to another location of the Tiles FLCS, where S 1, • Localized mapping - a set of multiple FLCS Resources can be mapped to adjacent transmission units into a Tile FLCS to observe similar channel response, • Distributed mapping - Consecutive FLCS resources can be mapped to different FLCS Tiles to observe channel response Random, and • Forgotten zone - FLCS Resources can be mapped to available transmission units and to avoid transmission units not available in a forgotten zone.
The above features can be achieved as described below.
In a project, third-order diversity can be achieved by mapping each FLCS resource to three transmission units on up to three different FLCS tiles. Other orders of diversity (for example, 2, 4, etc.) can also be obtained by mapping each FLCS resource to different numbers of transmission units. For clarity, many of the following transmissions assume FLCS Resource mapping to obtain third-order diversity.
In a first FLCS Resource mapping scheme, FLCS Resources are mapped to transmission units in the common segment in a way to achieve scalar ownership, third-order diversity, and location mapping. The first mapping scheme
12/38 Resource FLCS can also be referred to as a Block Resource Channel (BRCH) mapping scheme.
For the first FLCS resource mapping scheme, each Tile FLCS can be illustrated in FIG. 3 and can include 110 transmission units that can be used to send control information. If the common segment includes L Tiles FLCS as illustrated in FIG. 4, then the total number of FLCS Resources for the common segment can be given as:
N ^ <in> / 3jxL = 36> <. L, JfcSq (1) where LJ indicates an accessibility operator. At N<sub>FLC</sub>s FLCS resources can be assigned indexes from 0 to Nflcs “ΙΑ FIG. 5 illustrates a design of an FLCS Tile that can be used to support third-order diversity for the first FLCS resource mapping scheme. In this project, Tile FLCS is partitioned into three segments 0, 1 and 2. Each tile segment includes 36 transmission units to which FLCS Resources can be mapped. The 36 transmission units in each tile segment can be assigned indexes 0 to 35 based on a predetermined mapping. In the project illustrated in figure FIG. 5, transmission unit 0 in time segment 0 occupies 2 hops in the OFDM symbol period 0, transmission unit 0 in time segment 1 occupies 4 high gates in the OFDM symbol period 6, and transmission unit 0 in the segment tile 2 occupies 6 heels in the OFDM 0 symbol period. The other 35 transmission units in each time segment are illustrated in FIG. 5.
FIG. 6 illustrates mapping an FLCS resource to three transmission units to achieve diversity
13/38 third order for the first FLCS resource mapping scheme. In this project, an FLCS resource with an R index is mapped to three transmission units with an R index in all three tile segments 0, 1 and 2 of up to three consecutive FLCS tiles. A mapping unit 610 can receive the R index of the FLCS resource and can determine (i) an h index of the first FLCS tile for the FLCS resource and (ii) an r index of the transmission unit to which the FLCS resource is mapped. The FLCS R resource can then be mapped to transmission unit r on tile segment 0 of tile FLCS h, transmission unit r on tile segment 1 of tile FLCS h + 1, and transmission unit r on tile segment 2 of the FLCS h + 2 tile. For clarity, FIG. 6 illustrates three consecutive FLCS tiles being used for the FLCS R feature. The three FLCS tiles can also be cyclically restarted as described below.
In the project illustrated in FIG. 6, third-order diversity is achieved by mapping the FLCS resource to three transmission units in three different FLCS tiles when L 3. Furthermore, the FLCS resource is mapped to three different tile segments on the three FLCS tiles and thus occupies different locations of time frequency on the three FLCS tiles. The FLCS feature can observe both frequency diversity (due to mapping to three different heels) and time diversity (due to mapping to different OFDM Symbols).
The project illustrated in FIG. 6 can achieve third-order diversity regardless of the number of FLCS tiles used for the common segment. If L = 1, then the FLCS resource is mapped to three transmission units in three tile segments 0, 1 and 2 of a Tile FLCS. If L = 2, then the FLCS resource is mapped to three transmission units in tile segments 0 and 2 of a Tile FLCS and
14/38 in tile segment 1 of another Tile FLCS. If L á 3, then the FLCS resource is mapped to three transmission units in tile segments 0, 1 and 2 of three FLCS tiles.
In a project, localized mapping can be achieved by mapping four consecutive FLCS resources to a 2 x 2 cluster of four transmission units. Referring again to 5, four consecutive FLCS resources can be mapped to four adjacent transmission units 0 to 3 in the three tile segments, the next four consecutive FLCS resources can be mapped to four adjacent transmission units 4 to 7 in the three segments of tile, the next four consecutive FLCS resources can be mapped to four adjacent transmission units 8 to 11 in the three tile segments, etc. The wireless channel response can be assumed to be relatively static for each cluster of four transmission units. A value for a control channel can be sent in four consecutive FLCS resources and can then be mapped to a cluster of four adjacent transmission units in each tile segment. This value would then observe a relatively constant channel response for each cluster, which can improve demodulation performance. Transmission units 32 to 35 are in 1x2 clusters to make use of the remaining transmission units on the FLCS tile. Localized mapping can also be performed for other cluster sizes and formats, for example, 2x3 cluster, 3x3 cluster, etc.
For the first FLCS resource mapping scheme, the FLCS R resource can be mapped to three transmission units according to the following procedure. h = LR / 4jmodL.
1. To define
Eq (2)
15/38
2. Set r = 4xLR / (4L) J + {Rmod4),
3. For k = {0, 1, 2}
Eq (3)
The. Let p<sub>k</sub> = Fp (rj, where F<sup>k</sup>p () is a jump-door mapping function for the tile segment
k.
B. Let t<sub>k</sub> = F ^ (laughs), where F $ () is a
OFDM symbol mapping function for tile segment k.
ç. Let h<sub>k</sub> = (h + k) mod L. Eq (4)
d. The jump holder with pk index on the OFDM symbol with tk index on the FLCS tile with h index<sub>k</sub> is allocated to the FLCS resource with index R.
The above project has many desirable features, which are described in detail below.
For clarity, the following terms are used in describing this document. Crossing refers to going through a set of elements only once, for example, from the first element to the last element in the set. Cycling through refers to going through a set of elements several times, for example, from the first element to the last element in the set each time.
FIG. 7 illustrates the mapping of FLCS resources to different starting FLCS tiles for the first FLCS resource mapping scheme. Equation (2) cycles through N<sub>FLC</sub>s FLCS resources for the common segment and maps each set of four FLCS resources to a respective start FLCS tile, starting with Tile FLCS 0 and returning to Tile FLCS 0 after reaching Tile FLCS Ll. For the first FLCS 4L resources, FLCS resources 0 to 3 are mapped to the FLCS tile of start 0, FLCS resources 4 to 7 are mapped to the FLCS tile of start
16/38
<td>1, and so on, and</td><td>resources</td><td>FLCS</td><td>4L-4 a</td><td>4L-1 are</td>
<td colspan="2">mapped to start FLCS tile</td><td>Ll.</td><td>To the</td><td>Upcoming</td>
<td>FLCS 4L resources, Resources</td><td>FLCS 4L a</td><td>4L + 3</td><td colspan="2">are mapped to</td>
<td>tile FLCS of start 0,</td><td>Resources</td><td>FLCS</td><td>4L + 4 a</td><td>4L + 7 are</td>
<td>mapped to FLCS tile of</td><td>start 1,</td><td colspan="2">and so</td><td>forth, and</td>
FLCS resources 8L-4 to 8L-1 are mapped to FLCS tile beginning Ll. The mapping continues until all FLCS resources are mapped to appropriate FLCS tiles from the start. FLCS resources are mapped in sets of four to achieve localized mapping for each set of four FLCS resources (except for the latest FLCS 6L Resources, which are mapped to transmission units 32 to 35). The mapping in FIG. 7 is symmetric in that L consecutive sets of four FLCS resources are mapped to the same cluster of four transmission units in the L Tiles FLCS, and then the next L consecutive sets of four FLCS resources are mapped to another cluster of four transmission units in the L Tiles FLCS, etc.
FIG. 7 also illustrates the mapping of each set of four FLCS resources to transmission units for the first FLCS resource mapping scheme. For each FLCS tile, equation (3) maps the first set of four FLCS resources on the FLCS tile for transmission units 0 to 3, the second set of four FLCS resources for transmission units 4 to 7, and so on, and so on. the last set of four FLCS resources for transmission units 32 to 35 (not shown in FIG. 7).
Each FLCS resource is mapped to three tile segments 0, 1 and 2 on up to three different FLCS tiles with h indexes<sub>0</sub>, H<sub>x</sub> Eh<sub>2</sub>, which are computed as shown in equation (4). ho is equal to the h index of the beginning FLCS tile provided by equation (2). hi eh<sub>2</sub> are for the next two
17/38
FLCS tiles, which can be cyclically reset to 0 after reaching Ll due to the operation of mod L. h2 can be equal to h if L = 2, and hi eh<sub>2</sub> can be equal to h if L = l.
Each FLCS resource is mapped to three transmission units with the same index r in the three tile segments
<td colspan="5">0, 1 and 2. For each tile segment k, where k C {0, 1, 2},</td>
<td>the Fp function</td><td> (</td><td>) provides the heel holder p<sub>k</sub> to the</td><td>unity</td><td>in</td>
<td>streaming</td><td>r,</td><td>and the F $ () function provides the</td><td>period</td><td>in</td>
<td>OFDM symbol</td><td>t<sub>k</sub></td><td>for the transmission unit r.</td><td>Functions</td><td>F °<sup>AND</sup> P</td>
<td>() and F °</td><td> (</td><td>) for tile segment 0</td><td>can</td><td>to be</td>
<td>certain</td><td colspan="2">by the left tile segment on the</td><td>FIG. 5,</td><td>at</td>
Fp () and F * functions<sub>s</sub> () for tile segment 1 can be determined by the middle tile segment, and the functions Fp () and Fj () for tile segment 2 can be determined by the right tile segment. For the project described above, the FLCS R resource is mapped to (i) transmission unit r in the hopper po in the OFDM symbol period of tile segment 0 in Tile FLCS ho, (ii) transmission unit r in the carrier jump pi in the OFDM symbol period ti of tile segment 1 in Tile FLCS hi, and (iii) transmission unit r in jump holder p<sub>2</sub> in the OFDM symbol period t<sub>2</sub> of tile segment 2 in Tile FLCS h<sub>2</sub>.
In a second FLCS resource mapping scheme, FLCS resources are mapped to transmission units in the common segment in order to achieve scalar property, third-order diversity, and avoid forgetfulness. The second FLCS resource mapping scheme can also be referred to as the Distributed resource channel mapping scheme (DRCH).
18/38
FIG. 8 illustrates a design of an FLCS tile that can be used for the second FLCS resource mapping scheme. In this project, transmission units within a forgetting zone and unavailable for FLCS resources are marked with an X. Unavailable transmission units can be used for channels such as Direct Common Pilot Channels, Direct Beacon Pilot Channel, etc. Transmission units that are not in the forgetting zone are available for use with FLCS resources. The number of available transmission units N<sub>AVA</sub>il is dependent on the total number of transmission units on the FLCS tile and the number of transmission units not available. The available transmission units can be assigned unique start indexes with 0 for the transmission unit in the lower left corner of the FLCS tile and ending with N<sub>AVA</sub>il - 1 for the transmission unit in the upper right corner. In the example illustrated in FIG. 8, Tile FLCS includes 38 transmission units not available and 90 transmission units available with indexes 0 to 89.
For the second FLCS resource mapping scheme, the total number of FLCS resources for the common segment can be given as:
Nflcs = LN<sub>THE</sub>vail / 3J <sub>:</sub> . Eq (5)
At N<sub>FLC</sub>s FLCS resources can be assigned indexes from 0 to N<sub>FLCS</sub> -1.0 number of FLCS resources per Tile FLCS, M, can be given as:
M = LNáváii73J .. Eq (6)
FIG. 9 illustrates mapping an FLCS resource to three transmission units to achieve third-order diversity for the second FLCS resource mapping scheme. In this project, an FLCS resource with an R index is
19/38 mapped to three transmission units on up to three consecutive FLCS tiles. A mapping unit 910 can receive the R index of the FLCS resource and can determine (i) an h index of the first FLCS tile for the FLCS resource and (ii) an r index of the transmission unit on the first FLCS tile to which the FLCS resource is mapped. FLCS R resource can then be mapped to transmission unit r on Tile FLCS h, transmission unit r + M on Tile FLCS h + 1, and transmission unit r + 2M on tile FLCS h + 2. For clarity, FIG. 9 illustrates three consecutive FLCS tiles being used for FLCS R Feature. The three FLCS tiles can also perform a cyclical reset as described below.
In the project illustrated in FIG. 9, third-order diversity is achieved by mapping the FLCS resource to three different transmission units in three different FLCS tiles when L 3. Third-order diversity can also be achieved when one or two FLCS tiles are used for the common segment.
For the second FLCS resource mapping scheme, FLCS R resource can be mapped to three transmission units according to the following procedure.
1. Set h = R mod L. Eq (7)
2. Set r = [R / Lj. Eq (8)
3. For k = {0, 1, 2}
The. Leave<sup>l</sup>i ”kxLNAVAn./3J <sup>+</sup> Γ- Eq (9)
B. Let h<sub>k</sub> - (h + k) mod L. Eq (10)
ç. The transmission unit with index r<sub>k</sub> on the FLCS tile with index h<sub>k</sub> is allocated to the FLCS resource with index R.
FIG. 10 illustrates the mapping of FLCS resources to different starting FLCS tiles for the second FLCS resource mapping scheme. Equation (7) performs cycles
20/38 through the Nflcs FLCS Resources for the common segment and maps each FLCS resource to a respective FLCS tile at the beginning, starting with the FLCS 0 tile and returning to the FLCS 0 tile after reaching Tile FLCS Ll. For the first L FLCS Resources, FLCS Resources 0 to Ll are mapped to FLCS tiles beginning 0 to Ll, respectively. For the next L FLCS resources, FLCS resources L to 2L-1 are mapped to FLCS tiles starting from 0 to Ll, respectively. The mapping continues until all FLCS resources are mapped to the appropriate FLCS starting tiles. The mapping in FIG. 10 is symmetric in those L consecutive FLCS Resources that are mapped to the same transmission unit in the L Tiles FLCS, and then the next L consecutive FLCS Resources are mapped to another transmission unit in the L Tiles FLCS, etc.
FIG. 10 also illustrates the mapping of each FLCS resource to transmission units for the second FLCS resource mapping scheme. For each FLCS tile, equation (8) maps the first FLCS resource to the FLCS tile for transmission unit 0, the second FLCS resource to transmission unit 1, and so on.
Each FLCS resource can be mapped to three different transmission units with indexes ro, r<sub>x</sub> er<sub>2 </sub>up to three different FLCS tiles with h indexes<sub>0</sub>, hi eh<sub>2</sub>, respectively, which are computed as shown in equations (9) and (10). ho is equal to the h index of the beginning FLCS tile provided by equation (7). hi eh<sub>2</sub> they are for the next two FLCS tiles, which can restart cycle to 0 after reaching Ll due to the operation of mod L. ho is equal to the index r of transmission unit provided by equation (8). H<sub>2</sub> can be equal to ah if L = 2, and hi eh<sub>2</sub> can be equal to h if L = l. η is equal to r + M, er<sub>2</sub> is equal to r + 2M.
21/38
FLCS R resource is mapped to transmission unit ro on the FLCS tile ho, transmission unit η on the tile FLCS hi, and transmission unit r<sub>2</sub> on the FLCS tile h<sub>2</sub>.
For the second FLCS resource mapping scheme, transmission units 0 to Ml can be considered as belonging to tile segment 0, transmission units M to 2M-1 can be considered to belong to tile segment 1, and transmission units 2M to 3M-1 can be considered as belonging to tile segment 3. Each tile segment can include M transmission units. The second FLCS resource mapping scheme can be similar to the first FLCS resource mapping scheme, although with different F mapping functions<sup>k</sup>H () and F<sup>k</sup>s () for the three tile segments.
The system can support only the first FLCS resource mapping scheme, only the second FLCS resource mapping scheme, or both mapping schemes. If both mapping schemes are supported, then either the first or the second FLCS resource mapping scheme can be selected for use. For example, a UseDRCHForFLCS parameter can be set to 0 to select the first FLCS resource mapping scheme or to 1 to select the second FLCS resource mapping scheme.
Two FLCS resource mapping schemes have been described above for the common segment. FLCS resources can also be mapped to the transmission units available on L Tiles FLCS for the common segment in other ways based on the FLCS resource mapping schemes.
22/38 control channels in table 1 can be sent on the common segment in several ways. The number of FLCS Resources to assign to each control channel can be dependent on the amount of control information to send on that control channel as well as the way in which control information is sent. In a project, the first seven control channels in table 1 are sequentially allocated FLCS resources. Table 2 illustrates a project to sequentially allocate resources
FLCS for the seven control channels.
Table 2
<td>Channel</td><td>No. of FLCS resources to assign channel</td><td>FLCS features for channel use</td><td>Definition</td>
<td>F-ACKCH</td><td>N, = 4xrN<sub>The</sub>/ 4l</td><td>OtoNi-1</td><td></td>
<td>F-SPCH</td><td>Ν<sub>2</sub> = 4χΓ ^ / 4ΐ</td><td>NitoNi<sub>2</sub>-l</td><td>N2 = Nt + N<sub>2</sub></td>
<td>F-RABÇH</td><td>N<sub>3</sub> = 2xN<sub>ç</sub></td><td>NfôtoNu-l</td><td>Nu = N | 2 + Nj</td>
<td>F-PQICH</td><td>N<sub>4</sub> = 2xN<sub>d</sub></td><td>N13 to Nu — 1</td><td>Nu = N13 + N4</td>
<td>F-FOSICH</td><td>Ms = 2xN<sub>and</sub></td><td>Nm to N i 5—]</td><td>Nl5 = N | 4 + N<sub>5</sub></td>
<td>F-IOTCH</td><td>N<sub><</sub>s = 2xN<sub>f</sub></td><td>NtftoNie-i</td><td>Ni6 = N, 5 + Ns.</td>
<td>F-PCCH</td><td>Νι = ΓΝ<sub>8</sub>/ 3ΐ</td><td>Ni<sub>6</sub>toNi7-I</td><td>Ν<sub>17</sub> = Ν<sub>1β</sub> + Ν<sub>7</sub></td>
In a project, ACK N values<sub>The</sub> can be sent on the F-ACKCH, where N<sub>The</sub> > 0, and up to four ACK Values can be sent in a set of four FLCS resources. A sequence of 12 symbols can be generated for each ACK value and denoted as {Z<sub>oo</sub>, Ζοι, Z<sub>02</sub>, Ζ<sub>χ0</sub>, Z<sub>llf</sub> Z<sub>i2</sub>, Z<sub>20</sub>, Z<sub>21</sub>, Z<sub>22</sub>, Z<sub>30</sub>, Z31, Z3<sub>2</sub>), where Zij is the symbol to be sent in the i FLCS resource in the j-th Tile FLCS. The symbol string can be generated based on the ACK value, a sector identifier (ID) for a sector by sending an ACK value, and a Media Access Control (MAC) ID from a container terminal. Four orthogonal 4-chip strings (for example, four columns of a 4x4 DFT array) can be used
23/38 for four ACK values that can be sent simultaneously on the same set of FLCS resources. The symbol sequence for each ACK value can be generated based on the orthogonal sequence for that ACK value. For each ACK value, each set of four Z symbols<sub>O</sub>j, Zij, Z<sub>2</sub>j, and Z<sub>3</sub>j can be generated based on the orthogonal sequence for that ACK value and sent in the four adjacent transmission units in a Tile FLCS j.
In a project, N<sub>B</sub> packet start (SP) values can be sent on the F-SPCH, where N<sub>B</sub> > 0, and up to four SP values can be sent in a set of four FLCS resources. A sequence of 12 symbols can be generated for each SP value based on that SP value and the sector ID, for example, in a similar way as the ACK values. Four orthogonal 4-chip strings can be used for up to four SP values that can be sent simultaneously on the same set of four FLCS resources.
In a project, N<sub>ç</sub> bit values of reverse activity (RAB) can be sent in the F-RABCH, where N<sub>ç</sub> 0, and each RAB Value value can be sent in two FLCS resources. A sequence of 6 symbols {co, Ci, C<sub>2</sub>, Ç<sub>3</sub>, Ç<sub>4</sub>, Ç<sub>5</sub>} can be generated for each RAB Value based on that RAB value and the sector ID. The symbol string can be sent in six transmission units for two FLCS resources.
In a project, N<sub>d</sub> PQI reports can be sent to F-PQICH, where N<sub>d</sub> is 0, and each PQI report can be sent in two FLCS resources. A PQI Report can include a 4-bit PQI value and can be coded and mapped to a sequence of 6 symbols {c<sub>0</sub>, Ç<sub>3</sub>, Ç<sub>2</sub>, Ç<sub>3</sub>,
Ç<sub>4</sub>, C5} based on that PQI value, the sector ID, and the MAC ID of the container terminal. The symbol string for
24/38 each PQI report can be sent in six transmission units for two FLCS resources.
In a project, N<sub>and</sub> Quick OSI reports can be sent to F-FOSICH, where N<sub>and</sub> 0, and each quick OSI report can be sent in two FLCS resources. A quick OSI report can include a 4-bit OSI value and can be encoded and mapped to a sequence of 6 symbols {Co, Ci, C<sub>2</sub>, Ç<sub>3</sub>, Ç<sub>4</sub>, Ç<sub>5</sub>} based on that fast OSI value and sector ID. The symbol string for each quick OSI report can be sent in six transmission units for two FLCS resources. To reduce transmission power, a fast OSI value of '0000', which is most likely to be sent, can be mapped to a sequence of symbols with a zero value.
In a project, N<sub>f</sub> thermal interference (IOT) reports can be sent to the F-FIOTCH, where N<sub>f </sub>> 0, and each IOT report can be sent in two FLCS resources.
An IOT report can include an IOT value of 4bit and can be coded and mapped to a sequence of 6 symbols {Co, Ci, C<sub>2</sub>, Ç<sub>3</sub>, Ç<sub>4</sub>, Ç<sub>5</sub>} based on that IOT Value and the sector ID.
The symbol string for each IOT report can be sent in six transmission units for two FLCS resources.
In a project, N<sub>g</sub> power control (PC) bits can be sent on the F-PCCH, where N<sub>g</sub> > 0, and up to three Bit PCs can be sent on an FLCS resource. A symbol can be generated for each Bit PC based on that Bit PC and the sector ID. Up to three symbols for up to three bit PCs can be sent on the three transmission units to an FLCS resource.
25/38
Table 2 illustrates a specific project to allocate FLCS resources to the control channels. In this project, control channels that benefit from localized mapping, such as F-ACKCH and F-SPCH, are allocated first FLCS resources. These FLCS resources are mapped to adjacent transmission units. Control channels that do not benefit from localized mapping, such as the F-PCCH, are allocated the latest FLCS resources. These FLCS resources can be mapped to transmission units 32 to 35 located by all Tiles FLCS. FLCS resources can also be assigned to the control channels in other ways.
The F-SCCH can be sent in the common segment or in the K LAB segments in several ways. In a project, the FSCCH can be sent on the common segment if either (i) the first FLCS resource mapping scheme is used and no LAB segments are present and (ii) the second FLCS resource mapping scheme is used.
In a project, the F-SCCH can carry a variable number of packages. Each packet can be coded and mapped to N<sub>s</sub>ym symbols with QPSK or for N<sub>s</sub>y<sub>M</sub>/ 2 symbols with 16-QAM. Thus, a packet can be sent in N<sub>s</sub>ym transmission units with QPSK, and two packets can be sent in N<sub>s</sub>ym 16-QAM transmission units. P pairs of packets can be sent on the F-SCCH, where P can be dependent on the number of symbols per pair of packets and the number of transmission units available for the F-SCCH. Each pair of packets can include either a packet sent with QPSK and having an index (a, 0) or two packets sent with 16-QAM and having indexes (a, 0) and (a, 1), where G {0, ..., P - 1} is an index per package pair, and 0 and 1 denote packages 0 and 1 (if applicable) for the package pair.
26/38
In a first F-SCCH mapping scheme, the P packet pairs can be mapped to transmission units in the L Tiles FLCS of the common segment according to the following procedure.
1. Initialize the hop gate counter i, block counter k, OFDM symbol counter j to 0.
2. Initialize the modulation symbol index p (n) = 0, for n = 0, 1, 2, ..., P - 1.
3. If the hop gate counter i is a high gate for the F-SCCH,
The. Set a = (k + j + i) mod P. Eq (11)
B. Set b - 0 if packet with index (a, 0) is sent using QPSK.
Define b = p (a) mod 2 in another way. Eq (12)
ç. Symbol of popular modulation with index p (a) from the package with index (a, 0) on the i-th high doors of the j-th OFDM Symbol on the k-th Tile FLCS of the common segment if this package is sent using QPSK.
d. Popular modulation symbol with index Lp (a) / 2) J from the package with index (a, b) on the i-th heel of the j-th OFDM Symbol on the k-th Tile FLCS of the common segment if this package is sent using 16-QAM.
and. Increment p (a) to 1.
4. Increment i to 1. If i = 16, set k = k + 1 and set i = 0.
5. If k L, set k = 0 and increment j to
1.
6. If j 2 8, leave. Otherwise, go to step
3.
For the first F-SCCH mapping scheme, the procedure starts at the OFDM 0 symbol period, traverses all 16 heels for each of the L FLCS tiles, and maps a pair of packages for each unit of
27/38 transmission. The pair of packets mapped to the transmission unit in the hopper i of Symbol Period OFDM j without tile FLCS k is determined by equation (11). Equation (11) cycles through the P pairs of packages as the jump gate index i is increased.
A counter p (a) is maintained for each pair of packets and indicates the next symbol to be sent on the next transmission unit available for that pair of packets. Counter p (a) for each pair of packets is initialized to 0. Then, even if packet pair a is mapped to an available transmission unit and QPSK is used, then the p (a) symbol of packet a is mapped to this transmission unit, and the index p (a) is increased. If 16-QAM is used, then symbols for the two packages in the package pair are alternately mapped to «
the transmission units available for this packet, for example, a symbol from the packet (a, 0) is mapped to a transmission unit available for pair of packets a, then a symbol from the packet (a, 1) is mapped to the next available transmission unit for a pair of packets, etc.
After traversing all transmission units / hoppers in an OFDM symbol period, the procedure traverses all transmission units in the next OFDM symbol period and repeats the mapping. Crossing all transmission units across the common segment L Tiles FLCS, each available transmission unit can be identified and used for the F-SCCH.
FIG. 11 illustrates an example of mapping five pairs of packets for the F-SCCH to transmission units in the common segment based on the first F-SCCH mapping scheme. For simplicity, each package pair includes a package sent using QPSK. For each
28/38 FLCS tile in the common segment, the packet mapped to each transmission unit on that FLCS tile is labeled in FIG. 11. Transmission units not available for the FSCCH are shown with gray shading and marked with X. The transmission units available for the F-SCCH are shown without shading, and each transmission unit is marked with the packet index mapped to that transmission unit. For simplicity, FIG. 11 assumes that only the F-SCCH is sent on the common segment. If other control channels are sent, then the transmission units used for those other control channels are unavailable and marked with an X.
For simplicity, FIG. 11 illustrates only one packet with index 0 among the five packets sent in the FSCCH in this example. Symbols for packet 0 can be sent on each available transmission unit to which packet 0 is mapped. FIG. 11 illustrates the mapping of some symbols for packet 0 to some available transmission units to which packet 0 is mapped. The symbols for packet 0 are mapped in sequential order to the transmission units available for the packet, as described above. However, the mapping appears random in FIG. 11 because the symbols and Tiles FLCS are sequentially numbered from top to bottom while the heels are sequentially numbered from bottom to top. The symbols for each remaining packet can be mapped to available transmission units in a similar way.
The F-SCCH can also be sent in the K LAB segments. In a project, P pairs of packages for the F-SCCH can be sent in each LAB segment comprising 3 Tiles FLCS, where P can be dependent on the number of symbols per pair of packages and the number of transmission units
29/38 available per LAB Segment. A total of PK pairs of packets with indexes from 0 to PKI can be sent in the K LAB segments. Each pair of packets can include either a packet sent with QPSK and having an index (a, 0) or two packets sent with 16-QAM and having indexes (a, 0) and (a, 1), where G {0, . .., Ρ · K - 1} is an index for the package pair, and 0 and 1 denote packages 0 and 1 (if applicable) for the package pair.
In a second F-SCCH mapping scheme, P pairs of packets with indexes from qP to (q + 1). P - 1 can be mapped to transmission units on the three LAB Segment FLCS tiles q, for q G {0,. .., K - 1), according to the following procedure.
1. Initialize the hop gate counter i, block counter k, OFDM symbol counter j to 0.
2. Initialize the modulation symbol index p (n) = 0, for n = q * P,. .., (q + l) * Pl.
3. If the hopper counter i is a wearable hightop for the F-SCCH,
The. Set a = [(k + j + i) mod P] + q * P. Eq (13)
B. Set b = 0 if the packet with index (a, 0) is sent using QPSK.
Set b = p (a) mod 2 otherwise. Eq (14)
ç. Symbol of popular modulation with index p (a) from the package with index (a, 0) in the i-th high doors of the j-th OFDM symbol in the k-th Tile FLCS of segment LAB q if this package is sent using QPSK.
d. Popular modulation symbol with index
Lp (ay2) J <sub>The</sub> P<sub>air</sub>remove the package with index (a, b) on the i-th heel port of the j-th OFDM Symbol on the k-th Tile FLCS of segment LAB q if this packet is sent using 16-QAM.
30/38
and. Increment p (a) by 1.
4. Increment i by 1. If i = 16, set k = k + 1 and set i = 0.
5. If k> 3, set k = 0 and increment j by 1.
6. If j> 8, leave. Otherwise, go to step
3.
The second F-SCCH mapping scheme is similar to the first F-SCCH mapping scheme with the following differences. First, the P pairs of packages for the LAB segment q are mapped to three FLCS tiles for the LAB segment q in the second scheme whereas the P pairs of packages for the F-SCCH are mapped to L Tiles FLCS for the common segment in the first scheme. Second, the transmission units available on the three FLCS tiles for the LAB segment q for the second scheme may differ from the transmission units available on the L Tiles FLCS for the common segment in the first scheme. Third, the index a keeps track of the P packets sent in each LAB segment for the second scheme and keeps track of the P packets for the F-SCCH in the first scheme. For both schemes, the P pairs of packets cycle and are mapped to different transmission units crossing these transmission units in a predetermined order. These two schemes distribute the symbols for each package approximately by each Tile FLCS, uniformly, used for the package.
Two F-SCCH mapping schemes have been described above for the F-SCCH. Packages for the F-SCCH can also be mapped to the available transmission units based on other mapping schemes. In another F-SCCH mapping scheme, the available transmission units can be initially determined, and the P packet pairs can be determined
31/38 sequentially determined for these available transmission units. In this scheme, a single counter p (a) can be maintained for all P pairs of packets.
FIG. 12 illustrates a design of a process 1200 for communicating control information. Process 1200 can be performed by a base station and / or a terminal. A tile h index and a transmission unit r index for a control resource R index can be determined (block 1212). A control resource (for example, an FLCS resource) with index R can be mapped to the transmission unit with index r on a tile with index h (block 1214). The control resource can be one of a plurality of control resources for a control segment comprising L tiles, where L> 1. Each tile can comprise a plurality of transmission units. Block 1212 can be performed based on a mapping scheme that distributes the plurality of control resources across the L tiles to any number of tiles. 0 mapping scheme can be those shown in equations (2) and (3), those shown in equations (7) and (8), or some other mapping scheme. Control information can be sent or received via the control facility (block 1216).
In a symmetric mapping project, multiple sets of S control resources can be formed for the plurality of control resources, where S 1. Each batch of L consecutive sets of S control resources can be mapped to S transmission units in the same location on the L tiles. Different batches of L consecutive sets of S control features can be mapped to different locations of the L tiles.
In a localized mapping project, multiple sets of control resources can be formed to
32/38 the plurality of control resources, where S 1. Each set of S control resources can be mapped to a cluster of S adjacent transmission units on each of at least one tile. The multiple sets of S control resources can be traversed, and each set of S control resources can be mapped to at least one tile determined by the cycle through the L tiles. In a project, S = 4, and each set of four control resources can be mapped to a cluster of four adjacent transmission units on each of at least one tile, for example, as illustrated in FIG. 7 and in equations (2) and (3). In a distributed mapping project, the plurality of control features can be traversed, and each control feature can be mapped to at least one tile determined by cycling through the L tiles, for example, as illustrated in FIG. 10 and in equations (7) and (8).
control resource with index R can be mapped to multiple (for example, three) transmission units on at least one tile between the L tiles to obtain diversity for the control resource. The multiple transmission units can be in different locations on at least one tile. The indexes of the multiple transmission units can be determined based on an index r of the transmission unit.
In a diversity project, each tile can be associated with multiple tile segments, and each tile segment can include a different subset of the plurality of transmission units in the tile. The transmission units in each tile segment may have pre-assigned indexes, for example, as illustrated in FIG. 5. The R-index control feature can be mapped to a r-index transmission unit in each of the
33/38 multiple tile segments by at least one tile, for example, as illustrated in FIG. 6.
In another diversity project, the transmission units available for use on each tile can be assigned unique indices. The R index control feature can be mapped to multiple transmission units with different indexes on at least one tile. The indexes of the multiple transmission units can be determined based on a transmission unit index r and can be separated by M, for example, as illustrated in FIG. 9. M can be determined based on the number of transmission units available for use on each tile and the number of transmission units to which the control resource is mapped.
The plurality of control resources can be attributed to a plurality of control channels, one control channel at a time and in a predetermined order. A control channel relaying in the localized mapping can be assigned first control resources, and a control channel not relaying in the localized mapping can be assigned later control resources.
FIG. 13 illustrates a design of a 1300 device to communicate control information. Equipment 1300 includes means for determining a tile h index and the transmission unit r index for a control resource R index (module 1312), means for mapping an R index control resource to the transmission unit with index r on a tile with index h (module 1314), and means to send or receive control information via the control feature (module 1316).
FIG. 14 illustrates a design of a 1400 process for exchanging control information. The 1400 process can
34/38 be performed by a base station and / or a terminal. Transmission units available for a control channel (for example, the F-SCCH) can be determined among all transmission units for a control segment (for example, a common segment or a LAB segment) in which the control channel is sent and can exclude transmission units not available for the control channel (block 1412). Transmission units not available may include transmission units used for pilot, other control channels, other transmissions, etc.
A set of transmission units for a packet can be determined from among the transmission units available for the control channel and can be distributed among these available transmission units (block 1414). The control segment can include at least one tile, and each tile can include a plurality of transmission units. In a project, the plurality of transmission units on each tile can be traversed, and each transmission unit can be assigned to a package between multiple packages by cycling through the multiple packages, for example, as illustrated in FIG. 11. All transmission units on at least one tile to which the package is mapped can be determined. The set of transmission units for the packet can then be determined from among those transmission units, but can exclude the transmission units not available for the control channel. The packet can be sent or received via the set of transmission units (block 1416).
FIG. 15 illustrates a design of a 1500 device for exchanging control information. 1500 equipment includes means for determining transmission units
35/38 available for a control channel among all transmission units for a control segment in which the control channel is sent and exclude transmission units not available for the control channel (module 1512), means for determining a set of transmission units for a packet among the transmission units available for the control channel (module 1514), and means for sending or receiving the packet via the set of transmission units (module 1516).
The modules in FIGS. 13 and 15 may comprise processors, electronic devices, hardware devices, electronic components, logic circuits, memories, etc., or any combination thereof.
FIG. 16 illustrates a block diagram of a design of a base station 110 and a terminal 120, which are one of the base stations and one of the terminals of the system 100 in FIG. 1. At base station 110, a transmission data processor (TX) 1614 can receive traffic data from data source 1612 to terminals programmed for transmission on the direct link and control information for different control channels from a controller / 1620 processor. For example, 1620 controller / processor can provide control information for the control channels in table 1. The 1630 programmer can provide resource assignments for the programmed terminals, and these assignments can be sent in the control information. TX 1614 data processor can process (for example, encode and map into symbol) data and control information, perform modulation (for example, for OFDM), and provide output chips. A 1616 transmitter (TMTR) can condition (for example, convert to analog, filter, amplify, and upwardly convert) the output chips and generate a
36/38 direct link signal, which can be transmitted via a 1618 antenna.
At terminal 120, an antenna 1652 can receive the direct link signal from base station 110 and provide a received signal to a 1654 receiver (RCVR). The receiver 1654 can condition and digitize the received signal and provide samples. A data processor (RX) received 1656 can perform demodulation on the samples (for example, for OFDM) and demodulate and decode the resulting symbols to obtain decoded data and control information. The 1656 processor can provide the decoded data for a 1658 data store and the decoded control information for a 1660 controller / processor.
On the reverse link, a TX 1674 data processor at terminal 120 can receive traffic data from a 1672 data source and control information from the 1660 controller / processor. The data and control information can be processed (for example, encrypted, mapped in symbol, and modulated) by the data processor TX 1674 and additionally conditioned by a transmitter 1676 to generate reverse link signal, which can be transmitted via antenna 1652. At base station 110, the reverse link signal from terminal 120 and other terminals can be received by antenna 1618, conditioned by a receiver 1632, and demodulated and decoded by an RX 1634 Data Processor.
Controllers / processors 1620 and 1660 can direct operation at base station 110 and terminal 120, respectively. 1620 controller / processor can direct data transmission and control information over the direct link and can determine the control features to use for each control channel. 1620 and / or 1660 controller / processor can perform the
37/38 process 1200 in FIG. 12, process 1400 in FIG. 14, and / or other processes for the techniques described here. Memories 1622 and 1662 can store program code and data for base station 110 and terminal 120, respectively. ·
The techniques described here can be implemented by various means. 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 (for example, a base station or a terminal) can be implemented within one or more application-specific integrated circuits (ASICs), digital signal processors (DSPs), digital signal processing devices (DSPDs), field programmable logic devices (PLDs), field programmable port arrangements (FPGAs), processors, controllers, microcontrollers, microprocessors, electronic devices, other electronic units designed to perform the functions described here, a computer, or a combination of them.
For a firmware and / or software implementation, the techniques can be implemented with codes (for example, procedures, functions, modules, instructions, etc.) that perform the functions described here.- In general, any computer / processor-readable medium tangibly incorporates a firmware code and / or software that can be used to implement the techniques described here. For example, the firmware and / or software code can be stored in memory (for example, 1622 or 1662 memory in FIG. 16) and executed by a processor (for example, 1620 or 1660 processor). The memory can be implemented inside the processor or external to the processor. The firmware code
38/38 and / or software can also be stored in a computer-readable medium, such as random access memory (RAM), read-only memory (ROM), non-volatile random access memory (NVRAM), memory only. programmable reading (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 executable by one or more computers / processors and can cause the computer / processor (s) to perform certain aspects of the functionality described here.
The previous description of the presentation is provided to allow anyone skilled in the art to make or use the description. Various modifications in the description will be readily apparent to those skilled in the art, and the general principles defined here can be applied to other variations without departing from the spirit or scope of the invention. Thus, the description should not be interpreted as limited to the examples and projects described, but the broader scope consistent with the principles and new features described here must be agreed.
Contents17
16 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 Sheet 13 Sheet 14 Sheet 15 Sheet 16
121 members in 17 offices
Priority claims19
| Document | Office | Kind | Date |
|---|---|---|---|
| 60883387 | United States of America | – | |
| 88338707 | United States of America | P | |
| 88338707 | United States of America | P | |
| 60883758 | United States of America | – | |
| 88375807 | United States of America | P | |
| 88375807 | United States of America | P | |
| 11968642 | United States of America | – | |
| 96864208 | United States of America | A | |
| 96864208 | United States of America | A | |
| 2008050187 | United States of America | W | |
| 2008050187 | United States of America | W | |
| 11968642 | – | – | – |
| 2008050187 | – | – | – |
| 60883387 | – | – | – |
| 60883758 | – | – | – |
| US20070883387P | – | – | – |
| US20070883758P | – | – | – |
| US20080968642 | – | – | – |
| WO2008US50187 | – | – | – |
Members121
| 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 | |
| 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 | |
| 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 | |
| BRPI0806294A2This record | Brazil | A2 | |
| BRPI0806295A2 | Brazil | A2 | |
| BRPI0806298A2 | Brazil | A2 | |
| BRPI0806485A2 | Brazil | A2 | |
| RU2430491C2 | Russian Federation | C2 | |
| RU2433554C2 | Russian Federation | C2 | |
| 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 | |
| JP5431538B2 | Japan | B2 | |
| US8681749B2 | United States of America | B2 | |
| US8693444B2 | United States of America | B2 |
3 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 | |
| Patent lapsed as no evidence of payment of the annual fee has been furnished to inpi [chapter 8.11 patent gazette]LapsedEM VIRTUDE DO ARQUIVAMENTO PUBLICADO NA RPI 2342 DE 24-11-2015 E CONSIDERANDO AUSENCIA DE MANIFESTACAO DENTRO DOS PRAZOS LEGAIS, INFORMO QUE CABE SER MANTIDO O ARQUIVAMENTO DO PEDIDO DE PATENTE, CONFORME O DISPOSTO NO ARTIGO 12, DA RESOLUCAO 113/2013.B08K | B08K | |
| Application dismissed because of non-payment of annual fees [chapter 8.6 patent gazette]REFERENTE A 8A ANUIDADE.B08F | B08F |
Numbers
- Publication
- PI0806294
- Publication, DOCDB
- PI0806294
- Publication, EPODOC
- BRPI0806294
- Application
- 6294
- Application, DOCDB
- PI0806294
- Application, EPODOC
- BR2008PI06294
Titles2
- Portuguese
- MAPEAMENTO DE RECURSO DE CONTROLE PARA UM SISTEMA DE COMUNICAÇÃO SEM FIO
- English
- CONTROL RESOURCE MAPPING FOR A WIRELESS COMMUNICATION SYSTEM
Classification
- CPC, 15
- H04L5/0053
- H04L1/1692
- H04W72/04
- H04W52/146
- H04W52/16
- H04W52/243
- H04W52/247
- H04W52/362
- H04W52/60
- H04W72/54
- H04W72/23
- H04L5/0094
- H04L5/0037
- H04B1/713
- H04B7/2621
- IPC, 7
- H04Q7 38
- H04W52 14
- H04W52 16
- H04W52 24
- H04W52 36
- H04W52 60
- H04W72 54