English
Related papers

Related papers: Reduced-complexity maximum-likelihood decoding for…

200 papers

Using precoding to suppress multi-user interference is a well-known technique to improve spectra efficiency in multiuser multiple-input multiple-output (MU-MIMO) systems, and the pursuit of high performance and low complexity precoding…

Information Theory · Computer Science 2022-07-11 Maojun Zhang , Jiabao Gao , Caijun Zhong

Massive multiuser (MU) multiple-input multiple-output (MIMO) promises significant improvements in spectral efficiency compared to small-scale MIMO. Typical massive MU-MIMO base-station (BS) designs rely on centralized linear data detectors…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-02-26 Kaipeng Li , Oscar Castaneda , Charles Jeon , Joseph R. Cavallaro , Christoph Studer

This paper studies maximum likelihood(ML) decoding in error-correcting codes as rational maps and proposes an approximate ML decoding rule by using a Taylor expansion. The point for the Taylor expansion, which will be denoted by $p$ in the…

Dynamical Systems · Mathematics 2010-06-30 Kazunori Hayashi , Yasuaki Hiraoka

Massive MIMO systems have made significant progress in increasing spectral and energy efficiency over traditional MIMO systems by exploiting large antenna arrays. In this paper we consider the joint maximum likelihood (ML) channel…

Information Theory · Computer Science 2014-11-26 Haider Ali Jasim Alshamary , Tareq Al-Naffouri , Alam Zaib , Weiyu Xu

Practical large-scale quantum computation requires both efficient error correction and robust implementation of logical operations. Three-dimensional (3D) color codes are a promising candidate for fault-tolerant quantum computation due to…

Quantum Physics · Physics 2025-12-23 Friederike Butt , Lars Esser , Markus Müller

Polar codes are of great interest since they are the first provably capacity-achieving forward error correction codes. To improve throughput and to reduce decoding latency of polar decoders, maximum likelihood (ML) decoding units are used…

Information Theory · Computer Science 2015-10-27 Chenrong Xiong , Jun Lin , Zhiyuan Yan

In this paper, we propose a framework of the mutual information-maximizing (MIM) quantized decoding for low-density parity-check (LDPC) codes by using simple mappings and fixed-point additions. Our decoding method is generic in the sense…

Information Theory · Computer Science 2022-02-15 Peng Kang , Kui Cai , Xuan He , Shuangyang Li , Jinhong Yuan

In this paper, we derive a maximum likelihood (ML) decoder of the differential data in a decode-and-forward (DF) based cooperative communication system utilizing uncoded transmissions. This decoder is applicable to complex-valued unitary…

Information Theory · Computer Science 2012-04-12 Manav R. Bhatnagar

Maximum-likelihood decoding is one of the central algorithmic problems in coding theory. It has been known for over 25 years that maximum-likelihood decoding of general linear codes is NP-hard. Nevertheless, it was so far unknown whether…

Computational Complexity · Computer Science 2007-07-16 Venkatesan Guruswami , Alexander Vardy

Multiple antenna (MIMO) devices are widely used to increase reliability and information bit rate. Optimal error rate performance (full diversity and large coding gain), for unknown channel state information at the transmitter and for…

Information Theory · Computer Science 2012-05-14 Dieter Duyck , Sheng Yang , Fambirai Takawira , Joseph J. Boutros , Marc Moeneclaey

We consider the problem of optimally decoding a quantum error correction code -- that is to find the optimal recovery procedure given the outcomes of partial "check" measurements on the system. In general, this problem is NP-hard. However,…

Quantum Physics · Physics 2009-11-13 David Poulin

Optimal data detection in multiple-input multiple-output (MIMO) communication systems with a large number of antennas at both ends of the wireless link entails prohibitive computational complexity. In order to reduce the computational…

Information Theory · Computer Science 2015-10-22 Charles Jeon , Ramina Ghods , Arian Maleki , Christoph Studer

Optimal decoding of bit interleaved coded modulation (BICM) MIMO-OFDM where an imperfect channel estimate is available at the receiver is investigated. First, by using a Bayesian approach involving the channel a posteriori density, we…

Networking and Internet Architecture · Computer Science 2007-08-13 Sajad Sadough , Pablo Piantanida , Pierre Duhamel

In this paper, we focus on the demodulation/decoding of the complex modulations/codes that approach the Shannon capacity. Theoretically, the maximum likelihood (ML) algorithm can achieve the optimal error performance whereas it has…

Information Theory · Computer Science 2022-06-14 Boxiang He , Zitao Wu , Fanggang Wang

In the near future, the $5^{th}$ generation (5G) wireless systems will be established. They will consist of an integration of different techniques, including distributed antenna systems and massive multiple-input multiple-output systems,…

Information Theory · Computer Science 2017-10-17 Amaro Barreal , Camilla Hollanti

In this paper, the asymptotic performance of the lattice sequential decoder for LAttice Space-Time (LAST) coded MIMO channel is analyzed. We determine the rates achievable by lattice coding and sequential decoding applied to such a channel.…

Information Theory · Computer Science 2015-03-17 Walid Abediseid , Mohamed Oussama Damen

This paper considers an uplink multiuser multiple-input-multiple-output (MU-MIMO) system with one-bit analog-to-digital converters (ADCs), in which $K$ users with a single transmit antenna communicate with one base station (BS) with $N_{\rm…

Information Theory · Computer Science 2017-07-14 S. Kim , N. Lee , S. -N. Hong

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

A set of linearly constrained permutation matrices are proposed for constructing a class of permutation codes. Making use of linear constraints imposed on the permutation matrices, we can formulate a minimum Euclidian distance decoding…

Information Theory · Computer Science 2015-03-17 Tadashi Wadayama , Manabu Hagiwara

Orthogonal signal-division multiplexing (OSDM) is an attractive alternative to conventional orthogonal frequency-division multiplexing (OFDM) due to its enhanced ability in peak-to-average power ratio (PAPR) reduction. Combining OSDM with…

Signal Processing · Electrical Eng. & Systems 2019-06-27 Jing Han , Shengqian Ma , Yujie Wang , Geert Leus