Resource allocation and mapping in a wireless communication system

(54) Title: RESOURCE ALLOCATION AND MAPPING IN A WIRELESS COMMUNICATION SYSTEM (30) Unionist Priority: 03/01/2008 us 11 / 969,200, 01/05/2007 US 60 / 883,729, 01/05/2007 US 60 / 883,758 (73) Holder (s): Qualcomm Incorporated (72) Inventor (s): Aamod Khandekar, Alexei Gorokhov, Naga Bhushan, Ravi Palanki (74) Attorney (s): Montaury Pimenta, Machado & Lioce (86) International Request : pct US2008050211 of 04/01/2008 (57) Summary: allocation and mapping of resources in A WIRELESS COMMUNICATION SYSTEM. Techniques for allocating and mapping resources in a wireless communication system are described. The system can use jump gates to facilitate the allocation and use of the subcarriers. In one respect, jump gates can be divided into multiple subzones, with each subzone including a configurable number of jump gates. Jump gates within each subzone can be interchanged or mixed based on a permutation function. After permutation, portassalto in all subzones can be mapped on subcarriers based on the local or global jump. In another aspect, a set of jump gates can be mapped to a set of subcarriers. A hopper can be mapped to an unavailable subcarrier and can then be remapped to another available subcarrier. In another aspect, a set of jump gates can be mapped into a set of distributed subcarriers (for example, homogeneously) across all subcarriers, but avoiding subcarriers in a reserved zone.

(87) International Publication: wo 2008 / 086i63de 17/07/2008

<img file="BRPI0806293A2_D0001.tif" />

<img file="BRPI0806293A2_D0002.tif" />

ΡΙ0806293-5

RESOURCE ALLOCATION AND MAPPING IN A WIRELESS COMMUNICATION SYSTEM

This application claims the priority of provisional application No. 60 / 883,729, entitled RESOURCE ALLOCATION AND MAPPING IN A WIRELESS COMMUNICATION SYSTEM, and provisional application No. 60 / 883,758, entitled WIRELESS COMMUNICATION SYSTEM, both filed on January 5, 2007, assigned to the assignee of this application and incorporated here by reference.

Foundations

Field

This description generally refers to communication, and more specifically to techniques for allocating and mapping resources in a wireless communication system.

Foundations

Wireless communication systems are widely developed to provide various communication services such as voice, video, packet data, sending messages, broadcasting, 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 (CDMA) systems, Time Division Multiple Access (TDMA) systems, Frequency Division Multiple Access (FDMA) systems, Orthogonal FDMA systems (OFDMA ), and single carrier FDMA 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 from the base stations to the terminals, and the reverse link (or uplink) if

2/42 refers to the communication link from the terminals to the base stations. The system can have a certain amount of time frequency resources for each link. It may be desirable to have an efficient scheme for allocating and mapping resources available on each link.

summary

Techniques for allocating and mapping resources in a wireless communication system are described here. The system can have N_FFT subcarriers that can be obtained through orthogonal frequency division multiplexing (OFDM) or some other modulation techniques. Jump doors can be defined to facilitate the allocation and use of N_FFT subcarriers. Jump gates can be considered logical / virtual subcarriers that can be mapped to physical subcarriers. In the description here, the term subcarrier refers to a physical subcarrier unless stated otherwise.

In one aspect, a plurality of jump gates can be broken into multiple subzones, with each subzone including a configurable number of jump gates. The jump gates within each subzone can be exchanged or mixed based on a permutation function, which can be different for each subzone and each sector. After the exchange, the plurality of jump gates in the multiple subzones can be mapped into a plurality of subcarriers, for example, based on the local jump (LH), global jump (GH), block resource channel (BRCH), or distributed resource channel (DRCH), which are described in detail below.

In another aspect, a set of jump gates can be mapped to a set of subcarriers based on at least one permutation function. At least one hopper mapped to at least one subcarrier

3/42 unavailable can be identified and can be remapped to at least one available subcarrier outside the set of subcarriers.

In another aspect, at least one subcarrier area usable for transmission, but which should be avoided, is determined. A set of jump gates can be mapped to a set of distributed subcarriers (for example, homogeneously) through a plurality of subcarriers and avoiding subcarriers in at least one zone.

In another aspect, the jump can be performed after changing the jump gates. A first hopper designated for a control segment can be determined. A second hopper to exchange with the first hopper can be determined. The first and second jump doors can be mapped to a first and a second subcarrier, respectively. The second subcarrier can be assigned to the control segment, and the first subcarrier can be assigned to a transmission designated with the second hopper.

In another aspect, the local jump (for example, LH or BRCH) can be performed in a first time interval, and the global jump (for example, GH or DRCH) can be performed in a second time interval. The local or global jump can be performed at different time intervals, for example, for different HARQ interlaces. The local and global jump can also be performed in the same time interval, for example, the local jump can be performed for a first group of subcarriers, and the global jump can be performed for a second group of subcarriers.

Various aspects and characteristics of the description are described in greater detail below.

4/42

Brief Description of the Figures

Figure 1 illustrates a wireless communication system;

Figure 2 illustrates a superframe structure;

Figure 3 illustrates a CDMA segment;

Figure 4 illustrates CDMA hop zones for a CDMA subsegment;

Figure 5 illustrates a hopper structure;

Figure 6 illustrates the division of jump gates into sub-zones;

Figure 7 illustrates the jump gate for mapping a subcarrier to a GH structure;

Figure 8 illustrates the jump gate for mapping the subcarrier to an LH structure;

<td rowspan="3"></td><td>The figure</td><td colspan="7">9a illustrates a BRCH structure;</td>

<td>The figure</td><td colspan="5">9b illustrates a structure</td><td colspan="2">DRCH;</td>

<td>The figure</td><td>10th</td><td>illustrates</td><td>O</td><td>mode</td><td>in</td><td>multiplexing</td><td> 1</td>

<td>to the</td><td>structures The figure</td><td>BRCH 10b</td><td>and DRCH; illustrates</td><td>O</td><td>mode</td><td>in</td><td>multiplexing</td><td> 2</td>

<td>to the</td><td>structures The figure</td><td colspan="2">BRCH and DRCH; 11 illustrates the</td><td colspan="3">bounce door</td><td colspan="2">for mapping</td>

subcarrier for the BRCH structure;

Figures 12a and 12b illustrate the hopper for mapping the subcarrier to the DRCH structure for multiplexing modes 1 and 2, respectively;

Figure 13 illustrates the switching of jump-gate for a direct link control segment (FLCS);

Figure 14 illustrates a jump gate mapping process for subcarriers;

Figure 15 illustrates equipment for mapping jump gates for subcarriers;

Figure 16 illustrates a process for jumping with remap;

5/42

<td>THE</td><td>Figure</td><td> 17</td><td>illustrates</td><td>one</td><td>equipment</td><td>for</td><td>O</td><td>jump</td>

<td colspan="2">remapping;</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td>

<td>THE</td><td>Figure</td><td> 18</td><td>illustrates</td><td colspan="2">a process</td><td>for</td><td>O</td><td>jump</td>

<td>distributed;</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td>

<td>THE</td><td>Figure</td><td> 19</td><td>illustrates</td><td>one</td><td>equipment</td><td>for</td><td>O</td><td>jump</td>

<td>distributed;</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td>

<td>THE</td><td>Figure</td><td> 20</td><td>illustrates</td><td>one</td><td colspan="4">jump process</td>

<td>jumping doors</td><td colspan="2">exchanged;</td><td></td><td></td><td></td><td> -</td><td></td><td></td>

