Login| Sign Up| Help| Contact|

Patent Searching and Data


Title:
METHODS FOR SUPERFRAME/FRAME OVERHEAD REDUCTION WITHIN OFDMA-BASED COMMUNICATION SYSTEMS
Document Type and Number:
WIPO Patent Application WO/2009/091931
Kind Code:
A1
Abstract:
A method for tessellating a subframe using maximal-sized bricks. A brick bandwidth and a brick time duration are computed based on the heights and widths of the bursts in the subframe. Bursts within the brick-tessellated subframe are referenced using a brick-based coordinate system in which burst location and size are specified in units of bricks. A method for assembling and disassembling brick-based superframes is also disclosed. Bricked-based superframes are assembled and disassembled using a Superframe Preamble, a Superframe Control Header (SFCH), a Superframe Downlink Map (SDL- MAP), a Superframe Uplink MAP (SUL-MAP) and brick-structured downlink and uplink frames.

Inventors:
OLSZEWSKI KIM (US)
CAI SEAN (US)
Application Number:
PCT/US2009/031165
Publication Date:
July 23, 2009
Filing Date:
January 15, 2009
Export Citation:
Click for automatic bibliography generation   Help
Assignee:
ZTE USA INC (US)
OLSZEWSKI KIM (US)
CAI SEAN (US)
International Classes:
H04L27/26; H04B7/26
Foreign References:
US20070140167A12007-06-21
US20070086474A12007-04-19
US20070047432A12007-03-01
US20060126553A12006-06-15
Other References:
YAIR BOURLAS ET AL.: "Considerations for UL MAP Overhead Reduction", IEEE C802.16MAINT-07/053, 4 November 2007 (2007-11-04), pages 2 - 5
Attorney, Agent or Firm:
GAO, Harris (12531 High Bluff Drive Suite 10, San Diego CA, US)
Download PDF:
Claims:

WHAT IS CLAIMED IS:

1. A method of tessellating a subframe using maximal-sized bricks, each brick comprising a brick bandwidth (r) in units of subcarriers or physical subchannels, and a brick time duration (c) in units of symbols, the subframe comprising a plurality of (ne) bursts having burst heights ( β H k , k = Q,...,n B -l ) m units of subcarriers or physical subchannels and burst widths {β w k , k = 0,...,n B —\ ) m units of symbols, the method comprising: computing r and c using equations r = GCD(β H 0 , β H λ ,..., β H n _ λ ) and c = GCD(β w 0 , β w v ..., β w n _ j ) , wherein GCD denotes the greatest common divisor, and neither r nor c is equal to one; and

referencing bursts within the subframe using a brick-based coordinate system in which burst location and size are specified in units of bricks.

2. The method of claim 1, further comprising computing the GCD using the Euclidean algorithm.

3. The method of claim 1, further comprising computing the GCD using the Extended Euclidean algorithm.

4. The method of claim 1, further comprising computing the GCD using the binary GCD algorithm.

5. The method of claim 1, wherein r and c are computed once per subframe.

6. The method of claim 1, wherein a Mi burst within the subframe is represented by a symbol offset ( OFDMA_Symbol_Ojfset[k] ), a number of symbols

( Number_of_Symbols[k] ), a subchannel offset ( OFDMA_Subchαnnel_Offset[k] ), and a

number of subchannels ( Number _of_Subchαnnels[k] ).

7. The method of claim 6, further comprising referencing the Mi burst within

the subframe by a burst time offset ( Burst_Time_Offset[k] ), a burst time duration

( Burst_Time_Durαtiont[k] ), a burst frequency offset ( Burst_Frequency_Offset[k] ), and

a burst bandwidth ( Burst _Bαndwidth[k] ), wherein

OFDMA_Symbol_Offset[k] Burst _Tιme_Offset[k] = ,

Number_of_Symbols[k] Burst _Tιme_Durαtwnt\k\ =

. „ r ϊ π OFDMA Subchannel Offset[k] Burst_Frequency_Offset[k] = , and

, . , , ,., -, Number _of_Subchannels[k] Burst _Bandwιdth[k] =

8. The method of claim 1, further comprising computing the number n R of

r -by- c bricks that cover the subframe' s bandwidth in the time-frequency plane using the

N equation n R = — ^^ , where N FFT denotes the number of subcarriers or subchannels. r

9. The method of claim 8, further comprising computing an integer m F1 using

the operation m = ceil(log 2 (n R )) , wherein ceil(\og 2 (n R )) rounds \og 2 (n R ) to the nearest

integer towards infinity.

10. The method of claim 9, further comprising setting the lengths of

Burst_Frequency_Offset[k] and Burst _Bandwidth[k] as m F1 .

11. The method of claim 1, further comprising computing the number n c of

r -by- c bricks that cover the subframe' s time duration in the time-frequency plane using

N the equation n c = — ^HLJ- ; wherein N s mbh denotes the number of symbols within the

subframe.

12. The method of claim 11, further comprising computing an integer m F0 using the operation m F0 = ceil (log 2 (n c )) , wherein ceil(log 2 (n c )) rounds Iog 2 (w c ) to the nearest integer towards infinity.

13. The method of claim 12, further comprising setting the lengths of Burst_Time_Ojfset[k] and Burst _Time_Duration[k] as m F0 .

14. A method for assembling a brick-based superframe, the superframe comprising a Superframe Preamble, a Superframe Control Header (SCH), a Superframe Downlink Map (SDL-MAP), and a Superframe Uplink MAP (SUL-MAP), the SDL-MAP comprising a plurality of ( n SF ) Downlink Maps (DL-MAPs) for configuring a plurality of

( n SF ) subframes, each DL-MAP comprising a plurality of (n B ) Information Elements (IEs) for configuring a plurality of (n B ) bursts, the method comprising:

