A High-Throughput VLSI Architecture Design of Canonical Huffman Encoder

Huffman encoder uses a kind of algorithm also named Huffman encoding technique which takes input as strings that are 1byte or 8 bit size and drastically reduce it to around 1 bit or more. So its encoding the data of strings to binary bits (reduced binary bits). This circuit includes frequency sorting block and Huffman block. Where frequency sorting block sort the strings in ascending order w.r.t their frequency regarding ascii values and sends the sorted data to the huffman encoder where encoder encodes those data to reduced bits. Here in this paper we are taking 64 bits data that is 8 string values and sorting them with their ascii values and encode each byte into less than a byte. On worst case one of the encoded data would be 8bit that is 1 byte.