English
Related papers

Related papers: Spatially-Coupled Random Access on Graphs

200 papers

In this paper, we study the density evolution analysis of spatially coupled low-density parity-check (SC-LDPC) codes over binary input additive white Gaussian noise (BIAWGN) channels under the belief propagation (BP) decoding algorithm.…

Information Theory · Computer Science 2015-10-19 Md. Noor-A-Rahim , Gottfried Lechner , Khoa D. Nguyen

Since the discovery of turbo codes 20 years ago and the subsequent re-discovery of low-density parity-check codes a few years later, the field of channel coding has experienced a number of major advances. Up until that time, code designers…

Information Theory · Computer Science 2016-11-17 Daniel J. Costello, , Lara Dolecek , Thomas E. Fuja , Joerg Kliewer , David G. M. Mitchell , Roxana Smarandache

In this paper, a network comprising wireless devices equipped with buffers transmitting deadline-constrained data packets over a slotted-ALOHA random-access channel is studied. Although communication protocols facilitating retransmissions…

Information Theory · Computer Science 2022-10-07 Nikolaos Nomikos , Themistoklis Charalambous , Yvonne-Anne Pignolet , Nikolaos Pappas

Novel sparse regression LDPC (SR-LDPC) codes exhibit excellent performance over additive white Gaussian noise (AWGN) channels in part due to their natural provision of shaping gains. Though SR-LDPC-like codes have been considered within the…

Information Theory · Computer Science 2024-02-13 Jamison R. Ebert , Jean-Francois Chamberland , Krishna R. Narayanan

Motivated by the analogy between successive interference cancellation and iterative belief-propagation on erasure channels, irregular repetition slotted ALOHA (IRSA) strategies have received a lot of attention in the design of medium access…

Information Theory · Computer Science 2015-01-06 Laura Toni , Pascal Frossard

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

In this paper, we study the application of spatially coupled LDPC codes with sub-block locality for space division multiplexing. We focus on the information exchange between the sub-blocks and compare decoding strategies with respect to the…

Information Theory · Computer Science 2023-10-25 Haizheng Li , Laurent Schmalen

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

Information Theory · Computer Science 2018-01-22 Satoshi Takabe , Yuta Ishimatsu , Tadashi Wadayama , Masahito Hayashi

In this paper, a simple variation of classical Slotted Aloha is introduced and analyzed. The enhancement relies on adding multiple receivers that gather different observations of the packets transmitted by a user population in one slot. For…

Networking and Internet Architecture · Computer Science 2014-01-16 Andrea Munari , Michael Heindlmaier , Gianluigi Liva , Matteo Berioli

The finite-length performance of spatially-coupled low-density parity-check (SC-LDPC) codes is strongly affected by short cycle configurations and the harmful structures induced by them. This paper studies SC-LDPC code design directly at…

Information Theory · Computer Science 2026-05-19 Lei Huang

The excellent performance of convolutional low-density parity-check codes is the result of the spatial coupling of individual underlying codes across a window of growing size, but much smaller than the length of the individual codes.…

Information Theory · Computer Science 2011-05-05 S. Hamed Hassani , Nicolas Macris , Ruediger Urbanke

Access reservation based on slotted ALOHA is commonly used in wireless cellular access. In this paper we investigate its enhancement based on the use of physical-layer network coding and signature coding, whose main feature is enabling…

Information Theory · Computer Science 2017-07-03 Jasper Goseling , Cedomir Stefanovic , Petar Popovski

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

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

Machine-type communication services in mobile cel- lular systems are currently evolving with an aim to efficiently address a massive-scale user access to the system. One of the key problems in this respect is to efficiently identify active…

Information Theory · Computer Science 2017-07-03 Veljko Boljanovic , Dejan Vukobratovic , Petar Popovski , Cedomir Stefanovic

This article presents a novel enhancement to the random spreading based coding scheme developed by Pradhan et al.\ for the unsourced multiple access channel. The original coding scheme features a polar outer code in conjunction with a…

Information Theory · Computer Science 2021-05-31 Asit Kumar Pradhan , Vamsi K. Amalladinne , Krishna R. Narayanan , Jean-Francois Chamberland

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

We analyze nonbinary spatially-coupled low-density parity-check (SC-LDPC) codes built on the general linear group for transmission over the binary erasure channel. We prove threshold saturation of the belief propagation decoding to the…

Information Theory · Computer Science 2014-07-23 Alexandre Graell i Amat , Iryna Andriyanova , Amina Piemontese

Recently, a new class of codes, called sparse superposition or sparse regression codes, has been proposed for communication over the AWGN channel. It has been proven that they achieve capacity using power allocation and various forms of…

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

Random Access (RA) Medium Access (MAC) protocols are simple and effective when the nature of the traffic is unpredictable and random. In the following paper, a novel RA protocol called Enhanced Contention Resolution ALOHA (ECRA) is…

Information Theory · Computer Science 2012-11-22 Federico Clazzer , Christian Kissling