By Topic

A deterministic lower bound for the radius in sphere decoding search

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
$33 $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

5 Author(s)
Garcia, V.M. ; Dept. of Inf. Syst. & Comput., Univ. Politec. de Valencia, Valencia, Spain ; Roger, S. ; Trujillo, R.A. ; Vidal, A.M.
more authors

In this paper we examine the problem of MIMO detection with sphere decoding (SD) methods. These methods obtain the Maximum Likelihood solution in a reasonable time, through restriction of the space search to an hypersphere of a given radius, with center in the received signal. The performance of the sphere decoding algorithms will be acceptable only if the initial radius estimate is close to the final, optimal radius. Here we give a nontrivial lower bound for the radius, based only on the received signal and on the channel matrix, being then a purely deterministic estimate. This lower bound can be successfully integrated in some SD algorithms, providing a substantial decrease of the computational cost of the search.

Published in:

Advanced Technologies for Communications (ATC), 2010 International Conference on

Date of Conference:

20-22 Oct. 2010