Pages that link to "Item:Q3546754"
From MaRDI portal
The following pages link to On maximum-likelihood detection and the search for the closest lattice point (Q3546754):
Displayed 14 items.
- Criterion for signal extraction in underdetermined mixtures of bounded support (Q635078) (← links)
- Parallel Cholesky-based reduction for the weighted integer least squares problem (Q727439) (← links)
- Low-complexity receivers for multiuser detection with an unknown number of active users (Q985473) (← links)
- A low complexity branch-and-bound-based decoder for V-BLAST systems with PSK signals (Q1005785) (← links)
- Programmable processor implementations of \(K\)-best list sphere detector for MIMO receiver (Q1048814) (← links)
- A low complexity semidefinite relaxation for large-scale MIMO detection (Q1702828) (← links)
- On the number of lattice points in a small sphere and a recursive lattice decoding algorithm (Q1934244) (← links)
- Semi-blind maximum-likelihood joint channel/data estimation for correlated channels in multiuser MIMO networks (Q1957242) (← links)
- Implementation aspects of list sphere decoder algorithms for MIMO-OFDM systems (Q1957283) (← links)
- A new effective branch-and-bound algorithm to the high order MIMO detection problem (Q2012893) (← links)
- Multiple symbol differential detection based on sphere decoding for unitary space-time modulation (Q2267013) (← links)
- Euclidean distances and least squares problems for a given set of vectors (Q2382757) (← links)
- Peak-power reduction by the lattice-reduction-aided closest point search for MIMO broadcast channels (Q2519418) (← links)
- Codes in the Sum-Rank Metric: Fundamentals and Applications (Q5863766) (← links)