SHUF code mechanism in real-time compression and decompression

Data compression is always a critical issue in areas such as database storage and communications etc. Traditional Huffman algorithm presents a coding technique to compress data into a smaller form based on the fact that some characters are used more frequently than the others. This paper introduces SHUF mechanism which still follows Huffman code´s basic principle that symbols which occur a lot in a file are given a short sequence while other that are used seldom get a longer bit sequence. The SHUF mechanism is suit for real-time text compression and can be used in handsets which have limited computing resources.