Classifications

• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04J—MULTIPLEX COMMUNICATION
  • H04J3/00—Time-division multiplex systems
  • H04J3/16—Time-division multiplex systems in which the time allocation to individual channels within a transmission cycle is variable, e.g. to accommodate varying complexity of signals, to vary number of channels transmitted
  • H04J3/1682—Allocation of channels according to the instantaneous demands of the users, e.g. concentrated multiplexers, statistical multiplexers
  • H04J3/1688—Allocation of channels according to the instantaneous demands of the users, e.g. concentrated multiplexers, statistical multiplexers the demands of the users being taken into account after redundancy removal, e.g. by predictive coding, by variable sampling
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L27/00—Modulated-carrier systems
  • H04L27/0008—Modulated-carrier systems arrangements for allowing a transmitter or receiver to use more than one type of modulation
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L47/00—Traffic control in data switching networks
  • H04L47/50—Queue scheduling
  • H04L47/56—Queue scheduling implementing delay-aware scheduling
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L47/00—Traffic control in data switching networks
  • H04L47/50—Queue scheduling
  • H04L47/62—Queue scheduling characterised by scheduling criteria
  • H04L47/625—Queue scheduling characterised by scheduling criteria for service slots or service orders
  • H04L47/6275—Queue scheduling characterised by scheduling criteria for service slots or service orders based on priority
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L5/00—Arrangements affording multiple use of the transmission path
  • H04L5/0001—Arrangements for dividing the transmission path
  • H04L5/0003—Two-dimensional division
  • H04L5/0005—Time-frequency
  • H04L5/0007—Time-frequency the frequencies being orthogonal, e.g. OFDM(A), DMT
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L5/00—Arrangements affording multiple use of the transmission path
  • H04L5/003—Arrangements for allocating sub-channels of the transmission path
  • H04L5/0037—Inter-user or inter-terminal allocation
  • H04L5/0041—Frequency-non-contiguous
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L5/00—Arrangements affording multiple use of the transmission path
  • H04L5/003—Arrangements for allocating sub-channels of the transmission path
  • H04L5/0048—Allocation of pilot signals, i.e. of signals known to the receiver
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L5/00—Arrangements affording multiple use of the transmission path
  • H04L5/003—Arrangements for allocating sub-channels of the transmission path
  • H04L5/0078—Timing of allocation
  • H04L5/0087—Timing of allocation when data requirements change
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04W—WIRELESS COMMUNICATION NETWORKS
  • H04W72/00—Local resource management
  • H04W72/50—Allocation or scheduling criteria for wireless resources
  • H04W72/53—Allocation or scheduling criteria for wireless resources based on regulatory allocation policies
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L27/00—Modulated-carrier systems
  • H04L27/26—Systems using multi-frequency codes
  • H04L27/2601—Multicarrier modulation systems
  • H04L27/2602—Signal structure
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L27/00—Modulated-carrier systems
  • H04L27/26—Systems using multi-frequency codes
  • H04L27/2601—Multicarrier modulation systems
  • H04L27/2626—Arrangements specific to the transmitter only
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L5/00—Arrangements affording multiple use of the transmission path
  • H04L5/0001—Arrangements for dividing the transmission path
  • H04L5/0014—Three-dimensional division
  • H04L5/0023—Time-frequency-space

Definitions

