By Topic

Iterative MIMO sphere decoding throughput guarantees under realistic channel conditions

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

2 Author(s)
Rachid, M. ; Univ. of California, Los Angeles, CA, USA ; Daneshrad, B.

Block-based early termination has been proposed for depth-first based MIMO sphere decoders (SD) in order to provide throughput guarantees. We show in this letter that such termination incurs, even under simple tree and norm choices, significant overhead in the required number of iterations under realistic channel conditions due to the depth-first search's highly variable complexity (number of iterations to achieve a target performance). We propose the use of a constrained version of Dijkstra's metric-first search which exhibits indistinguishable performance while avoiding the impractical memory requirements of Dijkstra's search. We show that for a 4×4 64-subcarrier OFDM system, the proposed alternative achieves ~2x decrease in complexity as compared to the depth-first SD with block early termination for the same throughput guarantee.

Published in:

Communications Letters, IEEE  (Volume:14 ,  Issue: 4 )