English
Related papers

Related papers: Proximal Decoding for LDPC-coded Massive MIMO Chan…

200 papers

In this paper, we propose an efficient decoding algorithm for short low-density parity check (LDPC) codes by carefully combining the belief propagation (BP) decoding and order statistic decoding (OSD) algorithms. Specifically, a modified BP…

Information Theory · Computer Science 2023-09-06 Weiyang Zhang , Chentao Yue , Yonghui Li , Branka Vucetic

We propose iterative detection and decoding (IDD) algorithms with Low-Density Parity-Check (LDPC) codes for Multiple Input Multiple Output (MIMO) systems operating in block-fading and fast Rayleigh fading channels. Soft-input soft-output…

Information Theory · Computer Science 2016-11-17 André Uchoa , Cornelius T. Healy , Rodrigo C. de Lamare

We propose a data-driven algorithm for the maximum a posteriori (MAP) estimation of stochastic processes from noisy observations. The primary statistical properties of the sought signal is specified by the penalty function (i.e., negative…

Machine Learning · Computer Science 2018-02-14 Ha Q. Nguyen , Emrah Bostan , Michael Unser

Recent works showed how low-density parity-check (LDPC) erasure correcting codes, under maximum likelihood (ML) decoding, are capable of tightly approaching the performance of an ideal maximum-distance-separable code on the binary erasure…

Information Theory · Computer Science 2008-04-21 Enrico Paolini , Gianluigi Liva , Michela Varrella , Balazs Matuz , Marco Chiani

In this paper we propose a new efficient message passing algorithm for decoding LDPC transmitted over a channel with strong phase noise. The algorithm performs approximate bayesian inference on a factor graph representation of the channel…

Information Theory · Computer Science 2012-04-13 Shachar Shayovitz , Dan Raphaeli

In this paper, we propose a MIMO receiver algorithm that exploits {\em channel hardening} that occurs in large MIMO channels. Channel hardening refers to the phenomenon where the off-diagonal terms of the ${\bf H}^H{\bf H}$ matrix become…

Information Theory · Computer Science 2014-01-13 T. Lakshmi Narasimhan , A. Chockalingam

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

We consider joint detection of co-channel signals---specifically, signals which do not possess a natural separability due to, for example, the multiple access technique or the use of multiple antennas. Iterative joint detection and decoding…

Information Theory · Computer Science 2015-08-17 Daniel J. Jakubisin , R. Michael Buehrer

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

For the practical implementation of massive multiple-input multiple-output (MIMO) systems, the hybrid processing (precoding/combining) structure is promising to reduce the high cost rendered by large number of RF chains of the traditional…

Information Theory · Computer Science 2015-04-16 Weiheng Ni , Xiaodai Dong , Wu-Sheng Lu

A new algorithm for efficient exact maximum likelihood decoding of polar codes (which may be CRC augmented), transmitted over the binary erasure channel, is presented. The algorithm applies a matrix triangulation process on a sparse polar…

Information Theory · Computer Science 2021-06-29 Yonatan Urman , David Burshtein

Recently, considerable research efforts have been devoted to the design of methods to learn from data overcomplete dictionaries for sparse coding. However, learned dictionaries require the solution of an optimization problem for coding new…

Machine Learning · Computer Science 2010-11-17 Curzio Basso , Matteo Santoro , Alessandro Verri , Silvia Villa

Massive MIMO is a variant of multiuser MIMO, where the number of antennas $M$ at the base-station is large, and generally much larger than the number of spatially multiplexed data streams to/from the users. It has been observed that in many…

Information Theory · Computer Science 2017-07-25 Saeid Haghighatshoar , Giuseppe Caire

It is known that circularly symmetric Gaussian signals are the optimal input signals for the partial decode-and-forward (PDF) coding scheme in the Gaussian multiple-input multiple-output (MIMO) relay channel, but there is currently no…

Information Theory · Computer Science 2019-11-15 Christoph Hellings , Patrick Gest , Thomas Wiegart , Wolfgang Utschick

Massive multiple-input multiple-output (MIMO) precoders are typically designed by minimizing the transmit power subject to a quality-of-service (QoS) constraint. However, current sustainability goals incentivize more energy-efficient…

Signal Processing · Electrical Eng. & Systems 2023-08-28 Thomas Feys , Xavier Mestre , Emanuele Peschiera , François Rottenberg

In this paper, we have investigated the application of non-binary LDPC codes to spatial multiplexing MIMO systems with a large number of low power antennas. We demonstrate that such large MIMO systems incorporating with low-complexity MMSE…

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

For a multiple-input multiple-output (MIMO) system with unknown channel state information (CSI), a novel low-density parity check (LDPC)-coded transmission (LCT) scheme with joint pilot and data channel estimation is proposed. To fine-tune…

Information Theory · Computer Science 2023-11-14 Binghui Shi , Yongpeng Wu , Peihong Yuan , Derrick Wing Kwan Ng , Xiang-Gen Xia , Wenjun Zhang

A novel adaptive binary decoding algorithm for LDPC codes is proposed, which reduces the decoding complexity while having a comparable or even better performance than corresponding non-adaptive alternatives. In each iteration the variable…

Information Theory · Computer Science 2009-04-24 Ingmar Land , Gottfried Lechner , Lars K. Rasmussen

We propose an optimal MMSE precoding technique using quantized signals with constant envelope. Unlike the existing MMSE design that relies on 1-bit resolution, the proposed approach employs uniform phase quantization and the bounding step…

Information Theory · Computer Science 2021-05-26 Erico S. P. Lopes , Lukas T. N. Landau

Low-resolution precoding techniques have gained considerable attention in the wireless communications area recently. Vital but hardly discussed in literature, discrete precoding in conjunction with channel coding is the subject of this…

Information Theory · Computer Science 2021-05-21 Erico S. P. Lopes , Lukas T. N. Landau