inserting a plurality of (n B ) bursts having burst heights ( R H - k ' k = 0 >• • •> n B — 1 ) m

units of subcarriers or physical subchannels and burst widths ( R w - k ' k = 0 >• • •> n B — 1 ) m units of symbols into a subframe;

computing a brick bandwidth (r) and a brick time duration (c) using equations r = GCO(β H 0H V ...,β H nB _ 1 ) and c = GCO(β W 0w v ...,β W rtB _ 1 ) , wherein GCD denotes the greatest common divisor, and neither r nor c is equal to one;

inserting r and c into a DL-MAP;

computing a burst time offset ( Burst_Time_Offset[k] ), a burst time duration

( Burst _Time_Durationt[k] ), a burst frequency offset ( Burst_Frequency_Offset[k] ) and

a burst bandwidth ( Burst _Bandwidth[k] ) for a Mi burst within the subframe;

inserting Burst_Time_Offset[k] , Burst_Time_Durationt[k] ,

Burst _Frequency_Ojfset[k] , and Burst_Bandwidth[k] into an Information Element (IE)

within the DL-MAP.

15. The method of claim 14, wherein a Mi burst within the subframe is

represented by a symbol offset ( OFDMA_Symbol_Ojfset[k] ), a number of symbols

( Number_of_Symbols[k] ), a subchannel offset ( OFDMA_Subchannel_Offset[k] ), and a

number of subchannels ( Number _of_Subchannels[k] ).

16. The method of claim 15, wherein

* r n OFDMA Symbol Ojfset[k] Burst_Tιme_Ojfset[k] = — ^^ — — - ,

π. ^r π Number of Symbols[k] Burst _Tιme_Duratιont[k] = — -

_ „ r ϊ π OFDMA Subchannel Ojfset[k] Burst_Frequency_Offset[k] = = ^^ — — , and

, . , I r l _ Number of Subchannels[k] Burst _Bandwιdth[k] = =^= —

17. The method of claim 14, further comprising computing the number n R of

r -by- c bricks that cover the subframe' s bandwidth in the time-frequency plane using the

N equation n R = — ^^ , where N FFT denotes the number of subcarriers or subchannels. r

18. The method of claim 17, further comprising computing an integer m

using the operation m F1 = ceil(\og 2 (n R )) , wherein ceil(log 2 (n R j) rounds \og 2 (n R ) to the

nearest integer towards infinity.

19. The method of claim 18, further comprising setting the lengths of

Burst _Frequency _Offset[k] and Burst_Bandwidth[k] as m F1 .

20. The method of claim 14, further comprising computing the number n c of

r -by- c bricks that cover the subframe's time duration in the time-frequency plane using

N the equation n c = — ?^IL ; wherein N s mbh denotes the number of symbols within the c ym

subframe.

21. The method of claim 20, further comprising computing an integer m F0

using the operation m F0 = ceil (log 2 (n c )) , wherein ceil(\og 2 (n c )) rounds Iog 2 (n c ) to the

nearest integer towards infinity.

22. The method of claim 21, further comprising setting the lengths of

Burst _Time_0ff set [k] and Burst _Time_Duration[k] as m F0 .

23. The method of claim 14, wherein the superframe comprises a plurality of

frames, and each frame comprises one DL subframe and one UL subframe.

24. The method of claim 14, wherein the superframe comprises a downlink-

uplink ratio of 1-to-l.

25. The method of claim 14, wherein the superframe comprises a downlink-

uplink ratio that is not 1-to-l.

26. A method for disassembling a brick-based superframe, the superframe

comprising a Superframe Preamble, a Superframe Control Header (SCH), a Superframe

Downlink Map (SDL-MAP), and a Superframe Uplink MAP (SUL-MAP), the SDL-MAP

comprising a plurality of ( n SF ) Downlink Maps (DL-MAPs) for configuring a plurality of ( n SF ) subframes, each DL-MAP comprising a plurality of (ne) Information Elements (IEs) for configuring a plurality of (ne) bursts, the method comprising: processing a DL MAP to obtain a brick bandwidth (r) and a brick time duration (c) of the bricks that tessellate a subframe;

processing an IE within the DL MAP to obtain a burst time offset ( Burst _Time_Ojfset[k] ), a burst time duration ( Burst _Time_Durationt[k] ), a burst frequency offset ( Burst_Frequency_Offset[k] ) and a burst bandwidth ( Burst_Bandwidth[k] ) for a Mi burst within the subframe;

computing a symbol offset ( OFDMA_Symbol_Ojfset[k] ), a number of symbols ( Number_of_Symbols[k] ),a subchannel offset ( OFDMA_Subchαnnel_Offset[k] ), and a number of subchannels ( Number _of_Subchαnnels[k] )for the Mi burst within the subframe using equations OFDMA_Symbol_Offset[k] = Burst_Time_Offset[k] * c , Number_of_Symbols[k] = Burst_Time_Durαtion[k] * c , OFDMA_Subchαnnel_Offset[k] = Burst _Frequency_Offset[k] * r , and Number _of_Subchαnnels[k] = Burst_Bαndwidth[k] * r .

27. The method of claim 26, wherein the superframe comprises a plurality of frames, and each frame comprises one DL subframe and one UL subframe.

28. The method of claim 26, wherein the superframe comprises a downlink- uplink ratio of 1-to-l.

29. The method of claim 26, wherein the superframe comprises a downlink- uplink ratio that is not 1-to-l.

Description:

METHODS FOR SUPERFRAME/FRAME OVERHEAD

REDUCTION WITHIN OFDMA-B ASED

COMMUNICATION SYSTEMS

RELATED PATENT APPLICATIONS

[0001] This application claims benefit of priority under 35 U.S.C. §119(e) to Provisional Application No. 61/021,284, entitled "Methods for Superframe/Frame Overhead Reduction Within OFDMA-Based Communication Systems", filed January 15, 2008; which is incorporated by reference herein in its entirety.

FIELD OF THE INVENTION

[ 0002 ] This invention relates to wireless communication networks, systems and techniques that employ Orthogonal Frequency Division Multiple Access (OFDMA) for the air interface. This invention discloses methods for reducing the number of overhead bits within OFDMA superframe and frame structures.

BACKGROUND OF THE INVENTION

[ 0003 ] OFDMA is a multi-user version of OFDM in which network users are allocated subsets of orthogonal subchannels. Each orthogonal subchannel has an equal bandwidth and is centered on the unique frequency of a subcarrier signal. The frequencies of the subcarrier signals are equally and minimally spaced so data modulation of the subcarrier signals facilitates optimal bandwidth efficiency. A subchannel subset may include all available subchannels or a group of adjacent or non-adjacent subchannels.

Subchannel allocation to network users is typically the task of a scheduler. The scheduler may allocate subchannels to users based on criteria such as subchannel quality and users required quality of service.

[ 0004 ] FIG. IA illustrates an exemplary frame structure for an IEEE 802.16 OFDMA-based system that operates in a Time Division Duplexing (TDD) mode. Referring to FIG. IA it is seen that the OFDMA frame consists of a downlink (DL) and an uplink (UL) subframe with the DL subframe 101 always preceding the UL subframe 102. The DL and UL subframes are separated by a Transmit Transition Gap (TTG) 103 and a Receive Transition Gap (RTG) 104. These two gaps prevent DL and UL transmission collisions. Basic frame elements from which dynamic and complex IEEE 802.16 OFDMA frame structures are built are described in the remaining paragraphs of this section.

[ 0005 ] OFDMA Symbol. An OFDMA symbol is the smallest frame allocation unit in the time domain. In FIG. IA there are L downlink OFDMA symbols and M uplink OFDMA symbols.

[0006] Logical Subchannels. FIG. IA also shows S logical subchannels for the exemplary IEEE 802.16 DL and UL subframes. Logical subchannels are the smallest logical unit within the frequency domain. A logical subchannel is comprised of a set of physical subchannels that may be adjacent or non-adjacent. The set of subcarriers used for a logical subchannel may change from one OFDMA symbol to another. In a DL subframe, a logical subchannel may be intended for one or more receivers; in an UL subframe, a transmitter may be assigned one or more logical subchannels, and several transmitters may transmit their UL logical subchannels simultaneously.

[ 0007 ] Logical Subchannel Group. A logical subchannel group is comprised of one or more logical subchannels. FIG. IB shows 6 logical subchannel groups for an exemplary IEEE 802.16 DL subframe.

[ 0008 ] Segment. A segment is a set of logical subchannel groups; it is a subdivision of the set of available OFDMA logical subchannels that may include all available logical subchannels. FIG. IB shows three segments within a DL subframe. Segments are typically associated with the three sectors of a base station cell.

[0009] Zones. An IEEE 802.16 OFDMA frame is typically comprised of one or more zones (see FIG. 1C). A zone is one complete logical time-frequency part or partition of an OFDMA subframe. There are a number of types of zones. The most used zone types are called Fully Used Subchannel (FUSC) zones and Partially Used Subchannel (PUSC) zones. FUSC zones use all OFDMA logical subchannels; PUSC zones use a subset of available logical subchannels. A PUSC zone must occur as the first DL zone in every DL subframe. FIG. 1C shows an exemplary PUSC zone 121 within a DL subframe. In addition to FUSC and PUSC zones there are other types of DL and UL zones such as PUSC with the complete set of logical subchannels, optional FUSC, AMC (Adaptive Modulation and Coding), AAS (Adaptive Antenna System), TUSCl (Tile Usage of Sub- Channel 1) and TUSC2 (Tile Usage of Sub-Channel 2). The maximum number of the various DL zones types within a subframe is 8. The transition between zones is indicated by information elements within frame control structures.

[ 0010 ] Bursts. A burst is a rectangular or square area within a subframe zone comprised of a specified number of logical subchannels and a specified number of OFDMA symbols. Burst are shown in FIGs. IA, IB, 2A and 2B. Bursts contain OFDMA user's FEC encoded and modulated MAC packet or protocol data units. OFDMA supports

adaptive burst profiling meaning coding and modulation may be changed for each burst. For each user, the maximum number of bursts to decode in one DL subframe is 64. As shown in FIG. 2B, the location of a burst within a subframe is specified using four fixed- length parameters or fields: OFDMA symbol offset 210, logical subchannel offset 211, number of logical subchannels 212, and number of OFDMA symbols 213. [ 0011 ] Slots. Each burst is comprised of a number of slots (see FIG. 2B). A slot is the minimum possible data allocation unit within a OFDMA frame structure, its size is defined in terms of time and frequency. A slot' s size depends on zone type and is one logical subchannel by one, two, three, or six OFDMA symbols. [ 0012 ] Preamble. A BPSK modulated preamble (see FIG. 2A) is broadcast to all network users and is typically used for DL synchronization (cell search, frame timing acquisition, frequency offset estimation, symbol timing estimation) and channel estimation. It is a reference signal known by all network receivers.

[ 0013 ] Frame Control Header. A Frame Control Header (FCH) follows the preamble field and for high reliability it is transmitted using QPSK modulation, rate 1/ 2 channel coding and four-fold repetition encoding (four logical subchannels with successive logical subchannel numbers). The FCH provides frame configuration information such as logical subchannel groups to be used on the first DL-PUSC zone and a DL Frame Prefix (DLFP). The DLFP provides information for the subsequent DL-MAP (Medium Access Protocol). The DLFP contains information such as subchannel groups used by the DL-MAP, subchannel repetition coding used in the DL-MAP, modulation and channel coding used in DL-MAP, and the length of the DL-MAP burst in units of slots.

[0014 ] DL-MAP and UL-MAP. Referring to FIG. 2A DL/UL MAPs are used to broadcast frame allocation information and other control information for subsequent DL and UL subframes. Allocations specified by the DL-MAP or UL-MAP do not span over multiple zones. DL/UL MAPs begin with header fields followed by a sequence of one or more information elements.

[ 0015 ] Information Elements. Referring to FIG. 2A DL/UL MAPs contain one information element (IE) for each burst allocated or scheduled for subsequent DL and UL subframes. In both DL/UL MAPs the very last IE is empty and indicates the end of a subframe (not shown in FIG. 2A). Each IE includes a DL or UL interval usage code (DIUC or UIUC). An interval usage code specifies a unique burst profile that is to be used for a DL or UL burst. Burst profiles specify a burst's coding and modulation. Each IE also includes fields that define the size and location of its associated burst within a DL or UL subframe. A burst's size and location is represented using four IE fields. The four fields specify a burst's OFDMA symbol offset, the number of OFDMA symbols comprising the burst, its OFDMA subchannel offset, and the number of logical subchannels comprising the burst. The symbol offset field uses the preamble as a reference. Burst power level and repetition coding scheme may also be included within an IE.

[0016] Logical Ranging, CQI and A CK Subchannels . Referring to FIG. 2A an UL Ranging Subchannel is used to perform closed-loop time, frequency, and power adjustment as well as bandwidth requests. Four types of ranging are defined: (1) ranging for UL synchronization in time and frequency, (2) initial ranging for when a user enters the network, (3) periodic ranging after a connection is set up, (4) hand-over ranging, and (5) bandwidth request. The UL CQICH (channel quality indicator subchannel) is used by

users to feedback channel-state information. The UL ACK Subchannel is used by users to

feedback DL Hybrid- ARQ acknowledgements.

[ 0017 ] The above described OFDMA frame structure requires a significant amount

of frame overhead to schedule or allocate bursts to a number of OFDMA users. The

majority of the overhead is associated with the DL/UL MAPs. More specifically, within

the DL/UL MAPs sequences of information elements are needed to define dynamic DL

and UL bursts within subsequent DL and UL subframes. For each IE, the following four

fields are required to specify the size and location of a burst within a subframe:

OFDMA_Symbol_Offset

Number _of_Symbols OFDMA_Subchannel_Ojfset Number _of_Subchannels Indeed, the lengths of these four fields should be minimal in order to reduce frame

overhead. To better see the impact of these four fields on frame overhead refer to FIG. 2B

where an example DL burst within a subframe' s time-frequency plane is illustrated. The

units on the time axis are OFDMA symbols. The units on the frequency axis are logical

subchannels. It is easy to see from FIG. 2B that the total number of bits required to

reference a single burst within the subframe is 27 bits (summation of the number of bits

for all four fields). The maximum number of bursts to decode in one DL subframe is 64,

hence, the maximum IE overhead required to specify the size and locations of these bursts

is 64x27 = 1728 bits. If the number of OFDMA subcarriers is N FFT = 1024 and each

OFDMA subchannel carries two bits (assuming QPSK modulation) the four IE fields for

burst size and location would require 864 subcarriers for their transmission. This will

leave only 160 OFDMA subcarriers to use for the FCH and UL-MAP, note that UL

capacity will be significantly impacted. Another OFDMA symbol may be needed for the

UL-MAP which would decrease the throughput data rate. In addition, subchannels will be needed for guard-bands, DIUC, and other DL fields that may carry information such as base station identifier, MIMO parameters, multi-hop relaying information, power levels, etc. Repetition coding of the subframe header fields over two or more subchannels will further decrease the number of bits available.

SUMMARY OF THE INVENTION

[0018] Embodiments of the invention provide a logical frame element called a brick. A brick is an area of contiguous OFDMA symbols and subcarriers (or physical subchannels) within a subframe that is treated as a single logical unit. In one embodiment, a brick covers a rectangular or square area within a subframe' s time-frequency plane and may be varied in its dimensions to adapt to dynamic burst sizes and locations within a subframe. Burst sizes and locations within a subframe are dependent on time-varying channel, interference and network conditions.

[0019] A tessellation of a two-dimensional plane is a collection of plane structures that fills the plane with no overlaps and no gaps. Embodiments of the invention provide methods for tessellating OFDMA subframes using maximal-sized bricks. OFDMA bursts within a brick- tessellated subframe can be referenced using a brick-based coordinate system in which burst location and size are specified in units of bricks rather than units of logical subchannels and OFDMA symbols. The brick-based coordinate system allows the lengths of superframe/frame overhead fields to be reduced and to vary based on burst sizes. The reduction in overhead bits can be significant and is dependent on brick dimensions, the larger the brick dimensions the greater the reduction.

[0020] According to an embodiment of the invention, a method for assembling and disassembling brick-based superframes is also disclosed. Bricked-based superframes are assembled using a Superframe Preamble, a Superframe Control Header (SFCH), a Superframe Downlink Map (SDL-MAP), a Superframe Uplink MAP (SUL-MAP) and brick-structured downlink and uplink frames. The disclosed brick-based superframe structure subsumes the frame structures that are used in current IEEE 802.16 systems and can be easily modified or extended for other OFDMA-based systems. Brick-based Information Elements within the SDL-MAP and the SUL-MAP provide the necessary overhead fields.

BRIEF DESCRIPTION OF THE DRAWINGS

[0021] FIG . 1 A illustrates an exemplary OFDMA frame (prior art) .

[ 0022 ] FIG. IB illustrates an exemplary OFDMA DL subframe (prior art).

[0023] FIG. 1C illustrates an exemplary OFDMA DL subframe with zones (prior art).

[0024 ] FIG. 2A illustrates an exemplary frame burst allocation using Information

Elements within DL and UL MAPs (prior art).

[ 0025 ] FIG. 2B illustrates four burst fields that are required to specify a burst's size and location within a subframe (prior art).

[0026] FIG. 3 A illustrates an exemplary apparatus for mapping user data streams to data bursts (prior art).

[0027 ] FIG. 3B illustrates an exemplary apparatus for mapping data bursts to a subframe (prior art).

[0028] FIG. 4 illustrates the definition of a brick structure.

[0029] FIG. 5 A illustrates an exemplary brick-based OFDMA superframe with symmetric 1:1 DL/UL ratio.

[ 0030 ] FIG. 5B illustrates exemplary fields for a variable size superframe DL-MAP

(SDL-MAP).

[0031] FIG. 5C illustrates exemplary brick-based fields for a DL-MAP.

[ 0032 ] FIG. 6 A illustrates an exemplary brick tessellation of OFDMA DL subframe.

[ 0033 ] FIG. 6B illustrates an exemplary brick tessellation of OFDMA DL subframe.

[ 0034 ] FIG. 6C illustrates an exemplary brick tessellation of OFDMA DL subframe.

[ 0035 ] FIG. 6D illustrates an exemplary brick tessellation of OFDMA DL subframe.

[0036] FIG. 7 A shows an exemplary method flowchart for SDL-MAP assembly.

[ 0037 ] FIG. 7B shows an exemplary method flowchart for SDL-MAP disassembly.

[0038] FIG. 7C shows exemplary equations for addressing SDL-MAP fields and DL subframe bursts.

DETAILED DESCRIPTION OF EXEMPLARY EMBODIMENTS [0039] In the following descriptions of exemplary embodiments references are made to the accompanying drawings. It is to be understood that other embodiments may be utilized and structural changes may be made to the drawings without departing from the scope of the preferred embodiments.

APPARATUS FOR OFDMA BURST GENERATION [0040] FIG. 3A shows an exemplary apparatus for mapping N p user data streams to data bursts that comprise OFDMA DL subframes. The apparatus shows simplified signal processing operations. The parallel implementation within FIG. 3A is only used to simplify the description. In an actual implementation of the apparatus a single encoder and a single modulator may be time shared between the users.

[0041] In FIG. 3A adaptive forward error correction(FEC) coding and adaptive M - QAM modulation are used to assure variable degrees of service quality for the N p users.

For example, the parameter M for the adaptive M -QAM modulator may be set to M = A (QPSK), M = 16 (16-QAM) or M = 64 (64-QAM). The code and/or code rate of the FEC encoder may also be adapted. Some code options for the FEC encoder include Convolutional Codes, Duo-Binary Turbo-Codes (also called convolutional turbo codes) and Block Low Density Parity Check (LDPC) codes, and the like. Duo-Binary Turbo- Codes and Block-LDPC Codes provide excellent performance for medium to large data block sizes (> 200 bits). Block-LDPC Codes outperform Duo-Binary Turbo-Codes at large data block lengths and/or high code rates. The use of convolutional codes is best for data block lengths (< 200 bits). To achieve the best possible performance an adaptive encoder could use Duo-Binary Turbo-Codes codes for short data blocks with low-to- medium code rates and Block LDPC codes for long data blocks with high code rates. Binary convolutional codes could be used only for very short data blocks ( < 200 bits). [ 0042 ] In FIG. 3A the N p user data sources produce data blocks of various lengths κ k , k = 0,..., N p -1. These data blocks are then input to adaptive FEC encoders that are parametrized by pairs (η k , κ k ) where η k denotes the length of an encoded data block.

After interleaving the encoded data blocks are then input to the adaptive M -QAM modulators. For each value of M , the M -QAM modulator collects or buffers m k = log 2 (M) bits from the interleaver and maps the resulting length- m k bit vector to a modulation symbol within the selected M -QAM signal constellation.

[0043] The length of a user' s data burst is dependent on the triple (η k , κ k ,m k ) , k = 0,..., N p -1. For example, if κ k = 48, η k = 96 , and m k = 4 the length of the resulting

burst is defined as β k = η k I m k = 24 . In one embodiment of the invention data block

lengths κ k , encoded data block lengths η k and the number of bits per M -QAM

modulation symbol m k shall be set so that the resulting burst length β k is a divisor of

two. Table 1 shows an exemplary set of values for parameters κ k , η k and m k and

resulting burst lengths β k .

Code Data Coded M- Burst

QA

M Rate Bits Bits Bits Length

* /%) («i) (% ) K ) (A )

1/2 320 640 2 320

2/3 640 960 4 240

3/4 960 1280 4 320

5/6 1280 1536 6 256

Table 1. Example parameters κ k , η k , m k and β k .

[0044 ] In one embodiment, a burst is a rectangular or square area within a subframe

comprised of a specified number of logical subchannels/subcarriers (frequency slots) and

a specified number of OFDMA symbols (time slots). Hence a set of n B subframe bursts

may be parametrized by their heights ( β H k , k = 0,..., n B - 1 ) and their widths ( β w k

k = 0,..., n B -1 ) where burst heights β H k are in units of OFDMA logical subchannels or

subcarriers and burst widths β w k in units of OFDMA symbols (see FIG. 2B).

[ 0045 ] As shown in FIG. 3A bursts output from the serial-to-parallel converter are

input to the DL OFDMA scheduler. The DL OFDMA scheduler maps each burst of length

β k to a rectangular area within a subframe' s time-frequency plane. The area of the k th

burst β k is β H k x β w k . The DL OFDMA scheduler can be viewed as an apparatus that

reshapes each length- β k burst vector into a β H k -by- β w k burst matrix within a

subframe's time-frequency plane.

[0046] FIG. 3B shows an exemplary apparatus for implementing the DL OFDMA

scheduler, the DL Traffic Queues and the IFFT modulator (N FFT = 8 ). The scheduler

routes its input data to the first- in, first-our traffic queues. In the example the scheduler

routes User 1 symbols to the queues for OFDMA subcarriers 0 through 3; user 2 symbols

are routed to the queues for OFDMA subcarriers 4 through 7. Note that each column in

the traffic queues is associated with an OFDMA symbol. The IFFT block subcarrier

modulates each column it receives as input.

[0047 ] FIG. 3B also shows two user bursts 311, 312 that comprise an area of a DL

subframe. Each burst row is associated with an OFDMA subcarrier and each column an

OFDMA symbol. The area of the bursts are β H 1 w l = S and β H 2 W 2 = l2 where

β H j = 4 , β w j = 2, β H 2 = A , and β w 2 = 3 . Burst elements are defined as

p = 0, 1,..., 7, $ = 0,l,2

where p denotes a discrete subcarrier frequency and q the transmit time of an OFDMA

symbol or equivalently the OFDMA symbol number. The summation defines an inverse

fast Fourier transform operation on a length N FFT = 8 vector of M -QAM modulation

symbols {s{n,q)}^ τ~ι . At the receive end, User 1 would have to wait for two OFDMA

symbol time intervals before it can decode its data burst. At the receive end, User 2 would

have to wait for three OFDMA symbol time intervals before it can decode its data burst.

BRICK-TESSELLATED SUBFRAMES

[0048] Referring to FIG.4 a brick B(p 0 : p r _ λ , q 0 : q c _ λ ) 400 is defined as a adaptable

size r-by-c matrix

x(Po>q o ) •• χ (Po>q c -i)@)

