FPGA implementation of distribution matching and dematching

Yoshida, Tsuyoshi; Binkai, Masashi; Koshikawa, Shota; Chikamori, Shun; Matsuda, Keisuke; Suzuki, N.; Karlsson, Magnus; Agrell, Erik

doi:10.1049/cp.2019.0783

Cited by 14 publications

(17 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Fig. 5 shows the ROSNR gap without and with a DM rate loss of 0.1 bpcu, which is a realistic value for DM implementations for optical fiber communications [22,23] . The overall performances of BICM and MLC are similar.…”

Section: Results: Rosnrs In Bicm and Mlcmentioning

confidence: 99%

Required and Received SNRs in Coded Modulation

Yoshida

Igarashi

Binkai

et al. 2020

2020 European Conference on Optical Communications (ECOC)

View full text Add to dashboard Cite

show abstract

Section: Results: Rosnrs In Bicm and Mlcmentioning

confidence: 99%

Required and Received SNRs in Coded Modulation

Yoshida

Igarashi

Binkai

et al. 2020

2020 European Conference on Optical Communications (ECOC)

View full text Add to dashboard Cite

show abstract

“…Finally, we note that in this section, we restrict our attention to algorithmic implementation, while aspects related with hardware implementation such as throughput, clock frequency, and number of instances are outside the scope of this paper. For a detailed discussion on these concepts, shaping algorithms that are discussed in this work should actually be implemented as in [ 102 , 103 , 104 , 105 ].…”

Section: Approximate Complexity Discussionmentioning

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

“…To achieve the target information rate, we adjust the PS code rate CA based on (1) and (2), where each PS frame encodes 128 PS-256-QAM or PS-64-QAM symbols, or 256 PS-16-QAM symbols. For the PS encoding, we employed hierarchical distribution matching to form the probability mass function of the symbols [5,12]. The shaping gap from the ideal Maxwell-Boltzmann distribution is less than 0.3 dB.…”

Section: Rate Adaptation Performance and Power Consumptionmentioning

confidence: 99%