Critical Path Reduction of Distributed Arithmetic Based FIR Filter
Journal Title: International Journal of Advanced Computer Science & Applications - Year 2016, Vol 7, Issue 3
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
- EP ID EP138564
- DOI 10.14569/IJACSA.2016.070311
- Views 90
- Downloads 0
Extending Conditional Preference Networks to Handle Changes
Conditional Preference Networks (CP-nets) are a compact and natural model to represent conditional qualitative preferences. In CP-nets, the set of variables is fixed in advance. That is, the set of alternatives available...
Multi-Objective Intelligent Manufacturing System for Multi Machine Scheduling
This paper proposes a framework for Intelligent Manufacturing systems in which the machine scheduling is achieved by MCDM and DRSA. The relationship between perception/knowledge base and profit maximization is being exte...
Efficient Feature Selection for Product Labeling over Unstructured Data
The paper introduces a novel feature selection algorithm for labeling identical products collected from online web resources. Product labeling is important for clustering similar or same products. Products blindly crawle...
SVM Classification of Urban High-Resolution Imagery Using Composite Kernels and Contour Information
The classification of remote sensing images has done great forward taking into account the image’s availability with different resolutions, as well as an abundance of very efficient classification algorithms. A number of...
Area Efficient Implementation of Elliptic Curve Point Multiplication Algorithm
Elliptic Curve Cryptography (ECC) has established itself as the most preferred and secured cryptography algorithm for the secure data transfer and secure data storage in embedded system environment. Efficient implementat...