Performance and complexity tradeoffs of space-time modulation and coding schemes

Authors:
Nicholas B. Chang;Adam R. Margetts;Andrew L. McKellips
Affiliations:
MIT Lincoln Laboratory, Lexington, MA and Advanced Sensor Techniques Group;Advanced Sensor Techniques Group, MIT Lincoln Laboratory, Lexington, MA;Advanced Sensor Techniques Group, MIT Lincoln Laboratory, Lexington, MA
Venue:
Asilomar'09 Proceedings of the 43rd Asilomar conference on Signals, systems and computers
Year:
2009

Citing 8
Cited 0

Fundamentals of wireless communication

Fundamentals of wireless communication
Design of nonbinary LDPC codes over GF(q) for multiple-antenna transmission

MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
LDPC-coded MIMO systems with unknown block fading channels: soft MIMO detector design, channel estimation, and code optimization

IEEE Transactions on Signal Processing
Low-density parity-check codes for space-time wireless transmission

IEEE Transactions on Wireless Communications
Application of Nonbinary LDPC Cycle Codes to MIMO Channels

IEEE Transactions on Wireless Communications
Space-time codes for high data rate wireless communication: performance criterion and code construction

IEEE Transactions on Information Theory
Efficient encoding of low-density parity-check codes

IEEE Transactions on Information Theory
Turbo decoding as an instance of Pearl's “belief propagation” algorithm

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Wireless communication using multiple-input multiple-output (MIMO) systems improves throughput and enhances reliability for a given total transmit power. Achieving a higher data rate in MIMO systems requires utilizing an effective space-time coding and modulation scheme. The appropriate algorithm to use for a system will depend on parameters such as the number of transmit/receive antennas, target spectral efficiency, complexity limitations, channel environment, and other factors. In this paper, we examine the performance of various two-transmit and four-transmit space-time coding schemes under different channel types and target data rates. We compare the performance of state of the art space-time coding schemes including direct non-binary LDPC GF(q) modulation, bit interleaved coded modulation using iterative detection, and space-time trellis coded modulation. We obtain a tradeoff between performance and complexity of these various schemes.