B(P 0 : /Vi > q o :q c . λ ) = (2) i(5) x(p r -v q 0 ) • • x(p r -i,q c -i)

[0049] that is treated as a unique logical unit within a OFDMA subframe. Brick

elements are defined as

:IN P

(3)

' FFT «=° α = 0,l,...,r-l b = 0,l,...,c-l

[0050] where x(p a ,q b ) is produced via a length- N FFT IFFT operation on a

modulation symbol sequence {s(n,q)} n ^ τ .Integers p a (a = 0,l,...,r-l) and q b

( b = 0, 1,..., c - 1 ) denote subcarrier frequencies and OFDMA symbol numbers, they are

contiguous and ordered as follows:

0< p 0 < P 1 < p 2 < ■■■ < /V 1 < N FFT -1 (4)

0 ≤ q 0 < q λ < q 2 < • • • < q c -ι (5)

[ 0051 ] For example, the brick B(4:7, 3:4) is defined as

44,3) 44,4) "

45,3) 45,4)

B(4:7,3:4) = (6)

46,3) 46,4)

47,3) 47,4)

where p 0 = 4 , p x = 5 , p 2 =6, p 3 = 7 , q 0 = 3 , and q x = 4.

[ 0052 ] A tessellation of a two-dimensional plane is defined as a collection of two- dimensional geometrical shapes that fills the plane with no overlaps and no gaps. According to one embodiment of the invention, a brick tessellation of a rectangular subframe is defined as a collection of two-dimensional bricks that fills a subframe with no overlaps or gaps between the bricks. It is a logical partitioning of a subframe using bricks that are associated with various OFDMA bursts. FIG. 6A, 6B, 6C and 6D show exemplary brick tesselations of OFDMA downlink subframes. [0053] Given burst heights ( β H k , k = 0,...,n B -1 ) and burst widths {β w k ,

k = Q,...,n B -l ) m units of OFDMA subcarriers and OFDMA symbols, the maximal brick dimensions r and c for a subframe tessellation are computed using the equations [0054 ] r = GCO(β H 0 H V ...,β H nB _ 1 )

