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 98
- Downloads 0
Geographic Routing Using Logical Levels in Wireless Sensor Networks for Sensor Mobility
In this paper we propose an improvement to the GRPW algorithm for wireless sensor networks called GRPW-M , which collects data in a wireless sensor network (WSN) using a mobile nodes. Performance of GRPW algorithm algori...
Efficient Node Monitoring Mechanism in WSN using Contikimac Protocol
Wireless Sensor Network is monitored with ContikiMAC Cooja flavor to diagnose the energy utilization ratio by nodes and the fault detection process in distributed approach; adopted the Low power Listening (LPL) mechanism...
An Automatic Cryptanalysis of Arabic Transposition Ciphers using Compression
This paper introduces a compression-based method adapted for the automatic cryptanalysis of Arabic transposition ciphers. More specifically, this paper presents how a Prediction by Partial Matching (‘PPM’) compression sc...
A Global Convergence Algorithm for the Supply Chain Network Equilibrium Model
In this paper, we first present an auxiliary problem method for solving the generalized variational inequalities problem on the supply chain network equilibrium model (GVIP), then its global convergence is also establish...
Impedance Matching of a Microstrip Antenna
Microstrip patch antennas play a very significant role in communication systems. In recent years, the study to improve their performances has made great progression, and different methods have been proposed to optimize t...