English
Related papers

Related papers: Fourier Analysis of MAC Polarization

200 papers

A rate-dependent upper bound of the best achievable block error probability of polar codes with successive-cancellation decoding is derived.

Information Theory · Computer Science 2010-01-14 Toshiyuki Tanaka , Ryuhei Mori

Polar codes are of great interest since they are the first provably capacity-achieving forward error correction codes. To improve throughput and to reduce decoding latency of polar decoders, maximum likelihood (ML) decoding units are used…

Information Theory · Computer Science 2015-10-27 Chenrong Xiong , Jun Lin , Zhiyuan Yan

Polarization maintaining (PM) fibers are meant to maintain linear polarization along a preferred axis. A PM fiber can be seen as the fiber version of a very high order waveplate, designed with different refractive indices along two…

Source polar coding is a potential solution for short blocklength-based low-latency key generation with limited sources, which is a critical aspect of six generation (6G) Internet of things. However, existing source coding schemes still…

Signal Processing · Electrical Eng. & Systems 2025-10-07 Lulu Song , Di Zhang , Tingting Zhang

Lossy coding of correlated sources over a multiple access channel (MAC) is studied. First, a joint source-channel coding scheme is presented when the decoder has correlated side information. Next, the optimality of separate source and…

Information Theory · Computer Science 2018-06-18 Basak Guler , Deniz Gunduz , Aylin Yener

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 propose a low-complexity, secrecy capacity achieving polar coding scheme for the cognitive interference channel with confidential messages (CICC) under the strong secrecy criterion. Existing polar coding schemes for…

Information Theory · Computer Science 2017-10-30 Mengfan Zheng , Wen Chen , Cong Ling

The capacity of time-varying channels with periodic feedback at the transmitter is evaluated. It is assumed that the channel state information is perfectly known at the receiver and is fed back to the transmitter at the regular…

Information Theory · Computer Science 2007-07-13 Mehdi Ansari Sadrabadi , Mohammad Ali Maddah-Ali , Amir K. Khandani

The capacity region of a two-transmitter Gaussian multiple access channel (MAC) under average input power constraints is studied, when the receiver employs a zero-threshold one-bit analog-to-digital converter (ADC). It is proved that the…

Information Theory · Computer Science 2018-10-17 Borzoo Rassouli , Morteza Varasteh , Deniz Gunduz

We survey coding techniques that enable reliable transmission at rates that approach the capacity of an arbitrary discrete memoryless channel. In particular, we take the point of view of modern coding theory and discuss how recent advances…

Information Theory · Computer Science 2018-01-04 Marco Mondelli , S. Hamed Hassani , Rüdiger Urbanke

Polarization induced by cosmological scalar perturbations leads to a typical anisotropy pattern, which can best be analyzed in Fourier domain. This allows one to unambiguously distinguish cosmological signal of polarization from other…

Astrophysics · Physics 2009-10-28 Uros Seljak

We provide a rigorous definition of a certain kind of characterization for capacity regions of a family of Markoff networks which is based on optimization problems resulting out of calculating conditional mutual information from a finite…

Information Theory · Computer Science 2020-02-24 Mukul Agarwal

A method to polarize channels universally is introduced. The method is based on combining two distinct channels in each polarization step, as opposed to Arikan's original method of combining identical channels. This creates an equal number…

Information Theory · Computer Science 2013-12-30 Eren Sasoglu , Lele Wang

With the evolution from 5G to 6G, ultra-reliable low-latency communication (URLLC) faces increasingly stringent performance requirements. Lower latency constraints demand shorter channel coding lengths, which can severely degrade decoding…

Information Theory · Computer Science 2025-08-07 Yaqi Li , Xiaohu You , Jiamin Li , Chen Ji , Bin Sheng

We study polarization for nonbinary channels with input alphabet of size q=2^r,r=2,3,... Using Arikan's polarizing kernel H_2, we prove that the virtual channels that arise in the process of polarization converge to q-ary channels with…

Information Theory · Computer Science 2012-01-25 Woomyoung Park , Alexander Barg

This paper addresses the problem of distributed state estimation via multiple access channels (MACs). We consider a scenario where two encoders are simultaneously communicating their measurements through a noisy channel. Firstly, the…

Systems and Control · Electrical Eng. & Systems 2022-12-23 Ghassen Zafzouf , Girish N. Nair , Farhad Farokhi

Channel coding over arbitrarily-permuted parallel channels was first studied by Willems et al. (2008). This paper introduces capacity-achieving polar coding schemes for arbitrarily-permuted parallel channels where the component channels are…

Information Theory · Computer Science 2015-03-17 Eran Hof , Igal Sason , Shlomo Shamai , Chao Tian

Recent work by Shehadeh and Kschischang provides a simple capacity-achieving scheme for channels with polarization-dependent loss (PDL) under common modeling assumptions via a careful choice of orthogonal-design-based precoding and…

Information Theory · Computer Science 2025-03-18 Mohannad Shehadeh , Frank R. Kschischang

One of the difficulties with performing polarization analysis is that the mean polarization fraction of sub-divided data sets is larger than the polarization fraction for the integrated measurement. The resulting bias is one of the…

Instrumentation and Methods for Astrophysics · Physics 2018-07-18 Victor Mikhalev

We consider the capacity of memoryless finite-state multiple access channel (FS-MAC) with causal asymmetric noisy state information available at both transmitters and complete state information available at the receiver. Single letter inner…

Information Theory · Computer Science 2011-06-03 Nevroz Şen , Giacomo Como , Serdar Yüksel , Fady Alajaji
‹ Prev 1 8 9 10 Next ›