US20080212657A1 - Iterative detection and decoding for a mimo-ofdm system - Google Patents

Iterative detection and decoding for a mimo-ofdm system Download PDF

Info

Publication number
US20080212657A1
US20080212657A1 US12/119,253 US11925308A US2008212657A1 US 20080212657 A1 US20080212657 A1 US 20080212657A1 US 11925308 A US11925308 A US 11925308A US 2008212657 A1 US2008212657 A1 US 2008212657A1
Authority
US
United States
Prior art keywords
transmitter
modulation
priori information
decoding
information
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Abandoned
Application number
US12/119,253
Inventor
Bjorn A. Bjerke
John W. Ketchum
Jay R. Walton
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Qualcomm Inc
Original Assignee
Qualcomm Inc
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Qualcomm Inc filed Critical Qualcomm Inc
Priority to US12/119,253 priority Critical patent/US20080212657A1/en
Publication of US20080212657A1 publication Critical patent/US20080212657A1/en
Assigned to QUALCOMM, INCORPORATED reassignment QUALCOMM, INCORPORATED ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: BJERKE, BJORN A., KETCHUM, JOHN W., WALTON, JAY R.
Abandoned legal-status Critical Current

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/004Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0045Arrangements at the receiver end
    • H04L1/0047Decoding adapted to other signal detection operation
    • H04L1/005Iterative decoding, including iteration between signal detection and decoding operation
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L27/00Modulated-carrier systems
    • H04L27/26Systems using multi-frequency codes
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/0001Systems modifying transmission characteristics according to link quality, e.g. power backoff
    • H04L1/0002Systems modifying transmission characteristics according to link quality, e.g. power backoff by adapting the transmission rate
    • H04L1/0003Systems modifying transmission characteristics according to link quality, e.g. power backoff by adapting the transmission rate by switching between different modulation schemes
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/0001Systems modifying transmission characteristics according to link quality, e.g. power backoff
    • H04L1/0009Systems modifying transmission characteristics according to link quality, e.g. power backoff by adapting the channel coding
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/004Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056Systems characterized by the type of code used
    • H04L1/0059Convolutional codes
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/004Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056Systems characterized by the type of code used
    • H04L1/0064Concatenated codes
    • H04L1/0066Parallel concatenated codes
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/004Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056Systems characterized by the type of code used
    • H04L1/0071Use of interleaving
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/02Arrangements for detecting or preventing errors in the information received by diversity reception
    • H04L1/06Arrangements for detecting or preventing errors in the information received by diversity reception using space diversity
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L25/00Baseband systems
    • H04L25/02Details ; arrangements for supplying electrical power along data transmission lines
    • H04L25/03Shaping networks in transmitter or receiver, e.g. adaptive shaping networks
    • H04L25/03006Arrangements for removing intersymbol interference
    • H04L25/03171Arrangements involving maximum a posteriori probability [MAP] detection
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L25/00Baseband systems
    • H04L25/02Details ; arrangements for supplying electrical power along data transmission lines
    • H04L25/03Shaping networks in transmitter or receiver, e.g. adaptive shaping networks
    • H04L25/03006Arrangements for removing intersymbol interference
    • H04L25/03178Arrangements involving sequence estimation techniques
    • H04L25/03305Joint sequence estimation and interference removal
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L25/00Baseband systems
    • H04L25/02Details ; arrangements for supplying electrical power along data transmission lines
    • H04L25/03Shaping networks in transmitter or receiver, e.g. adaptive shaping networks
    • H04L25/03891Spatial equalizers
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L25/00Baseband systems
    • H04L25/02Details ; arrangements for supplying electrical power along data transmission lines
    • H04L25/06Dc level restoring means; Bias distortion correction ; Decision circuits providing symbol by symbol detection
    • H04L25/067Dc level restoring means; Bias distortion correction ; Decision circuits providing symbol by symbol detection providing soft decisions, i.e. decisions together with an estimate of reliability
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L27/00Modulated-carrier systems
    • H04L27/02Amplitude-modulated carrier systems, e.g. using on-off keying; Single sideband or vestigial sideband modulation
    • H04L27/06Demodulator circuits; Receiver circuits
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L27/00Modulated-carrier systems
    • H04L27/26Systems using multi-frequency codes
    • H04L27/2601Multicarrier modulation systems
    • H04L27/2647Arrangements specific to the receiver only
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04BTRANSMISSION
    • H04B7/00Radio transmission systems, i.e. using radiation field
    • H04B7/02Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
    • H04B7/04Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
    • H04B7/0413MIMO systems
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04BTRANSMISSION
    • H04B7/00Radio transmission systems, i.e. using radiation field
    • H04B7/02Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
    • H04B7/04Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
    • H04B7/08Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the receiving station
    • H04B7/0837Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the receiving station using pre-detection combining
    • H04B7/0842Weighted combining
    • H04B7/0848Joint weighting
    • H04B7/0854Joint weighting using error minimizing algorithms, e.g. minimum mean squared error [MMSE], "cross-correlation" or matrix inversion
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00Arrangements affording multiple use of the transmission path
    • H04L5/0001Arrangements for dividing the transmission path
    • H04L5/0014Three-dimensional division
    • H04L5/0023Time-frequency-space

