Minimum probability of error for asynchronous Gaussian multiple-access channels
IEEE Transactions on Information Theory
Pattern Recognition Letters
Multiuser Detection
IEEE Transactions on Signal Processing
IEEE Transactions on Signal Processing
IEEE Transactions on Signal Processing
A maximum likelihood digital receiver using coordinate ascent andthe discrete wavelet transform
IEEE Transactions on Signal Processing
A low-complexity enhancement to suboptimal CDMA receivers
IEEE Transactions on Wireless Communications
Iterative decoding for MIMO channels via modified sphere decoding
IEEE Transactions on Wireless Communications
Optimum asymptotic multiuser efficiency of randomly spread CDMA
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
IEEE Transactions on Information Theory
An effective multiuser receiver for DS/CDMA systems
IEEE Journal on Selected Areas in Communications
The application of semidefinite programming for detection in CDMA
IEEE Journal on Selected Areas in Communications
A Low-Complexity Detector for Large MIMO Systems and Multicarrier CDMA Systems
IEEE Journal on Selected Areas in Communications
Improvement on performance of modified Hopfield neural network for image restoration
IEEE Transactions on Image Processing
Hopfield neural network implementation of the optimal CDMA multiuser detector
IEEE Transactions on Neural Networks
IEEE Transactions on Communications
A tree-search algorithm for ML decoding in underdetermined MIMO systems
ISWCS'09 Proceedings of the 6th international conference on Symposium on Wireless Communication Systems
Multiple output selection-LAS algorithm in large MIMO systems
IEEE Communications Letters
Low-complexity dominance-based sphere decoder for MIMO systems
Signal Processing
Multicode Sparse-Sequence CDMA: Approach to Optimum Performance by Linearly Complex WSLAS Detectors
Wireless Personal Communications: An International Journal
| Hi-index | 0.00 |
In this paper, the bit error performance of a family of likelihood ascent search (LAS) multiuser detectors is analyzed. An upper bound on the BER of any LAS detector is obtained by bounding the fixed point region with the worst initial detector. The concept of indecomposable errors developed by Verdú is applied to tighten the upper bound. In a special instance, the upper bound is reduced to that for all the local maximum likelihood detectors. The upper bound is comparable with that of the optimum detector obtained by Verdú. A lower bound on the asymptotic multiuser efficiency (AME) is then obtained. It is shown that there are nontrivial CDMA channels such that a LAS detector can achieve unit AME regardless of user number. The AME lower bound provides a means for further seeking a good set of spreading sequences and power distribution for spectral and power efficient CDMA.