English
Related papers

Related papers: Full-Diversity Construction-D Lattices: Design and…

200 papers

Decoder diversity is a powerful error correction framework in which a collection of decoders collaboratively correct a set of error patterns otherwise uncorrectable by any individual decoder. In this paper, we propose a new approach to…

Information Theory · Computer Science 2021-05-11 Xin Xiao , Nithin Raveendran , Bane Vasic , Shu Lin , Ravi Tandon

We study Low-Density Parity-Check (LDPC) codes with iterative decoding on block-fading (BF) Relay Channels. We consider two users that employ coded cooperation, a variant of decode-and-forward with a smaller outage probability than the…

Information Theory · Computer Science 2012-10-05 Dieter Duyck , Joseph J. Boutros , Marc Moeneclaey

In this work, we propose structured Root-Low-Density Parity-Check (LDPC) codes and design techniques for block-fading channels. In particular, Quasi-Cyclic Root-LDPC codes, Irregular repeat-accumulate Root-LDPC codes and Controlled Doping…

Information Theory · Computer Science 2015-12-09 C. T. Healy , A. G. D. Uchoa , R. C. de Lamare

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 paper addresses point-to-point communication over block-fading channels with independent fading blocks. When both channel state information at the transmitter (CSIT) and receiver (CSIR) are available, most achievable schemes use…

Information Theory · Computer Science 2018-08-28 Ahmed Hindy , Aria Nosratinia

Low density generator matrix (LDGM) codes have an acceptable performance under iterative decoding algorithms. This idea is used to construct a class of lattices with relatively good performance and low encoding and decoding complexity. To…

Information Theory · Computer Science 2012-05-29 Hassan Mehri , Mohammad Reza Sadeghi

Block-fading (BF) channel, also known as slow-fading channel, is a type of simple and practical channel model that can characterize the primary feature of a number of wireless-communication applications with low to moderate mobility.…

Information Theory · Computer Science 2021-07-22 Yi Fang , Pingping Chen , Guofa Cai , Francis C. M. Lau , Soung Chang Liew , Guojun Han

In this paper, we address the design of high spectral-efficiency Barnes-Wall (BW) lattice codes which are amenable to low-complexity decoding in additive white Gaussian noise (AWGN) channels. We propose a new method of constructing complex…

Information Theory · Computer Science 2013-01-09 J. Harshan , Emanuele Viterbo , Jean-Claude Belfiore

This paper deals with Low-Density Construction-A (LDA) lattices, which are obtained via Construction A from non-binary Low-Density Parity-Check codes. More precisely, a proof is provided that Voronoi constellations of LDA lattices achieve…

Information Theory · Computer Science 2016-03-10 Nicola di Pietro , Gilles Zémor , Joseph J. Boutros

Recently, we introduced a new class of finite alphabet iterative decoders (FAIDs) for low-density parity-check (LDPC) codes. These decoders are capable of surpassing belief propagation in the error floor region on the Binary Symmetric…

Information Theory · Computer Science 2016-11-17 David Declercq , Bane Vasic , Shiva Kumar Planjery , Erbao Li

Multidimensional lattice constellations which present signal space diversity (SSD) have been extensively studied for single-antenna transmission over fading channels, with focus on their optimal design for achieving high diversity gain. In…

Information Theory · Computer Science 2012-07-04 Koralia N. Pappi , Nestor D. Chatzidiamantis , George K. Karagiannidis

This paper proposes a novel maximum-likelihood (ML) soft-decision decoding framework for linear block codes, termed error-building decoding (EBD). The complete decoding process can be performed using only the parity-check matrix, without…

Information Theory · Computer Science 2026-01-06 Guoda Qiu , Ling Liu , Yuejun Wei , Liping Li

We propose a new class of error correction codes for low-delay streaming communication. We consider an online setup where a source packet arrives at the encoder every $M$ channel uses, and needs to be decoded with a maximum delay of $T$…

Information Theory · Computer Science 2016-11-17 Ahmed Badr , Pratik Patil , Ashish Khisti , Wai-Tian Tan , John Apostolopoulos

Nested codes have been employed in a large number of communication applications as a specific case of superposition codes, for example to implement binning schemes in the presence of noise, in joint network-channel coding, or in…

Information Theory · Computer Science 2010-06-16 Christine A. Kelley , Joerg Kliewer

We present a general framework for studying the multilevel structure of lattice network coding (LNC), which serves as the theoretical fundamental for solving the ring-based LNC problem in practice, with greatly reduced decoding complexity.…

Information Theory · Computer Science 2015-11-12 Yi Wang , Alister Burr , Qinhui Huang , Mehdi Molu

A fundamental problem in coding theory is the design of an efficient coding scheme that achieves the capacity of the additive white Gaussian (AWGN) channel. The main objective of this short note is to point out that by concatenating a…

Information Theory · Computer Science 2016-08-24 Shashank Vatedka , Navin Kashyap

We construct explicit rate-one, full-diversity, geometrically dense matrix lattices with large, non-vanishing determinants (NVD) for four transmit antenna multiple-input single-output (MISO) space-time (ST) applications. The constructions…

Information Theory · Computer Science 2016-11-17 Camilla Hollanti , Jyrki Lahtonen , Hsiao-feng Francis Lu

In this paper, we propose a new approach to proving results regarding channel coding schemes based on construction-A lattices for the Additive White Gaussian Noise (AWGN) channel that yields new characterizations of the code construction…

Information Theory · Computer Science 2016-11-18 Wael Alghamdi , Walid Abediseid , Mohamed-Slim Alouini

The work identifies the first general, explicit, and non-random MIMO encoder-decoder structures that guarantee optimality with respect to the diversity-multiplexing tradeoff (DMT), without employing a computationally expensive…

Information Theory · Computer Science 2016-11-18 Joakim Jalden , Petros Elia

Data-driven fault detection has been regarded as a 3D image segmentation task. The models trained from synthetic data are difficult to generalize in some surveys. Recently, training 3D fault segmentation using sparse manual 2D slices is…

Computer Vision and Pattern Recognition · Computer Science 2024-10-28 Yimin Dou , Kewen Li , Jianbing Zhu , Timing Li , Shaoquan Tan , Zongchao Huang