English
Related papers

Related papers: Iterative Threshold Decoding of Spatially Coupled,…

200 papers

Recently a powerful class of rate-compatible serially concatenated convolutional codes (SCCCs) have been proposed based on minimizing analytical upper bounds on the error probability in the error floor region. Here this class of codes is…

Information Theory · Computer Science 2007-07-13 Alexandre Graell i Amat , Fredrik Brannstrom , Lars K. Rasmussen

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 present a decode-and-forward transmission scheme based on spatially-coupled low-density parity-check (SC-LDPC) codes for a network consisting of two (possibly correlated) sources, one relay, and one destination. The links between the…

Information Theory · Computer Science 2014-02-17 Stefan Schwandter , Alexandre Graell i Amat , Gerald Matz

The concept of spatial coupling is among the most significant breakthroughs in coding theory over the past decade. The excellent waterfall and error floor performance of spatially coupled codes has positioned them as promising coding…

Information Theory · Computer Science 2026-05-13 Min Qiu , Xiaowei Wu , Peng Kang , Lei Yang , Jinhong Yuan

Recently, it has been observed that terminated low-density-parity-check (LDPC) convolutional codes (or spatially-coupled codes) appear to approach capacity universally across the class of binary memoryless channels. This is facilitated by…

Information Theory · Computer Science 2011-10-12 Phong S. Nguyen , Arvind Yedla , Henry D. Pfister , Krishna R. Narayanan

We consider spatially coupled low-density parity-check codes with finite smoothing parameters. A finite smoothing parameter is important for designing practical codes that are decoded using low-complexity windowed decoders. By optimizing…

Information Theory · Computer Science 2017-01-27 Laurent Schmalen , Vahid Aref , Fanny Jardel

A successive cancellation list (SCL) decoder with limited list size for polar codes can not be analyzed as a successive cancellation (SC) decoder, nor as a maximum likelihood (ML) decoder, due to the complicated decoding errors caused by…

Information Theory · Computer Science 2019-03-25 Tao Wang , Daiming Qu , Tao Jiang

Sparse superposition (SS) codes provide an efficient communication scheme over the Gaussian channel, utilizing the vector approximate message passing (VAMP) decoder for rotational invariant design matrices. Previous work has established…

Information Theory · Computer Science 2025-04-21 Yuhao Liu , Teng Fu , Jie Fan , Panpan Niu , Chaowen Deng , Zhongyi Huang

Sparse superposition codes, also called sparse regression codes (SPARCs), are a class of codes for efficient communication over the AWGN channel at rates approaching the channel capacity. In a standard SPARC, codewords are sparse linear…

Information Theory · Computer Science 2021-06-25 Cynthia Rush , Kuan Hsieh , Ramji Venkataramanan

We propose a novel encoding/transmission scheme called continuous chain (CC) transmission that is able to improve the finite-length performance of a system using spatially-coupled low-density parity-check (SC-LDPC) codes. In CC…

Information Theory · Computer Science 2019-10-04 Pablo M. Olmos , David G. M. Mitchell , Dmitri Truhachev , Daniel J. Costello

Spatially-coupled (SC) codes are constructed by coupling many regular low-density parity-check codes in a chain. The decoding chain of SC codes stops when facing burst erasures. This problem can not be overcome by increasing coupling…

Information Theory · Computer Science 2013-02-07 Ryunosuke Ohashi , Kenta Kasai , Keigo Takeuchi

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

Targeting high-throughput and low-power communications, we implement two successive cancellation (SC) decoders for polar codes. With $16nm$ ASIC technology, the area efficiency and energy efficiency are $4Tbps/mm^2$ and $0.63pJ/bit$,…

Information Theory · Computer Science 2021-07-20 Jiajie Tong , Xianbin Wang , Qifan Zhang , Huazi Zhang , Rong Li , Jun Wang , Wen Tong

In this paper we study the iterative decoding threshold performance of non-binary spatially-coupled low-density parity-check (NB-SC-LDPC) code ensembles for both the binary erasure channel (BEC) and the binary-input additive white Gaussian…

Information Theory · Computer Science 2016-11-18 Lai Wei , Toshiaki Koike-Akino , David G. M. Mitchell , Thomas E. Fuja , Daniel J. Costello

This paper proposes an enhanced list-aided successive cancellation stack (ELSCS) decoding algorithm with adjustable decoding complexity. In addition, a logarithmic likelihood ratio (LLR)-threshold based path extension scheme is designed to…

Information Theory · Computer Science 2019-12-18 Haotian Zheng , Bin Chen , Luis F. Abanto-Leon , Zizheng Cao , Ton Koonen

Concatenation is a method of building long codes out of shorter ones, it attempts to meet the problem of decoding complexity by breaking the required computation into manageable segments. Concatenated Continuous Phase Frequency Shift Keying…

Information Theory · Computer Science 2011-05-24 Labib Francis Gergis

In this paper, we study a class of spatially coupled turbo codes, namely partially information- and partially parity-coupled turbo codes. This class of codes enjoy several advantages such as flexible code rate adjustment by varying the…

Information Theory · Computer Science 2020-12-25 Min Qiu , Xiaowei Wu , Alexandre Graell i Amat , Jinhong Yuan

This letter proposes a novel method for accelerating iterative detection for spatially coupled (SC) systems. An SC system is constructed by one-dimensional coupling of many subsystems, which are classified into training and propagation…

Information Theory · Computer Science 2016-11-18 Keigo Takeuchi

This paper presents a generalized construction of RS-SPC product codes. A low-complexity joint-decoding scheme is proposed for these codes, in which a BP-based iterative decoding is performed based on the binary expansion of the whole…

Information Theory · Computer Science 2021-12-21 Mingyang Zhu , Ming Jiang , Chunming Zhao

This paper considers a compressed-coding scheme that combines compressed sensing with forward error control coding. Approximate message passing (AMP) is used to decode the message. Based on the state evolution analysis of AMP, we derive the…

Information Theory · Computer Science 2024-10-30 Shansuo Liang , Chulong Liang , Junjie Ma , Li Ping