English
Related papers

Related papers: Polarization-Dependent Loss Mitigation via Orthogo…

200 papers

We demonstrate, for a widely used model of channels with polarization dependent loss (PDL), that channel capacity is achieved by a simple interference cancellation scheme in conjunction with a universal precoder. Crucially, the proposed…

Information Theory · Computer Science 2023-03-22 Mohannad Shehadeh , Frank R. Kschischang

We investigate the impact of polarization-dependent loss (PDL) on the linearly coded digital phase conjugation (DPC) techniques in coherent optical orthogonal frequency division multiplexing (CO-OFDM) superchannel systems. We consider two…

Signal Processing · Electrical Eng. & Systems 2021-06-30 O. S. Sunish Kumar , A. Amari , O. A. Dobre , R. Venkatesan

Polarization dependent loss (PDL) is a serious problem that hinders the transfer of polarization qubits through quantum networks. Recently it has been shown that the detrimental effects of PDL on qubit fidelity can be compensated for with…

Quantum Physics · Physics 2019-09-18 R. A. Brewster , B. T. Kirby , J. D. Franson , M. Brodsky

The polar codes are proven to be capacity-achieving and are shown to have equivalent or even better finite-length performance than the turbo/LDPC codes under some improved decoding algorithms over the additive white Gaussian noise (AWGN)…

Information Theory · Computer Science 2014-05-20 Kai Chen , Kai Niu , Jiaru Lin

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

The outage probability limit is a fundamental and achievable lower bound on the word error rate of coded communication systems affected by fading. This limit is mainly determined by two parameters: the diversity order and the coding gain.…

Information Theory · Computer Science 2012-10-05 Dieter Duyck , Joseph Jean Boutros , Marc Moeneclaey

This paper presents the first proof of polarization for the deletion channel with a constant deletion rate and a regular hidden-Markov input distribution. A key part of this work involves representing the deletion channel using a trellis…

Information Theory · Computer Science 2020-07-24 Ido Tal , Henry D. Pfister , Arman Fazeli , Alexander Vardy

The orthogonal delay-Doppler (DD) division multiplexing(ODDM) modulation has been recently proposed as a promising modulation scheme for next-generation communication systems with high mobility. Despite its benefits, ODDM modulation and…

Signal Processing · Electrical Eng. & Systems 2024-12-24 Yiyan Ma , Akram Shafie , Jinhong Yuan , Guoyu Ma , Zhangdui Zhong , Bo Ai

This paper presents a polarization-driven (PD) shortening technique for the design of rate-compatible polar codes. The proposed shortening strategy consists of reducing the generator matrix by relating its row index with the channel…

Information Theory · Computer Science 2018-08-02 R. M. Oliveira , R. C. de Lamare

Quantum reading provides a general framework where to formulate the statistical discrimination of quantum channels. Several paths have been taken for such a problem. However, there is much to be done in the avenue of optimizing channel…

Information Theory · Computer Science 2022-06-22 Francisco Revson F. Pereira , Stefano Mancini

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

Delivering a well defined state of polarization over hollow core fibres (HCFs) is pivotal for next generation ultra stable photonic systems. Yet in all existing HCFs, whether birefringent or not, their polarization extinction ratio (PER)…

A pruned variant of polar coding is reinvented for all binary erasure channels. For small $\varepsilon>0$, we construct codes with block length $\varepsilon^{-5}$, code rate $\text{Capacity}-\varepsilon$, error probability $\varepsilon$,…

Information Theory · Computer Science 2018-12-20 Hsin-Po Wang , Iwan Duursma

Recently, multi-user multiple input multiple output (MU-MIMO) systems with low-resolution digital-to-analog converters (DACs) has received considerable attention, owing to the capability of dramatically reducing the hardware cost. Besides,…

Signal Processing · Electrical Eng. & Systems 2019-05-16 Lei Chu , Fei Wen , Robert Caiming Qiu

We show that the KLM scheme [Knill, Laflamme and Milburn, Nature {\bf 409}, 46] can be implemented using polarization encoding, thus reducing the number of path modes required by half. One of the main advantages of this new implementation…

Quantum Physics · Physics 2016-09-08 Federico M. Spedalieri , Hwang Lee , Jonathan P. Dowling

Polar codes have become one of the most favorable capacity achieving error correction codes (ECC) along with their simple encoding method. However, among the very few prior successive cancellation (SC) polar decoder designs, the required…

Hardware Architecture · Computer Science 2011-11-04 Chuan Zhang , Bo Yuan , Keshab K. Parhi

We prove that, for all binary-input symmetric memoryless channels, polar codes enable reliable communication at rates within $\epsilon > 0$ of the Shannon capacity with a block length, construction complexity, and decoding complexity all…

Information Theory · Computer Science 2013-11-19 Venkatesan Guruswami , Patrick Xia

Polar codes have gained significant attention in channel coding for their ability to approach the capacity of binary input discrete memoryless channels (B-DMCs), thanks to their reliability and efficiency in transmission. However, existing…

Information Theory · Computer Science 2025-01-30 Jiaxing Li , Shuwen Zhang , Zhisong Bie

Existing polar coding schemes for the two-user interference channel follow the original idea of Han and Kobayashi, in which component messages are encoded independently and then mapped by some deterministic functions (i.e., homogeneous…

Information Theory · Computer Science 2018-07-03 Mengfan Zheng , Cong Ling , Wen Chen , Meixia Tao

Typically, forward error correction (FEC) codes are designed based on the minimization of the error rate for a given code rate. However, for applications that incorporate hybrid automatic repeat request (HARQ) protocol and adaptive…

Information Theory · Computer Science 2018-11-07 Hossein Khoshnevis , Ian Marsland , Halim Yanikomeroglu
‹ Prev 1 2 3 10 Next ›