English
Related papers

Related papers: Adaptive Switched Lattice Reduction-Aided Linear D…

200 papers

Recently, lattice-reduction-aided detectors have been proposed for multiple-input multiple-output (MIMO) systems to give performance with full diversity like maximum likelihood receiver, and yet with complexity similar to linear receivers.…

Data Structures and Algorithms · Computer Science 2007-07-13 Ying Hung Gan , Cong Ling , Wai Ho Mow

Multiple-input, multiple-output (MIMO) technology provides high data rate and enhanced QoS for wireless com- munications. Since the benefits from MIMO result in a heavy computational load in detectors, the design of low-complexity…

Hardware Architecture · Computer Science 2015-03-17 Ni-Chun Wang , Ezio Biglieri , Kung Yao

Recently, lattice reduction (LR) technique has caught great attention for multi-input multi-output (MIMO) receiver because of its low complexity and high performance. However, when the number of antennas is large, LR-aided linear detectors…

Information Theory · Computer Science 2013-04-04 Qi Zhou , Xiaoli Ma

Lattice reduction algorithms, such as the LLL algorithm, have been proposed as preprocessing tools in order to enhance the performance of suboptimal receivers in MIMO communications. In this paper we introduce a new kind of lattice…

Information Theory · Computer Science 2010-01-12 Laura Luzzi , Ghaya Rekaya-Ben Othman , Jean-Claude Belfiore

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

In this paper, we propose a new detection technique for multiuser multiple-input multiple-output (MU-MIMO) systems. The proposed scheme combines a lattice reduction (LR) transformation, which makes the channel matrix nearly orthogonal, and…

Information Theory · Computer Science 2014-12-09 L. Arevalo , R. C. de Lamare , R. Sampaio-Neto

Lattice reduction (LR) is a preprocessing technique for multiple-input multiple-output (MIMO) symbol detection to achieve better bit error-rate (BER) performance. In this paper, we propose a customized homogeneous multiprocessor for LR. The…

Information Theory · Computer Science 2015-01-21 Shahriar Shahabuddin , Janne Janhunen , Amanullah Ghazi , Zaheer Khan , Markku Juntti

A new architecture called integer-forcing (IF) linear receiver has been recently proposed for multiple-input multiple-output (MIMO) fading channels, wherein an appropriate integer linear combination of the received symbols has to be…

Information Theory · Computer Science 2013-07-16 Amin Sakzad , J. Harshan , Emanuele Viterbo

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

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

Lattice reduction is a popular preprocessing strategy in multiple-input multiple-output (MIMO) detection. In a quest for developing a low-complexity reduction algorithm for large-scale problems, this paper investigates a new framework…

Information Theory · Computer Science 2019-12-16 Shanxiang Lyu , Jinming Wen , Jian Weng , Cong Ling

Lenstra-Lenstra-Lovasz (LLL) algorithm, which is one of the lattice reduction (LR) techniques, has been extensively used to obtain better basis of the channel matrix. In this paper, we jointly apply Seysen's lattice reduction algorithm…

Information Theory · Computer Science 2011-01-06 HongSun An , Manar Mohaisen , KyungHi Chang

Over the last years, novel low-complexity approaches to the equalization of MIMO channels have gained much attention. Thereby, methods based on lattice basis reduction are of special interest, as they achieve the optimum diversity order. In…

Information Theory · Computer Science 2010-08-13 Robert F. H. Fischer

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

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

Multiple-input multiple-output (MIMO) systems are playing an increasing and interesting role in the recent wireless communication. The complexity and the performance of the systems are driving the different studies and researches. Lattices…

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

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

The work identifies the first general, explicit, and non-random MIMO encoder-decoder structures that guarantee optimality with respect to the diversity-multiplexing tradeoff (DMT), without employing a computationally expensive…

Information Theory · Computer Science 2016-11-18 Joakim Jalden , Petros Elia

In this paper, we propose an algorithm based on the Alternating Minimization technique to solve the uplink massive MIMO detection problem. The proposed algorithm provides a lower complexity compared to the conventional MMSE detection…

Information Theory · Computer Science 2019-02-26 Anis Elgabli , Ali Elghariani , Vaneet Aggarwal , Mark Bell
‹ Prev 1 2 3 10 Next ›