Change search
ReferencesLink to record
Permanent link

Direct link
Vanishing the gap to exact lattice search at a subexponential complexity: LR-aided regularized decoding
EURECOM, Sophia Antipolis, France.
EURECOM, Sophia Antipolis, France.
KTH, School of Electrical Engineering (EES), Signal Processing. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.ORCID iD: 0000-0001-6630-243X
2011 (English)In: 2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011, 2011, 531-538 p.Conference paper (Refereed)
Abstract [en]

This work identifies the first lattice decoding solution that achieves, in the most general outage-limited MIMO setting and the high rate and high SNR limit, both a vanishing gap to the error-performance of the exact solution of regularized lattice decoding, as well as a computational complexity that is subexponential in the number of codeword bits as well as the rate. The proposed solution employs lattice reduction (LR)-aided regularized (lattice) sphere decoding and proper timeout policies. In light of the fact that, prior to this work, a vanishing gap was generally attributed only to full lattice searches that have exponential complexity, in conjunction with the fact that subexponential complexity was generally attributed to early-terminated (linear) solutions which have though a performance gap that can be up to exponential in dimension and/or rate, the work constitutes the first proof that subexponential complexity need not come at the cost of exponential reductions in lattice decoding error performance. Finally, these performance and complexity guarantees hold for the most general MIMO setting, for all reasonable fading statistics, all channel dimensions, and all lattice codes.

Place, publisher, year, edition, pages
2011. 531-538 p.
National Category
URN: urn:nbn:se:kth:diva-91041DOI: 10.1109/Allerton.2011.6120212ScopusID: 2-s2.0-84863412613ISBN: 978-1-4577-1817-5OAI: diva2:507831
2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011. Monticello, IL. 28 September 2011 - 30 September 2011
QC 20120312Available from: 2012-03-06 Created: 2012-03-06 Last updated: 2012-03-12Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Jaldén, Joakim
By organisation
Signal ProcessingACCESS Linnaeus Centre

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 17 hits
ReferencesLink to record
Permanent link

Direct link