English
Related papers

Related papers: Iterative Detection and Decoding of Finite-Length …

200 papers

We introduce a new paradigm for finite precision iterative decoding on low-density parity-check codes over the Binary Symmetric channel. The messages take values from a finite alphabet, and unlike traditional quantized decoders which are…

Information Theory · Computer Science 2012-07-23 Shiva Kumar Planjery , David Declercq , Ludovic Danjean , Bane Vasic

Blind recognition of polar codes remains challenging in non-cooperative scenarios, particularly for information-set recognition with known code length. Existing methods mainly rely on threshold decisions determined by the generator-matrix…

Information Theory · Computer Science 2026-05-14 Changwei Tu , Yang Liu , Xianzhao Feng , Kai Niu

Polar codes has been selected as 5G standard. However, only a couple of ASIC featuring decoders are fabricated,and none of them support list size L > 4 and code length N > 1024. This paper presents an ASIC implementation of three decoders…

Information Theory · Computer Science 2018-07-05 Xiaocheng Liu , Qifan Zhang , Pengcheng Qiu , Jiajie Tong , Huazi Zhang , Changyong Zhao , Jun Wang

Due to the low-latency and high-reliability requirements of 5G, low-complexity node-based successive cancellation list (SCL) decoding has received considerable attention for use in 5G communications systems. By identifying special…

Information Theory · Computer Science 2022-12-21 Yuqing Ren , Andreas Toftegaard Kristensen , Yifei Shen , Alexios Balatsoukas-Stimming , Chuan Zhang , Andreas Burg

We establish area theorems for iterative detection over coded linear systems (including multiple-input multipleoutput (MIMO) channels, inter-symbol-interference (ISI) channels, and orthogonal frequency-division multiplexing (OFDM) systems).…

Information Theory · Computer Science 2012-08-24 Xiaojun Yuan , Li Ping , Chongbin Xu , Aleksandar Kavcic

Polar codes are capacity-achieving error-correcting codes with an explicit construction that can be decoded with low-complexity algorithms. In this work, we show how the state-of-the-art low-complexity decoding algorithm can be improved to…

Information Theory · Computer Science 2016-08-29 Pascal Giard , Alexios Balatsoukas-Stimming , Gabi Sarkis , Claude Thibeault , Warren J. Gross

We consider the CDMA (code-division multiple-access) multi-user detection problem for binary signals and additive white gaussian noise. We propose a spreading sequences scheme based on random sparse signatures, and a detection algorithm…

Information Theory · Computer Science 2007-07-13 Andrea Montanari , David Tse

Spatial coupling is utilized to improve the performance of iterative channel estimation, multiuser detection, and decoding for multiple-input multiple-input (MIMO) bit-interleaved coded modulation (BICM). Coupling is applied to both coding…

Information Theory · Computer Science 2014-12-22 Keigo Takeuchi

A non-orthogonal multiple access (NOMA) inspired integrated sensing and communication (ISAC) system is investigated. A dual-functional base station (BS) serves multiple communication users while sensing multiple targets, by transmitting the…

Information Theory · Computer Science 2021-12-20 Zhaolin Wang , Yuanwei Liu , Xidong Mu , Zhiguo Ding

Mission critical Machine-type Communication, also referred to as Ultra-reliable Low Latency Communication is primarily characterized by communication that provides ultra-high reliability and very low latency to concurrently transmit short…

Networking and Internet Architecture · Computer Science 2021-10-07 Najib Ahmed Mohammed , Ali Mohammed Mansoor , Rodina Binti Ahmad , Saaidal Razalli Bin Azzuhri

Non-orthogonal multiple access (NOMA) is a part of 5th generation (5G) communication systems. This article presents the underpinnings and underlying structures of the problem of NOMA user-channel allocation. Unlike the heuristics for NOMA…

Signal Processing · Electrical Eng. & Systems 2019-06-25 Shabnam Sodagari

We propose an improvement of the random spreading approach with polar codes for unsourced multiple access. Each user encodes its message by a polar code, and the coded bits are then spread using a random spreading sequence. The proposed…

Information Theory · Computer Science 2021-08-30 Mohammad Javad Ahmadi , Tolga M. Duman

Polar codes are a new family of error correction codes for which efficient hardware architectures have to be defined for the encoder and the decoder. Polar codes are decoded using the successive cancellation decoding algorithm that includes…

Hardware Architecture · Computer Science 2015-01-12 Guillaume Berhault , Camille Leroux , Christophe Jego , Dominique Dallet

A polar coding scheme for fading channels is proposed in this paper. More specifically, the focus is Gaussian fading channel with a BPSK modulation technique, where the equivalent channel could be modeled as a binary symmetric channel with…

Information Theory · Computer Science 2013-04-16 Hongbo Si , O. Ozan Koyluoglu , Sriram Vishwanath

A scheme for concatenating the recently invented polar codes with non-binary MDS codes, as Reed-Solomon codes, is considered. By concatenating binary polar codes with interleaved Reed-Solomon codes, we prove that the proposed concatenation…

Information Theory · Computer Science 2016-11-17 Hessam Mahdavifar , Mostafa El-Khamy , Jungwon Lee , Inyup Kang

The problem of phase-noise compensation for correlated phase noise in coded multichannel optical transmission is investigated. To that end, a simple multichannel phase-noise model is considered and the maximum a posteriori detector for this…

Information Theory · Computer Science 2019-10-15 Arni F. Alfredsson , Erik Agrell , Henk Wymeersch

We characterize the fundamental limits of transmission of information over a Gaussian multiple access channel (MAC) with the use of variable-length feedback codes and under a non-vanishing error probability formalism. We develop new…

Information Theory · Computer Science 2018-01-10 Lan V. Truong , Vincent Y. F. Tan

Polar codes are the first codes with a proven capacity-achieving capability, but their decoding faces several challenges, especially under long code lengths. In this paper, we target algorithmic improvements and analyses to enable the…

Information Theory · Computer Science 2026-05-22 Jiajie Li , Sihui Shen , Warren J. Gross

This paper investigates decoding of binary linear block codes over the binary erasure channel (BEC). Of the current iterative decoding algorithms on this channel, we review the Recovery Algorithm and the Guess Algorithm. We then present a…

Information Theory · Computer Science 2007-07-13 J. Cai , C. Tjhai , M. Tomlinson , M. Ambroze , M. Ahmed

MIMO-NOMA combines Multiple-Input Multiple-Output (MIMO) and Non-Orthogonal Multiple Access (NOMA), which can address heterogeneous challenges, such as massive connectivity, low latency, and high reliability. In this paper, a practical…

Information Theory · Computer Science 2018-07-19 Yuhao Chi , Lei Liu , Guanghui Song , Chau Yuen , Yong Liang Guan , Ying Li