Decoding method, decoder, equipment and medium

Abstract

The invention discloses a decoding method, a decoder, equipment and a medium, and the method comprises the steps: grouping an input bit stream, and obtaining input bit groups; inputting the input bitgroups into different Huffman decoders respectively, so that the Huffman decoders decode the input bit groups in parallel to obtain preliminary decoding results corresponding to the input bit groups,wherein the preliminary decoding results comprise code word lengths, invalid flags and decoding characters; determining a length vector based on the codeword lengths and the invalid flags, and determining a target position vector based on the length vector; and determining a target decoding result corresponding to the input bit stream based on the target position vector and the character vector. Therefore, the bit streams subjected to Huffman coding can be decoded in parallel, the decoding time is saved, the decoding efficiency is improved, the decoding throughput rate is also improved, and the equipment performance is improved.

Description

technical field [0001] The present application relates to the technical field of communication data processing, and in particular to a decoding method, decoder, device and medium. Background technique [0002] Huffman coding is a commonly used algorithm in data compression, which has excellent compression performance. Huffman coding adopts the method of variable word length coding, and assigns codewords of different lengths to characters according to the occurrence probability of each character in the data block, and assigns codewords with shorter lengths to characters with higher occurrence probability. In this way, Huffman coding can make the average code length the shortest, which is an optimal coding. [0003] However, in Huffman coding, due to the unfixed encoding length, the boundary between a codeword and its adjacent codewords can only be determined after decoding. Therefore, the next codeword cannot be started until the current codeword is decoded. decoding. This...

AI Technical Summary

Problems solved by technology

[0003] However, in Huffman coding, due to the unfixed encoding length, the boundary between a codeword and its adjacent codewords can only be determined after decoding. Therefore, the next codeword cannot be started until the current codeword is decoded. decoding

This makes the current Huffman decoding can only be serial decoding, the decoding time is long, and the decoding efficiency is low, which limits the decoding throughput and also affects the performance of the corresponding equipment

Images