English
Related papers

Related papers: Delay-Exponent of Bilayer Anytime Code

200 papers

Characterization of the delay profile of systems employing random linear network coding is important for the reliable provision of broadcast services. Previous studies focused on network coding over large finite fields or developed Markov…

Information Theory · Computer Science 2022-03-08 Ioannis Chatzigeorgiou , Andrea Tassi

As the process technologies scale into deep submicron region, crosstalk delay is becoming increasingly severe, especially for global on-chip buses. To cope with this problem, accurate delay models of coupled interconnects are needed. In…

Hardware Architecture · Computer Science 2013-04-04 Feng Shi , Xuebin Wu , Zhiyuan Yan

Two classes of turbo codes over high-order finite fields are introduced. The codes are derived from a particular protograph sub-ensemble of the (dv=2,dc=3) low-density parity-check code ensemble. A first construction is derived as a…

Information Theory · Computer Science 2016-11-17 Gianluigi Liva , Enrico Paolini , Sandro Scalise , Marco Chiani

A new delay equation is introduced to describe the punctuated evolution of complex nonlinear systems. A detailed analytical and numerical investigation provides the classification of all possible types of solutions for the dynamics of a…

Adaptation and Self-Organizing Systems · Physics 2015-05-13 V. I. Yukalov , E. P. Yukalova , D. Sornette

In a two-way relay network, two terminals exchange information over a shared wireless half-duplex channel with the help of a relay. Due to its fundamental and practical importance, there has been an increasing interest in this channel.…

Information Theory · Computer Science 2009-02-24 Hien Quoc Ngo , Tony Q. S. Quek , Hyundong Shin

Density evolution (DE) is one of the most powerful analytical tools for low-density parity-check (LDPC) codes on memoryless binary-input/symmetric-output channels. The case of non-symmetric channels is tackled either by the LDPC coset code…

Information Theory · Computer Science 2007-07-13 Chih-Chun Wang , H. Vincent Poor , Sanjeev R. Kulkarni

We solve the problem of designing powerful low-density parity-check (LDPC) codes with iterative decoding for the block-fading channel. We first study the case of maximum-likelihood decoding, and show that the design criterion is rather…

Information Theory · Computer Science 2016-11-18 Joseph J. Boutros , Albert Guillen i Fabregas , Ezio Biglieri , Gilles Zemor

Rate-matching of low-density parity-check (LDPC) codes enables a single code description to support a wide range of code lengths and rates. In 5G NR, rate matching is accomplished by extending (lifting) a base code to a desired target…

Information Theory · Computer Science 2024-10-29 Reinhard Wiesmayr , Darja Nonaca , Chris Dick , Christoph Studer

The performance of a Turbo code with short block length depends critically on the interleaver design. There are two major criteria in the design of an interleaver: the distance spectrum of the code and the correlation between the…

Combinatorics · Mathematics 2007-07-16 H. R. Sadjadpour , N. J. A. Sloane , M. Salehi , G. Nebe

Existence of a new type of oscillating synchronization that oscillates between three different types of synchronizations (anticipatory, complete and lag synchronizations) is identified in unidirectionally coupled nonlinear time-delay…

Chaotic Dynamics · Physics 2007-05-23 D. V. Senthilkumar , M. Lakshmanan

Recently we studied communication delay in distributed control of untimed discrete-event systems based on supervisor localization. We proposed a property called delay-robustness: the overall system behavior controlled by distributed…

Systems and Control · Computer Science 2017-05-02 Renyuan Zhang , Kai Cai , Yongmei Gan , W. M. Wonham

This work proposes adaptive buffer-aided distributed space-time coding schemes and algorithms with feedback for wireless networks equipped with buffer-aided relays. The proposed schemes employ a maximum likelihood receiver at the…

Information Theory · Computer Science 2016-09-20 R. C. de Lamare , T. Peng

In this letter, we develop an efficient linear programming (LP) decoding algorithm for low-density parity-check (LDPC) codes. We first relax the maximum likelihood (ML) decoding problem to a LP problem by using check-node decomposition.…

Information Theory · Computer Science 2019-01-24 Jing Bai , Yongchao Wang , Francis C. M. Lau

Lateral predictive coding (LPC) is a simple theoretical framework to appreciate feature detection in biological neural circuits. Recent theoretical work [Huang et al., Phys.Rev.E 112, 034304 (2025)] has successfully constructed optimal LPC…

Neurons and Cognition · Quantitative Biology 2026-04-23 Guanghui Cai , Zhen-Ye Huang , Weikang Wang , Hai-Jun Zhou

We consider spatially coupled low-density parity-check codes with finite smoothing parameters. A finite smoothing parameter is important for designing practical codes that are decoded using low-complexity windowed decoders. By optimizing…

Information Theory · Computer Science 2019-07-09 Laurent Schmalen , Vahid Aref

In order to follow up with mission-critical applications, new features need to be carried to satisfy a reliable communication with reduced latency. With this regard, this paper proposes a low latency cooperative transmission scheme, where…

Information Theory · Computer Science 2018-02-13 Fatima Ezzahra Airod , Houda Chafnaji , Halim Yanikomeroglu

We study the Dynamic Decode and Forward (DDF) protocol for a single half-duplex relay, single-antenna channel with quasi-static fading. The DDF protocol is well-known and has been analyzed in terms of the Diversity-Multiplexing Tradeoff…

Information Theory · Computer Science 2008-01-18 K. Raj Kumar , Giuseppe Caire

Perfect space-time codes were first introduced by Oggier et. al. to be the space-time codes that have full rate, full diversity-gain, non-vanishing determinant for increasing spectral efficiency, uniform average transmitted energy per…

Information Theory · Computer Science 2007-07-13 Petros Elia , B. A. Sethuraman , P. Vijay Kumar

In this paper, we design the optimal rate capacity approaching irregular Low-Density Parity-Check code ensemble over Binary Erasure Channel, by using practical Semi-Definite Programming approach. Our method does not use any relaxation or…

Information Theory · Computer Science 2012-11-28 H. Tavakoli , M. Ahmadian , M. Reza Peyghami

In this paper, we analyse asymptotically a new class of LDPC codes called Non-binary Hybrid LDPC codes, which has been recently introduced. We use density evolution techniques to derive a stability condition for hybrid LDPC codes, and prove…

Information Theory · Computer Science 2009-09-29 Lucile Sassatelli , David Declercq
‹ Prev 1 4 5 6 7 8 10 Next ›