Fast Fixed-to-Fixed Distribution Matching via Huffman Coding

IEEE Communications Letters 2026

View at publisher
Authors: Ehsan Nassaji, Dmitri V. Truhachev
DOI: 10.1109/lcomm.2026.3663346
Cited by: 0
References: 26

Abstract

A fixed-to-fixed (F2F) length distribution matching (DM) based on Huffman coding and a random transformation of the input sequence is presented. The proposed algorithm necessitates small amounts of memory, is low-complexity, and delivers nearly the same performance as the enumerative sphere shaping (ESS). Furthermore, the proposed algorithm increases the speeds of matching and dematching and decreases the latency significantly, especially at the receiver.

Fields of Study & Subjects

Error Correcting Code Techniques Algorithms and Data Compression Advanced Data Compression Techniques

Publication details

Journal / source
IEEE Communications Letters
Volume
30
Pages
1141–1145
Publication date
1 January 2026
Language
EN