A deterministic lower bound for the radius in sphere decoding search
- 1 October 2010
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21621020,p. 11-16
Abstract
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.Keywords
This publication has 12 references indexed in Scilit:
- Achieving a Continuous Diversity-Complexity Tradeoff in Wireless MIMO Systems via Pre-Equalized Sphere-DecodingIEEE Journal of Selected Topics in Signal Processing, 2009
- MIMO Detection Methods: How They Work [Lecture Notes]IEEE Signal Processing Magazine, 2009
- Speeding up the Sphere Decoder With $H^{\infty }$ and SDP Inspired Lower BoundsIEEE Transactions on Signal Processing, 2008
- Orthotope sphere decoding and parallelotope decoding—reduced complexity optimum detection algorithms for MIMO channelsSignal Processing, 2005
- On the sphere-decoding algorithm I. Expected complexityIEEE Transactions on Signal Processing, 2005
- On maximum-likelihood detection and the search for the closest lattice pointIEEE Transactions on Information Theory, 2003
- Closest point search in latticesIEEE Transactions on Information Theory, 2002
- Lattice basis reduction: Improved practical algorithms and solving subset sum problemsMathematical Programming, 1994
- Improved methods for calculating vectors of short length in a lattice, including a complexity analysisMathematics of Computation, 1985
- Improved algorithms for integer programming and related lattice problems1983