Lattice-reduction-aided K-best algorithm for low complexity and high performance communications
US9647732B2 · kind B2 · utility
4Cited by
2References
10Claims
0Family size
Assignee
Inventors
Key dates
| Filing date | Oct 17, 2014 |
| Grant date | May 9, 2017 |
| Priority date | — |
| Expiry date | Oct 17, 2034 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L27/38
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
Abstract
Systems and methods are disclosed for detecting a symbol in large-scale multiple-input multiple-output communication systems. The detection is based on an improved lattice-reduction-aided K-best algorithm. The detection finds K best candidate symbols with minimum costs for each layer based on a priority queue and an on-demand expansion. In a complex domain, the detection may include a 2-dimensional Schnorr-Euchner expansion or, in the alternative, a two-stage 1-dimensional Schnorr-Euchner expansion.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.