Computationally Efficient Lattice Reduction Aided Detection for MIMO-OFDM Systems under Correlated Fading Channels Public Deposited

http://ir.library.oregonstate.edu/concern/defaults/3r074w30c

This is the publisher’s final pdf. The published article is copyrighted by Electronics and Telecommunications Research Institute and can be found at:  http://etrij.etri.re.kr/.

Descriptions

Attribute NameValues
Creator
Abstract or Summary
  • We analyze the relationship between channel coherence bandwidth and two complexity-reduced lattice reduction aided detection (LRAD) algorithms for multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) systems in correlated fading channels. In both the adaptive LR algorithm and the fixed interval LR algorithm, we exploit the inherent feature of unimodular transformation matrix P that remains the same for the adjacent highly correlated subcarriers. Complexity simulations demonstrate that the adaptive LR algorithm could eliminate up to approximately 90 percent of the multiplications and 95 percent of the divisions of the brute-force LR algorithm with large coherence bandwidth. The results also show that the adaptive algorithm with both optimum and globally suboptimum initial interval settings could significantly reduce the LR complexity, compared with the brute-force LR and fixed interval LR algorithms, while maintaining the system performance.
Resource Type
DOI
Date Available
Date Issued
Citation
  • Wei Liu, Kwonhue Choi, and Huaping Liu, "Computationally Efficient Lattice Reduction Aided Detection for MIMO-OFDM Systems under Correlated Fading Channels," ETRI Journal, vol. 34, no. 4, Aug. 2012, pp. 503-510. http://dx.doi.org/10.4218/etrij.12.0111.0707
Series
Keyword
Rights Statement
Funding Statement (additional comments about funding)
Publisher
Peer Reviewed
Language
Replaces
Additional Information
  • description.provenance : Approved for entry into archive by Deanne Bruner(deanne.bruner@oregonstate.edu) on 2013-04-10T17:58:06Z (GMT) No. of bitstreams: 3 license_rdf: 19965 bytes, checksum: 225316337756db2af069c3edfe03a49f (MD5) license_text: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) LiuHuapingElectricalEngineeringComputerScienceComputationallyEfficientLattice.pdf: 2319282 bytes, checksum: 555e9249b4eae7b2c879556005957d0d (MD5)
  • description.provenance : Submitted by Deanne Bruner (deanne.bruner@oregonstate.edu) on 2013-04-10T17:55:45Z No. of bitstreams: 3 license_rdf: 19965 bytes, checksum: 225316337756db2af069c3edfe03a49f (MD5) license_text: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) LiuHuapingElectricalEngineeringComputerScienceComputationallyEfficientLattice.pdf: 2319282 bytes, checksum: 555e9249b4eae7b2c879556005957d0d (MD5)
  • description.provenance : Made available in DSpace on 2013-04-10T17:58:06Z (GMT). No. of bitstreams: 3 license_rdf: 19965 bytes, checksum: 225316337756db2af069c3edfe03a49f (MD5) license_text: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) LiuHuapingElectricalEngineeringComputerScienceComputationallyEfficientLattice.pdf: 2319282 bytes, checksum: 555e9249b4eae7b2c879556005957d0d (MD5) Previous issue date: 2012-08

Relationships

In Administrative Set:
Last modified: 07/18/2017

Downloadable Content

Download PDF
Citations:

EndNote | Zotero | Mendeley

Items