English
Related papers

Related papers: SPARC-LDPC Coding for MIMO Massive Unsourced Rando…

200 papers

The asymptotic iterative decoding performances of low-density parity-check (LDPC) codes using min-sum (MS) and sum-product (SP) decoding algorithms on memoryless binary-input output-symmetric (MBIOS) channels are analyzed in this paper. For…

Information Theory · Computer Science 2007-07-13 Chun-Hao Hsu , Achilleas Anastasopoulos

A coding scheme based on irregular low-density parity-check (LDPC) codes is proposed to send secret messages from a source over the Gaussian wiretap channel to a destination in the presence of a wiretapper, with the restriction that the…

Information Theory · Computer Science 2016-11-17 Chan Wong Wong , Tan F. Wong , John M. Shea

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

This paper investigates the massive random access for a huge amount of user devices served by a base station (BS) equipped with a massive number of antennas. We consider a grant-free unsourced random access (U-RA) scheme where all users…

Information Theory · Computer Science 2020-09-15 Xinyu Xie , Yongpeng Wu , Junyuan Gao , Wenjun Zhang

The joint design of input constellation and low-density parity-check (LDPC) codes to approach the symmetric capacity of the two-user Gaussian multiple access channel is studied. More specifically, multilevel coding is employed at each user…

Information Theory · Computer Science 2019-05-02 Alexios Balatsoukas-Stimming , Stefano Rini , Joerg Kliewer

Low-density parity-check (LDPC) codes together with belief propagation (BP) decoding yield exceptional error correction capabilities in the large block length regime. Yet, there remains a gap between BP decoding and maximum likelihood…

Information Theory · Computer Science 2025-01-22 Jonathan Mandelbaum , Holger Jäkel , Laurent Schmalen

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

In this paper, we initiate the study of rate-splitting multiple access (RSMA) for a mono-static integrated sensing and communication (ISAC) system, where the dual-functional base station (BS) simultaneously communicates with multiple users…

Information Theory · Computer Science 2024-03-05 Kexin Chen , Yijie Mao , Longfei Yin , Chengcheng Xu , Yang Huang

In this paper, we report an encoding and decoding method for irregular-quasic-cyclic low-density parity-check (IR-QC-LDPC) codes with multi rates. The algorithm is applicable to parity-check matrices which have dual-diagonal parity…

Information Theory · Computer Science 2019-10-31 Kun Cheng , Qiming Lu , Hongbo Xie , Qi Shen , Shengkai Liao , Chengzhi Peng

Centralized Radio Access Network (C-RAN) is a new paradigm for wireless networks that centralizes the signal processing in a computing cloud, allowing commodity computational resources to be pooled. While C-RAN improves utilization and…

Information Theory · Computer Science 2017-02-03 Kyle Whetzel , Matthew C. Valenti

In this paper, a sparse Kronecker-product (SKP) coding scheme is proposed for unsourced multiple access. Specifically, the data of each active user is encoded as the Kronecker product of two component codewords with one being sparse and the…

Information Theory · Computer Science 2021-06-04 Zeyu Han , Xiaojun Yuan , Chongbin Xu , Shuchao Jiang , Xin Wang

In this paper, the application of non-binary low-density parity-check (NBLDPC) codes to MIMO systems which employ hundreds of antennas at both the transmitter and the receiver has been proposed. Together with the well-known low-complexity…

Information Theory · Computer Science 2012-11-22 Puripong Suthisopapan , Kenta Kasai , Anupap Meesomboon , Virasit Imtawil

In this paper, we consider the problem of iterative detection and decoding (IDD) for multi-antenna systems using low-density parity-check (LDPC) codes. The proposed IDD system consists of a soft-input soft-output parallel interference (PIC)…

Information Theory · Computer Science 2013-04-24 Jingjing Liu , Peng Li , Rodrigo C. de Lamare

In this paper, we propose a new detection technique for multiuser multiple-input multiple-output (MU-MIMO) systems. The proposed scheme combines a lattice reduction (LR) transformation, which makes the channel matrix nearly orthogonal, and…

Information Theory · Computer Science 2014-12-09 L. Arevalo , R. C. de Lamare , R. Sampaio-Neto

Sparse superimposed coding (SSC) has emerged as a promising technique for short-packet transmission in ultra-reliable low-latency communication scenarios. However, conventional SSC schemes often suffer from high encoding and decoding…

Signal Processing · Electrical Eng. & Systems 2026-01-23 Yanfeng Zhang , Xi'an Fan , Xu Zhu , Jinkai Zheng , Hui Liang , Weiwei Yang , Tom H. Luan

Unsourced random access (URA) is a recently proposed communication paradigm attuned to machine-driven data transfers. In the original URA formulation, all the active devices share the same number of bits per packet. The scenario where…

Information Theory · Computer Science 2021-02-16 Vamsi K. Amalladinne , Allen Hao , Stefano Rini , Jean-Francois Chamberland

In this paper, we propose a framework of the mutual information-maximizing (MIM) quantized decoding for low-density parity-check (LDPC) codes by using simple mappings and fixed-point additions. Our decoding method is generic in the sense…

Information Theory · Computer Science 2022-02-15 Peng Kang , Kui Cai , Xuan He , Shuangyang Li , Jinhong Yuan

A method for estimating the performance of low-density parity-check (LDPC) codes decoded by hard-decision iterative decoding algorithms on binary symmetric channels (BSC) is proposed. Based on the enumeration of the smallest weight error…

Information Theory · Computer Science 2007-07-13 Hua Xiao , Amir H. Banihashemi

Sparse signatures have been proposed for the CDMA uplink to reduce multi-user detection complexity, but they have not yet been fully exploited for its downlink counterpart. In this work, we propose a Multi-Carrier CDMA (MC-CDMA) downlink…

Information Theory · Computer Science 2017-02-10 Min Li , Chunshan Liu , Stephen V. Hanly

This paper studies randomly spread code-division multiple access (CDMA) and multiuser detection in the large-system limit using the replica method developed in statistical physics. Arbitrary input distributions and flat fading are…

Information Theory · Computer Science 2007-07-13 Dongning Guo , Sergio Verdu