Bit-interleaved coded modulation with iterative decoding using constellation shaping over Rayleigh fading channels

Bouazza, Boubakar Seddik; Djebari, Ali

doi:10.1016/j.aeue.2006.06.005

Cited by 5 publications

(4 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The conventional BICM system used in this study is built from a serial concatenation of a channel encoder, a bit interleaver and M-ary modulator, as shown in Figure 2. The information sequence is first coded by a convolutional encoder to provide coded sequences at its output [14].…”

Section: Structure Of the Bicm-idmentioning

confidence: 99%

Performances of BICM-ID system using CRSC code in optical transmissions

Fekih

Bouazza

Nouri

2020

Journal of Optical Communications

View full text Add to dashboard Cite

Recently, using iterative decoding algorithms to achieve an interesting bit error rate for spectrally efficient modulation become a necessity for optical transmission, in this paper, we propose a coded modulation scheme based on bit interleaving circular recursive systematic convolutional (CRSC) code and 16-QAM modulation. The proposal system considered as a serial concatenation of a channel encoder, a bit interleaver and M-ary modulator can be flexible easy to implement using a short code length. For a spectral efficiency $\eta =3\text{bit}/s/Hz$, the coding gain at a bit error rate of 10−6 is about 8 dB.

show abstract

Section: Structure Of the Bicm-idmentioning

confidence: 99%

Performances of BICM-ID system using CRSC code in optical transmissions

Fekih

Bouazza

Nouri

2020

Journal of Optical Communications

View full text Add to dashboard Cite

show abstract

“…Constellation shaping was investigated for BICM at low SNR in [ 42 ]. PS in BICM was considered for Rayleigh fading channels in [ 43 , 44 ].…”

Section: Introductionmentioning

confidence: 99%

Probabilistic Shaping for Finite Blocklengths: Distribution Matching and Sphere Shaping

Gültekin

Fehenberger

Alvarado

et al. 2020

Entropy

View full text Add to dashboard Cite

In this paper, we provide a systematic comparison of distribution matching (DM) and sphere shaping (SpSh) algorithms for short blocklength probabilistic amplitude shaping. For asymptotically large blocklengths, constant composition distribution matching (CCDM) is known to generate the target capacity-achieving distribution. However, as the blocklength decreases, the resulting rate loss diminishes the efficiency of CCDM. We claim that for such short blocklengths over the additive white Gaussian noise (AWGN) channel, the objective of shaping should be reformulated as obtaining the most energy-efficient signal space for a given rate (rather than matching distributions). In light of this interpretation, multiset-partition DM (MPDM) and SpSh are reviewed as energy-efficient shaping techniques. Numerical results show that both have smaller rate losses than CCDM. SpSh—whose sole objective is to maximize the energy efficiency—is shown to have the minimum rate loss amongst all, which is particularly apparent for ultra short blocklengths. We provide simulation results of the end-to-end decoding performance showing that up to 1 dB improvement in power efficiency over uniform signaling can be obtained with MPDM and SpSh at blocklengths around 200. Finally, we present a discussion on the complexity of these algorithms from the perspectives of latency, storage and computations.

show abstract

“…Signal shaping was investigated for BICM at low SNR in [42]. PS in BICM was considered for Rayleigh fading channels in [43], [44].…”

Section: Introductionmentioning

confidence: 99%

Probabilistic Shaping for Finite Blocklengths: Distribution Matching and Sphere Shaping

Gültekin,

Fehenberger,

Alvarado

et al. 2019

Preprint

View full text Add to dashboard Cite

In this paper, we provide for the first time a systematic comparison of distribution matching (DM) and sphere shaping (SpSh) algorithms for short blocklength probabilistic amplitude shaping. For asymptotically large blocklengths, constant composition distribution matching (CCDM) is known to generate the target capacity-achieving distribution. As the blocklength decreases, however, the resulting rate loss diminishes the efficiency of CCDM. We claim that for such short blocklengths and over the additive white Gaussian channel (AWGN), the objective of shaping should be reformulated as obtaining the most energy-efficient signal space for a given rate (rather than matching distributions). In light of this interpretation, multisetpartition DM (MPDM), enumerative sphere shaping (ESS) and shell mapping (SM), are reviewed as energy-efficient shaping techniques. Numerical results show that MPDM and SpSh have smaller rate losses than CCDM. SpSh-whose sole objective is to maximize the energy efficiency-is shown to have the minimum rate loss amongst all. We provide simulation results of the end-toend decoding performance showing that up to 1 dB improvement in power efficiency over uniform signaling can be obtained with MPDM and SpSh at blocklengths around 200. Finally, we present a discussion on the complexity of these algorithms from the perspective of latency, storage and computations.

show abstract

Bit-interleaved coded modulation with iterative decoding using constellation shaping over Rayleigh fading channels

Cited by 5 publications

References 12 publications

Performances of BICM-ID system using CRSC code in optical transmissions

Performances of BICM-ID system using CRSC code in optical transmissions

Probabilistic Shaping for Finite Blocklengths: Distribution Matching and Sphere Shaping

Probabilistic Shaping for Finite Blocklengths: Distribution Matching and Sphere Shaping

Contact Info

Product

Resources

About