Transition Bandwidth Analysis of Infinite Impulse Response Filters
Journal Title: International Journal of Computer Science & Engineering Technology - Year 2013, Vol 4, Issue 8
Abstract
Infinite impulse response (IIR) is a property applying to many linear time-invariant systems. Digital filters are the common example of linear time invariant systems. Systems with this property are called IIR systems or IIR filters. These filters have infinite length of impulse response and are in contrast to finite impulse response (FIR) filters. The basic IIR filters are – Butterworth filters, Chebyshev filters and Elliptic filters. In this paper we are going todiscuss some basic theory of these filters and then we will analyze the properties of these filters.
Authors and Affiliations
Sujata Prabhakar , Dr. Amandeep Singh Sappal
Keywords
Related Articles
- EP ID EP136002
- DOI -
- Views 160
- Downloads 0
Firewall Management for to Resolve the Policy Anomalies
Firewall is a security system for network, that controls the network traffic based on firewall rules. Firewall depends on the policy configuration, but managing that firewall policy is complex. Existing policy analysis t...
Implementation of Skyline Sweeping Algorithm
Searching keywords in databases is complex task than search in files. Information Retrieval (IR) process search keywords from text files and it is very important that queering keyword to the relational databases. General...
Wavelet Based Normal and Abnormal Heart Sound Identification using Spectrogram Analysis
The present work proposes a computer-aided normal and abnormal heart sound identification based on Discrete Wavelet Transform (DWT), it being useful for tele-diagnosis of heart diseases. Due to the presence of Cumulative...
Efficient Biometric Security System Using Intra-Class Finger-Knuckle Pose Variation Assessment
Finger Knuckle Print is a finger based biometric system. It is a model which is the most widespread biometric authentication for an individual. The performance of Finger Knuckle Print recognition algorithms mostly depend...
MaRFI: Maximal Regular Frequent Itemset Mining using a pair of Transaction-ids
Frequent pattern mining is the fundamental and most dominant research area in data mining. Maximal frequent patterns are one of the compact representations of frequent itemsets. There is more number of algorithms to find...