(7) [0055] c = GCO(β W 0 w l ,...,β W nB _ 1 )

(8)

[0056] where GCD denotes the greatest common divisor (GCD). Brick dimensions r and c are dependent on coding and modulation which adapt to time- varying channel, interference and network conditions. Hence, brick dimensions are also adaptive. [ 0057 ] The GCD of two or more non-zero integers is the largest positive integer that divides these integers without remainder. For example, the GCD of burst heights β H 0 = 24 , β H l = \6 and β H 2 = \2 is 4 . The GCD has numerous properties that can be

used for its computation such as the property GCD( β H 0 H ϊ H 2 ) =

GCD(GCD( β H 0 , β H j ), β H 2 ). This property can be extended to any number of bursts that comprise a subframe.

[ 0058 ] There are many efficient algorithms for computing the GCD. The Euclidean

algorithm, extended Euclidean algorithm, and binary GCD algorithm are efficient for

GCD computations. The following function shows a simple Euclidean algorithm for

computing the GCD of two non-zero integers Jc 1 and x 2 .

function GCD( X 1 , x 2 ) while JC 1 > 0 { temp = x 2 x=temp

} return GCD = X 1

[0059] To maximize superframe/frame overhead reduction, GCD values that are

equal to one must be avoided. As described above data block lengths κ k , encoded data

block lengths η k , and bits per modulation symbol m k are divisors of two so burst lengths

β k are constrained to be divisors of two. A scheduler maps each burst of length β k to a

rectangular area within a subframe's time-frequency plane. The area of the k th burst is

P k = P H k χ βw k - Since burst lengths β k are constrained to be divisors of two, products

P H k χ βw k are a l so divisors of two. Hence, the mapping of bursts to subframes in this

manner eliminates GCD values that are equal to one. For example, given a burst of length

β k = 240 a scheduler may map this burst to a rectangular β H k x β w k = 240 area in the

subframe's time-frequency plane. Some acceptable pairs for (β H k w k ) are (12,20) ,

(24,10) , (6,40) and (30,8) , others are also acceptable but not listed. The chosen pair to

be used may be based on channel, interference and network conditions; it is a task of the

scheduler to chose the optimal pair (β H k w k ) .

[0060] Given a pair of brick dimensions r and c , the number n R of r -by- c bricks

that cover a subframe's bandwidth in the time-frequency plane can be computed from the

equation

n R = — ^- (9) r

[0061] where N FFT denotes the number of OFDMA subcarriers.

[0062 ] Similarly, the number n c of r -by- c bricks that cover a subframe's time

duration in the time-frequency plane can be computed from the equation

n c =^^ (10) c

[0063] where N Symhk denotes the number of OFDMA symbols within a subframe.

[ 0064 ] FIG. 6A, 6B, 6C and 6D show exemplary brick tessellations of OFDMA

downlink subframes that were assembled using equations 7 and 8. For simplicity guard

bands are note shown only the data part of a subframe is shown.

[0065] In FIG. 6A six bursts are shown within the DL subframes' s time-frequency

plane. Their heights {β H k , k = 0,..., 5 ) are 14, 8, 10, 14, 8, and 10. Their widths ( β w k

k = 0,...,5 ) are 12, 18, 24, 18, 12 and 6. Computing the GCD of the burst heights and

widths gives the maximal brick dimensions r = 2 and c = 6 . The number of bricks used

to cover the subframe's bandwidth is n R = l6 , the number of bricks used to cover

subframe's time duration is n c = 5.

[0066] In FIG. 6B the maximal brick dimensions are r = 16 and c = 6 . The number

of bricks used to cover the subframe's bandwidth is n R = 2, the number of bricks used to

cover subframe's time duration is n c = 4 .

[0067 ] In FIG. 6C the maximal brick dimensions are r = 32 and c = 16 . The number of bricks used to cover the subframe' s bandwidth is n R = l , the number of bricks used to cover subframe' s time duration is n c = 2 .

[0068] In FIG. 6D the maximal brick dimensions are r = 2 and c = 6 . The number of bricks used to cover the subframe' s bandwidth is n R = 16 , the number of bricks used to cover subframe' s time duration is n c = 4 .

SUPERFRAME OVERHEAD REDUCTION VIA BRICK TESSELLATED

SUBFRAMES

[0069] According to one embodiment of the invention, a rectangular time-frequency coordinate system for a subframe is formed by perpendicular horizontal and vertical axes. The horizontal axis is called the time axis. The vertical axis is called the frequency axis. The units on the time axis are OFDMA symbols. The units on the frequency axis are OFDMA subcarriers or equivalently physical orthogonal subchannels. The positive direction on the time axis is to the right. The positive direction on the frequency axis is downward. Within this time-frequency coordinate system, a point is defined as x(p, q) with p = 0,l,...,N FFT -1 and q ≥ 0 . Each point is identified by it coordinates (p,q) where p is the frequency or subcarrier coordinate and q the time coordinate or equivalently the OFDMA symbol coordinate.

[0070] Within a subframe' s time-frequency coordinate system, the size and location each β H k -by- β w k burst within a subframe' s time-frequency plane may be specified using four subframe header fields. Specifically, referring to FIG. 6A, 6B, 6C or 6D it is seen that the size and location of the k th burst in a subframe may be represented by the following four subframe header fields:

OFDMA_Symbol_Offset[k] (11)

Number_of_Symbols[k] (12)

OFDMA_Subchannel_Offset[k] (13)

Number_of_Subchannels[k] (14)

[0071] The main purpose and advantage of tessellating subframes with maximal-

sized bricks is to reduce the size of these four fields. Using a subframe tessellated with

bricks, the location and size of subframe bursts can be specified in units of variable- sized

bricks rather than OFDMA subcarriers and OFDMA symbols. Note that bricks serve as

units for both the subframe' s time and frequency axes; they form a variable brick-based

coordinate system in a subframe' s time-frequency plane. In addition, a variable brick-

based coordinate system allows subframe header fields for burst size and location to be

variable in length. The lengths of the four fields may adapt to burst sizes which are

dependent on time-varying channel, interference and network conditions.

[0072 ] The brick-based method for frame overhead reduction can be described by

again referring to FIG. 6A, 6B, 6C or 6D. Referring to these figures it can be seen that the

