An efficient square-root algorithm for BLAST
ICASSP '00 Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 02
On the complexity of sphere decoding in digital communications
IEEE Transactions on Signal Processing
Efficient detection algorithms for MIMO channels: a geometrical approach to approximate ML detection
IEEE Transactions on Signal Processing
On the sphere-decoding algorithm I. Expected complexity
IEEE Transactions on Signal Processing - Part I
IEEE Transactions on Signal Processing - Part I
Multiuser detection techniques using maximum likelihood sphere decoding in multicarrier CDMA systems
IEEE Transactions on Wireless Communications
Iterative decoding for MIMO channels via modified sphere decoding
IEEE Transactions on Wireless Communications
A universal lattice code decoder for fading channels
IEEE Transactions on Information Theory
Closest point search in lattices
IEEE Transactions on Information Theory
On maximum-likelihood detection and the search for the closest lattice point
IEEE Transactions on Information Theory
A List Sphere Decoding Algorithm with Improved Radius Setting Strategies
Wireless Personal Communications: An International Journal
| Hi-index | 0.00 |
For underdetermined linear systems, original sphere decoding (SD) algorithms fail due to zero diagonal elements in the upper-triangular matrix of the QR or Cholesky factorization of the underdetermined matrix. To solve this problem, this paper presents a low-complexity generalized sphere decoding (GSD) approach by transforming the original underdetermined problem into the full-column-rank one so that standard SD can be directly applied on the transformed problem. Since the introduced transformation maintains the dimension of the original problem for all M-QAM's, the proposed GSD approach provides significant reduction in complexity as compared to other GSD schemes, especially for M-QAM with large signaling constellation. Both performance and expected complexity are analyzed to provide the comprehensive relationships between the performance and complexity of the proposed GSD and its parameters. Illustrative simulation and analytical results are in good agreement in terms of both the performance and complexity and indicate that with the properly selected design parameters, the proposed GSD scheme can approach the optimum maximum-likelihood decoding (MLD) performance with low complexity for underdetermined linear communication systems including underdetermined MIMO systems, and the proposed expected complexity analysis can be used as reliable complexity estimation for practical implementation of the proposed algorithm and serve as reference for other GSD algorithms.