English
Related papers

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

200 papers

In this work, we develop a pair of rate-diverse encoder and decoder for a two-user Gaussian multiple access channel (GMAC). The proposed scheme enables the users to transmit with the same codeword length but different coding rates under…

Information Theory · Computer Science 2021-03-23 Pingping Chen , Long Shi , Yi Fang , Francis C. M. Lau , Jun Cheng

This paper presents polarized element-pair (EP) codes for polarization-adjusted finite-field multiple-access (PA-FFMA) systems. The core innovation of FFMA systems lies in their unique processing order that exchanges the conventional…

Information Theory · Computer Science 2025-06-10 Zhang-li-han Liu , Qi-yue Yu

In this paper, a new approach for multiple access (MA) in fifth generation (5G) of cellular networks called power domain sparse code multiple access (PSMA) is proposed. In PSMA, we adopt both the power domain and the code domain to transmit…

Information Theory · Computer Science 2017-06-21 Nader Mokari , Mohammad. R Javan , Mohammad Moltafet , Hamid Saeedi , Hossein Pishro-Nik

This study focuses on (traditional and unsourced) multiple-access communication over a single transmit and multiple ($M$) receive antennas. We assume full or partial channel state information (CSI) at the receiver. It is known that to fully…

Information Theory · Computer Science 2023-07-04 Alexander Fengler , Alejandro Lancho , Yury Polyanskiy

Non-orthogonal multiple access (NoMA) as an efficient way of radio resource sharing has been identified as a promising technology in 5G to help improving system capacity, user connectivity, and service latency in 5G communications. This…

Information Theory · Computer Science 2018-12-13 Xiangming Meng , Yiqun Wu , Chao Wang , Yan Chen

Polar codes are constructed for arbitrary channels by imposing an arbitrary quasigroup structure on the input alphabet. Just as with "usual" polar codes, the block error probability under successive cancellation decoding is…

Information Theory · Computer Science 2016-06-16 Rajai Nasser , Emre Telatar

Research on polar codes has been constantly gaining attention over the last decade, by academia and industry alike, thanks to their capacity-achieving error-correction performance and low-complexity decoding algorithms. Recently, they have…

Information Theory · Computer Science 2020-06-25 Carlo Condo , Valerio Bioglio , Ingmar Land

We describe a novel approach to interpret a polar code as a low-density parity-check (LDPC)-like code with an underlying sparse decoding graph. This sparse graph is based on the encoding factor graph of polar codes and is suitable for…

Information Theory · Computer Science 2018-05-15 Sebastian Cammerer , Moustafa Ebada , Ahmed Elkelesh , Stephan ten Brink

Sparse Code Multiple Access (SCMA) is an enabling code-domain non-orthogonal multiple access (NOMA)scheme for massive connectivity and ultra low-latency in future machine-type communication networks. As an evolved variant of code division…

Information Theory · Computer Science 2021-05-17 Saumya Chaturvedi , Zilong Liu , Vivek Ashok Bohara , Anand Srivastava , Pei Xiao

Polar codes are a class of linear block codes that provably achieves channel capacity. They have been selected as a coding scheme for the control channel of enhanced mobile broadband (eMBB) scenario for $5^{\text{th}}$ generation wireless…

Hardware Architecture · Computer Science 2020-06-04 Furkan Ercan , Thibaud Tonnellier , Carlo Condo , Warren J. Gross

Even though polar codes were adopted in the latest 5G cellular standard, they still have the fundamental problem of high decoding latency. Aiming at solving this problem, a fast simplified successive cancellation (Fast-SSC) decoder based on…

Information Theory · Computer Science 2020-08-20 Haotian Zheng , Alexios Balatsoukas-Stimming , Zizheng Cao , Ton Koonen

Polar codes are constructed for m-user multiple access channels (MAC) whose input alphabet size is a prime number. The block error probability under successive cancelation decoding decays exponentially with the square root of the block…

Information Theory · Computer Science 2011-12-09 Rajai Nasser

Motivated by the growing application of wireless multi-access networks with stringent delay constraints, we investigate the Gaussian multiple access channel (MAC) in the finite blocklength regime. Building upon information spectrum…

Information Theory · Computer Science 2013-09-11 Ebrahim MolavianJazi , J. Nicholas Laneman

Next-generation multiple access (NGMA) serves as an umbrella term for transmission schemes distinct from conventional orthogonal methods. A key candidate of NGMA, non-orthogonal multiple access (NOMA), emerges as a solution to enhance…

Information Theory · Computer Science 2024-10-02 Hamid Jafarkhani , Hossein Maleki , Mojtaba Vaezi

This paper revisits polar code design for a binary-input additive white Gaussian noise (BI-AWGN) channel when successive cancellation (SC) decoding is applied at the receiver. We focus on the reciprocal channel approximation (RCA), which is…

Information Theory · Computer Science 2022-04-25 Hideki Ochiai , Kosuke Ikeya , Patrick Mitran

Polar codes are the first provable capacity-achieving forward error correction (FEC) codes. In general polar codes can be decoded via either successive cancellation (SC) or belief propagation (BP) decoding algorithm. However, to date…

Information Theory · Computer Science 2014-11-27 Bo Yuan , Keshab K. Parhi

This paper focuses on an improved Gaussian approximation (GA) based construction of polar codes with successive cancellation (SC) decoding over an additive white Gaussian noise (AWGN) channel. Arikan has proven that polar codes with…

Information Theory · Computer Science 2020-10-08 Hideki Ochiai , Patrick Mitran , H. Vincent Poor

Non-orthogonal multiple access (NOMA) is a powerful transmission technique that enhances the spectral efficiency of communication links, and is being investigated for 5G standards and beyond. A major drawback of NOMA is the need to apply…

Information Theory · Computer Science 2022-10-18 Abdelhamid Salem , Xiao Tong , Ang Li , Christos Masouros

A capacity-achieving scheme based on polar codes is proposed for reliable communication over multi-channels which can be directly applied to bit-interleaved coded modulation schemes. We start by reviewing the ground-breaking work of polar…

Information Theory · Computer Science 2013-02-04 Hessam Mahdavifar , Mostafa El-Khamy , Jungwon Lee , Inyup Kang

This paper considers the Gaussian multiple-access channel (MAC) in the asymptotic regime where the number of users grows linearly with the code length. We propose efficient coding schemes based on random linear models with approximate…

Information Theory · Computer Science 2022-05-04 Kuan Hsieh , Cynthia Rush , Ramji Venkataramanan