On maximum-likelihood detection and the search for the closest lattice point

DOI10.1109/TIT.2003.817444zbMath1293.94028MaRDI QIDQ3546754

Hesham El Gamal, Mohamed Oussama Damen, Giuseppe Caire

Publication date: 21 December 2008

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Mathematics Subject Classification ID

90B40: Search theory

94A13: Detection theory in information and communication theory

94A40: Channel models (including quantum) in information and communication theory

Related Items

Codes in the Sum-Rank Metric: Fundamentals and Applications, Criterion for signal extraction in underdetermined mixtures of bounded support, Parallel Cholesky-based reduction for the weighted integer least squares problem, Low-complexity receivers for multiuser detection with an unknown number of active users, A low complexity branch-and-bound-based decoder for V-BLAST systems with PSK signals, Programmable processor implementations of \(K\)-best list sphere detector for MIMO receiver, A low complexity semidefinite relaxation for large-scale MIMO detection, On the number of lattice points in a small sphere and a recursive lattice decoding algorithm, Semi-blind maximum-likelihood joint channel/data estimation for correlated channels in multiuser MIMO networks, Implementation aspects of list sphere decoder algorithms for MIMO-OFDM systems, A new effective branch-and-bound algorithm to the high order MIMO detection problem, Multiple symbol differential detection based on sphere decoding for unitary space-time modulation, Euclidean distances and least squares problems for a given set of vectors, Peak-power reduction by the lattice-reduction-aided closest point search for MIMO broadcast channels