above four fields can be factored as follows:

OFDMA_Symbol_Offset[k] = Burst_Time_Offset[k] * c (15)

Number_of_Symbols[k] = Burst_Time_Duration[k] * c (16)

OFDMA_Subchannel_Ojfset[k] = Burst_Frequency_Offset[k] * r (17)

Number_of_Subchannels[k] = Burst_Bandwidth[k] * r (18)

[0073] where

OFDMA_Symbol_Offset[k]

Burst_Time_Offset[k] = (19)

Number_of_Symbols[k]

Burst_Time_Durationt[k] = (20)

OFDMA_Subchannel_Offset[k]

Burst_Frequency_Offset[k] = (21)

Number _of_Subchannels[k]

Burst _Bandwidth[k] = (22)

[0074 ] It can be seen that the brick-scaled fields 19 through 22 are scaled versions of

equations 11 through 14 so a reduced number of bits is needed for their binary

representation. The scale factors are brick dimensions r and c that should be as large as

possible to maximize the reduction in the number of bits. Dimensions r and c may also

change from subframe to subframe so scaling can be variable.

[0075] Hence, if brick dimensions r and c are known at the transmit and receive

ends of a link, the scaled fields (19 through 22) may be transmitted rather than the original

non- scaled fields (11 through 14). Brick dimensions r and c may be computed at the

transmit end of a link and then transmitted to a receiver, the receiver can locate its bursts

using equations 15 through 18, the received scaled fields, and knowledge of r and c . It

must be emphasized that r and c only need to be computed and transmitted once per

subframe, not per subframe burst. Hence the increase in additional overhead required for

r and c is small.

[0076] To illustrate the advantages in using brick-scaled fields, FIG. 6A, 6B, 6C and

6D may be used. Referring to FIG. 6A it can be seen that size and location of Burst 4

(k = 4) may be represented by the field values

OFDMA_Symbol_Offset[k] = 18 (8 bits) Number _of_Symbols[k] = 12 (7 bits) OFDMA_Subchannel_Offset[k] = 14 (6 bits) Number _of_Subchannels[k] = 8 (6 bits)

[0077 ] Maximal brick dimensions for the DL subframe in FIG. 6A are r = 2 and

c = 6 . Hence the brick- scaled subframe header fields for Burst 4 are defined as

Burst _Time_Ojfset[k] = OFDMA_Symbol_Offset[k]

= 3 (2 bits)

Burst_Time_Durationt[k] Number _of_Symbols[k]

= 2 (2 bits)

Burst_Frequency_Offset[k] OFDMA_Subchannel_Offset[k]

= 7 (3 bits)

Burst _Bandwidth[k] _ Number _of_Subchannels[k] _ . r

[0078] Note that the brick-based fields require only 10 bits compared to fields the

original non-scaled fields which require 27 bits.

[0079] The Table of Field Values in FIG. 6A shows brick-based field values for all

bursts within the DL subframe. Each table pair contains a field's decimal value and the

number of bits required to represent the decimal value within a transmitted subframe

field. The table also shows the total number of overhead bits for the brick-scaled method

and the non-scaled or prior art method. Percent decreases in overhead bits are also shown. Note for the bursts within FIG. 6A the overall decrease in overhead bits is 69 % which is significant.

[0080] Referring to the Table of Field Values in FIG. 6B, 6C and 6D it is seen that overall decrease in overhead bits is 84 %, 85 % and 84 %. FIG. 6A, 6B, 6C and 6D may be viewed as a sequence of successive DL frames. The brick dimensions r and c are adapted to the bursts for each subframe using the GCD equations above. The average overall decrease in overhead bits is 80% compared to the non-scaled or prior art method. Hence, compared to prior art the brick-scaled method will allow a significant number of subcarriers to be used for other required subframe header fields.

BRICK-BASED OFDMA SUPERFRAMES

[0081] FIG. 5A shows an exemplary brick-based superframe structure. Preferred embodiments of the invention are based on this basic OFDMA superframe or variations of it. The exemplary superframe contains a Superframe Preamble, a Superframe Control Header (SCH), a Superframe Downlink Map (SDL-MAP), a Superframe Uplink MAP (SUL-MAP) and brick-based downlink and uplink subframes that support OFDMA user data. FIG. 6A, 6B, 6C and 6D show examples of brick-based DL subframes that may comprise the superframe of FIG. 5A. Information Elements within the SDL-MAP and the SUL-MAP provide the necessary control data needed for superframe configuration and changes. Information Elements within the SDL-MAP and the SUL-MAP also specify the brick tessellations to be used for each DL and UL subframe. Note that if the exemplary superframe contains only one frame it reduces to the IEEE 802.16 frame structure used in prior art. Hence the exemplary superframe structure subsumes the prior art frame structures illustrated in FIGs. IA, IB, 1C, 2A and 2B.

[ 0082 ] The exemplary superframe structure is very general and can be modified or extended in many ways. For example, (1) the superframe structure can be modified to allow for different physical layer technologies to be interlaced, these technologies may not use a brick-based superframe structure described above; (2) different types of logical channels may be mapped to sets of subcarriers within the superframe control or data sections, they may be used rather the SCH, SDL-MAP, and SUL-MAP; (3) the superframe structure of FIG. 5a has a downlink-uplink asymmetry ratio of 1-to-l in which one downlink subframe is followed by one uplink subframe, this asymmetry ratio could be varied.

[0083] FIG. 5B shows exemplary fields for the superframe's SDL-MAP 510. The SUL-MAP will have a similar structure so it is not necessary to illustrate and describe its fields. Other superframe header fields may be added to the SDL-MAP and the SUL-MAP if required. Values within the SDL-MAP and SUL-MAP fields are broadcast to all OFDMA users. The broadcasted values are received and read by all users so they can prepare for subsequent subframe information elements. The subframe information elements tell OFDMA users how and where to access their data bursts within a subframe. [0084 ] As shown in FIG. 5B the SDL-MAP 510 is comprised of a Number _Subframes field and a total of n SF DL-MAPs. The Number _Subframes field and

DL-MAP fields are transmitted from top to bottom in sequential order. Hence the fields can be sequentially loaded into in a RAM buffer at the transmit end and sequentially read from a RAM buffer at the receive end of a link.

[ 0085 ] Referring to FIG. 5B the Number _Subframes field contains the total number n SF of DL subframes within a DL superframe. Each DL subframe is configured using a single DL-MAP so the number of subframes n SF equals the number of DL-MAPs. Note

that if n SF = 1 the exemplary superframe contains only one frame and the superframe structure reduces to the IEEE 802.16 frame structure used in prior art. The number of DL subframes n SF ≥ 1 is variable but the length of the Number _Subframes field is fixed at

N F0 bits. For example, if the maximum number of DL subframes allowed is 64, the length of the Number _Subframes field would be fixed at N F0 = 6 bits in order to support 64 DL subframes numbered from 0 to 63. The number of DL subframes n SF could then be any positive integer ranging from 0 to 63. [0086] FIG. 5B also shows the detail of the n th DL-MAP 511 within a set of n SF

DL-MAPs. The detail for each of the n SF DL-MAPs is the same; each DL-MAP is comprised of fixed and variable length fields. The n th DL-MAP is used to configure or allocate bursts within the n th DL subframe.

[0087 ] The first six fields within the n th DL-MAP are SDL-MAP header fields that are fixed in length, they are defined as follows:

[ 0088 ] The DL_Subframe_Offset field has a fixed length of N F1 bits, binary values contained within this field specify the integer-valued offset of n th DL subframe within a DL superframe. The n th subframe DL subframe starts at the value given in the DL_Subframe_Offset field. [0089] The Number _Subframe_Bursts field has a fixed length of N F2 bits, binary values contained within this field specify the number n B of subframe bursts allocated to the n th DL subframe.

[0090] The Brick_Time_Duration field has a fixed length of N F3 bits, binary values contained within this field specify the time duration of the subframe bricks that tessellate

the n th DL subframe. Brick time duration equals the number of columns c that comprise a brick: c = GCO(β W 0 w l ,...,β W nB _ 1 ) = Brick_Time_Duration (23)

[0091] The Brick_Bandwidth field has a fixed length of N F4 bits, binary values contained within this field specify the bandwidth of a subframe bricks that tessellate the n th DL subframe. Brick bandwidth equals the number of rows r that comprise a brick: r = GCO(β H 0 H 1 ,..., β H nB _ x ) = Brick_Bandwidth (24)

[0092 ] The Number _Time_Field_Bits field has a fixed length of N F5 bits, binary values m F0 contained within this field specify the lengths of the variable-length fields Burst_Time_Offset[k] and Burst_Time_Duration[k] , k = Q,l,..., n B -l . These variable- length fields are components of the burst Information Elements. [0093] The Number _Freq_Field_Bits field has a fixed length of N F6 bits, binary values m FX contained within this field specify the lengths of the variable-length fields Burst _Frequency _Offset[k] and Burst _Bandwιdth[k] ' , k = 0,1,..., n B -1 . These variable- length fields are components of the burst Information Elements. [0094 ] Following the above six SDL-MAP header fields is a variable-length sequence of n B ≥ 1 Information Elements that describe the n th subframe' s bursts. Fields comprising the k (k = Q,l,...,n B -l ) Information Elements (IEs) are both fixed and variable in length, they are defined as follows:

[0095] Each CID [k] field has a fixed length of N F7 bits, binary values contained within this field specify the user or connection identifier (CID) for the k th burst in the n th subframe DL subframe.

[0096] Each DIUC [k] field has a fixed length of N FS bits, binary values contained within this field specify the Downlink Interval Usage Code (DIUC) for the k th burst in the n th subframe DL subframe.

