1 / 12

3-Tap FIR Filter Optimizations

3-Tap FIR Filter Optimizations. By: Jeff Rybczynski CMPE 222. 3-Tap FIR Filter Design. FIR Filter Control. Six States meaning 3 bit State Variable Each Multiply is in a separate state Asynchronous Reset. FIR Filter Data Path. 3 Independent Multiply Operations

burton
Télécharger la présentation

3-Tap FIR Filter Optimizations

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. 3-Tap FIR Filter Optimizations By: Jeff Rybczynski CMPE 222

  2. 3-Tap FIR Filter Design FIR Optimization – Jeff Rybczynski

  3. FIR Filter Control • Six States meaning 3 bit State Variable • Each Multiply is in a separate state • Asynchronous Reset FIR Optimization – Jeff Rybczynski

  4. FIR Filter Data Path • 3 Independent Multiply Operations • 3 Independent Addition Operations • Not order dependent FIR Optimization – Jeff Rybczynski

  5. Optimized FIR Control • Take out extra calculate steps and place all the multiplies in one CALC state • Add the values from the multiply step together in ADD state • Place value directly into result before you raise output_ready FIR Optimization – Jeff Rybczynski

  6. Changes to the Verilog Code • Original Verilog Code 3'b100 : begin output_ready <= 1'b0; rin <= sample; end 3'b110 : acc <= rin * 24'h702a78; 3'b111 : acc <= rs0 * 24'h800000 + acc; 3'b101 : acc <= rs1 * 24'h4fd547 + acc; 3'b001 : begin output_ready <= 1'b1; result <= acc; rs1 <= rs0; rs0 <= rin; end default : begin acc <= 24'h000000; output_ready <= 1'b0; end FIR Optimization – Jeff Rybczynski

  7. Changes to the Verilog Code • Optimized Code 2'b00 : begin output_ready <= 1'b0; rin <= sample; end 2'b10 : begin temp1 <= rin * 24'h702a78; temp2 <= rs0 * 24'h800000; temp3 <= rs1 * 24'h4fd547; end 2'b11 : begin result <= temp1 + temp2 + temp3; rs1 <= rs0; rs0 <=rin; output_ready <=1’b1 end 2'b01 : output_ready <= 1'b0; FIR Optimization – Jeff Rybczynski

  8. 6x6 Multiplier Array Multiplier • Similar to how you multiply by hand • Cascading Array multiplier blocks FIR Optimization – Jeff Rybczynski

  9. Array Multiplier Block FIR Optimization – Jeff Rybczynski

  10. A3=1 A2=0 A1=1 A0=1 0 0 0 0 0 0 0 0 B0=1 1 0 1 1 0 1 0 0 0 1 0 1 0 B1=0 0 0 0 0 A B CO CI S      A B CO CI S      A B CO CI S      A B CO CI S      A B CO CI S      A B CO CI S      A B CO CI S      A B CO CI S      A B CO CI S      A B CO CI S      A B CO CI S      A B CO CI S      A B CO CI S      A B CO CI S      A B CO CI S      A B CO CI S      0 0 0 1 0 0 0 1 0 B2=1 1 0 1 1 0 1 0 0 1 0 0 1 0 B3=1 1 0 1 1 0 1 0 1 1 0 0 1 0 A B CO CI S      A B CO CI S      A B CO CI S      A B CO CI S      0 0 1 1 0 1 0 0 0 1 1 1 1 Array Multiplier FIR Optimization – Jeff Rybczynski

  11. Add Array Multiplier to Verilog Code • New Code: • Old Code: temp1 <= rin * 24'h702a78; temp2 <= rs0 * 24'h800000; temp3 <= rs1 * 24'h4fd547; array_multi a(temp1,rin, 24'h702a78); array_multi b(temp2,rs0, 24'h800000); array_multi c(temp3,rs1, 24'h4fd547); FIR Optimization – Jeff Rybczynski

  12. FIR Designs FIR Optimization – Jeff Rybczynski

More Related