Figure 21 illustrates a jump equipment with changed jump doors;

Figure 22 illustrates a process for performing a local and global jump;

Figure 23 illustrates equipment for performing local and global jumping;

Figure 24 illustrates a block diagram of a base station and two terminals.

Detailed Description

The techniques described here can be used for various communication systems such as CDMA, TDMA, FDMA, OFDMA and SC-FDMA. The terms system and network are often used interchangeably. A CDMA system can implement radio technology such as cdma2000, Universal Terrestrial Radio Access (UTRA), etc. An OFDMA system can implement radio technology such as Ultra Mobile Broadband (UMB), Evolved UTRA (E-UTRA), IEEE 802.16, IEEE 802.20, Flash-OFDM®, etc. UTRA and E-UTRA are described in documents from an organization called the 3rd Partnership Project. Generation (3GPP). cdma2000 and UMB are described in documents from an organization called the 3rd Partnership Project. Generation 2 (3GPP2). These various radio technologies and standards are known in the art. For the sake of clarity, certain aspects of the techniques are described below for UMB and the

6/42

2007 Broadband, (UMB) Air which is UMB terminology is used in much of the description below. UMB is described in 3GPP2 C.S0084-001, entitled Physical Layer for Ultra Mobile

Interface Specification, August publicly available.

Figure 1 illustrates a wireless communication system 100, which can also 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, an evolved Node B, etc. Each base station provides communication coverage for a particular geographic area 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 the capacity of the system, 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. 0 The term sector can refer to the smallest coverage area of ​​a base station and / or a base station subsystem serving that coverage area.

Terminals 120 can be distributed throughout the system, and each terminal can be stationary or mobile. A terminal can also be referred to as an access terminal (AT), a mobile station, user equipment, a subscriber station, a station, etc. A terminal can be a cell phone, a personal digital assistant (PDA), a wireless communication device, a wireless modem, a portable device, a laptop computer, a cordless phone, etc. A terminal can communicate with none, one or multiple base stations on the forward and / or reverse links at any given time.

7/42

For a centralized architecture, a controller

<td>system 130 can couple</td><td>the seasons</td><td>base 110</td><td>and provide</td>

<td colspan="3">coordination and control for these stations</td><td>base. 0</td>

<td>system controller 130</td><td>can be one</td><td colspan="2">network entity</td>

<td>single or a collection of</td><td>entities</td><td>network.</td><td>For</td>

<td>distributed architecture,</td><td>the seasons</td><td>base</td><td>can if</td>

<td colspan="2">communicate with each other as needed</td><td></td><td></td>

Figure 2 illustrates a drawing of a superframe structure 200. The transmission timeline for each link can be broken into superframe units. Each superframe can cover a duration of time in paurticubar, which can be fixed or configurable. In addition to the direct link (FL), each superframe can include a preamble followed by M physical layer frames (PHY), where M can be any integer value. In general, the term frame can refer to a time slot in a transmission timeline or a transmission sent during the time slot, depending on the context in which the term is used. In a drawing, each superframe includes M = 25 PHY frames with indexes from 0 to 24. The superframe preamble can carry system information and acquisition drivers that can allow the terminals to acquire and access the system. Each PHY frame can carry traffic data, control information / signaling, pilot, etc. For the reverse link (RL), each superframe can include M PHY frames, where the first PHY frame can be extended by the length of the preamble of the superframe on the direct link. The superframes on the reverse link can be aligned in time with the superframes on the direct link.

Base stations can transmit data and control information on each PHY FL frame to the terminals. Terminals (for example, if programmed) can transmit data and control information in each frame

8/42

PHY RL for base stations. A base station and a terminal can simultaneously transmit and receive data and control information via forward and reverse links.

The system can use OFDM in the direct and / or reverse link. OFDM can partition the system bandwidth for each link into multiple (N_FFT) orthogonal subcarriers, which can also be referred to as tones, compartments, etc. Each subcarrier can be modulated with data. The spacing between adjacent subcarriers can be fixed, and the number of subcarriers can depend on the system's bandwidth. For example, N_FFT can be equal to 12 $, 2-5 $, 5i2, 1U24 and 2048 for the system bandwidth of 1.25, 2.5, 5, 10 or 20 MHz, respectively. Only a subset of N_FFT Total subcarriers can be used for transmission and the rest of the subcarriers can serve as guard subcarriers to allow the system to meet spectral mask requirements. As N_fft total subcarriers may include N_USEFULusable subcarriers and N_Guarda guarada subcarriers, where N_FFt ⁼ Usable + NgüARDA ·

Table 1 lists some parameters for the system and provides an illustrative value for each parameter. Other values ​​can also be used for these parameters. For the sake of clarity, many of the examples below are based on the illustrative parameter values ​​illustrated in Table 1

9/42

Table 1

<td>Symbol</td><td>description</td><td>Value illustrative</td>

<td>Nfft</td><td>Total number of subcarriers</td><td> 512</td>

<td>NuTILIZABLE</td><td>Number of subcarriers usable</td><td> 480</td>

<td>NGUARD</td><td>Number of subcarriers of guard</td><td> 32</td>

<td>NgUARDA, left</td><td>Number of subcarriers of guard on the left edge</td><td> 16</td>

<td>CDS NURSING</td><td>Number of subcarriers for a CDMA subsegment</td><td> -128-</td>

<td>Not available</td><td>Number of subcarriers nominally available</td><td> 352</td>

<td>Block</td><td>Number of subcarriers per block</td><td> 16</td>

<td>Nquadro</td><td>Number of periods OFDM symbol per frame PHY</td><td> 8</td>

<td>Nsubzona, max</td><td>Maximum number of ports- jump by subzone</td><td>64 or 128</td>

The system can use a CDMA segment that can support pilot transmission, control information, and some traffic data on the reverse link. The CDMA segment can include C CDMA subsegments, where, in general, C&gt; 1. Each CDMA subsegment can occupy the contiguous subcarriers Nsubsegment-cdma in each CDMA frame. A CDMA frame is a PHY frame in which the CDMA segment is sent.

Figure 3 illustrates a drawing of a CDMA segment

300. In this design, the CDMA segment includes a subsegment

10/42

CDMA and is sent to each Q PHY frames, where Q can be equal to 4, 6, 8, etc. The CDMA subsegment can jump across the bandwidth of the CDMA frame system into the CDMA frame to achieve frequency diversity.

Figure 4 illustrates a design of CDMA hop zones for a CDMA sub-segment. Multiple CDMA hop zones can be defined over N_useusable subcarriers, with each CDMA hop zone covering Nsubsegmentocdma contiguous subcarriers. Each pair of CDMA hop zones can be non-overlapping with other pairs of CDMA hop zones. The two jump zones that each pair can overlap, as shown in -Figure -4, -and the amount of overlap depending on the number of guard subcarriers. The CDMA sub-segment can occupy a CDMA hop zone in each CDMA frame.

The C CDMA sub-segments can nominally occupy C non-overlapping CDMA hop zones. For example, the CDMA C sub-segment can nominally occupy the CDMA 2 * c hop zone when each pair of CDMA hop zones overlap as shown in Figure 4. The CDMA c sub-segment can jump and occupy another CDMA hop zone in each frame CDMA.

A subcarrier may be nominally available for transmission if it is not nominally occupied by a CDMA sub-segment and also if it is not a guard subcarrier. The number of nominally available subcarriers, N_Davailable can be provided as:

Eq. (1)

