Performance and Complexity Tradeoffs of Space-Time Modulation and Coding Schemes
Author(s)
Chang, Nicholas B.; Margetts, Adam R.; McKellips, Andrew L.
DownloadChang-2009-Performance and Complexity Tradeoffs of Space-Time Modulation and Coding Schemes.pdf (417.7Kb)
PUBLISHER_POLICY
Publisher Policy
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Terms of use
Metadata
Show full item recordAbstract
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.
Date issued
2010-05Department
Lincoln LaboratoryJournal
Conference Record of the Forty-Third Asilomar Conference on Signals, Systems and Computers, 2009
Publisher
Institute of Electrical and Electronics Engineers
Citation
Chang, N.B., A.R. Margetts, and A.L. McKellips. “Performance and complexity tradeoffs of space-time modulation and coding schemes.” Signals, Systems and Computers, 2009 Conference Record of the Forty-Third Asilomar Conference on. 2009. 1446-1450. © Copyright 2009 IEEE
Version: Final published version
Other identifiers
INSPEC Accession Number: 11308919
ISBN
978-1-4244-5825-7
ISSN
1058-6393