English
Related papers

Related papers: A Generalization of Threshold Saturation: Applicat…

200 papers

Spatial Modulation (SM) can utilize the index of the transmit antenna (TA) to transmit additional information. In this paper, to improve the performance of SM, a non-uniform constellation (NUC) and pre-scaling coefficients optimization…

Information Theory · Computer Science 2023-10-25 Xinghao Guo , Hanjiang Hong , Yin Xu , Yi-yan Wu , Dazhi He , Wenjun Zhang

We analyze the asymptotic performance of nonbinary spatially-coupled low-density parity-check (SC-LDPC) codes built on the general linear group, when the transmission takes place over the binary erasure channel. We propose an efficient…

Information Theory · Computer Science 2016-11-15 Amina Piemontese , Alexandre Graell i Amat , Giulio Colavolpe

In this paper, we investigate the impact of spatial coupling on the thresholds of turbo-like codes. Parallel concatenated and serially concatenated convolutional codes as well as braided convolutional codes (BCCs) are compared by means of…

Information Theory · Computer Science 2014-07-03 Michael Lentmaier , Saeedeh Moloudi , Alexandre Graell i Amat

We consider spatially coupled code ensembles. A particular instance are convolutional LDPC ensembles. It was recently shown that, for transmission over the memoryless binary erasure channel, this coupling increases the belief propagation…

Information Theory · Computer Science 2011-02-03 Shrinivas Kudekar , Kenta Kasai

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 prove threshold saturation for spatially coupled turbo codes (SC-TCs) and braided convolutional codes (BCCs) over the binary erasure channel. We introduce a compact graph representation for the ensembles of SC-TC and BCC…

Information Theory · Computer Science 2015-08-11 Saeedeh Moloudi , Michael Lentmaier , Alexandre Graell i Amat

We consider transmission of two independent and separately encoded sources over a two-user binary-input Gaussian multiple-access channel. The channel gains are assumed to be unknown at the transmitter and the goal is to design an…

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

Spatially coupled low-density parity-check (SC-LDPC) codes can achieve the channel capacity under low-complexity belief propagation (BP) decoding, however, there is a non-negligible rate-loss because of termination effects for practical…

Information Theory · Computer Science 2015-12-16 Sebastian Cammerer , Vahid Aref , Laurent Schmalen , Stephan ten Brink

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

Raptor codes are known as precoded rateless codes that achieve the capacity of BEC. However the maximum degree of Raptor codes needs to be unbounded to achieve the capacity. In this paper, we prove that spatially-coupled precoded rateless…

Information Theory · Computer Science 2014-01-29 Kosuke Sakata , Kenta Kasai , Kohichi Sakaniwa

Spatially coupled codes have been of interest recently owing to their superior performance over memoryless binary-input channels. The performance is good both asymptotically, since the belief propagation thresholds approach capacity, as…

Information Theory · Computer Science 2012-12-03 Aravind R. Iyengar , Paul H. Siegel , Rudiger L. Urbanke , Jack K. Wolf

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

Spatially coupled serially concatenated codes (SC-SCCs) are a class of spatially coupled turbo-like codes, which have a close-to-capacity performance and low error floor. In this paper we investigate the impact of coupling memory, block…

Information Theory · Computer Science 2021-07-27 Mojtaba Mahdavi , Muhammad Umar Farooq , Liang Liu , Ove Edfors , Viktor Öwall , Michael Lentmaier

A new class of spatially-coupled turbo-like codes (SC-TCs), dubbed generalized spatially coupled parallel concatenated codes (GSC-PCCs), is introduced. These codes are constructed by applying spatial coupling on parallel concatenated codes…

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

We recently proved threshold saturation for spatially coupled sparse superposition codes on the additive white Gaussian noise channel. Here we generalize our analysis to a much broader setting. We show for any memoryless channel that…

Information Theory · Computer Science 2016-03-16 Jean Barbier , Mohamad Dia , Nicolas Macris

In this paper we address a series of open questions about the construction of spatially coupled measurement matrices in compressed sensing. For hardware implementations one is forced to depart from the limiting regime of parameters in which…

Information Theory · Computer Science 2014-01-27 Francesco Caltagirone , Lenka Zdeborová

In this paper, we highlight the class of spatially coupled codes and discuss their applicability to long-haul and submarine optical communication systems. We first demonstrate how to optimize irregular spatially coupled LDPC codes for their…

Information Theory · Computer Science 2016-06-03 Laurent Schmalen , Detlef Suikat , Detlef Rösener , Vahid Aref , Andreas Leven , Stephan ten Brink

Spatially-coupled (SC) codes, known for their threshold saturation phenomenon and low-latency windowed decoding algorithms, are ideal for streaming applications. They also find application in various data storage systems because of their…

Information Theory · Computer Science 2021-01-26 Siyi Yang , Ahmed Hareedy , Shyam Venkatasubramanian , Robert Calderbank , Lara Dolecek

Kudekar et al. recently proved that for transmission over the binary erasure channel (BEC), spatial coupling of LDPC codes increases the BP threshold of the coupled ensemble to the MAP threshold of the underlying LDPC codes. One major…

Information Theory · Computer Science 2015-05-27 Kenta Kasai , Kohichi Sakaniwa

A counter braid (CB) is a novel counter architecture introduced by Lu et al. in 2007 for per-flow measurements on high-speed links which can be decoded with low complexity using message passing (MP). CBs achieve an asymptotic compression…

Information Theory · Computer Science 2018-05-23 Eirik Rosnes , Alexandre Graell i Amat