1. Group No 5 1.Muhammad Talha Islam 2.Karim Akhter 3.Muhammad Arif 4.Muhammad Umer Khalid

2. PROJECT TITLE

3. INTERNAL SIR UMAR TALHA LECTURER – SSUET TELECOMMUNICATION ENGINEERING DEPARTMENT

4. Contents Introduction Background JPEG Block diagram Huffman Algorithm Time Line Conclusion

5. Introduction Compression To reduce the amount of data required to represent an image. Compression techniques Lossy and Lossless Why Compression? Communication and storage cost. Constrains of bandwidth. Joint photograph Expert Group (JPEG). Application of Huffman coding. In JPEG

6. Background Multimedia Compression Standards JPEG, TIF, GIF, PNG JPEG is widely used for still images Entropy coding Huffman is used for lossless compression Using FPGA

7. JPEG JPEG is an image compression standard which was accepted as an international standard in 1992. Developed by the Joint Photographic Expert Group of the ISO/IEC for coding and compression of color/gray scale images. JPEG is lossy compression technique. Size depends on compression ratio.

8. Steps in JPEG The main steps in JPEG encoding are the following Transform RGB to YUV or YIQ and subsample color DCT on 8x8 image blocks Quantization Zig-zag ordering and run-length encoding Entropy coding ( Huffman Coding)

9. Block Diagram for Image Transformation

10. JPEG Flow chart RGB image Transformation RGB YCbCr 2-D DCTQuantization Run length coding Huffman coding Quantization Table Huffman Table

11. Huffman Coding Developed by David Huffman. Uniquely and instantaneously decodable Huffman is the method of storing string of data and binary code in efficient manner. Huffman is a lossless compression technique Huffman code will be always providing on the average code length Which is less than any other code. Run length coding Huffman coding

12. Huffman Coding Contains smallest possible no of code symbols. Huffman code provides an optimized coding. As described in ICTs, in optimized coding, there should be: The most occurring symbol must have smallest code word length. In an optimum code the two symbols that occur least frequently will have same length Example

13. Huffman Algorithm Start Is current symbol is part of tree? Start with the leaf node Is the current node the most significant of the block? Increment the weight of node Is the current node equal to the root? End Continue with parent node Generate new node for this symbol Generate new node for NYA Subordinate new nodes to the old NYA no yes no yes no Exchange the node with most significant node of block Is the most significant node a parent node?

14. Field Programmable Gate Arrays FPGA is integrated circuit designed to be configured by the customer or designer after manufacturing – hence “field Programmable”. Can be seen as “Soft” ASICs; Introduce a new computer paradigm; Enable the designers to implement algorithms directly in silicon. Make parallelism a key feature. Permit any required external interface to be established.

15. Static memory cells. Volatile. Essential component and generic FPGA. Logic block usually based on LUTs. I/O is interface between core of FPGA and external devices. Parallel processing High Speed processing Higher Power consumption Any digital system can be implemented

18. Developed and tested Applied JPEG Design of Huffman Algorithm Extraction of Huffman code and stream For the text file of the code

19. Two main languages. Verilog – the C based language. Two types of variables; wire and reg. Initial and always block. Choice of an FPGA development board. Market stake holders of FPGA.

20. Time Line MonthActivity January-FebruaryPreparation of proposal March-JuneLiterature Review July-AugustImplementation on MATLAB SeptemberVerilog Programming October-NovemberDesign of algorithm in Verilog DecemberImplementing on FPGA

21. Conclusion JPEG is a compression lossy compression technique but Huffman man is a lossless compression technique. Huffman coding is an efficient source coding algorithm for source symbols that are not equally probable. Huffman provides uniquely decodable codes (prefix code). Implementing Huffman algorithm on FPGA is a better approach because on FPGA hardware are designed for specific algorithm. End

22. Huffman Encoding Example

23. Appendix a- MATLAB test code

24. Thanks for Watching