Critical Path Reduction of Distributed Arithmetic Based FIR Filter

Abstract

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.

Authors and Affiliations

Sunita Badave, Anjali Bhalchandra

Keywords

Related Articles

Adaptive Neuro-Fuzzy Inference Systems for Modeling Greenhouse Climate

The objective of this work was to solve the problem of non linear time variant multi-input multi-output of greenhouse internal climate for tomato seedlings. Artificial intelligent approaches including neural networks and...

Text Mining Techniques for Intelligent Grievances Handling System: WECARE Project Improvements in EgyptAir

The current work provides quick responding and minimize the required time of processing of the incoming grievances by using automated categorization that analyses the English text contents and predict the category. This...

Computer Students Attitudes on the Integration of m-Learning Applications

Technology has an important role in the lives particularly in the field of education nowadays because of its accessibility and affordability. Mobile learning (m-Learning) which is form of e-learning is a novel approach i...

Fault-Tolerant Model Predictive Control for a Z(TN)-Observable Linear Switching Systems

This work considers the control and the state observation of a linear switched systems with actuators faults. A particular problem is studied: the occurrence of non-observable subsystem in the switching sequence. Hence,...

Improving K-Means Algorithm by Grid-Density Clustering for Distributed WSN Data Stream

At recent years, Wireless Sensor Networks (WSNs) had a widespread range of applications in many fields related to military surveillance, monitoring health, observing habitat and so on. WSNs contain individual nodes that...

Download PDF file
  • EP ID EP138564
  • DOI 10.14569/IJACSA.2016.070311
  • Views 91
  • Downloads 0

How To Cite

Sunita Badave, Anjali Bhalchandra (2016). Critical Path Reduction of Distributed Arithmetic Based FIR Filter. International Journal of Advanced Computer Science & Applications, 7(3), 71-78. https://europub.co.uk/articles/-A-138564