Definitions

  • the present invention relates generally to data communication, and more specifically to techniques for performing iterative detection and decoding for a MIMO-OFDM communication system.
  • a multiple-input multiple-output (MIMO) communication system employs multiple (N T ) transmit antennas and multiple (N R ) receive antennas for data transmission.
  • a MIMO channel formed by the N T transmit and N R receive antennas may be decomposed into N S independent channels, with N S ⁇ min ⁇ N T , N R ⁇ .
  • Each of the N S independent channels is also referred to as a spatial subchannel of the MIMO channel and corresponds to a dimension.
  • the MIMO system can provide improved performance (e.g., increased transmission capacity) over that of a single-input single-output (SISO) communication system if the additional dimensionalities created by the multiple transmit and receive antennas are utilized.
  • SISO single-input single-output
  • a wideband MIMO system typically experiences frequency selective fading, i.e., different amounts of attenuation across the system bandwidth.
  • This frequency selective fading causes inter-symbol interference (ISI), which is a phenomenon whereby each symbol in a received signal acts as distortion to subsequent symbols in the received signal. This distortion degrades performance by impacting the ability to correctly detect the received symbols.
  • ISI is a non-negligible noise component that may have a large impact on the overall signal-to-noise-and-interference ratio (SNR) for systems designed to operate at high SNR levels, such as MIMO systems.
  • SNR signal-to-noise-and-interference ratio
  • equalization may be used at the receivers to combat ISI.
  • the computational complexity required to perform equalization is typically significant or prohibitive for most applications.
  • Orthogonal frequency division multiplexing may be used to combat ISI, and achieves this without the use of computationally intensive equalization.
  • An OFDM system effectively partitions the system bandwidth into a number of (N F ) frequency subchannels, which may be referred to as sub-bands or frequency bins. Each frequency subchannel is associated with a respective subcarrier upon which data may be modulated.
  • the frequency subchannels of the OFDM system may experience frequency selective fading (i.e., different amounts of attenuation for different frequency subchannels), depending on the characteristics (e.g., multipath profile) of the propagation path between the transmit and receive antennas.
  • the ISI due to the frequency selective fading may be combated by repeating a portion of each OFDM symbol (i.e., appending a cyclic prefix to each OFDM symbol), as is known in the art.
  • a MIMO system may thus advantageously employ OFDM to combat ISI.
  • the frequency subchannels of the MIMO-OFDM system may experience different channel conditions (e.g., different fading and multipath effects) and may achieve different SNRs.
  • the channel conditions may vary over time. Consequently, the supported data rates may vary from frequency subchannel to frequency subchannel and from spatial subchannel to spatial subchannel, and may further vary with time.
  • aspects of the invention provide techniques to iteratively detect and decode data transmitted in a wireless (e.g., MIMO-OFDM) communication system.
  • the iterative detection and decoding exploits the error correction capabilities of the channel code to provide improved performance. This is achieved by iteratively passing soft (multi-bit) “a priori” information between a soft-input soft-output detector and a soft-input soft-output decoder.
  • the detector receives modulation symbols previously generated at a transmitter system based on one or more coding and modulation schemes, performs a detection function that is complementary to the symbol mapping performed at the transmitter system, and provides soft-decision symbols for transmitted coded bits. Extrinsic information in the soft-decision symbols (which comprises the a priori information for the decoder, as described below) is then decoded by the decoder based on one or more decoding schemes complementary to the one or more coding schemes used at the transmitter system. The decoder further provides its extrinsic information (which comprises the a priori information for the detector) that is then used by the detector in the detection process.
  • the detection and decoding may be iterated a number of times. During the iterative detection and decoding process, the reliability of the bit decisions is improved with each iteration.
  • the iterative detection and decoding process described herein may be used to combat frequency selective fading as well as flat fading. Moreover, the iterative detection and decoding process may be flexibly used with various types of coding schemes (e.g., serial and parallel concatenated convolutional codes) and with various modulation schemes (e.g., M-PSK and M-QAM).
  • the a priori information passed between the detector and decoder and the soft-decision symbols may be represented using log-likelihood ratios (LLRs).
  • LLRs log-likelihood ratios
  • Techniques are provided herein to reduce the computational complexity associated with deriving the LLRs. Such techniques include the use of interference nulling to isolate each transmitted signal by removing the other interferers and the use of a “dual-maxima” or some other approximation to compute the LLRs, which are described below.
  • the invention further provides methods, receiver units, transmitter units, receiver systems, transmitter systems, systems, and other apparatuses and elements that implement various aspects, embodiments, and features of the invention, as described in further detail below.
  • FIG. 1 is a block diagram of a transmitter system and a receiver system in a MIMO-OFDM system
  • FIGS. 2A and 2B are block diagrams of two transmitter units that code and modulate data with (1) a single coding and modulation scheme and (2) separate coding and modulation schemes on a per-antenna basis, respectively;
  • FIGS. 3A and 3B are block diagrams of serial and parallel concatenated convolutional encoders, respectively;
  • FIG. 3C is a block diagram of a recursive convolutional encoder
  • FIGS. 4A and 4B are block diagrams of two receiver units that detect and decode data previously processed with (1) a single coding and modulation scheme and (2) separate coding and modulation schemes on a per-antenna basis, respectively;
  • FIG. 4C is a block diagram of a receiver unit that performs successive nulling and interference cancellation to recover one transmitted signal at a time
  • FIGS. 5A and 5B are block diagrams of two Turbo decoders capable of performing iterative decoding for serial and parallel concatenated convolutional codes, respectively;
  • FIG. 6 is a block diagram of an interference canceller that may be used for the receiver unit in FIG. 4C .
  • the iterative detection and decoding techniques described herein may be used for various wireless communication systems.
  • various aspects and embodiments of the invention are described specifically for multiple-input multiple output communication system that implements orthogonal frequency division multiplexing (i.e., a MIMO-OFDM system).
  • a MIMO system employs N T transmit antennas and N R receive antennas for data transmission, where N R ⁇ N T .
  • a MIMO channel formed by the N T transmit antennas and N R receive antennas may be decomposed into N S spatial subchannels, where N S ⁇ min ⁇ N T , N R ⁇ .
  • An OFDM system effectively partitions the system bandwidth into N F frequency subchannels. Each frequency subchannel may be defined to be sufficiently narrow so that its frequency response is considered flat or frequency non-selective.
  • FIG. 1 is a block diagram of an embodiment of a transmitter system 110 and a receiver system 150 in a MIMO-OFDM system 100 .
  • Transmitter system 110 and receiver system 150 are capable of implementing various aspects and embodiments of the invention, as described below.
  • traffic data is provided at a particular data rate from a data source 112 to a transmit (TX) data processor 114 , which codes and interleaves the traffic data based on one or more coding schemes to provide coded data.
  • the coding may be performed based on a single coding scheme for all transmit antennas, one coding scheme for each transmit antenna or each subset of transmit antennas, or one coding scheme for each transmission channel or each group of transmission channels.
  • the data rate and the coding may be determined by a data rate control and a coding control, respectively, provided by a controller 130 .
  • the coded data is then provided to a modulator 116 , which may also receive pilot data (e.g., data of a known pattern and processed in a known manner).
  • the pilot data may be multiplexed with the coded traffic data (e.g., using time division multiplexing (TDM) or code division multiplexing (CDM)) in all or a subset of the frequency subchannels and in all or a subset of the spatial subchannels used to transmit the traffic data.
  • TDM time division multiplexing
  • CDM code division multiplexing
  • the pilot may be used by the receiver system to perform a number of functions such as acquisition, frequency and timing synchronization, channel estimation, coherent data demodulation, and so on.
  • the processing by modulator 116 includes (1) modulating the received data with one or more modulation schemes (e.g., M-PSK, M-QAM, and so on) to provide modulation symbols, (2) transforming the modulation symbols to form OFDM symbols, and (3) appending a cyclic prefix to each OFDM symbol to form a corresponding transmission symbol.
  • the modulation may be performed based on a single modulation scheme for all transmit antennas, one modulation scheme for each transmit antenna or each subset of transmit antennas, or one modulation scheme for each transmission channel or each group of transmission channels.
  • the modulation is performed based on a modulation control provided by controller 130 .
  • the modulated data i.e., the transmission symbols
  • TMTR transmitters
  • Each transmitter 122 converts the received modulated data into one or more analog signals and further conditions (e.g., amplifies, filters, and quadrature modulates) the analog signals to generate a modulated signal suitable for transmission over the communication channel.
  • the modulated signals from transmitters 122 a through 122 t are then transmitted via antennas 124 a through 124 t , respectively, to the receiver system.
  • the transmitted modulated signals are received by antennas 152 a through 152 r , and the received signal from each antenna is provided to a respective receiver (RCVR) 154 .
  • Each receiver 154 conditions (e.g., filters, amplifies, and downconverts) a respective received signal and digitizes the conditioned signal to provide a respective stream of data samples, which represent the transmission symbols received via the associated antenna.
  • a demodulator (Demod) 156 receives and demodulates the N R data sample streams from receivers 154 a through 154 r to provide N R corresponding streams of received modulation symbols. For each data sample stream, demodulator 156 removes the cyclic prefix included in each transmission symbol and then transforms each received OFDM symbol to provide a corresponding stream of received modulation symbols.
  • a detector/decoder 158 initially performs the detection function that is complementary to the symbol mapping and provides soft-decision (multi-bit) symbols for the coded bits transmitted from the transmitter system.
  • the soft-decision symbols are then decoded based on one or more decoding schemes complementary to the one or more coding schemes used at the transmitter system.
  • the detection and decoding may be performed iteratively a number of times, as described in further detail below.
  • the decoded data is then provided to a data sink 160 .
  • Controllers 130 and 170 direct the operation at the transmitter and receiver systems, respectively.
  • Memories 132 and 172 provide storage for program codes and data used by controllers 130 and 170 , respectively.
  • FIG. 2A is a block diagram of a transmitter unit 200 a , which is an embodiment of the transmitter portion of transmitter system 110 in FIG. 1 .
  • Transmitter unit 200 a includes (1) a TX data processor 114 a that receives and codes traffic data in accordance with a specific coding scheme to provide coded data and (2) a modulator 116 a that modulates the coded data in accordance with a specific modulation scheme to provide modulated data.
  • TX data processor 114 a and modulator 116 a are thus one embodiment of TX data processor 114 and modulator 116 , respectively, in FIG. 1 .
  • TX data processor 114 a includes an encoder 212 , a channel interleaver 214 , and a demultiplexer (Demux) 216 .
  • Encoder 212 receives and codes the traffic data (i.e., the information bits) in accordance with the selected coding scheme to provide coded bits.
  • the coding increases the reliability of the data transmission.
  • the selected coding scheme may include any combination of cyclic redundancy check (CRC) coding, convolutional coding, Turbo coding, block coding, and so on.
  • Channel interleaver 214 then interleaves the coded bits based on a particular interleaving scheme and provides interleaved coded bits.
  • the interleaving provides time diversity for the coded bits, permits the data to be transmitted based on an average signal-to-noise-and-interference ratio (SNR) for the frequency and/or spatial subchannels used for the data transmission, combats fading, and further removes correlation between coded bits used to form each modulation symbol.
  • SNR signal-to-noise-and-interference ratio
  • the interleaving may further provide frequency diversity if the coded bits are transmitted over multiple frequency subchannels. The coding and channel interleaving are described in further detail below.
  • Demultiplexer 216 then demultiplexes the interleaved and coded data into N T coded data streams for the N T transmit antennas to be used for the data transmission.
  • the N T coded data streams are then provided to modulator 116 a.
  • modulator 116 a includes N T OFDM modulators, with each OFDM modulator assigned to process a respective coded data stream for one transmit antenna.
  • Each OFDM modulator includes a symbol mapping element 222 , an inverse fast Fourier transformer (IFFT) 224 , and a cyclic prefix generator 226 .
  • IFFT inverse fast Fourier transformer
  • all N T symbol mapping elements 222 a through 222 t implement the same modulation scheme.
  • symbol mapping element 222 maps the received coded bits to modulation symbols for the (up to) N F frequency subchannels to be used for data transmission on the transmit antenna associated with the OFDM modulator.
  • the particular modulation scheme to be implemented by symbol mapping element 222 is determined by the modulation control provided by controller 130 .
  • Symbol mapping element 222 then provides a vector of (up to) N F modulation symbols for each transmission symbol period, with the number of modulation symbols in each vector corresponding to the number of frequency subchannels to be used for data transmission for that transmission symbol period.
  • Gray mapping may be preferably used for the symbol mapping since it may provide better performance in terms of bit error rate (BER).
  • BER bit error rate
  • the neighboring points in the signal constellation (in both the horizontal and vertical directions) differ by only one out of the q bit positions. Gray mapping reduces the number of bit errors for more likely error events, which correspond to a received modulation symbol being mapped to a location near the correct location, in which case only one coded bit would be received in error.
  • each symbol mapping element 222 may be designed to implement a non-Gray mapped constellation.
  • improved performance may be achieved if the constellation is defined such that neighboring points differ by as many bit positions as possible (i.e., the opposite goal as for Gray mapping, or “anti-Gray” mapping).
  • IFFT 224 then converts each modulation symbol vector into its time-domain representation (which is referred to as an OFDM symbol) using the inverse fast Fourier transform.
  • IFFT 224 may be designed to perform the inverse transform on any number of frequency subchannels (e.g., 8, 16, 32, . . . , N F , . . . ).
  • cyclic prefix generator 226 repeats a portion of the OFDM symbol to form a corresponding transmission symbol.
  • the cyclic prefix ensures that the transmission symbol retains its orthogonal properties in the presence of multipath delay spread, thereby improving performance against deleterious path effects such as channel dispersion caused by frequency selective fading.
  • the transmission symbols from cyclic prefix generator 226 are then provided to an associated transmitter 122 and processed to generate a modulated signal, which is then transmitted from the associated antenna 124 .
  • FIG. 2B is a block diagram of a transmitter unit 200 b , which is another embodiment of the transmitter portion of transmitter system 110 in FIG. 1 .
  • a particular coding scheme is used for each of the N T transmit antennas and a particular modulation scheme is used for all N F frequency subchannels of each transmit antenna (i.e., separate coding and modulation on a per-antenna basis).
  • the specific coding and modulation schemes to be used for each transmit antenna may be selected based on the expected channel conditions (e.g., by the receiver system and sent back to the transmitter system).
  • Transmitter unit 200 b includes (1) a TX data processor 114 b that receives and codes traffic data in accordance with separate coding schemes to provide coded data and (2) a modulator 116 b that modulates the coded data in accordance with separate modulation schemes to provide modulated data.
  • TX data processor 114 b and modulator 116 b are another embodiment of TX data processor 114 and modulator 116 , respectively, in FIG. 1 .
  • TX data processor 114 b includes a demultiplexer 210 , N T encoders 212 a through 212 t , and N T channel interleavers 214 a through 214 t (i.e., one set of encoder and channel interleaver for each transmit antenna).
  • Demultiplexer 210 demultiplexes the traffic data (i.e., the information bits) into N T data streams for the N T transmit antennas to be used for the data transmission. Each data stream is then provided to a respective encoder 212 .
  • Each encoder 212 receives and codes a respective data stream based on the specific coding scheme selected for the corresponding transmit antenna to provide coded bits.
  • the coded bits from each encoder 212 are then provided to a respective channel interleaver 214 , which interleaves the coded bits based on a particular interleaving scheme to provide diversity.
  • Channel interleavers 214 a through 214 t then provide to modulator 116 b N T interleaved and coded data streams for the N T transmit antennas.
  • modulator 116 b includes N T OFDM modulators, with each OFDM modulator including symbol mapping element 222 , IFFT 224 , and cyclic prefix generator 226 .
  • the N T symbol mapping elements 222 a through 222 t may implement different modulation schemes.
  • the subsequent processing by IFFT 224 and cyclic prefix generator 226 is as described above.
  • the transmitter unit may also be implemented and are within the scope of the invention.
  • the coding and modulation may be separately performed for each subset of transmit antennas, each transmission channel, or each group of transmission channels.
  • the implementation of encoders 212 , channel interleavers 214 , symbol mapping elements 222 , IFFTs 224 , and cyclic prefix generators 226 is known in the art and not described in detail herein.
  • the encoder may implement any one of the following (1) a serial concatenated convolutional code (SCCC), (2) a parallel concatenated convolutional code (PCCC), (3) a simple convolutional code, (4) a concatenated code comprised of a block code and a convolutional code, and so on.
  • SCCC serial concatenated convolutional code
  • PCCC parallel concatenated convolutional code
  • simple convolutional code (4) a concatenated code comprised of a block code and a convolutional code, and so on.
  • Concatenated convolutional codes are also referred to as Turbo codes.
  • FIG. 3A is a block diagram of an embodiment of a serial concatenated convolutional encoder 212 x , which may be used for each of encoders 212 in FIGS. 2A and 2B .
  • Encoder 212 x includes an outer convolutional encoder 312 a , a code interleaver 314 , and an inner convolutional encoder 312 b , all coupled in series.
  • Outer convolutional encoder 312 a codes the information bits with a particular outer code of code rate R o .
  • the coded output from encoder 312 a is provided to code interleaver 314 , which interleaves each packet of N P coded bits in accordance with a particular (e.g., pseudo-random) interleaving scheme.
  • Code interleaver 314 may implement any one of a number of interleaving schemes, such as the ones used for cdma2000 and W-CDMA.
  • the N P coded bits in a packet are written, by row, into a 2 5 -row by 2 n -column array, where n is the smallest integer such that N P ⁇ 2 5+n .
  • the rows are then shuffled in accordance with a bit-reversal rule. For example, row 1 (“00001”) is swapped with row 16 (“10000”), row 3 (“00011”) is swapped with row 24 (“11000”), and so on.
  • the bits within each row are then permutated (i.e., rearranged) according to a row-specific linear congruential sequence (LCS).
  • LCS linear congruential sequence
  • the i-th bit in the row is placed in location x(i).
  • the bits in the array are then read out by column.
  • LCS code interleaving scheme is described in further detail in commonly assigned U.S. patent application Ser. No. 09/205,511, entitled “Turbo Code Interleaver Using Linear Congruential Sequences,” filed Dec. 4, 1998, and in a cdma2000 document entitled “C.S0002-A-1 Physical Layer Standard for cdma2000 Spread Spectrum Systems,” both of which are incorporated herein by reference.
  • Other code interleavers may also be used and are within the scope of the invention.
  • a random interleaver or a symmetrical-random (S-random) interleaver may also be used instead of the LCS interleaver described above.
  • Inner convolutional encoder 312 b receives and further codes the interleaved bits from code interleaver 314 with a particular inner code of code rate R i .
  • encoder 312 b implements a recursive code to fully realize the benefit of the significant interleaving gain provided by code interleaver 314 .
  • the inner code does not need to be a powerful code since the key desired property is recursiveness. In fact, the inner code may simply be a rate-1 differential code.
  • FIG. 3B is a block diagram of an embodiment of a parallel concatenated convolutional encoder 212 y , which may also be used for each of encoders 212 in FIGS. 2A and 2B .
  • Encoder 212 y includes two constituent convolutional encoder 312 c and 312 d , a code interleaver 324 , a puncturing element 326 , and a parallel-to-serial (P/S) converter 328 .
  • Code interleaver 324 interleaves the information bits in accordance with a particular (i.e., pseudo-random) interleaving scheme, and may be implemented as described above for code interleaver 314 .
  • the information bits are provided to convolutional encoder 312 c and the interleaved information bits are provided to convolutional encoder 312 d .
  • Each encoder 312 codes the received bits based on a particular constituent code and provides a respective stream of parity bits.
  • Encoders 312 c and 312 d may be implemented with two recursive systematic constituent codes with code rates of R 1 and R 2 , respectively. The recursive codes maximize the benefits provided by the interleaving gain.
  • the parity bits b y and b z from encoders 312 c and 312 d , respectively, are provided to puncturing element 326 , which punctures (i.e., deletes) zero or more of the parity bits to provide the desired number of output bits.
  • the information bits (which are also referred to as the systematic bits), and the punctured parity bits from convolutional encoders 312 c and 312 d are provided to P/S converter 328 and serialized into a coded bit stream that is provided to the next processing element.
  • FIG. 3C is a block diagram of an embodiment of a recursive convolutional encoder 312 x , which may be used for each of encoders 312 a through 312 d in FIGS. 3A and 3B .
  • Encoder 312 x may also be used for each of encoders 212 in FIGS. 2A and 2B .
  • encoder 312 x implements the following transfer function for the recursive convolutional code:
  • Encoder 312 x may also be designed to implement other convolutional codes, and this is within the scope of the invention.
  • Encoder 312 x includes a number of series-coupled delay elements 332 , a number of modulo-2 adders 334 , and a switch 336 .
  • the states of delay elements 332 are set to zeros and switch 336 is in the up position.
  • adder 334 a performs modulo-2 addition of the received bit with the output bit from adder 334 c and provides the result to delay element 332 a .
  • Adder 334 b performs modulo-2 addition of the bits from adder 334 a and delay elements 332 a and 332 c and provides the parity bit.
  • Adder 334 c performs modulo-2 addition of the bits from delay elements 332 b and 332 c.
  • switch 336 is moved to the down position and three zero (“0”) bits are provided to encoder 312 x .
  • Encoder 312 x then codes the three zero bits and provides three tail systematic bits and three tail parity bits.
  • SCCCs provide better performance than PCCCs in additive white Gaussian noise (AWGN) channels at medium to high SNR levels, which is typically the desired operating region for MIMO systems. While the BER for PCCCs asymptotically reaches an error floor, this floor is absent or much lower for SCCCs.
  • PCCCs outperform SCCCs in the high BER region, and may be more suitably used when the system loads approach the capacity limits of the channel at low SNRs.
  • Both PCCCs and SCCCs may be implemented using relatively simple constituent codes (e.g., having constraint lengths of 3 to 16), such as the one shown in FIG. 3C .
  • the coded bits from each encoder 212 are interleaved by a respective channel interleaver 214 to provide temporal, frequency, and/or spatial diversity against deleterious path effects (e.g., fading and multipath).
  • a respective channel interleaver 214 to provide temporal, frequency, and/or spatial diversity against deleterious path effects (e.g., fading and multipath).
  • the interleaving may be used to ensure that the coded bits that form each modulation symbol are not located close to each other temporally (i.e., the channel interleaving distributes the coded bits that are temporally close together in a pseudo-random manner among modulation symbols that may be transmitted over different frequency subchannels, spatial subchannels, and/or transmission symbol periods).
  • the combination of encoding, channel interleaving and symbol mapping may be viewed as a serial concatenated code, where the symbol mapper takes on the role of the inner code.
  • the channel interleaver provides interleaving gain in much the same way as in an SCCC, as described earlier. This potential for performance gain is unlocked by the iterative receiver structure described below.
  • the channel interleaving can provide improved performance for various coding and modulation schemes, such as a single common coding and modulation scheme for all transmit antennas or separate coding and modulation scheme per antenna.
  • the coded bits for each packet are written (linearly) to rows of an array.
  • the bits in each row may then be permutated (i.e., rearranged) based on (1) a bit-reversal rule, (2) a linear congruential sequence (such as the one described above for the code interleaver), (3) a randomly generated pattern, or (4) a permutation pattern generated in some other manner.
  • the rows are also permutated in accordance with a particular row permutation pattern.
  • the permutated coded bits are then retrieved from each column of the array and provided to the next processing element.
  • Other channel interleaving schemes may also be used and this is within the scope of the invention.
  • the channel interleaving is performed separately for each independently coded data stream.
  • the information bits and the tail and parity bits for each packet may also be channel interleaved separately.
  • the information bits b x , the tail and parity bits b y from the first constituent encoder 312 c , and the tail and parity bits b z from the second constituent encoder 312 d may be interleaved by three separate channel interleavers, which may employ the same or different interleaving schemes. This separate channel interleaving allows for flexible puncturing of the individual parity bits.
  • the interleaving interval may be selected to provide the desired temporal, frequency, and/or spatial diversity, or any combination thereof.
  • the coded bits for a particular time period e.g., 10 msec, 20 msec, and so on
  • the channel interleaving may be performed for each transmit antenna, or across each group of transmit antennas or across all transmit antennas to provide spatial diversity.
  • the channel interleaving may also be performed for each frequency subchannel, or across each group of frequency subchannels or across all frequency subchannels to provide frequency diversity.
  • the channel interleaving may also be performed across each group of one or more frequency subchannels of each group of one or more transmit antennas such that the coded bits from one data stream may be distributed over one or more frequency subchannels of one or more transmit antennas to provide a combination of temporal, frequency, and spatial diversity.
  • the channel interleaving may also be performed across all frequency subchannels of all transmit antennas.
  • FIG. 4A is a block diagram of an embodiment of a receiver unit 400 a , which is an embodiment of the receiver portion of receiver system 150 in FIG. 1 .
  • a single demodulation scheme is used for all N F frequency subchannels of all N T transmit antennas and a single decoding scheme is used for all transmit antennas.
  • Receiver unit 400 a may thus be used to receive a data transmission from transmitter unit 200 a in FIG. 2A .
  • the signals transmitted from the N T transmit antennas are initially received by each of N R antennas 152 a through 152 r and routed to a respective receiver 154 (which is also referred to as a front-end unit).
  • Each receiver 154 conditions (e.g., filters, amplifies, and downconverts) a respective received signal and further digitizes the conditioned signal to provide data samples.
  • Each receiver 154 may further demodulate the data samples with a recovered pilot to provide a stream of received transmission symbols, which is provided to a demodulator 156 a.
  • demodulator 156 a includes N R OFDM demodulators, with each OFDM demodulator assigned to process a respective transmission symbol stream from one receive antenna.
  • Each OFDM demodulator includes a cyclic prefix remover 412 and a fast Fourier transformer (FFT) 414 .
  • Cyclic prefix remover 412 removes the cyclic prefix previously appended to each OFDM symbol by the transmitter system to ensure ISI-free reception of the transmitted modulation symbols.
  • FFT 414 then transforms each received OFDM symbol to provide a vector of N F received modulation symbols for the N F frequency subchannels used to transmit the OFDM symbol.
  • the N R modulation symbol vectors from all N R OFDM demodulators for each transmission symbol period are provided to a detector/decoder 158 a , which is one embodiment of detector/decoder 158 in FIG. 1 .
  • detector/decoder 158 a includes a detector 420 a and a decoder 430 that perform iterative detection and decoding on the modulation symbols received from all N R receive antennas to provide decoded data.
  • the iterative detection and decoding exploits the error correction capabilities of the channel code to provide improved performance. This is achieved by iteratively passing soft “a priori” information between the soft-input soft-output (SISO) detector 420 a and the soft-input soft-output decoder 430 , as described in further detail below.
  • SISO soft-input soft-output
  • Detector 420 a receives the modulation symbols from demodulator 156 a and a priori information from decoder 430 and derives soft-decision (i.e., multi-bit) symbols for all N F frequency subchannels of all N T transmit antennas, with each such soft-decision symbol being an estimate of a coded bit transmitted by the transmitter system.
  • the soft-decision symbols may be represented as log-likelihood ratios (LLRs), which are denoted as L(b k ) in FIG. 4A .
  • Each summer 422 also receives the a priori information for its coded bit b k from decoder 430 (which is referred to as the detector a priori information and denoted as L a (b k )), and subtracts this detector a priori information from the received soft-decision symbol to derive extrinsic information for the coded bit (denoted as L e (b k )).
  • extrinsic information for all (N T ⁇ N F ⁇ q) coded bits is then (1) converted from parallel to serial by a P/S converter 424 , (2) deinterleaved by a channel deinterleaver 426 in a manner complementary to the channel interleaving performed at the transmitter system, and (3) provided as a priori information from the detector to the decoder (which is referred to as the decoder a priori information and denoted as L a D (b k )).
  • Decoder 430 uses the decoder a priori information in the decoding process and provides the decoded data. Decoder 430 further provides “a posteriori” information (denoted as L D (b k )) to a summer 432 . Summer 432 then subtracts the decoder a priori information, L a D (b k ), from the decoder a posteriori information, L D (b k ) to derive extrinsic information from the decoder for the detector (denoted as L e D (b k )).
  • This detector extrinsic information is then interleaved by a channel interleaver 434 , converted from serial to parallel by a S/P converter 436 , and provided as the detector a priori information, L a (b k ), to detector 420 a and summers 422 .
  • the output of the detection process may be expressed as:
  • the decoder a priori information, L a D (b k ) is simply the detector extrinsic information, L e (b k ), after the parallel-to-serial conversion and channel deinterleaving.
  • the detector a priori information, L a D (b k ) is simply the decoder extrinsic information, L e D (b k ), after the channel interleaving and serial-to-parallel conversion.
  • the detection and decoding process may be iterated a number of times. During the iterative detection and decoding process, the reliability of the bit decisions is improved with each iteration.
  • the iterative detection and decoding process described herein may be used to combat frequency selective fading (e.g., by using OFDM with cyclic prefix) as well as flat fading (without any modifications).
  • the iterative detection and decoding process may be flexibly used with various types of coding and modulation schemes, including the serial and parallel concatenated convolutional codes as described above.
  • detector 420 a provides soft-decision symbols for the transmitted coded bits based on the modulation symbols received from the N R receive antennas as well as the a priori information fed back from decoder 430 .
  • the soft-decision symbols may be conveniently represented in the form of log-likelihood ratios (LLRs) and include channel information, extrinsic information, and a priori information.
  • the channel information for each coded bit includes information about the channel response between the transmit and receive antennas.
  • the extrinsic information for each coded bit comprises incremental information about that coded bit that is extracted from other coded bits in the detection process.
  • the a priori information for each coded bit includes information about the coded bit that is known or derived outside the detection process.
  • the decoder a priori information should be provided by an independent source. However, since such a source is not available, an independent source may be mimicked by minimizing the correlation between the decoder a priori information (i.e., the detector output) and previous decisions made by the decoder (i.e., the detector a priori information). This is achieved by subtracting the detector a priori information from the soft-decision symbols derived by the detector, using summers 422 as shown in FIG. 4A .
  • the modulation symbol received from the output of the OFDM demodulator coupled to the m-th receive antenna for the l-th frequency subchannel at time index j may be expressed as:
  • Equation (3) may be expressed in matrix form, as follows:
  • the N F ⁇ N R received modulation symbols in r correspond to the N F ⁇ N T transmitted modulation symbols, which may be expressed as:
  • each modulation symbol is formed by a respective group of q coded bits.
  • the N F ⁇ N R received modulation symbols in r thus further correspond to the N F ⁇ N T .q transmitted coded bits, which may be expressed as:
  • b n [b n,0,1 . . . b n,0,q b n,1,1 . . . b n,1,q . . . b n,N F ⁇ 1,1 . . . b n,N F ⁇ 1,q ] T .
  • the detector computes the LLRs for each transmitted coded bit b n,l,i , as follows:
  • r ⁇ , over the probability of the coded bit b n,l,i being a ⁇ 1 given the received modulation symbols r , Pr ⁇ b n,l,i ⁇ 1
  • the probabilities for each coded bit are derived based on the received modulation symbol containing that bit and the sequence of coded bits received for r , as derived below.
  • LLRs may then be expressed as:
  • Pr ⁇ c ⁇ In the first iteration of the iterative detection and decoding process, it is assumed that all points in the signal constellation are equally likely. Hence, the term Pr ⁇ c ⁇ can be removed from the numerator and denominator of equation (10). In subsequent iterations, however, the only assumption is that the transmitted modulation symbols are independent. Furthermore, since the coded bits that make up the modulation symbols are interleaved, it is assumed that the bit probabilities are independent. Based on these assumptions, the term Pr ⁇ c ⁇ may expressed as:
  • the received modulation symbols r 1,1 , r 2,1 , . . . , r N R ,N F ⁇ 1 are conditionally independent given c .
  • c ⁇ may then be expressed as:
  • Equation (13) may further be decomposed as follows:
  • the LLR for the k-th coded bit, L(b k ), may be decomposed into two parts.
  • L a (b k ) represents the a priori information for the k-th coded bit computed by the decoder and fed back to the detector.
  • This detector a priori information is expressed in the form of a priori LLRs, which may be expressed as:
  • L e (b k ) represents the extrinsic information for the k-th coded bit computed by the detector and fed forward to the decoder.
  • the product of the a priori probabilities, ⁇ Pr ⁇ b p ⁇ , in equation (14) may be expressed as:
  • L e (b k ) the detector extrinsic information, L e (b k ), may be expressed in terms of the detector a priori LLRs, as follows:
  • L a (b k ) Since the detector a priori information, L a (b k ), is known by the decoder, it may be subtracted from L(b k ) by summers 422 in FIG. 4A such that only the detector extrinsic information, L e (b k ), is provided to the decoder.
  • the signal from transmit antenna 1 may be treated as the desired signal and the other signals from the remaining (N T ⁇ 1) transmit antennas may be treated as interference to the desired signal.
  • the (N T ⁇ 1) interferers may be nulled (or canceled).
  • the vector of N R modulation symbols, r l (which are received from the N R receive antennas for the l-th frequency subchannel) may be pre-multiplied by an (N R ⁇ N T +1) ⁇ N R nulling matrix, ⁇ l (1) , and the resulting vector ⁇ tilde over (r) ⁇ i (1) of (N R ⁇ N T +1) elements may be expressed as:
  • ⁇ tilde over (r) ⁇ (1) ⁇ 1 (1)
  • r l ⁇ l (1) H l c l + ⁇ l (1)
  • the nulling matrices, ⁇ l (n) may be determined based on algorithms known in the art.
  • the derivation of the nulling matrix, ⁇ l (1) , for transmit antenna 1 is briefly described as follows. First, the N R ⁇ (N T ⁇ 1) channel response matrix, H l (1) , for transmit antennas 2 through N T and the N R receive antennas is determined. A set of (N R ⁇ N T +1) orthonormal vectors ⁇ v 1 (1) v 2 (1) . . . v N R ⁇ N T +1 ⁇ , whose members are the rows of the nulling matrix, ⁇ l (1) , is then computed such that
  • ⁇ l (1)* is the Hermitian of ⁇ l (1) and I is the identity matrix (i.e., all ones along the diagonal and zeros elsewhere).
  • Fast algorithms are available for computing the orthonormal vectors, as is known in the art.
  • the LLRs for the coded bits from the desired transmit antenna may then be calculated in a similar manner as described above, without regard to the components from the other (N T ⁇ 1) transmit antennas.
  • the LLRs for the coded bits transmitted on all N F frequency subchannels of this transmit antenna [b 1,0,1 . . . b 1,0,q . . . b 1,1,1 . . . b 1,1,q . . . b 1,N F ⁇ 1,1 . . . b 1,N F ⁇ 1,q ].
  • ⁇ tilde over (r) ⁇ (1) [ ⁇ tilde over (r) ⁇ 0 (1)T ⁇ tilde over (r) ⁇ 1 (1)T . . . ⁇ tilde over (r) ⁇ N F ⁇ 1 (1)T ] T .
  • Equation (19) may be expressed in a form similar to equation (14), as follows:
  • Equation (20) instead of calculating (N F ⁇ N T ⁇ q) LLR values for all N T transmit antennas, only (N F ⁇ q) LLR values are calculated at a time for each of N T transmit antennas.
  • the complexity of the calculation in Eq (20) is no longer exponential in the number of transmit antennas N T since (1) each summation is performed over only the modulation symbols c n , transmitted from the desired n-th transmit antenna, and (2) the term ⁇ Pr ⁇ b p ⁇ is evaluated only for the coded bits transmitted from the n-th transmit antenna.
  • Equation (20) The product of the a priori probabilities, ⁇ Pr ⁇ b p ⁇ , in equation (20) may be expressed as:
  • L e (n) (b k ) L e (n) (b k )
  • the detection with interference nulling described above may be repeated N T times, once for each transmit antenna.
  • the (N T ⁇ 1) interferers of this desired signal may be nulled out by pre-multiplying the received modulation symbol vectors, r l , with the nulling matrix, ⁇ l (n) , derived for that transmit antenna and that frequency subchannel, as shown in equation (18).
  • the LLRs for the coded bits in the desired signal may then be computed, as shown in equations (20) and (22).
  • equation (20) or (22) may be evaluated N T times, once for each desired signal, with each evaluation providing a set of (N F ⁇ q) LLRs for the coded bits in the desired signal.
  • the dual-maxima approximation may also be used to reduce the computational complexity associated with deriving the LLRs for the coded bits.
  • the LLR for each coded bit is computed as the logarithm of the ratio of two summations.
  • Each summation is performed over a number of elements, with each such element being composed of products of exponential terms, exp( ⁇ m,l ) and exp( ⁇ n ).
  • the exponentiation in the elements of each summation enhances the differences between the individual elements of the summation. Hence, one element typically dominates each summation, and the following approximation may be made:
  • Equation (25) The approximation shown in equation (25) is often referred to as the dual-maxima approximation.
  • the dual-maxima approximation may be used to simplify the computation for the LLRs for the coded bits.
  • the logarithm of the ratio of two summations may first be decomposed as follows:
  • the dual-maxima approximation algorithm finds the maximum element in each summation (i.e., one for the numerator and another for the denominator in equation (22)) and uses these two maximum elements in the LLR calculation, as shown in equation (25).
  • FIG. 4B is a block diagram of an embodiment of a receiver unit 400 b , which is another embodiment of the receiver portion of receiver system 150 in FIG. 1 .
  • different demodulation and decoding schemes may be used for the N T transmit antennas.
  • Receiver unit 400 b may thus be used to receive a data transmission from transmitter unit 200 b in FIG. 2B , which employs separate coding and modulation schemes on a per-antenna basis.
  • the signals transmitted from the N T transmit antennas are initially received by each of N R antennas 152 a through 152 r and routed to a respective receiver 154 .
  • Each receiver 154 conditions, digitizes, and processes a respective received signal to provide a respective stream of transmission symbols.
  • the transmission symbol stream from each receiver 154 is provided to a respective OFDM demodulator 410 within a demodulator 156 b .
  • Each OFDM demodulator 410 removes the cyclic prefix appended to each OFDM symbol by the transmitter system and then transforms each received OFDM symbol to provide a vector of N F received modulation symbols for the N F frequency subchannels used to transmit the OFDM symbol.
  • the N R modulation symbol vectors from all N R OFDM demodulators 410 for each transmission symbol period are provided to a detector/decoder 158 b , which is another embodiment of detector/decoder 158 in FIG. 1 .
  • detector/decoder 158 b includes a detector 420 b and N T decoder blocks 440 , which collectively perform iterative detection and decoding on the modulation symbols received from all N R receive antennas to provide the decoded data.
  • Each decoder block 440 is assigned to process the modulation symbols transmitted from a respective transmit antenna, which may have been coded and modulated with its own specific coding and modulation schemes.
  • Detector 420 b receives the modulation symbols from demodulator 156 b and the a priori information from the N T decoders 430 a through 430 t and provides soft-decision symbols for the N T transmit antennas, with each such soft-decision symbol being an estimate of a transmitted coded bit and may be represented by the LLR, as shown in equation (22). For each transmission symbol period, detector 420 b provides N T vectors of soft-decision symbols for the N T transmit antennas to the N T decoder blocks 440 , with each vector including (N F ⁇ q n ) soft-decision symbols (where q n is dependent on the specific modulation scheme used for the n-th transmit antenna).
  • each decoder block 440 the detector a priori information for each coded bit being processed by that decoder block is subtracted from the corresponding soft-decision symbol to derive the extrinsic information for the coded bit.
  • the detector extrinsic information for all (N F ⁇ q n ) coded bits is then converted from parallel to serial by P/S converter 424 , deinterleaved by channel deinterleaver 426 , and provided as a priori information to decoder 430 .
  • Decoder 430 within each decoder block 440 uses the decoder a priori information in the decoding process and provides the decoded data for the transmit antenna assigned to and processed by the decoder block. Decoder 430 further provides the a posteriori information for the coded bits transmitted by the assigned transmit antenna.
  • a summer 432 then subtracts the decoder a priori information from the decoder a posteriori information to derive the decoder extrinsic information, which is then interleaved by channel interleaver 434 , converted from serial to parallel by S/P converter 436 , and provided as a priori information to detector 420 b and summer 422 .
  • the detection and decoding process may be iterated a number of times. During the iterative detection and decoding process, the reliability of the bit decisions is improved with each iteration.
  • FIG. 4C is a block diagram of an embodiment of a receiver unit 400 c , which is yet another embodiment of the receiver portion of receiver system 150 in FIG. 1 .
  • the detector performs successive nulling and interference cancellation to recover one transmitted signal at a time.
  • Receiver unit 400 c may be used to recover a data transmission from transmitter unit 200 b in FIG. 2B (which employs separate coding and modulation schemes on a per-antenna basis).
  • the N R received signals are initially processed by receivers 154 and further processed by demodulator 156 to provide N R modulation symbol vectors, r , for each transmission symbol period, which are then provided to a detector/decoder 158 c .
  • Detector/decoder 158 c performs iterative detection and decoding as well as successive nulling and interference cancellation.
  • detector/decoder 158 c implements a multi-stage (or multi-layer) detection scheme that includes both nulling of interferers and post-decoding interference cancellation (i.e., successive nulling and interference cancellation).
  • Detector/decoder 158 c includes a detector 420 c , N T decoder blocks 440 , and P/S converter 442 .
  • Detector 420 c includes N T detection stages (or layers), with each stage being assigned to process and recover the data for a particular transmit antenna.
  • Each stage (except for the last stage) includes an interference nuller 450 , an LLR computer 452 , and an interference canceller 460 .
  • the last stage only includes LLR computer 452 since all other transmitted signals have been nulled by this time.
  • the received modulation symbol vectors r are provided as the input vectors r (1) for interference nuller 450 a , which pre-multiplies the modulation symbol vector r l (1) for each frequency subchannel with the nulling matrix ⁇ l (1) for that frequency subchannel of the first transmit antenna to provide the vector ⁇ tilde over (r) ⁇ l (1) having the components from the other (N T ⁇ 1) transmit antennas approximately removed.
  • the pre-multiplication may be performed as shown in equation (18), which is:
  • the vectors ⁇ tilde over (r) ⁇ (1) are then provided to LLR computer 452 a , which computes the LLRs for the coded bits transmitted from the first transmit antenna, as shown in equation (22).
  • the LLRs for the (N F ⁇ q 1 ) coded bits from the first transmit antenna are then provided to decoder block 440 a , which operates on the decoder a priori information to provide the detector a priori information and the decoded bits for the first transmit antenna, as described below.
  • the detector a priori information from decoder block 440 a is provided back to LLR computer 452 a and used to compute the new decoder a priori information for the next iteration.
  • the detection and decoding for the first transmit antenna may be iterated a number of times.
  • the decoded bits from decoder block 440 a are also provided to interference canceller 460 a . Assuming that the data for the first stage has been decoded correctly, the contribution of these decoded bits on the received modulation symbols (which is denoted as î (1) is derived and subtracted from that stage's input vectors r (1) to derive the input vectors r (2) for the next stage.
  • This interference cancellation may be expressed as:
  • Each subsequent stage performs the detection and decoding in a similar manner as described above for the first stage to provide the decoded bits for the assigned transmit antenna.
  • the input vectors, r (n) for each subsequent stage contain less interference than that of the previous stage.
  • the nulling is performed by interference nuller 450 using the modulation symbols from all N R receive antennas, the diversity order increases by one from one stage to the next.
  • the last stage only the signal contribution from the last (N T -th) transmit antenna remains, if the interference cancellation was effectively performed in the preceding stages. Hence, no nulling is necessary and the iterative detection and decoding may be performed directly on that stage's input vectors r (N T ) .
  • Pre-decoding interference estimation and cancellation may also be used, and this is within the scope of the invention.
  • a hard decision may be made on the LLR outputs from the detector.
  • the hard decision may then be re-modulated and multiplied with the estimated channel response to obtain pre-decoding interference estimates (which are typically not as reliable as post-decoding interference estimates).
  • the pre-decoding interference estimates may then be canceled from the received modulation symbols.
  • Decoders 430 in FIGS. 4A and 4B may be implemented based on various designs and may be dependent on the particular coding scheme(s) used at the transmitter system.
  • each decoder 430 may be implemented as an iterative decoder (i.e., a Turbo decoder) if a Turbo code is used.
  • a Turbo decoder i.e., a Turbo decoder
  • the structures for the Turbo decoders for serial and parallel concatenated convolutional codes are described below.
  • FIG. 5A is a simplified block diagram of a Turbo decoder 430 x capable of performing iterative decoding for serial concatenated convolutional codes, such as the one shown in FIG. 3A .
  • Turbo decoder 430 x includes inner and outer maximum a posteriori (MAP) decoders 512 a and 512 b , a code deinterleaver 514 , and a code interleaver 516 .
  • MAP maximum a posteriori
  • the coded bits (or more specifically, the a priori LLRs for the decoder, L a D (b k )) are provided to inner MAP decoder 512 a , which derives the a posteriori information for the coded bits based on the inner convolutional code.
  • the a posteriori information is then subtracted by the a priori information for MAP decoder 512 a to provide extrinsic information, e k s1 , which is indicative of corrections/adjustments in the confidence of the values for the information bits.
  • the extrinsic information is then deinterleaved by code deinterleaver 514 and provided as a priori information to outer MAP decoder 512 b .
  • MAP decoder 512 a also provides the LLRs for the coded bits, which comprise the a posteriori information, L D (b k ), that is provided to summer 432 in FIGS. 4A and 4B .
  • MAP decoder 512 b receives the a priori information from MAP decoder 512 a (after the code deinterleaving) and derives the a posteriori information for the coded bits based on the outer convolutional code.
  • the a posteriori information is subtracted by the a priori information for MAP decoder 512 b to provide extrinsic information, e k s2 , which is indicative of further corrections/adjustments in the confidence of the values for the information bits.
  • the extrinsic information, e k s2 is then interleaved by code interleaver 516 and provided to inner MAP decoder 512 a.
  • the decoding by inner and outer MAP decoders 512 a and 512 b may be iterated a number of times (e.g., 8, 12, 16, or possibly more). With each iteration, greater confidence is gained for the detected values of the information bits. After all the decoding iterations have been completed, the final LLRs for the information bits are provided to a bit detector within MAP decoder 512 b and sliced to provide the decoded bits, which are hard-decision (i.e., “0” or “1”) values for the information bits.
  • MAP decoders 512 a and 512 b may be implemented with the well-known BCJR soft-input soft-output MAP algorithm or its lower complexity derivatives.
  • the soft-output Viterbi (SOV) algorithm may be implemented instead of the MAP algorithms.
  • MAP decoders and MAP algorithms are described in further detail in the aforementioned papers by Viterbi and Robertson.
  • the MAP and SOV algorithms may also be used to decode simple convolutional codes. The complexity of these algorithms is comparable to the standard Viterbi decoding algorithm, multiplied by the number of iterations.
  • FIG. 5B is a simplified block diagram of a Turbo decoder 430 y capable of performing iterative decoding for parallel concatenated convolutional codes, such as the one shown in FIG. 3B .
  • Turbo decoder 430 y includes a S/P converter 510 , two MAP decoders 512 c and 512 d , two code interleavers 524 a and 524 b , a code deinterleaver 526 , and a P/S converter 528 .
  • MAP decoder 512 c receives the a priori LLRs for the information bits, L a D (b k x ), the a priori LLRs for the first constituent encoder's parity bits, L a D (b k y ), and extrinsic information from MAP decoder 512 d , e k p2 (after deinterleaving by code deinterleaver 526 ). MAP decoder 512 c then derives the a posteriori information for the information bits based on the first constituent convolutional code.
  • This a posteriori information is then subtracted by the received a priori information to provide extrinsic information, e k p1 , which is indicative of corrections/adjustments in the confidence of the values for the information bits determined from the first constituent encoder's parity bits.
  • the extrinsic information is then interleaved by code interleaver 524 a and provided to MAP decoder 52 d.
  • MAP decoder 512 d receives the a priori LLRs for the information bits, L a D (b k x ) (after interleaving by code interleaver 524 b ), the a priori LLRs for the second constituent encoder's parity bits, L a D (b k z ), and the extrinsic information from MAP decoder 512 c , e k p1 (after interleaving by code interleaver 524 a ). MAP decoder 512 d then derives the a posteriori information for the information bits based on the second constituent convolutional code.
  • This a posteriori information is then subtracted by the received extrinsic information, e k p1 , to provide the extrinsic information, e k 2 , which is indicative of further corrections/adjustments in the confidence of the values for the information bits determined from the second constituent encoder's parity bits.
  • the extrinsic information, e k 2 is then deinterleaved by code deinterleaver 526 and provided to MAP decoder 512 c.
  • P/S converter 528 receives the first constituent encoder's parity bit LLRs from MAP decoder 512 c , the second constituent encoder's parity bit LLRs from MAP decoder 512 d , and the information bit LLRs from MAP decoder 512 d . P/S converter 528 then performs parallel-to-serial conversion of the received LLRs and provides the a posteriori information, L D (b k ), to summer 432 in FIGS. 4A and 4B .
  • MAP decoders 512 c and 512 d may also be iterated a number of times (e.g., 8, 12, 16, or possibly more). After all the decoding iterations have been completed, the final LLRs for the information bits are provided to a bit detector within MAP decoder 512 d and sliced to provide the decoded bits.
  • MAP decoders 512 c and 512 d may be implemented with the BCJR SISO MAP algorithm or its lower complexity derivatives or with the SOV algorithm.
  • the number of iterations in both the decoder and the iterative detector-decoder can be fixed or variable (i.e., adaptive).
  • the stop criterion may be triggered when (1) the BER converges or reaches an acceptable level, (2) the worse or average LLR reaches a particular confidence level, or (3) some other criterion is met.
  • FIG. 6 is a block diagram of an embodiment of an interference canceller 460 x , which may be used for each interference canceller 460 in FIG. 4C .
  • the decoded bits from the decoder block 440 for the same stage are re-encoded and channel interleaved by a TX data processor 114 x to provide re-encoded bits for the transmit antenna being processed by the stage (i.e., the assigned transmit antenna).
  • the re-encoded bits are further symbol mapped by a modulator 116 x to provide remodulated symbols, which are estimates of the modulation symbols at the transmitter prior to the OFDM processing and channel distortion.
  • TX data processor 114 x and modulator 116 x each performs the same processing (e.g., encoding, channel interleaving, and modulation) as that performed at the transmitter system for the data stream on the assigned transmit antenna.
  • the remodulated symbols are then provided to a channel simulator 612 , which processes the symbols with the estimated channel response to provide estimates of the interference due to the decoded bits.
  • channel simulator 612 For each frequency subchannel, channel simulator 612 multiples the remodulated symbols for the assigned n-th transmit antenna with a vector ⁇ n,l that includes an estimate of the channel response between the n-th transmit antenna and each of the N R receive antennas.
  • the vector ⁇ n,l is one column of the estimated channel response matrix ⁇ l for the l-th frequency subchannel.
  • the matrix ⁇ l may be determined by a channel estimator associated with the same stage and provided to channel simulator 612 .
  • the estimated interference component î l (n) due to the symbol from the n-th transmit antenna may be expressed as:
  • i ⁇ _ l ( n ) [ h ⁇ n , 1 , l ⁇ c ⁇ n , l h ⁇ n , 2 , l ⁇ c ⁇ n , l ⁇ h ⁇ n , N R , l ⁇ c ⁇ n , l ] .
  • the N R elements in the interference vector î l (n) correspond to components in the input vector r l (n) due to the modulation symbol ⁇ tilde over (c) ⁇ n,l transmitted from the n-th transmit antenna.
  • the components in the vectors î (n) are interference to the remaining (not yet detected) modulation symbols from the other transmit antennas which are also included in the input vectors î (n) .
  • the interference vectors î (n) are then subtracted from the input vectors ⁇ circumflex over (r) ⁇ (n) by a summer 614 to provide modified vectors ⁇ circumflex over (r) ⁇ (n+1) having the interference components from the decoded bits removed. This cancellation can be expressed as shown above in equation (27).
  • the modified vectors ⁇ circumflex over (r) ⁇ (n+1) are provided as the input vectors to the next processing stage, as shown in FIG. 4C .
  • a channel estimator within demodulator 156 may process the received OFDM symbols and derive estimates of one or more characteristics of the communication channel, such as the channel frequency response, the channel noise variance, the SNR of the received symbols, and so on.
  • Detector/decoder 158 may also derive and provide the status of each received packet and may further provide one or more other performance metrics indicative of the decoded results. These various types of information may be provided to controller 170 .
  • Controller 170 may determine or select a particular “rate” to be used for all transmit antennas, for each transmit antenna, for each subset of transmit antennas, for each transmission channel, or for each group of transmission channels based on the various types of information received from demodulator 156 and detector/decoder 158 .
  • the rate is indicative of a set of specific values for a set of transmission parameters.
  • the rate may indicate (or may be associated with) a specific data rate to be used for the data transmission, a specific coding scheme and/or code rate, a specific modulation scheme, and so on.
  • Channel state information in the form of the selected rate, the channel response estimates, and/or other information may be provided by controller 170 , processed by an encoder 180 , modulated by a modulator 182 , and conditioned and transmitted by one or more transmitters 154 back to transmitter system 110 .
  • CSI Channel state information
  • the one or more modulated signals from receiver system 150 are received by antennas 124 , conditioned by receivers 122 , demodulated by a demodulator 140 , and decoded by a decoder 142 to recover the channel state information transmitted by the receiver system.
  • the channel state information is then provided to controller 130 and used to control the processing of the data transmission to the receiver system.
  • the data rate of the data transmission may be determined based on the selected rate provided by the receiver system, or may be determined based on the channel response estimates provided by the receiver system.
  • the specific coding and modulation schemes associated with the selected rate are determined and reflected in the coding and modulation control provided by controller 130 to TX data processor 114 and modulator 116 .
  • the iterative detection and decoding techniques have been described specifically for serial and parallel concatenated convolutional codes. These techniques may also be used with other codes, such as convolutional codes, block codes, concatenated codes of different types (e.g., a convolutional code with a block code), and so on. Furthermore, the iterative detection and decoding techniques have been described specifically for a MIMO-OFDM system. These techniques may also be used for a MIMO system that does not implement OFDM, an OFDM system that does not utilize MIMO, or some other wireless communication systems (e.g., a wireless LAN system).
  • the iterative detection and decoding techniques may be implemented in various units in a wireless communication system, such as in a terminal, a base station, an access point, and so on.
  • the iterative detection and decoding techniques described herein may be implemented by various means. For example, these techniques may be implemented in hardware, software, or a combination thereof.
  • the elements used to perform the iterative detection and decoding e.g., detector 420 and decoder(s) 430
  • the elements used to perform the iterative detection and decoding 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, micro-controllers, microprocessors, other electronic units designed to perform the functions described herein, 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, micro-controllers, microprocessors, other electronic units designed to perform the
  • the iterative detection and decoding may be performed with modules (e.g., procedures, functions, and so on) that perform the computations and functions described herein.
  • the software codes may be stored in a memory unit (e.g., memory 172 in FIG. 1 ) and executed by a processor (e.g., controller 170 ).
  • the memory unit may be implemented within the processor or external to the processor, in which case it can be communicatively coupled to the processor via various means as is known in the art.

Abstract

Techniques to iteratively detect and decode data transmitted in a wireless (e.g., MIMO-OFDM) communication system. The iterative detection and decoding is performed by iteratively passing soft (multi-bit) “a priori” information between a detector and a decoder. The detector receives modulation symbols, performs a detection function that is complementary to the symbol mapping performed at the transmitter, and provides soft-decision symbols for transmitted coded bits. “Extrinsic information” in the soft-decision symbols is then decoded by the decoder to provide its extrinsic information, which comprises the a priori information used by the detector in the detection process. The detection and decoding may be iterated a number of times. The soft-decision symbols and the a priori information may be represented using log-likelihood ratios (LLRs). Techniques are provided to reduce the computational complexity associated with deriving the LLRs, including interference nulling to isolate each transmitted signal and “dual-maxima” approximation.

Description

    CLAIM OF PRIORITY UNDER 35 U.S.C. §119
  • The present application for patent claims priority to Provisional application Ser. No. 10/005,104 entitled “ITERATIVE DETECTION AND DECODING FOR A MIMO-OFDM SYSTEM” filed Dec. 3, 2001, and assigned to the assignee hereof and hereby expressly incorporated by reference herein.
  • BACKGROUND
  • 1. Field
  • The present invention relates generally to data communication, and more specifically to techniques for performing iterative detection and decoding for a MIMO-OFDM communication system.
  • 2. Background
  • A multiple-input multiple-output (MIMO) communication system employs multiple (NT) transmit antennas and multiple (NR) receive antennas for data transmission. A MIMO channel formed by the NT transmit and NR receive antennas may be decomposed into NS independent channels, with NS≦min {NT, NR}. Each of the NS independent channels is also referred to as a spatial subchannel of the MIMO channel and corresponds to a dimension. The MIMO system can provide improved performance (e.g., increased transmission capacity) over that of a single-input single-output (SISO) communication system if the additional dimensionalities created by the multiple transmit and receive antennas are utilized.
  • A wideband MIMO system typically experiences frequency selective fading, i.e., different amounts of attenuation across the system bandwidth. This frequency selective fading causes inter-symbol interference (ISI), which is a phenomenon whereby each symbol in a received signal acts as distortion to subsequent symbols in the received signal. This distortion degrades performance by impacting the ability to correctly detect the received symbols. As such, ISI is a non-negligible noise component that may have a large impact on the overall signal-to-noise-and-interference ratio (SNR) for systems designed to operate at high SNR levels, such as MIMO systems. In such systems, equalization may be used at the receivers to combat ISI. However, the computational complexity required to perform equalization is typically significant or prohibitive for most applications.
  • Orthogonal frequency division multiplexing (OFDM) may be used to combat ISI, and achieves this without the use of computationally intensive equalization. An OFDM system effectively partitions the system bandwidth into a number of (NF) frequency subchannels, which may be referred to as sub-bands or frequency bins. Each frequency subchannel is associated with a respective subcarrier upon which data may be modulated. The frequency subchannels of the OFDM system may experience frequency selective fading (i.e., different amounts of attenuation for different frequency subchannels), depending on the characteristics (e.g., multipath profile) of the propagation path between the transmit and receive antennas. With OFDM, the ISI due to the frequency selective fading may be combated by repeating a portion of each OFDM symbol (i.e., appending a cyclic prefix to each OFDM symbol), as is known in the art.
  • A MIMO system may thus advantageously employ OFDM to combat ISI. The frequency subchannels of the MIMO-OFDM system may experience different channel conditions (e.g., different fading and multipath effects) and may achieve different SNRs. Moreover, the channel conditions may vary over time. Consequently, the supported data rates may vary from frequency subchannel to frequency subchannel and from spatial subchannel to spatial subchannel, and may further vary with time. To achieve high performance, it is necessary to properly code and modulate the data at the transmitter (e.g., based on the determined channel conditions) and to properly detect and decode the received signals at the receiver.
  • There is therefore a need in the art for techniques to detect and decode signals that may have been (flexibly) coded and modulated based on one or more coding and modulation schemes, e.g., as determined by the channel conditions.
  • SUMMARY
  • Aspects of the invention provide techniques to iteratively detect and decode data transmitted in a wireless (e.g., MIMO-OFDM) communication system. The iterative detection and decoding exploits the error correction capabilities of the channel code to provide improved performance. This is achieved by iteratively passing soft (multi-bit) “a priori” information between a soft-input soft-output detector and a soft-input soft-output decoder.
  • The detector receives modulation symbols previously generated at a transmitter system based on one or more coding and modulation schemes, performs a detection function that is complementary to the symbol mapping performed at the transmitter system, and provides soft-decision symbols for transmitted coded bits. Extrinsic information in the soft-decision symbols (which comprises the a priori information for the decoder, as described below) is then decoded by the decoder based on one or more decoding schemes complementary to the one or more coding schemes used at the transmitter system. The decoder further provides its extrinsic information (which comprises the a priori information for the detector) that is then used by the detector in the detection process.
  • The detection and decoding may be iterated a number of times. During the iterative detection and decoding process, the reliability of the bit decisions is improved with each iteration. The iterative detection and decoding process described herein may be used to combat frequency selective fading as well as flat fading. Moreover, the iterative detection and decoding process may be flexibly used with various types of coding schemes (e.g., serial and parallel concatenated convolutional codes) and with various modulation schemes (e.g., M-PSK and M-QAM).
  • The a priori information passed between the detector and decoder and the soft-decision symbols may be represented using log-likelihood ratios (LLRs). Techniques are provided herein to reduce the computational complexity associated with deriving the LLRs. Such techniques include the use of interference nulling to isolate each transmitted signal by removing the other interferers and the use of a “dual-maxima” or some other approximation to compute the LLRs, which are described below.
  • Various aspects and embodiments of the invention are described in further detail below. The invention further provides methods, receiver units, transmitter units, receiver systems, transmitter systems, systems, and other apparatuses and elements that implement various aspects, embodiments, and features of the invention, as described in further detail below.
  • BRIEF DESCRIPTION OF THE DRAWINGS
  • The features, nature, and advantages of the present invention will become more apparent from the detailed description set forth below when taken in conjunction with the drawings in which like reference characters identify correspondingly throughout and wherein:
  • FIG. 1 is a block diagram of a transmitter system and a receiver system in a MIMO-OFDM system;
  • FIGS. 2A and 2B are block diagrams of two transmitter units that code and modulate data with (1) a single coding and modulation scheme and (2) separate coding and modulation schemes on a per-antenna basis, respectively;
  • FIGS. 3A and 3B are block diagrams of serial and parallel concatenated convolutional encoders, respectively;
  • FIG. 3C is a block diagram of a recursive convolutional encoder;
  • FIGS. 4A and 4B are block diagrams of two receiver units that detect and decode data previously processed with (1) a single coding and modulation scheme and (2) separate coding and modulation schemes on a per-antenna basis, respectively;
  • FIG. 4C is a block diagram of a receiver unit that performs successive nulling and interference cancellation to recover one transmitted signal at a time;
  • FIGS. 5A and 5B are block diagrams of two Turbo decoders capable of performing iterative decoding for serial and parallel concatenated convolutional codes, respectively; and
  • FIG. 6 is a block diagram of an interference canceller that may be used for the receiver unit in FIG. 4C.
  • DETAILED DESCRIPTION
  • The iterative detection and decoding techniques described herein may be used for various wireless communication systems. For clarity, various aspects and embodiments of the invention are described specifically for multiple-input multiple output communication system that implements orthogonal frequency division multiplexing (i.e., a MIMO-OFDM system).
  • As noted above, a MIMO system employs NT transmit antennas and NR receive antennas for data transmission, where NR≧NT. A MIMO channel formed by the NT transmit antennas and NR receive antennas may be decomposed into NS spatial subchannels, where NS≦min {NT, NR}. An OFDM system effectively partitions the system bandwidth into NF frequency subchannels. Each frequency subchannel may be defined to be sufficiently narrow so that its frequency response is considered flat or frequency non-selective. A MIMO-OFDM system may thus transmit data via a number of (NC) “transmission channels” (where NC=NS·NF), with each such transmission channel corresponding to a frequency subchannel of a spatial subchannel.
  • FIG. 1 is a block diagram of an embodiment of a transmitter system 110 and a receiver system 150 in a MIMO-OFDM system 100. Transmitter system 110 and receiver system 150 are capable of implementing various aspects and embodiments of the invention, as described below.
  • At transmitter system 110, traffic data is provided at a particular data rate from a data source 112 to a transmit (TX) data processor 114, which codes and interleaves the traffic data based on one or more coding schemes to provide coded data. The coding may be performed based on a single coding scheme for all transmit antennas, one coding scheme for each transmit antenna or each subset of transmit antennas, or one coding scheme for each transmission channel or each group of transmission channels. The data rate and the coding may be determined by a data rate control and a coding control, respectively, provided by a controller 130.
  • The coded data is then provided to a modulator 116, which may also receive pilot data (e.g., data of a known pattern and processed in a known manner). The pilot data may be multiplexed with the coded traffic data (e.g., using time division multiplexing (TDM) or code division multiplexing (CDM)) in all or a subset of the frequency subchannels and in all or a subset of the spatial subchannels used to transmit the traffic data. The pilot may be used by the receiver system to perform a number of functions such as acquisition, frequency and timing synchronization, channel estimation, coherent data demodulation, and so on.
  • In a specific embodiment, the processing by modulator 116 includes (1) modulating the received data with one or more modulation schemes (e.g., M-PSK, M-QAM, and so on) to provide modulation symbols, (2) transforming the modulation symbols to form OFDM symbols, and (3) appending a cyclic prefix to each OFDM symbol to form a corresponding transmission symbol. Similarly, the modulation may be performed based on a single modulation scheme for all transmit antennas, one modulation scheme for each transmit antenna or each subset of transmit antennas, or one modulation scheme for each transmission channel or each group of transmission channels. The modulation is performed based on a modulation control provided by controller 130. The modulated data (i.e., the transmission symbols) is then provided to transmitters (TMTR) 122 a through 122 t associated with the NT transmit antennas to be used for data transmission.
  • Each transmitter 122 converts the received modulated data into one or more analog signals and further conditions (e.g., amplifies, filters, and quadrature modulates) the analog signals to generate a modulated signal suitable for transmission over the communication channel. The modulated signals from transmitters 122 a through 122 t are then transmitted via antennas 124 a through 124 t, respectively, to the receiver system.
  • At receiver system 150, the transmitted modulated signals are received by antennas 152 a through 152 r, and the received signal from each antenna is provided to a respective receiver (RCVR) 154. Each receiver 154 conditions (e.g., filters, amplifies, and downconverts) a respective received signal and digitizes the conditioned signal to provide a respective stream of data samples, which represent the transmission symbols received via the associated antenna. A demodulator (Demod) 156 receives and demodulates the NR data sample streams from receivers 154 a through 154 r to provide NR corresponding streams of received modulation symbols. For each data sample stream, demodulator 156 removes the cyclic prefix included in each transmission symbol and then transforms each received OFDM symbol to provide a corresponding stream of received modulation symbols.
  • A detector/decoder 158 initially performs the detection function that is complementary to the symbol mapping and provides soft-decision (multi-bit) symbols for the coded bits transmitted from the transmitter system. The soft-decision symbols are then decoded based on one or more decoding schemes complementary to the one or more coding schemes used at the transmitter system. In an aspect, the detection and decoding may be performed iteratively a number of times, as described in further detail below. The decoded data is then provided to a data sink 160.
  • Controllers 130 and 170 direct the operation at the transmitter and receiver systems, respectively. Memories 132 and 172 provide storage for program codes and data used by controllers 130 and 170, respectively.
  • Transmitter System
  • FIG. 2A is a block diagram of a transmitter unit 200 a, which is an embodiment of the transmitter portion of transmitter system 110 in FIG. 1. In this embodiment, a single coding scheme is used for all NT transmit antennas and a single modulation scheme is used for all NF frequency subchannels of all transmit antennas. Transmitter unit 200 a includes (1) a TX data processor 114 a that receives and codes traffic data in accordance with a specific coding scheme to provide coded data and (2) a modulator 116 a that modulates the coded data in accordance with a specific modulation scheme to provide modulated data. TX data processor 114 a and modulator 116 a are thus one embodiment of TX data processor 114 and modulator 116, respectively, in FIG. 1.
  • In the specific embodiment shown in FIG. 2A, TX data processor 114 a includes an encoder 212, a channel interleaver 214, and a demultiplexer (Demux) 216. Encoder 212 receives and codes the traffic data (i.e., the information bits) in accordance with the selected coding scheme to provide coded bits. The coding increases the reliability of the data transmission. The selected coding scheme may include any combination of cyclic redundancy check (CRC) coding, convolutional coding, Turbo coding, block coding, and so on. Several designs for encoder 212 are described below.
  • Channel interleaver 214 then interleaves the coded bits based on a particular interleaving scheme and provides interleaved coded bits. The interleaving provides time diversity for the coded bits, permits the data to be transmitted based on an average signal-to-noise-and-interference ratio (SNR) for the frequency and/or spatial subchannels used for the data transmission, combats fading, and further removes correlation between coded bits used to form each modulation symbol. The interleaving may further provide frequency diversity if the coded bits are transmitted over multiple frequency subchannels. The coding and channel interleaving are described in further detail below.
  • Demultiplexer 216 then demultiplexes the interleaved and coded data into NT coded data streams for the NT transmit antennas to be used for the data transmission. The NT coded data streams are then provided to modulator 116 a.
  • In the specific embodiment shown in FIG. 2A, modulator 116 a includes NT OFDM modulators, with each OFDM modulator assigned to process a respective coded data stream for one transmit antenna. Each OFDM modulator includes a symbol mapping element 222, an inverse fast Fourier transformer (IFFT) 224, and a cyclic prefix generator 226. In this embodiment, all NT symbol mapping elements 222 a through 222 t implement the same modulation scheme.
  • Within each OFDM modulator, symbol mapping element 222 maps the received coded bits to modulation symbols for the (up to) NF frequency subchannels to be used for data transmission on the transmit antenna associated with the OFDM modulator. The particular modulation scheme to be implemented by symbol mapping element 222 is determined by the modulation control provided by controller 130. For OFDM, the modulation may be achieved by grouping sets of q coded bits to form non-binary symbols and mapping each non-binary symbol to a specific point in a signal constellation corresponding to the selected modulation scheme (e.g., QPSK, M-PSK, M-QAM, or some other scheme). Each mapped signal point corresponds to an M-ary modulation symbol, where M=2q. Symbol mapping element 222 then provides a vector of (up to) NF modulation symbols for each transmission symbol period, with the number of modulation symbols in each vector corresponding to the number of frequency subchannels to be used for data transmission for that transmission symbol period.
  • If conventional non-iterative symbol de-mapping and decoding are performed at the receiver system, then Gray mapping may be preferably used for the symbol mapping since it may provide better performance in terms of bit error rate (BER). With Gray mapping, the neighboring points in the signal constellation (in both the horizontal and vertical directions) differ by only one out of the q bit positions. Gray mapping reduces the number of bit errors for more likely error events, which correspond to a received modulation symbol being mapped to a location near the correct location, in which case only one coded bit would be received in error.
  • However, if iterative detection and decoding are performed as described below, it can be shown that non-Gray mapping outperforms Gray mapping. This is true due to the fact that independence between the coded bits enhances independence between the detection and decoding processes, which then provides improved performance when iterative detection and decoding are performed. Thus, each symbol mapping element 222 may be designed to implement a non-Gray mapped constellation. In certain instances, improved performance may be achieved if the constellation is defined such that neighboring points differ by as many bit positions as possible (i.e., the opposite goal as for Gray mapping, or “anti-Gray” mapping).
  • IFFT 224 then converts each modulation symbol vector into its time-domain representation (which is referred to as an OFDM symbol) using the inverse fast Fourier transform. IFFT 224 may be designed to perform the inverse transform on any number of frequency subchannels (e.g., 8, 16, 32, . . . , NF, . . . ). In an embodiment, for each OFDM symbol, cyclic prefix generator 226 repeats a portion of the OFDM symbol to form a corresponding transmission symbol. The cyclic prefix ensures that the transmission symbol retains its orthogonal properties in the presence of multipath delay spread, thereby improving performance against deleterious path effects such as channel dispersion caused by frequency selective fading. The transmission symbols from cyclic prefix generator 226 are then provided to an associated transmitter 122 and processed to generate a modulated signal, which is then transmitted from the associated antenna 124.
  • FIG. 2B is a block diagram of a transmitter unit 200 b, which is another embodiment of the transmitter portion of transmitter system 110 in FIG. 1. In this embodiment, a particular coding scheme is used for each of the NT transmit antennas and a particular modulation scheme is used for all NF frequency subchannels of each transmit antenna (i.e., separate coding and modulation on a per-antenna basis). The specific coding and modulation schemes to be used for each transmit antenna may be selected based on the expected channel conditions (e.g., by the receiver system and sent back to the transmitter system).
  • Transmitter unit 200 b includes (1) a TX data processor 114 b that receives and codes traffic data in accordance with separate coding schemes to provide coded data and (2) a modulator 116 b that modulates the coded data in accordance with separate modulation schemes to provide modulated data. TX data processor 114 b and modulator 116 b are another embodiment of TX data processor 114 and modulator 116, respectively, in FIG. 1.
  • In the specific embodiment shown in FIG. 2B, TX data processor 114 b includes a demultiplexer 210, NT encoders 212 a through 212 t, and NT channel interleavers 214 a through 214 t (i.e., one set of encoder and channel interleaver for each transmit antenna). Demultiplexer 210 demultiplexes the traffic data (i.e., the information bits) into NT data streams for the NT transmit antennas to be used for the data transmission. Each data stream is then provided to a respective encoder 212.
  • Each encoder 212 receives and codes a respective data stream based on the specific coding scheme selected for the corresponding transmit antenna to provide coded bits. The coded bits from each encoder 212 are then provided to a respective channel interleaver 214, which interleaves the coded bits based on a particular interleaving scheme to provide diversity. Channel interleavers 214 a through 214 t then provide to modulator 116 b NT interleaved and coded data streams for the NT transmit antennas.
  • In the specific embodiment shown in FIG. 2B, modulator 116 b includes NT OFDM modulators, with each OFDM modulator including symbol mapping element 222, IFFT 224, and cyclic prefix generator 226. In this embodiment, the NT symbol mapping elements 222 a through 222 t may implement different modulation schemes. Within each OFDM modulator, symbol mapping element 222 maps groups of qn coded bits to form Mn-ary modulation symbols, where Mn corresponds to the specific modulation scheme selected for the n-th transmit antenna (as determined by the modulation control provided by controller 130) and Mn=2q n . The subsequent processing by IFFT 224 and cyclic prefix generator 226 is as described above.
  • Other designs for the transmitter unit may also be implemented and are within the scope of the invention. For example, the coding and modulation may be separately performed for each subset of transmit antennas, each transmission channel, or each group of transmission channels. The implementation of encoders 212, channel interleavers 214, symbol mapping elements 222, IFFTs 224, and cyclic prefix generators 226 is known in the art and not described in detail herein.
  • The coding and modulation for MIMO systems with and without OFDM arc described in further detail in U.S. patent application Ser. Nos. 09/826,481 and 09/956,449, both entitled “Method and Apparatus for Utilizing Channel State Information in a Wireless Communication System,” respectively filed Mar. 23, 2001 and Sep. 18, 2001; U.S. patent application Ser. No. 09/854,235, entitled “Method and Apparatus for Processing Data in a Multiple-Input Multiple-Output (MIMO) Communication System Utilizing Channel State Information,” filed May 11, 2001; U.S. patent application Ser. No. 09/776,075, entitled “Coding Scheme for a Wireless Communication System,” filed Feb. 1, 2001; and U.S. patent application Ser. No. 09/993,087, entitled “Multiple-Access Multiple-Input Multiple-Output (MIMO) Communication System,” filed Nov. 6, 2001. These applications are all assigned to the assignee of the present application and incorporated herein by reference. Still other coding and modulation schemes may also be used, and this is within the scope of the invention.
  • An example OFDM system is described in U.S. patent application Ser. No. 09/532,492, entitled “High Efficiency, High Performance Communication System Employing Multi-Carrier Modulation,” filed Mar. 30, 2000, assigned to the assignee of the present invention and incorporated herein by reference. OFDM is also described by John A. C. Bingham in a paper entitled “Multicarrier Modulation for Data Transmission: An Idea Whose Time Has Come,” IEEE Communications Magazine, May 1990, which is incorporated herein by reference.
  • Encoding
  • Various types of encoder may be used to code data prior to transmission. For example, the encoder may implement any one of the following (1) a serial concatenated convolutional code (SCCC), (2) a parallel concatenated convolutional code (PCCC), (3) a simple convolutional code, (4) a concatenated code comprised of a block code and a convolutional code, and so on. Concatenated convolutional codes are also referred to as Turbo codes.
  • FIG. 3A is a block diagram of an embodiment of a serial concatenated convolutional encoder 212 x, which may be used for each of encoders 212 in FIGS. 2A and 2B. Encoder 212 x includes an outer convolutional encoder 312 a, a code interleaver 314, and an inner convolutional encoder 312 b, all coupled in series. Outer convolutional encoder 312 a codes the information bits with a particular outer code of code rate Ro. The coded output from encoder 312 a is provided to code interleaver 314, which interleaves each packet of NP coded bits in accordance with a particular (e.g., pseudo-random) interleaving scheme.
  • Code interleaver 314 may implement any one of a number of interleaving schemes, such as the ones used for cdma2000 and W-CDMA. In one specific interleaving scheme, the NP coded bits in a packet are written, by row, into a 25-row by 2n-column array, where n is the smallest integer such that NP≦25+n. The rows are then shuffled in accordance with a bit-reversal rule. For example, row 1 (“00001”) is swapped with row 16 (“10000”), row 3 (“00011”) is swapped with row 24 (“11000”), and so on. The bits within each row are then permutated (i.e., rearranged) according to a row-specific linear congruential sequence (LCS). The LCS for row k may be defined as xk(i+1)={xk(i)+ck} mod 2n, where i=0, 1, . . . 2n−1, xk(0)=ck, and ck is a specific value selected for each row and is further dependent on the value for n. For the permutation in each row, the i-th bit in the row is placed in location x(i). The bits in the array are then read out by column.
  • The LCS code interleaving scheme is described in further detail in commonly assigned U.S. patent application Ser. No. 09/205,511, entitled “Turbo Code Interleaver Using Linear Congruential Sequences,” filed Dec. 4, 1998, and in a cdma2000 document entitled “C.S0002-A-1 Physical Layer Standard for cdma2000 Spread Spectrum Systems,” both of which are incorporated herein by reference. Other code interleavers may also be used and are within the scope of the invention. For example, a random interleaver or a symmetrical-random (S-random) interleaver may also be used instead of the LCS interleaver described above.
  • Inner convolutional encoder 312 b receives and further codes the interleaved bits from code interleaver 314 with a particular inner code of code rate Ri. In an embodiment, encoder 312 b implements a recursive code to fully realize the benefit of the significant interleaving gain provided by code interleaver 314. The inner code does not need to be a powerful code since the key desired property is recursiveness. In fact, the inner code may simply be a rate-1 differential code. The overall code rate for serial concatenated convolutional encoder 212 x is RSCCC=Ro·Ri.
  • FIG. 3B is a block diagram of an embodiment of a parallel concatenated convolutional encoder 212 y, which may also be used for each of encoders 212 in FIGS. 2A and 2B. Encoder 212 y includes two constituent convolutional encoder 312 c and 312 d, a code interleaver 324, a puncturing element 326, and a parallel-to-serial (P/S) converter 328. Code interleaver 324 interleaves the information bits in accordance with a particular (i.e., pseudo-random) interleaving scheme, and may be implemented as described above for code interleaver 314.
  • As shown in FIG. 3B, the information bits are provided to convolutional encoder 312 c and the interleaved information bits are provided to convolutional encoder 312 d. Each encoder 312 codes the received bits based on a particular constituent code and provides a respective stream of parity bits. Encoders 312 c and 312 d may be implemented with two recursive systematic constituent codes with code rates of R1 and R2, respectively. The recursive codes maximize the benefits provided by the interleaving gain.
  • The parity bits by and bz from encoders 312 c and 312 d, respectively, are provided to puncturing element 326, which punctures (i.e., deletes) zero or more of the parity bits to provide the desired number of output bits. Puncturing element 326 is an optional element that may be used to adjust the overall code rate, RPCCC, of the parallel concatenated convolutional encoder, which is given by 1/RPCCC=1/R1+1/R2−1.
  • The information bits (which are also referred to as the systematic bits), and the punctured parity bits from convolutional encoders 312 c and 312 d are provided to P/S converter 328 and serialized into a coded bit stream that is provided to the next processing element.
  • FIG. 3C is a block diagram of an embodiment of a recursive convolutional encoder 312 x, which may be used for each of encoders 312 a through 312 d in FIGS. 3A and 3B. Encoder 312 x may also be used for each of encoders 212 in FIGS. 2A and 2B.
  • In the embodiment shown in FIG. 3C, encoder 312 x implements the following transfer function for the recursive convolutional code:
  • G ( D ) = [ 1 n ( D ) d ( D ) ] , where n ( D ) = 1 + D + D 3 , and d ( D ) = 1 + D 2 + D 3 .
  • Encoder 312 x may also be designed to implement other convolutional codes, and this is within the scope of the invention.
  • Encoder 312 x includes a number of series-coupled delay elements 332, a number of modulo-2 adders 334, and a switch 336. Initially, the states of delay elements 332 are set to zeros and switch 336 is in the up position. Then, for each received bit in a packet, adder 334 a performs modulo-2 addition of the received bit with the output bit from adder 334 c and provides the result to delay element 332 a. Adder 334 b performs modulo-2 addition of the bits from adder 334 a and delay elements 332 a and 332 c and provides the parity bit. Adder 334 c performs modulo-2 addition of the bits from delay elements 332 b and 332 c.
  • After all NI information bits in the packet have been coded, switch 336 is moved to the down position and three zero (“0”) bits are provided to encoder 312 x. Encoder 312 x then codes the three zero bits and provides three tail systematic bits and three tail parity bits.
  • It can be shown analytically and via computer simulations that SCCCs provide better performance than PCCCs in additive white Gaussian noise (AWGN) channels at medium to high SNR levels, which is typically the desired operating region for MIMO systems. While the BER for PCCCs asymptotically reaches an error floor, this floor is absent or much lower for SCCCs. PCCCs outperform SCCCs in the high BER region, and may be more suitably used when the system loads approach the capacity limits of the channel at low SNRs. Both PCCCs and SCCCs may be implemented using relatively simple constituent codes (e.g., having constraint lengths of 3 to 16), such as the one shown in FIG. 3C.
  • Channel Interleaving
  • Referring back to FIGS. 2A and 2B, the coded bits from each encoder 212 are interleaved by a respective channel interleaver 214 to provide temporal, frequency, and/or spatial diversity against deleterious path effects (e.g., fading and multipath). Moreover, since the coded bits are subsequently grouped together to form non-binary symbols that are then mapped to M-ary modulation symbols, the interleaving may be used to ensure that the coded bits that form each modulation symbol are not located close to each other temporally (i.e., the channel interleaving distributes the coded bits that are temporally close together in a pseudo-random manner among modulation symbols that may be transmitted over different frequency subchannels, spatial subchannels, and/or transmission symbol periods). The combination of encoding, channel interleaving and symbol mapping (especially anti-Gray mapping) may be viewed as a serial concatenated code, where the symbol mapper takes on the role of the inner code. The channel interleaver provides interleaving gain in much the same way as in an SCCC, as described earlier. This potential for performance gain is unlocked by the iterative receiver structure described below. The channel interleaving can provide improved performance for various coding and modulation schemes, such as a single common coding and modulation scheme for all transmit antennas or separate coding and modulation scheme per antenna.
  • Various interleaving schemes may be used for the channel interleaver. In one interleaving scheme, the coded bits for each packet are written (linearly) to rows of an array. The bits in each row may then be permutated (i.e., rearranged) based on (1) a bit-reversal rule, (2) a linear congruential sequence (such as the one described above for the code interleaver), (3) a randomly generated pattern, or (4) a permutation pattern generated in some other manner. The rows are also permutated in accordance with a particular row permutation pattern. The permutated coded bits are then retrieved from each column of the array and provided to the next processing element. Other channel interleaving schemes may also be used and this is within the scope of the invention.
  • In an embodiment, the channel interleaving is performed separately for each independently coded data stream. For the PCCCs, the information bits and the tail and parity bits for each packet may also be channel interleaved separately. For example, the information bits bx, the tail and parity bits by from the first constituent encoder 312 c, and the tail and parity bits bz from the second constituent encoder 312 d may be interleaved by three separate channel interleavers, which may employ the same or different interleaving schemes. This separate channel interleaving allows for flexible puncturing of the individual parity bits.
  • The interleaving interval may be selected to provide the desired temporal, frequency, and/or spatial diversity, or any combination thereof. For example, the coded bits for a particular time period (e.g., 10 msec, 20 msec, and so on) and for a particular combination of transmission channels may be interleaved. The channel interleaving may be performed for each transmit antenna, or across each group of transmit antennas or across all transmit antennas to provide spatial diversity. The channel interleaving may also be performed for each frequency subchannel, or across each group of frequency subchannels or across all frequency subchannels to provide frequency diversity. The channel interleaving may also be performed across each group of one or more frequency subchannels of each group of one or more transmit antennas such that the coded bits from one data stream may be distributed over one or more frequency subchannels of one or more transmit antennas to provide a combination of temporal, frequency, and spatial diversity. The channel interleaving may also be performed across all frequency subchannels of all transmit antennas.
  • Receiver System
  • FIG. 4A is a block diagram of an embodiment of a receiver unit 400 a, which is an embodiment of the receiver portion of receiver system 150 in FIG. 1. In this embodiment, a single demodulation scheme is used for all NF frequency subchannels of all NT transmit antennas and a single decoding scheme is used for all transmit antennas. Receiver unit 400 a may thus be used to receive a data transmission from transmitter unit 200 a in FIG. 2A.
  • The signals transmitted from the NT transmit antennas are initially received by each of NR antennas 152 a through 152 r and routed to a respective receiver 154 (which is also referred to as a front-end unit). Each receiver 154 conditions (e.g., filters, amplifies, and downconverts) a respective received signal and further digitizes the conditioned signal to provide data samples. Each receiver 154 may further demodulate the data samples with a recovered pilot to provide a stream of received transmission symbols, which is provided to a demodulator 156 a.
  • In the specific embodiment shown in FIG. 4A, demodulator 156 a includes NR OFDM demodulators, with each OFDM demodulator assigned to process a respective transmission symbol stream from one receive antenna. Each OFDM demodulator includes a cyclic prefix remover 412 and a fast Fourier transformer (FFT) 414. Cyclic prefix remover 412 removes the cyclic prefix previously appended to each OFDM symbol by the transmitter system to ensure ISI-free reception of the transmitted modulation symbols. FFT 414 then transforms each received OFDM symbol to provide a vector of NF received modulation symbols for the NF frequency subchannels used to transmit the OFDM symbol. The NR modulation symbol vectors from all NR OFDM demodulators for each transmission symbol period are provided to a detector/decoder 158 a, which is one embodiment of detector/decoder 158 in FIG. 1.
  • In the embodiment shown in FIG. 4A, detector/decoder 158 a includes a detector 420 a and a decoder 430 that perform iterative detection and decoding on the modulation symbols received from all NR receive antennas to provide decoded data. The iterative detection and decoding exploits the error correction capabilities of the channel code to provide improved performance. This is achieved by iteratively passing soft “a priori” information between the soft-input soft-output (SISO) detector 420 a and the soft-input soft-output decoder 430, as described in further detail below.
  • Detector 420 a receives the modulation symbols from demodulator 156 a and a priori information from decoder 430 and derives soft-decision (i.e., multi-bit) symbols for all NF frequency subchannels of all NT transmit antennas, with each such soft-decision symbol being an estimate of a coded bit transmitted by the transmitter system. As described in further detail below, the soft-decision symbols may be represented as log-likelihood ratios (LLRs), which are denoted as L(bk) in FIG. 4A.
  • For each transmission symbol period, detector 420 a provides up to NB soft-decision symbols to NB respective summers 422, where NB=NT·NF·q and q is dependent on the specific modulation scheme used for the data transmission. Each summer 422 also receives the a priori information for its coded bit bk from decoder 430 (which is referred to as the detector a priori information and denoted as La(bk)), and subtracts this detector a priori information from the received soft-decision symbol to derive extrinsic information for the coded bit (denoted as Le(bk)). The extrinsic information for all (NT·NF·q) coded bits is then (1) converted from parallel to serial by a P/S converter 424, (2) deinterleaved by a channel deinterleaver 426 in a manner complementary to the channel interleaving performed at the transmitter system, and (3) provided as a priori information from the detector to the decoder (which is referred to as the decoder a priori information and denoted as La D(bk)).
  • Decoder 430 uses the decoder a priori information in the decoding process and provides the decoded data. Decoder 430 further provides “a posteriori” information (denoted as LD(bk)) to a summer 432. Summer 432 then subtracts the decoder a priori information, La D(bk), from the decoder a posteriori information, LD(bk) to derive extrinsic information from the decoder for the detector (denoted as Le D(bk)). This detector extrinsic information is then interleaved by a channel interleaver 434, converted from serial to parallel by a S/P converter 436, and provided as the detector a priori information, La(bk), to detector 420 a and summers 422.
  • To briefly summarize, the output of the detection process may be expressed as:

  • L e(b k)=L(b k)−L a(b k)  Eq(1)
  • where
      • L(bk) represents the soft-decision symbol for the k-th coded bit bk;
      • La(bk) represents the detector a priori information for the k-th coded bit, which is provided by the decoder; and
      • Le(bk) represents the extrinsic information for the k-th coded bit provided by the detector to the decoder.
        The output of the decoding process may similarly be expressed as:

  • L e D(b k)=L D(b k)−L a D(b k),  Eq(2)
  • where
      • LD(bk) represents the a posteriori information for the k-th coded bit provided by the decoder;
      • La D(bk) represents the decoder a priori information for the k-th coded bit provided by the detector; and
      • Le D(bk) represents the extrinsic information for the k-th coded bit provided by the decoder to the detector.
  • As shown in FIG. 4A, the decoder a priori information, La D(bk), is simply the detector extrinsic information, Le(bk), after the parallel-to-serial conversion and channel deinterleaving. Similarly, the detector a priori information, La D(bk), is simply the decoder extrinsic information, Le D(bk), after the channel interleaving and serial-to-parallel conversion.
  • The detection and decoding process may be iterated a number of times. During the iterative detection and decoding process, the reliability of the bit decisions is improved with each iteration. The iterative detection and decoding process described herein may be used to combat frequency selective fading (e.g., by using OFDM with cyclic prefix) as well as flat fading (without any modifications). Moreover, the iterative detection and decoding process may be flexibly used with various types of coding and modulation schemes, including the serial and parallel concatenated convolutional codes as described above.
  • In FIG. 4A, detector 420 a provides soft-decision symbols for the transmitted coded bits based on the modulation symbols received from the NR receive antennas as well as the a priori information fed back from decoder 430. The soft-decision symbols may be conveniently represented in the form of log-likelihood ratios (LLRs) and include channel information, extrinsic information, and a priori information. The channel information for each coded bit includes information about the channel response between the transmit and receive antennas. The extrinsic information for each coded bit comprises incremental information about that coded bit that is extracted from other coded bits in the detection process. And the a priori information for each coded bit includes information about the coded bit that is known or derived outside the detection process.
  • In an embodiment, only the channel information and extrinsic information are passed from the detector to the decoder where, after parallel-to-serial conversion and channel deinterleaving, they are used as a priori information in the decoding process. For simplicity, the channel information and extrinsic information are collectively referred to as simply the extrinsic information. Ideally, the decoder a priori information should be provided by an independent source. However, since such a source is not available, an independent source may be mimicked by minimizing the correlation between the decoder a priori information (i.e., the detector output) and previous decisions made by the decoder (i.e., the detector a priori information). This is achieved by subtracting the detector a priori information from the soft-decision symbols derived by the detector, using summers 422 as shown in FIG. 4A.
  • LLR Computation by Detector
  • The modulation symbol received from the output of the OFDM demodulator coupled to the m-th receive antenna for the l-th frequency subchannel at time index j (i.e., transmission symbol period j) may be expressed as:
  • r m , l ( j ) = n = 1 N T h n , m , l ( j ) · c n , l ( j ) + n m , l ( j ) , Eq ( 3 )
  • where
      • hn,m,l(j) is the channel response between the n-th transmit antenna and the m-th receive antenna for the l-th frequency subchannel at time index i;
      • cn,l(j) is the modulation symbol transmitted on the l-th frequency subchannel of the n-th transmit antenna; and
      • nm,l(j) is a sample function of a zero-mean, temporally and spatially white Gaussian noise process.
        To simplify notation, the time index j is dropped in the following derivations.
  • Equation (3) may be expressed in matrix form, as follows:

  • r l =H l c l +n l, for l=0, 1, 2, . . . , NF−1,  Eq (4)
  • where
      • rl=[r1,lr2,l . . . rN R ,l]T is a vector of NR modulation symbols received from the NR receive antennas for the l-th frequency subchannel;
      • Hl is the NR×NT matrix of channel gains {hn,m,l} for the l-th frequency subchannel, where hn,m,l denotes the complex channel gain between the n-th transmit antenna and the m-th receive antenna for the l-th frequency subchannel;
      • cl=[C1,l, c2,l . . . cN T ,l]T is a vector of NT modulation symbols transmitted from the NT transmit antennas for the l-th frequency subchannel;
      • nl=[n1,l n2,l . . . nN R ,l]T is a vector of NR noise samples for the NR receive antennas for the l-th frequency subchannel; and
      • T” denotes the transposition.
  • The modulation symbols received from all NF frequency subchannels of all NR receive antennas for each time index may be expressed as:

  • r=[r 0 T r 1 T . . . r N F −1]T  Eq (5)
  • The NF·NR received modulation symbols in r correspond to the NF·NT transmitted modulation symbols, which may be expressed as:

  • c=[c 1 T c 2 T . . . c N T ]T  Eq (6)
  • As noted above, each modulation symbol is formed by a respective group of q coded bits. The NF·NR received modulation symbols in r thus further correspond to the NF·NT.q transmitted coded bits, which may be expressed as:

  • b=[b 1 T,b 2 T, . . . b N T T]T,  Eq (7)
  • where the coded bits transmitted from the n-th transmit antenna may be expressed as

  • b n =[b n,0,1 . . . b n,0,q b n,1,1 . . . b n,1,q . . . b n,N F −1,1 . . . b n,N F −1,q]T.
  • The detector computes the LLRs for each transmitted coded bit bn,l,i, as follows:
  • L ( b n , l , i ) = ln Pr { b n , l , i = + 1 r _ _ } Pr { b n , l , i = - 1 r _ _ } , for n = 1 , 2 , , N T , l = 0 , 1 , , N F - 1 , and i = 1 , 2 , , q . Eq ( 8 )
  • As shown in equation (8), the LLR for a given coded bit, L(bn,l,i), is computed as the (natural) logarithm of the ratio of the probability of the coded bit bn,l,i, being a +1 given the received modulation symbols r, Pr{bn,l,i=+1|r}, over the probability of the coded bit bn,l,i being a −1 given the received modulation symbols r, Pr{bn,l,i=−1|r}. The probabilities for each coded bit are derived based on the received modulation symbol containing that bit and the sequence of coded bits received for r, as derived below.
  • The following equalities may be expressed:
  • Pr { b n , l , i = ± 1 r _ _ } Pr { r _ _ } = b _ _ : b n , l , i = ± 1 Pr { r _ _ , b _ _ } = c _ _ : c _ _ = f ( b _ _ ) b n , l , i = ± 1 Pr { r _ _ , c _ _ } = c _ _ : c _ _ = f ( b _ _ ) b n , l , i = ± 1 Pr { r _ _ c _ _ } Pr { c _ _ } , Eq ( 9 )
  • where f(·) represents the symbol mapping from the coded bits b to the modulation symbols c. The LLRs may then be expressed as:
  • L ( b n , l , i ) = ln c _ _ : c _ _ = f ( b _ _ ) b n , l , i = + 1 Pr { r _ _ c _ _ } Pr { c _ _ } c _ _ : c _ _ = f ( b _ _ ) b n , l , i = - 1 Pr { r _ _ c _ _ } Pr { c _ _ } . Eq ( 10 )
  • In the first iteration of the iterative detection and decoding process, it is assumed that all points in the signal constellation are equally likely. Hence, the term Pr{c} can be removed from the numerator and denominator of equation (10). In subsequent iterations, however, the only assumption is that the transmitted modulation symbols are independent. Furthermore, since the coded bits that make up the modulation symbols are interleaved, it is assumed that the bit probabilities are independent. Based on these assumptions, the term Pr{c} may expressed as:
  • Pr { c _ _ } = n = 1 N T l = 0 N F - 1 i = 0 q Pr { b n , l , i } = p = 1 N T N F q Pr { b p } , Eq ( 11 )
  • where a change in notation of variables is made (i.e., p={n,l,i}) in the term to the right of the equality to simplify notation.
  • The received modulation symbols r1,1, r2,1, . . . , rN R ,N F −1 are conditionally independent given c. The term Pr{r|c} may then be expressed as:
  • Pr { r _ _ c _ _ } = m = 1 N R l = 0 N F - 1 Pr { r m , l c _ _ } = m = 1 N R l = 0 N F - 1 exp ( - 1 2 σ 2 r m , l - n = 1 N T h n , m , l · c n , l 2 ) , Eq ( 12 )
  • where σ2 is the noise spectral density given by σ2=N0/2.
  • Substituting equations (11) and (12) into equation (10), the LLR for the k-th coded bit may then be expressed as:
  • L ( b k ) = ln c _ _ : c _ _ = f ( b _ _ ) b k - + 1 [ m = 1 N R l = 0 N F - 1 exp ( - 1 2 σ 2 r m , l - n = 1 N T h n , m , l · c n , l 2 ) p = 1 N T N F q Pr { b p } ] c _ _ : c _ _ - f ( b _ _ ) b k = - 1 [ m = 1 N R l = 0 N F 1 exp ( - 1 2 σ 2 r m , l - n = 1 N T h n , m , l · c n , l 2 ) p = 1 N T N F q Pr { b p } ] , Eq ( 13 )
  • where k={n,l,i}. Equation (13) may further be decomposed as follows:
  • L ( b k ) = ln c _ _ : c _ _ = f ( b _ _ ) b k = + 1 [ m - 1 N R l - 0 N F - 1 exp ( β m , l ) p - 1 p k N T N F q Pr { b p } ] c _ _ : c _ _ = f ( b _ _ ) b k = - 1 [ m = 1 N R l = 0 N F - 1 exp ( β m , l ) p = 1 p k N T N F q Pr { b p } ] + ln Pr { b k = + 1 } Pr { b k = - 1 } , = L e ( b k ) + L a ( b k ) Eq ( 14 ) where β m , l = - 1 2 σ 2 r m , l - n = 1 N T h n , m , l · c n , l 2 .
  • As shown in equation (14), the LLR for the k-th coded bit, L(bk), may be decomposed into two parts. The term La(bk) represents the a priori information for the k-th coded bit computed by the decoder and fed back to the detector. This detector a priori information is expressed in the form of a priori LLRs, which may be expressed as:
  • L a ( b k ) = ln Pr { b k = + 1 } Pr { b k = - 1 } . Eq ( 15 )
  • The term Le(bk) represents the extrinsic information for the k-th coded bit computed by the detector and fed forward to the decoder. The product of the a priori probabilities, ΠPr{bp}, in equation (14) may be expressed as:
  • p = 1 p k N T N F q Pr { b p } = C · exp ( p = 1 p k N T N F q 1 2 b p L a ( b p ) ) = C · exp ( α ) , Eq ( 16 )
  • where C is a constant and
  • α = p = 1 , p k N T N F q 1 2 b p L a ( b p ) .
  • Hence, the detector extrinsic information, Le(bk), may be expressed in terms of the detector a priori LLRs, as follows:
  • L e ( b k ) = ln c _ _ : c = f ( b _ _ ) b k = + 1 [ m = 1 N R l = 0 N F - 1 exp ( β m , l ) exp ( p = 1 p k N T N F q 1 2 b p L a ( b p ) ) ] c _ _ : c = f ( b _ _ ) b k = - 1 [ m = 1 N R l = 0 N F - 1 exp ( β m , l ) exp ( p = 1 p k N T N F q 1 2 b p L a ( b p ) ) ] . Eq ( 17 )
  • Since the detector a priori information, La(bk), is known by the decoder, it may be subtracted from L(bk) by summers 422 in FIG. 4A such that only the detector extrinsic information, Le(bk), is provided to the decoder.
  • It can be seen from equations (13) and (17) that the computational complexity to derive the LLRs for the coded bits grows exponentially with the number of frequency subchannels (NF), the number of transmit antennas (NT), and the size of the signal constellation (2q). Several techniques may be used to reduce the computational burden to derive the coded bit LLRs. Such techniques include the use of interference nulling to isolate each transmitted signal by removing the other interferers and the use of a “dual-maxima” or some other approximation to compute the LLRs. These techniques are described in further detail below.
  • Without loss of generality, the signal from transmit antenna 1 may be treated as the desired signal and the other signals from the remaining (NT−1) transmit antennas may be treated as interference to the desired signal. With NR receive antennas, where NR≧NT, the (NT−1) interferers may be nulled (or canceled). For each of the NF frequency subchannels, the vector of NR modulation symbols, r l (which are received from the NR receive antennas for the l-th frequency subchannel) may be pre-multiplied by an (NR−NT+1)×NR nulling matrix, Θ l (1), and the resulting vector {tilde over (r)} i (1) of (NR−NT+1) elements may be expressed as:

  • {tilde over (r)} (1)=Θ 1 (1) r l=Θ l (1) H l c l +Θ l (1) n l ={tilde over (H)} l (1) c 1,l +ñ l (1), for l=0, 1, . . . , NF−1.  Eq (18)
  • As shown in equation (18), the components from transmit antennas 2, 3, . . . , NT are suppressed in the vector {tilde over (r)} (1) and only the component c1,l from desired transmit antenna 1 remains.
  • The nulling matrices, Θ l (n), may be determined based on algorithms known in the art. The derivation of the nulling matrix, Θ l (1), for transmit antenna 1 is briefly described as follows. First, the NR×(NT−1) channel response matrix, H l (1), for transmit antennas 2 through NT and the NR receive antennas is determined. A set of (NR−NT+1) orthonormal vectors {v1 (1) v2 (1) . . . vN R −N T +1}, whose members are the rows of the nulling matrix, Θ l (1), is then computed such that

  • ΘHl (1) H l (1)=0
  • where 0 is the all-zero matrix, and

  • ΘEl (1) Θ l (1)*=I
  • where Θ l (1)* is the Hermitian of Θ l (1) and I is the identity matrix (i.e., all ones along the diagonal and zeros elsewhere). Fast algorithms are available for computing the orthonormal vectors, as is known in the art. As indicated by the notation, different nulling matrices are derived for different transmit antennas and different frequency subchannels (i.e., Θ l (n) for n=1, 2, . . . , NT, and l=0, 1, . . . , NF−1).
  • Derivation of the nulling matrices for a MIMO system is described in further detail by Vahid Tarokh et al in a paper entitled “Combined Array Processing and Space-Time Coding,” IEEE Transactions on Information Theory, Vol. 45, No. 4, May 1999, which is incorporated herein by reference.
  • After nulling the interference on the desired signal due to the signals from the other (NT−1) transmit antennas, the LLRs for the coded bits from the desired transmit antenna may then be calculated in a similar manner as described above, without regard to the components from the other (NT−1) transmit antennas. For transmit antenna 1, the LLRs for the coded bits transmitted on all NF frequency subchannels of this transmit antenna, [b1,0,1 . . . b1,0,q . . . b1,1,1 . . . b1,1,q . . . b1,N F −1,1 . . . b1,N F −1,q], may be expressed as:
  • L ( b 1 , l , i ) = ln Pr { b 1 , l , i = + 1 r ~ _ _ ( 1 ) } Pr { b 1 , l , i = - 1 r ~ _ _ ( 1 ) } , for l = 0 , 1 , ... , N F - 1 , and i = 1 , 2 , ... , q , Eq ( 19 )
  • where {tilde over (r)} (1)=[{tilde over (r)} 0 (1)T {tilde over (r)} 1 (1)T . . . {tilde over (r)} N F −1 (1)T]T.
  • After the interference nulling, the LLR computation is simplified since only the desired signal from one transmit antenna is considered at a time. Equation (19) may be expressed in a form similar to equation (14), as follows:
  • L ( 1 ) ( b k ) = ln c _ 1 : c _ 1 = f ( b _ 1 ) b k = + 1 [ m = 1 N R l = 0 N F - 1 exp ( β m , l ) ( p = 1 p k N F Pr { b p } ) ] c _ 1 : c _ 1 = f ( b _ 1 ) b k = - 1 [ m = 1 N R l = 0 N F - 1 exp ( β m , l ) ( p = 1 p k N F Pr { b p } ) ] + ln Pr { b k = + 1 } Pr { b k = - 1 } , Eq ( 20 )
  • where k=1, 2, . . . , NF·q and k={m, l}.
  • As shown in equation (20), instead of calculating (NF·NT·q) LLR values for all NT transmit antennas, only (NF·q) LLR values are calculated at a time for each of NT transmit antennas. However, by performing the interference nulling, the complexity of the calculation in Eq (20) is no longer exponential in the number of transmit antennas NT since (1) each summation is performed over only the modulation symbols c n, transmitted from the desired n-th transmit antenna, and (2) the term ΠPr{bp} is evaluated only for the coded bits transmitted from the n-th transmit antenna.
  • The product of the a priori probabilities, ΠPr{bp}, in equation (20) may be expressed as:
  • p = 1 p k N F q Pr { b p } = C · exp ( p = 1 p k N F q 1 2 b p L a ( b p ) ) = C · exp ( α n ) . Eq ( 21 )
  • The detector extrinsic information, Le (n)(bk), may then be expressed in terms of the detector a priori LLRs, as follows:
  • L e ( n ) ( b k ) = ln c _ n : c _ n = f ( b _ n ) b k = + 1 [ m = 1 N R l = 0 N F - 1 exp ( β m , l ) exp ( p = 1 p k N F q 1 2 b p L a ( b p ) ) ] c _ n : c _ n = f ( b _ n ) b k = - 1 [ m = 1 N R l = 0 N F - 1 exp ( β m , l ) exp ( p = 1 p k N F q 1 2 b p L a ( b p ) ) ] . Eq ( 22 )
  • The detection with interference nulling described above may be repeated NT times, once for each transmit antenna. For each repetition to recover the desired signal from a particular transmit antenna, the (NT−1) interferers of this desired signal may be nulled out by pre-multiplying the received modulation symbol vectors, r l, with the nulling matrix, Θ l (n), derived for that transmit antenna and that frequency subchannel, as shown in equation (18). The LLRs for the coded bits in the desired signal may then be computed, as shown in equations (20) and (22). Thus, equation (20) or (22) may be evaluated NT times, once for each desired signal, with each evaluation providing a set of (NF·q) LLRs for the coded bits in the desired signal.
  • The reduced computational complexity for deriving the LLRs for the coded bits is achieved with a corresponding decrease in diversity, since the desired signal is received with a diversity of order (NR−NT+1), instead of a diversity of order NR, using equation (18).
  • The dual-maxima approximation may also be used to reduce the computational complexity associated with deriving the LLRs for the coded bits. As shown in equations (20) and (22), the LLR for each coded bit is computed as the logarithm of the ratio of two summations. Each summation is performed over a number of elements, with each such element being composed of products of exponential terms, exp(βm,l) and exp(αn). The exponentiation in the elements of each summation enhances the differences between the individual elements of the summation. Hence, one element typically dominates each summation, and the following approximation may be made:
  • ln j exp ( a j ) max j ( a j ) . Eq ( 23 )
  • For simplicity, the following may be defined:
  • L k = ln u _ : u k = + 1 exp [ M ( u _ , y _ ) ] u _ : u k = 1 exp [ M ( u _ , y _ ) ] = ln u _ : u k = + 1 exp [ M ( u _ , y _ ) ] - ln u _ : u k = - 1 exp [ M ( u _ , y _ ) ] . Eq ( 24 )
  • Applying the approximation shown in equation (23) for the sum of exponents to equation (24), the following can be expressed:
  • L k max u _ : u k = + 1 { M ( u _ , y _ ) } - max u _ : u k = - 1 { M ( u _ , y _ ) } . Eq ( 25 )
  • The approximation shown in equation (25) is often referred to as the dual-maxima approximation.
  • The dual-maxima approximation may be used to simplify the computation for the LLRs for the coded bits. Specifically, for equation (22), the logarithm of the ratio of two summations may first be decomposed as follows:
  • L e ( n ) ( b k ) = ln c _ n : c _ n = f ( b _ n ) b k = + 1 [ m = 1 N R l = 0 N F - 1 exp ( β m , l ) exp ( α n ) ] - ln c _ n : c _ n = f ( b _ n ) b k = - 1 [ m = 1 N R l = 0 N F - 1 exp ( β m , l ) exp ( α n ) ] . Eq ( 26 )
  • Next, instead of summing over the individual elements for all possible values of the coded bits for the modulation symbols c n from the n-th transmit antenna, the dual-maxima approximation algorithm finds the maximum element in each summation (i.e., one for the numerator and another for the denominator in equation (22)) and uses these two maximum elements in the LLR calculation, as shown in equation (25).
  • By using approximations based on the dual-maxima approximation, the computational complexity can be made to increase linearly in the number of coded bits per modulation symbol, q, instead of exponentially. Simulation results have shown that the performance degradation due to the use of such approximations is negligible over the range of SNRs where the use of high-order modulations is justified.
  • Other approximations and simplifications may also be used to reduce the number of complex additions and multiplications needed to compute the LLRs for the coded bits, and this is within the scope of the invention.
  • Other simplifications that may be used for computing LLRs are described by Andrew J. Viterbi in a paper entitled “An Intuitive Justification and a Simplified Implementation of the MAP Decoder for Convolutional Codes,” IEEE Journal on Selected Areas in Communications, Vol. 16, No. 2, February 1998, pp. 260-264, and by Patrick Robertson et al. in a paper entitled “A Comparison of Optimal and Sub-Optimal MAP Decoding Algorithms Operating in the Log Domain,” IEEE International Conference on Communication, 1995, pp. 1009-1012, both of which are incorporated herein by reference. These various simplification techniques typically perform computations in the log-domain, where division becomes subtraction and multiplication becomes addition.
  • FIG. 4B is a block diagram of an embodiment of a receiver unit 400 b, which is another embodiment of the receiver portion of receiver system 150 in FIG. 1. In this embodiment, different demodulation and decoding schemes may be used for the NT transmit antennas. Receiver unit 400 b may thus be used to receive a data transmission from transmitter unit 200 b in FIG. 2B, which employs separate coding and modulation schemes on a per-antenna basis.
  • The signals transmitted from the NT transmit antennas are initially received by each of NR antennas 152 a through 152 r and routed to a respective receiver 154. Each receiver 154 conditions, digitizes, and processes a respective received signal to provide a respective stream of transmission symbols. The transmission symbol stream from each receiver 154 is provided to a respective OFDM demodulator 410 within a demodulator 156 b. Each OFDM demodulator 410 removes the cyclic prefix appended to each OFDM symbol by the transmitter system and then transforms each received OFDM symbol to provide a vector of NF received modulation symbols for the NF frequency subchannels used to transmit the OFDM symbol. The NR modulation symbol vectors from all NR OFDM demodulators 410 for each transmission symbol period are provided to a detector/decoder 158 b, which is another embodiment of detector/decoder 158 in FIG. 1.
  • In the embodiment shown in FIG. 4B, detector/decoder 158 b includes a detector 420 b and NT decoder blocks 440, which collectively perform iterative detection and decoding on the modulation symbols received from all NR receive antennas to provide the decoded data. Each decoder block 440 is assigned to process the modulation symbols transmitted from a respective transmit antenna, which may have been coded and modulated with its own specific coding and modulation schemes.
  • Detector 420 b receives the modulation symbols from demodulator 156 b and the a priori information from the NT decoders 430 a through 430 t and provides soft-decision symbols for the NT transmit antennas, with each such soft-decision symbol being an estimate of a transmitted coded bit and may be represented by the LLR, as shown in equation (22). For each transmission symbol period, detector 420 b provides NT vectors of soft-decision symbols for the NT transmit antennas to the NT decoder blocks 440, with each vector including (NF·qn) soft-decision symbols (where qn is dependent on the specific modulation scheme used for the n-th transmit antenna). Within each decoder block 440, the detector a priori information for each coded bit being processed by that decoder block is subtracted from the corresponding soft-decision symbol to derive the extrinsic information for the coded bit. The detector extrinsic information for all (NF·qn) coded bits is then converted from parallel to serial by P/S converter 424, deinterleaved by channel deinterleaver 426, and provided as a priori information to decoder 430.
  • Decoder 430 within each decoder block 440 uses the decoder a priori information in the decoding process and provides the decoded data for the transmit antenna assigned to and processed by the decoder block. Decoder 430 further provides the a posteriori information for the coded bits transmitted by the assigned transmit antenna. A summer 432 then subtracts the decoder a priori information from the decoder a posteriori information to derive the decoder extrinsic information, which is then interleaved by channel interleaver 434, converted from serial to parallel by S/P converter 436, and provided as a priori information to detector 420 b and summer 422.
  • Similar to that described for FIG. 4A, the detection and decoding process may be iterated a number of times. During the iterative detection and decoding process, the reliability of the bit decisions is improved with each iteration.
  • FIG. 4C is a block diagram of an embodiment of a receiver unit 400 c, which is yet another embodiment of the receiver portion of receiver system 150 in FIG. 1. In this embodiment, the detector performs successive nulling and interference cancellation to recover one transmitted signal at a time. Receiver unit 400 c may be used to recover a data transmission from transmitter unit 200 b in FIG. 2B (which employs separate coding and modulation schemes on a per-antenna basis).
  • The NR received signals are initially processed by receivers 154 and further processed by demodulator 156 to provide NR modulation symbol vectors, r, for each transmission symbol period, which are then provided to a detector/decoder 158 c. Detector/decoder 158 c performs iterative detection and decoding as well as successive nulling and interference cancellation. In particular, detector/decoder 158 c implements a multi-stage (or multi-layer) detection scheme that includes both nulling of interferers and post-decoding interference cancellation (i.e., successive nulling and interference cancellation).
  • Detector/decoder 158 c includes a detector 420 c, NT decoder blocks 440, and P/S converter 442. Detector 420 c includes NT detection stages (or layers), with each stage being assigned to process and recover the data for a particular transmit antenna. Each stage (except for the last stage) includes an interference nuller 450, an LLR computer 452, and an interference canceller 460. The last stage only includes LLR computer 452 since all other transmitted signals have been nulled by this time.
  • Within detector 420 c, the received modulation symbol vectors r are provided as the input vectors r (1) for interference nuller 450 a, which pre-multiplies the modulation symbol vector r l (1) for each frequency subchannel with the nulling matrix Θ l (1) for that frequency subchannel of the first transmit antenna to provide the vector {tilde over (r)} l (1) having the components from the other (NT−1) transmit antennas approximately removed. The pre-multiplication may be performed as shown in equation (18), which is:

  • {tilde over (r)} l (1) =Θ l (1) r l=Θ l (1) H l c l+Θ l (1) n l.
  • Interference nuller 450 a performs NF pre-multiplications to derive NF vectors, {tilde over (r)} (1)=[{tilde over (r)} 0 (1)T {tilde over (r)} 1 (1)T . . . {tilde over (r)} N F −1 (1)T]T, for the NF frequency subchannels of the first transmit antenna.
  • The vectors {tilde over (r)} (1) are then provided to LLR computer 452 a, which computes the LLRs for the coded bits transmitted from the first transmit antenna, as shown in equation (22). The LLRs for the (NF·q1) coded bits from the first transmit antenna are then provided to decoder block 440 a, which operates on the decoder a priori information to provide the detector a priori information and the decoded bits for the first transmit antenna, as described below. The detector a priori information from decoder block 440 a is provided back to LLR computer 452 a and used to compute the new decoder a priori information for the next iteration. The detection and decoding for the first transmit antenna may be iterated a number of times.
  • The decoded bits from decoder block 440 a are also provided to interference canceller 460 a. Assuming that the data for the first stage has been decoded correctly, the contribution of these decoded bits on the received modulation symbols (which is denoted as î (1) is derived and subtracted from that stage's input vectors r (1) to derive the input vectors r (2) for the next stage. This interference cancellation may be expressed as:

  • r (2) =r (1) î (1).  Eq (27)
  • Each subsequent stage performs the detection and decoding in a similar manner as described above for the first stage to provide the decoded bits for the assigned transmit antenna. However, the input vectors, r (n), for each subsequent stage contain less interference than that of the previous stage. Also, since the nulling is performed by interference nuller 450 using the modulation symbols from all NR receive antennas, the diversity order increases by one from one stage to the next. Finally, in the last stage, only the signal contribution from the last (NT-th) transmit antenna remains, if the interference cancellation was effectively performed in the preceding stages. Hence, no nulling is necessary and the iterative detection and decoding may be performed directly on that stage's input vectors r (N T ).
  • Pre-decoding interference estimation and cancellation may also be used, and this is within the scope of the invention. In this case, a hard decision may be made on the LLR outputs from the detector. The hard decision may then be re-modulated and multiplied with the estimated channel response to obtain pre-decoding interference estimates (which are typically not as reliable as post-decoding interference estimates). The pre-decoding interference estimates may then be canceled from the received modulation symbols.
  • Decoders
  • Decoders 430 in FIGS. 4A and 4B may be implemented based on various designs and may be dependent on the particular coding scheme(s) used at the transmitter system. For example, each decoder 430 may be implemented as an iterative decoder (i.e., a Turbo decoder) if a Turbo code is used. The structures for the Turbo decoders for serial and parallel concatenated convolutional codes are described below.
  • FIG. 5A is a simplified block diagram of a Turbo decoder 430 x capable of performing iterative decoding for serial concatenated convolutional codes, such as the one shown in FIG. 3A. Turbo decoder 430 x includes inner and outer maximum a posteriori (MAP) decoders 512 a and 512 b, a code deinterleaver 514, and a code interleaver 516.
  • The coded bits (or more specifically, the a priori LLRs for the decoder, La D(bk)) are provided to inner MAP decoder 512 a, which derives the a posteriori information for the coded bits based on the inner convolutional code. The a posteriori information is then subtracted by the a priori information for MAP decoder 512 a to provide extrinsic information, ek s1, which is indicative of corrections/adjustments in the confidence of the values for the information bits. The extrinsic information is then deinterleaved by code deinterleaver 514 and provided as a priori information to outer MAP decoder 512 b. MAP decoder 512 a also provides the LLRs for the coded bits, which comprise the a posteriori information, LD(bk), that is provided to summer 432 in FIGS. 4A and 4B.
  • MAP decoder 512 b receives the a priori information from MAP decoder 512 a (after the code deinterleaving) and derives the a posteriori information for the coded bits based on the outer convolutional code. The a posteriori information is subtracted by the a priori information for MAP decoder 512 b to provide extrinsic information, ek s2, which is indicative of further corrections/adjustments in the confidence of the values for the information bits. The extrinsic information, ek s2, is then interleaved by code interleaver 516 and provided to inner MAP decoder 512 a.
  • The decoding by inner and outer MAP decoders 512 a and 512 b may be iterated a number of times (e.g., 8, 12, 16, or possibly more). With each iteration, greater confidence is gained for the detected values of the information bits. After all the decoding iterations have been completed, the final LLRs for the information bits are provided to a bit detector within MAP decoder 512 b and sliced to provide the decoded bits, which are hard-decision (i.e., “0” or “1”) values for the information bits.
  • MAP decoders 512 a and 512 b may be implemented with the well-known BCJR soft-input soft-output MAP algorithm or its lower complexity derivatives. Alternatively, the soft-output Viterbi (SOV) algorithm may be implemented instead of the MAP algorithms. MAP decoders and MAP algorithms are described in further detail in the aforementioned papers by Viterbi and Robertson. The MAP and SOV algorithms may also be used to decode simple convolutional codes. The complexity of these algorithms is comparable to the standard Viterbi decoding algorithm, multiplied by the number of iterations.
  • FIG. 5B is a simplified block diagram of a Turbo decoder 430 y capable of performing iterative decoding for parallel concatenated convolutional codes, such as the one shown in FIG. 3B. Turbo decoder 430 y includes a S/P converter 510, two MAP decoders 512 c and 512 d, two code interleavers 524 a and 524 b, a code deinterleaver 526, and a P/S converter 528.
  • The coded bits (or more specifically, the a priori LLRs for the decoder, La D(bk)) are provided to S/P converter 510, which provides the a priori LLRs for the information bits, La D(bk x), to MAP decoder 512 c and code interleaver 524 b, the a priori LLRs for the first constituent encoder's parity bits, La D(bk y), to MAP decoder 512 c, and the a priori LLRs for the second constituent encoder's parity bits, La D(bk z), to code interleaver 524 b, where La D(bk)={La D(bk x), La D(bk y), La D(bk z)}.
  • MAP decoder 512 c receives the a priori LLRs for the information bits, La D(bk x), the a priori LLRs for the first constituent encoder's parity bits, La D(bk y), and extrinsic information from MAP decoder 512 d, ek p2 (after deinterleaving by code deinterleaver 526). MAP decoder 512 c then derives the a posteriori information for the information bits based on the first constituent convolutional code. This a posteriori information is then subtracted by the received a priori information to provide extrinsic information, ek p1, which is indicative of corrections/adjustments in the confidence of the values for the information bits determined from the first constituent encoder's parity bits. The extrinsic information is then interleaved by code interleaver 524 a and provided to MAP decoder 52 d.
  • MAP decoder 512 d receives the a priori LLRs for the information bits, La D(bk x) (after interleaving by code interleaver 524 b), the a priori LLRs for the second constituent encoder's parity bits, La D(bk z), and the extrinsic information from MAP decoder 512 c, ek p1 (after interleaving by code interleaver 524 a). MAP decoder 512 d then derives the a posteriori information for the information bits based on the second constituent convolutional code. This a posteriori information is then subtracted by the received extrinsic information, ek p1, to provide the extrinsic information, ek 2, which is indicative of further corrections/adjustments in the confidence of the values for the information bits determined from the second constituent encoder's parity bits. The extrinsic information, ek 2, is then deinterleaved by code deinterleaver 526 and provided to MAP decoder 512 c.
  • P/S converter 528 receives the first constituent encoder's parity bit LLRs from MAP decoder 512 c, the second constituent encoder's parity bit LLRs from MAP decoder 512 d, and the information bit LLRs from MAP decoder 512 d. P/S converter 528 then performs parallel-to-serial conversion of the received LLRs and provides the a posteriori information, LD(bk), to summer 432 in FIGS. 4A and 4B.
  • The decoding by MAP decoders 512 c and 512 d may also be iterated a number of times (e.g., 8, 12, 16, or possibly more). After all the decoding iterations have been completed, the final LLRs for the information bits are provided to a bit detector within MAP decoder 512 d and sliced to provide the decoded bits. MAP decoders 512 c and 512 d may be implemented with the BCJR SISO MAP algorithm or its lower complexity derivatives or with the SOV algorithm.
  • In general, the number of iterations in both the decoder and the iterative detector-decoder can be fixed or variable (i.e., adaptive). In the latter case, the stop criterion may be triggered when (1) the BER converges or reaches an acceptable level, (2) the worse or average LLR reaches a particular confidence level, or (3) some other criterion is met.
  • Interference Cancellation
  • FIG. 6 is a block diagram of an embodiment of an interference canceller 460 x, which may be used for each interference canceller 460 in FIG. 4C. Within interference canceller 460 x, the decoded bits from the decoder block 440 for the same stage are re-encoded and channel interleaved by a TX data processor 114 x to provide re-encoded bits for the transmit antenna being processed by the stage (i.e., the assigned transmit antenna). The re-encoded bits are further symbol mapped by a modulator 116 x to provide remodulated symbols, which are estimates of the modulation symbols at the transmitter prior to the OFDM processing and channel distortion. TX data processor 114 x and modulator 116 x each performs the same processing (e.g., encoding, channel interleaving, and modulation) as that performed at the transmitter system for the data stream on the assigned transmit antenna. The remodulated symbols are then provided to a channel simulator 612, which processes the symbols with the estimated channel response to provide estimates of the interference due to the decoded bits.
  • For each frequency subchannel, channel simulator 612 multiples the remodulated symbols for the assigned n-th transmit antenna with a vector ĥ n,l that includes an estimate of the channel response between the n-th transmit antenna and each of the NR receive antennas. The vector ĥ n,l is one column of the estimated channel response matrix Ĥ l for the l-th frequency subchannel. The matrix Ĥ l may be determined by a channel estimator associated with the same stage and provided to channel simulator 612.
  • If the remodulated symbol corresponding to the n-th transmit antenna is expressed as {tilde over (c)}n,l, then the estimated interference component î l (n) due to the symbol from the n-th transmit antenna may be expressed as:
  • i ^ _ l ( n ) = [ h ^ n , 1 , l · c ~ n , l h ^ n , 2 , l · c ~ n , l h ^ n , N R , l · c ~ n , l ] . Eq ( 28 )
  • The NR elements in the interference vector î l (n) correspond to components in the input vector r l (n) due to the modulation symbol {tilde over (c)}n,l transmitted from the n-th transmit antenna. The interference vectors for all NF frequency subchannels may be formed as î (n)=[î 0 (n)T î l (n)T . . . î N F −1 (n)T]T. The components in the vectors î (n) are interference to the remaining (not yet detected) modulation symbols from the other transmit antennas which are also included in the input vectors î (n). The interference vectors î (n) are then subtracted from the input vectors {circumflex over (r)} (n) by a summer 614 to provide modified vectors {circumflex over (r)} (n+1) having the interference components from the decoded bits removed. This cancellation can be expressed as shown above in equation (27). The modified vectors {circumflex over (r)} (n+1) are provided as the input vectors to the next processing stage, as shown in FIG. 4C.
  • The successive cancellation receiver processing technique is described in further detail in the aforementioned U.S. patent application Ser. Nos. 09/854,235 and [Attorney Docket No. 010254], and by P. W. Wolniansky et al. in a paper entitled “V-BLAST: An Architecture for Achieving Very High Data Rates over the Rich-Scattering Wireless Channel”, Proc. ISSSE-98, Pisa, Italy, which is incorporated herein by reference.
  • Deriving and Reporting Channel State Information
  • In FIG. 1, a channel estimator within demodulator 156 may process the received OFDM symbols and derive estimates of one or more characteristics of the communication channel, such as the channel frequency response, the channel noise variance, the SNR of the received symbols, and so on. Detector/decoder 158 may also derive and provide the status of each received packet and may further provide one or more other performance metrics indicative of the decoded results. These various types of information may be provided to controller 170.
  • Controller 170 may determine or select a particular “rate” to be used for all transmit antennas, for each transmit antenna, for each subset of transmit antennas, for each transmission channel, or for each group of transmission channels based on the various types of information received from demodulator 156 and detector/decoder 158. The rate is indicative of a set of specific values for a set of transmission parameters. For example, the rate may indicate (or may be associated with) a specific data rate to be used for the data transmission, a specific coding scheme and/or code rate, a specific modulation scheme, and so on. Channel state information (CSI) in the form of the selected rate, the channel response estimates, and/or other information may be provided by controller 170, processed by an encoder 180, modulated by a modulator 182, and conditioned and transmitted by one or more transmitters 154 back to transmitter system 110. Various forms of CSI are described in the aforementioned U.S. patent application Ser. No. 09/993,087.
  • At transmitter system 110, the one or more modulated signals from receiver system 150 are received by antennas 124, conditioned by receivers 122, demodulated by a demodulator 140, and decoded by a decoder 142 to recover the channel state information transmitted by the receiver system. The channel state information is then provided to controller 130 and used to control the processing of the data transmission to the receiver system. For example, the data rate of the data transmission may be determined based on the selected rate provided by the receiver system, or may be determined based on the channel response estimates provided by the receiver system. The specific coding and modulation schemes associated with the selected rate are determined and reflected in the coding and modulation control provided by controller 130 to TX data processor 114 and modulator 116.
  • The iterative detection and decoding techniques have been described specifically for serial and parallel concatenated convolutional codes. These techniques may also be used with other codes, such as convolutional codes, block codes, concatenated codes of different types (e.g., a convolutional code with a block code), and so on. Furthermore, the iterative detection and decoding techniques have been described specifically for a MIMO-OFDM system. These techniques may also be used for a MIMO system that does not implement OFDM, an OFDM system that does not utilize MIMO, or some other wireless communication systems (e.g., a wireless LAN system).
  • The iterative detection and decoding techniques may be implemented in various units in a wireless communication system, such as in a terminal, a base station, an access point, and so on.
  • The iterative detection and decoding techniques described herein may be implemented by various means. For example, these techniques may be implemented in hardware, software, or a combination thereof. For a hardware implementation, the elements used to perform the iterative detection and decoding (e.g., detector 420 and decoder(s) 430) 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, micro-controllers, microprocessors, other electronic units designed to perform the functions described herein, or a combination thereof.
  • For a software implementation, the iterative detection and decoding may be performed with modules (e.g., procedures, functions, and so on) that perform the computations and functions described herein. The software codes may be stored in a memory unit (e.g., memory 172 in FIG. 1) and executed by a processor (e.g., controller 170). The memory unit may be implemented within the processor or external to the processor, in which case it can be communicatively coupled to the processor via various means as is known in the art.
  • The previous description of the disclosed embodiments is provided to enable any person skilled in the art to make or use the present invention. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other embodiments without departing from the spirit or scope of the invention. Thus, the present invention is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.

Claims (22)

1. A method for transmitting data in a wireless communication system, comprising:
receiving channel state information (CSI) indicative of one or more characteristics of a communication channel used for data transmission, wherein the CSI is derived at one or more receivers based on iterative detection and decoding of a plurality of modulated signals as received at the one or more receivers, iterative detection and decoding comprises:
deriving first a priori information for the coded data based on the received modulation signals and second a priori information for the coded data; and
decoding the first a priori information to derive the second a priori information, the second a priori information comprises decoded information for the coded data subtracted by the first a priori information.
2. The method of claim 1, further comprising:
interleaving the coded data based on one or more interleaving schemes, and wherein the interleaved data is modulated.
3. A transmitter in a wireless communication system, comprising:
a TX data processor that processes data based on one or more coding schemes to provide coded data, wherein the coding scheme is selected based on channel state information (CSI) derived at a receiver via iterative detection and decoding of a plurality of received modulated signals, iterative detection and decoding comprising:
deriving first a priori information for the coded data based on the received modulation signals and second a priori information for the coded data; and
decoding the first a priori information to derive the second a priori information, the second a priori information comprises decoded information for the coded data subtracted by the first a priori information.
4. The transmitter of claim 3, wherein the TX data processor interleaves the coded data based on one or more interleaving schemes, and wherein the interleaved data is modulated by a modulator to provide a plurality of modulation symbol streams.
5. The transmitter of claim 4, wherein one interleaving scheme is used for each modulation symbol stream.
6. The transmitter of claim 4, wherein one interleaving scheme is used for each group of one or more modulation symbol streams.
7. The transmitter of claim 4, wherein the coded data is interleaved over time and space.
8. The transmitter of claim 4, wherein the coded data is interleaved over time, frequency, and space.
11. The transmitter of claim 3, further comprising:
a controller that receives the CSI and selects the coding and modulation schemes based on the received CSI.
10. The transmitter of claim 4, further comprising:
a controller receives the CSI and selects the coding, interleaving, and modulation schemes based on the received CSI.
11. The transmitter of claim 3, wherein the one or more coding schemes comprise a parallel concatenated convolutional code.
12. The transmitter of claim 3, wherein the one or more coding schemes comprise a serial concatenated convolutional code.
13. The transmitter of claim 3, wherein the one or more coding schemes comprise a convolutional code.
14. The transmitter of claim 3, wherein the one or more coding schemes comprise a block code.
15. The transmitter of claim 3, wherein the one or more modulation schemes are non-Gray modulation schemes.
16. The transmitter of claim 3, wherein the one or more modulation schemes are anti-Gray modulation schemes.
17. The transmitter of claim 3, wherein a separate coding scheme and a separate modulation scheme are used for each of the plurality of modulated signals.
18. The transmitter of claim 4, wherein a separate coding scheme, a separate interleaving scheme, and a separate modulation scheme are used for each of the plurality of modulated signals.
19. The transmitter of claim 3, wherein a common coding scheme and a common modulation scheme are used for the plurality of modulated signals.
20. The transmitter of claim 4, wherein a common coding scheme, a common interleaving scheme, and a common modulation scheme are used for the plurality of modulated signals.
21. A transmitter apparatus in a wireless communication system, comprising:
means for processing data based on one or more coding schemes to provide coded data;
means for selecting the coding scheme based on channel state information (CSI) derived at a receiver via iterative detection and decoding of a plurality of received modulated signals, iterative detection and decoding comprising:
means for deriving first a priori information for the coded data based on the received modulation signals and second a priori information for the coded data; and
means for decoding the first a priori information to derive the second a priori information, the second a priori information comprises decoded information for the coded data subtracted by the first a priori information.
22. The transmitter apparatus of claim 21, further comprising:
means for interleaving the coded data based on one or more interleaving schemes to provide a plurality of coded and interleaved data streams, and wherein the interleaved data is modulated.
US12/119,253 2001-12-03 2008-05-12 Iterative detection and decoding for a mimo-ofdm system Abandoned US20080212657A1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
US12/119,253 US20080212657A1 (en) 2001-12-03 2008-05-12 Iterative detection and decoding for a mimo-ofdm system

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
US10/005,104 US7154936B2 (en) 2001-12-03 2001-12-03 Iterative detection and decoding for a MIMO-OFDM system
US11/557,662 US7372896B2 (en) 2001-12-03 2006-11-08 Iterative detection and decoding for a MIMO-OFDM system
US12/119,253 US20080212657A1 (en) 2001-12-03 2008-05-12 Iterative detection and decoding for a mimo-ofdm system

Related Parent Applications (1)

Application Number Title Priority Date Filing Date
US11/557,662 Continuation US7372896B2 (en) 2001-12-03 2006-11-08 Iterative detection and decoding for a MIMO-OFDM system

Publications (1)

Publication Number Publication Date
US20080212657A1 true US20080212657A1 (en) 2008-09-04

Family

ID=21714197

Family Applications (4)

Application Number Title Priority Date Filing Date
US10/005,104 Expired - Lifetime US7154936B2 (en) 2001-12-03 2001-12-03 Iterative detection and decoding for a MIMO-OFDM system
US11/081,260 Abandoned US20050157811A1 (en) 2001-12-03 2005-03-15 Iterative detection and decoding for a MIMO-OFDM system
US11/557,662 Expired - Lifetime US7372896B2 (en) 2001-12-03 2006-11-08 Iterative detection and decoding for a MIMO-OFDM system
US12/119,253 Abandoned US20080212657A1 (en) 2001-12-03 2008-05-12 Iterative detection and decoding for a mimo-ofdm system

Family Applications Before (3)

Application Number Title Priority Date Filing Date
US10/005,104 Expired - Lifetime US7154936B2 (en) 2001-12-03 2001-12-03 Iterative detection and decoding for a MIMO-OFDM system
US11/081,260 Abandoned US20050157811A1 (en) 2001-12-03 2005-03-15 Iterative detection and decoding for a MIMO-OFDM system
US11/557,662 Expired - Lifetime US7372896B2 (en) 2001-12-03 2006-11-08 Iterative detection and decoding for a MIMO-OFDM system

Country Status (9)

Country Link
US (4) US7154936B2 (en)
EP (2) EP1451991A2 (en)
JP (2) JP2006503446A (en)
KR (1) KR100942401B1 (en)
CN (1) CN1618222A (en)
AU (1) AU2002343608A1 (en)
BR (1) BR0214640A (en)
TW (1) TWI292271B (en)
WO (1) WO2003049397A2 (en)

Cited By (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20060233153A1 (en) * 2005-04-15 2006-10-19 Spreadtrum Communications Corporation Method and apparatus for automatic frequency correction
US20080112502A1 (en) * 2006-11-14 2008-05-15 Limberg Allen L System for digital television broadcasting using modified 2/3 trellis coding
US20090322961A1 (en) * 2008-06-27 2009-12-31 Limberg Allen Leroy System for digital television broadcasting using modified 2/3 trellis coding
US20100235710A1 (en) * 2003-09-09 2010-09-16 Ntt Docomo, Inc. Signal transmission method and transmitter in radio multiplex transmission system
WO2011013926A3 (en) * 2009-07-31 2011-06-16 Seo Hong Seok Method for processing a received signal to which channel state information is applied in an orthogonal frequency-division multiplexing system
US20110261898A1 (en) * 2008-07-07 2011-10-27 Commonwealth Scientific And Industrial Research Organisation Multiple-input multiple-output ofdm systems
US8437417B1 (en) * 2002-02-15 2013-05-07 Marvell International Ltd. Method and apparatus for performing baseband equalization in symbol modulated communications
US20140247909A1 (en) * 2011-10-05 2014-09-04 Telefonaktiebolaget L M Ericsson (Publ) Method and Device for Decoding a Transport Block of a Communication Signal
WO2017100689A1 (en) * 2015-12-10 2017-06-15 University Of Utah Research Foundation Soft-information moderation for mimo detectors
WO2018038852A1 (en) * 2016-08-26 2018-03-01 Qualcomm Incorporated Concatenated decoding methods for range extension

Families Citing this family (354)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7295509B2 (en) 2000-09-13 2007-11-13 Qualcomm, Incorporated Signaling method in an OFDM multiple access system
US9130810B2 (en) 2000-09-13 2015-09-08 Qualcomm Incorporated OFDM communications methods and apparatus
US8670390B2 (en) 2000-11-22 2014-03-11 Genghiscomm Holdings, LLC Cooperative beam-forming in wireless networks
US10355720B2 (en) 2001-04-26 2019-07-16 Genghiscomm Holdings, LLC Distributed software-defined radio
US10931338B2 (en) 2001-04-26 2021-02-23 Genghiscomm Holdings, LLC Coordinated multipoint systems
US9819449B2 (en) 2002-05-14 2017-11-14 Genghiscomm Holdings, LLC Cooperative subspace demultiplexing in content delivery networks
ATE384365T1 (en) * 2001-06-21 2008-02-15 Koninkl Philips Electronics Nv TRANSMISSION METHOD AND DEVICE IN A RADIO COMMUNICATIONS NETWORK
US7236536B2 (en) * 2001-07-26 2007-06-26 Lucent Technologies Inc. Method and apparatus for detection and decoding of signals received from a linear propagation channel
FR2828359A1 (en) * 2001-07-31 2003-02-07 Koninkl Philips Electronics Nv TRANSMITTER, RECEIVER, METHODS, PROGRAM AND SIGNAL SUITABLE FOR MODULATIONS WITH A LARGE NUMBER OF STATES
DE60206873T2 (en) * 2002-02-14 2006-06-14 Lucent Technologies Inc Receiver and method for multiple input and multiple output iterative detection by feedback of soft decisions
EP1339197A1 (en) * 2002-02-21 2003-08-27 Motorola, Inc. I/Q Mismatch compensation in an OFDM receiver in presence of frequency offset
US6959171B2 (en) * 2002-02-28 2005-10-25 Intel Corporation Data transmission rate control
JP3963737B2 (en) 2002-02-28 2007-08-22 松下電器産業株式会社 Multi-carrier signal generation method, radio transmission apparatus, and radio reception apparatus
US6801580B2 (en) * 2002-04-09 2004-10-05 Qualcomm, Incorporated Ordered successive interference cancellation receiver processing for multipath channels
EP1502439B1 (en) * 2002-04-30 2007-06-20 Koninklijke Philips Electronics N.V. Backward compatible dvb-s standard transmission system
AU2003903826A0 (en) 2003-07-24 2003-08-07 University Of South Australia An ofdm receiver structure
KR100878521B1 (en) * 2002-05-09 2009-01-13 삼성전자주식회사 Apparatus of generating the soft output of the signal which passes a channel and method thereof
US10142082B1 (en) 2002-05-14 2018-11-27 Genghiscomm Holdings, LLC Pre-coding in OFDM
US9136931B2 (en) * 2002-05-14 2015-09-15 Genghiscomm Holdings, LLC Cooperative wireless networks
US9628231B2 (en) 2002-05-14 2017-04-18 Genghiscomm Holdings, LLC Spreading and precoding in OFDM
US10644916B1 (en) 2002-05-14 2020-05-05 Genghiscomm Holdings, LLC Spreading and precoding in OFDM
US7359313B2 (en) * 2002-06-24 2008-04-15 Agere Systems Inc. Space-time bit-interleaved coded modulation for wideband transmission
US7013116B2 (en) * 2002-06-26 2006-03-14 Lucent Technologies Inc. MIMO systems having a channel decoder matched to a MIMO detector
US7133425B2 (en) * 2002-07-10 2006-11-07 Solarflare Communications, Inc. Communication system
EP1392004B1 (en) * 2002-08-22 2009-01-21 Interuniversitair Microelektronica Centrum Vzw Method for multi-user MIMO transmission and apparatuses suited therefore
US6757337B2 (en) * 2002-09-05 2004-06-29 Motorola, Inc. Coding-assisted MIMO joint detection and decoding
US7715508B2 (en) * 2005-11-15 2010-05-11 Tensorcomm, Incorporated Iterative interference cancellation using mixed feedback weights and stabilizing step sizes
FR2845227B1 (en) * 2002-10-01 2005-01-14 Telediffusion De France Tdf METHOD FOR RECEIVING A MODULE SIGNAL ACCORDING TO A MULTI-LEVEL ENCODING TECHNIQUE, DECODING METHOD, RECEIVING DEVICE, ENCODING-DECODING SYSTEM AND APPLICATIONS THEREOF
US8169944B2 (en) 2002-10-25 2012-05-01 Qualcomm Incorporated Random access for wireless multiple-access communication systems
US7986742B2 (en) 2002-10-25 2011-07-26 Qualcomm Incorporated Pilots for MIMO communication system
US20040081131A1 (en) 2002-10-25 2004-04-29 Walton Jay Rod OFDM communication system with multiple OFDM symbol sizes
US8570988B2 (en) 2002-10-25 2013-10-29 Qualcomm Incorporated Channel calibration for a time division duplexed communication system
US7002900B2 (en) 2002-10-25 2006-02-21 Qualcomm Incorporated Transmit diversity processing for a multi-antenna communication system
US8208364B2 (en) 2002-10-25 2012-06-26 Qualcomm Incorporated MIMO system with multiple spatial multiplexing modes
US8320301B2 (en) 2002-10-25 2012-11-27 Qualcomm Incorporated MIMO WLAN system
US8134976B2 (en) 2002-10-25 2012-03-13 Qualcomm Incorporated Channel calibration for a time division duplexed communication system
US7164764B2 (en) * 2002-11-07 2007-01-16 Solarflare Communications, Inc. Method and apparatus for precode crosstalk mitigation
US7386057B2 (en) * 2003-02-20 2008-06-10 Nec Corporation Iterative soft interference cancellation and filtering for spectrally efficient high-speed transmission in MIMO systems
US7042967B2 (en) * 2003-03-03 2006-05-09 Interdigital Technology Corporation Reduced complexity sliding window based equalizer
TWI260143B (en) * 2003-03-03 2006-08-11 Interdigital Tech Corp Reduced complexity sliding window based equalizer method and apparatus
CN1762118A (en) * 2003-03-14 2006-04-19 松下电器产业株式会社 OFDM reception device and OFDM reception method
US7822140B2 (en) * 2003-03-17 2010-10-26 Broadcom Corporation Multi-antenna communication systems utilizing RF-based and baseband signal weighting and combining
GB0307471D0 (en) 2003-04-01 2003-05-07 Qinetiq Ltd Signal Processing apparatus and method
US8196000B2 (en) 2003-04-02 2012-06-05 Qualcomm Incorporated Methods and apparatus for interleaving in a block-coherent communication system
US7434145B2 (en) * 2003-04-02 2008-10-07 Qualcomm Incorporated Extracting soft information in a block-coherent communication system
JP4133531B2 (en) * 2003-04-15 2008-08-13 シャープ株式会社 Wireless communication apparatus and wireless communication system
JP4077355B2 (en) * 2003-04-16 2008-04-16 三菱電機株式会社 Communication apparatus and communication method
US8363535B2 (en) 2003-04-28 2013-01-29 Marvell International Ltd. Frequency domain echo and next cancellation
US7342970B2 (en) * 2003-05-02 2008-03-11 Lucent Technologies Inc. Array processing using an aggregate channel matrix generated using a block code structure
US8064528B2 (en) 2003-05-21 2011-11-22 Regents Of The University Of Minnesota Estimating frequency-offsets and multi-antenna channels in MIMO OFDM systems
WO2005004367A2 (en) 2003-07-02 2005-01-13 Matsushita Electric Ind Co Ltd Communication apparatus and communication method
DE10334723A1 (en) 2003-07-30 2005-02-24 Bayer Materialscience Ag New binder combination for highly resistant plastic coatings
US7394858B2 (en) 2003-08-08 2008-07-01 Intel Corporation Systems and methods for adaptive bit loading in a multiple antenna orthogonal frequency division multiplexed communication system
US8908496B2 (en) 2003-09-09 2014-12-09 Qualcomm Incorporated Incremental redundancy transmission in a MIMO communication system
US7769097B2 (en) 2003-09-15 2010-08-03 Intel Corporation Methods and apparatus to control transmission of a multicarrier wireless communication channel through multiple antennas
US7724838B2 (en) * 2003-09-25 2010-05-25 Qualcomm Incorporated Hierarchical coding with multiple antennas in a wireless communication system
GB2407007B (en) * 2003-10-09 2006-06-28 Toshiba Res Europ Ltd Estimator for mimo receiver
KR100955952B1 (en) * 2003-10-13 2010-05-19 삼성전자주식회사 Method and apparatus for space-time coding using lifting low density parity check codes in a wireless communication system
US7508748B2 (en) * 2003-10-24 2009-03-24 Qualcomm Incorporated Rate selection for a multi-carrier MIMO system
US7623553B2 (en) * 2003-11-03 2009-11-24 Qualcomm Incorporated Method, apparatus, and system for data transmission and processing in a wireless communication environment
US7616698B2 (en) 2003-11-04 2009-11-10 Atheros Communications, Inc. Multiple-input multiple output system and method
KR100584439B1 (en) * 2003-11-05 2006-05-26 삼성전자주식회사 Apparatus and method for interference cancellation of ofdm system using multiple antenna
US8705659B2 (en) * 2003-11-06 2014-04-22 Apple Inc. Communication channel optimization systems and methods in multi-user communication systems
KR100520159B1 (en) * 2003-11-12 2005-10-10 삼성전자주식회사 Apparatus and method for interference cancellation of ofdm system using multiple antenna
KR100938095B1 (en) * 2003-11-19 2010-01-21 삼성전자주식회사 Apparatus and method for generating a preamble sequence in an orthogonal frequency division multiplexing communication system
JP4490922B2 (en) * 2003-11-21 2010-06-30 パナソニック株式会社 Multi-antenna transmission apparatus and multi-antenna transmission method
US7725084B2 (en) * 2003-11-24 2010-05-25 Nokia Corporation Apparatus, and associated method, for communicating communication data in a multiple-input, multiple-output communication system
US9473269B2 (en) 2003-12-01 2016-10-18 Qualcomm Incorporated Method and apparatus for providing an efficient control channel structure in a wireless communication system
US7570695B2 (en) * 2003-12-18 2009-08-04 Intel Corporation Method and adaptive bit interleaver for wideband systems using adaptive bit loading
US8027417B2 (en) 2003-12-19 2011-09-27 Nortel Networks Limited Interference-weighted communication signal processing systems and methods
KR100981580B1 (en) * 2003-12-23 2010-09-10 삼성전자주식회사 Differential Space-Time Block Codes Transceiver Apparatus For Up To 8 Transmit Antennas
US7573946B2 (en) * 2003-12-31 2009-08-11 Intel Corporation Apparatus and associated methods to perform space-frequency interleaving in a multicarrier wireless communication channel
US7308047B2 (en) * 2003-12-31 2007-12-11 Intel Corporation Symbol de-mapping methods in multiple-input multiple-output systems
US7813453B2 (en) * 2004-01-21 2010-10-12 Qualcomm Incorporated Data detection for a hierarchical coded data transmission
US7233773B2 (en) * 2004-02-13 2007-06-19 Broadcom Corporation Configuring a MIMO communication
KR20080042944A (en) * 2004-02-13 2008-05-15 닛본 덴끼 가부시끼가이샤 Radio communication system, reception device and demodulation method
US7466773B2 (en) * 2004-02-19 2008-12-16 Broadcom Corporation WLAN receiver having an iterative decoder
US7873022B2 (en) * 2004-02-19 2011-01-18 Broadcom Corporation Multiple input multiple output wireless local area network communications
CN100385824C (en) * 2004-02-20 2008-04-30 电子科技大学 Adaptive channel estimation method of MIMO-OFDM system
US20050201180A1 (en) * 2004-03-05 2005-09-15 Qualcomm Incorporated System and methods for back-off and clipping control in wireless communication systems
US8077691B2 (en) * 2004-03-05 2011-12-13 Qualcomm Incorporated Pilot transmission and channel estimation for MISO and MIMO receivers in a multi-antenna system
WO2005088853A1 (en) * 2004-03-09 2005-09-22 Neocific Inc. Methods and apparatus for random access in multi-carrier communication systems
US20050220203A1 (en) * 2004-03-31 2005-10-06 Ojard Eric J System & method for spreading on fading channels
US8160121B2 (en) * 2007-08-20 2012-04-17 Rearden, Llc System and method for distributed input-distributed output wireless communications
US10886979B2 (en) 2004-04-02 2021-01-05 Rearden, Llc System and method for link adaptation in DIDO multicarrier systems
US10187133B2 (en) 2004-04-02 2019-01-22 Rearden, Llc System and method for power control and antenna grouping in a distributed-input-distributed-output (DIDO) network
US8542763B2 (en) 2004-04-02 2013-09-24 Rearden, Llc Systems and methods to coordinate transmissions in distributed wireless systems via user clustering
US10985811B2 (en) 2004-04-02 2021-04-20 Rearden, Llc System and method for distributed antenna wireless communications
US11394436B2 (en) 2004-04-02 2022-07-19 Rearden, Llc System and method for distributed antenna wireless communications
US7636381B2 (en) * 2004-07-30 2009-12-22 Rearden, Llc System and method for distributed input-distributed output wireless communications
US8170081B2 (en) 2004-04-02 2012-05-01 Rearden, LLC. System and method for adjusting DIDO interference cancellation based on signal strength measurements
US7848442B2 (en) * 2004-04-02 2010-12-07 Lg Electronics Inc. Signal processing apparatus and method in multi-input/multi-output communications systems
US10425134B2 (en) 2004-04-02 2019-09-24 Rearden, Llc System and methods for planned evolution and obsolescence of multiuser spectrum
US10200094B2 (en) 2004-04-02 2019-02-05 Rearden, Llc Interference management, handoff, power control and link adaptation in distributed-input distributed-output (DIDO) communication systems
US7711030B2 (en) * 2004-07-30 2010-05-04 Rearden, Llc System and method for spatial-multiplexed tropospheric scatter communications
US10277290B2 (en) 2004-04-02 2019-04-30 Rearden, Llc Systems and methods to exploit areas of coherence in wireless systems
US7885354B2 (en) * 2004-04-02 2011-02-08 Rearden, Llc System and method for enhancing near vertical incidence skywave (“NVIS”) communication using space-time coding
US9312929B2 (en) 2004-04-02 2016-04-12 Rearden, Llc System and methods to compensate for Doppler effects in multi-user (MU) multiple antenna systems (MAS)
US7599420B2 (en) * 2004-07-30 2009-10-06 Rearden, Llc System and method for distributed input distributed output wireless communications
US7633994B2 (en) 2004-07-30 2009-12-15 Rearden, LLC. System and method for distributed input-distributed output wireless communications
US9819403B2 (en) 2004-04-02 2017-11-14 Rearden, Llc System and method for managing handoff of a client between different distributed-input-distributed-output (DIDO) networks based on detected velocity of the client
US11451275B2 (en) 2004-04-02 2022-09-20 Rearden, Llc System and method for distributed antenna wireless communications
US11309943B2 (en) 2004-04-02 2022-04-19 Rearden, Llc System and methods for planned evolution and obsolescence of multiuser spectrum
US8654815B1 (en) 2004-04-02 2014-02-18 Rearden, Llc System and method for distributed antenna wireless communications
US10749582B2 (en) 2004-04-02 2020-08-18 Rearden, Llc Systems and methods to coordinate transmissions in distributed wireless systems via user clustering
US9826537B2 (en) 2004-04-02 2017-11-21 Rearden, Llc System and method for managing inter-cluster handoff of clients which traverse multiple DIDO clusters
US8571086B2 (en) * 2004-04-02 2013-10-29 Rearden, Llc System and method for DIDO precoding interpolation in multicarrier systems
CN100583678C (en) * 2004-04-07 2010-01-20 Lg电子株式会社 Signal processing device and method of MIMO communication system
KR100919531B1 (en) * 2004-05-26 2009-10-01 닛본 덴끼 가부시끼가이샤 Spatially-multiplexed signal detecting method and time space iterative decoder using same
KR20060046335A (en) * 2004-06-01 2006-05-17 삼성전자주식회사 Method and apparatus for channel state feedback using arithmetic coding
GB2415336B (en) * 2004-06-18 2006-11-08 Toshiba Res Europ Ltd Bit interleaver for a mimo system
US9271221B2 (en) * 2004-06-22 2016-02-23 Apple Inc. Closed loop MIMO systems and methods
US20050289537A1 (en) * 2004-06-29 2005-12-29 Lee Sam J System and method for installing software on a computing device
KR101148405B1 (en) * 2004-07-01 2012-05-21 콸콤 인코포레이티드 Advanced mimo interleaving
KR20060006542A (en) * 2004-07-16 2006-01-19 삼성전자주식회사 Mimo transmitter for wlan system at the base of ofdm and methods thereof
US8457152B2 (en) * 2004-07-16 2013-06-04 Qualcomm Incorporated Multiple modulation schemes in single rate layering wireless communication systems
US9137822B2 (en) 2004-07-21 2015-09-15 Qualcomm Incorporated Efficient signaling over access channel
US9148256B2 (en) 2004-07-21 2015-09-29 Qualcomm Incorporated Performance based rank prediction for MIMO design
US8391410B2 (en) 2004-07-29 2013-03-05 Qualcomm Incorporated Methods and apparatus for configuring a pilot symbol in a wireless communication system
US20070081484A1 (en) * 2004-07-29 2007-04-12 Wang Michael M Methods and apparatus for transmitting a frame structure in a wireless communication system
US9246728B2 (en) 2004-07-29 2016-01-26 Qualcomm Incorporated System and method for frequency diversity
CN101036336B (en) * 2004-07-29 2012-12-26 高通股份有限公司 Interlacing system and method
GB2416967B (en) * 2004-07-29 2007-01-31 Toshiba Res Europ Ltd Turbo equalization in a MIMO digital wireless wideband system
US20080317142A1 (en) * 2005-07-29 2008-12-25 Qualcomm Incorporated System and method for frequency diversity
US9685997B2 (en) 2007-08-20 2017-06-20 Rearden, Llc Systems and methods to enhance spatial diversity in distributed-input distributed-output wireless systems
US11431386B1 (en) 2004-08-02 2022-08-30 Genghiscomm Holdings, LLC Transmit pre-coding
US11184037B1 (en) 2004-08-02 2021-11-23 Genghiscomm Holdings, LLC Demodulating and decoding carrier interferometry signals
US11552737B1 (en) 2004-08-02 2023-01-10 Genghiscomm Holdings, LLC Cooperative MIMO
ES2339788T3 (en) 2004-08-12 2010-05-25 Interdigital Technology Corporation METHOD AND APPARATUS FOR IMPLEMENTING THE CODIFICATION OF THE SPACE FREQUENCY BLOCK IN A WIRELESS COMMUNICATION SYSTEM FOR MULTIPLEXATION DIVISION IN ORTOGONAL FREQUENCIES.
US8527855B2 (en) * 2004-08-16 2013-09-03 Koninklijke Philips N.V. Interleaving and parsing for MIMO-OFDM systems
JP2006067070A (en) * 2004-08-25 2006-03-09 Fujitsu Ltd Mimo system receiving method and receiver
US8130855B2 (en) 2004-11-12 2012-03-06 Interdigital Technology Corporation Method and apparatus for combining space-frequency block coding, spatial multiplexing and beamforming in a MIMO-OFDM system
US7570698B2 (en) * 2004-11-16 2009-08-04 Intel Corporation Multiple output multicarrier transmitter and methods for spatial interleaving a plurality of spatial streams
EP1659727B1 (en) 2004-11-19 2015-03-25 ATI International SRL Iterative decoding of packet data
GB2420951B (en) * 2004-12-02 2007-06-06 Toshiba Res Europ Ltd Decoder for a multiplexed transmission system
KR100677542B1 (en) * 2004-12-24 2007-02-02 삼성전자주식회사 Control method of multi-input multi-output system through single serial interface, and apparatus thereof
US7558335B2 (en) * 2005-02-10 2009-07-07 Interdigital Technology Corporation Communication system modulating/demodulating data using antenna patterns and associated methods
US7333421B2 (en) * 2005-02-22 2008-02-19 Interdigitial Technology Corporation OFDM-MIMO communication system using smart spatial symbol mapping and associated methods
US9246560B2 (en) 2005-03-10 2016-01-26 Qualcomm Incorporated Systems and methods for beamforming and rate control in a multi-input multi-output communication systems
US9154211B2 (en) 2005-03-11 2015-10-06 Qualcomm Incorporated Systems and methods for beamforming feedback in multi antenna communication systems
CA2601151A1 (en) * 2005-03-14 2006-09-21 Telcordia Technologies, Inc. Iterative stbicm mimo receiver using group-wise demapping
US8446892B2 (en) 2005-03-16 2013-05-21 Qualcomm Incorporated Channel structures for a quasi-orthogonal multiple-access communication system
US9461859B2 (en) 2005-03-17 2016-10-04 Qualcomm Incorporated Pilot signal transmission for an orthogonal frequency division wireless communication system
US9143305B2 (en) 2005-03-17 2015-09-22 Qualcomm Incorporated Pilot signal transmission for an orthogonal frequency division wireless communication system
US9520972B2 (en) 2005-03-17 2016-12-13 Qualcomm Incorporated Pilot signal transmission for an orthogonal frequency division wireless communication system
US7688979B2 (en) * 2005-03-21 2010-03-30 Interdigital Technology Corporation MIMO air interface utilizing dirty paper coding
US7539463B2 (en) * 2005-03-30 2009-05-26 Intel Corporation Techniques to enhance diversity for a wireless system
JP4884722B2 (en) * 2005-03-31 2012-02-29 株式会社エヌ・ティ・ティ・ドコモ Wireless communication apparatus and wireless communication method
RU2408988C2 (en) * 2005-03-31 2011-01-10 Нтт Досомо, Инк. Device and method of radio communication
CN100373840C (en) * 2005-04-01 2008-03-05 东南大学 Method and apparatus for detecting normalized iterative soft interference cancelling signal
US9184870B2 (en) 2005-04-01 2015-11-10 Qualcomm Incorporated Systems and methods for control channel signaling
US7991088B2 (en) * 2005-11-15 2011-08-02 Tommy Guess Iterative interference cancellation using mixed feedback weights and stabilizing step sizes
US7826516B2 (en) 2005-11-15 2010-11-02 Rambus Inc. Iterative interference canceller for wireless multiple-access systems with multiple receive antennas
GB2425236B (en) * 2005-04-12 2007-08-01 Toshiba Res Europ Ltd Apparatus and method of equalisation
US7613243B2 (en) 2005-04-12 2009-11-03 Samsung Electronics Co., Ltd. Interleaver and parser for OFDM MIMO systems
US9036538B2 (en) 2005-04-19 2015-05-19 Qualcomm Incorporated Frequency hopping design for single carrier FDMA systems
US9408220B2 (en) 2005-04-19 2016-08-02 Qualcomm Incorporated Channel quality reporting for adaptive sectorization
KR100723876B1 (en) * 2005-05-12 2007-05-31 한국전자통신연구원 Detector for multi-level modulated signal, iterative receiver for multi-level modulated signal and the method using the same
US7466749B2 (en) * 2005-05-12 2008-12-16 Qualcomm Incorporated Rate selection with margin sharing
CN100486235C (en) 2005-05-16 2009-05-06 东南大学 Iterative receiving method for maintaining soft information
US20090141826A1 (en) * 2005-05-31 2009-06-04 Toshinori Suzuki Digital signal transmitting system, receiving apparatus and receiving method
US8611284B2 (en) 2005-05-31 2013-12-17 Qualcomm Incorporated Use of supplemental assignments to decrement resources
US8879511B2 (en) 2005-10-27 2014-11-04 Qualcomm Incorporated Assignment acknowledgement for a wireless communication system
US8565194B2 (en) 2005-10-27 2013-10-22 Qualcomm Incorporated Puncturing signaling channel for a wireless communication system
US8462859B2 (en) 2005-06-01 2013-06-11 Qualcomm Incorporated Sphere decoding apparatus
US7630350B2 (en) * 2005-06-06 2009-12-08 Broadcom Corporation Method and system for parsing bits in an interleaver for adaptive modulations in a multiple input multiple output (MIMO) wireless local area network (WLAN) system
US9179319B2 (en) 2005-06-16 2015-11-03 Qualcomm Incorporated Adaptive sectorization in cellular systems
US8599945B2 (en) 2005-06-16 2013-12-03 Qualcomm Incorporated Robust rank prediction for a MIMO system
EP1881621A4 (en) * 2005-06-17 2011-08-03 Panasonic Corp Radio communication base station device, radio communication mobile station device, and radio communication method in multi-carrier communication
JP4788879B2 (en) * 2005-07-08 2011-10-05 日本電気株式会社 RADIO COMMUNICATION SYSTEM, RECEPTION DEVICE USING A plurality of antennas, DEMODULATION METHOD USED FOR THEM, AND PROGRAM THEREOF
WO2008110854A2 (en) 2007-03-14 2008-09-18 Stmicroelectronics S.R.L. A method and apparatus for multiple antenna communications, computer program product therefor
US9025689B2 (en) * 2005-07-20 2015-05-05 Stmicroelectronics S.R.L. Method and apparatus for multiple antenna communications, and related systems and computer program
US7746939B2 (en) * 2005-07-29 2010-06-29 Itt Manufacturing Enterprises, Inc. Methods and apparatus for encoding information in a signal by spectral notch modulation
US9391751B2 (en) * 2005-07-29 2016-07-12 Qualcomm Incorporated System and method for frequency diversity
US9042212B2 (en) 2005-07-29 2015-05-26 Qualcomm Incorporated Method and apparatus for communicating network identifiers in a communication system
KR20070015997A (en) * 2005-08-02 2007-02-07 삼성전자주식회사 Apparatus and method for transmitting/receiving signal using differentiated multi level modulation and demodulation in wireless communication system
US8885628B2 (en) 2005-08-08 2014-11-11 Qualcomm Incorporated Code division multiplexing in a single-carrier frequency division multiple access system
US9209956B2 (en) 2005-08-22 2015-12-08 Qualcomm Incorporated Segment sensitive scheduling
US20070041457A1 (en) 2005-08-22 2007-02-22 Tamer Kadous Method and apparatus for providing antenna diversity in a wireless communication system
US8644292B2 (en) 2005-08-24 2014-02-04 Qualcomm Incorporated Varied transmission time intervals for wireless communication system
US9136974B2 (en) 2005-08-30 2015-09-15 Qualcomm Incorporated Precoding and SDMA support
CN1941760B (en) * 2005-09-30 2010-06-09 上海无线通信研究中心 multi-antenna orthogonal frequency division multiplexing iterative transmit/receiver and method
US20070081448A1 (en) * 2005-10-06 2007-04-12 Mansoor Ahmed Partially coherent transmission for a multi-carrier communication system
US7590184B2 (en) * 2005-10-11 2009-09-15 Freescale Semiconductor, Inc. Blind preamble detection for an orthogonal frequency division multiplexed sample stream
US8711947B2 (en) * 2005-10-11 2014-04-29 Samsung Electronics Co., Ltd. Digital broadcasting transmission and reception system, and a signal processing method using turbo processing and turbo decoding
US8045512B2 (en) 2005-10-27 2011-10-25 Qualcomm Incorporated Scalable frequency band operation in wireless communication systems
US9225416B2 (en) 2005-10-27 2015-12-29 Qualcomm Incorporated Varied signaling channels for a reverse link in a wireless communication system
US9088384B2 (en) 2005-10-27 2015-07-21 Qualcomm Incorporated Pilot symbol transmission in wireless communication systems
US9172453B2 (en) 2005-10-27 2015-10-27 Qualcomm Incorporated Method and apparatus for pre-coding frequency division duplexing system
US8693405B2 (en) 2005-10-27 2014-04-08 Qualcomm Incorporated SDMA resource management
US8582509B2 (en) 2005-10-27 2013-11-12 Qualcomm Incorporated Scalable frequency band operation in wireless communication systems
US8477684B2 (en) 2005-10-27 2013-07-02 Qualcomm Incorporated Acknowledgement of control messages in a wireless communication system
JP2009514400A (en) 2005-10-27 2009-04-02 クゥアルコム・インコーポレイテッド Precoding for segment-responsive scheduling in wireless communication systems
US9210651B2 (en) 2005-10-27 2015-12-08 Qualcomm Incorporated Method and apparatus for bootstraping information in a communication system
US9144060B2 (en) 2005-10-27 2015-09-22 Qualcomm Incorporated Resource allocation for shared signaling channels
US9225488B2 (en) 2005-10-27 2015-12-29 Qualcomm Incorporated Shared signaling channel
KR101106682B1 (en) * 2005-10-31 2012-01-18 삼성전자주식회사 Apparatus and method for generating of multiple antenna log likelihood ratio
US20070110135A1 (en) * 2005-11-15 2007-05-17 Tommy Guess Iterative interference cancellation for MIMO-OFDM receivers
US7623602B2 (en) * 2005-11-15 2009-11-24 Tensorcomm, Inc. Iterative interference canceller for wireless multiple-access systems employing closed loop transmit diversity
US8467466B2 (en) * 2005-11-18 2013-06-18 Qualcomm Incorporated Reduced complexity detection and decoding for a receiver in a communication system
US8582548B2 (en) 2005-11-18 2013-11-12 Qualcomm Incorporated Frequency division multiple access schemes for wireless communication
US7957745B2 (en) * 2005-11-23 2011-06-07 Motorola Mobility, Inc. Adaptive bearer configuration for broadcast/multicast service
US7729438B2 (en) * 2005-12-01 2010-06-01 Samsung Electronics Co., Ltd. Interleaver design for IEEE 802.11n standard
KR100739182B1 (en) * 2005-12-08 2007-07-13 엘지전자 주식회사 Mobile communications terminal for supporting space-time hybrid automatic repeat request techniques and method thereof
KR100863702B1 (en) 2005-12-14 2008-10-15 삼성전자주식회사 Apparatus and method for iterative detection and decoding in mimo wireless communication system
KR100889302B1 (en) * 2005-12-14 2009-03-18 삼성전자주식회사 Partial iterative detection and decoding receiver and method in multiple antenna system
KR100923915B1 (en) 2005-12-16 2009-10-28 삼성전자주식회사 Iterative detection and decoding receiver and method in multiple antenna system
US7756004B2 (en) * 2005-12-20 2010-07-13 Samsung Electronics Co., Ltd. Interleaver design with column swap and bit circulation for multiple convolutional encoder MIMO OFDM system
US7859987B2 (en) 2005-12-20 2010-12-28 Samsung Electronic Co., Ltd. Interleaver for IEEE 802.11n standard
US7660232B2 (en) 2005-12-20 2010-02-09 Samsung Electronics Co., Ltd. Interleaver design with column skip for IEEE 802.11n standard
US7729447B2 (en) * 2005-12-22 2010-06-01 Samsung Electronics Co., Ltd. Interleaver design with multiple encoders for more than two transmit antennas in high throughput WLAN communication systems
KR100812351B1 (en) * 2006-01-13 2008-03-11 한국전자통신연구원 Apparatus for generating down link signal, and method and apparatus for determining the log-likelihood ratio in cellular system
US7830998B2 (en) * 2006-01-17 2010-11-09 Edgewater Computer Systems, Inc. Approximate linear FM synchronization symbols for a bandwidth configurable OFDM modem
KR20070079448A (en) * 2006-02-02 2007-08-07 삼성전자주식회사 Iterative detection and decoding receiver and method in multiple antenna system
WO2007091235A2 (en) 2006-02-09 2007-08-16 Altair Semiconductor Ltd. Low peak-to-average power ratio transmission in frequency-division multiple access systems
KR100896443B1 (en) * 2006-02-21 2009-05-14 삼성전자주식회사 Apparatus and method for transmitting and receiving in multi-user multi-antenna communication systems
US7933357B2 (en) 2006-02-21 2011-04-26 Samsung Electronics Co., Ltd Apparatus and method for transmission and reception in a multi-user MIMO communication system
US7586991B2 (en) * 2006-03-16 2009-09-08 Posdata Co., Ltd. Method and apparatus for calculating likelihood metric of a received signal in a digital communication system
US8091009B2 (en) * 2006-03-23 2012-01-03 Broadcom Corporation Symbol by symbol map detection for signals corrupted by colored and/or signal dependent noise
CA2541567C (en) 2006-03-31 2012-07-17 University Of Waterloo Parallel soft spherical mimo receiver and decoding method
US20070250555A1 (en) * 2006-04-20 2007-10-25 Kabushiki Kaisha Toshiba Apparatus and method of equalisation
CN101064541B (en) * 2006-04-25 2010-06-09 上海无线通信研究中心 Parallel confidence spread detecting method for multi-aerial system
CN101714885B (en) * 2006-04-25 2013-04-10 上海无线通信研究中心 Serial belief propagation detection method of multi-antenna system
US8116242B2 (en) * 2006-07-18 2012-02-14 Motorola Mobility, Inc. Receiver having multi-antenna log likelihood ratio generation with channel estimation error
US8259823B2 (en) * 2006-07-27 2012-09-04 Altair Semiconductor Ltd. Energy-efficient uplink slot allocation in time-frequency division multiple access systems
CN1921366B (en) * 2006-09-25 2010-07-21 华为技术有限公司 Method and device for realizing coded identification log-likelihood ratio
KR100826529B1 (en) 2006-09-29 2008-04-30 한국전자통신연구원 Method and Apparatus for Receiving Signal in OFDM Communication System Using Multiple Transmit/receive antenna
US20100074378A1 (en) * 2006-10-05 2010-03-25 c/o Agency for Science, Technology and Research Method and System for Estimating a Signal and Computer Program Product
JP4304632B2 (en) * 2006-10-12 2009-07-29 ソニー株式会社 Receiving device, receiving method, program, and recording medium
CN101529739A (en) 2006-10-24 2009-09-09 三菱电机株式会社 Transmitter apparatus, receiver apparatus, communication apparatus and communication system
US8019020B1 (en) * 2006-11-01 2011-09-13 Marvell International Ltd. Binary decoding for correlated input information
KR100949290B1 (en) * 2006-11-17 2010-03-25 삼성전자주식회사 Apparatus and method for interference cancellation in broadband wireless access system
US8001452B2 (en) * 2006-11-17 2011-08-16 Agere Systems Inc. Methods and apparatus for soft decision decoding using reliability values based on a log base two function
WO2008066349A1 (en) * 2006-12-01 2008-06-05 Electronics And Telecommunications Research Institute Method and apparatus for transmitting/receiving multiple codewords in sc-fdma system
KR100932456B1 (en) * 2006-12-05 2009-12-16 한국전자통신연구원 Device and Method for Interference Interference Mitigation in Orthogonal Frequency Division Multiple Access System
KR100855019B1 (en) 2006-12-28 2008-09-02 포스데이타 주식회사 Systems and Method for generating soft decision
US7711062B2 (en) * 2006-12-29 2010-05-04 Intel Corporation Decoding methods and apparatus for MIMO communication systems
EP2122954A2 (en) * 2007-01-15 2009-11-25 Koninklijke Philips Electronics N.V. Method of generating low peak-to-average power ratio ( papr) binary preamble sequences for ofdm systems
WO2008087598A2 (en) * 2007-01-16 2008-07-24 Koninklijke Philips Electronics N.V. System, apparatus and method for interleaving data bits or symbols
KR100929850B1 (en) * 2007-04-02 2009-12-04 삼성전자주식회사 Apparatus and Method for Eliminating Interference in Broadband Wireless Communication Systems
US8059764B2 (en) 2007-04-17 2011-11-15 Texas Instruments Incorporated Systems and methods for low-complexity max-log MIMO detection
KR101369838B1 (en) * 2007-04-20 2014-03-06 삼성전자주식회사 Transport stream generating device, Transmitting device, Receiving device, Digital broadcasting system having them and method thereof
KR101371179B1 (en) * 2007-05-09 2014-03-07 삼성전자주식회사 Apparatus and method for interference cancellation in multilple antenna system
TWI400902B (en) 2007-06-28 2013-07-01 Ind Tech Res Inst Method and apparatus for demapping symbol in multi-input multi-output communication system
KR100933053B1 (en) * 2007-07-13 2009-12-21 한국전자통신연구원 Receiver of Multiple Input / Output Communication System and Signal Detection Method Using the Same
CN100583649C (en) * 2007-07-23 2010-01-20 华为技术有限公司 Method and apparatus for encoding/decoding vector as well as flow medium player
KR101407172B1 (en) * 2007-08-06 2014-06-12 엘지전자 주식회사 Data transmission method using turbo code
KR101454027B1 (en) * 2007-08-10 2014-10-24 한국전자통신연구원 Time division multiplexing communication system with parallel structure and method for the same
US8989155B2 (en) 2007-08-20 2015-03-24 Rearden, Llc Systems and methods for wireless backhaul in distributed-input distributed-output wireless systems
PT2575312E (en) * 2007-09-06 2014-09-22 Lg Electronics Inc Method and system for transmitting and receiving signals
WO2009035244A2 (en) * 2007-09-10 2009-03-19 Lg Electronics Inc. System for transmitting and receiving signals
EP2195985A4 (en) * 2007-09-18 2011-06-08 Lg Electronics Inc Method and system for transmitting and receiving signals
US7948862B2 (en) * 2007-09-26 2011-05-24 Solarflare Communications, Inc. Crosstalk cancellation using sliding filters
CN101647203B (en) * 2007-10-01 2014-07-09 艾格瑞系统有限公司 Systems and methods for media defect detection
GB0720559D0 (en) * 2007-10-19 2007-11-28 Fujitsu Ltd MIMO wireless communication system
FI20075864A0 (en) * 2007-11-30 2007-11-30 Nokia Corp Device, computer program and method
US8181081B1 (en) 2007-11-30 2012-05-15 Marvell International Ltd. System and method for decoding correlated data
WO2009072813A2 (en) 2007-12-04 2009-06-11 Lg Electronics Inc. Method and system for transmitting and receiving signals
KR100888860B1 (en) 2007-12-07 2009-03-17 한국전자통신연구원 Method for dividing received symbol signal modulated bit reflected gray code into bits, and device thereof
KR100903876B1 (en) * 2007-12-14 2009-06-24 한국전자통신연구원 Method for dividing received signal modulated phase shift keying using Bit Reflected Gray Code into bits, and device thereof
KR100909570B1 (en) * 2007-12-17 2009-07-24 한국전자통신연구원 Iterative channel and noise variance estimation apparatus and method for multi-input orthogonal frequency division system
KR100958792B1 (en) * 2007-12-17 2010-05-18 한국전자통신연구원 Accelerated turbo transceiver and method for mimo system
JP5213879B2 (en) * 2008-01-31 2013-06-19 三菱電機株式会社 Transmitting apparatus and modulation method
US20090220034A1 (en) * 2008-03-03 2009-09-03 Ramprashad Sean A Layered receiver structure
WO2009113792A1 (en) * 2008-03-10 2009-09-17 Electronics And Telecommunications Research Institute Apparatus and method for mapping symbol
KR101182852B1 (en) 2008-03-10 2012-09-14 한국전자통신연구원 Apparatus and method for mapping symbol
CN101534167B (en) * 2008-03-13 2013-11-06 财团法人工业技术研究院 Preposed encoder and decoder and method thereof
US8161357B2 (en) * 2008-03-17 2012-04-17 Agere Systems Inc. Systems and methods for using intrinsic data for regenerating data from a defective medium
US8095855B2 (en) * 2008-03-17 2012-01-10 Agere Systems Inc. Systems and methods for regenerating data from a defective medium
US9184874B2 (en) 2008-03-31 2015-11-10 Qualcomm Incorporated Storing log likelihood ratios in interleaved form to reduce hardware memory
KR101527114B1 (en) * 2008-04-02 2015-06-08 삼성전자주식회사 Apparatus and method for detecting signal based on lattice reduction capable to support different encoding scheme by stream in a multiple input multiple output wireless communication system
US8149527B2 (en) * 2008-04-29 2012-04-03 Agere Systems Inc. Systems and methods for reducing attenuation of information derived from a defective medium
US8121224B2 (en) * 2008-04-29 2012-02-21 Agere Systems Inc. Systems and methods for filter based media defect detection
US7849385B2 (en) * 2008-04-29 2010-12-07 Agere Systems Inc. Systems and methods for media defect detection utilizing correlated DFIR and LLR data
EP2134017B1 (en) * 2008-05-09 2015-04-01 Vodafone Holding GmbH Method and system for data communication
US8185798B2 (en) * 2008-06-30 2012-05-22 Freescale Semiconductor, Inc. Techniques for reducing joint detection complexity in a channel-coded multiple-input multiple-output communication system
WO2010019250A2 (en) 2008-08-11 2010-02-18 Solarflare Communications, Inc. Method of synchronization for low power idle
US8949701B2 (en) 2008-09-23 2015-02-03 Agere Systems Inc. Systems and methods for low latency media defect detection
US8139457B2 (en) * 2008-09-23 2012-03-20 Agere Systems Inc. Systems and methods for low latency media defect detection
US8693570B2 (en) * 2008-10-31 2014-04-08 Industrial Technology Research Institute Communication methods and systems having data permutation
US8461848B2 (en) * 2008-12-10 2013-06-11 Marvell International Ltd. Cable diagnostics for Base-T systems
US8737502B2 (en) * 2009-02-09 2014-05-27 Qualcomm Incorporated Multiplexing and coding schemes for multiple transmit antennas in a wireless communication system
US8804859B2 (en) * 2009-02-23 2014-08-12 Mediatek, Inc. Methods and apparatuses for dealing with spectrum inversion
US8219892B2 (en) * 2009-03-06 2012-07-10 Agere Systems Inc. Systems and methods for enhanced media defect detection
US8411537B2 (en) * 2009-03-06 2013-04-02 Agere Systems Inc. Systems and methods for recovering information from a defective medium
US7952824B2 (en) * 2009-03-06 2011-05-31 Agere Systems Inc. Systems and methods for defective media region identification
EP2228935A1 (en) 2009-03-13 2010-09-15 Nederlandse Organisatie voor toegepast -natuurwetenschappelijk onderzoek TNO MIMO communication method and devices
US8745439B2 (en) * 2009-04-17 2014-06-03 Lsi Corporation Systems and methods for multilevel media defect detection
US8347155B2 (en) * 2009-04-17 2013-01-01 Lsi Corporation Systems and methods for predicting failure of a storage medium
CN101582742B (en) * 2009-06-16 2012-10-03 北京邮电大学 Method for detecting iteration of multiple input multiple output (MIMO) system, system thereof and device thereof
US8176400B2 (en) * 2009-09-09 2012-05-08 Lsi Corporation Systems and methods for enhanced flaw scan in a data processing device
JP5093261B2 (en) * 2010-02-22 2012-12-12 株式会社デンソー Sync signal detector
US20110205653A1 (en) * 2010-02-24 2011-08-25 Lsi Corporation Systems and Methods for Data Recovery
US8345369B2 (en) * 2010-02-24 2013-01-01 Lsi Corporation Systems and methods for data recovery using enhanced sync mark location
US8446939B2 (en) * 2010-04-21 2013-05-21 Telefonaktiebolaget L M Ericsson (Publ) Channel quality estimation for MLSE MIMO receiver
US8593933B2 (en) * 2010-04-27 2013-11-26 Qualcomm Incorporated Modified spatial diversity schemes for coverage enhancement
US8634332B2 (en) * 2010-04-29 2014-01-21 Qualcomm Incorporated Using joint decoding engine in a wireless device
US8612843B2 (en) 2011-08-19 2013-12-17 Lsi Corporation Systems and methods for qualitative media defect determination
US8788921B2 (en) 2011-10-27 2014-07-22 Lsi Corporation Detector with soft pruning
US8522119B2 (en) * 2011-12-07 2013-08-27 Xilinx, Inc. Reduction in decoder loop iterations
US9264266B2 (en) * 2011-12-29 2016-02-16 Intel Corporation Successive interference cancellation system and method for MIMO horizontal encoding and decoding
US8744017B2 (en) * 2012-03-02 2014-06-03 CMMB Vision USA Inc. Demapping for hierarchical Quadrature Amplitude Modulation
US20130262400A1 (en) * 2012-03-30 2013-10-03 Huawei Technologies Co., Ltd. Data index query method, apparatus and system
US9129653B2 (en) 2012-04-20 2015-09-08 Avago Technologies General Ip (Singapore) Pte. Ltd. Systems and methods for calibration coasting in a data processing system
WO2013159207A1 (en) * 2012-04-27 2013-10-31 The Royal Institution For The Advancement Of Learning/Mcgill University Methods and devices for communications systems using multiplied rate transmission
US8819521B2 (en) 2012-04-30 2014-08-26 Lsi Corporation Systems and methods for short media defect detection using non-binary coded information
US8897406B2 (en) 2012-04-30 2014-11-25 Samsung Electronics Co., Ltd. Communication system with iterative detector and decoder and method of operation thereof
US8831146B2 (en) 2012-06-14 2014-09-09 Samsung Electronics Co., Ltd. Communication system with iterative detector and decoder and method of operation thereof
US8675297B2 (en) 2012-06-15 2014-03-18 Lsi Corporation Media defect classification
US9076492B2 (en) 2012-07-12 2015-07-07 Lsi Corporation Systems and methods for rapid erasure retry decoding
US8826110B2 (en) 2012-07-17 2014-09-02 Lsi Corporation Systems and methods for defect scanning
ES2439143B1 (en) * 2012-07-18 2015-02-13 Telefónica, S.A. METHOD AND SYSTEM THAT IMPLEMENT A TURBO-DIVERSITY SCHEME FOR WIRELESS OFDM SYSTEMS
US8732562B2 (en) 2012-07-25 2014-05-20 Lsi Corporation Systems and methods for improved short media defect detection
US8972800B2 (en) 2012-07-30 2015-03-03 Lsi Corporation Systems and methods for enhanced media defect detection
CN104662853B (en) * 2012-08-21 2017-07-11 扬智欧洲有限公司 Soft metric values compression method
US9071983B2 (en) * 2012-08-28 2015-06-30 Samsung Electronics Co., Ltd. Communication system with repeat-response processing mechanism and method of operation thereof
US9245586B2 (en) 2012-10-18 2016-01-26 Avago Technologies General Ip (Singapore) Pte. Ltd. Systems and methods for short media defect detection using multi-iteration soft data feedback
US8996970B2 (en) 2012-10-24 2015-03-31 Lsi Corporation Systems and methods for positive feedback short media defect detection
US11190947B2 (en) 2014-04-16 2021-11-30 Rearden, Llc Systems and methods for concurrent spectrum usage within actively used spectrum
US10194346B2 (en) 2012-11-26 2019-01-29 Rearden, Llc Systems and methods for exploiting inter-cell multiplexing gain in wireless cellular systems via distributed input distributed output technology
US11050468B2 (en) 2014-04-16 2021-06-29 Rearden, Llc Systems and methods for mitigating interference within actively used spectrum
US11189917B2 (en) 2014-04-16 2021-11-30 Rearden, Llc Systems and methods for distributing radioheads
US9973246B2 (en) 2013-03-12 2018-05-15 Rearden, Llc Systems and methods for exploiting inter-cell multiplexing gain in wireless cellular systems via distributed input distributed output technology
US9923657B2 (en) 2013-03-12 2018-03-20 Rearden, Llc Systems and methods for exploiting inter-cell multiplexing gain in wireless cellular systems via distributed input distributed output technology
US10164698B2 (en) 2013-03-12 2018-12-25 Rearden, Llc Systems and methods for exploiting inter-cell multiplexing gain in wireless cellular systems via distributed input distributed output technology
US10488535B2 (en) 2013-03-12 2019-11-26 Rearden, Llc Apparatus and method for capturing still images and video using diffraction coded imaging techniques
US10547358B2 (en) 2013-03-15 2020-01-28 Rearden, Llc Systems and methods for radio frequency calibration exploiting channel reciprocity in distributed input distributed output wireless communications
US9225468B1 (en) * 2013-04-01 2015-12-29 Marvell International Ltd. Systems and methods for detecting data in a received multiple-input-multiple-output (MIMO) signal
US9244752B2 (en) 2013-05-02 2016-01-26 Avago Technologies General Ip (Singapore) Pte. Ltd. Systems and methods for detecting media flaws
US8917468B1 (en) 2013-06-06 2014-12-23 Lsi Corporation Systems and methods for media defect detection with pattern qualification
US9124477B2 (en) * 2013-08-28 2015-09-01 Broadcom Corporation Frequency interleave within communication systems
EP3090501B1 (en) * 2013-12-30 2019-06-12 Telecom Italia S.p.A. Improved receiver for wireless communications networks
US9432234B2 (en) * 2014-04-09 2016-08-30 Broadcom Corporation Frequency interleaving and de-interleaving for OFDM modulation
US11290162B2 (en) 2014-04-16 2022-03-29 Rearden, Llc Systems and methods for mitigating interference within actively used spectrum
US9325450B2 (en) * 2014-05-21 2016-04-26 Stmicroelectronics S.R.L. Method and system for processing digital data, corresponding apparatus and computer program product
CN104852784B (en) * 2015-04-07 2018-02-16 浙江理工大学 A kind of multiple cell mimo system upward signal detection method based on constellation structures
US9716601B2 (en) * 2015-04-24 2017-07-25 Samsung Electronics Co., Ltd Method and apparatus for soft detection of high order QAM symbols in MIMO channels
US9602240B1 (en) * 2015-09-11 2017-03-21 Signalchip Innovations Private Limited Method and system for symbol level interference cancellation at a receiver for multiuser detection
EP3151432B1 (en) * 2015-10-01 2018-08-01 Mitsubishi Electric R&D Centre Europe B.V. Method and a device for demodulating received symbols using a turbo-demodulation scheme comprising an iterative mimo decoder and wherein an iterative channel decoder is used in the turbo-demodulation scheme
WO2017198197A1 (en) * 2016-05-20 2017-11-23 Huawei Technologies Co., Ltd. Method for flexible sparse code multiple access codebook design, transmission and detection
KR101832901B1 (en) * 2017-01-11 2018-02-27 서울과학기술대학교 산학협력단 Soft Decision Decoding Apparatus and method using Iterative Tabu Search for MIMO
EP3624349B1 (en) * 2017-05-24 2023-06-14 Huawei Technologies Co., Ltd. Decoding method and device
US10243773B1 (en) 2017-06-30 2019-03-26 Genghiscomm Holdings, LLC Efficient peak-to-average-power reduction for OFDM and MIMO-OFDM
US10637705B1 (en) 2017-05-25 2020-04-28 Genghiscomm Holdings, LLC Peak-to-average-power reduction for OFDM multiple access
KR102416491B1 (en) * 2017-06-19 2022-07-05 삼성전자 주식회사 Data decoding method and device in wireless communication system
CN108736934B (en) * 2018-05-18 2021-02-09 东南大学 Large-scale MIMO system signal detection method
US11917604B2 (en) 2019-01-25 2024-02-27 Tybalt, Llc Orthogonal multiple access and non-orthogonal multiple access
CN113454964A (en) 2019-01-25 2021-09-28 珍吉斯科姆控股有限责任公司 Orthogonal and non-orthogonal multiple access
US11343823B2 (en) 2020-08-16 2022-05-24 Tybalt, Llc Orthogonal multiple access and non-orthogonal multiple access
CN111726198B (en) * 2019-03-22 2023-08-22 瑞昱半导体股份有限公司 Iterative detection and decoding circuit and method thereof, and MIMO receiver
WO2020242898A1 (en) 2019-05-26 2020-12-03 Genghiscomm Holdings, LLC Non-orthogonal multiple access
EP3758319B1 (en) * 2019-06-27 2023-01-18 Rohde & Schwarz GmbH & Co. KG Receiver module, data transmission system and method for receiving an electromagnetic signal
CN111614360B (en) * 2020-04-26 2023-10-27 四川润泽经伟信息技术有限公司 Carrier interference device based on satellite communication countermeasure system and corresponding decoding method
CN112787758B (en) * 2021-01-15 2021-11-02 北京理工大学 Serial interference elimination uplink multiple access system of mass medium modulation equipment

Citations (26)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5237586A (en) * 1992-03-25 1993-08-17 Ericsson-Ge Mobile Communications Holding, Inc. Rake receiver with selective ray combining
US5659578A (en) * 1994-11-23 1997-08-19 At&T Wireless Services, Inc. High rate Reed-Solomon concatenated trellis coded 16 star QAM system for transmission of data over cellular mobile radio
US6222835B1 (en) * 1997-11-06 2001-04-24 Siemens Aktiengesellschaft Method and configuration for packet-oriented data transmission in a digital transmission system
US6307882B1 (en) * 1998-07-10 2001-10-23 Lucent Technologies Inc. Determining channel characteristics in a space-time architecture wireless communication system having multi-element antennas
US20020034261A1 (en) * 2000-06-23 2002-03-21 Eidson Donald Brian Rate n/n systematic, recursive convolutional encoder and corresponding decoder
US6442214B1 (en) * 2000-05-19 2002-08-27 Iospan Wireless, Inc. Diversity transmitter based on linear transform processing of transmitted information
US20020165626A1 (en) * 2000-11-06 2002-11-07 Hammons A. Roger Space-time coded OFDM system for MMDS applications
US6487694B1 (en) * 1999-12-20 2002-11-26 Hitachi America, Ltd. Method and apparatus for turbo-code decoding a convolution encoded data frame using symbol-by-symbol traceback and HR-SOVA
US6499128B1 (en) * 1999-02-18 2002-12-24 Cisco Technology, Inc. Iterated soft-decision decoding of block codes
US20030076890A1 (en) * 2001-07-26 2003-04-24 Lucent Technologies, Inc. Method and apparatus for detection and decoding of signals received from a linear propagation channel
US20030086504A1 (en) * 2001-11-05 2003-05-08 Magee David Patrick System and method for soft slicing
US20030112901A1 (en) * 2001-11-29 2003-06-19 Gupta Alok Kumar Method and apparatus for determining the log-likelihood ratio with precoding
US6587452B1 (en) * 1999-01-04 2003-07-01 Golden Bridge Technology, Inc. High performance signal structure with multiple modulation formats
US6591390B1 (en) * 2000-04-11 2003-07-08 Texas Instruments Incorporated CRC-based adaptive halting turbo decoder and method of use
US6731696B1 (en) * 1997-12-31 2004-05-04 At&T Corp. Multi-channel parallel/serial concatenated convolutional codes and trellis coded modulation encoder/decoder
US20040100897A1 (en) * 1998-02-12 2004-05-27 Shattil Steve J. Carrier interferometry coding with aplications to cellular and local area networks
US20040174939A1 (en) * 2003-02-28 2004-09-09 Nec Laboratories America, Inc. Near-optimal multiple-input multiple-output (MIMO) channel detection via sequential Monte Carlo
US6807146B1 (en) * 2000-04-21 2004-10-19 Atheros Communications, Inc. Protocols for scalable communication system using overland signals and multi-carrier frequency communication
US6816556B2 (en) * 2000-01-18 2004-11-09 Samsung Electronics Co., Ltd. Bandwidth-efficient concatenated trellis-coded modulation decoder and decoding method thereof
US20040240590A1 (en) * 2000-09-12 2004-12-02 Cameron Kelly Brian Decoder design adaptable to decode coded signals using min* or max* processing
US6856656B2 (en) * 2000-12-04 2005-02-15 Conexant Systems, Inc. Iterative carrier phase tracking decoding system
US20050047517A1 (en) * 2003-09-03 2005-03-03 Georgios Giannakis B. Adaptive modulation for multi-antenna transmissions with partial channel knowledge
US6901119B2 (en) * 2001-02-22 2005-05-31 International Business Machines Corporation Method and apparatus for implementing soft-input/soft-output iterative detectors/decoders
US6977974B1 (en) * 2000-11-20 2005-12-20 At&T Corp. De-modulation of MOK(M-ary orthogonal modulation)
US7133853B2 (en) * 2001-06-15 2006-11-07 Qualcomm Incorporated Methods and apparatus for decoding LDPC codes
US20070140374A1 (en) * 1996-08-29 2007-06-21 Raleigh Gregory G Spatio-temporal processing for communication

Family Cites Families (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB9709285D0 (en) 1997-05-08 1997-06-25 Philips Electronics Nv Flexible two-way telecommunications system
JP2002523969A (en) * 1998-08-18 2002-07-30 ビームリーチ・ネットワークス・インコーポレイテッド Stack carrier discrete multitone communication technology
GB9911777D0 (en) 1999-05-20 1999-07-21 Univ Southampton Transceiver
GB9917977D0 (en) * 1999-07-30 1999-09-29 Smithkline Beecham Biolog Novel compounds
WO2001019013A1 (en) 1999-09-09 2001-03-15 Home Wireless Networks, Inc. Turbo detection of space-time codes
US6888809B1 (en) * 2000-01-13 2005-05-03 Lucent Technologies Inc. Space-time processing for multiple-input, multiple-output, wireless systems
US6987754B2 (en) 2000-03-07 2006-01-17 Menashe Shahar Adaptive downstream modulation scheme for broadband wireless access systems
US6473467B1 (en) * 2000-03-22 2002-10-29 Qualcomm Incorporated Method and apparatus for measuring reporting channel state information in a high efficiency, high performance communications system

Patent Citations (27)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5237586A (en) * 1992-03-25 1993-08-17 Ericsson-Ge Mobile Communications Holding, Inc. Rake receiver with selective ray combining
US5659578A (en) * 1994-11-23 1997-08-19 At&T Wireless Services, Inc. High rate Reed-Solomon concatenated trellis coded 16 star QAM system for transmission of data over cellular mobile radio
US20070140374A1 (en) * 1996-08-29 2007-06-21 Raleigh Gregory G Spatio-temporal processing for communication
US6222835B1 (en) * 1997-11-06 2001-04-24 Siemens Aktiengesellschaft Method and configuration for packet-oriented data transmission in a digital transmission system
US6731696B1 (en) * 1997-12-31 2004-05-04 At&T Corp. Multi-channel parallel/serial concatenated convolutional codes and trellis coded modulation encoder/decoder
US20040100897A1 (en) * 1998-02-12 2004-05-27 Shattil Steve J. Carrier interferometry coding with aplications to cellular and local area networks
US6307882B1 (en) * 1998-07-10 2001-10-23 Lucent Technologies Inc. Determining channel characteristics in a space-time architecture wireless communication system having multi-element antennas
US6587452B1 (en) * 1999-01-04 2003-07-01 Golden Bridge Technology, Inc. High performance signal structure with multiple modulation formats
US6499128B1 (en) * 1999-02-18 2002-12-24 Cisco Technology, Inc. Iterated soft-decision decoding of block codes
US6487694B1 (en) * 1999-12-20 2002-11-26 Hitachi America, Ltd. Method and apparatus for turbo-code decoding a convolution encoded data frame using symbol-by-symbol traceback and HR-SOVA
US6816556B2 (en) * 2000-01-18 2004-11-09 Samsung Electronics Co., Ltd. Bandwidth-efficient concatenated trellis-coded modulation decoder and decoding method thereof
US6591390B1 (en) * 2000-04-11 2003-07-08 Texas Instruments Incorporated CRC-based adaptive halting turbo decoder and method of use
US6807146B1 (en) * 2000-04-21 2004-10-19 Atheros Communications, Inc. Protocols for scalable communication system using overland signals and multi-carrier frequency communication
US6442214B1 (en) * 2000-05-19 2002-08-27 Iospan Wireless, Inc. Diversity transmitter based on linear transform processing of transmitted information
US20020034261A1 (en) * 2000-06-23 2002-03-21 Eidson Donald Brian Rate n/n systematic, recursive convolutional encoder and corresponding decoder
US20040240590A1 (en) * 2000-09-12 2004-12-02 Cameron Kelly Brian Decoder design adaptable to decode coded signals using min* or max* processing
US20020165626A1 (en) * 2000-11-06 2002-11-07 Hammons A. Roger Space-time coded OFDM system for MMDS applications
US6977974B1 (en) * 2000-11-20 2005-12-20 At&T Corp. De-modulation of MOK(M-ary orthogonal modulation)
US6856656B2 (en) * 2000-12-04 2005-02-15 Conexant Systems, Inc. Iterative carrier phase tracking decoding system
US6901119B2 (en) * 2001-02-22 2005-05-31 International Business Machines Corporation Method and apparatus for implementing soft-input/soft-output iterative detectors/decoders
US7133853B2 (en) * 2001-06-15 2006-11-07 Qualcomm Incorporated Methods and apparatus for decoding LDPC codes
US20030076890A1 (en) * 2001-07-26 2003-04-24 Lucent Technologies, Inc. Method and apparatus for detection and decoding of signals received from a linear propagation channel
US7236536B2 (en) * 2001-07-26 2007-06-26 Lucent Technologies Inc. Method and apparatus for detection and decoding of signals received from a linear propagation channel
US20030086504A1 (en) * 2001-11-05 2003-05-08 Magee David Patrick System and method for soft slicing
US20030112901A1 (en) * 2001-11-29 2003-06-19 Gupta Alok Kumar Method and apparatus for determining the log-likelihood ratio with precoding
US20040174939A1 (en) * 2003-02-28 2004-09-09 Nec Laboratories America, Inc. Near-optimal multiple-input multiple-output (MIMO) channel detection via sequential Monte Carlo
US20050047517A1 (en) * 2003-09-03 2005-03-03 Georgios Giannakis B. Adaptive modulation for multi-antenna transmissions with partial channel knowledge

Cited By (18)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8437417B1 (en) * 2002-02-15 2013-05-07 Marvell International Ltd. Method and apparatus for performing baseband equalization in symbol modulated communications
US9036743B1 (en) 2002-02-15 2015-05-19 Marvell International Ltd. System and method for performing maximum ratio combining on a plurality of received symbols
US8675786B1 (en) 2002-02-15 2014-03-18 Marvell International Ltd. Method and apparatus for performing baseband equalization in symbol modulated communications
US20100235710A1 (en) * 2003-09-09 2010-09-16 Ntt Docomo, Inc. Signal transmission method and transmitter in radio multiplex transmission system
US8375270B2 (en) 2003-09-09 2013-02-12 Ntt Docomo, Inc. Signal transmission method and transmitter in radio multiplex transmission system
US7725090B2 (en) * 2005-04-15 2010-05-25 Spreadtrum Communications Inc. Method and apparatus for automatic frequency correction
US20060233153A1 (en) * 2005-04-15 2006-10-19 Spreadtrum Communications Corporation Method and apparatus for automatic frequency correction
US20080112502A1 (en) * 2006-11-14 2008-05-15 Limberg Allen L System for digital television broadcasting using modified 2/3 trellis coding
US8005166B2 (en) 2006-11-14 2011-08-23 Samsung Electronics Co., Ltd. System for digital television broadcasting using modified 2/3 trellis coding
US20090322961A1 (en) * 2008-06-27 2009-12-31 Limberg Allen Leroy System for digital television broadcasting using modified 2/3 trellis coding
US8687718B2 (en) * 2008-07-07 2014-04-01 Commonwealth Scientific And Industrial Research Organisation Multiple-input multiple-output OFDM systems
US20110261898A1 (en) * 2008-07-07 2011-10-27 Commonwealth Scientific And Industrial Research Organisation Multiple-input multiple-output ofdm systems
JP2013501395A (en) * 2009-07-31 2013-01-10 ソ、ホン−ソク Received signal processing method for processing received signal by applying channel state information by orthogonal frequency division multiplexing
WO2011013926A3 (en) * 2009-07-31 2011-06-16 Seo Hong Seok Method for processing a received signal to which channel state information is applied in an orthogonal frequency-division multiplexing system
US20140247909A1 (en) * 2011-10-05 2014-09-04 Telefonaktiebolaget L M Ericsson (Publ) Method and Device for Decoding a Transport Block of a Communication Signal
US9692553B2 (en) * 2011-10-05 2017-06-27 Telefonaktiebolaget Lm Ericsson (Publ) Method and device for decoding a transport block of a communication signal
WO2017100689A1 (en) * 2015-12-10 2017-06-15 University Of Utah Research Foundation Soft-information moderation for mimo detectors
WO2018038852A1 (en) * 2016-08-26 2018-03-01 Qualcomm Incorporated Concatenated decoding methods for range extension

Also Published As

Publication number Publication date
US20050157811A1 (en) 2005-07-21
BR0214640A (en) 2007-03-13
WO2003049397A3 (en) 2004-02-26
TWI292271B (en) 2008-01-01
JP2006503446A (en) 2006-01-26
US20070064831A1 (en) 2007-03-22
US7154936B2 (en) 2006-12-26
EP2317717A2 (en) 2011-05-04
EP1451991A2 (en) 2004-09-01
US7372896B2 (en) 2008-05-13
WO2003049397A2 (en) 2003-06-12
KR100942401B1 (en) 2010-02-17
TW200303672A (en) 2003-09-01
CN1618222A (en) 2005-05-18
AU2002343608A8 (en) 2003-06-17
KR20050058269A (en) 2005-06-16
US20030103584A1 (en) 2003-06-05
AU2002343608A1 (en) 2003-06-17
EP2317717A3 (en) 2013-04-10
JP2010136404A (en) 2010-06-17

Similar Documents

Publication Publication Date Title
US7372896B2 (en) Iterative detection and decoding for a MIMO-OFDM system
US7724838B2 (en) Hierarchical coding with multiple antennas in a wireless communication system
US7359313B2 (en) Space-time bit-interleaved coded modulation for wideband transmission
AU2003216479C1 (en) Data transmission with non-uniform distribution of data rates for a multiple-input multiple-output (MIMO) system
US20050128966A1 (en) Communications apparatus and methods
US20060087960A1 (en) Transmitter and receiver in an orthogonal frequency division multiplexing system using an antenna array and methods thereof
Sellathurai et al. A simplified diagonal BLAST architecture with iterative parallel-interference cancellation receivers
EP1746756B1 (en) A method and system for decoding signals, corresponding receiver and computer program product
US7924945B2 (en) Iterative receiving method for a MIMO system, and corresponding receiver and computer program
Chen et al. Layered turbo space-time coded MIMO-OFDM systems for time varying channels
Wang et al. Space-time turbo detection and decoding for MIMO block transmission systems
Sun et al. A novel iterative receiver for coded MIMO OFDM systems
Davies et al. Polynomial matrix QR decomposition and iterative decoding of frequency selective MIMO channels
Chen et al. Low-complexity turbo equalization for MIMO-OFDM system without cyclic prefix
Sun et al. An iterative receiver for groupwise bit-interleaved coded QAM STBC OFDM
Wang et al. Turbo detection and decoding for space-time block-coded block transmission systems
Davies et al. A polynomial QR decomposition based turbo equalization technique for frequency selective MIMO channels
Sand et al. EXIT chart analysis of iterative receivers for space-time-frequency coded OFDM systems
Kafle et al. Iterative semi-blind space-time multiuser detection for MC-CDMA uplink system
Tsiligkaridis Fast peak-power reduction for MIMO-OFDM systems with diversity
Lin et al. Scaled matched filter based iterative receiver for coded MIMO-OFDM systems
Qiao et al. Iteratative soft interference cancellation for uplink turbo-coded MIMO MC-CDMA system
Zhang et al. Turbo-based Interference Cancellation for SFBC-OFDM Systems
Wang et al. A Novel Low-Complexity MAP SISO Detector for Iterative Detection in Precoded OFDM Systems
Huang et al. A Novel Layered Space-Time-Frequency Architecture with Convolutional Coding

Legal Events

Date Code Title Description
STCB Information on status: application discontinuation

Free format text: ABANDONED -- FAILURE TO RESPOND TO AN OFFICE ACTION

AS Assignment

Owner name: QUALCOMM, INCORPORATED, CALIFORNIA

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:BJERKE, BJORN A.;KETCHUM, JOHN W.;WALTON, JAY R.;REEL/FRAME:027609/0682

Effective date: 20020206