English
Related papers

Related papers: On Low-complexity Lattice Reduction Algorithms for…

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

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

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

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

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

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

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

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

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 family of low-complexity detection schemes based on channel matrix puncturing targeted for large multiple-input multiple-output (MIMO) systems is proposed. It is well-known that the computational cost of MIMO detection based on QR…

Information Theory · Computer Science 2017-12-07 H. Sarieddeen , M. M. Mansour , A. Chehab

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

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

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

A lattice is a set of all the integer linear combinations of certain linearly independent vectors. One of the most important concepts on lattice is the successive minima which is of vital importance from both theoretical and practical…

Information Theory · Computer Science 2018-05-16 Jinming Wen

In Multiple-Input Multiple-Output (MIMO) systems, Sphere Decoding (SD) can achieve performance equivalent to full search Maximum Likelihood (ML) decoding, with reduced complexity. Several researchers reported techniques that reduce the…

Information Theory · Computer Science 2015-03-13 Boyu Li , Ender Ayanoglu

We propose a recursive lattice reduction framework for finding short non-zero vectors or dense sublattices of a lattice. The framework works by recursively searching for dense sublattices of dense sublattices (or their duals) with…

Data Structures and Algorithms · Computer Science 2025-04-22 Divesh Aggarwal , Thomas Espitau , Spencer Peters , Noah Stephens-Davidowitz

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

In this paper, we present a low-complexity algorithm for detection in high-rate, non-orthogonal space-time block coded (STBC) large-MIMO systems that achieve high spectral efficiencies of the order of tens of bps/Hz. We also present a…

Information Theory · Computer Science 2015-05-13 Saif K. Mohammed , Ahmed Zaki , A. Chockalingam , B. Sundar Rajan
‹ Prev 1 2 3 10 Next ›