By Topic

Depth-First and Breadth-First Search Based Multilevel SGA Algorithms for Near Optimal Symbol Detection in MIMO 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)
Jia, Y. ; Philips Res. Asia, Shanghai ; Andrieu, C. ; Piechocki, R.J. ; Sandell, M.

The multilevel structure of the N-QAM modulation constellations is exploited to significantly reduce the complexity of the sequential Gaussian approximation (SGA) algorithm for near optimal symbol detection in spatial multiplexing multiple- input multiple-output (MIMO) system. We propose two multilevel SGA algorithms (MSGA) which are based on depth- first search (DFS) and breadth-first search (BFS) respectively. Additionally, an important methodological contribution to this multilevel technique is proposed where the mismatch between the pseudo symbols and the true symbols is taken into consideration for the computation of posterior probabilities of symbol combinations. We justify this from a theoretical perspective as well as with numerical results. Simulation results show that the performance of the two proposed multilevel algorithms can approach that of the optimal a posteriori probability (APP) detector while its total computation cost is at most 81% and 48% of that of the original SGA algorithm for 16QAM and 64QAM modulation MIMO systems with 4 transmit/receive antennas respectively.

Published in:

Wireless Communications, IEEE Transactions on  (Volume:7 ,  Issue: 3 )