Numerical recipes: the art of scientific computing
Numerical recipes: the art of scientific computing
Minkowski's convex body theorem and integer programming
Mathematics of Operations Research
Sphere-packings, lattices, and groups
Sphere-packings, lattices, and groups
Improved algorithms for integer programming and related lattice problems
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
A generalized lattice decoder for asymmetrical space-time communication architecture
ICASSP '00 Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05
On the complexity of sphere decoding in digital communications
IEEE Transactions on Signal Processing
On the complexity of decoding lattices using the Korkin-Zolotarev reduced basis
IEEE Transactions on Information Theory
A universal lattice code decoder for fading channels
IEEE Transactions on Information Theory
Closest point search in lattices
IEEE Transactions on Information Theory
Blind adaptive multiuser detection
IEEE Transactions on Information Theory
Multi-user detection for DS-CDMA communications
IEEE Communications Magazine
| Hi-index | 0.08 |
The complexity of maximum likelihood detection (MLD) in multiple input multiple output (MIMO) systems with N transmit antennas typically grows exponentially with N. This makes MLD too complex to implement, particularly if higher order modulation schemes such as quadrature amplitude modulation are employed. Recently, generalised sphere decoding (GSD) was proposed, which provides the same performance as MLD, but complexity is only a polynomial function of N for small values of N. This is achieved by only considering lattice points that lie within a hypersphere centred at the received signal. Determining which lattice points lie within the sphere requires a complex distance calculation, so this paper investigates an different approach, called parallelotope decoding (PD) or alternatively the Kannan strategy. This method fits a parallelotope around the sphere, and simplifies the distance calculation. It turns out that PD performs poorly under certain channel conditions, so a novel hybrid scheme called orthotope sphere decoding is also proposed. This decoder is a hybrid of PD and GSD and is usually the most cost effective of the four optimal algorithms under discussion. Simulation results are presented to compare the performance and complexity of the optimal detectors described in the paper and the sub-optimal V-BLAST algorithm.