The cdma-segment may be a function of the PHY frame index and may be different for different PHY frames. In particular, Nsubsegment-cdma may depend on whether or not any CDMA subsegment is being sent in a PHY frame, and,

V = N - N - C * N ¹ AVAILABLE ¹ EFT ^{1 v} GUARD ^{1 v} SUBSEGMENT-CDMA

11/42 if so, the number of CDMA subsegments being sent.

As N_FFT total subcarriers can receive indexes from 0 to N_FFT-1, and N_availableí_Vnominally available subcarriers can receive indexes from 0 to N_DISavailable^-1 · In the example illustrated in Figure 4, a CDMA sub-segment nominally occupies the N_subsegmento-cdma subcarriers in the jump zone CDMA 0, and N_DISPOnominally available subcarriers include the remaining usable subcarriers. The nominally available subcarriers may not be contiguous if there are multiple CDMA subsegments.

The system can support space division multiple access (SDMA) on the forward and / or reverse link. For SDMA on the direct link, a base station can transmit data to multiple terminals simultaneously on a specific subcarrier via multiple transmission antennas. For SDMA on the reverse link, a base station can receive data from multiple terminals simultaneously on a given subcarrier through multiple receiving antennas. SDMA can improve performance (by yield) by supporting multiple simultaneous transmissions on a given subcarrier.

Figure 5 illustrates a drawing of an SDMA 500 tree structure that can be used for forward and / or reverse link. The system can support up to Qsdma simultaneous transmissions on a given subcarrier. A tree structure with Qsdma subtrees can be formed, with each SDMA subtree including N fft gates-hop. A total of Qsdma fft hoppers can be assigned from 0 to Q_SDMA * N _FFT-1 associated with an index p, where p {0, be used for example, increase the defined being and indexes

Each hopper can be

-1}.

Qsdma fft '

12/42

Figure 6 illustrates a drawing of a hopper structure 600. The N_FFT jump gates for each SDMA subtree can be divided into N_fft/ N_SUBZOna, max subzones, with each subzone including N_SUBZOna, max consecutive jump gates in the SDMA subtree. Thus, subzone 0 can include jump gates from 0 to Ns_ÜBZona, max-1 / · sub-area 1 may include Nsubzona, max to 2Nsubzona, max ^-1 / etc. Nsubzone, max can be a configurable value selected by the system. Available jump doors can be usable and can be mapped to N_DISPOnominally available subcarriers. The first S sub-zones can include usable hoppers and can receive indexes from 0 to ΞΙ. The number of usable sub-areas, S, can be provided as:

AVAILABLE

N '

