English
Related papers

Related papers: Probabilistically-Shaped Coded Modulation with Har…

200 papers

A new variant of bit interleaved coded modulation (BICM) is proposed. In the new scheme, called Parallel BICM, L identical binary codes are used in parallel using a mapper, a newly proposed finite-length interleaver and a binary dither…

Information Theory · Computer Science 2010-08-18 Amir Ingber , Meir Feder

We introduce a novel soft-aided hard-decision decoder for product codes adopting bit marking via updated reliabilities at each decoding iteration. Gains up to 0.8 dB vs. standard iterative bounded distance decoding and up to 0.3 dB vs. our…

Information Theory · Computer Science 2019-06-25 Gabriele Liga , Alireza Sheikh , Alex Alvarado

Lossy image compression is a many-to-one process, thus one bitstream corresponds to multiple possible original images, especially at low bit rates. However, this nature was seldom considered in previous studies on image compression, which…

Image and Video Processing · Electrical Eng. & Systems 2021-10-01 Haichuan Ma , Dong Liu , Cunhui Dong , Li Li , Feng Wu

Motivated by the recent developments in the Space Shift Keying (SSK) and Spatial Modulation (SM) systems which employ Time-Orthogonal Pulse Shaping (TOPS) filters to achieve transmit diversity gains, we propose TOPS for Space-Time Block…

Information Theory · Computer Science 2012-04-26 Rakshith Rajashekar , K. V. S. Hari

The root raised-cosine pulse commonly used in linear digital modulations yields exactly two intersymbol interference components from the preceding and the subsequent data symbols, provided that the roll-off factor is $100\%$ and the…

Information Theory · Computer Science 2023-01-05 Pavel Loskot

High-rate product codes (PCs) and staircase codes (SCs) are ubiquitous codes in high-speed optical communication achieving near-capacity performance on the binary symmetric channel. Their success is mostly due to very efficient iterative…

Information Theory · Computer Science 2022-01-19 Lukas Rapp , Laurent Schmalen

The rate flexibility and probabilistic shaping gain of $4$-dimensional signaling is experimentally tested for short-reach, unrepeated transmission. A rate granularity of 0.5 bits/QAM symbol is achieved with a distribution matcher based on a…

Constellation shaping is a well-established method to improve upon a regular quadrature amplitude modulation (QAM). It is known that the gain achieved by any shaping method for an additive white Gaussian noise (AWGN) channel is…

Information Theory · Computer Science 2025-04-28 Kirill Ivanov , Wei Yang , Jing Jiang

We develop two new designs of unitary differential space-time modulation (DSTM) with low decoding complexity. Their decoder can be separated into a few parallel decoders, each of which has a decoding search space of less than sqrt(N) if the…

Information Theory · Computer Science 2008-06-23 Chau Yuen , Yong Liang Guan , T. T. Tjhung

Bit-interleaved coded modulation (BICM) and multilevel coded modulation (MLC) are commonly used to combine polar codes with high order modulation. While BICM benefits from simple design and the separation of coding and modulation, MLC shows…

Information Theory · Computer Science 2022-02-16 Hanwen Yao , Jinfeng Du , Alexander Vardy

Segmentation-based image coding methods provide high compression ratios when compared with traditional image coding approaches like the transform and sub band coding for low bit-rate compression applications. In this paper, a…

Computer Vision and Pattern Recognition · Computer Science 2012-11-12 Rehna V. J. , M. K. Jeyakumar

We present an autoregressive end-to-end learning approach for probabilistic shaping on nonlinear fiber channels. Our proposed scheme learns the joint symbol distribution and provides a 0.3-bits/2D achievable information rate gain over an…

Machine Learning · Computer Science 2025-07-23 Mohammad Taha Askari , Lutz Lampe , Amirhossein Ghazisaeidi

We propose an improved soft-aided decoding scheme for product codes that approaches the decoding performance of conventional soft-decision TPD with only a 0.2 dB gap while keeping the complexity and internal decoder data flow similarly low…

Information Theory · Computer Science 2022-07-12 Sisi Miao , Lukas Rapp , Laurent Schmalen

This document proposes binomial integer parameters for the cascaded Delta-Sigma-modulator structure with distributed feedback and distributed feedforward input and multi-bit output. It is demonstrated that high orders can be achieved with…

Signal Processing · Electrical Eng. & Systems 2025-11-14 Martin J. W. Schubert

In this work, a new fast-decodable space-time block code (STBC) is proposed. The code is full-rate and full-diversity for 4x2 multiple-input multiple-output (MIMO) transmission. Due to the unique structure of the codeword, the proposed code…

Information Theory · Computer Science 2014-01-08 Ming Liu , Maryline Hélard , Jean-François Hélard , Matthieu Crussière

We propose a novel decoding algorithm for staircase codes which reduces the effect of undetected component code miscorrections. The algorithm significantly improves performance, while retaining a low-complexity implementation suitable for…

Information Theory · Computer Science 2017-09-21 Christian Häger , Henry D. Pfister

We investigate the possibility of developing physical layer network coding (PNC) schemes with embedded strong secrecy based on standard QAM modulators. The proposed scheme employs a triple binning approach at the QAM front-end of the…

Cryptography and Security · Computer Science 2014-07-04 Arsenia Chorti , Mehdi M. Molu , David Karpuk , Camilla Hollanti , Alister Burr

The so-called improved soft-aided bit-marking algorithm was recently proposed for staircase codes (SCCs) in the context of fiber optical communications. This algorithm is known as iSABM-SCC. With the help of channel soft information, the…

Information Theory · Computer Science 2021-05-13 Yi Lei , Bin Chen , Gabriele Liga , Alex Alvarado

The hierarchical distribution matching (Hi-DM) approach for probabilistic shaping is described. The potential of Hi-DM in terms of trade-off between performance,complexity, and memory is illustrated through three case studies.

Information Theory · Computer Science 2020-02-20 Stella Civelli , Marco Secondini

We present a scheme of probabilistic dense coding via a quantum channel of non-maximally entangled three-particle state. The quantum dense coding will be succeeded with a certain probability if the sender introduces an auxiliary particle…

Quantum Physics · Physics 2010-02-10 Zhang Guo-Hua , Yan Feng-Li
‹ Prev 1 3 4 5 6 7 10 Next ›