Critical Path Reduction of Distributed Arithmetic Based FIR Filter

Operating speed, which is reciprocal of critical path computation time, is one of the prominent design matrices of finite impulse response (FIR) filters. It is largely affected by both, system architecture as well as technique used to design arithmetic modules. A large computation time of multipliers in conventionally designed multipliers, limits the speed of system architecture. Distributed arithmetic is one of the techniques, used to provide multiplier-free multiplication in the implementation of FIR filter. However suffers from a sever limitation of exponential growth of look up table (LUT) with order of filter. An improved distributed arithmetic technique is addressed here to design for 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 to reduce system access time. It also eliminates the use of adders. Selection module selects the desired value from desired page, which leads to reduce computational time of critical path. Trade off between access times of LUT pages and selection module helps to achieve minimum critical path so as to maximize the operating speed. Implementations are targeted to Xilinx ISE, Virtex IV devices. FIR filter with 8 bit data width of input sample results are presented here. It is observed that, proposed design perform significantly faster as compared to the conventional DA and existing DA based designs.

@article{Badave2016,
  title     = {Critical Path Reduction of Distributed Arithmetic Based FIR Filter},
  journal   = {International Journal of Advanced Computer Science and Applications},
  volume    = {7},
  number    = {3},
  year      = {2016},
  publisher = {The Science and Information Organization},
  author    = {Sunita Badave and Anjali Bhalchandra},
  doi       = {10.14569/IJACSA.2016.070311},
  url       = {https://doi.org/10.14569/IJACSA.2016.070311}
}