Efficient Fir Filter Implementation Based On Minimum Logic Depth Tree

Apply

Efficient Fir Filter Implementation Based On Minimum Logic Depth Tree

Journal Title: International Journal for Research in Applied Science and Engineering Technology (IJRASET) - Year 2015, Vol 3, Issue 2

Abstract

Multiple constant multiplication (MCM) scheme is widely used for implementing direct-form FIR filters. While the research focus of MCM has been more effective on common sub expression elimination, the optimization of adder-trees, which sum up the computed sub-expressions for each coefficient, is largely omitted. This project provides a method to optimize the adder trees and thereby reducing the area. Canonical signed digit method is first used to optimize the adder tree. This method is compared with MIP optimization method. The problem is solved by assigning a binary tree for a single coefficient and then by assigning the co-efficient value to the tree. Then overall minimization is carried out based on the Minimum Logic Depth Tree .This method is repeated for every iteration. The result shows 40% area reduction and 42% Dynamic Power Reduction. While the above methods reduce the area and power, speed is not taken care of. Hence the ripple carry adder used in the filter co-efficient is replaced by parallel prefix adder to reduce power and enhance speed. The result shows that speed is increased by 22%.

Authors and Affiliations

S. Romy Cathlane , Ms. A. S Narmadaa

Keywords

Adder-tree optimization finite impulse response filter FIR MCM CSD multiple constant multiplication

EP ID EP19592
DOI -
Views 306
Downloads 4