Low-complexity dominance-based sphere decoder for MIMO systems

Authors:
Gianmarco Romano;Domenico Ciuonzo;Pierluigi Salvo Rossi;Francesco Palmieri
Affiliations:
Department of Industrial and Information Engineering, Second University of Naples, via Roma, 29, 81031 Aversa (CE), Italy;Department of Industrial and Information Engineering, Second University of Naples, via Roma, 29, 81031 Aversa (CE), Italy;Department of Industrial and Information Engineering, Second University of Naples, via Roma, 29, 81031 Aversa (CE), Italy;Department of Industrial and Information Engineering, Second University of Naples, via Roma, 29, 81031 Aversa (CE), Italy
Venue:
Signal Processing
Year:
2013

Citing 19
Cited 0

Lattice basis reduction: improved practical algorithms and solving subset sum problems

Mathematical Programming: Series A and B
Multiuser Detection

Multiuser Detection
MIMO Wireless Communications

MIMO Wireless Communications
Efficient near maximum-likelihood detection for underdetermined MIMO antenna systems using a geometrical approach

EURASIP Journal on Wireless Communications and Networking
A family of likelihood ascent search multiuser detectors: an upper bound of bit error rate and a lower bound of asymptotic multiuser efficiency

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
On the complexity of sphere decoding in digital communications

IEEE Transactions on Signal Processing
On the sphere-decoding algorithm I. Expected complexity

IEEE Transactions on Signal Processing - Part I
On the sphere-decoding algorithm II. Generalizations, second-order statistics, and applications to communications

IEEE Transactions on Signal Processing - Part I
A Low-Complexity High-Performance Preprocessing Algorithm for Multiuser Detection Using Gold Sequences

IEEE Transactions on Signal Processing
Keyholes, correlations, and capacities of multielement transmit and receive antennas

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 unified framework for tree search decoding: rediscovering the sequential decoder

IEEE Transactions on Information Theory
Maximum likelihood sequence estimation from the lattice viewpoint

IEEE Transactions on Information Theory
Algorithm and implementation of the K-best sphere decoding for MIMO detection

IEEE Journal on Selected Areas in Communications
Soft-output sphere decoding: algorithms and VLSI implementation

IEEE Journal on Selected Areas in Communications
Hopfield neural network implementation of the optimal CDMA multiuser detector

IEEE Transactions on Neural Networks

Quantified Score

Hi-index	0.08

Visualization

Abstract

The sphere decoder (SD) is an attractive low-complexity alternative to maximum likelihood (ML) detection in a variety of communication systems. It is also employed in multiple-input multiple-output (MIMO) systems where the computational complexity of the optimum detector grows exponentially with the number of transmit antennas. We propose an enhanced version of the SD based on an additional cost function derived from conditions on worst case interference that we call dominance conditions. The proposed detector, the king sphere decoder (KSD), has a computational complexity that results to be not larger than the complexity of the sphere decoder and numerical simulations show that the complexity reduction is usually quite significant.