English
Related papers

Related papers: Displacement Convexity in Spatially Coupled Scalar…

200 papers

Potential functionals have been introduced recently as an important tool for the analysis of coupled scalar systems (e.g. density evolution equations). In this contribution, we investigate interesting properties of this potential. Using the…

Information Theory · Computer Science 2017-01-16 Rafah El-Khatib , Nicolas Macris , Tom Richardson , Rüdiger Urbanke

Spatial coupling has recently emerged as a powerful paradigm to construct graphical models that work well under low-complexity message-passing algorithms. Although much progress has been made on the analysis of spatially coupled models…

Information Theory · Computer Science 2013-10-01 Rafah El-Khatib , Nicolas Macris , Ruediger Urbanke

Low-density parity-check (LDPC) convolutional codes (or spatially-coupled codes) were recently shown to approach capacity on the binary erasure channel (BEC) and binary-input memoryless symmetric channels. The mechanism behind this…

Information Theory · Computer Science 2016-11-17 Arvind Yedla , Yung-Yih Jian , Phong S. Nguyen , Henry D. Pfister

Low-density parity-check (LDPC) convolutional codes (or spatially-coupled codes) have been shown to approach capacity on the binary erasure channel (BEC) and binary-input memoryless symmetric channels. The mechanism behind this spectacular…

Information Theory · Computer Science 2015-03-20 Arvind Yedla , Yung-Yih Jian , Phong S. Nguyen , Henry D. Pfister

Spatially-coupled low-density parity-check (LDPC) codes, which were first introduced as LDPC convolutional codes, have been shown to exhibit excellent performance under low-complexity belief-propagation decoding. This phenomenon is now…

Information Theory · Computer Science 2015-01-16 Santhosh Kumar , Andrew J. Young , Nicolas Macris , Henry D. Pfister

Convolutional low-density parity-check (LDPC) codes (or spatially-coupled codes) have now been shown to achieve capacity on binary-input memoryless symmetric channels. The principle behind this surprising result is the threshold-saturation…

Information Theory · Computer Science 2013-01-25 Arvind Yedla , Yung-Yih Jian , Phong S. Nguyen , Henry D. Pfister

We consider the dynamics of message passing for spatially coupled codes and, in particular, the set of density evolution equations that tracks the profile of decoding errors along the spatial direction of coupling. It is known that, for…

Information Theory · Computer Science 2017-01-17 Rafah El-Khatib , Nicolas Macris

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

This paper analyzes general spatially-coupled (SC) systems with multi-dimensional coupling. A continuum approximation is used to derive potential functions that characterize the performance of the SC systems. For any dimension of coupling,…

Information Theory · Computer Science 2013-04-19 Keigo Takeuchi , Toshiyuki Tanaka , Kenta Kasai

Spatially coupled codes have been shown to universally achieve the capacity for a large class of channels. Many variants of such codes have been introduced to date. We discuss a further such variant that is particularly simple and is…

Information Theory · Computer Science 2019-12-09 Dimitris Achlioptas , Hamed Hassani , Wei Liu , Rüdiger Urbanke

Low-density parity-check (LDPC) convolutional codes have been shown to exhibit excellent performance under low-complexity belief-propagation decoding [1], [2]. This phenomenon is now termed threshold saturation via spatial coupling. The…

Information Theory · Computer Science 2013-12-30 Santhosh Kumar , Andrew J. Young , Nicolas Macris , Henry D. Pfister

Spatially-coupled LDPC codes are known to have excellent asymptotic properties. Much less is known regarding their finite-length performance. We propose a scaling law to predict the error probability of finite-length spatially-coupled…

Information Theory · Computer Science 2015-05-26 Pablo M. Olmos , Rüdiger Urbanke

The aim of this paper is to show that spatial coupling can be viewed not only as a means to build better graphical models, but also as a tool to better understand uncoupled models. The starting point is the observation that some asymptotic…

Information Theory · Computer Science 2015-08-27 Andrei Giurgiu , Nicolas Macris , Rüdiger Urbanke

We investigate random spatially coupled low-density parity-check (SC-LDPC) code ensembles over finite fields. Under different variable-node edge-spreading rules, the random Tanner graphs of several coupled ensembles are defined by multiple…

Information Theory · Computer Science 2026-01-01 Jiaxin Lyu , Guanghui He

Compressed Sensing refers to extracting a low-dimensional structured signal of interest from its incomplete random linear observations. A line of recent work has studied that, with the extra prior information about the signal, one can…

Information Theory · Computer Science 2017-04-19 Sajad Daei , Farzan Haddadi

In compressed sensing one uses known structures of otherwise unknown signals to recover them from as few linear observations as possible. The structure comes in form of some compressibility including different notions of sparsity and low…

Information Theory · Computer Science 2019-05-29 Martin Kliesch , Stanislaw J. Szarek , Peter Jung

A popular approach to the MAP inference problem in graphical models is to minimize an upper bound obtained from a dual linear programming or Lagrangian relaxation by (block-)coordinate descent. This is also known as convex/convergent…

Artificial Intelligence · Computer Science 2024-06-06 Vaclav Voracek , Tomas Werner

We consider spatially coupled code ensembles over a multiple access channel. Convolutional LDPC ensembles are one instance of spatially coupled codes. It was shown recently that, for transmission over the binary erasure channel, this…

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

The typical approach for recovery of spatially correlated signals is regularized least squares with a coupled regularization term. In the Bayesian framework, this algorithm is seen as a maximum-a-posterior estimator whose postulated prior…

Information Theory · Computer Science 2018-05-31 Ali Bereyhi , Saeid Haghighatshoar , Ralf R. Müller

We consider the problem of recovering a single or multiple frequency-sparse signals, which share the same frequency components, from a subset of regularly spaced samples. The problem is referred to as continuous compressed sensing (CCS) in…

Information Theory · Computer Science 2014-10-24 Zai Yang , Lihua Xie
‹ Prev 1 2 3 10 Next ›