[0097 ] Each Burst_Time_Offset[k] field has a length of m F0 bits, binary values contained within this field specify the time offset of the k th subframe burst in units of r - by- c bricks. The reference used for the time offset computation is the value given in the preceding DL_Subframe_Offset field. [0098] Each Burst _Time_Duration[k] field has a length of m F0 bits, binary values contained within this field specify the time duration of the k th subframe burst in units of r -by- c bricks.

[0099] Each Burst _Frequency _Offset[k] field has a length of m F1 bits, binary values contained within this field specify the frequency offset of the k th subframe burst in units of r -by- c bricks. The reference used for the frequency offset computation is first subcarrier (0 th subcarrier). [ 0100 ] Each Burst _Bandwidth[k] field has a length of m bits, binary values contained within this field specify the bandwidth of the k th subframe burst in units of r -by- c bricks.

[ 0101 ] For the above Information Element fields, field length m F0 is variable and is contained within the preceding Number _Time_Field_Bits field. Similarly, field length m F1 is variable and is contained within the preceding Number _Freq_Field_Bits field.

Variables m F0 and m F1 are read prior to the n B IE fields and allow for adaptation in frame overhead.

SUPERFRAME ASSEMBLY METHOD

[ 0102 ] Using the above defined superframe header fields and referring to the exemplary superframe shown in FIG. 5A a method for generating downlink (DL) subframes within a superframe is now described. The method for generating uplink subframes is similar so it is not necessary to describe the UL method. [ 0103 ] FIG. 7A shows an exemplary flowchart for generating the DL subframes within a superframe. The flowchart is divided into two processes. The first process (Steps 108 to 120) describes the steps for assembling SDL-MAP components. The second process (Steps 124 to 134) describes the steps for assembling information elements within the SDL-MAP.

[ 0104 ] In Step 100 the method for constructing DL subframes within the current superframe begins. [ 0105 ] In Step 102 the binary representation of integer n SF ≥ 0 is inserted into the fixed length- N F0 Number _Subframes field. n SF specifies the number of downlink subframes within the current superframe, it may be specified by a scheduler. FIG. 5B shows the location of the Number_Subframes field within the SDL-MAP. [0106] In Step 104 counter variables j and k are initialized to zero. Counter variable j is used for counting subframes within the current superframe, counter variable k for counting the number of bursts within the j th subframe. Counter j is also needed to address subframes within a superframe, counter k to address bursts within subframes.

[ 0107 ] In Step 106 the current value of the subframe counter j is compared to n SF to see which processing steps to execute next. If the subframe counter j is less than number of downlink subframes n SF , the method enters the process for constructing header fields within the j th SDL-MAP. If the subframe counter j is greater than or equal to n SF the method returns to Step 100 in order to restart the assembly method for the next superframe.

[ 0108 ] In Step 108 the downlink SDL-MAP process begins by computing the OFDMA symbol offset of the j th DL subframe within the current superframe. In the preferred embodiment, the offset is in units of OFDMA symbols using the superframe preamble as a reference point for the offset computation. The binary representation of the computed length- N value is inserted into the DL_Subframe_Offset field of the SDL-

MAP header. FIG. 5B shows the location of the DL_Subframe_Offset field within the

SDL-MAP.

[0109] In Step 110 the user data bursts that are allocated to the j th DL subframe are first obtained from the scheduler. The bursts are then inserted into their scheduler specified regions within the time-frequency plane of the j th subframe. Subframe bursts may be of various sizes, their sizes are parametrized by their heights ( β H k , k = 0,...,n B -1 ) and their widths (β w k , k = 0,...,n B -1 ). Burst heights β H k are in units of OFDMA subcarriers, burst widths β w k are in units of OFDMA symbols.

[ 0110 ] In Step 112 the number n B of data bursts that are allocated to the j th DL subframe is computed. The binary representation of the computed length- N F2 value n B is inserted into the Number _Subframe_Bursts field of the SDL-MAP header. This value

is also used as an upper limit for the burst counter k . FIG. 5B shows the location of the Number _Subframe_Bursts field within the superframe header.

[ 0111 ] In Step 114 the row and column dimensions of the maximum size r -by- c brick that can be used to tessellate the data region of the j th subframe is computed. To compute the row dimension r the greatest common divisor (GCD) of data burst heights (β H k , k = 0,...,n B —l ) in units of OFDMA subcarriers is computed. To compute the column dimension c the GCD of data burst widths (β w k , , = 0,..., n B - 1 ) in units of

OFDMA symbols is computed. The binary representation of the computed dimension r is inserted into the length- N F4 Brick_Bandwidth field. The binary representation of the computed dimension c is inserted into the length- N F3 Brick_Time_Duration field. FIG.

5B shows the location of the Brick_Time_Duration field and the Brick_Bandwidth field within the superframe header.

[ 0112 ] In Step 116 the number of r -by- c bricks n R = N FFT I r required to cover the j th subframe' s bandwidth and the number of r -by- c bricks n c = N s mbh I c required to cover the j th subframe' s time duration are computed. N FFT denotes the number of OFDMA subcarriers and N Symbk the number of OFDMA symbols within the subframe. The value for N FFT is typically computed during the network entry process. The number of bricks required to tessellate the current subframe is the product n R xn c . FIG. 6A, 6B,

6C and 6D show exemplary brick tessellations for an exemplary sequence OFDMA downlink subframes. In FIG. 6A, n R = 16 and n c = 5 . In FIG. 6B, n R = 2 and n c = 4 .

In FIG. 6C, n R = 1 and n c = 2 . In FIG. 6D, n R = 16 and n c = 4 .

[0113] In Step 118 integer m F0 is computed using the operation m F0 = ceil(log 2 (n c )) where ceil(log 2 (n c )) rounds Iog 2 (w c ) to the nearest integer towards infinity. The binary representation of the computed value m F0 is then inserted into the Number _Time_Field_Bits field of the IE header. FIG. 5B shows the location of the Number _Time_Field_Bits field within the superframe header. The

Number _Time_Field_Bits field has a fixed length of N F5 bits. The value m F0 contained within this field specifies the lengths of fields Burst _Time_0ff set [k] and

Burst _Time _Duration[k] , k = 0, 1, ..., n B - 1 . These fields are components of the burst

Information Elements. At the receive end, the received contents m F0 of the Number _Time_Field_Bits field is read in order to determine the locations of Burst_Time_Offset[k] and Burst_Time_Duration[k] within a sequence of n B information elements that follow the SDL MAP header. Note that the lengths of the

Burst _Time_0ff set [k] and Burst _Time_Duration[k] fields may be time-varying, their lengths dependent on the computed value n c . Hence the Number _Time_Field_Bits field is necessary to adapt the lengths of variable-length fields Burst _Time_0ff set [k] and Burst _Time_Duration[k] . [0114 ] In Step 120 integer m FX is computed using the operation m FX = ceil(\og 2 (n R )) where ceil(\og 2 (n R )) rounds \og 2 (n R ) to the nearest integer towards infinity. The binary representation of the computed value m FX is then inserted into the Number _Freq_Field_Bits field of the IE header. FIG. 5B shows the location of the Number _Freq_Field_Bits field within the superframe header. The

Number _Freq_Field_Bits field has a fixed length of N F6 bits. The value m contained

within this field specifies the lengths of the fields Burst frequency _Offset[k] and Burst _Bandwidth[k] , k = 0, 1,..., n B - 1 . These fields are components of the burst

Information Elements. At the receive end, the received contents m of the Number _Freq_Field_Bits field is read in order to determine the locations of Burst _Frequency _Offset[k] and Burst_Bandwidth[k] within a sequence of n B information elements that follow the SDL MAP header. Note that the lengths of the Burst _Frequency _Offset[k] and Burst _Bandwidth[k] fields may be time- varying with length dependent on the computed value n R . Hence the Number _Freq_Field_Bits field is necessary to adapt the lengths of variable-length fields Burst _Frequency _Offset[k] and Burst _Bandwidth[k] . [ 0115 ] In Step 122 the current value of the burst counter k is compared to n B to see which processing steps to execute next. If the burst counter k is less than number of downlink subframe bursts n B , the method enters the process (Steps 124 to 134) for constructing burst information element fields within the j th SDL-MAP. If the burst counter k is greater than or equal to n B , all bursts allocated for the j th subframe have been processed so the method goes to Step 138 where the burst counter k is reset to zero. The method then goes to Step 140 where the subframe counter j is incremented by one. After Step 140 the method returns to Step 106.

[0116] In Step 124 the OFDMA connection or user identification bits for the k th burst are inserted into the CID[k] field of the k th burst information element. FIG. 5B shows the locations of the CID[k], k = Q,l,...,n B -1 , fields within the n B burst information elements of the DL-MAP. Each of the CID[k] fields has a fixed length of

N F1 bits.

[ 0117 ] In Step 126 modulation and FEC coding descriptor bits are inserted into the Downlink Interval Usage Code (DIUC) field within the k th burst information element. The DIUC is a fixed length- N FS code identifying the FEC coding and modulation that is used for the k th burst. FIG. 5B shows the locations of the fields DIU C [k], k = Q,l,...,n B -l , within the n B burst information elements of the DL-MAP.

[ 0118 ] In Step 128 the time offset of the k th subframe burst is computed in units of r -by- c bricks. The binary representation of the computed value is inserted into the Burst _Time_0ff set [k] field of the DL-MAP. The Burst _Time_0ff set [k] field has a variable of m F0 bits. The integer m F0 is computed in Step 118. Brick dimensions r and c are the greatest common divisors of data burst bandwidths in units of OFDMA subcarriers and data burst time durations in units of OFDMA symbols. These values were computed in Step 114. The reference used for the time offset computation is the value given in the DL_Subframe_Ojfset field computed in Step 108. FIG. 5B shows the locations of the fields Burst_Time_Offset[k] , k = 0,l,---,n B -l , within the n B burst information elements of the DL-MAP.

