Show simple item record

dc.date.accessioned2018-04-24T16:56:52Z
dc.date.available2018-04-24T16:56:52Z
dc.date.issued2017-07-11
dc.identifier.urihttp://hdl.handle.net/1853/59593
dc.description.abstractEmbodiments of the present invention provide efficient greedy LLL algorithms that not only converge faster but also exhibit much lower complexity than the existing greedy LLL variants while similar error performance is maintained. First, a relaxed Lovász condition is designed for searching the candidate set of LLL iterations with column swap operations. This relaxation does not need size reduction operations so that it can save complexity compared to the existing greedy LLL algorithms. Further, a relaxed criterion of the decrease in LLL potential is designed to select the optimal one in the candidate set of LLL iterations, which also exhibits lower complexity than the existing greedy LLL algorithms. Furthermore, simulations show that the inventive algorithm needs less LLL iterations compared to the existing greedy LLL algorithms.
dc.titleMulti-input Multi-output (mimo) Detection Systems
dc.typePatent
dc.contributor.patentcreatorMa, Xiaoli
dc.contributor.patentcreatorWen, Qingsong
dc.identifier.patentnumber9705646
dc.description.assigneeGeorgia Tech Research Corporation
dc.identifier.patentapplicationnumber15/056986
dc.date.filed2016-02-29
dc.identifier.cpcH04L1/203
dc.identifier.cpcH04L25/0246
dc.identifier.cpcH04B7/0413


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record