Review Paper on High Performance Integrated Circuit for Multiplier-less Finite Impulse Response
DOI:
https://doi.org/10.26438/ijcse/v7i10.246250Keywords:
Finite Impulse Response (FIR), Look Up Table (LUT), Modified Distributive Arithmetic TechniqueAbstract
This paper presents efficient modified distributed arithmetic (MDA)-based approaches for low delay reconfigurable implementation of finite impulse response (FIR) filters whose filter coefficients change during runtime. Conventionally, for reconfigurable DA-based implementation of FIR filter, the lookup tables (LUTs) are required to be implemented in ROM; and the ROM-based LUT is found to be costly for application specific integrated circuit (ASIC) implementation. Therefore, a shared-LUT design is proposed to realize the MDA computation. Instead of using separate registers to store the possible results of partial inner products for DA processing of different bit positions, registers are shared by the DA units for bit slices of different weightage.
References
[1] Basant Kumar Mohanty, and Pramod Kumar Meher, High-Performance FIR Filter Architecture for Fixed and Reconfigurable Applications”, IEEE Transactions on Very Large Scale Integration (VLSI) Systems, Vol. 78, No.06, April 2016.
[2] Indranil Hatai, Indrajit Chakrabarti, and Swapna Banerjee, “An Efficient VLSI Architecture of a Reconfigurable Pulse-Shaping FIR Interpolation Filter for Multi-standard DUC”, IEEE Transactions on Very Large Scale Integration (VLSI) Systems, Vol. 23, No. 6, June 2015.
[3] Sang Yoon Park and Pramod Kumar Meher, “Efficient FPGA and ASIC Realizations of DA-Based Reconfigurable FIR Digital Filter”, IEEE Transactions on Circuits And Systems-Ii: Express Briefs, 2014.
[4] B. K. Mohanty, P. K. Meher, S. Al-Maadeed, and A. Amira, “Memory footprint reduction for power-efficient realization of 2-D finite impulse response filters,” IEEE Trans. Circuits Syst. I, Reg. Papers, vol. 61, no. 1, pp. 120–133, Jan. 2014.
[5] B. K. Mohanty and P. K. Meher, “A high-performance energy-efficient architecture for FIR adaptive filter based on new distributed arithmetic formulation of block LMS algorithm,” IEEE Trans. Signal Process., vol. 61, no. 4, pp. 921–932, Feb. 2013.
[6] G. Gokhale and P. D. Bahirgonde, “Design of Vedic Multiplier using Area-Efficient Carry Select Adder”, 4th IEEE International Conference on Advances in Computing, Communications and Informatics (ICACCI-2015), Kochi, August 10-13, 2015, India.
[7] G. Gokhale and Mr. S. R. Gokhale, “Design of Area and Delay Efficient Vedic Multiplier Using Carry Select Adder”, 4th IEEE International Conference on Advances in Computing, Communications and Informatics (ICACCI-2015), Kochi, August 10-13, 2015, India.
[8] Pavan Kumar, Saiprasad Goud A, and A Radhika had published their research with the title “FPGA Implementation of high speed 8-bit Vedic multiplier using barrel shifter”, 978-1-4673-6150-7/13 IEEE.
[9] B. Madhu Latha1, B. Nageswar Rao, published their research with title “Design and Implementation of High Speed 8-Bit Vedic Multiplier on FPGA” International Journal of Advanced Research in Electrical ,Electronics and Instrumentation Engineering, Vol. 3, Issue 8, August 2014.
[10] A Murali, G Vijaya Padma, T Saritha, published their research with title “An Optimized Implementation of Vedic Multiplier Using Barrel Shifter in FPGA Technology”, Journal of Innovative Engineering 2014, 2(2).
[11] Sweta Khatri, Ghanshyam Jangid, “FPGA Implementation of 64-bit fast multiplier using barrel shifter” Vol. 2 Issue VII, July 2014 ISSN: 2321-9653.
[12] Toni J. Billore, D. R. Rotake, “FPGA implementation of high speed 8 bit Vedic Multiplier using Fast adders” Journal of VLSI and Signal Processing, Volume 4, Issue 3, Ver. II (May-Jun. 2014), PP 54-59 e-ISSN: 2319 – 4200, p-ISSN No. : 2319 – 4197.
[13] S. S. Kerur, Prakash Narchi, Jayashree C N, Harish M Kittur and Girish V A, “Implementation of Vedic Multiplier for Digital Signal processing” International Conference on VLSI, Communication & Instrumentation (ICVCI) 2011.
Downloads
Published
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors contributing to this journal agree to publish their articles under the Creative Commons Attribution 4.0 International License, allowing third parties to share their work (copy, distribute, transmit) and to adapt it, under the condition that the authors are given credit and that in the event of reuse or distribution, the terms of this license are made clear.
