English
Related papers

Related papers: Multi-User SR-LDPC Codes via Coded Demixing with A…

200 papers

We address the problem of constructing of coding schemes for the channels with high-order modulations. It is known, that non-binary LDPC codes are especially good for such channels and significantly outperform their binary counterparts.…

Information Theory · Computer Science 2017-02-09 Valeriya Potapova , Alexey Frolov

In this paper, we investigate a joint device activity detection (DAD), channel estimation (CE), and data decoding (DD) algorithm for multiple-input multiple-output (MIMO) massive unsourced random access (URA). Different from the…

Information Theory · Computer Science 2021-12-20 Tianya Li , Yongpeng Wu , Mengfan Zheng , Wenjun Zhang , Chengwen Xing , Jianping An , Xiang-Gen Xia , Chengshan Xiao

Low-density parity-check (LDPC) codes have been successfully commercialized in communication systems due to their strong error correction capabilities and simple decoding process. However, the error-floor phenomenon of LDPC codes, in which…

Information Theory · Computer Science 2023-10-31 Hee-Youl Kwak , Dae-Young Yun , Yongjune Kim , Sang-Hyo Kim , Jong-Seon No

We propose a novel construction of product codes for high-density magnetic recording based on binary low-density parity check (LDPC) codes and binary image of Reed Solomon (RS) codes. Moreover, two novel algorithms are proposed to decode…

Information Theory · Computer Science 2012-01-06 Vo Tam Van , Seiichi Mita

In this paper we consider the generalization of binary spatially coupled low-density parity-check (SC-LDPC) codes to finite fields GF$(q)$, $q\geq 2$, and develop design rules for $q$-ary SC-LDPC code ensembles based on their iterative…

Information Theory · Computer Science 2014-11-18 Lai Wei , David G. M. Mitchell , Thomas E. Fuja , Daniel J. Costello

An algorithm is proposed to encode low-density parity-check (LDPC) codes into codewords with a non-uniform distribution. This enables power-efficient signalling for asymmetric channels. We show gains of 0.9 dB for additive white Gaussian…

Information Theory · Computer Science 2023-05-24 Thomas Wiegart , Linfang Wang , Diego Lentner , Richard D. Wesel

Optical Wireless Communication networks (OWC) has emerged as a promising technology that enables high-speed and reliable communication bandwidth for a variety of applications. In this work, we investigated applying Random Linear Network…

Information Theory · Computer Science 2023-05-09 Ahmed Ali Hassan , Ahmed Adnan Qidan , Taisir Elgorashi , Jaafar Elmirghani

This paper suggests achieving diversity gains while utilizing low-denisty parity check (LDPC) codes in molecular communications. Intersymbol interference (ISI) causes a significant disadvantage in error performance for molecular…

Signal Processing · Electrical Eng. & Systems 2024-12-06 Alpar Türkoğlu , Berk Karabacakoğlu , Ali Emre Pusane

The design of low-density parity-check (LDPC) code ensembles optimized for a finite number of decoder iterations is investigated. Our approach employs EXIT chart analysis and differential evolution to design such ensembles for the binary…

Information Theory · Computer Science 2016-11-17 Ian P. Mulholland , Enrico Paolini , Mark F. Flanagan

Code-domain non-orthogonal multiple access (CD-NOMA) systems offer key benefits such as high spectral efficiency, low latency, high reliability, and massive connectivity. NOMA's ability to handle overloading allows multiple devices to share…

Signal Processing · Electrical Eng. & Systems 2024-10-23 Vinjamoori Vikas , Kuntal Deka , A. Rajesh

We propose iterative detection and decoding (IDD) algorithms with Low-Density Parity-Check (LDPC) codes for Multiple Input Multiple Output (MIMO) systems operating in block-fading and fast Rayleigh fading channels. Soft-input soft-output…

Information Theory · Computer Science 2016-11-17 André Uchoa , Cornelius T. Healy , Rodrigo C. de Lamare

A closed-form analytical expression is derived for the limiting empirical squared singular value density of a spreading (signature) matrix corresponding to sparse low-density code-domain (LDCD) non-orthogonal multiple-access (NOMA) with…

Information Theory · Computer Science 2017-05-10 Ori Shental , Benjamin M. Zaidel , Shlomo Shamai

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

Sparse code multiple access (SCMA) is a new frequency domain non-orthogonal multiple-access technique which can improve spectral efficiency of wireless radio access. With SCMA, different incoming data streams are directly mapped to…

Information Theory · Computer Science 2016-11-18 Hosein Nikopour , Eric Yi , Alireza Bayesteh , Kelvin Au , Mark Hawryluck , Hadi Baligh , Jianglei Ma

This paper investigates practical 5G strategies for power-balanced non-orthogonal multiple access (NOMA). By allowing multiple users to share the same time and frequency, NOMA can scale up the number of served users and increase spectral…

Information Theory · Computer Science 2017-01-25 Haoyuan Pan , Lu Lu , Soung Chang Liew

Spatially coupled low-density parity-check (SC-LDPC) codes are sparse graph codes that have recently become of interest due to their capacity-approaching performance on memoryless binary input channels. In this paper, we unify all existing…

Information Theory · Computer Science 2017-10-11 Allison Beemer , Salman Habib , Christine A. Kelley , Joerg Kliewer

This letter describes how to improve performance of cellular systems by combining non-equiprobable signaling (shaping) with low-density parity check (LDPC) coding for an orthogonal frequency division multiplexing system. We focus on…

Signal Processing · Electrical Eng. & Systems 2026-02-03 Sandesh Rao Mattu , Nishant Mehrotra , Robert Calderbank

This paper is focused on code-domain non-orthogonal multiple access (CD-NOMA), which is an emerging paradigm to support massive connectivity for future machine-type wireless networks. We take a comparative approach to study two types of…

Information Theory · Computer Science 2020-09-10 Zilong Liu , Lie-Liang Yang

Generalized low-density parity-check (GLDPC) codes, where single parity-check (SPC) constraint nodes are replaced with generalized constraint (GC) nodes, are a promising class of codes for low latency communication. In this paper, a…

Information Theory · Computer Science 2019-10-16 Yanfang Liu , Pablo M. Olmos , David G. M. Mitchell

We consider a noisy Slepian-Wolf problem where two correlated sources are separately encoded (using codes of fixed rate) and transmitted over two independent binary memoryless symmetric channels. The capacity of each channel is…

Information Theory · Computer Science 2012-01-04 Arvind Yedla , Henry D. Pfister , Krishna R. Narayanan