Close category search window
 

Reconfigurable K-best algorithm for MIMO detection systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Kuang-Hao Lin ; Dept. of Electron. Eng., Nat. Chin-Yi Univ. of Technol., Taiping, Taiwan ; Chih-Hung Lin ; Chang, R.C.-H. ; I-Ju Chang

The maximum likelihood (ML) detection is the optimal detection method for multiple-input multiple-output (MIMO) communication systems. The normal K-best sphere decoding algorithm (SDA) can guarantee a fixed throughput, but it induces a large bit error rate (BER) degradation. In order to achieve close-to-ML performance, the K value needs to be sufficiently large. Thus, it needs large computation with long latency and low throughput. In this paper, a reconfigurable K-best SDA is proposed by using fixed K values for different layers of K-best detection, which can increase the MIMO detection performance. The architecture of 4×4 MIMO detector is designed for both 16QAM and 64QAM modulation.

Published in:
Information, Communications and Signal Processing, 2009. ICICS 2009. 7th International Conference on

Date of Conference: 8-10 Dec. 2009

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.