By Topic

Performance and Complexity Analysis of Infinity-Norm Sphere-Decoding

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)
Seethaler, D. ; Inst. of Commun. & Radio-Freq. Eng., Vienna Univ. of Technol., Vienna, Austria ; Bolcskei, H.

Promising approaches for efficient detection in multiple-input multiple-output (MIMO) wireless systems are based on sphere-decoding (SD). The conventional (and optimum) norm that is used to conduct the tree traversal step in SD is the l 2 -norm. It was, however, recently observed that using the l ¿-norm instead reduces the hardware complexity of SD considerably at only a marginal performance loss. These savings result from a reduction in the length of the critical path in the circuit and the silicon area required for metric computation, but are also, as observed previously through simulation results, a consequence of a reduction in the computational (i.e., algorithmic) complexity. The aim of this paper is an analytical performance and computational complexity analysis of l ¿-norm SD. For independent and identically distributed (i.i.d.) Rayleigh fading MIMO channels, we show that l ¿-norm SD achieves full diversity order with an asymptotic SNR gap, compared to l 2-norm SD, that increases at most linearly in the number of receive antennas. Moreover, we provide a closed-form expression for the computational complexity of l ¿-norm SD based on which we establish that its complexity scales exponentially in the system size. Finally, we characterize the tree pruning behavior of l ¿-norm SD and show that it behaves fundamentally different from that of l 2-norm SD.

Published in:

Information Theory, IEEE Transactions on  (Volume:56 ,  Issue: 3 )