English
Related papers

Related papers: Spatially Coupled PLDPC-Hadamard Convolutional Cod…

200 papers

In this paper, we propose a new method to design low-density parity-check Hadamard (LDPC-Hadamard) codes, a type of ultimate-Shannon-limit approaching channel codes. The technique is based on applying Hadamard constraints to the check nodes…

Information Theory · Computer Science 2021-01-06 Peng W. Zhang , Francis C. M. Lau , Chiu-W. Sham

Protograph-based low-density parity-check Hadamard codes (PLDPC-HCs) are a new type of ultimate-Shannon-limit-approaching codes. In this paper, we propose a hardware architecture for the PLDPC-HC layered decoders. The decoders consist…

Information Theory · Computer Science 2022-08-22 Peng W. Zhang , Francis C. M. Lau , Chiu-W. Sham

In this paper, we construct protograph-based spatially coupled low-density parity-check (SC-LDPC) codes by coupling together a series of L disjoint, or uncoupled, LDPC code Tanner graphs into a single coupled chain. By varying L, we obtain…

Information Theory · Computer Science 2016-11-17 David G. M. Mitchell , Michael Lentmaier , Daniel J. Costello

A novel code construction based on spatially coupled low-density parity-check (SC-LDPC) codes is presented. The proposed code ensembles are described by protographs, comprised of several protograph-based chains characterizing individual…

Information Theory · Computer Science 2016-11-18 Dmitri Truhachev , David G. M. Mitchell , Michael Lentmaier , Daniel J. Costello

Codes constructed from connected spatially coupled low-density parity-check code (SC-LDPCC) chains are proposed and analyzed. It is demonstrated that connecting coupled chains results in improved iterative decoding performance. The…

Information Theory · Computer Science 2012-08-27 Dmitri Truhachev , David G. M. Mitchell , Michael Lentmaier , Daniel J. Costello,

Spatially-Coupled (SC)-LDPC codes are known to have outstanding error-correction performance and low decoding latency. Whereas previous works on LDPC and SC-LDPC codes mostly take either an asymptotic or a finite-length design approach, in…

Information Theory · Computer Science 2022-09-02 Homa Esfahanizadeh , Eshed Ram , Yuval Cassuto , Lara Dolecek

A new type of spatially coupled low-density parity-check (SC-LDPC) codes motivated by practical storage applications is presented. SC-LDPCL codes (suffix 'L' stands for locality) can be decoded locally at the level of sub-blocks that are…

Information Theory · Computer Science 2020-09-29 Eshed Ram , Yuval Cassuto

Spatially coupled, parallel concatenated codes (SC-PCCs) have been shown to approach channel capacity when decoded using optimal iterative methods. However, under complexity constraints such decoding strategies can result in unacceptable…

Information Theory · Computer Science 2021-09-07 Andrew D. Cummins , David G. M. Mitchell , Daniel J. Costello,

In this paper, we study a new class of high-rate spatially coupled LDPC (SC-LDPC) codes based on the convolutional self-orthogonal codes (CSOCs) first introduced by Massey. The SC-LDPC codes are constructed by treating the irregular graph…

Information Theory · Computer Science 2025-02-18 Daniel J. Costello, , Min Zhu , David G. M. Mitchell , Michael Lentmaier

This paper investigates the design of self-connected spatially coupled low-density parity-check (SC-LDPC) codes. First, a termination method is proposed to reduce rate loss. Particularly, a single-side open SC-LDPC ensemble is introduced,…

Information Theory · Computer Science 2023-07-03 Yihuan Liao , Min Qiu , Jinhong Yuan

In this paper, we propose new coupled codes constructed by overlapping circular spatially-coupled low-density parity-check (SC-LDPC) codes, which show better asymptotic and finite-length decoding performance compared to the conventional…

Information Theory · Computer Science 2018-03-28 Heeyoul Kwak , Bohwan Jun , Pilwoong Yang , Jong-Seon No , Dong-Joon Shin

In this paper, we analyze the finite-length performance of codes on graphs constructed by connecting spatially coupled low-density parity-check (SC-LDPC) code chains. Successive (peeling) decoding is considered for the binary erasure…

Information Theory · Computer Science 2014-03-03 Pablo M. Olmos , David G. M. Mitchell , Dmitri Truhachev , Daniel J. Costello

The peeling decoding for spatially coupled low-density parity-check (SC-LDPC) codes is analyzed for a binary erasure channel. An analytical calculation of the mean evolution of degree-one check nodes of protograph-based SC-LDPC codes is…

Information Theory · Computer Science 2014-02-03 Markus Stinner Pablo M. Olmos

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

For finite coupling lengths, terminated spatially coupled low-density parity-check (SC-LDPC) codes show a non-negligible rate-loss. In this paper, we investigate if this rate loss can be mitigated by tail-biting SC-LDPC codes in conjunction…

Information Theory · Computer Science 2017-04-19 Sebastian Cammerer , Laurent Schmalen , Vahid Aref , Stephan ten Brink

Families of generalized spatially-coupled low-density parity-check (GSC-LDPC) code ensembles can be formed by terminating protograph-based generalized LDPC convolutional (GLDPCC) codes. It has previously been shown that ensembles of…

Information Theory · Computer Science 2016-11-18 David G. M. Mitchell , Michael Lentmaier , Daniel J. Costello

Spatially-coupled (SC) codes is a class of convolutional LDPC codes that has been well investigated in classical coding theory thanks to their high performance and compatibility with low-latency decoders. We describe toric codes as quantum…

Quantum Physics · Physics 2025-04-09 Siyi Yang , Robert Calderbank

Generalized low-density parity-check (GLDPC) codes are a class of LDPC codes in which the standard single parity check (SPC) constraints are replaced by constraints defined by a linear block code. These stronger constraints typically result…

Information Theory · Computer Science 2021-04-19 David G. M. Mitchell , Pablo M. Olmos , Michael Lentmaier , Daniel J. Costello

We study spatially coupled LDPC codes that allow access to sub-blocks much smaller than the full code block. Sub-block access is realized by a semi-global decoder that decodes a chosen target sub-block by only accessing the target, plus a…

Information Theory · Computer Science 2020-10-22 Eshed Ram , Yuval Cassuto

This paper presents a new class of spatially coupled turbo-like codes (SC-TCs), namely half spatially coupled braided convolutional codes (HSC-BCCs) and half spatially coupled parallel concatenated codes (HSC-PCCs). Different from the…

Information Theory · Computer Science 2025-07-04 Xiaowei Wu , Lei Yang , Min Qiu , Chong Han , Jinhong Yuan
‹ Prev 1 2 3 10 Next ›