Equation (2:

'SUBZONE-MAX where Γ 1 denotes a ceiling operator that proves the next highest integer value.

Since N_Bavailable / Nsubzone, max may not be an integer value, a given subzone may include less than Nsubzone, max usable hoppers. As N_DISavailable usable jump gates can be allocated as homogeneously as possible in the S sub-zones, for example, with a granularity of a block. One block includes N_Bhopper loco and can be the minimum hopper allocation for a terminal. The following quantities can be computed:

f N:

AVAILABLE 'FROM mod S,

BLOCK 7

V = AZ * ^{1 v} LARGE SUBZONE ^{1 v} BLOCK

N

AVAILABLE

N *, Ç

BLOCK °, and

Eq (3;

Ν = V * ^{1 y} SMALL SUBZONE ^{J v} BLOCK

N

AVAILABLE

N * S

BLOCK °.

13/42 where Γ Ί denotes a floor operator that provides the next smallest integer value, and mod denotes a module operation.

Nsubzona-grande θ equal to Nsubzona, max © includes Nblock more jump gates than N_SUBsmall-zone · Each of 0 to Spartir-1 may include N_SUbzona-grande usable jump gates, and each of the S subzones_PARTi_R Sl can include N_subzone-small usable hoppers. The number of jump gates usable in the sub-area can be denoted as N_SUzone (s), with s = 0, ..., Sl. As a specific example for the numerology shown in Table 1 with a CDMA subsegment, Navailable⁼352 , Nsubzona-max⁼64 , S = 6, S_PAIRyou_R = 4, Nsubzona-grande ⁼ and N_subzone-small = 48. Each of the first four sub-areas includes 64 usable heels, each of the two sub-areas includes 48 usable heels, and the last two sub-areas include unusable heels.

Figure 6 shows a drawing for partitioning the jump doors into subzones. This design can partition an arbitrary number of jump gates usable in subzones with a granularity of a block. Usable hoppers can also be broken into sub-zones in other ways. In general, usable jump gates can be broken with a jump gate structure having any number of levels, and each level can include any number of units. The units on each level can be the same or nearly the same size, as described above, or they can be very different sizes.

Each hopper can have an index p which can be decomposed as follows:

14/42 pmoáN_FFT

N

SUBZONE-MAX J p mod N.

SUBZOl ·

Eq (4)

TV

L BLOCK J r = pmo &amp; N_BLOCK, where q is an index of an SDMA subtree to which the jump gate p belongs;

s is an index of a subzone within the SDMA subtree q to which the jumping gate p belongs;

b is an index of a block within the sub-area s to which the jumping gate p belongs; er is an index of a jump gate within block b corresponding to the jump gate p.

In the description presented here, the phrases element with index x, and element x are used interchangeably. An element can be any quantity.

heel index p can thus be represented with a set of indices (q, s, b, r) and can be expressed as a function of these indices, as follows:

p = q * Navailable ⁺ max-subzone + * N block ^r· Eq (5)

The heel holder is usable if the following conditions are true:

1. s &lt;S, and

2. (p mod Nsubzone, max) &lt;Nsubzone (s).

On the reverse link, a group of jump gates N_BL0C0(which is also referred to as a jump gate block) can be mapped to a group of N_Bloco contiguous subcarriers (which are also referred to as a subcarrier block). This mapping can remain fixed for the duration of one

15/42 PHY RL frame. A tilé is a block of N_Bjumping door loco for the duration of a PHY frame.

The system can support the frequency jump on the direct and / or reverse links. With frequency hopping, information can be sent on different subcarriers at different hopping intervals. A skip interval can be any duration, for example, a PHY frame, an OFDM symbol period, multiple OFDM symbol periods, etc. A set of jump gates can be designed for transmission and can be mapped to a specific set of subcarriers within a given jump interval based on a mapping function. The sequence of jump exchanges for different jump intervals is referred to as a jump sequence. The skip sequence can select different sets of subcarriers at different skip intervals to obtain frequency diversity, randomize interference, and / or other benefits.

In a design, the system can support the GH global jump and LH local jump structures for direct and / or reverse link. GH and LH can also be referred to as the global jump block (GHB), and the local jump block (LHB), respectively. In the GH structure, a hopper can jump over the entire bandwidth of the system. In the LH structure, a hopper can jump within a given subzone. In a drawing, N_GH jump gates in each SDMA subtree can be allocated to GH, and N_Lh jump ports in each SDMA subtree can be allocated to LH, where in general N_GH &gt; 0 and N_LH &gt; 0. GH jump gates can jump globally across the entire bandwidth of the system, while LH jump gates can jump locally within their subzones. The jump located

16/42 can also be restricted to a region of other sizes , for example, multiple subzones.

In a GH structure drawing, a given GH hopper (GH, q, s, b, r) can be mapped to a nominally available subcarrier, as follows:

AVAILABLE-GH

BLOCK

GLOBAL, GH (^UMIN

<img file="BRPI0806293A2_D0003.tif" />

ijQS

SECTOR, GH

<img file="BRPI0806293A2_D0004.tif" />

where H^,^_roRGlt is a permutation function for sector specific and subzone specific GH,

GLOBAL, GH

H ^ lobalgh θ a global permutation function for GH,

Σ NSUBZONE (0 = —- is the number of jump gate blocks

SUBZONE

Heel block that can be used before sub-area s, and

Unavailable-gh is an index of a subcarrier nominally available for the GH hopper.

The q, s, b, r indices can be determined as shown in set of equations 4 (4). In the drawing shown in equation (6), the block index b is provided for the permutation function Hsetorgh / which covers block b for one of the

Nsubzone (S) / Nblock blocks in szone. Hsector, gh can be sector specific and can be a function of superframe index i, PHY frame index j, subtree index q, and subzone index s. The output of saída '^_τοηθΗ is added ab_MIN (s) to obtain an intermediate index ν. The index v is then provided for the H'globalgh 'Ç [^huhmaps block v to a subcarrier block between N available / Nblock nominally available subcarrier blocks. H ^ baljgh can be the same for all sectors and can be a function of the superframe index ie the PHY j frame index. The GH hopper is mapped to a nominally available subcarrier whose index is

17/42 determined by multiplying the output of H '_GLOBArGH with

Nblock and the sum of the result with r.

As noted above, C CDMA subsegments can jump through different CDMA jump zones in different CDMA frames. When the CDMA sub-segments jump, some subcarriers can be moved and other subcarriers can be newly released. The displaced subcarriers are actually subcarriers occupied by the skipped CDMA sub-segments and are not among the nominally occupied subcarriers. Newly released subcarriers are subcarriers nominally occupied by the CDMA sub-segments, but are not actually occupied due to the jump. If the subcarrier foispoNívEL-GH is not a displaced subcarrier, then the GH hopper (GH, q, s, b, r) can be mapped to the Unavailable-gh subcarrier If the Unavailable-gh subcarrier is a displaced subcarrier with index k, then the GH hopper (GH, q, s, b, r) can be remapped to a newly released subcarrier with index k.

In the drawing GH illustrated in equation (6), the Nsubzone (s) / Nblock jump-block blocks usable in each subzone are first exchanged locally within the subzone using H^Js^qETORGH. The N / A / N block hopper blocks exchanged for all S sub-zones are then exchanged globally and mapped to all nominally available subcarrier blocks using H '_g,_obalgh .

Since it is the same across all sectors, the subcarriers allocated to each subzone are the same across all sectors. This can support fractional frequency reuse (FFR) schemes. Hsetorgh is different for different sectors in order to provide the diversity of

18/42

H^{, J}¹¹ GLOBAL, GH interference within each subzone. H^Js^qETORGH and can change every PHY frame, can repeat every 16 super frames, and can be defined based on any exchange generation algorithm known in the art.

Figure 7 shows an example of a jump gate for mapping the subcarrier to the GH structure. In this example, three subzones 0, 1 and 2 are formed with N usable jump gates available, each subzone includes 128 jump gates, and a CDMA sub-segment is shipped in 128 subcarriers. The hopper blocks in each sub-area can first be exchanged with H sector_GH . The exchanged hopper blocks can then be mapped to the subcarrier blocks with H '^_lobalgh .

In the example shown in Figure 7, the CDMA sub-segment can nominally occupy the CDMA 0 hop zone, but it can jump to the CDMA 1 hop zone. The displaced subcarriers are sub-carriers in the CDMA 1 hop zone, but not in the CDMA hop zone. 0. The newly released subcarriers are subcarriers in the CDMA 0 hop zone, but not in the CDMA 1 hop zone. All hop ports mapped to the displaced subcarriers can be remapped onto newly released subcarriers.

In a drawing of the LH structure, a given LH hopper (LH, q, s, b, r) can be mapped on a nominally available subcarrier, as follows:

fD1SPONIBLE-LH ⁼ fUIN-LH (⁵) ⁺ HSETOR, LH (^) * BLOCK + Eq (7) where 77

SECTOR, LH is a permutation function for sector-specific and sector-specific LH;

fMiN-LH ^ = ^^N subzone ^} ^is the number of jump gates usable before sub-area s, and

19/42

<td>Available-lh is</td><td>one</td><td>index</td><td>in</td><td>a sub carrier</td>

<td>nominally available</td><td>for</td><td>the door-</td><td colspan="2">LH jump.</td>

<td>q, s indices,</td><td>be</td><td>r can</td><td>to be</td><td>determined as</td>

<td>shown in the set of</td><td colspan="2">equations (4)</td><td>. At the</td><td>drawing shown</td>

in equation (7), the block index b is provided for the permutation function, which H'set_0Rlh maps block b to one of the

Nsubzone (s) / N_Bloco blocks in subzone s. The LH hopper is mapped to a nominally available subcarrier whose index is determined by multiplying the output of H ^ orlh with N_BLhollow and the sum of the result with re Ímin-lh (s). If the Unavailable-lh subcarrier is not a displaced subcarrier, then the LH hopper (LH, q, s, b, r) can be mapped to the Unavailable-lh subcarrier · If the UnavailableAvailable subcarrier is a displaced subcarrier with k index , then the LH hopper (LH, q, s, b, r) can be remapped to a newly released subcarrier with k index.

In the drawing LH shown in equation (7), the Nsubzones (s) / N_BLhollow hopper blocks usable in each subzone are first exchanged locally within the subzone using H ^_torlh . The N_SDBzone (s) / N_BLhollow hopper blocks exchanged in each subzone are then mapped into a corresponding set of next Nsubzone (s) / N_Bloco subcarrier blocks nominally available. H'setorlh θ

<td>different</td><td>for</td><td>sectors</td><td>many different</td><td>The</td><td>end</td><td>in</td><td>provide</td>

<td>diversity</td><td>in</td><td colspan="2">interference inside</td><td>in</td><td>each</td><td colspan="2">subzone. 0</td>

<td>mapping</td><td>From</td><td>blocks of</td><td>bounce door</td><td colspan="3">swapped</td><td>on each</td>

sub-area for subcarrier blocks is the same across all sectors. HI_RTOr, lh can change with each PHY frame, can repeat every 16 super frames, and can be defined based on any exchange generation algorithm known in the art.

20/42

Figure 8 shows an example of mapping from hopper to subcarrier to the LH structure. In this example, three subzones 0, 1 and 2 are formed with N_DISP_Ousable hopper level, each sub-area including 128 hoppers, and a CDMA sub-segment is shipped on 128 subcarriers. The hopper blocks in each sub-area can first be exchanged with Hft_RWRLH . The exchanged hopper blocks can then be mapped to subcarrier blocks in a predetermined order. The CDMA sub-segment can nominally occupy the CDMA 0 hop zone, but can jump to the CDMA 1 hop zone. All gateways mapped to the displaced subcarriers can be remapped to the newly released subcarriers. Jump gates with a specific sub-area can be mapped to non-contiguous subcarriers due to remapping.

In the drawing described above, each CDMA sub-segment can nominally occupy one set of subcarriers, but can jump to another set of subcarriers. Usable jump gates can be remapped from partitioned subcarriers to newly released subcarriers based on a predetermined remapping scheme. In general, C CDMA subsegments can jump based on an H permutation function_CDMA, which can be independent of the swap functions for usable portals. Whenever a collision occurs between a CDMA sub-segment and a usable hopper, the usable highspeed can be remapped based on an appropriate remapping scheme.

The system can employ the hybrid automatic repeat request (HARQ) to improve the reliability of data transmission. With HARQ, a transmitter can send one or more transmissions to a

21/42 package, one transmission at a time. A receiver can receive each transmission sent by the transmitter and can try to decode all received transmissions to retrieve the packet. The receiver can send an acknowledgment (ACK) if the packet is decoded correctly. The transmitter can stop transmitting the packet after receiving the ACK.

Multiple (L) interlaces can be defined, with each interlacing including PHY frames that are spaced by L PHY frames, where L can be equal to 4, 6, 8, etc. All transmissions in a packet can be sent in one interlacing, and each transmission can be sent in a PHY frame for that interleaving.

The GH and LH structures can be used in several ways. In a drawing, GH or LH can be used for each PHY frame and can be configurable. In another design, both GH and LH can be used for a given PHY frame, for example, GH can be used for N_GB subcarriers and LH can be used for N_LBsubcarriers. In another design, GH can be used for some PHY frames, LH can be used for some other PHY frames, and both GH and LH can be used for some other PHY frames.

In another design, GH or LH can be used for each interlacing and can be configurable. In another design, both GH and LH can be used for a given interlacing. In another design, GH can be used for some interlacing, LH can be used for some other interlacing, and both GH and LH can be used for some other interlacing.

In the direct link, N_FFT-N_GUARD subcarriers may be available for transmission, and N_FFT-N_GUARD heights can be used for each SDMA subtree. At

22/42

Nfft jump ports for each SDMA subtree can be partitioned into N_fft/ N_subzone, max subzones, with each subzone including N_SUbzona, max consecutive jump gates in the SDMA subtree. The size of the subzone for the direct link may or may not be equal to the size of the subzone for the reverse link. The first S sub-zones can include the usable jump gates, where S can be provided as:

Ν -N

S = ^GUARD . Eq (8)

NsubzONE-MAX

As N_FFT-N_guard usable jump gates can be allocated as equally as possible to the S subzones, for example, with a granularity of a block as shown in the set of equations (3), despite N_DISPOlevel be replaced by N_fft-N_GUARDa · Each of 0 to S_LEAVE-1 can include N_subzone__great usable hoppers, and each of the S-zones_LEAVE Sl can include N_ONLYbzona-small usable heel.

In a drawing, the system can support the BRCH and DRCH structures for direct and / or reverse links. In the BRCH structure, a set of jump gates can be mapped into a set of contiguous subcarriers that can vary through frequency with time. The BRCH structure can be used for frequency selective transmissions. In the DRCH structure, a set of jump gates can be mapped into a set of subcarriers that can be distributed across all or a large part of the system's bandwidth. The DRCH structure can be used to achieve frequency diversity.

Figure 9a shows the BRCH structure. Each BRCH user can receive a block of N_BL0C0 contiguous subcarriers for an entire PHY frame. The transmission to each user

23/42

BRCH can be sent in a specific part of the system's bandwidth.

Figure 9b illustrates the DRCH structure. Each DRCH user can receive N_Bloco subcarriers that can be spaced, for example, by 32 subcarriers as shown in Figure 9b. The subcarriers for each DRCH user can jump through and a PHY frame, for example, every two OFDM symbol periods as shown in Figure 9b. The transmission for each DRCH user can be sent through the system's bandwidth.

The system can support multiple multiplexing modes for the BRCH and DRCH structures. In a drawing, two multiplexing modes 1 and 2 can be supported, and a multiplexing can be selected for use.

Figure 10a shows a drawing of the multiplexing mode 1. In this drawing, the DRCH structure pierces the BRCH structure, and a DRCH transmission replaces a BRCH transmission every time a collision occurs.

Figure 10b shows a multiplexing mode drawing 2. In this drawing, the DRCH and BRCH structures are used in the DRCH and BRCH zones, respectively. The spacing between subcarriers for each DRCH user in the DRCH structure may depend on the number of subcarriers in the DRCH zone.

In a drawing, the S subzones can be arranged in DRCH, BRCH and reserved zones. The DRCH zone can include the first Ndrch-subzones 0 to Ndrch-subzones^-1 · The reserved zone can include the last N_RESgrass-sub-areas S-Unreserved-sub-areas to S-1. The BRCH zone can include the remaining subzones. Each subzone in the reserved zone can be mapped to a set of contiguous subcarriers.

24/42

In a drawing of the BRCH structure, a given BRCH hopper (BRCH, q, s, b, r) can be mapped to a corresponding subcarrier, as follows:

AVAILABLE-BRCH ~ NGUARDA, LEFT ⁺ BRCH SHIFT

W₊H^iJ\ byN_{BL0C0 + r}

Eq.9

TTÍjs where “sector is a permutation function for sector-specific and sub-zone BRCH,

N-displacement-brch (S) is the displacement of doors - jump before sub-area s, and available-brch θ an index of a subcarrier for the BRCH jump gate&gt;

The indices q, s, ber can be determined as shown in the set of equations (4). In the drawing illustrated in equation (9), the block index b is provided for the permutation function H'í_ET0R, which maps block b in one of the Nsubzone (s) / Nblock blocks in subzone s. The BRCH hopper is then mapped to a subcarrier whose index is rjijs determined by multiplying the “sector_with Nblock and the sum of the result with r, Nshift-brch (s) θ Nquardaesquerda · Nshift-brch (s) can be computed in different ways for multiplexing modes 1 and 2. The BRCH high door (BRCH, q, s, b , r) is usable and mapped to the subcarrier Íavail-brch if that subcarrier is not used by a reserved hopper. Otherwise, the BRCH hopper (BRCH, q, s, b, r) is not usable.

In the BRCH drawing illustrated in equation (9), the Nsubzone (s) / Nblock jump-block blocks usable in each BRCH subzone are first exchanged locally within the subzone using Hf_ETOR . The N_SUzone (s) / N_BLOco-hopper blocks exchanged in each sub-area are then mapped to a corresponding set of N_SUzone (s) / block of blocks

25/42 subcarrier to the subzone. H ^_T0R it is different for different sectors in order to provide diversity of interference within each sub-area. The sector can change with each PHY frame, can be repeated with every 16 super frames, and can be defined based on any exchange generation algorithm known in the art.

Figure 11 illustrates an example of the mapping of jump carrier on subcarrier to the BRCH structure. In this example, four subzones 0 to 3 are formed, subzone 0 is used for DRCH, subzone 1 is reserved, and subzones 2 and 3 are used for BRCH. The hopper blocks in each BRCH sub-area can first be exchanged with H '£_etor . The hopper blocks exchanged in each BRCH sub-area can then be mapped to the corresponding set of sub-carrier blocks for the BRCH sub-area.

In a drawing of the DRCH structure, a specific DRCH hopper (DRCH, q, s, b, r) can be mapped on a corresponding subcarrier, as follows:

f AVAILABLE-DRCH ⁼ DRCH-SHIFT (^s’ ⁺ DRCH-BLOCKS * ^Γ} ^{m0 (}I DRCH-AVAILABLE θ) where Ndrch-available θ the number of subcarriers available for DRCH, drch-blocks ~ Ndrch-available Nblocks θ ° number of subcarrier blocks available,

Non-displacement-drch ® displacement for block b in sub-area s, and f-available-brch θ an index of a subcarrier for the DRCH hopper.

The displacement N-displacement-drch (^s, b) can be given as:

26/42

Non-displacement-drch (s&gt; U ~ Displacement Zone_DRCH + N _MIN__DRCH._ESPAç_AMENT0 * RefPos_DRCH+ min (RefPos_DRCH 'X MAX-DRCH-SPACE) Eq (11) where Displacement Zone_DRCH is a pseudo-random displacement for the entire DRCH zone,

RefPos_DRCH is a displacement that depends on a specific subzone and sector-specific deviation.

Nmin-drch-spacing ® θ minimum spacing between DRCH subcarriers, and

Nmax-drch-spacing θ θ maximum spacing between DRCH subcarrier.

The indices q, s, ber can be determined as illustrated in equation (4). In the drawing illustrated in equations (10) and (11), the b-block index and the sub-area index s are used to compute a pseudo-random deviation N_DESrental-drch (^s/· ^B) · ^THE jump carrier. DRCH is mapped to a subcarrier whose index is determined by multiplying N_drch-blocks with r, adding the result with displacement-drch (^s &lt;h), and restricting the Ndrch-available subcarriers available to DRCH.

Figure 12a shows an example of a hopper for subcarrier mapping for the DRCH structure for multiplexing mode 1. In this example, four sub-zones 1 to 4 are formed with the N_FFT jump gates in an SDMA subtree, subzone 0 includes N_DRCH additional jump gates for DRCH, sub-area 1 is reserved, and sub-zones 2 to 4 are used for BRCH. The jump gates in each block in the DRCH sub-area can be mapped to subcarriers evenly spaced across the system's bandwidth, but avoiding the set of subcarriers for the reserved sub-area.

27/42

Figure 12b shows an example of a jump gate for mapping the subcarrier to the DRCH structure for multiplexing mode 2. In this example, four subzones 0 to 3 are formed with the N_FFT jump gates in an SDMA subtree, subzone 0 is used for DRCH, subzone 1 is reserved, and subzones 2 and 3 are used for BRCH. The jump gates in each block in the DRCH sub-area can be mapped on subcarriers evenly spaced within the DRCH zone.

A set of N_flcs-blocks jump gate blocks can be allocated to a direct link control segment (FLCS) in each direct link PHY frame. The FLCS can carry control information on the direct link. Jump gate blocks for FLCS can be located within the DRCH zone if a UseDRCHForFLCS field is set to 1 or located within the BRCH zone. The jump gate blocks allocated to FLCS can be exchanged with other jump gate blocks, which can be mapped into subcarrier blocks based on the BRCH or DRCH structure. The FLCS can then occupy the subcarrier blocks to which the exchanged hopper blocks are mapped.

The following procedure can be used to enumerate all the hopper blocks usable within an area where FLCS is allocated.

1. Initialize a high door block counter b to 0.

Initialize a k counter of the usable high door blocks to 0.

2. If the hopper block b in the SDMA 0 subtree consists of only usable hoppers and one of the following conditions is true:

The. The UseDRCHForFLCS field is equal to 1 part of the DRCH zone;

28/42

B. The UseDRCHForFLCS field is equal to 0 and b and is part of the BRCH zone;

Then adjust FLCSUsableBlock [k] - b and increment k by 1.

3. Increment b by 1.

4. Repeat steps (2) and (3) until one of the following conditions is met:

The. The UseDRCHForFLCS field is equal to 1 and the DRCH hopper blocks are exhausted.

B. The UseDRCHForFLCS field is equal to 0 and the BRCH hopper blocks are exhausted.

5. Set TotalNumBlocks = k.

Jump-gate blocks can be allocated to FLCS as follows:

1. Initialize an FLCS hopper block k tile counter to 0.

Initialize a subzone counter s to 0.

Initialize S counters bo, bi, ..., b_s_i of jump gate blocks within the S subzones to 0.

2. If b_s &lt;N_SUBzones (s) / N_BLOco and one of the following conditions remains;

The. The UseDRCHForFLCS field is equal to 1, the szone is part of the DRCH zone, and b_s it is a high-door block usable within that sub-area;

B. The UseDRCHForFLCS field is equal to 0, the szone is part of the BRCH zone, and b_s it is a high-door block usable within that sub-area; So

The. Define the k-th block of the FLCSHopPortBlock [k] of the FLCS to be a block of the N_Bconsecutive jump gates (BRCH, 0, s, b_s, 0) to (BRCH, 0, s, bs, Nblock-i) if the UseDRCHForFLCS field is equal to 0 and a block of N_Bconsecutive jump gates (DRCH, 0, s, b_s,

29/42

0) to (DRCH, 0, s, b_s, N_BLOCK-1) if the UseDRCHForFLCS field is equal to 1.

B. Increment b_s by 1.

ç. Increment k by 1.

3. Set s to (s + l) mod S.

4. If k &lt;N_flcs__BLOCthen repeat steps (2) and

The N_flcs-_BLOcos jumping blocks allocated to FLCS can be exchanged with other jumping blocks to enhance diversity. The association of the exchanged hopper blocks with the hopper blocks allocated to FLCS can be defined as follows. The set of usable hopper blocks can be divided into three control hop zones of approximately equal size Mo, Mi, M₂, where M_O = [TotalNumBlocks / 3j,

M, = | TotalNumBlocks / 3j if TotalNumBlo cos mod 3 = 2 e

Mj = [TotalNumBlocks / 3j otherwise, eM₂ = | ”TotalNumBlocks / 3j.

The intra-zone permutations Hl, H'je, of sizes M_O, Mi, M₂ corresponding to the PHY j table of direct link of superframe i can be defined as follows:

1. Adjust SEED _K = I / hy-hash (15x210x32x4 + PilotIDx32x4 + (i mod 32) x4 + k), where PilotID is a sector ID and / phy-hash ^ a hash function.

2. H_k is a permutation of size M_k generated with SEED seed_k using a permutation generation algorithm, with 0 &lt;k &lt;3. H_k it is independent of the direct link PHY frame index and is therefore constant across a superframe.

3. H'í as a cyclical change of mth order of the permutation H '_k:

30/42

H_k(n) = H_k((n + m) mod M_k), with 0 &lt;n &lt;M_k, where m ⁼ (fpHY-HASH (PilotID + j +1) mod Mk.

The association of the hopper blocks exchanged with the hopper blocks allocated to FLCS in the PHY j frame of direct link of superframe i can be performed according to the following procedure.

1. Initialize a k counter of FLCS hopper blocks to 0.

Initialize a counter of jump gates changed to 0.

Initialize three c counters₀, Ci, c₂ of jump carrier blocks usable within the three control jump zones to 0.

2. Set d = m mod 3.

3. If c_d &lt;M_d So:

The. Adjust exchanged hopper block ExchHopportBlockkij [k] associated with the k-th carrier block

<td>hop FLCSHop-portBlock [k]</td><td>of</td><td>FLCS</td><td>to be</td><td>o (D</td><td> +</td>

<td>H^ljA.D_d)) -th block</td><td>in</td><td>door·</td><td>-high</td><td colspan="2">usable</td>

<td>FLCSUsableBlock [D + H^ijd (c_d) ] ,</td><td>Where</td><td>D = 0</td><td>if d = 0,</td><td>D = M_O</td><td>if</td>

<td>d - 1, and D = (Mo + Mi) if d =</td><td> 2.</td><td></td><td></td><td></td><td></td>

<td>B. Increment c_d</td><td>by 1</td><td>z</td><td></td><td></td><td></td>

ç. Increment m by 1;

d. Increment k by 1;

and. Proceed to 4; otherwise

The. Increment m by 1;

B. Repeat 2 and 3.

4. If k &lt;NpLcs- ^ hollow then repeat 2 and 3.

When the k-th heel block

FLCSHopPortBlock [k] of the FLCS is exchanged with the ExchHopPortBlockij [k] hopper block PHY j link

31/42 straight from superframe i, the subcarrier block corresponding to the FLCSHopPortBlock [k] hopper block can be mapped by the ExchHopPortBlockij [k] hopper block while the corresponding to the hopper subcarrier block

ExchHopPortBlockij [k] can be mapped by the high-block FLCSHopPortBlock [k]

Powder,

Pi,

Pnbloco-i como

Specifically, consider a set of contiguous hoppers within the hopper block

FLCSHopPortBlock [k] and consider p '_O, Ρ 'ι, · · · p'nbloco-1 ^asa set of contiguous jumping gates within the ExchHopPortij [k] jumping gate block. In the OFDM t symbol of the PHY j frame of direct link in superframe i, the m-th high doors inside the FLCSHopPortBlock [k] hopper block can be mapped to the subcarrier mapped by the doorsalto p '_m according to the mapping algorithm for BRCH or DRCH jump gates, for 0 &lt;m &lt;N_BLOCO. In a similar way, the m-th heel door within the high door block ExchHopPortBLOCOij [k] can be mapped to the subcarrier mapped by the heel door p_m according to the mapping algorithm for BRCH or DRCH jump gates, with 0 &lt;m &lt;N_BLOcoThe allocation of jump gate blocks for FLCS is static whereas the allocation of the associated swapped jump gate blocks depends on the direct link PHY frame index and superframe index and is also sector specific.

Figure 13 shows an example of switching from high doors to FLCS. In this example, four subzones 0 to 3 are formed with N_FFT hoppers in an SDMA subtree, and the FLCS receives four hopper blocks F0 to F3, which can be the first hopper block in sub-areas 0 to 3,

32/42 respectively. Three control hop zones 0, 1, 2 can be defined, with each control hop zone including about 1/3 of the usable hopper blocks. The hopper block FO can be associated with an exchanged hopper block EO in the control hop zone 0, the hopper block F1 can be associated with the exchanged hopper block EO in the hop zone control 1, the heel block F2 can be associated with an exchanged heel block E2 in the control heel zone 2, and the heel block F3 can be associated with an exchanged heel block E3 in control jump zone 0. The exchanged hopper blocks can be selected in a pseudo-random way.

hopper block F0 can be mapped to the subcarrier block Sa, and hopper block E0 can be mapped to the subcarrier block Sb. The FLCS can occupy the subcarrier block Sb to which the exchanged high door block E0 is mapped, instead of the subcarrier block Sa to which the allocated jump port block F0 is mapped. The mapping of the other hopper blocks to the subcarrier blocks can occur in a similar way.

Equations (6) to (11) show some drawings of the jump gate mapping for the subcarriers. The mapping of jump gates for subcarriers can also be performed in other ways using other functions, permutations, combinations of permutations, parameters, etc.

The sector-specific and global permutation functions described above can be generated in several ways.

In a drawing, a permutation function fj^ab^d can be generated by first deriving a seed based on a function of all parameters for the permutation function, as follows:

33/42

SEED = fπ ^ π (a, b, d) Eq. (12) where ÍhashÍ © / b, ..., d) can be a hash function of a value obtained with all input parameters a, b, .. ., d. The permutation H^ab'^d it can then be generated with SEED and to a particular size using any permutation generation algorithm known in the art.

Figure 14 shows a drawing of a 1400 process for mapping jump gates for subcarriers. A plurality of jump gates can be partitioned into multiple subzones, with each subzone including a configurable number of jump gates (block 1412). The jump gates within each sub-area can be exchanged based on a permutation function, which can be different for each sub-area and each sector (block 1414).

After permutation, the plurality of portassalto in the multiple subzones can be mapped in a plurality of subcarriers (block 1416). For LH and BRCH structures, a block of jump gates in a subzone can be mapped to a block designated as contiguous subcarriers among the plurality of subcarriers. For the GH structure, a gate block in a subzone can be mapped into a block of contiguous subcarriers among the plurality of subcarriers based on a second permutation function, which can be common for all subzones and all sectors. For the DRCH structure, a block of jump gates in a subzone can be mapped to a set of subcarriers distributed through the plurality of subcarriers.

mapping of jump gates for subcarriers can be performed for jump gates usable only in multiple subzones and can avoid a group of reserved subcarriers, if any. At least one hop port 34/42 can be mapped to at least one subcarrier occupied by a control segment (for example, a CDMA subsegment) and can be remapped to at least one subcarrier assigned to the control segment.

Figure 15 shows a drawing of equipment 1500 for the mapping of jump gates for subcarriers. 0 equipment 1500 includes mechanisms to partition a plurality of jump gates into multiple sub-zones, with each sub-area including a configurable number of jump gates (module 1512), mechanisms to exchange the jump gates within each sub-zone based on a permutation function (module 1514), and mechanisms to map the plurality of jump gates in the multiple sub-zones, after permutation, to a plurality of subcarriers (module 1516).

Figure 16 shows a drawing of a 1600 process for the remapped jump. A set of jump gates can be mapped to a set of subcarriers based on at least one permutation function (block 1612). The set of jump gates can be a block of jump gates, a subzone of jump gates, etc. At least one high door mapped to at least one unavailable subcarrier can be identified (block 1614) and can be remapped to at least one available subcarrier outside the set of subcarriers (block 1616).

For blocks 1614 and 1616, a first group of subcarriers assigned to a control segment (for example, a CDMA subsegment) and a second group of subcarriers occupied by the control segment can be determined. The control segment can jump from the first group to the second group, and each group can include contiguous subcarriers. Subcarriers in the second group may be unavailable, and at least one unavailable subcarrier may be among those in the second group. At

35/42 subcarriers in the first group, but not in the second group, may be available for jump gate remapping, and at least one available subcarrier may be among those subcarriers.

Figure 17 shows a drawing of a 1700 equipment for remapping jump. The 1700 equipment includes mechanisms for mapping a set of jump gates to a set of subcarriers based on at least one permutation function (module 1712), mechanisms for identifying at least one jump gate mapped to at least one unavailable subcarrier (module 1714) and mechanisms for remapping at least one high door to at least one subcarrier available outside the set of subcarriers (module 1716).

Figure 18 shows a drawing of a 1800 process for distributed hopping while avoiding certain subcarriers. At least one subcarrier zone usable for transmission, but which must be avoided, can be determined (block 1812). The at least one zone can include a subcarrier zone reserved for a control segment, a subcarrier zone for BRCH, etc. A set of jump gates can be mapped into a set of subcarriers distributed through a plurality of subcarriers and avoiding subcarriers in at least one zone (block 1814). The subcarriers in the set can be evenly spaced through the plurality of subcarriers. The plurality of subcarriers can span the entire bandwidth of the system, and the at least one zone can include contiguous subcarriers located away from the left and right edges of the system bandwidth, for example, as shown in Figure 12a. The plurality of subcarriers can also cover part of the system's bandwidth, and at least

36/42 minus one subcarrier zone can cover the remainder of the system's bandwidth, for example, as illustrated in Figure 12b.

Figure 19 shows a drawing of a 1900 equipment for the distributed jump while avoiding certain subcarriers. The 1900 equipment includes mechanisms for determining at least one subcarrier zone usable for transmission, but to be avoided (module 1912), and mechanisms for mapping a set of jump gates to a set of subcarriers distributed through a plurality of subcarriers and avoiding subcarriers in at least one zone (module 1914).

Figure 20 shows a drawing of a 2000 process for jumping with switched jump gates. A first high door designated for a control segment (for example, FLCS) can be determined (block 2012). A second high door to exchange with the first high door can be determined (block 2014). The first hopper can be mapped on a first subcarrier (block 2016), and the second hopper can be mapped on a second subcarrier (block 2018). The second subcarrier can be assigned to the control segment (block 2020), and the first subcarrier can be assigned to a transmission designated with the second hopper (block 2022).

The change of jump gates and mapping without subcarriers can be performed for any number of jump gates assigned to the control segment. In a design, a first set of jump gates assigned to the control segment and distributed across a configurable number of sub-zones can be determined. A second set of jump gates for exchange with the first set of jump gates and distributed through a number

Fixed 37/42 of jump zones can be determined. The first set of jump gates can be mapped on a first set of subcarriers, and the second set of jump gates can be mapped on a second set of subcarriers. The second set of subcarriers can be assigned to the control segment, and the first set of subcarriers can be assigned to one or more transmissions designated with the second set of hoppers.

Figure 21 shows a drawing of a 2100 equipment for jumping with interchanged hoppers. The 2100 equipment includes mechanisms for determining a first hopper designated for a control segment (module 2112), mechanisms for mapping the second hopper for exchange with the first hopper (module 2114), mechanisms for mapping the first hopper on a first subcarrier (module 2116), mechanisms for mapping the second hopper on a second subcarrier (module 2118), mechanisms for designating the second subcarrier for the control segment (module 2120), and mechanisms for designating the first subcarrier for a transmission designated with the second hopper (module 2122).

Figure 22 shows a drawing of a 2200 process for performing a local and global jump. The local jump (for example, LH or BRCH) can be performed in a first time interval (block 2212). The global jump (for example, GH or DRCH) can be performed in a second time interval (block 2214). In a drawing, a hopper block can be mapped to a subcarrier block within a subzone for local hopping, and a hopper block can be mapped to a subcarrier block anywhere within the bandwidth of the system for the global leap. In another design, a block of 38/42 jump doors can be mapped into a block of contiguous subcarriers within a subzone for the local jump, and a block of jump doors can be mapped into a set of subcarriers distributed through a plurality of subcarriers for the global leap.

local and global hop can be performed at different time intervals, for example, the first time interval can be for a first interlacing, and the second time interval can be for a second interlacing for HARQ. The local and global jump can also be performed in the same time interval, for example, the local jump can be performed for a first group of subcarriers, and the global jump can be performed for a second group of subcarriers.

Figure 23 shows a drawing of an equipment

2300 for and global. The local hopping equipment 2300 includes mechanisms for performing the local jump in a first time interval (module 2312), and mechanisms for performing the global jump in a second time interval (module 2314).

The modules in Figures 15, 17, 19, 21 and 23 can comprise processors, hardware device devices, electronic, electronic components, logic circuits, memories, etc. or any combination thereof.

Figure 24 shows a block diagram of a base station 110 and two terminals 120x and 120y in system 100. Base station 110 is equipped with multiple antennas (T) 2434a at 2434t. The 120x terminal is equipped with a single 2452x antenna. The 120y terminal is equipped with multiple (R) antennas 2452a to 2452r. Each antenna can be a physical antenna or a set of antennas.

39/42

At base station 110, a transmission data processor (TX) 2420 can receive traffic data from a data source 2412 to one or more terminals programmed for data transmission. The 2420 processor can process (for example, encode, merge and map into symbol) traffic data and generate data symbols. The 2420 processor can also generate and multiplex signaling and pilot symbols with data symbols. A MIMO TX 2430 processor can perform spatial processing of the transmitter (for example, direct MIMO mapping, pre-coding, beam shaping, etc.) on the data, signaling and pilot symbols. The multiple data symbols can be sent in parallel on a single subcarrier via T antennas. The 2430 processor can provide T output symbol strings for T transmitters (TMTRs) 2432a to 2432t. Each 2432 transmitter can perform modulation (for example, for OFDM) on its output symbols to obtain output chips. Each 2432 transmitter can additionally process (for example, convert to analog, filter, amplify, and upwardly convert) its output chips and generate a direct link signal. T direct link signals from transmitters 2432a to 2432t can be transmitted via T antennas 2434a to 2434t, respectively.

At each terminal 120, one or multiple antennas 2452 can receive the direct link signals to be partitioned from base station 110. Each antenna 2452 can provide a received signal to a respective receiver (RCVR) 2454. Each receiver 2454 can process (for example, filter, amplify, downwardly convert and digitize) your received signal to obtain samples. Each 2454 receiver can also perform demodulation (for example, for OFDM) on samples to obtain received symbols.

40/42

At the 120x single antenna terminal, a 2460x data detector can perform data detection (for example, filtering or combined equalization) on received symbols and provide data symbol estimates. A 2470x receiving data processor (RX) can process (for example, symbol demap, deinterleave and decode) data symbol estimates and provide decoded data for a 2472x data store. At the 120y multiple antenna terminal, a 2460y MIMO detector can perform MIMO detection on received symbols and provide data symbol estimates. An RX 2470y data processor can process data symbol estimates and provide decoded data for the 2472y data store.

Terminals 120x and 120y can transmit traffic data and / or control information on the reverse link to base station 110. At each terminal 120, traffic data from a 2492 data source and control information from a 2480 controller / processor it can be processed by a TX 2494 data processor, further processed by a MIMO TX 2496 processor (if applicable), conditioned by one or more 2454 transmitters, and transmitted via one or more 2452 antennas. At base station 110, reverse link signals from terminals 120x and 120y can be received by antennas 2434a to 2434t, processed by receivers 2432a to 2432t and further processed by a MIMO detector 2436 and a data processor RX 2438 to retrieve data from traffic and control information sent by the terminals.

The controllers / processors 2440, 2480x and 2480y can control operation on base station 110 and terminals 120x and 120y, respectively. Processors 2440, 2480x and 2480y can each implement a process 1400 in Figure 14, process 1600 in Figure 16, the process

41/42

1800 in Figure 18, process 2000 in Figure 20, process 2200 in Figure 22, and / or other processes for the techniques described here. A 2444 programmer can program terminals for forward and / or reverse link transmission. Memories 2442, 2482x, and 2482y can store data and program code for base station 110 and terminals 120x and 120y, respectively.

The techniques described here can be implemented by several mechanisms. For example, these techniques can be implemented in hardware, firmware, even.

For microcontrollers, electronics, other software, or a combination of hardware implementations, 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 integrated circuits application-specific (ASICs), digital signal processors (DSPs), digital signal processing devices (DSPDs), programmable logic devices (PLDs), field programmable port arrangement (FPGAs), processors, controllers, microprocessors, devices electronic units designed to perform the functions described here, a computer or a combination thereof.

For a firmware and / or software implementation, the techniques can be implemented with code (for example, procedures, functions, modules, instructions, etc.) that performs the functions described here. In general, any computer / processor-readable medium that tangibly includes the 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 (for example, memory 2442, 2482x, or 2482y, in Figure 24) and executed by a

42/42 processor (for example, the 2440, 2480x and 2480y processor). 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), memory only programmable reader (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 to perform certain aspects of the functionality described here.

The previous description of the description is provided to allow anyone skilled in the art to create or make use of the description. Various modifications of the description will be readily apparent to those skilled in the art, and the generic principles defined here can be applied to other variations without departing from the spirit or scope of the description. Accordingly, the description should not be limited to the examples and drawings described here, but the broader scope consistent with the principles and novelty features described here must be agreed.