English
Related papers

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

200 papers

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

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

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

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

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

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

Lattice reduction algorithms have numerous applications in number theory, algebra, as well as in cryptanalysis. The most famous algorithm for lattice reduction is the LLL algorithm. In polynomial time it computes a reduced basis with…

Cryptography and Security · Computer Science 2012-12-21 Felix Fontein , Michael Schneider , Urs Wagner

This paper presents a low complexity detector for multiple-input multiple-output (MIMO) systems based on the recently proposed orthogonal time frequency space (OTFS) modulation. In the proposed detector, the copies of the transmitted…

Signal Processing · Electrical Eng. & Systems 2022-01-28 Tharaj Thaj , Emanuele Viterbo

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

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

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

In this paper, we propose low-complexity local detectors and log-likelihood ratio (LLR) refinement techniques for a coded cell-free massive multiple input multiple output (CF- mMIMO) systems, where an iterative detection and decoding (IDD)…

Information Theory · Computer Science 2024-05-24 T. Ssettumba , Z. Shao , L. Landau , R. C. de Lamare

Lattice reduction algorithms have numerous applications in number theory, algebra, as well as in cryptanalysis. The most famous algorithm for lattice reduction is the LLL algorithm. In polynomial time it computes a reduced basis with…

Cryptography and Security · Computer Science 2013-07-30 Felix Fontein , Michael Schneider , Urs Wagner

The theoretic results of MIMO capacity tell us that the higher the number of antennas are employed, the higher the transmission rate is. This makes MIMO systems with hundreds of antennas very attractive but one of the major problems that…

Information Theory · Computer Science 2012-04-19 Puripong Suthisopapan , Anupap Meesomboon , Kenta Kasai , Virasit Imtawil

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

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

Massive Multiple-input Multiple-output (MIMO) systems offer exciting opportunities due to their high spectral efficiencies capabilities. On the other hand, one major issue in these scenarios is the high-complexity detectors of such systems.…

Information Theory · Computer Science 2015-01-27 A. Amorim Pereira , R. Sampaio-Neto

Multiple-input multiple-output (MIMO) system is the key technology for long term evolution (LTE) and 5G. The information detection problem at the receiver side is in general difficult due to the imbalance of decoding complexity and decoding…

Signal Processing · Electrical Eng. & Systems 2019-03-20 Qian Chen , Shunqing Zhang , Shugong Xu , Shan Cao

V-BLAST detection method suffers large computational complexity due to its successive detection of symbols. In this paper, we propose a modified V-BLAST algorithm to decrease the computational complexity by reducing the number of detection…

Information Theory · Computer Science 2015-04-08 Karam Ahmed , Sherif Abuelenin , Heba Soliman , Khairy Al-Barbary

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