This paper is published in Volume-7, Issue-3, 2021
Area
Master Of Engineering
Author
Rashmi Kisanrao Bhojane, G. D. Dalvi
Org/Univ
P. R. Pote Patil Education and Welfare Trust's Group of Institutions, College of Engineering and Management, Amravati, Maharashtra, India
Pub. Date
02 June, 2021
Paper ID
V7I3-1646
Publisher
Keywords
Multipliers, FIR, Buffer, Adder, Low power

Citationsacebook

IEEE
Rashmi Kisanrao Bhojane, G. D. Dalvi. Efficient Low Power FIR Filter Design, International Journal of Advance Research, Ideas and Innovations in Technology, www.IJARIIT.com.

APA
Rashmi Kisanrao Bhojane, G. D. Dalvi (2021). Efficient Low Power FIR Filter Design. International Journal of Advance Research, Ideas and Innovations in Technology, 7(3) www.IJARIIT.com.

MLA
Rashmi Kisanrao Bhojane, G. D. Dalvi. "Efficient Low Power FIR Filter Design." International Journal of Advance Research, Ideas and Innovations in Technology 7.3 (2021). www.IJARIIT.com.

Abstract

A filter may be required to have a given frequency response, or a specific response to an impulse, step, or ramp, or simulate an analog system. Depending on the response of the system, digital filters can be classified into Finite Impulse Response (FIR) filters & Infinite Impulse Response (IIR) filters. The thesis deals with design of generic 30-tap FIR filter on FPGA. The thesis is focused on Design structure and occupied silicon space, needed for implementation of filter in FPGA. The results are IP macros of simple FIR filter that are full configurable using generic parameters. Both macros were verified in a verification environment which consists of test blocks (VHDL) and a comparative model (Matlab). A design of generic FIR filter is described in this work. Next there are described final designs of the IP macros, results and process of the verification, implementation and gate-level verification Design of area and power-efficient high-speeddata path logic systems are one of the most substantial areas of research in VLSI system design. In digital adders, the speed of addition is limited by the time required to propagate a carry through the adder