1 / 38

Huffman Encoder Project

Huffman Encoder Project. Huffman Encoder Project. Howd - Zur Hung Eric Lai Wei Jie Lee Yu - Chiang Lee Design Manager: Jonathan P. Lee. Overall Project Objective : Design a Low Power Huffman Encoder. Final Presentation April 30 th , 2007. Agenda of Presentation.

marvin-boyer
Download Presentation

Huffman Encoder Project

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. Huffman Encoder Project

  2. Huffman Encoder Project Howd - Zur Hung Eric Lai Wei Jie Lee Yu - Chiang Lee Design Manager: Jonathan P. Lee Overall Project Objective:Design a Low Power Huffman Encoder Final Presentation April 30th, 2007

  3. Agenda of Presentation • About Huffman Compression (Wei Jie) • Marketing (Wei Jie) • Project Description (Wei Jie) • Design Methodology (Randal) • Original Huffman Recipe (Randal) • Our Huffman Encoder (Randal) • Design Decisions (Randal) • Behavioral/Algorithmic Description (Eric) • Floorplan Evolution (Eric) • Layout (John) • Verification (Eric) • Issues Encountered (John) • Specifications (John) • Conclusions (John)

  4. About Huffman • Huffman is a compression algorithm • Often used as a back-end to other compressions • Greedy algorithm

  5. The Need for Compression • It is becoming a wireless world • Wireless bandwidth limited • Power is limited • COMPRESSION! • Reduce data size = Save power + time + bandwidth

  6. Why Huffman? • Lossless • Statistical • David Huffman is the man! • Outdid Shannon-Fano coding

  7. Project Description Our Huffman Encoderis a fast and power efficient solution to data compression with on-chip cache

  8. Hardware compression out performs software based solution Small, affordable, and power efficient chip is perfect for portable devices Why Hardware?

  9. Hardware Huffman Solution • Low power, compact, full-custom ASIC • Saves power,time, and system resources • Compress data packets on network cards • Cell phones, PDA, Laptop

  10. Design Methodology • Understand the algorithm • Design functional blocks • Behavioral Verilog • Structural Verilog • Schematic • Layout • Simulations

  11. Specifics of Huffman a a b b c c d d e e 4 001 7 01 0001 2 1 0000 15 1 29 0 1 14 e 0 1 7 b 0 1 3 a 0 1 d c • Procedure • pre-scan data and count frequency • iteratively find least two frequent word and build a tree • encode word according to the final tree structure

  12. Our Huffman a a a a a b b b b b c c c c c d d d d d e e e e e 7 14 4 29 4 7 29 14 7 7 3 29 14 2 7 1 7 3 14 29 15 29 15 15 15 0 0 0 0 0 0 1 1 1 0 0 0 2 0 2 2 0 0 3 0 4 4 4 4 0 001 01 1 01 1 0000 01 1 001 00 0 0000 000 1 • Procedure • pre-scan data, count frequency, and assign unique group number • iteratively find least two frequent word to update group number and encoding • finish encoding look up table

  13. Design Decisions • 5-bit input word size • 16-bit frequency • Two SRAMs • Adders: 16-bit Carry Select Adders • Serial output • Control logic to shut down modules

  14. Behavioral / Algorithm Description turns off unused blocks to reduce power

  15. Schematic Diagram

  16. Floorplan Prelayout

  17. Floorplan Midlayout

  18. Final Chip Layout

  19. Top countFreq Find2Freq Combine SRAMfreqGroup SRAMcodeLength serial output control

  20. CountFrequency

  21. Find2Freq

  22. Combine

  23. SerialOutput

  24. SRAM(FreqGroup)

  25. Poly

  26. Metal 1

  27. Metal 2

  28. Metal 3

  29. Metal 4

  30. Verification: Verilog • Matched Verilog results with MATLAB results • Verified the successful compression of several test cases including parts of an image file:

  31. Verification: Schematic • Vigorously tested each block • Combined them and encoded several words

  32. Verification: Layout • Verified strong signal integrity • Buffered high fan-outs and long wires • Critical Path: 4.88 ns • All outputs of modules go through registers

  33. Component Specifications

  34. Final Specifications • Number of Transistors : 23,322 • Area : 288.18 x 273.645 = 78859 μm2 • Density : 0.296 (transistors/μm2) • Aspect Ratio = 1:1.05 • Pin Count = 52 pins • Input : 5-bit data input, start, done, finish • Output : 36-bit treeOutput, treeReady, out, request, error • vdd!, gnd!, clk, reset • Final Clock Speed = 200 MHz

  35. Final Specifications • Final result is up to1800 times faster than Java! (probably because it’s Java) • Compressed 640 bits of an image • Java results – 10 ms • Centrino 1.5 GHz • 512 RAM • Our hardware Huffman – 5.4 us • 1071 cycles

  36. Issues Encountered • Bad estimate for original floorplan • Long SRAM simulation time • SRAM sense amp issue • Too much poly! • Cannot route through SRAM

  37. Conclusions • Next Steps: • Scale up design • Better compression ratio • Higher throughput • Meeting of the Minds • HUFFMAN DECODER!!

  38. Questions?

More Related