English
Related papers

Related papers: A Phenomenological Study on Threshold Improvement …

200 papers

We consider spatially-coupled protograph-based LDPC codes for the three terminal erasure relay channel. It is observed that BP threshold value, the maximal erasure probability of the channel for which decoding error probability converges to…

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

We investigate the use of Gallager's low-density parity-check (LDPC) codes in a broadcast channel, one of the fundamental models in network information theory. Combining linear codes is a standard technique in practical network…

Statistical Mechanics · Physics 2009-11-07 Kazutaka Nakamura , Robert Morelos-Zaragoza , David Saad , Yoshiyuki Kabashima

Spatially coupled low-density parity-check (SC-LDPC) codes are sparse graph codes that have recently become of interest due to their capacity-approaching performance on memoryless binary input channels. In this paper, we unify all existing…

Information Theory · Computer Science 2017-10-11 Allison Beemer , Salman Habib , Christine A. Kelley , Joerg Kliewer

Compute-and-forward (CAF) relaying is effective to increase bandwidth efficiency of wireless two-way relay channels. In a CAF scheme, a relay is designed to decode a linear combination composed of transmitted messages from other terminals…

Information Theory · Computer Science 2018-07-05 Satoshi Takabe , Tadashi Wadayama , Masahito Hayashi

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

CC-GLPDC codes are a class of generalized low-density parity-check (GLDPC) codes where the constraint nodes (CNs) represent convolutional codes. This allows for efficient decoding in the trellis with the forward-backward algorithm, and the…

Information Theory · Computer Science 2022-12-01 Muhammad Umar Farooq , Michael Lentmaier , Alexandre Graell i Amat

Existence of quantum low-density parity-check (LDPC) codes whose minimal distance scales linearly with the number of qubits is a major open problem in quantum information. Its practical interest stems from the need to protect information in…

Quantum Physics · Physics 2021-05-14 Lior Eldar , Maris Ozols , Kevin F. Thompson

Linear nested codes, where two or more sub-codes are nested in a global code, have been proposed as candidates for reliable multi-terminal communication. In this paper, we consider nested array-based spatially coupled low-density…

Information Theory · Computer Science 2021-02-23 Salman Habib , David G. M. Mitchell , Joerg Kliewer

Because of their capacity-approaching performance, graph-based codes have a wide range of applications, including communications and storage. In these codes, unequal error protection (UEP) can offer performance gains with limited rate loss.…

Information Theory · Computer Science 2021-01-25 Beyza Dabak , Ahmed Hareedy , Alexei Ashikhmin , Robert Calderbank

Joint access point (AP) association and physical carrier sensing (PCS) threshold selection has the potential to improve the performance in high density wireless LANs (WLANs) under high contention, interference and self-interference (SI)…

Information Theory · Computer Science 2021-04-29 Phillip B. Oni , Steven D. Blostein

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 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

Two-dimensional mappings obtained by coupling two piecewise increasing expanding maps are considered. Their dynamics is described when the coupling parameter increases in the expanding domain. By introducing a coding and by analysing an…

Chaotic Dynamics · Physics 2007-05-23 Bastien Fernandez , Pierre Guiraud

We propose a new type of ultimate-Shannon-limit-approaching codes called spatially coupled protograph-based low-density parity-check Hadamard convolutional codes (SC-PLDPCH-CCs), which are constructed by spatially coupling PLDPC-Hadamard…

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

Demodulation in a random multiple access channel is considered where the signals are chosen uniformly randomly with unit energy, a model applicable to several modern transmission systems. It is shown that by lifting (replicating) the graph…

Information Theory · Computer Science 2015-03-19 Christian Schlegel , Dmitri Truhachev

Low-density parity-check (LDPC) codes together with belief propagation (BP) decoding yield exceptional error correction capabilities in the large block length regime. Yet, there remains a gap between BP decoding and maximum likelihood…

Information Theory · Computer Science 2025-01-22 Jonathan Mandelbaum , Holger Jäkel , Laurent Schmalen

We establish the existence of wave-like solutions to spatially coupled graphical models which, in the large size limit, can be characterized by a one-dimensional real-valued state. This is extended to a proof of the threshold saturation…

Information Theory · Computer Science 2015-03-20 Shrinivas Kudekar , Tom Richardson , Ruediger Urbanke

Spatially-Coupled LDPC (SC-LDPC) ensembles achieve the capacity of binary memoryless channels (BMS), asymptotically, under belief-propagation (BP) decoding. In this paper, we study the BP decoding of these code ensembles over a BMS channel…

Information Theory · Computer Science 2016-07-05 Vahid Aref , Narayanan Rengaswamy , Laurent Schmalen

An improved inference method for densely connected systems is presented. The approach is based on passing condensed messages between variables, representing macroscopic averages of microscopic messages. We extend previous work that showed…

Information Theory · Computer Science 2009-11-11 Juan P. Neirotti , David Saad

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
‹ Prev 1 3 4 5 6 7 10 Next ›