English
Related papers

Related papers: Unequal Error Protection by Partial Superposition …

200 papers

Aiming at bridging the gap between the maximum likelihood decoding (MLD) and the suboptimal iterative decodings for short or medium length LDPC codes, we present a generalized ordered statistic decoding (OSD) in the form of syndrome…

Information Theory · Computer Science 2008-05-16 Guangwen Li , Guangzeng Feng

A novel method guaranteeing nondecreasing girth is presented for constructing longer low-density parity-check (LDPC) codes from shorter ones. The parity-check matrix of a shorter base code is decomposed into N (N>=2) non-overlapping…

Information Theory · Computer Science 2018-01-29 Guohua Zhang , Yulin Hu , Qinwei He

Semi-supervised learning (SSL) has achieved remarkable performance with a small fraction of labeled data by leveraging vast amounts of unlabeled data from the Internet. However, this large pool of untrusted data is extremely vulnerable to…

Computer Vision and Pattern Recognition · Computer Science 2024-12-05 Cheng-Yi Lee , Ching-Chia Kao , Cheng-Han Yeh , Chun-Shien Lu , Chia-Mu Yu , Chu-Song Chen

To reduce the implementation complexity of a belief propagation (BP) based low-density parity-check (LDPC) decoder, shuffled BP decoding schedules, which serialize the decoding process by dividing a complete parallel message-passing…

Information Theory · Computer Science 2012-02-07 Yen-Cheng Hsu , Tofar C. -Y. Chang , Yu T. Su , Jian-Jia Weng

A generalized low-density parity-check (GLDPC) code is a class of codes, where single parity check nodes in a conventional low-density parity-check (LDPC) code are replaced by linear codes with higher parity check constraints. In this…

Information Theory · Computer Science 2022-09-07 Jaewha Kim , Jae-Won Kim , Hee-Youl Kwak , Jong-Seon No

This paper proposes a new iterative gradient descent decoding method for real number parity codes. The proposed decoder, named Gradient Descent Symbol Update (GDSU), is used for a class of low-density parity-check (LDPC) real-number codes…

Information Theory · Computer Science 2024-11-26 Oana Boncalo , Alexandru Amaricai

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

In this work, the design of robust, protograph-based low-density parity-check (LDPC) codes for rate-adaptive communication via probabilistic shaping is considered. Recently, probabilistic amplitude shaping (PAS) by B\"ocherer et al. has…

Information Theory · Computer Science 2016-07-04 Fabian Steiner , Patrick Schulte

This paper proposes new accurate approximations for average error probability (AEP) of a communication system employing either $M$-phase-shift keying (PSK) or differential quaternary PSK with Gray coding (GC-DQPSK) modulation schemes over…

Information Theory · Computer Science 2020-09-29 Yassine Mouchtak , Faissal El Bouanani

Based on the extended binary image of non-binary LDPC codes, we propose a method for generating extra redundant bits, such as to decreases the coding rate of a mother code. The proposed method allows for using the same decoder, regardless…

Information Theory · Computer Science 2011-03-15 Lam Pham Sy , Valentin Savin , David Declercq

This paper deals with the problem of massive random access for Gaussian multiple access channel (MAC). We continue to investigate the coding scheme for Gaussian MAC proposed by A. Vem et al in 2017. The proposed scheme consists of four…

Information Theory · Computer Science 2018-03-23 Luiza Medova , Anton Glebov , Pavel Rybin , Alexey Frolov

This article proposes a novel iterative algorithm based on Low Density Parity Check (LDPC) codes for compression of correlated sources at rates approaching the Slepian-Wolf bound. The setup considered in the article looks at the problem of…

Information Theory · Computer Science 2007-10-31 F. Daneshgaran , Massimiliano Laddomada , M. Mondin

We study the stability of low-density parity-check (LDPC) codes under blockwise or bitwise maximum $\textit{a posteriori}$ (MAP) decoding, where transmission takes place over a binary-input memoryless output-symmetric channel. Our study…

Information Theory · Computer Science 2024-02-05 Wei Liu , Rüdiger Urbanke

The base station-mobile device communication traffic has dramatically increased recently due to mobile data, which in turn heavily overloaded the underlying infrastructure. To decrease Base Station (BS) interaction, intra-cell communication…

Information Theory · Computer Science 2021-10-04 Elif Haytaoglu , Erdi Kaya , Suayb S. Arslan

A new approach for combining non-binary low-density parity-check (NB-LDPC) codes with higher-order modulation and probabilistic amplitude shaping (PAS) is presented. Instead of symbol-metric decoding (SMD), a bit-metric decoder (BMD) is…

Information Theory · Computer Science 2018-09-12 Fabian Steiner , Georg Böcherer , Gianluigi Liva

This paper considers the achievable rates and decoding complexity of low-density parity-check (LDPC) codes over statistically independent parallel channels. The paper starts with the derivation of bounds on the conditional entropy of the…

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

Interactive encoding and decoding based on binary low-density parity-check codes with syndrome accumulation (SA-LDPC-IED) is proposed and investigated. Assume that the source alphabet is $\mathbf{GF}(2)$, and the side information alphabet…

Information Theory · Computer Science 2015-03-20 Jin Meng , En-Hui Yang

The goal of the paper is to study specific properties of nonbinary low-density parity-check (NB LDPC) codes when used in coded modulation systems. The paper is focused on the practically important NB LDPC codes over extensions of the Galois…

Information Theory · Computer Science 2022-05-25 Irina E. Bocharova , Boris D. Kudryashov , Evgenii P. Ovsyannikov , Vitaly Skachek

Low complexity decoding algorithms are necessary to meet data rate requirements in excess of 1 Tbps. In this paper, we study one and two bit message passing algorithms for belief propagation decoding of low-density parity-check (LDPC) codes…

Information Theory · Computer Science 2019-10-21 Fabian Steiner , Emna Ben Yacoub , Balazs Matuz , Gianluigi Liva , Alexandre Graell i Amat

We investigate iterative low-resolution message-passing algorithms for quasi-cyclic LDPC codes with horizontal and vertical layered schedules. Coarse quantization and layered scheduling are highly relevant for hardware implementations to…

Information Theory · Computer Science 2022-12-19 Philipp Mohr , Gerhard Bauch
‹ Prev 1 8 9 10 Next ›