English
Related papers

Related papers: Scattered EXIT Charts for Finite Length LDPC Code …

200 papers

In a digital communication system, information is sent from one place to another over a noisy communication channel using binary symbols (bits). Original information is encoded by adding redundant bits, which are then used by low--density…

Information Theory · Computer Science 2017-09-29 Banu Kabakulak , Z. Caner Taşkın , Ali Emre Pusane

We study the performance of nonbinary low-density parity-check (LDPC) codes over finite integer rings over two channels that arise from the Lee metric. The first channel is a discrete memory-less channel (DMC) matched to the Lee metric. The…

Information Theory · Computer Science 2022-10-19 Jessica Bariffi , Hannes Bartz , Gianluigi Liva , Joachim Rosenthal

We study the design of spectrally efficient fiber-optical communication systems based on different spatially coupled (SC) forward error correction (FEC) schemes. In particular, we optimize the allocation of the coded bits from the FEC…

Information Theory · Computer Science 2024-01-30 Christian Häger , Alexandre Graell i Amat , Fredrik Brännström , Alex Alvarado , Erik Agrell

We propose a new class of information-coupled (IC) Turbo codes to improve the transport block (TB) error rate performance for long-term evolution (LTE) systems, while keeping the hybrid automatic repeat request protocol and the Turbo…

Information Theory · Computer Science 2017-09-21 Lei Yang , Yixuan Xie , Xiaowei Wu , Jinhong Yuan , Xingqing Cheng , Lei Wan

Spatially-coupled (SC) LDPC codes have recently emerged as an excellent choice for error correction in modern data storage and communication systems due to their outstanding performance. It has long been known that irregular graph codes…

Information Theory · Computer Science 2019-06-17 Homa Esfahanizadeh , Ruiyi Wu , Lara Dolecek

The paper presents bounds on the achievable rates and the decoding complexity of low-density parity-check (LDPC) codes. It is assumed that the communication of these codes takes place over statistically independent parallel channels where…

Information Theory · Computer Science 2007-07-13 Igal Sason , Gil Wiechman

We propose a quantized decoding algorithm for low- density parity-check codes where the variable node update rule of the standard min-sum algorithm is replaced with a look-up table (LUT) that is designed using an information-theoretic…

Information Theory · Computer Science 2015-12-02 Michael Meidlinger , Alexios Balatsoukas-Stimming , Andreas Burg , Gerald Matz

This article presents a novel enhancement to the random spreading based coding scheme developed by Pradhan et al.\ for the unsourced multiple access channel. The original coding scheme features a polar outer code in conjunction with a…

Information Theory · Computer Science 2021-05-31 Asit Kumar Pradhan , Vamsi K. Amalladinne , Krishna R. Narayanan , Jean-Francois Chamberland

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

This paper describes an efficient implementation of binning for the relay channel using low-density parity-check (LDPC) codes. We devise bilayer LDPC codes to approach the theoretically promised rate of the decode-and-forward relaying…

Information Theory · Computer Science 2016-11-17 Peyman Razaghi , Wei Yu

An ultra-high throughput low-density parity check (LDPC) decoder with an unrolled full-parallel architecture is proposed, which achieves the highest decoding throughput compared to previously reported LDPC decoders in the literature. The…

In streaming applications, doping improves the performance of spatially-coupled low-density parity-check (SC-LDPC) codes by creating reduced-degree check nodes in the coupled chain. We formulate a scaling law to predict the bit and block…

Information Theory · Computer Science 2021-04-23 Roman Sokolovskii , Alexandre Graell i Amat , Fredrik Brännström

The bit-error threshold of the standard ensemble of Low Density Parity Check (LDPC) codes is known to be close to capacity, if there is a non-zero fraction of degree-two bit nodes. However, the degree-two bit nodes preclude the possibility…

Information Theory · Computer Science 2013-05-22 Asit Kumar Pradhan , Arunkumar Subramanian , Andrew Thangaraj

Spatially coupled low-density parity-check codes show an outstanding performance under the low-complexity belief propagation (BP) decoding algorithm. They exhibit a peculiar convergence phenomenon above the BP threshold of the underlying…

Information Theory · Computer Science 2013-07-16 Vahid Aref , Laurent Schmalen , Stephan ten Brink

Joint encryption-encoding schemes have been released to fulfill both reliability and security desires in a single step. Using Low Density Parity Check (LDPC) codes in joint encryption-encoding schemes, as an alternative to classical linear…

Information Theory · Computer Science 2019-02-22 Hossein Khayami , Taraneh Eghlidos , Mohammad Reza Aref

We show how the iterative decoding threshold of tailbiting spatially coupled (SC) low-density parity-check (LDPC) code ensembles can be improved over the binary input additive white Gaussian noise channel by allowing the use of different…

Information Theory · Computer Science 2018-02-19 Thomas Jerkovits , Gianluigi Liva , Alexandre Graell i Amat

Digital data transfer can be protected by means of suitable error correcting codes. Among the families of state-of-the-art codes, LDPC (Low Density Parity-Check) codes have received a great deal of attention recently, because of their…

Information Theory · Computer Science 2022-10-10 Massimo Battaglioni , Giovanni Cancellieri

In wireless communications, spatial diversity techniques, such as space-time block code (STBC) and single-input multiple-output (SIMO), are employed to strengthen the robustness of the transmitted signal against channel fading. This paper…

Information Theory · Computer Science 2012-08-14 Yi Fang , Pingping Chen , Lin Wang , Francis C. M. Lau , Kai-Kit Wong

In this study, we investigate the characteristics of scheduling sequences that enable efficient decoding of generalized low-density parity-check (GLDPC) codes under the layered message-passing algorithm. In particular, we show that…

Information Theory · Computer Science 2026-04-28 Qingqing Peng , Dongxu Chang , Guiying Yan , Guanghui Wang

The error correction performance of low-density parity-check (LDPC) codes under iterative message-passing decoding is degraded by the presence of certain harmful objects existing in their Tanner graph representation. Depending on the…

Information Theory · Computer Science 2019-04-16 Massimo Battaglioni , Franco Chiaraluce , Marco Baldi , David Mitchell
‹ Prev 1 3 4 5 6 7 10 Next ›