Yan Wu
ABSTRACT
An efficient parallelized Huffman decoding PE is proposed in this paper. The classic Huffman decoding algorithm is optimized first in parallel processing and then four hardware modules are designed based on that. The proposed PE can decode different numbers of streams with various compression ratios. The hardware architecture is fully verified at RTL level and synthesized with GF 12nm technology lib. The simulation shows a better decoding performance especially with wide data width and high compression ratio settings.
- Alistair Moffat. 2019. Huffman Coding. ACM Comput. Surv. 52, 4, Article 85 (September 2019), 35 pages. DOI:https://doi.org/10.1145/3342555Google Scholar
Digital Library
- Satyabrata Sarangi and Bevan Baas. 2021. Canonical Huffman Decoder on Fine-grain Many-core Processor Arrays. In Proceedings of the 26th Asia and South Pacific Design Automation Conference (ASPDAC '21). Association for Computing Machinery, New York, NY, USA, 512–517. DOI:https://doi.org/10.1145/3394885.3431424S.Google ScholarDigital Library
- Hoang-Anh Pham, Van-Hieu Bui, and Anh-Vu Dinh-Duc. 2009. An adaptive, memory-efficient and fast algorithm for Huffman decoding and its implementation. In Proceedings of the 2nd International Conference on Interaction Sciences: Information Technology, Culture and Human (ICIS '09). Association for Computing Machinery, New York, NY, USA, 275–279. DOI:https://doi.org/10.1145/1655925.1655974Google ScholarDigital Library
- Naoya Yamamoto, Koji Nakano, Yasuaki Ito, Daisuke Takafuji, Akihiko Kasagi, and Tsuguchika Tabaru. 2020. Huffman Coding with Gap Arrays for GPU Acceleration. In 49th International Conference on Parallel Processing - ICPP (ICPP '20). Association for Computing Machinery, New York, NY, USA, Article 1, 1–11. DOI:https://doi.org/10.1145/3404397.3404429Google ScholarDigital Library
- Mario Latendresse and Marc Feeley. 2003. Generation of fast interpreters for Huffman compressed bytecode. In Proceedings of the 2003 workshop on Interpreters, virtual machines and emulators (IVME '03). Association for Computing Machinery, New York, NY, USA, 32–40. DOI:https://doi.org/10.1145/858570.858574Google ScholarDigital Library
- Jie Lei, Yuting Chen, Yunsong Li, and Jason Cong. 2016. A High-throughput Architecture for Lossless Decompression on FPGA Designed Using HLS (Abstract Only). In Proceedings of the 2016 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays (FPGA '16). Association for Computing Machinery, New York, NY, USA, 277. DOI:https://doi.org/10.1145/2847263.2847305Google ScholarDigital Library
- Wasuwee Sodsong, Jingun Hong, Seongwook Chung, Yeongkyu Lim, Shin-Dug Kim, and Bernd Burgstaller. 2014. Dynamic Partitioning-based JPEG Decompression on Heterogeneous Multicore Architectures. In Proceedings of Programming Models and Applications on Multicores and Manycores (PMAM'14). Association for Computing Machinery, New York, NY, USA, 80–91. DOI:https://doi.org/10.1145/2578948.2560684Google ScholarDigital Library
- Y. Choueka, S. T. Klein, and Y. Perl. 1985. Efficient variants of Huffman codes in high level languages. In Proceedings of the 8th annual international ACM SIGIR conference on Research and development in information retrieval (SIGIR '85). Association for Computing Machinery, New York, NY, USA, 122–130. DOI:https://doi.org/10.1145/253495.342777Google ScholarDigital Library
- T. Klein and Y. Wiseman, "Parallel Huffman Decoding with Applications to JPEG Files," in The Computer Journal, vol. 46, no. 5, pp. 487-497, Jan. 2003, doi: 10.1093/comjnl/46.5.487.Google Scholar
- André Weißenberger and Bertil Schmidt. 2018. Massively Parallel Huffman Decoding on GPUs. In Proceedings of the 47th International Conference on Parallel Processing (ICPP 2018). Association for Computing Machinery, New York, NY, USA, Article 27, 1–10. DOI:https://doi.org/10.1145/3225058.3225076Google ScholarDigital Library
- David R. McIntyre and Michael A. Pechura. 1985. Data compression using static Huffman code-decode tables. Commun. ACM 28, 6 (June 1985), 612–616. DOI:https://doi.org/10.1145/3812.3815Google ScholarDigital Library
- Talal Bonny and Jörg Henkel. 2010. Huffman-based code compression techniques for embedded processors. ACM Trans. Des. Autom. Electron. Syst. 15, 4, Article 31 (September 2010), 37 pages. DOI:https://doi.org/10.1145/1835420.1835424Google ScholarDigital Library
- Ruizhen Wu, Lin Wang, Mingming Wang, and Xiaoyong Zhang. 2019. A modified Self-Corrected Min-Sum LDPC Decoding Algorithm. In Proceedings of the 7th International Conference on Communications and Broadband Networking (ICCBN 2019). Association for Computing Machinery, New York, NY, USA, 6–10. DOI:https://doi.org/10.1145/3330180.3330183Google ScholarDigital Library
- Ruizhen Wu, Lin Wang, Hua Feng, and Wei He. 2019. A Modified Method for General LDPC Bit-flipping Decoding. In Proceedings of the 2019 7th International Conference on Computer and Communications Management (ICCCM 2019). Association for Computing Machinery, New York, NY, USA, 219–223. DOI:https://doi.org/10.1145/3348445.3348460Google ScholarDigital Library
- 2016. A Case Study: Huffman Encoding and Decoding. Verified Functional Programming in Agda. Association for Computing Machinery and Morgan & Claypool. DOI:https://doi.org/10.1145/2841316.284132Google Scholar
Recommendations
Transformed HCT for parallel Huffman decoding
This paper proposes a novel and generic Huffman code table HCT transform and a simple parallel Huffman decoding method. Codes of the original HCT are left-aligned, reordered in value, and partitioned into sub-bands. Two kinds of modification to the ...
Joint Source-Channel Soft Decoding of Huffman Codes with Turbo-Codes
DCC '00: Proceedings of the Conference on Data CompressionWe present a new method for using a priori information at a bit level in the decoding of Huffman codes. Its basic principle is the computation and use of the bit probabilities derived from the symbol probabilities of Huffman codes. Thus, we obtain a ...
A fast algorithm for Huffman decoding based on a recursion Huffman tree
This paper focuses on the time efficiency of Huffman decoding. In this paper, we utilize numerical interpretation to speed up the decoding process. The proposed algorithm firstly transforms the given Huffman tree into a recursion Huffman tree. Then, ...
Comments