LDPC coded MIMO multiple access with iterative joint decoding

Sanderovich, Amichai; Peleg, Michael; Shamai, Shlomo

doi:10.1109/tit.2005.844064

Cited by 56 publications

(62 citation statements)

References 38 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…One approach is for the receiver to feed the soft outputs from its symbol-level joint detection to a decoder for the outer code. This approach can be enhanced by iterating between detection and decoding using an iterative decoder [31]- [35]. While it can be shown numerically that these approaches improve upon the performance of uncoded systems, it is difficult to argue that they can operate close to the MIMO capacity at practicallyrelevant SNRs.…”

Section: Introductionmentioning

confidence: 99%

Integer-Forcing Linear Receivers

Zhan

Nazer

Erez

et al. 2014

IEEE Trans. Inform. Theory

169

269

View full text Add to dashboard Cite

Abstract-Linear receivers are often used to reduce the implementation complexity of multiple-antenna systems. In a traditional linear receiver architecture, the receive antennas are used to separate out the codewords sent by each transmit antenna, which can then be decoded individually. Although easy to implement, this approach can be highly suboptimal when the channel matrix is near singular. This paper develops a new linear receiver architecture that uses the receive antennas to create an effective channel matrix with integer-valued entries. Rather than attempting to recover transmitted codewords directly, the decoder recovers integer combinations of the codewords according to the entries of the effective channel matrix. The codewords are all generated using the same linear code which guarantees that these integer combinations are themselves codewords. Provided that the effective channel is full rank, these integer combinations can then be digitally solved for the original codewords. This paper focuses on the special case where there is no coding across transmit antennas and no channel state information at the transmitter(s), which corresponds either to a multi-user uplink scenario or to single-user V-BLAST encoding. In this setting, the proposed integer-forcing linear receiver significantly outperforms conventional linear architectures such as the zero-forcing and linear MMSE receiver. In the high SNR regime, the proposed receiver attains the optimal diversity-multiplexing tradeoff for the standard MIMO channel with no coding across transmit antennas. It is further shown that in an extended MIMO model with interference, the integer-forcing linear receiver achieves the optimal generalized degrees-of-freedom.

show abstract

Section: Introductionmentioning

confidence: 99%

Integer-Forcing Linear Receivers

Zhan

Nazer

Erez

et al. 2014

IEEE Trans. Inform. Theory

169

269

View full text Add to dashboard Cite

show abstract

“…This scenario actually occurs at the first decoding iteration performed by the new iterative receivers based on the turbo principle, see Figure 1, where some preprocessor such as equalizer, multi-user detector [1], phase estimator or other precedes the decoder and employs the decoder outputs to improve the channel presented to the decoder over the successive iterations. The ECC code may be any code, including an iteratively decodable turbo or LDPC code.…”

Section: Introductionmentioning

confidence: 99%

On extrinsic information of good binary codes operating over Gaussian channels

Peleg

Sanderovich

Shamai

2006

Trans Emerging Tel Tech

Self Cite

View full text Add to dashboard Cite

SUMMARYWe show that the extrinsic information about the coded bits of any good (capacity achieving) binary code operating over a Gaussian channel is zero when the channel capacity is lower than the code rate and unity when capacity exceeds the code rate, that is, the extrinsic information transfer (EXIT) chart is a step function of the signal to noise ratio and independent of the code. It follows that, for a common class of iterative receivers where the error correcting decoder must operate at first iteration at rate above capacity (such as in turbo equalization, iterative channel estimation, parallel and serial concatenated coding and the like), classical good codes which achieve capacity over the Additive White Gaussian Noise Channel are not effective and should be replaced by different new ones.

show abstract

“…First, we assume that there exists a coding strategy that achieves the capacity region of the Gaussian multipleaccess channel. State-of-the-art coding strategies for the Gaussian multiple-access channel are indeed very close to the capacity region [18,19]. Second, we assume that the number of users and the available radio spectrum grow asymptotically large, with the ratio of the number of users to radio spectrum being constant.…”

Section: Queuing Modelmentioning

confidence: 97%

Individual packet deadline delay constrained opportunistic scheduling for large multiuser systems

Butt

Müller

Kansanen

2014

J Wireless Com Network

View full text Add to dashboard Cite

This work addresses opportunistic distributed multiuser scheduling in the presence of a fixed packet deadline delay constraint. A threshold-based scheduling scheme is proposed which uses the instantaneous channel gain and buffering time of the individual packets to schedule a group of users simultaneously in order to minimize the average system energy consumption while fulfilling the deadline delay constraint for every packet. The multiuser environment is modeled as a continuum of interference such that the optimization can be performed for each buffered packet separately by using a Markov chain where the states represent the waiting time of each buffered packet. We analyze the proposed scheme in the large user limit and demonstrate the delay-energy trade-off exhibited by the scheme. We show that the multiuser scheduling can be broken into a packet-based scheduling problem in the large user limit and the packet scheduling decisions are independent of the deadline delay distribution of the packets.

show abstract

LDPC coded MIMO multiple access with iterative joint decoding

Cited by 56 publications

References 38 publications

Integer-Forcing Linear Receivers

Integer-Forcing Linear Receivers

On extrinsic information of good binary codes operating over Gaussian channels

Individual packet deadline delay constrained opportunistic scheduling for large multiuser systems

Contact Info

Product

Resources

About