English
Related papers

Related papers: Comparison of different coding schemes for 1-bit A…

200 papers

The capacity of the AWGN broadcast channel is achieved by superposition coding, but superposition of individual coded modulations expands the modulation alphabet and distorts its configuration. Coded modulation over a broadcast channel…

Information Theory · Computer Science 2016-10-31 Ahmed Abotabl , Aria Nosratinia

Visible light communication (VLC) could provide short-range optical wireless communication together with illumination using LED lighting. However, conventional forward error correction (FEC) codes for reliable communication do not have the…

Information Theory · Computer Science 2018-10-18 Junbin Fang , Zhen Che , Xiaolong Yu , Zhe Chen , Zoe L. Jiang , Siu-Ming Yiu , Kui Ren , Xiaoqing Tan

Large-scale multiple-antenna systems with large bandwidth are fundamental for future wireless communications, where the base station employs a large antenna array. In this scenario, one problem faced is the large energy consumption as the…

Information Theory · Computer Science 2020-05-19 Z. Shao , L. Landau , R. C. de Lamare

The connections between variable nodes and check nodes have a great influence on the performance of low-density parity-check (LDPC) codes. Inspired by the unique structure of polar code's generator matrix, we proposed a new method of…

Information Theory · Computer Science 2019-12-06 Binbin Gao , Huarui Yin , Zhengdao Wang

Lattice codes are elegant and powerful structures that not only can achieve the capacity of the AWGN channel but are also a key ingredient to many multiterminal schemes that exploit linearity properties. However, constructing lattice codes…

Information Theory · Computer Science 2019-05-07 Paulo Ricardo Branco da Silva , Danilo Silva

A hybrid automatic repeat request (HARQ) scheme based on a novel class of rate-compatible polar (\mbox{RCP}) codes are proposed. The RCP codes are constructed by performing punctures and repetitions on the conventional polar codes.…

Information Theory · Computer Science 2016-11-17 Kai Chen , Kai Niu , Jiaru Lin

Polar codes asymptotically achieve the symmetric capacity of memoryless channels, yet their error-correcting performance under successive-cancellation (SC) decoding for short and moderate length codes is worse than that of other modern…

Information Theory · Computer Science 2015-12-25 Gabi Sarkis , Pascal Giard , Alexander Vardy , Claude Thibeault , Warren J. Gross

We present an analysis, under iterative decoding, of coset LDPC codes over GF(q), designed for use over arbitrary discrete-memoryless channels (particularly nonbinary and asymmetric channels). We use a random-coset analysis to produce an…

Information Theory · Computer Science 2007-07-16 Amir Bennatan , David Burshtein

We investigate properties of a channel coding scheme leading to the minimum-possible frame error ratio when transmitting over a memoryless channel with rate R>C. The results are compared to the well-known properties of a channel coding…

Information Theory · Computer Science 2009-03-21 Johannes B. Huber , Thorsten Hehn

In this paper, we presented three approaches to improve the design of Kite codes (newly proposed rateless codes), resulting in an ensemble of rate-compatible LDPC codes with code rates varying "continuously" from 0.1 to 0.9 for additive…

Information Theory · Computer Science 2012-05-21 Kai Zhang , Xiao Ma , Shancheng Zhao , Baoming Bai , Xiaoyi Zhang

The paper presents bounds on the achievable rates and the decoding complexity of low-density parity-check (LDPC) codes. It is assumed that the communication of these codes takes place over statistically independent parallel channels where…

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

Recently, low-resolution LDPC decoders have been introduced that perform mutual information maximizing signal processing. However, the optimal quantization in variable and check nodes requires expensive non-uniform operations. Instead, we…

Information Theory · Computer Science 2022-11-15 Philipp Mohr , Gerhard Bauch

Precoded polar product codes are proposed, where selected component codes enable successive cancellation list decoding to generate bit-wise soft messages efficiently for iterative decoding while targeting optimized distance spectrum as…

Information Theory · Computer Science 2024-02-13 Mustafa Cemil Coşkun

A design of rate-compatible polar codes suitable for HARQ communications is proposed in this paper. An important feature of the proposed design is that the puncturing order is chosen with low complexity on a base code of short length, which…

Information Theory · Computer Science 2015-09-01 Mostafa El-Khamy , Hsien-Ping Lin , Jungwon Lee , Hessam Mahdavifar , Inyup Kang

We propose a two-layer coding architecture for communication of multiple users over a shared slotted medium enabling joint collision resolution and decoding. Each user first encodes its information bits with an outer code for reliability,…

Information Theory · Computer Science 2020-08-18 MohammadReza Ebrahimi , Farshad Lahouti , Victoria Kostina

An energy-efficient approach is presented for shaping a bit-interleaved low-density parity-check (LDPC) coded amplitude phase-shift keying (APSK) system. A subset of the interleaved bits output by a binary LDPC encoder are passed through a…

Information Theory · Computer Science 2013-04-22 Matthew C. Valenti , Xingyu Xiang

Polarization-adjusted convolutional (PAC) codes, as a concatenated coding scheme based on polar codes, is able to approach the finite-length bound of binary-input AWGN channel at short blocklengths. In this paper, we extend PAC codes to the…

Information Theory · Computer Science 2023-08-11 Mengfan Zheng , Cong Ling

Recently, a new class of error-control codes, the polar codes, have attracted much attention. The polar codes are the first known class of capacity-achieving codes for many important communication channels. In addition, polar codes have…

Information Theory · Computer Science 2012-11-19 Xudong Ma

Channel coding aims to minimize errors that occur during the transmission of digital information from one place to another. Low-density parity-check (LDPC) codes can detect and correct transmission errors if one encodes the original…

Information Theory · Computer Science 2018-03-14 Banu Kabakulak , Z. Caner Taşkın , Ali Emre Pusane

In this paper, we investigate novel strategies for generating rate-compatible (RC) irregular low-density parity-check (LDPC) codes with short/moderate block lengths. We propose three puncturing and two extension schemes, which are designed…

Information Theory · Computer Science 2014-07-22 J. Liu , R. C. de Lamare