On maximum-likelihood detection and the search for the closest lattice point
From MaRDI portal
Publication:3546754
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)
Search theory (90B40) Detection theory in information and communication theory (94A13) Channel models (including quantum) in information and communication theory (94A40)
Related Items (16)
Euclidean distances and least squares problems for a given set of vectors ⋮ On the number of lattice points in a small sphere and a recursive lattice decoding algorithm ⋮ Large-dimensional random matrix theory and its applications in deep learning and wireless communications ⋮ An entropy-regularized ADMM for binary quadratic programming ⋮ Criterion for signal extraction in underdetermined mixtures of bounded support ⋮ A low complexity semidefinite relaxation for large-scale MIMO detection ⋮ 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 ⋮ Low-complexity receivers for multiuser detection with an unknown number of active users ⋮ Parallel Cholesky-based reduction for the weighted integer least squares problem ⋮ A low complexity branch-and-bound-based decoder for V-BLAST systems with PSK signals ⋮ Peak-power reduction by the lattice-reduction-aided closest point search for MIMO broadcast channels ⋮ Programmable processor implementations of \(K\)-best list sphere detector for MIMO receiver ⋮ Codes in the Sum-Rank Metric: Fundamentals and Applications
This page was built for publication: On maximum-likelihood detection and the search for the closest lattice point
