English
Related papers

Related papers: Augmented Lattice Reduction for MIMO decoding

200 papers

Many powerful data detection algorithms employed in multiple-input multiple-output (MIMO) communication systems, such as sphere decoding (SD) and lattice-reduction (LR)-aided detection, were initially designed for infinite lattices.…

Information Theory · Computer Science 2008-11-27 Christoph Studer , Dominik Seethaler , Helmut Bölcskei

Vector perturbation (VP) precoding is a promising technique for multiuser communication systems operating in the downlink. In this work, we introduce a hybrid framework to improve the performance of lattice reduction (LR) aided precoding in…

Information Theory · Computer Science 2018-06-11 Shanxiang Lyu , Cong Ling

Quadratic form reduction and lattice reduction are fundamental tools in computational number theory and in computer science, especially in cryptography. The celebrated Lenstra-Lenstra-Lov\'asz reduction algorithm (so-called LLL) has been…

Data Structures and Algorithms · Computer Science 2019-05-29 Thomas Espitau , Antoine Joux

Multiple-input multiple-output (MIMO) systems are playing an important role in the recent wireless communication. The complexity of the different systems models challenge different researches to get a good complexity to performance balance.…

Information Theory · Computer Science 2016-07-13 Nizar Ouni , Ridha Bouallegue

This paper proposes spatial lattice modulation (SLM), a spatial modulation method for multipleinput-multiple-output (MIMO) systems. The key idea of SLM is to jointly exploit spatial, in-phase, and quadrature dimensions to modulate…

Information Theory · Computer Science 2018-05-23 Jiwook Choi , Yunseo Nam , Namyoon Lee

There exist two issues among popular lattice reduction (LR) algorithms that should cause our concern. The first one is Korkine-Zolotarev (KZ) and Lenstra-Lenstra-Lovasz (LLL) algorithms may increase the lengths of basis vectors. The other…

Information Theory · Computer Science 2017-10-12 Shanxiang Lyu , Cong Ling

The optimal diversity-multiplexing-delay tradeoff for the multi-input multi-output (MIMO) automatic repeat request (ARQ) channel can be achieved using incremental redundancy lattice space-time codes coupled with a list decoder for joint…

Information Theory · Computer Science 2016-11-17 Walid Abediseid , Mohamed Oussama Damen

Lattice codes with optimal decoding coefficient are capacity-achieving when dimension $N \rightarrow \infty$. In communications systems, finite dimensional lattice codes are considered, where the optimal decoding coefficients may still fail…

Information Theory · Computer Science 2025-01-09 Jiajie Xue , Brian M. Kurkoski

In multiple-input multiple-output (MIMO) fading channels maximum likelihood (ML) detection is desirable to achieve high performance, but its complexity grows exponentially with the spectral efficiency. The current state of the art in MIMO…

Information Theory · Computer Science 2007-07-13 Massimiliano Siti , Michael P. Fitz

We present a lattice algorithm specifically designed for some classical applications of lattice reduction. The applications are for lattice bases with a generalized knapsack-type structure, where the target vectors are boundably short. For…

Symbolic Computation · Computer Science 2010-02-04 Mark Van Hoeij , Andrew Novocin

The Lenstra-Lenstra-Lov\'asz (LLL) algorithm is the most practical lattice reduction algorithm in digital communications. In this paper, several variants of the LLL algorithm with either lower theoretic complexity or fixed-complexity…

Information Theory · Computer Science 2010-06-11 Cong Ling , Wai Ho Mow , Nick Howgrave-Graham

This paper considers a multiple-input multiple-output (MIMO) system with low-resolution analog-to-digital converters (ADCs). In this system, the paper presents a new MIMO detection approach using coding theory. The principal idea of the…

Information Theory · Computer Science 2016-10-26 Song-Nam Hong , Yo-Seb Jeon , Namyoon Lee

Lattice reduction-aided decoding features reduced decoding complexity and near-optimum performance in multi-input multi-output communications. In this paper, a quantitative analysis of lattice reduction-aided decoding is presented. To this…

Information Theory · Computer Science 2015-10-28 Cong Ling

This paper presents new low-complexity lattice-decoding algorithms for noncoherent block detection of QAM and PAM signals over complex-valued fading channels. The algorithms are optimal in terms of the generalized likelihood ratio test…

Information Theory · Computer Science 2009-11-13 Daniel J. Ryan , Iain B. Collings , I. Vaughan L. Clarkson

A novel detector for multiple-input multiple-output (MIMO) communications is presented. The algorithm belongs to the class of the lattice detectors, i.e. it finds a reduced complexity solution to the problem of finding the closest vector to…

Information Theory · Computer Science 2007-07-13 Massimiliano Siti , Michael P. Fitz

Despite its reduced complexity, lattice reduction-aided decoding exhibits a widening gap to maximum-likelihood (ML) performance as the dimension increases. To improve its performance, this paper presents randomized lattice decoding based on…

Information Theory · Computer Science 2016-11-17 Shuiyin Liu , Cong Ling , Damien Stehlé

Integer-forcing (IF) linear receiver has been recently introduced for multiple-input multiple-output (MIMO) fading channels. The receiver has to compute an integer linear combination of the symbols as a part of the decoding process. In…

Information Theory · Computer Science 2016-11-18 Amin Sakzad , J. Harshan , Emanuele Viterbo

Quantum annealing (QA) is proposed for vector perturbation precoding (VPP) in multiple input multiple output (MIMO) communications systems. The mathematical framework of VPP is presented, outlining the problem formulation and the benefits…

Information Theory · Computer Science 2024-02-15 Samuel Winter , Yangyishi Zhang , Gan Zheng , Lajos Hanzo

The credit on {\it reduction theory} goes back to the work of Lagrange, Gauss, Hermite, Korkin, Zolotarev, and Minkowski. Modern reduction theory is voluminous and includes the work of A. Lenstra, H. Lenstra and L. Lovasz who created the…

Computational Geometry · Computer Science 2017-02-14 Bal K. Khadka , Spyros M. Magliveras

Multiple-input multiple-output (MIMO) systems have been widely acclaimed in order to provide high data rates. Recently Lattice Reduction (LR) aided detectors have been proposed to achieve near Maximum Likelihood (ML) performance with low…

Information Theory · Computer Science 2016-02-22 Mehnaz Rahman , Gwan S. Choi