[0119] FIG. 6A, 6B, and 6C show exemplary brick tessellations of the data regions for a sequence OFDMA downlink subframes. Within FIG. 6A, values for

Burst _Time_0ff set [k] in units of r -by- c bricks for bursts k = 0,1,2,3,4,5 are 0, 0, 0, 2,

3 and 4. Within FIG. 6B, values for Burst _Time_0ff set [k] in units of of r -by- c bricks for bursts k = 0,1,2,3,4,5,6 are 0, 0, 1, 1, 2, 3 and 3. Within FIG. 6C, values for

Burst_Time_Offset[k] in units of of r -by- c bricks for bursts k = 0,1 are 0 and 1. Hence it can be seen that the number of bits for Burst _Time_0ff set [k] decreases as brick size

increases. This results in a decrease in overhead and also allows for adaptation based on burst size.

[0120] In Step 130 the time duration of the k th subframe burst is computed in units of r -by- c bricks. The binary representation of the computed value is inserted into the Burst _Time_Duration[k] field of the of the DL-MAP. The Burst_Time_Duration[k] field has a length of m F0 bits. The integer m F0 is computed in Step 118. Brick dimensions r and c are the greatest common divisors of data burst bandwidths in units of OFDMA subcarriers and data burst time durations in units of OFDMA symbols. These values were computed in Step 114. FIG. 5B shows the locations of the fields Burst _Time _Duration[k] , k = 0,l,---,n B -l , within the n B burst information elements of the DL-MAP.

[0121] FIG. 6A, 6B, and 6C show exemplary brick tessellations of the data regions for a sequence OFDMA downlink subframes. Within FIG. 6A, values for Burst _Time_Duration[k] in units of r -by- c bricks for bursts k = 0,1,2,3,4,5 are 1, 2, 3, 2, 1 and 0. Within FIG. 6B, values for Burst _Time_Duration[k] in units of of r -by- c bricks for bursts k = 0,1,2,3,4,5,6 are 0, 0, 1, 0, 0, 0 and 0. Within FIG. 6C, values for Burst _Time_Duration[k] in units of of r -by- c bricks for bursts k = 0,1 are 0 and 0. Hence it can be seen that the number of bits for Burst _Time_Duration[k] decreases as brick size increases. This results in a decrease in overhead and also allows for adaptation based on burst size.

[ 0122 ] In Step 132 the frequency or subcarrier offset of the k th subframe burst is computed in units of r -by- c bricks. The binary representation of the computed value is inserted into the Burst_Frequency_Offset[k] field of the of the DL-MAP. The

Burst_Frequency_Offset[k] field has a length of m bits. The integer m is computed in Step 120. Brick dimensions r and c are the greatest common divisors of data burst bandwidths in units of OFDMA subcarriers and data burst time durations in units of OFDMA symbols. These values were computed in Step 114. FIG. 5B shows the locations of the fields Burst_Frequency_Offset[k] , k = 0,1,... ,n B -1 , within the n B burst information elements of the DL-MAP.

[ 0123 ] FIG. 6A, 6B, and 6C show exemplary brick tessellations of the data regions for a sequence OFDMA downlink subframes. Within FIG. 6A, values for

Burst _Frequency _Offset[k] in units of r -by- c bricks for bursts k = 0,1,2,3,4,5 are 0, 7,

11, 0, 7 and 4. Within FIG. 6B, values for Burst _Frequency _Offset[k] in units of of r - by- c bricks for bursts k = 0,1,2,3,4,5,6 are 0, 1, 0, 1, 1, 0 and 1. Within FIG. 6C, values for Burst frequency _Offset[k] in units of of r -by- c bricks for bursts k = 0,1 are 0 and 0. Hence it can be seen that the number of bits for Burst_Frequency_Ojfset[k] decreases as brick size increases. This results in a decrease in overhead and also allows for adaptation based on burst size.

[0124 ] In Step 134 the bandwidth of the k th subframe burst is computed in units of r -by- c bricks. The binary representation of the computed value is inserted into the Burst _Bandwidth[k] field of the of the DL-MAP. The Burst _Bandwidth[k] field has a length of m F1 bits. The integer m F1 is computed in Step 120. Brick dimensions r and c are the greatest common divisors of data burst bandwidths in units of OFDMA subcarriers and data burst time durations in units of OFDMA symbols. These values were computed in Step 114. FIG. 5B shows the locations of the fields

Burst _Bandwidth[k] , k = Q,\,...,n B -\ , within the n B burst information elements of the

DL-MAP.

[ 0125 ] FIG. 6A, 6B, and 6C show exemplary brick tessellations of the data regions for a sequence OFDMA downlink subframes. Within FIG. 6A, values for

Burst _Bandwidth[k] in units of r -by- c bricks for bursts k = 0,1,2,3,4,5 are 6, 3, 4, 6, 3 and 4. Within FIG. 6B, values for Burst _Bandwidth[k] in units of of r -by- c bricks for bursts k = 0,1,2,3,4,5,6 are 0, 0, 0, 0, 0, 0 and 0. Within FIG. 6C, values for

Burst _Bandwidth[k] in units of of r -by- c bricks for bursts k = 0,1 are 0 and 0. Hence it can be seen that the number of bits for Burst_Bandwidth[k] decreases as brick size increases. This results in a decrease in overhead and also allows for adaptation based on burst size.

[0126] In Step 136 the burst counter k is incremented by one. After Step 136 the method returns to Step 122 in order to restart the construction process for the next DL burst information element.

SUPERFRAME DISASSEMBLY METHOD

[0127 ] Referring to the exemplary superframe shown in FIG. 5A, a method for disassembling downlink (DL) subframes within a superframe is now described. The method for disassembling uplink subframes is similar so it is not described.

[0128] FIG. 7B shows an exemplary flowchart for disassembling downlink (DL) subframes at a receiver. The flowchart is divided into two processes. The first process (Steps 208 to 218) describes the method for disassembling SDL-MAP components. The second process (Steps 222 to 236) describes the method for disassembling information elements within the SDL-MAP. FIG. 7C shows a set of equations that are necessary for disassembling downlink (DL) subframes at a receiver.

[0129] In Step 200 the method for disassembling a DL subframe within a sequence of one or more DL superframes begins.

[ 0130 ] In Step 202 the binary representation of an integer n SF ≥ 0 is removed from the received length- N F0 Number _Subframes field. n SF specifies the number of downlink subframes within the current received DL superframe, it may be specified by a scheduler. FIG. 5B shows the location of the Number_Subframes field within the SDL-MAP. [0131] Step 204 counter variables j and k are initialized to zero. Counter variable j is used for counting subframes within the current superframe, counter variable k for counting the number of bursts within the current subframe. Counter j is needed to address subframes within a superframe, counter k to address bursts within subframes. [ 0132 ] In Step 206 the current value of the subframe counter j is compared to n SF to see which processing steps to execute next. If the subframe counter j is less than number of downlink subframes n SF , the method enters the process (Steps 208 to 218) for disassembling header fields within the current SDL-MAP. If the subframe counter j is greater than or equal to n SF , the method returns to Step 200 in order to restart the disassembly method for the next superframe.

[ 0133 ] In Step 208 the process for disassembling received header fields within the SDL-MAP begins by obtaining the offset of the j th downlink subframe within the current superframe. In the preferred embodiment the offset is in units of OFDMA symbols with the superframe preamble being the reference point for the offset computation. The binary representation of the received length- N value is removed from the DL_Subframe_Offset field of the SDL-MAP header. FIG. 5B shows the location of the DL_Subframe_Offset field within the SDL-MAP.

[ 0134 ] In Step 210 the binary representation of the received length- N F2 value n B is removed from the received Number _Subframe_Bursts field in the SDL-MAP header. n B denotes the number of data bursts that are allocated to the j th received DL subframe. This value is also used as a upper limit for the burst counter k . FIG. 5B shows the location of the Number _Subframe_Bursts field within the superframe header.

[ 0135 ] In Step 212 the binary representation of the brick dimension c is removed from the received length- N F3 Brick_Time_Duration field. Brick dimension c denotes the time-duration of the j th subframe' s bricks in units of OFDMA symbols. FIG. 5B shows the location of the Brick_Time_Duration field within the superframe header.

[0136] In Step 214 the binary representation of the brick dimension r is removed from the received length- N F4 Brick_Bandwidth field. Brick dimension r denotes the bandwidth the j th subframe' s bricks in units of OFDMA subcarriers. FIG. 5B shows the location of the Brick_Bandwidth field field within the superframe header.

[ 0137 ] In Step 216 the binary representation of the received value m F0 is removed from the fixed length- N F5 Number _Time_Field_Bits field. Variable m F0 specifies the lengths of the subsequent fields Burst _Time_0ff set [k] and Burst _Time _Duration[k] , k = Q,l,...,n B -l . These fields are components of the burst Information Elements.

Variable m F0 must be read in order to determine the locations of Burst_Time_Offset[k] and Burst_Time_Duration[k] within a sequence of n B information elements that follow the SDL MAP header. Note that the lengths of the Burst_Time_Offset[k] and Burst _Time_Duration[k] fields may be time- varying with length dependent on the computed value n c .

[ 0138 ] In Step 218 the binary representation of the received value m is removed

from the length- N F6 Number_Freq_Field_Bits field. Variable m specifies the lengths

