Volume- 11
Issue- 4
Year- 2023
DOI: 10.55524/ijircst.2023.11.4.14 | DOI URL: https://doi.org/10.55524/ijircst.2023.11.4.14 Crossref
This is an Open Access article distributed under the terms of the Creative Commons Attribution License (CC BY 4.0) (http://creativecommons.org/licenses/by/4.0)
Article Tools: Print the Abstract | Indexing metadata | How to cite item | Email this article | Post a Comment
P. Uday Kumar , K.Vineela, J.venkatavamsi, N.Rajesh, R.V. Lokesh kumar, Lokesh kumar, P.Hyndavi
Because there are more data bits and memory operations in modern digital networks, data transport and reception are more complicated, resulting in more data loss and lower throughputs. As a result, the suggested work of this study uses the Canonical Huffman compression approach to deliver lossless data compression with minimal memory architecture. The Huffman machine will present a memory-efficient design that is lossless and supports multi-bit data compression [1]. Here, utilizing variable length and the Canonical Huffman encoding method, this methodology will show input as 640 data bits, compressed output as 90 data bits, and de-compressor 90 data bits to 640 data bits using the Canonical Huffman decoding method. Finally, this work will be synthesized on a Vertex FPGA and presented in Verilog HDL, with results for area, delay, and power.
Assistant Professor, Department of Electronics and Communication Engineering, PACE Institute of Technology and Sciences, Ongole, Andhra Pradesh, India
No. of Downloads: 25 | No. of Views: 421
Dr. Ch. Manohar Kumar, S. Yaswanth, B. Venkata Sai Teja, K. Akhila, S. Joshna.
May 2024 - Vol 12, Issue 3
Dr. P.A. Nageswara Rao, Mr. V. D. S. Venkat, Mrs. K. Sharmila, Mrs. M. Tharangini.
May 2024 - Vol 12, Issue 3
Ramana Babu Ch, Harish Kumar Yediri, Manohar Eere.
May 2024 - Vol 12, Issue 3