English
Related papers

Related papers: Sparse Regression LDPC Codes for the Block-Fading …

200 papers

We consider spatially coupled low-density parity-check codes with finite smoothing parameters. A finite smoothing parameter is important for designing practical codes that are decoded using low-complexity windowed decoders. By optimizing…

Information Theory · Computer Science 2017-01-27 Laurent Schmalen , Vahid Aref , Fanny Jardel

Previous work showed that polar codes can be decoded using off-the-shelf LDPC decoders by imposing special constraints on the LDPC code structure, which, however, resulted in some performance degradation. In this paper we show that this…

Information Theory · Computer Science 2019-09-27 Moustafa Ebada , Ahmed Elkelesh , Stephan ten Brink

In this paper, we study a compute-and-forward (CAF) relaying scheme with low-density parity-check (LDPC) codes, a special case of physical layer network coding, under the quadrature phase shift keying (QPSK) modulation. The novelty of this…

Information Theory · Computer Science 2019-04-18 Satoshi Takabe , Tadashi Wadayama , Ángeles Vazquez-Castro , Masahito Hayashi

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

Pansharpening is a fundamental issue in remote sensing field. This paper proposes a side information partially guided convolutional sparse coding (SCSC) model for pansharpening. The key idea is to split the low resolution multispectral…

Computer Vision and Pattern Recognition · Computer Science 2021-03-11 Shuang Xu , Jiangshe Zhang , Kai Sun , Zixiang Zhao , Lu Huang , Junmin Liu , Chunxia Zhang

Raptor codes are rateless codes that achieve the capacity on the binary erasure channels. However the maximum degree of optimal output degree distribution is unbounded. This leads to a computational complexity problem both at encoders and…

Information Theory · Computer Science 2013-02-07 Kosuke Sakata , Kenta Kasai , Kohichi Sakaniwa

In this paper, we introduce two new methods of mitigating decoder error propagation for low-latency sliding window decoding (SWD) of spatially coupled low density parity check (SC-LDPC) codes. Building on the recently introduced idea of…

Information Theory · Computer Science 2020-04-21 Min Zhu , David G. M. Mitchell , Michael Lentmaier , Daniel J. Costello

This paper is concerned with the construction of low-density parity-check (LDPC) codes with low error floors. Two main contributions are made. First, a new class of structured LDPC codes is introduced. The parity check matrices of these…

Information Theory · Computer Science 2011-08-24 Dung Viet Nguyen , Shashi Kiran Chilappagari , Michael W. Marcellin , Bane Vasic

We design and assess some practical low-density parity-check (LDPC) coded transmission schemes for the Gaussian broadcast channel with confidential messages (BCC). This channel model is different from the classical wiretap channel model as…

Information Theory · Computer Science 2016-11-15 Marco Baldi , Nicola Maturo , Giacomo Ricciutelli , Franco Chiaraluce

This article presents a novel enhancement to the random spreading based coding scheme developed by Pradhan et al.\ for the unsourced multiple access channel. The original coding scheme features a polar outer code in conjunction with a…

Information Theory · Computer Science 2021-05-31 Asit Kumar Pradhan , Vamsi K. Amalladinne , Krishna R. Narayanan , Jean-Francois Chamberland

For finite length polar codes, channel polarization leaves a significant number of channels not fully polarized. Adding a Cyclic Redundancy Check (CRC) to better protect information on the semi-polarized channels has already been…

Information Theory · Computer Science 2016-11-14 A. Elkelesh , M. Ebada , S. Cammerer , S. ten Brink

Recent works showed how low-density parity-check (LDPC) erasure correcting codes, under maximum likelihood (ML) decoding, are capable of tightly approaching the performance of an ideal maximum-distance-separable code on the binary erasure…

Information Theory · Computer Science 2008-04-21 Enrico Paolini , Gianluigi Liva , Michela Varrella , Balazs Matuz , Marco Chiani

We propose a novel coded integrated passive sensing and communication (CIPSAC) system with orthogonal frequency division multiplexing (OFDM), where a multi-antenna base station (BS) passively senses the parameters of the targets and decodes…

Signal Processing · Electrical Eng. & Systems 2025-02-19 Chenghong Bian , Kaitao Meng , Huihui Wu , Yumeng Zhang , Deniz Gunduz

For an arbitrary degree distribution pair (DDP), we construct a sequence of low-density parity-check (LDPC) code ensembles with girth growing logarithmically in block-length using Ramanujan graphs. When the DDP has minimum left degree at…

Information Theory · Computer Science 2016-11-17 Arunkumar Subramanian , Andrew Thangaraj , Matthieu Bloch , Steven W. McLaughlin

For LDPC codes operating over additive white Gaussian noise channels and decoded using message-passing decoders with limited precision, absorbing sets have been shown to be a key factor in error floor behavior. Focusing on this scenario,…

Information Theory · Computer Science 2012-12-07 Jiadong Wang , Lara Dolecek , Richard Wesel

In this letter, we develop an efficient linear programming (LP) decoding algorithm for low-density parity-check (LDPC) codes. We first relax the maximum likelihood (ML) decoding problem to a LP problem by using check-node decomposition.…

Information Theory · Computer Science 2019-01-24 Jing Bai , Yongchao Wang , Francis C. M. Lau

We propose computationally efficient encoders and decoders for lossy compression using a Sparse Regression Code. The codebook is defined by a design matrix and codewords are structured linear combinations of columns of this matrix. The…

Information Theory · Computer Science 2014-05-20 Ramji Venkataramanan , Tuhin Sarkar , Sekhar Tatikonda

This study focuses on the efficiency of message-passing-based decoding algorithms for polar and low-density parity-check (LDPC) codes. Both successive cancellation (SC) and belief propagation (BP) decoding algorithms are studied {in} the…

Information Theory · Computer Science 2023-04-24 Dawei Yin , Yuan Li , Xianbin Wang , Jiajie Tong , Huazi Zhang , Jun Wang , Guanghui Wang , Jun Chen , Guiying Yan , Zhiming Ma , Wen Tong

In streaming applications, doping improves the performance of spatially-coupled low-density parity-check (SC-LDPC) codes by creating reduced-degree check nodes in the coupled chain. We formulate a scaling law to predict the bit and block…

Information Theory · Computer Science 2021-04-23 Roman Sokolovskii , Alexandre Graell i Amat , Fredrik Brännström

Ensuring extremely high reliability in channel coding is essential for 6G networks. The next-generation of ultra-reliable and low-latency communications (xURLLC) scenario within 6G networks requires frame error rate (FER) below $10^{-9}$.…

Information Theory · Computer Science 2024-11-18 Hee-Youl Kwak , Dae-Young Yun , Yongjune Kim , Sang-Hyo Kim , Jong-Seon No
‹ Prev 1 8 9 10 Next ›