of the fields Burst_Frequency_Offset[k] and Burst_Bandwidth[k] , k = 0, 1, ..., n B - 1 .

These fields are components of the burst Information Elements. Variable m is read in

order to determine the locations of Burst frequency _Offset[k] and Burst _Bandwidth[k]

within a sequence of n B information elements that follow the SDL MAP header. Note

that the lengths of the Burst _Frequency _Offset[k] and Burst _Bandwidth[k] fields may

be time-varying with length dependent on the computed value n R .

[0139] In Step 220 the current value of the burst counter k is compared to n B to see

which processing steps to execute next. If the burst counter k is less than number of

downlink subframe bursts n B , the method enters the process (Steps 222 to 236) for

disassembling burst information element fields within the current SDL-MAP. If the burst

counter k is greater than or equal to n B all bursts or information elements allocated for

the j th subframe have been processed so the method goes to Step 240 where the burst

counter k is reset to zero. The method then goes to Step 242 where the subframe counter

j is incremented by one. After Step 242 the method returns to Step 206.

[0140] In Step 222 the starting address Address _CID[k] of the current CID[k] field

is first computed using equation 25:

6 ( 1 8

[0141] Address_CID[k] = ∑ N +k 2∑ m + ∑ N + 1 (25)

[0142 ] Equation 25 is also shown in FIG. 7C. m F and m F were obtained in Steps

216 and 218. Values N F , i = 0, 1,..., 8 , are fixed and known by both the transmitter and

receiver. Given the computed starting address Address_CID[k] the OFDMA connection

bits for the current k th burst are removed from the received fixed length- N F1 CID[Jc] field. FIG. 5B shows the locations of the CID[Ic], k = 0,1,...,n B -1 , fields within the n B burst information elements of the DL-MAP.

[0143] In Step 224 the current value of the CID[Ic] field is compared to the OFDMA user' s signature or identification bits that are denoted as USER_ID . If CID[Ic] equals

USER_ID , the received burst is for addressed for the user and the method enters the process for disassembling burst information element fields within the current SDL-MAP. If CID[Ic] does not equal USER_ID , the received burst is addressed for another OFDMA user so the method goes to Step 238 where the burst counter Ic is incremented by one. The method then goes to Step 220 in order to process the next DL subframe burst within the j th received superframe.

[0144 ] In Step 226 the starting address Address _DIUC[k] of the current DIUC[Ic] field is first computed using equation 26:

[0145] Address _DIUC[k] = Address _CID[k] + N Fi (26)

[0146] Equation 26 is also shown in FIG. 7C. Address_CID[k] was obtained in Step 222. Value N F is fixed and known by both the transmitter and receiver. Given the computed starting address Address_DIUC[k] the modulation and FEC coding descriptor bits are removed from the Downlink Interval Usage Code (DIUC) field within the received k th burst information element. Each DIUC[k] field is a fixed-length field ( N FS bits) that contains the code or reserved word identifying the FEC coding and modulation that is used for the k th burst. FIG. 5B shows the locations of the fields DIUC[k], k = 0, 1,...,«„ - 1 , within the n R burst information elements of the DL-MAP.

[0147 ] In Step 228 the starting address Address_Burst_Time_Offset[k] of the current Burst_Time_Offset[k] field is first computed using equation 27: [0148] Address_Burst_Time_Offset[k] = Address _DIUC[k] + N ^ (27)

[0149] Equation 27 is also shown in FIG. 7C. Address _DIUC[k] was obtained in Step 226. Value N F is fixed and known by both the transmitter and receiver. Given the computed starting address Address _Burst_Time_Offset[k] , the binary representation of the time offset of the k th burst is removed from the Burst _Time_0ff set [k] field of the of the received DL-MAP. The Burst_Time_Offset[k] field has a length of m F0 bits, the value within the Burst_Time_Offset[k] field is in units of r -by- c bricks. The length m F0 was received in Step 216, brick dimensions c and r were received in Steps 212 and 214.

[0150] In Step 230 the starting address Address_Burst_Time_Duration[k] of the current Burst _Time_Duration[k] field is first computed using equation 28:

[0151] Address_Burst_Time_Duration[k]

= Address _Bur si _Time_Offset[k] + m F0 (28)

[0152 ] Equation 28 is also shown in FIG. 7C. Address_Burst_Time_Ojfset[k] was obtained in Step 228. Value m F was obtained in Step 216. Given the computed starting address, the binary representation of the time duration of the k th burst is removed from the Burst _Time_Duration[k] field of the of the received DL-MAP. The

Burst _Time_Duration[k] field has a variable length of m F0 bits, the value within the

Burst _Time_Duration[k] field is in units of r -by- c bricks. The integer m F0 was received in Step 216, brick dimensions r and c were received in Steps 212 and 214.

[0153] In Step 232 the starting address Address_Burst_Frequecy_Ojfset[k] of the current Burst frequency _Offset[k] field is first computed using equation 29: [0154 ] Address_Burst_Frequecy_Offset[k]

= Address_Burst_Time_Duration[k] + m F (29)

[0155] Equation 29 is also shown in FIG. 7C. Address _Burst_Time_Duration\k ~ \ was obtained in Step 230. Value m F was obtained in Step 216. Given the computed starting address Address _Burst_Frequecy_Ojfset[k] , the binary representation of the frequency offset of the k th burst is removed from the Burst _Frequency _Offset[k] field of the of the received DL-MAP. The Burst_Frequency_Ojfset[k] field has a variable length of m F1 bits, the value within the field is in units of r -by- c bricks. The integer m F1 was received in Step 218, brick dimensions r and c were received in Steps 212 and

214.

[0156] In Step 234 the starting address Address_Burst_Frequecy_Ojfset[k] of the current The Burst_Frequency _Offset[k] field is first computed using equation 30:

Address_Burst_Bandwidth[k] = Address_Burst_Frequecy_Offset[k] + m F (30)

[0157 ] Equation 30 is also shown in FIG. 7C. Address _Burst_Frequecy_Ojfset[k] was obtained in Step 232. Value m F was obtained in Step 218. Given the computed starting address Address _Burst_Bandwidth[k] , the binary representation of the burst bandwidth of the k th burst is removed from the Burst_Bandwidth[k] field of the of the received DL-MAP. The Burst _Bandwidth[k] field has a variable length of m F1 bits, the value within the Burst _Bandwidth[k] field is in units of r -by- c bricks. The integer m F1 was received in Step 218, brick dimensions r and c were received in Steps 212 and 214.

[ 0158 ] In Step 236 the receiver prepares to process the k th received burst within the current subframe. The location of the burst is computed using equations 31 through

34:

OFDMA_Symbol_Offset[k] = Burst_Time_Offset[k] * c (31)

Number_of_Symbols[k] = Burst _Time_Dur ation[k] * c (32)

OFDMA_Subchannel_Offset[k] = Burst_Frequency_Offset[k] * r (33)

Number _of_Subchannels[k] = Burst _Bandwidth[k] * r (34)

[0159] The modulation and coding used for the k th received burst were received in Step 226. The field values required were all received in previous steps.

[0160] In Step 238 the burst counter k is incremented by one. After Step 238 the method returns to Step 220 in order to restart the process for the next DL burst information element.

[0161] Cellular network communications are generally comprised of one or more frames transmitted between a base station and a network user. Frames are packets of data that are transmitted as a single unit; they are the fundamental transport structure used for all downlink and uplink radio transmissions between a base stations and a network user.

[0162 ] Frames are typically comprised of a frame payload segment and a frame header segment. The payload segment contains the desired data (e.g. file, voice, video, etc.) to be communicated. The frame header segment contains frame overhead bits that are prefixed to the payload segment in order to provide frame structure and processing information. Frame structure and processing information may include frame type, burst

sizes and locations within a frame, used signal coding and modulation, network addresses, network routing, link reliability data, and signal processing operations. [0163] The ratio of the maximum payload segment size to the size of the frame overhead segment determines the maximum efficiency of a network link. For example, if 10% of a frame comprises the frame header segment on a 10 Mbps network connection, the maximum efficiency of the network connection is 9 Mbps of data throughput. Depending on the particular frame overhead segment, the ratio may be significantly higher, thereby further reducing the data throughout and potentially increasing the number of frames necessary to transmit a complete communication. This may result in prolonged network usage for network users and extended processor or power utilization. [0164 ] Embodiments of the invention disclose methods for reducing the number of frame overhead bits within OFDMA frame and superframe structures. The methods are based on a logical frame element called a brick. A brick is a variable area of contiguous OFDMA symbols and subcarriers (or physical subchannels) within a subframe that is treated as a single logical unit. A brick covers a rectangular or square area within a subframe' s time-frequency plane, and it may be varied in its dimensions to adapt to dynamic burst sizes and locations. Burst sizes and locations within a subframe are dependent on time-varying channel, interference and network conditions. [0165] While various embodiments of the invention have been described above, it should be understood that they have been presented by way of example only, and not of limitation. Likewise, the various diagrams may depict an example architectural or other configuration for the present invention, which is done to aid in understanding the features and functionality that can be included in the present invention. The present invention is not restricted to the illustrated example architectures or configurations, but

can be implemented using a variety of alternative architectures and configurations. Additionally, although the present invention is described above in terms of various exemplary embodiments and implementations, it should be understood that the various features and functionality described in one or more of the individual embodiments are not limited in their applicability to the particular embodiment with which they are described, but instead can be applied, alone or in some combination, to one or more of the other embodiments, whether or not such embodiments are described and whether or not such features are presented as being a part of a described embodiment. Thus the breadth and scope of the present invention should not be limited by any of the above- described exemplary embodiments.