English
Related papers

Related papers: Delay-Exponent of Bilayer Anytime Code

200 papers

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

Delay tolerant Networks (DTNs) leverage the mobility of relay nodes to compensate for lack of permanent connectivity and thus enable communication between nodes that are out of range of each other. To decrease message delivery delay, the…

Networking and Internet Architecture · Computer Science 2009-08-07 Eitan Altman , Francesco De Pellegrini , Lucile Sassatelli

In this paper, utilizing the relay buffers, we propose an opportunistic decode-wait-and-forward relay scheme for a point-to-point communication system with a half-duplexing relay network to better exploit the time diversity and relay…

Information Theory · Computer Science 2009-08-10 Rui Wang , Vincent K. N. Lau , Kaibin Huang

We analyze a simple network where a source and a receiver are connected by a line of erasure channels of different reliabilities. Recent prior work has shown that random linear network coding can achieve the min-cut capacity and therefore…

Information Theory · Computer Science 2009-10-22 Theodoros K. Dikaliotis , Alexandros G. Dimakis , Tracey Ho , Michelle Effros

This paper applies error-exponent and dispersion-style analyses to derive finite-blocklength achievability bounds for low-density parity-check (LDPC) codes over the point-to-point channel (PPC) and multiple access channel (MAC). The…

Information Theory · Computer Science 2020-05-14 Yuxin Liu , Michelle Effros

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

In this paper we present a thorough analysis of non binary LDPC codes over the binary erasure channel. First, the decoding of non binary LDPC codes is investigated. The proposed algorithm performs on-the-fly decoding, i.e. it starts…

Information Theory · Computer Science 2008-10-27 Valentin Savin

A novel adaptive binary decoding algorithm for LDPC codes is proposed, which reduces the decoding complexity while having a comparable or even better performance than corresponding non-adaptive alternatives. In each iteration the variable…

Information Theory · Computer Science 2009-04-24 Ingmar Land , Gottfried Lechner , Lars K. Rasmussen

We propose a deterministic method to design irregular Low-Density Parity-Check (LDPC) codes for binary erasure channels (BEC). Compared to the existing methods, which are based on the application of asymptomatic analysis tools such as…

Information Theory · Computer Science 2008-01-24 Hamid Saeedi , Amir H. Banihashemi

In this paper, we consider a bidirectional relay network with half-duplex nodes and block fading where the nodes transmit with a fixed transmission rate. Thereby, user 1 and user 2 exchange information only via a relay node, i.e., a direct…

Information Theory · Computer Science 2016-11-15 Vahid Jamali , Nikola Zlatanov , Robert Schober

Binary message-passing decoders for low-density parity-check (LDPC) codes are studied by using extrinsic information transfer (EXIT) charts. The channel delivers hard or soft decisions and the variable node decoder performs all computations…

Information Theory · Computer Science 2016-11-18 Gottfried Lechner , Troels Pedersen , Gerhard Kramer

The penalty incurred by imposing a finite delay constraint in lossless source coding of a memoryless source is investigated. It is well known that for the so-called block-to-variable and variable-to-variable codes, the redundancy decays at…

Information Theory · Computer Science 2016-11-17 Ofer Shayevitz , Eado Meron , Meir Feder , Ram Zamir

This paper proposes a novel joint non-binary network-channel code for the Time-Division Decode-and-Forward Multiple Access Relay Channel (TD-DF-MARC), where the relay linearly combines -- over a non-binary finite field -- the coded…

Information Theory · Computer Science 2016-11-15 Mikel Hernaez , Pedro M. Crespo , Javier Del Ser

The paper is focused on the tradeoff between performance and decoding complexity per iteration for LDPC codes in terms of their gap (in rate) to capacity. The study of this tradeoff is done via information-theoretic bounds which also enable…

Information Theory · Computer Science 2007-07-13 Igal Sason , Gil Wiechman

We present a new family of low-density parity-check (LDPC) convolutional codes that can be designed using ordered sets of progressive differences. We study their properties and define a subset of codes in this class that have some desirable…

Information Theory · Computer Science 2012-12-21 Marco Baldi , Marco Bianchi , Giovanni Cancellieri , Franco Chiaraluce

An adaptive delay-tolerant distributed space-time coding (DSTC) scheme with feedback is proposed for two-hop cooperative multiple-input multiple-output (MIMO) networks using an amplify-and-forward strategy and opportunistic relaying…

Information Theory · Computer Science 2014-12-16 T. Peng , R. C. de Lamare

In this paper, we propose a new algorithm for the estimation of multiple time delays (TDs). Since a TD is a fundamental spatial cue for sensor array signal processing techniques, many methods for estimating it have been studied. Most of…

Signal Processing · Electrical Eng. & Systems 2022-03-24 Kouei Yamaoka , Yukoh Wakabayashi , Nobutaka Ono

Recently Li and Xia have proposed a transmission scheme for wireless relay networks based on the Alamouti space time code and orthogonal frequency division multiplexing to combat the effect of timing errors at the relay nodes. This…

Information Theory · Computer Science 2007-09-19 G. Susinder Rajan , B. Sundar Rajan

This paper is concerned with linear superposition systems in which all components of the superimposed signal are coded with an identical binary low-density parity-check (LDPC) code.

Information Theory · Computer Science 2019-09-23 Shancheng Zhao , Xiao Ma , Baoming Bai

In this study, we investigate the characteristics of scheduling sequences that enable efficient decoding of generalized low-density parity-check (GLDPC) codes under the layered message-passing algorithm. In particular, we show that…

Information Theory · Computer Science 2026-04-28 Qingqing Peng , Dongxu Chang , Guiying Yan , Guanghui Wang