Abstract
Multimedia is highly competitive world, one of the properties that is reflected is speed of download and upload of multimedia elements: text, sound, pictures, animation. This paper presents CRUSH algorithm which is a lossless compression algorithm. CRUSH algorithm can be used to compress files. CRUSH method is fast and simple with time complexity O(n) where n is the number of elements being compressed.Furthermore, compressed file is independent from algorithm and unnecessary data structures. As the paper will show comparison with other compression algorithms like Shannon–Fano code, Huffman coding, Run Length Encoding, Arithmetic Coding, Lempel-Ziv-Welch (LZW), Run Length Encoding (RLE), Burrows-Wheeler Transform.Move-to-Front (MTF) Transform, Haar, wavelet tree, Delta Encoding, Rice &Golomb Coding, Tunstall coding, DEFLATE algorithm, Run-Length Golomb-Rice (RLGR).
Highlights
Multimedia is highly competitive world, one of the properties that is reflected is speed of download and upload of multimedia elements: text, sound, pictures, animation
CRUSH method is fast and simple with time complexity O(n) where n is the number of elements being compressed.compressed file is independent from algorithm and unnecessary data structures
One can reach the conclusion that CRUSH compresses more than Huffman coding and Shannon-Fano algorithm based on the simple comparison shown below, table (7): Table 7
Summary
Multimedia is highly competitive world, one of the properties that is reflected is speed of download and upload of multimedia elements: text, sound, pictures, animation. In this day and age where multimedia is an essential part in the internet world. CRUSH performs better than Huffman and Shannon-Fano algorithm as will be shown in the paper. The storage complexity of CRUSH is O(n) where n is the number of elements to be compressed. The paper discusses the time and storage complexity of CRUSH. the paper shows the compression ratio of CRUSH in comparison with Huffman code, Shannon-Fano algorithm.
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
