English
Related papers

Related papers: Modified LLL algorithm with shifted start column

200 papers

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

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

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

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

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

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

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 (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

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

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

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

As a typical application, the Lenstra-Lenstra-Lovasz lattice basis reduction algorithm (LLL) is used to compute a reduced basis of the orthogonal lattice for a given integer matrix, via reducing a special kind of lattice bases. With such…

Symbolic Computation · Computer Science 2018-05-10 Jingwei Chen , Damien Stehlé , Gilles Villard

Lattices are a popular field of study in mathematical research, but also in more practical areas like cryptology or multiple-input/multiple-output (MIMO) transmission. In mathematical theory, most often lattices over real numbers are…

Information Theory · Computer Science 2022-08-19 Sebastian Stern , Cong Ling , Robert F. H. Fischer

Large-scale multiple-input multiple-output (MIMO) is an emerging wireless technology that deploys thousands of transmit antennas at the base-station to boost spectral efficiency. The classic weighted minimum mean-square-error (WMMSE)…

Information Theory · Computer Science 2025-03-17 Yi Feng , Kaiming Shen

Matrix-variate optimization plays a central role in advanced wireless system designs. In this paper, we aim to explore optimal solutions of matrix variables under two special structure constraints using complex matrix derivatives, including…

Information Theory · Computer Science 2023-11-21 Xin Ju , Shiqi Gong , Nan Zhao , Chengwen Xing , Arumugam Nallanathan , Dusit Niyato

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

This paper presents a novel adaptive reduced-rank {multi-input multi-output} (MIMO) equalization scheme and algorithms based on alternating optimization design techniques for MIMO spatial multiplexing systems. The proposed reduced-rank…

Information Theory · Computer Science 2013-01-15 Rodrigo C. de Lamare , Raimundo Sampaio-Neto

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

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