Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published March 2005 | Published
Book Section - Chapter Open

A branch and bound approach to speed up the sphere decoder

Abstract

In many communications applications, maximum-likelihood decoding reduces to solving an integer least-squares problem which is NP hard in the worst-case. However, as has recently been shown, over a wide range of dimensions and SNRs, the sphere decoder can be used to find the exact solution with an expected complexity that is roughly cubic in the dimension of the problem. However, the computational complexity becomes prohibitive if the SNR is too low and/or if the dimension of the problem is too large. We target these two regimes and attempt to find faster algorithms by pruning the search tree beyond what is done in the standard sphere decoder. The search tree is pruned by computing lower bounds on the possible optimal solution as we proceed down the tree. We observe a trade-off between the computational complexity required to compute the lower bound and the size of the pruned tree: the more effort spent computing a tight lower bound, the more branches that can be eliminated in the tree. Thus, even though it is possible to prune the search tree (and hence the number of points visited) by several orders of magnitude, this may be offset by the computations required to perform the pruning. All of which suggests the need for computationally-efficient tight lower bounds. We present three different lower bounds (based on spherical-relaxation, polytope-relaxation and duality), simulate their performances and discuss their relative merits.

Additional Information

© 2005 IEEE. This work was supported in part by the National Science Foundation under grant no. CCR-0133818, by the Office of Naval Research under grant no. N00014-02-1-0578, and by Caltech's Lee Center for Advanced Networking.

Attached Files

Published - A_branch_and_bound_approach_to_speed_up_the_sphere_decoder.pdf

Files

A_branch_and_bound_approach_to_speed_up_the_sphere_decoder.pdf
Files (303.3 kB)

Additional details

Created:
August 19, 2023
Modified:
March 5, 2024