| Paper Details: | Downloads: 1007 |
| Serial Number: | P1181603464
|
| Title: | Optimized Look-up-table for minimizing Critical Path in Distributed Arithmetic based FIR Filters
|
| Authors: | Sunita Badave and Anjali Bhalchandra
|
| Abstract: | Two new reduced critical path, look up table design techniques of DA based FIR filter are presented in this paper. Distributed arithmetic is one of the techniques, used to provide multiplier-free multiplication in the implementation of FIR filter. However it suffers from a sever limitation of exponential growth of look up table (LUT) with order of filter. Improved look-up-table optimization techniques are addressed here to design system architecture of FIR filter. In proposed technique, a single large LUT of conventional DA is replaced by number of smaller indexed LUT pages to restrict exponential growth and hence to reduce system access time. Selection module selects the desired value from desired LUT page and send for further filtering process. Trade off between access times of LUT pages and selection module helps to achieve minimum critical path so as to maximize the operating speed of filter. Further improvement in look-up-table design is achieved by reducing LUT data redundancy, which results into 40% rise operating frequency. Implementations are targeted to Xilinx ISE, Virtex IV devices with precision of 8 bit input samples. It is observed that, proposed designs perform significantly faster as compared to the conventional DA and existing DA based designs.
|
| Keywords: | Critical Path, Multiplier less FIR filter, Distributed Arithmetic, LUT Design, Indexed LUT.
|
| Journal/Conference: | International Journal of Digital Signal Processing
|
| Volume: | 16
|
| Issue: | 1
|
| Submission Date: | 1/13/2016 12:00:00 AM
|
| Review Date: | 2/20/2016 10:46:50 AM
|
| Publishing Date: | 2/28/2016 12:00:00 AM
|
| Article Downloads: | 1007
|
| Download: |
|