On maximum-likelihood detection and the search for the closest lattice point
From MaRDI portal
Publication:3546754
Cited in
(17)- Implementation aspects of list sphere decoder algorithms for MIMO-OFDM systems
- Codes in the sum-rank metric: fundamentals and applications
- Euclidean distances and least squares problems for a given set of vectors
- Large-dimensional random matrix theory and its applications in deep learning and wireless communications
- Low-complexity receivers for multiuser detection with an unknown number of active users
- Programmable processor implementations of \(K\)-best list sphere detector for MIMO receiver
- Peak-power reduction by the lattice-reduction-aided closest point search for MIMO broadcast channels
- An entropy-regularized ADMM for binary quadratic programming
- Parallel Cholesky-based reduction for the weighted integer least squares problem
- On the number of lattice points in a small sphere and a recursive lattice decoding algorithm
- A low complexity branch-and-bound-based decoder for V-BLAST systems with PSK signals
- A new effective branch-and-bound algorithm to the high order MIMO detection problem
- Criterion for signal extraction in underdetermined mixtures of bounded support
- A low complexity semidefinite relaxation for large-scale MIMO detection
- An ADMM based method for underdetermined box-constrained integer least squares problems
- Multiple symbol differential detection based on sphere decoding for unitary space-time modulation
- Semi-blind maximum-likelihood joint channel/data estimation for correlated channels in multiuser MIMO networks
This page was built for publication: On maximum-likelihood detection and the search for the closest lattice point
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3546754)
