Implementation of the Huffman economic coding method in information telemetric systems

An approach is described that makes it possible to significantly reduce the processing time of data when they are encoded with an economical Huffman code, which significantly expands the capabilities of digital communication systems. Two algorithms are proposed: a sorting algorithm and an algorithm for finding the position of a number in an ordered numeric array. It was found that time saving is achieved by reducing the number of required elementary operations due to the use of additional volumes of the encoder’s working memory. It was revealed that the time complexity of the sorting algorithm is O(3 N ), and when it is used together with the second algorithm in the Huffman encoder, it is O(2 N ). In this case, the time complexity of the Huffman method can be reduced from the form O( Nk log N ) to the form O( Nk ).