An encoding procedure and a decoding procedure for a new modified Huffman code

Ming-I Lu, Chang-Fuu Chen
{"title":"An encoding procedure and a decoding procedure for a new modified Huffman code","authors":"Ming-I Lu, Chang-Fuu Chen","doi":"10.1109/29.45625","DOIUrl":null,"url":null,"abstract":"The conventional Huffman table, which stores a set of code words with different lengths, is difficult to construct. An easily constructed table that includes a code-length array and an encoding mapping array can accompany an encoding procedure to replace the conventional Huffman table. The code-length array records the number of code words of the same length, and the index of this array represents the code length. The encoding mapping array records the indexes of the probability vector for the corresponding symbols, with the elements of the probability vector in decreasing order. The code word generated by the encoding procedure is a new modified Huffman code that can be decoded by a simple procedure. The hardware structure for the encoding and decoding procedures is presented. The required maximum number of clock cycles for encoding and decoding are (N+1) and (N+2), respectively, where N is the number of symbols in the source alphabet. The encoding procedure can accompany the generation of the code-length array, replacing many Huffman tables required in the coding system with a time-varying probability vector. The algorithm has a good performance with respect to speed and memory requirements.<<ETX>>","PeriodicalId":81490,"journal":{"name":"IEEE transactions on acoustics, speech, and signal processing","volume":"23 1","pages":"128-136"},"PeriodicalIF":0.0000,"publicationDate":"1990-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE transactions on acoustics, speech, and signal processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/29.45625","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 12

Abstract

The conventional Huffman table, which stores a set of code words with different lengths, is difficult to construct. An easily constructed table that includes a code-length array and an encoding mapping array can accompany an encoding procedure to replace the conventional Huffman table. The code-length array records the number of code words of the same length, and the index of this array represents the code length. The encoding mapping array records the indexes of the probability vector for the corresponding symbols, with the elements of the probability vector in decreasing order. The code word generated by the encoding procedure is a new modified Huffman code that can be decoded by a simple procedure. The hardware structure for the encoding and decoding procedures is presented. The required maximum number of clock cycles for encoding and decoding are (N+1) and (N+2), respectively, where N is the number of symbols in the source alphabet. The encoding procedure can accompany the generation of the code-length array, replacing many Huffman tables required in the coding system with a time-varying probability vector. The algorithm has a good performance with respect to speed and memory requirements.<>
一种新的修改的霍夫曼码的编码程序和解码程序
传统的霍夫曼表存储一组不同长度的码字,很难构造。包含代码长度数组和编码映射数组的易于构造的表可以伴随编码过程来取代传统的霍夫曼表。码长数组记录相同长度的码字数,该数组的索引表示码长。编码映射数组记录对应符号的概率向量的索引,概率向量的元素从小到大。编码过程产生的码字是一种新的修改后的霍夫曼码,可以通过一个简单的程序解码。给出了编码和解码过程的硬件结构。编码和解码所需的最大时钟周期数分别为(N+1)和(N+2),其中N是源字母表中的符号数。编码过程可以伴随着码长数组的生成,用时变概率向量代替编码系统中所需的许多霍夫曼表。该算法在速度和内存要求方面都有很好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书