Lattice basis reduction: improved practical algorithms and solving subset sum problems
Mathematical Programming: Series A and B
On Limits of Wireless Communications in a Fading Environment when UsingMultiple Antennas
Wireless Personal Communications: An International Journal
Fundamentals of wireless communication
Fundamentals of wireless communication
An efficient square-root algorithm for BLAST
ICASSP '00 Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 02
Fast sequential decoding algorithm using a stack
IBM Journal of Research and Development
IEEE Transactions on Signal Processing
On the complexity of sphere decoding in digital communications
IEEE Transactions on Signal Processing
Decoding space-time codes with BLAST architectures
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
The Chase Family of Detection Algorithms for Multiple-Input Multiple-Output Channels
IEEE Transactions on Signal Processing
Generalized Parallel Interference Cancellation With Near-Optimal Detection Performance
IEEE Transactions on Signal Processing
Statistical Pruning for Near-Maximum Likelihood Decoding
IEEE Transactions on Signal Processing
Sphere Decoding With a Probabilistic Tree Pruning
IEEE Transactions on Signal Processing - Part I
Fixed-Complexity Soft MIMO Detection via Partial Marginalization
IEEE Transactions on Signal Processing - Part I
Reduced complexity closest point decoding algorithms for random lattices
IEEE Transactions on Wireless Communications
Probability of error in MMSE multiuser detection
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
On the distribution of SINR for the MMSE MIMO receiver and performance analysis
IEEE Transactions on Information Theory
A unified framework for tree search decoding: rediscovering the sequential decoder
IEEE Transactions on Information Theory
Algorithm and implementation of the K-best sphere decoding for MIMO detection
IEEE Journal on Selected Areas in Communications
High-throughput soft-output MIMO detector based on path-preserving trellis-search algorithm
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
| Hi-index | 35.68 |
In this paper, we consider a low-complexity detection technique referred to as a reduced dimension maximum-likelihood search (RD-MLS). RD-MLS is based on a partitioned search which approximates the maximum-likelihood (ML) estimate of symbols by searching a partitioned symbol vector space rather than that spanned by the whole symbol vector. The inevitable performance loss due to a reduction in the search space is compensated by 1) the use of a list tree search, which is an extension of a single best searching algorithm called sphere decoding, and 2) the recomputation of a set of weak symbols, i.e., those ignored in the reduced dimension search, for each strong symbol candidate found during the list tree search. Through simulations on M-quadrature amplitude modulation (QAM) transmission in frequency nonselective multi-input-multioutput (MIMO) channels, we demonstrate that the RD-MLS algorithm shows near constant complexity over a wide range of bit error rate (BER) (10-1 ∼ 10-4), while limiting performance loss to within 1 dB from ML detection.