Title:
Lattice-reduction-aided K-best Algorithm For Low Complexity And High Performance Communications

dc.contributor.patentcreator Zhou, Qi
dc.contributor.patentcreator Ma, Xiaoli
dc.date.accessioned 2018-04-24T16:56:50Z
dc.date.available 2018-04-24T16:56:50Z
dc.date.filed 2014-10-17
dc.date.issued 2017-05-09
dc.description.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.
dc.description.assignee Georgia Tech Research Corporation
dc.identifier.cpc H04L27/38
dc.identifier.cpc H04L25/03242
dc.identifier.cpc H04L25/03891
dc.identifier.patentapplicationnumber 15/030034
dc.identifier.patentnumber 9647732
dc.identifier.uri http://hdl.handle.net/1853/59583
dc.title Lattice-reduction-aided K-best Algorithm For Low Complexity And High Performance Communications
dc.type Text
dc.type.genre Patent
dspace.entity.type Publication
local.contributor.corporatename Georgia Institute of Technology
local.relation.ispartofseries Georgia Tech Patents
relation.isOrgUnitOfPublication cc30e153-7a64-4ae2-9b1d-5436686785e3
relation.isSeriesOfPublication 0f49c79d-4efb-4bd9-b060-5c7f9191b9da
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
9647732.pdf
Size:
1.22 MB
Format:
Adobe Portable Document Format
Description: