{'fraction_non_alphanumeric': 0.007905138339920948, 'fraction_numerical': 0.0, 'mean_word_length': 5.38655462184874, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Implementation of Huffman algorithm and study for optimization

Popular lossless data compression algorithms like DEFLATE and GZIP use Huffman encoding method as the primary tool for compression. Data compression or signal compression plays a vital role in signal processing. This paper aims to explain Huffman encoding method for lossless data compression, its functionality is demonstrated using MATLAB tool and simulation is done over simulation software with the program written in VHDL. The need of optimization has given wide variations in Huffman encoding and decoding process. The vital factors that have to be focused on for achieving optimization in the codes generated by traditional Huffman encoders are also evaluated and discussed in this paper.