English
Related papers

Related papers: Fixed Point Realization of Iterative LR-Aided Soft…

200 papers

Targeting always the best achievable bit error rate (BER) performance in iterative receivers operating over multiple-input multiple-output (MIMO) channels may result in significant waste of resources, especially when the achievable BER is…

Information Theory · Computer Science 2012-10-05 Konstantinos Nikitopoulos , Gerd Ascheid

In this paper, the spectral efficiency of permutation modulation-based multiple input multiple output (MIMO) visible light communication is improved using systematically designed, multiweight codeword matrices. Soft-decision, low-complexity…

Signal Processing · Electrical Eng. & Systems 2020-07-01 Oluwafemi Kolade , Ling Cheng

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

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 Multi-Input Multi-Output (MIMO) systems, Maximum-Likelihood (ML) decoding is equivalent to finding the closest lattice point in an N-dimensional complex space. In general, this problem is known to be NP hard. In this paper, we propose a…

Information Theory · Computer Science 2007-07-13 Amin Mobasher , Mahmoud Taherzadeh , Renata Sotirov , Amir K. Khandani

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

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

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

This paper presents a hardware architecture of complex K-best Multiple Input Multiple Output (MIMO) decoder reducing the complexity of Maximum Likelihood (ML) detector. We develop a novel low-power VLSI design of complex K-best decoder for…

Information Theory · Computer Science 2016-02-22 Mehnaz Rahman , Gwan S. Choi

In this paper two complexity efficient soft sphere-decoder modifications are proposed for computing the max-log LLR values in iterative MIMO systems, which avoid the costly, typically needed, full enumeration and sorting (FES) procedure…

Networking and Internet Architecture · Computer Science 2012-10-05 Konstantinos Nikitopoulos , Dan Zhang , I-Wei Lai , Gerd Ascheid

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

In this paper, a derandomized algorithm for sampling decoding is proposed to achieve near-optimal performance in lattice decoding. By setting a probability threshold to sample candidates, the whole sampling procedure becomes deterministic,…

Information Theory · Computer Science 2016-11-17 Zheng Wang , Shuiyin Liu , Cong Ling

Multiple-input multiple-output (MIMO) technology has been regarded as one of the most important technologies to enable emerging applications in current and next generation wireless communication systems, for which signal detection methods…

Signal Processing · Electrical Eng. & Systems 2026-01-13 Yanze Zhu , Hufei Zhu , Qingqing Wu , Yikui Zhai , Wen Chen , Yang Liu

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

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

Soft-input soft-output (SISO) detection algorithms form the basis for iterative decoding. The computational complexity of SISO detection often poses significant challenges for practical receiver implementations, in particular in the context…

Information Theory · Computer Science 2009-06-05 Christoph Studer , Helmut Bölcskei

Tree-based demappers for multiple-input multiple-output (MIMO) detection such as the sphere decoder can achieve near-optimal performance but incur high computational cost due to their sequential nature. In this paper, we propose the…

Information Theory · Computer Science 2022-09-12 Daniel E. Worrall , Markus Peschl , Arash Behboodi , Roberto Bondesan

In this paper we present a novel method for decoding multiple input - multiple output (MIMO) transmission, which combines sphere decoding (SD) and zero forcing (ZF) techniques to provide near optimal low complexity and high performance…

Information Theory · Computer Science 2008-03-03 Vadim Neder , Doron Ezri , Motti Haridim
‹ Prev 1 2 3 10 Next ›