Optimization of area under a delay constraint in digital filter synthesis using SAT-based integer linear programming

In this paper, we propose an exact algorithm for the problem of area optimization under a delay constraint in the synthesis of multiplierless FIR filters. To the best of our knowledge, the method presented in this paper is the only exact algorithm designed for this problem. We present the results of the algorithm on real-sized filter instances and compare with an improved version of a recently proposed exact algorithm designed for the minimization of area. We show that in many cases delay can be minimized without any area penalty. Additionally, we describe two approximate algorithms that can be applied to instances which cannot be solved, or take too long, with the exact algorithm. We show that these algorithms find similar solutions to the exact algorithm in less CPU time. Categories and Subject Descriptors B.2.0 [Arithmetic and Logic Structures]: General. General Terms: Algorithms, design.

• Type: Conference
• Year: 2006
• Where: DAC
• Authors: Eduardo A. C. da Costa, José Monteiro, Levent Aksoy, Paulo F. Flores
• Keywords: Approximate Algorithms, DAC 2006, Design Automation, Exact Algorithm, Real-sized Filter Instances