Design and Realization of Digital FIR Filter using Dolph-Chebysheb Window
Journal Title: International Journal of Computer Science & Engineering Technology - Year 2013, Vol 4, Issue 7
Abstract
In Digital Signal Processing, one of the most important filter type is the FIR filter which can be designed via various methods. Window technique is the most important technique that is used to design the FIR filter. Apart from various window techniques, Dolph-Chebyshev window has the subject of importance for the design of the FIR filter in efficient way. In this paper, the design methodology of the FIR filter using Dolph-Chebyshev window is shown along with the realization of filter and the designing algorithm. The designing program of the FIR filter is simulated in Matlab 7 which shows the satisfactory result. In this paper, the minimization of the side lobes using Dolph-Chebyshev window are shown and can easily be understood that the minimization in side lobes can increase the efficiency and decrease power consumption so that the FIR filter can work more efficiently.
Authors and Affiliations
Subhadeep Chakraborty
Keywords
Related Articles
- EP ID EP141153
- DOI -
- Views 82
- Downloads 0
Civilizing the Network Lifetime Efficiently in MANETs Through DEL-CMAC Protocol
MANET (Mobile Ad-Hoc Network) has a dynamic topology. Due to the mobility of nodes in the network of cooperative communication is a technique for archived greater efficiency of transmission. In this paper the Network Lif...
Performance of Appropriate Photovoltaic Model
Energy is very important key to improve human life. Due to the global warming and pollution, the new energy source is developed. Photovoltaic is one of these sources that growth in recent decades and has several models....
ETL Scheduling in Real-Time Data Warehousing
As the pace of today’s business grows and with business getting more aligned with good customer relationships, decisions that are made based on the most recent data are required. These decisions that are based on the mos...
Modified Suffix Search Algorithm for Multiple String Matching
String Matching is now a prominent field in the area of Computer Science and it has many applications in the real world. A new algorithm for Suffix Search which uses chained hashing is proposed and this works well in mat...
A Similarity Function with Pruning Strategy for Tree Structured Data
Although several distance or similarity functions for trees have been introduced, their performance is not always satisfactory in different applications. In the base paper the Extended Sub tree (EST) function, where a ne...