Title:
Lattice-reduction-aided K-best Algorithm For Low Complexity And High Performance Communications
Lattice-reduction-aided K-best Algorithm For Low Complexity And High Performance Communications
Files
Authors
Authors
Advisors
Advisors
Associated Organizations
Organizational Unit
Series
Series
Collections
Supplementary to
Permanent Link
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.
Sponsor
Date Issued
2017-05-09
Extent
Resource Type
Text
Resource Subtype
Patent