English
Related papers

Related papers: Complex Lattice Reduction Algorithm for Low-Comple…

200 papers

Lattice reduction (LR) aided multiple-input-multiple-out (MIMO) linear detection can achieve the maximum receive diversity of the maximum likelihood detection (MLD). By emloying the most commonly used Lenstra, Lenstra, and L. Lovasz (LLL)…

Information Theory · Computer Science 2013-04-25 Keke Zu , Rodrigo C. de Lamare

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

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

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

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

Low-complexity precoding {algorithms} are proposed in this work to reduce the computational complexity and improve the performance of regularized block diagonalization (RBD) {based} precoding {schemes} for large multi-user {MIMO} (MU-MIMO)…

Information Theory · Computer Science 2013-04-25 Keke Zu , Rodrigo C. de Lamare , Martin Haardt

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

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

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

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 simple scheme for communication over MIMO broadcast channels is introduced which adopts the lattice reduction technique to improve the naive channel inversion method. Lattice basis reduction helps us to reduce the average transmitted…

Information Theory · Computer Science 2016-11-15 Mahmoud Taherzadeh , Amin Mobasher , Amir K. Khandani

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

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 work considers multiple-input multiple-output (MIMO) communication systems using hierarchical modulation. A disadvantage of the maximum-likelihood (ML) MIMO detector is that computational complexity increases exponentially with the…

Information Theory · Computer Science 2016-02-24 Yigit Ugur , Ali Ozgur Yilmaz

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

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

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 this thesis, we investigate the problem of efficient data detection in large MIMO and high order MU-MIMO systems. First, near-optimal low-complexity detection algorithms are proposed for regular MIMO systems. Then, a family of…

Information Theory · Computer Science 2021-10-26 Hadi Sarieddeen

Diversity order is an important measure for the performance of communication systems over MIMO fading channels. In this paper, we prove that in MIMO multiple access systems (or MIMO point-to-point systems with V-BLAST transmission),…

Information Theory · Computer Science 2016-11-15 Mahmoud Taherzadeh , Amin Mobasher , Amir K. Khandani

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
‹ Prev 1 2 3 10 Next ›