Fast Fixed-to-Fixed Distribution Matching via Huffman Coding

IF 4.5 3区计算机科学 Q2 TELECOMMUNICATIONS

IEEE Communications Letters Pub Date : 2026-02-10 DOI:10.1109/LCOMM.2026.3663346

Ehsan Nassaji;Dmitri Truhachev

引用次数: 0

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.

查看原文本刊更多论文

基于霍夫曼编码的固定到固定分布快速匹配

提出了一种基于霍夫曼编码和输入序列随机变换的固定到固定（F2F）长度分布匹配方法。该算法占用内存少，复杂度低，性能与枚举球体成形（ESS）几乎相同。此外，该算法提高了匹配和解匹配的速度，显著降低了延迟，特别是在接收端。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

IEEE Communications Letters 工程技术-电信学

CiteScore

8.10

自引率

7.30%

发文量

590

审稿时长

2.8 months

期刊介绍： The IEEE Communications Letters publishes short papers in a rapid publication cycle on advances in the state-of-the-art of communication over different media and channels including wire, underground, waveguide, optical fiber, and storage channels. Both theoretical contributions (including new techniques, concepts, and analyses) and practical contributions (including system experiments and prototypes, and new applications) are encouraged. This journal focuses on the physical layer and the link layer of communication systems.