English
Related papers

Related papers: Near Capacity Irregular Turbo Code

200 papers

This paper addresses the issue of efficient turbo packet combining techniques for coded transmission with a Chase-type automatic repeat request (ARQ) protocol operating over a multiple-input--multiple-output (MIMO) channel with intersymbol…

Information Theory · Computer Science 2010-08-05 Tarik Ait-Idir , Samir Saoudi

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

Future 5G systems will need to support ultra-reliable low-latency communications scenarios. From a latency-reliability viewpoint, it is inefficient to rely on average utility-based system design. Therefore, we introduce the notion of…

Information Theory · Computer Science 2019-02-05 Derya Malak , Muriel Médard , Edmund M. Yeh

In this work, we consider the minimum distance properties and convergence thresholds of 3-dimensional turbo codes (3D-TCs), recently introduced by Berrou et al.. Here, we consider binary 3D-TCs while the original work of Berrou et al.…

Information Theory · Computer Science 2015-03-19 Eirik Rosnes , Alexandre Graell i Amat

We establish lower and upper bounds for the identification capacity of discrete-time Gaussian channels subject to inter-symbol interference (ISI), a canonical model in wireless communication. Our analysis accounts for deterministic encoders…

Information Theory · Computer Science 2026-05-04 Mohammad Javad Salariseddigh , Christian Deppe

We present two new algorithms for the reconstruction of turbo codes from a noisy intercepted bitstream. With these algorithms, we were able to reconstruct various turbo codes with realistic parameter sizes. To the best of our knowledge,…

Information Theory · Computer Science 2015-03-17 Mathieu Cluzeau , Matthieu Finiasz , Jean-Pierre Tillich

In this paper, the sphere bound (SB) is revisited within a general bounding framework based on nested Gallager regions. The equivalence is revealed between the SB proposed by Herzberg and Poltyrev and the SB proposed by Kasami et al.,…

Information Theory · Computer Science 2016-10-24 Ma Xiao , Liu Jia , Zhao Shancheng

We consider communication over the Gaussian multiple-access channel in the regime where the number of users grows linearly with the codelength. In this regime, schemes based on sparse superposition coding can achieve a near-optimal tradeoff…

Information Theory · Computer Science 2025-06-04 Xiaoqi Liu , Kuan Hsieh , Ramji Venkataramanan

This paper considers the problem of code design for a channel where communications and radar systems coexist, modeled as having both Additive White Gaussian Noise (AWGN) and Additive Radar Interference (ARI). The issue of how to adapt or…

Information Theory · Computer Science 2019-04-12 Federico Brunero , Daniela Tuninetti , Natasha Devroye

In this paper, an achievability region and a converse region for the two-user Gaussian interference channel with noisy channel-output feedback (G-IC-NOF) are presented. The achievability region is obtained using a random coding argument and…

Information Theory · Computer Science 2016-11-18 Victor Quintero , Samir M. Perlaza , Iñaki Esnaola , Jean-Marie Gorce

In this paper, we investigate the additive Gaussian noise channel with noisy feedback. We consider the setup of linear coding of the feedback information and Gaussian signaling of the message (i.e. Cover-Pombra Scheme). Then, we derive the…

Information Theory · Computer Science 2015-03-19 Chong Li , Nicola Elia

Growth codes are a subclass of Rateless codes that have found interesting applications in data dissemination problems. Compared to other Rateless and conventional channel codes, Growth codes show improved intermediate performance which is…

Information Theory · Computer Science 2012-11-19 Nikolaos Thomos , Rethnakaran Pulikkoonattu , Pascal Frossard

Designing capacity-achieving coding schemes for the band-limited additive colored Gaussian noise (ACGN) channel has been and is still a challenge. In this paper, the capacity of the band-limited ACGN channel is studied from a fundamental…

Information Theory · Computer Science 2023-06-02 Holger Boche , Andrea Grigorescu , Rafael F. Schaefer , H. Vincent Poor

A practical communication channel often suffers from constraints on input other than the average power, such as the peak power constraint. In order to compare achievable rates with different constellations as well as the channel capacity…

Information Theory · Computer Science 2011-05-17 Shiro Ikeda , Kazunori Hayashi , Toshiyuki Tanaka

Luby Transform (LT) codes are a class of fountain codes that have proved to perform very efficiently over the erasure channel. These codes are rateless in the sense that an infinite stream of encoded symbols can be generated on the fly.…

Signal Processing · Electrical Eng. & Systems 2020-02-21 M. Usman , J. Dunlop

There are rising scenarios in communication systems, where the noises exhibit impulsive behavior and are not adequate to be modeled as the Gaussian distribution. The generalized Gaussian distribution instead is an effective model to…

Information Theory · Computer Science 2022-05-12 Jinzhe Pan , Wai Ho Mow

Low-capacity scenarios have become increasingly important in the technology of the Internet of Things (IoT) and the next generation of wireless networks. Such scenarios require efficient and reliable transmission over channels with an…

Information Theory · Computer Science 2023-02-07 Mohammad Fereydounian , Hamed Hassani , Mohammad Vahid Jamali , Hessam Mahdavifar

We investigate how to exploit intermittent feedback for interference management by studying the two-user Gaussian interference channel (IC). We approximately characterize (within a universal constant) the capacity region for the Gaussian IC…

Information Theory · Computer Science 2016-11-17 Can Karakus , I-Hsiang Wang , Suhas Diggavi

This work investigates the bit-error-rate (BER) performance of turbo coded orthogonal frequency division multiplexed - offset quadrature amplitude modulated (OFDM- OQAM) signals transmitted through frequency selective Rayleigh fading…

Information Theory · Computer Science 2026-02-24 Kasturi Vasudevan

Channel modeling is a fundamental task for the design and evaluation of wireless technologies and networks, before actual prototyping, commercial product development and real deployments. The recent trends of current and future mobile…

Networking and Internet Architecture · Computer Science 2023-05-09 Matteo Pagin , Sandra Lagén , Biljana Bojović , Michele Polese , Michele Zorzi