• This disclosure relates generally to apparatus and methods for multiplexing. More particularly, the disclosure relates to data-centric multiplexing of wireless communication channels.
• Wireless communication systems are widely deployed to provide various types of communication content such as voice, dat, and so on.
• These systems may be multiple- access systems capable of supporting communication with multiple users by sharing the available system resources (e.g., bandwidth and transmit power).
• 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, 3GPP LTE systems, and orthogonal frequency division multiple access (OFDMA) systems.
• CDMA code division multiple access
• TDMA time division multiple access
• FDMA frequency division multiple access
• 3GPP LTE systems 3GPP LTE systems
• OFDMA orthogonal frequency division multiple access
• a wireless multiple-access communications system can simultaneously support communication for multiple wireless terminals.
• Each terminal communicates with one or more base stations via transmissions on the forward and reverse links.
• the forward ling refers to the communication link from the base stations to the terminals (e.g., a mobile station), and the reverse link (or uplink) refers to the communication link from the terminal to the base stations.
• This communication link 2 refers to the communication link from the base stations to the terminals (e.g., a mobile station)
• the reverse link or uplink
• MIMO multiple-input-multiple output
• a MIMO system employs multiple (/V 7 -) transmit antennas and multiple ( ⁇ / R ) receive antennas for data transmission.
• a MIMO channel formed by the /V 7 - transmit and N R receive antennas may be decomposed into Ns independent channels, which are also referred to as spatial channels, where N s ⁇ min ⁇ N T , N R ⁇ .
• Each of the Ns independent channels corresponds to a dimension.
• the MIMO system can provide improved performance (e.g., higher throughput and/or greater reliability) if the additional dimensionalities created by the multiple transmit and receive antennas are utilized.
• a MIMO system can support time division duplex (TDD) and frequency division duplex (FDD) systems.
• TDD time division duplex
• FDD frequency division duplex
• the forward and reverse link transmissions are on the same frequency region so that the reciprocity principle allows the estimation of the forward link channel from the reverse link channel. This enables the access point to extract transmit beamforming gain on the forward link when multiple antennas are available at the access point.
• ASIC application specific integrated circuits
• Data channels usually employ standard modulation techniques, such as quadrature phase shift keying (OPSK), quadrature amplitude modulation (OAM) etc.
• OPSK quadrature phase shift keying
• OFAM quadrature amplitude modulation
• control channels including different pilot channels, require special treatment.
• Control channels are low throughput in nature but require high reliability.
• control channels often use special modulation schemes, irregular and varied tones/orthogonal frequency division multiplex (OFDM) symbols resource allocation, channel specific hopping, and the reuse of tone resources among different channels.
• OFDM irregular and varied tones/orthogonal frequency division multiplex
• the control channels are often modified over time.
• the control channel formats between different standards such as Ultra Mobile Broadband (UMB) and Long Term Evolution (LTE) are very different and flexibility in a system to adapt to one or the other is needed for versatility.
• UMB Ultra Mobile Broadband
• LTE Long Term Evolution
• a method for data centric multiplexing in a wireless communication system with a plurality of channels comprising assigning a first resource to a first of the plurality of channels; assigning a second resource to a second of the plurality of channels wherein the second resource is not the first resource; assigning a third resource to a third of the plurality of channels wherein the third resource is not the first or the second resource; and assigning a fourth resource to a fourth of the plurality of channels by puncturing at least one of the first, second or third resources and skipping the rest of unpunctured first, second or third resources.
• a method used in wireless communication system comprising encoding data bits to produce symbols to be transmitted in a data channel; specifying symbols without an encoding step to be transmitted in a control channel; generating a tile descriptor for designating tones to be used for the data channel and the control channel transmissions; generating a channel priority parameter to determine which one of the data or control channels paints on at least one of the tones first; generating a tone marker to identify which one of the data or control channels occupies one of the tones; generating a puncture bitmap to determine if one of the data or control channels can be punctured by another one of the data or control channels that is designated for the same tone; and multiplexing the data channel and the control channel for transmission according to at least one of the tile descriptor, the channel priority, the tone marker or the puncture bitmap.
• an apparatus for data centric multiplexing comprising a processor and circuitry configured to: assign a first resource to a first of the plurality of channels; assign a second resource to a second of the plurality of channels wherein the second resource is not the first resource; assign a third resource to a third of the plurality of channels wherein the third resource is not the first or the second resource; and assign a fourth resource to a fourth of the plurality of channels by puncturing at least one of the first, second or third resources and skipping the rest of unpunctured first, second or third resources.
• an apparatus comprising a processor and a memory, the memory containing program code executable by the processor for performing the following: encoding data bits to produce symbols to be transmitted in a data channel; specifying symbols without an encoding step to be transmitted in a control channel; generating a tile descriptor for designating tones to be used for the data channel and the control channel transmissions; generating a channel priority parameter to determine which one of the data or control channels paints on at least one of the first; generating a tone marker to identify which one of the data or control channels occupies one of the tone; generating a puncture bitmap to determine if one of the data or control channels can be punctured by another one of the data or control channels that is designated for the same tone; and multiplexing the data channel and the control channel for transmission according to at least one of the tile descriptor, the channel priority, the tone marker or the puncture bitmap.
• an apparatus for data centric multiplexing comprising means for assigning a first resource to a first of the plurality of channels; means for assigning a second resource to a second of the plurality of channels wherein the second resource is not the first resource; means for assigning a third resource to a third of the plurality of channels wherein the third resource is not the first or the second resource; and means for assigning a fourth resource to a fourth of the plurality of channels by puncturing at least one of the first, second or third resources and skipping the rest of unpunctured first, second or third resources.
• an apparatus for data centric multiplexing comprising means for encoding data bits to produce symbols to be transmitted in a data channel; means for specifying symbols without an encoding step to be transmitted in a control channel; means for generating a tile descriptor for designating tones to be used for the data channel and the control channel transmissions; means for generating a channel priority parameter to determine which one of the data or control channels paints on at least one of the tones first; means for generating a tone marker to identify which one of the data or control channels occupies one of the tone; means for generating a puncture bitmap to determine if one of the data or control 5
• channels can be punctured by another one of the data or control channels that is designated for the same tone; and means for multiplexing the data channel and the control channel for transmission according to at least one of the tile descriptor, the channel priority, the tone marker or the puncture bitmap.
• a computer-readable medium including program code stored thereon, comprising program code for assigning a first resource to a first of the plurality of channels; program code for assigning a second resource to a second of the plurality of channels wherein the second resource is not the first resource; program code for assigning a third resource to a third of the plurality of channels wherein the third resource is not the first or the second resource; and program code for assigning a fourth resource to a fourth of the plurality of channels by puncturing at least one of the first, second or third resources and skipping the rest of unpunctured first, second or third resources.
• a computer-readable medium including program code stored thereon, comprising program code for encoding data bits to produce symbols to be transmitted in a data channel; program code for specifying symbols without an encoding step to be transmitted in a control channel; program code for generating a tile descriptor for designating tones to be used for the data channel and the control channel transmissions; program code for generating a channel priority parameter to determine which one of the data or control channels paints on at least one of the tones first; program code for generating a tone marker to identify which one of the data or control channels occupies one of the tone; program code for generating a puncture bitmap to determine if one of the data or control channels can be punctured by another one of the data or control channels that is designated for the same tone; and program code for multiplexing the data channel and the control channel for transmission according to at least one of the tile descriptor, the channel priority, the tone marker or the puncture bitmap.
• apparatus and method for an asynchronous command interface to an encoder and multiplexer module in a wireless communication system According to one aspect, a method for loosely or coarsely synchronizing constraints between an 6
• amethod used in wireless communication system comprising synchronizing an encoder and a multiplexer up to a frame; pushing jobs from the encoder into a pending queue; determining if the jobs in the pending queue are from the frame; pushing jobs from the pending queue to an active queue if the jobs are from the same frame; and multiplexing the jobs from the same frame.
• an apparatus operable in wireless communication system comprising means for synchronizing an encoder and a multiplexer up to a frame; means for pushing jobs from the encoder into a pending queue; means for determining if the jobs in the pending queue are from the frame; means for pushing jobs from the pending queue to an active queue if the jobs are from the same frame; and means for multiplexing the jobs from the same frame.
• a machine-readable medium comprising instructions which, when executed by a machine, cause the machine to perform operations including synchronizing an encoder and a multiplexer up to a frame; pushing jobs from the encoder into a pending queue; determining if the jobs in the pending queue are from the frame; pushing jobs from the pending queue to an active queue if the jobs are from the same frame; and multiplexing the jobs from the same frame.
• an apparatus operable in a wireless communication system comprising a processor, configured to: synchronize an encoder and a multiplexer up to a frame; push jobs from the encoder into a pending queue; determine if the jobs in the pending queue are from the frame; push jobs from the pending queue to an active queue if the jobs are from the same frame; and multiplex the jobs from the same frame; and a memory coupled to the processor for storing data.
• Advantages of the present disclosure include versatility to allow adapting of special modulation schemes, irregular and varied tones/orthogonal frequency division multiplex (OFDM) symbols resource allocation, channel specific hopping, and the reuse of tone resources among different channels without requirement of massive hardware 7
• OFDM orthogonal frequency division multiplex
• Figure 1 is a block diagram illustrating an example of a multiple access wireless communication system.
• Figure 2 is a block diagram illustrating an example of a wireless MIMO communication system.
• Figure 3 is a block diagram illustrating an example of a transmit data processor with an encoder engine and a multiplexer engine for a UMB forward link.
• Figure 4 illustrates an example process flow diagram for resource multiplexing to resolve resource overlapping issues in a wireless communication system.
• Figure 5 illustrates an example process flow diagram for resource multiplexing to resolve resource overlapping issues in an OFDMA system.
• Figure 6 illustrates an example of an apparatus useful in accord with the present disclosure
• Figure 7 illustrates an example of a device 700 suitable for data centric multiplexing, for example, in a wireless communication system.
• Figure 8 is a diagram of a superframe.
• Figure 9 is a block diagram of illustrating the relationship of an encoder and multiplexer in accord with the disclosures herein. 8
• CDMA Code Division Multiple Access
• TDMA Time Division Multiple Access
• FDMA Frequency Division Multiple Access
• OFDMA Orthogonal FDMA
• SC-FDMA Single-Carrier FDMA
• UTRA Universal Terrestrial Radio Access
• W-CDMA Wideband-CDMA
• LCR Low Chip Rate
• Cdma2000 covers IS-2000, IS-95 and IS-856 standards.
• a TDMA system may implement a radio technology such as Global System for Mobile Communications (GSM).
• GSM Global System for Mobile Communications
• An OFDMA system may implement a radio technology such as Evolved UTRA (E-UTRA), IEEE 802.11, IEEE 802.16, IEEE 802.20, Flash-OFDM ® , etc.
• E-UTRA, E-UTRA, and GSM are part of Universal Mobile Telecommunication System (UMTS).
• UMTS Universal Mobile Telecommunication System
• LTE Long Term Evolution
• UTRA, E-UTRA, GSM, UMTS and LTE are described in documents from an organization named "3rd Generation Partnership Project" (3GPP).
• Cdma2000 is described in documents from an organization named "3rd Generation Partnership Project 2" (3GPP2). These various radio technologies and standards are known in the art.
• SC-FDMA single carrier frequency division multiple access
• a SC-FDMA system can have similar performance and the same overall complexity as those of an OFDMA system.
• SC-FDMA signal has lower peak-to-average power ratio (PAPR) because of its inherent single carrier structure.
• PAPR peak-to-average power ratio
• SC- FDMA has drawn great attention, especially in uplink communications where lower PAPR greatly benefits the mobile terminal in terms of transmit power efficiency.
• Using SC-FDMA technique is currently a working assumption for uplink multiple access scheme in 3GPP Long Term Evolution (LTE), or Evolved UTRA. All of the above wireless communication techniques and standards may be used with the data centric multiplexing algorithms described herein.
• FIG. 1 is a block diagram illustrating an example of a multiple access wireless communication system.
• an access point 100 includes multiple antenna groups, one including 104 and 106, another including 108 and 110, and an additional including 112 and 114.
• Access terminal 116 is in communication with antennas 112 and 114, where antennas 112 and 114 transmit information to access terminal 116 over forward link 120 and receive information from access terminal 116 over reverse link 118.
• Access terminal 122 is in communication with antennas 106 and 108, where 10
• antennas 106 and 108 transmit information to access terminal 122 over forward link 126 and receive information from access terminal 122 over reverse link 124.
• communication links 118, 120, 124 and 126 may use different frequency for communication.
• forward link 120 may use a different frequency then that used by reverse link 118.
• Each group of antennas and/or the area in which they are designed to communicate is often referred to as a sector of the access point.
• antenna groups each are designed to communicate to access terminals in a sector, of the areas covered by access point 100.
• the transmitting antennas of access point 100 utilize beamforming in order to improve the signal-to- noise ratio of forward links for the different access terminals 116 and 124. Also, an access point using beamforming to transmit to access terminals scattered randomly through its coverage causes less interference to access terminals in neighboring cells than an access point transmitting through a single antenna to all its access terminals.
• An access point may be a fixed station. An access point may also be referred to as an access node, a base station or some other similar terminology known in the art. An access terminal may also be called a mobile station, a user equipment (UE), a wireless communication device or some other similar terminology known in the art.
• FIG. 2 is a block diagram illustrating an example of a wireless MIMO communication system.
• Figure 2 shows a transmitter system 210 (also known as an access point) and a receiver system 250 (also known as an access terminal) in a MIMO system 200.
• traffic data for a number of data streams is provided from a data source 212 to a transmit (TX) data processor 214.
• TX data processor 214 formats, codes, and interleaves the traffic data for each data stream based on a particular coding scheme selected for that data stream to provide coded data.
• the coded data for each data stream may be multiplexed with pilot data using OFDM techniques.
• the pilot data is typically a known data pattern that is processed in a known manner and may be used at the receiver system to estimate the channel response.
• the multiplexed pilot and coded data for each data stream is then 11
• modulated i.e., symbol mapped
• a particular modulation scheme e.g., BPSK, QSPK, M-PSK, or M-QAM
• the data rate, coding, and modulation for each data stream may be determined by instructions performed by processor 230.
• the modulation symbols for all data streams are then provided to a TX MIMO processor 220, which may further process the modulation symbols (e.g., for OFDM).
• TX MIMO processor 220 then provides NT modulation symbol streams to NT transmitters (TMTR) 222a through 222t.
• TMTR NT transmitters
• the TX MIMO processor 220 applies beamforming weights to the symbols of the data streams and to the antenna from which the symbol is being transmitted.
• Each transmitter 222a, ..or, 222t receives and processes a respective symbol stream to provide one or more analog signals, and further conditions (e.g., amplifies, filters, and upconverts) the analog signals to provide a modulated signal suitable for transmission over the MIMO channel.
• NT modulated signals from transmitters 222a through 222t are then transmitted from NT antennas 224a through 224t, respectively.
• the transmitted modulated signals are received by NR antennas 252a through 252r and the received signal from each antenna 252a, ..or 252r is provided to a respective receiver (RCVR) 254a through 254r.
• Each receiver 254 a, ..or 254r conditions (e.g., filters, amplifies, and downconverts) a respective received signal, digitizes the conditioned signal to provide samples, and further processes the samples to provide a corresponding "received" symbol stream.
• a RX data processor 260 then receives and processes the NR received symbol streams from NR receivers 254a through 254r based on a particular receiver processing technique to provide NT "detected" symbol streams.
• the RX data processor 260 then demodulates, deinterleaves, and decodes each detected symbol stream to recover the traffic data for the data stream.
• the processing by RX data processor 260 is complementary to that performed by TX MIMO processor 220 and TX data processor 214 at transmitter system 210.
• a processor 270 periodically determines which pre- coding matrix to use (discussed below). Processor 270 formulates a reverse link message comprising a matrix index portion and a rank value portion. 12
• the reverse link message may comprise various types of information regarding the communication link and/or the received data stream.
• the reverse link message is then processed by a TX data processor 238, which also receives traffic data for a number of data streams from a data source 236, modulated by a modulator 280, conditioned by transmitters 254a through 254r, and transmitted back to transmitter system 210.
• the modulated signals from receiver system 250 are received by antennas 224a through 224t, conditioned by receivers 222a through 222t, demodulated by a demodulator 240, and processed by a RX data processor 242 to extract the reserve link message transmitted by the receiver system 250.
• Processor 230 determines which pre-coding matrix to use for determining the beamforming weights, then the processor 230 processes the extracted message.
• the transceivers 222a through 222t are called transmitters in the forward link and receivers in the reverse link.
• the transceivers 254a through 254r are called receivers in the forward link and transmitters in the reverse link.
• FIG. 3 is a block diagram illustrating an example of a transmit (TX) data processor with an encoder engine and a multiplexer engine. Included in Figure 3 is a generalized and efficient data centric multiplexer (mux) engine with the ability to handle high rate data traffic throughput and the flexibility to handle various control channels.
• the data centric multiplexer engine architecture includes a tile resource descriptor, tone marker, and priorities.
• the multiplexer (mux) engine also may be reused by the different communication standards, for example, LTE.
• the common and high throughput related blocks such as the
• QPSK/QAM tone modulation are implemented in hardware, while firmware handles the modulations of low throughput control channels. Firmware controls tone/OFDM 13
• firmware has the total control and works with the hardware in a coordinated fashion to achieve a desired multiplexer operation.
• functional partitioning is performed to allocate functions between hardware and software.
• Hardware implements the modulation of the forward link data channel (FLDCH) because of the very high channel throughput, which implies a more cost-effective and efficient solution in hardware, and because the data channel typically does not change over the evolution of a wireless standard.
• FLDCH forward link data channel
• software implements all other control channels because of the relatively low channel throughput, which can be effectively implemented in software, and because the control channels typically do change over the evolution of a wireless standard.
• software controls hardware through various data configurations and can support the wireless standard evolution beyond, for example, the Ultra Mobile Broadband (UMB) phase.
• UMB Ultra Mobile Broadband
• the data centric multiplexer assignment consists of two parts, one part for the pilot and one part for the data.
• Each resource assigned to either the pilot or the data includes a tile descriptor, buffer mode, and input buffer pointer.
• the data bits are generated by the encoder engine.
• software specifies the modulated inphase/quadrature (I/O) symbols to be transmitted.
• a frequency hopping table is generated by software and downloaded to hardware.
• the frequency hopping table is used to assign (i.e., map) tones as a function of time.
• the tile allocation states which set of logical tiles are used in the assignment.
• a tile descriptor is used as a generalized resource description.
• the tile definition is an N x M rectangle which is defined on a frequency (tone)-time domain, where N is the number of tones and M is the number of symbols (e.g., OFDM symbols).
• the allocation of tone and symbol r esources (e.g., OFDM symbol resources) within a tile is arbitrary and described by a tile descriptor.
• tile descriptors are downloaded to hardware by software. Different types of tile 14
• descriptors may be used to best describe the resource allocation within a tile (with respect to memory usage efficiency).
• a bitmap may be suitable for a dense tile, such as for FLDCH.
• an index may be suitable for a sparse tile, such as for forward link cell null channel (FLCN).
• a step may be suitable for a regular spaced tile, such as for forward link beacon channel (FLBCN).
• the hopping unit is a tile.
• Software may generate and download a hopping table to hardware. Hopping may be performed channel by channel.
• Four hopping modes may include, for example: no hopping (e.g., FLBCN); logical to physical tile hopping, e.g., Block Resource Channel (BRCH) hopping for FLDCH, Forward Link Control Segment (FLCS); direct physical hopping, e.g., Forward Link Preamble (FLPREAMBLE), FLCN; and Distributed Resource Channel (DRCH) hopping.
• no hopping e.g., FLBCN
• BRCH Block Resource Channel
• FLCS Forward Link Control Segment
• FLCS Forward Link Control Segment
• FLCS Forward Link Control Segment
• FLCN Forward Link Preamble
• DRCH Distributed Resource Channel
• multiplexer job priority i.e., channel priority
• tone markers are used to support flexible tone painting (i.e., tone mapping).
• a certain tone can be mapped to multiple channels.
• a Skip case the tone is occupied by a previous channel such that the following channel goes around this tone, i.e., skips the tone.
• a FLDCH tone will go around (i.e., skip) the tones occupied by Forward Link Channel Quality Indicator (FLCQI).
• FLCQI Forward Link Channel Quality Indicator
• Puncture case the tone is occupied by a previous channel and a following channel reclaims the tone, i.e., puncture out the modulated symbol generated by the previous channel.
• a FLCN tone will only puncture the tones occupied by FLDCH data tones.
• three parameters are implemented: 1) Channel priority: determines which channel paints (i.e., maps) on the tone first; 2) Tone markers: each tone has an associated marker (e.g., a 3 bit marker) to identify which channel occupies this tone; and 3) x-bit puncture bitmap wherein each channel has a puncture bitmap wherein x defines the number of bits.
• an 8 bit puncture bitmap defines that one or more previous channels can be punctured if they occupy the same tones mapped to a current channel. 15
• a buffer mode is implemented. Since software downloads FLDCH pilots and control channel modulated symbols, it is important to implement a multiple buffer mode to reduce the traffic between software and hardware.
• a tile wrap mode handles FLDCH pilot modulated symbols.
• a marker only mode marks tones described by a tile descriptor without memory access to the multiplexer output I/O symbol buffer which greatly saves multiplexer memory. As an example, the FLBCN channel only has one tone of modulated symbol, but all tones across the entire bandwidth need to be marked as occupied. This is handled by the marker only mode without doubling the multiplexer output buffer bandwidth.
• an OFDMA resource multiplexing algorithm is used to resolve resource overlapping issues.
• radio resources are shared among different channels, such as pilot channels, control channels, and traffic channels.
• a defined multiplexing policy determines the usefulness of a specific resource (a tone or a subcarrier) for a particular channel, and in the case a resource is already occupied, the defined multiplexing policy determines whether the occupant channel is to be punctured or to be avoided (i.e., skipped). For example, in a UMB forward link, blocks of resources allocated to FLDCH are overlapped by FLDPI or FLDPICH (forward dedicated pilot channel), FLCOICH (forward channel quality indicator pilot channel), and FLBCN (forward link beacon channel).
• the FLDCH gets around resources overlapped by these pilot channels and uses the next available resource.
• FLCN forward link cell null channel
• FLCN forward link cell null channel only uses a resource that is not occupied by any other channel (a free resource), or a resource that is occupied by FLDCH.
• the transmit data processor 300 includes an encoder engine 310 and multiplexer engine 320 which can be used, for example, in a UMB forward link.
• Firmware 330 associated with a processor 340 passes encoder and multiplexer information through a hardware command interface 331 to the encoder engine 310.
• the encoder engine 310 accepts bits 301 and encodes them into encoded bits 311 and sends them to the multiplexer engine 320.
• the encoder engine 310 also sends multiplexer information 312, including the multiplexing job priority and the puncture 16
• the multiplexer engine 320 then modulates encoded bits 311 into QPSK/QAM symbols 321 and places them onto the dedicated resources (tones) according to the multiplexer information 312.
• each multiplexing job has the following information.
• Multiplexing job priority this information dictates which channel is multiplexed first.
• Marker this is used to indicate the resource being occupied by which channel.
• An internal marker buffer holds the information for all the resources. Once a resource is occupied by the current multiplexing job, a marker will be saved to buffer for that resource.
• Puncture bitmap this information dictates whether the current multiplexing job can reclaim a resource which is already being occupied by previous multiplexing job with higher job priority. The marker level in the marker buffer is checked against the puncture bitmap.
• a "1" in the bitmap means the channel can reclaim the resource if it is occupied by a channel with corresponding marker (bit location N in bitmap corresponds to marker level N.), which results in the previous channel being punctured. Otherwise, that resource will be avoided (i.e., skipped) and the previous channel remains on that resource.
• FLBCN forward beacon channel
• FLDPI forward dedicated pilot channel
• FLDCH forward data channel
• FLCN forward cell null channel
• FLBCN is first.
• FLDPI needs to avoid (i.e., skip) resources occupied by FLBCN
• FLDCH needs to avoid (i.e., skip) resources occupied by both FLBCN and FLDPI.
• FLCN can only puncture (i.e., reclaim) the resources occupied by FLDCH and must avoid (i.e., skip) resources occupied by the other channels.
• the appropriate priority, marker and puncture bitmap for each channel in the firmware is assigned to satisfy the UMB requirement.
• the data centric multiplexer has eight job priorities, and uses three bits for the marker and eight bits for the puncture bitmap: 1) FLDCH: priority 1, marker 1, puncture bitmap 00000010b; 2) FLCN: priority 0 (lowest), marker 2, puncture bitmap 17
• FLBCN priority 7 (highest), marker 7, puncture bitmap 11111111b; and 4) FLDPI: priority 2, marker 4, puncture bitmap 00010000b.
• Figure 4 illustrates an example process flow diagram for resource multiplexing to resolve resource overlapping issues in a wireless communication system with a plurality of channels.
• there are four channels. Predetermine the channel (e.g., first channel) with the highest priority, followed by three other channels (second channel, third channel and fourth channel) with predetermined priorities.
• block 410 perform assignment for the first channel by assigning a first resource to a first of the plurality of channels.
• block 420 perform assignment for the second channel by avoiding resources occupied by first channel. That is, assign a second resource to a second of the plurality of channels wherein the second resource is not the first resource.
• block 430 perform assignment for the third channel by avoiding resources occupied by both first and second channel. That is, assign a third resource to a third of the plurality of channels wherein the third resource is not the first or the second resource.
• block 440 perform an assignment for the fourth channel by puncturing at least one of the resources occupied by one of the first, second or third channels and avoiding (i.e., skipping) other resources occupied by the rest of the first, second and third channels. That is, assign a fourth resource to a fourth of the plurality of channels by puncturing at least one of the first, second or third resources and skipping the rest of the unpunctured first, second or third resources.
• One skilled in the art would understand that although the example of Figure 4 is illustrated with four channels, that other quantity of channels can be substituted without affecting the scope or spirit of the present disclosure.
• Figure 5 illustrates an example process flow diagram for resource multiplexing to resolve resource overlapping issues in an OFDMA system.
• the highest priority is for the FLBCN, followed by FLDPI, FLDCH, and FLCN, in the order listed.
• block 510 perform FLBCN assignment first.
• block 520 perform FLDPI assignment by avoiding resources occupied by FLBCN.
• block 530 perform FLDCH assignment by avoiding resources occupied by both FLBCN and FLDPI.
• block 540 perform FLCN assignment by puncturing 18
• the processing units may be implemented within one or more application specific integrated circuits (ASICs), digital signal processors (DSPs), digital signal processing devices (DSPDs), programmable logic devices (PLDs), field programmable gate arrays (FPGAs), processors, controllers, microcontrollers, microprocessors, other electronic units designed to perform the functions described therein, or a combination thereof.
• ASICs application specific integrated circuits
• DSPs digital signal processors
• DSPDs digital signal processing devices
• PLDs programmable logic devices
• FPGAs field programmable gate arrays
• processors controllers, microcontrollers, microprocessors, other electronic units designed to perform the functions described therein, or a combination thereof.
• the implementation may be through modules (e.g., procedures, functions, etc.) that performs the functions 19
• the software codes may be stored in memory units and executed by a processor unit. Additionally, the various illustrative flow diagrams, logical blocks, modules and/or algorithm steps described herein may also be coded as computer- readable instructions carried on any computer-readable medium known in the art or implemented in any computer program product known in the art.
• a processor is coupled with a memory which stores data, metadata, program instructions, etc. to be executed by the processor for implementing or performing the various flow diagrams, logical blocks and/or modules described herein.
• Figure 6 illustrates an example of a device 600 comprising a processor 610 in communication with a memory 620 for data centric multiplexing, for example, in a wireless communication system.
• the device 600 is used to implement the algorithm illustrated in either Figures 4 or 5.
• the memory 620 is located within the processor 610.
• the memory 620 is external to the processor 610.
• the processor includes circuitry for implementing or performing the various flow diagrams, logical blocks and/or modules described herein.
• Figure 7 illustrates an example of a device 700 suitable for data centric multiplexing, for example, in a wireless communication system.
• the device 700 is implemented by at least one processor comprising one or more modules configured to provide different aspects of for data centric multiplexing as described herein in blocks 710, 720, 730 and 740.
• each module comprises hardware, firmware, software, or any combination thereof.
• the device 700 is also implemented by at least one memory in communication with the at least one processor.
• Each frame of superframe 800 comprises eight (8) OFDM 20
• each of the individual frames includes information relating to a particular transmission, including audio and video data and overhead information. Stated otherwise, in UMB a frame is a unit of time equal to 8 OFDM symbols.
• FLDCH forward link data channels
• FLCQICH FLBCH
• FLCQJCH FLCQJCH channel
• firmware included within the apparatus submits an encode/multiplex job for a control channel, such as the forward channel quality indicator pilot channel, just in time, say on symbol 2 of the frame, so that the job can be included on symbols 3 and 4 of the frame.
• a control channel such as the forward channel quality indicator pilot channel
• a firmware module can output push an encode/multiplex job into a job FIFO queue as long as this job is destined to be muxed out in the next frame.
• the encoder module continuously pops encode/multiplex jobs out of its FIFO and processes them. Once the encoder finishes with the job, it pushes the job into a pending queue feeding the multiplexer.
• Each encode/multiplex job is associated with a job descriptor that has among its fields, for each identified frame, a startSymbol and a numSymbol, which describe the job.
• the startSymbol is a number between 0 and 7 that indicates at which symbol the job becomes active and the numSymbol is a number that indicates the number of symbols the job remains active once it has started.
• an encode/multiplex job for the FLCQJCH channel which as noted above is transmitted on third and fourth symbols of a frame, the job descriptor will include a startSymbol of 2 and a numSymbol of 2.
• the multiplexer For every frame to be multiplexed by the multiplexer, the multiplexer will inspect all the jobs in the pending queues and push jobs whose startSymbol matches the current symbol number into one of the active queues. Multiple active queues may be utilized and ordered by priority, although only one such active queue is illustrated here for purposes of simplicity. In addition, the multiplexer also processes all the jobs that are present in the active queues in the order of their priority. It decrements the numSymbols count on each job that it has processed. Finally it inspects all the active queues and removes all the jobs that have expired, that is when the corresponding numSymbols count has reached zero.
• Figure 9 illustrates an embodiment 900 in accord with the disclosures herein.
• an encoder 902 receiving jobs 904 (for example, bits 301 of Figure 3) which processes the job as previously described herein, but in addition providing a job descriptor (for example, multiplexer information 312 of Figure 3) inclusive of the previously described startSymbol and numSymbol.
• the output of the encoder 902 is provided to a pending queue 906.
• a pending queue 906 For simplicity of illustration, only three encoded OFDM symbols 908a, 908b, and 908c, for a particular frame of a superframe are illustrated.
• a multiplexer 910 for example multiplexer 320 of Figure 3
• the symbols 908 are placed into an active queue on the basis of their priority as described above and multiplexed accordingly. That is, each of 22
• the jobs or symbols 908 will be examined to determine if they should be multiplexed into the same frame. If the jobs are from the same frame they will be moved from the pending queue 906 into the active queue 912 for processing of that frame by multiplexer 910.

Landscapes

• Engineering & Computer Science (AREA)
• Signal Processing (AREA)
• Computer Networks & Wireless Communication (AREA)
• Mobile Radio Communication Systems (AREA)

Priority Applications (4)

Applications Claiming Priority (4)

Publications (1)

Family

ID=40790674

Family Applications (1)

Country Status (5)

Families Citing this family (2)

Citations (4)

Family Cites Families (3)

• 2009
  • 2009-03-31 JP JP2010549946A patent/JP5290332B2/ja not_active Expired - Fee Related
  • 2009-03-31 EP EP09729008A patent/EP2277085A1/en not_active Withdrawn
  • 2009-03-31 CN CN200980101327.5A patent/CN101889250B/zh not_active Expired - Fee Related
  • 2009-03-31 WO PCT/US2009/039036 patent/WO2009124093A1/en active Application Filing
  • 2009-03-31 KR KR1020107019601A patent/KR101123447B1/ko not_active IP Right Cessation

Patent Citations (4)

Non-Patent Citations (1)

Also Published As

Similar Documents

Legal Events