1 / 14

A PRESENTATION ON FILE COMPRESSION AND DECOMPRESSION

Prepared By: Roshan Pudasaini (BCT/2008/531) Subash Shrestha (BCT/2008/) Sunita Maharjan (BCT/2008) Tek Narayan Chalise (BCT/2008). A PRESENTATION ON FILE COMPRESSION AND DECOMPRESSION. OBJECTIVES OF PROJECT. LOSSESLY compress and decompress text file

liesel
Télécharger la présentation

A PRESENTATION ON FILE COMPRESSION AND DECOMPRESSION

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Prepared By: RoshanPudasaini(BCT/2008/531) SubashShrestha (BCT/2008/) SunitaMaharjan(BCT/2008) TekNarayanChalise(BCT/2008) APRESENTATION ONFILE COMPRESSION AND DECOMPRESSION

  2. OBJECTIVES OF PROJECT LOSSESLY • compress and decompress text file • compress and decompress mp3 file • compress and decompress image files • compress and decompress video file

  3. Gives user facility to compress and decompress the file. Provides user options for choosing different types of compression technique (gzip, Huffman). Can be beneficial in carrying larger file by reducing its size. Overview of the project

  4. Overview Contd. • May help in memory management. • Help in high speed data transmission.

  5. TOOLS/TECHNOLOGIES USED • GZiplibrary function(API Used).

  6. SYSTEM ARCHITECTURE READ FILE MODE DETECTOR DECOMPRESSOR COMPRESSOR BUG DETECTOR DETECTION OF ACEM COMPRESSOR’S FILE ENCODE/ENCRYPT DECODE FILE WRITE TO DESTINATION

  7. METHODOLOGY HUFFMAN ALGORITHM • Character and its Frequency Identification • Node With Character and Its corresponding Frequency • Sorted Node Enque

  8. Huffman Contd. • Dequeue lowest frequencies node • Again insert into queue with sum of two lower node frequencies as a parent node • Assign “ZERO” & “ONE” for Lower child nodes

  9. Huffman Contd. • Repeat same until single node in the queue.

  10. GZIP COMPRESSION • Lempel-Ziv + Huffman Algorithm A lossless Compression Technique

  11. CHALLENGES FACED • Research & Implementation. • Off course in CODING. • Preserving Original file name.

  12. CONCLUSION AND FUTURE ENHANCEMENTS • Simple Design • Data security via password Protection • Suggest appropriate Method for corresponding file format • Performance testing

  13. REFERENCES • Lossless Compression Algorithms (Entropy Encoding) • http://www.cs.cf.ac.uk/Dave/Multimedia/node2 • Huffman.java http://algs4.cs.princeton.edu/55compression/Huffman.java.html • Huffman Codinghttp://www.cs.cf.ac.uk/Dave/Multimedia/node210.html#SECTION04243000000000000000 • The gzip home pagehttp://www.gzip.org/#faq11 • Archiving and compressinghttp://floppix.ccai.com/targzip.html • Huffmanalgorithmimplementation Source Code | Java ProgrammingLanguage http://megasnippets.com/source-codes/java/huffman_algorithm_implementation • Lempel-Ziv-Welch (LZW) Algorithmhttp://www.cs.cf.ac.uk/Dave/Multimedia/node214.html#SECTION04247000000000000000 • gzip - Wikipedia, the free encyclopediahttp://en.wikipedia.org/wiki/Gzip • DEFLATE - Wikipedia, the free encyclopediahttp://en.wikipedia.org/wiki/DEFLATE • Huffman coding - Wikipedia, the free encyclopedia http://en.wikipedia.org/wiki/Huffman_coding

  14. THANK YOU FOR LISTENING

More Related