Multistream faster than Nyquist signaling
IEEE Transactions on Communications
A new quasi-optimal detection algorithm for a non orthogonal spectrally efficient FDM
ISCIT'09 Proceedings of the 9th international conference on Communications and information technologies
A reduced-complexity MIMO receiver via channel ordering
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Spectrally efficient FDM signals: bandwidth gain at the expense of receiver complexity
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Semidefinite relaxation based multiuser detection for M-ary PSK multiuser systems
IEEE Transactions on Signal Processing - Part I
On the complexity of sphere decoding in digital communications
IEEE Transactions on Signal Processing
Speeding up the Sphere Decoder With H∞ and SDP Inspired Lower Bounds
IEEE Transactions on Signal Processing
Hi-index | 0.00 |
This letter proposes a fast constrained sphere decoder for ill conditioned communications systems that exhibits less complexity than but similar performance to the generalised sphere decoder. The operational principle is based on i) the reduction of the search space by setting the hypersphere initial radius to be equal to the distance to a semidefinite program (SDP) estimate; and ii) the introduction of a heuristic pruning rule to limit the GSD spanning tree. The new algorithm achieves significant reduction in the required computational effort at the expense of a small error penalty for large dimensional systems in low signal to noise ratio (SNR) regimes.