English
Related papers

Related papers: Doubly-Irregular Repeat-Accumulate Codes over Inte…

200 papers

This paper focuses on the encoding and decoding of Construction D' coding lattices that can be used with shaping lattices for power-constrained channels. Two encoding methods and a decoding algorithm for Construction D' lattices are given.…

Information Theory · Computer Science 2021-09-14 Fan Zhou , Arini Fitri , Khoirul Anwar , Brian M. Kurkoski

Doubly-selective channels, such as those that occur when the transmitter and the receiver move relative to each other at high speeds, are a key scenario for fifth generation (5G) cellular systems, which are mostly based in the use of the…

Signal Processing · Electrical Eng. & Systems 2024-01-30 Tomás Domínguez-Bolaño , José Rodríguez-Piñeiro , José A. García-Naya , Luis Castedo

Belief propagation applied to iterative decoding and sparse recovery through approximate message passing (AMP) are two research areas that have seen monumental progress in recent decades. Inspired by these advances, this article introduces…

Information Theory · Computer Science 2023-01-06 Jamison R. Ebert , Jean-Francois Chamberland , Krishna R. Narayanan

This paper describes an efficient implementation of binning for the relay channel using low-density parity-check (LDPC) codes. We devise bilayer LDPC codes to approach the theoretically promised rate of the decode-and-forward relaying…

Information Theory · Computer Science 2016-11-17 Peyman Razaghi , Wei Yu

Kudekar et al. proved that the belief-propagation (BP) performance for low-density parity check (LDPC) codes can be boosted up to the maximum-a-posteriori (MAP) performance by spatial coupling. In this paper, spatial coupling is applied to…

Information Theory · Computer Science 2016-11-18 Keigo Takeuchi , Toshiyuki Tanaka , Tsutomu Kawabata

We recently showed in [1] the superiority of certain structured coding matrices ensembles (such as partial row-orthogonal) for sparse superposition codes when compared with purely random matrices with i.i.d. entries, both…

Information Theory · Computer Science 2022-07-12 YuHao Liu , Teng Fu , Jean Barbier , TianQi Hou

We consider compound multi-input multi-output (MIMO) wiretap channels where minimal channel state information at the transmitter (CSIT) is assumed. Code construction is given for the special case of isotropic mutual information, which…

Information Theory · Computer Science 2019-10-09 Antonio Campello , Cong Ling , Jean-Claude Belfiore

We consider two-hop S-R-D Gaussian networks with a source (S), a relay (R) and a destination (D), some of which experience additive interference. This additive interference, which renders the channels state-dependent, is either a)…

Information Theory · Computer Science 2011-02-07 Yiwei Song , Natasha Devroye

A new interference management scheme based on integer forcing (IF) receivers is studied for the two-user multiple-input and multiple-output (MIMO) interference channel. The proposed scheme employs a message splitting method that divides…

Information Theory · Computer Science 2022-09-27 Sung Ho Chae , Sang-Woon Jeon

We construct multilevel lattice codes from multiquadratic number fields for the compound block-fading wiretap channel. More precisely, we specialize Construction $\pi_A$ over the ring of integers $\mathcal{O}_K$ and exploit rational primes…

Information Theory · Computer Science 2026-04-15 Juliana G. F. Souza , Conghui Li , Cong Ling

This work considers optimizing LDPC codes in the physical-layer network coded two-way relay channel using noncoherent FSK modulation. The error-rate performance of channel decoding at the relay node during the multiple-access phase was…

Information Theory · Computer Science 2015-02-23 Terry Ferrett , Matthew C. Valenti

We study reliable communication in uncoordinated vehicular communication from the perspective of Shannon theory. Our system model for the information transmission is that of an Arbitrarily Varying Channel (AVC): One sender-receiver pair…

Information Theory · Computer Science 2019-06-06 Christian Arendt , Janis Nötzel , Holger Boche

Communication over the binary erasure channel (BEC) using low-density parity-check (LDPC) codes and belief propagation (BP) decoding is considered. The average bit error probability of an irregular LDPC code ensemble after a fixed number of…

Information Theory · Computer Science 2009-05-23 Ryuhei Mori , Toshiyuki Tanaka , Kenta Kasai , Kohichi Sakaniwa

We consider a secure communication scenario through the two-user Gaussian interference channel: each transmitter (user) has a confidential message to send reliably to its intended receiver while keeping it secret from the other receiver.…

Information Theory · Computer Science 2016-04-26 Parisa Babaheidarian , Somayeh Salimi , Panos Papadimitratos

Network-controlled repeaters (NCRs) are a low-cost means to extend coverage and strengthen macro diversity in wireless networks. They operate in real time by amplifying and re-transmitting the incoming signal with only hardware-level…

Signal Processing · Electrical Eng. & Systems 2026-04-16 Özlem Tuğfe Demir , Emil Björnson

This paper is focused on the performance analysis of binary linear block codes (or ensembles) whose transmission takes place over independent and memoryless parallel channels. New upper bounds on the maximum-likelihood (ML) decoding error…

Information Theory · Computer Science 2007-07-13 Igal Sason , Idan Goldenberg

Sparse regression codes (SPARCs) are a class of codes that encode information through the superposition of columns of a randomised coding matrix. The combination with an outer non-binary low density parity check (NB-LDPC) code was recently…

Information Theory · Computer Science 2025-09-23 Alexander Fengler , Burak Çakmak , Giuseppe Caire

With the complication of future communication scenarios, most conventional signal processing technologies of multi-user multiple-input multiple-output (MU-MIMO) become unreliable, which are designed based on ideal assumptions, such as…

Information Theory · Computer Science 2022-06-27 Yuhao Chi , Lei Liu , Guanghui Song , Ying Li , Yong Liang Guan , Chau Yuen

We consider codes for channels with extreme noise that emerge in various low-power applications. Simple LDPC-type codes with parity checks of weight 3 are first studied for any dimension $m\rightarrow\infty.$ These codes form modulation…

Information Theory · Computer Science 2021-01-26 Ilya Dumer , Navid Gharavi

In this article, new regular incidence structures are presented. They arise from sets of conics in the affine plane blown-up at its rational points. The LDPC codes given by these incidence matrices are studied. These sparse incidence…

Information Theory · Computer Science 2015-03-14 Alain Couvreur
‹ Prev 1 3 4 5 6 7 10 Next ›