The implementation complexity of finite impulse response digital filters under different coefficient quantization schemes and realization structures

Download

index.pdf

Date

2004

Author

Akyürek, Sefa

Metadata

Show full item record

Item Usage Stats

93
views

84
downloads

It has been aimed to investigate the complexity of discrete-coefficient FIR filters when they are implemented in transposed form and the coefficient redundancy is removed by the n-Dimensional Reduced Adder Graph (RAG-n) approach. Filters with coefficients represented by different quantization schemes have been designed or selected from the literture; their transposed form implemetations after RAG-n process have been compared in terms of complexity. A Genetic Algorithm (GA) based design algorithm has been implemented and used for the design of integer coefficient filters. Algorithms for the realization of filter coefficients in Canonic Signed Digit (CSD) form and realization of n-Dimensional Reduced Adder Graph (RAG-n) have also been implemented. Filter performance is measured as Normalized Peak Ripple Magnitude and implementation complexity as the number of adders used to implement filter coefficients. Number of adders used to implement filter coefficients is calculated by using two different methods: CSD and RAG-n. RAG-n method has been applied to FIR digital filter design methods that don̕t consider reduction of implementation complexity via RAG-n with transposed direct form filter structure. For implementation complexity, it is concluded that أRAG-n algorithm with transposed direct form filter structureؤ provides better results over the أCSD, SPT coefficient design followed by transposed direct form filter structureؤ in terms of number of adders used in the implementation.

Subject Keywords

Electrical engineering., Electronics., Nuclear engineering.

URI

http://etd.lib.metu.edu.tr/upload/2/12605586/index.pdf
https://hdl.handle.net/11511/14898

Collections

Graduate School of Natural and Applied Sciences, Thesis

Suggestions

OpenMETU
Core

FPGA implementation of graph cut method for real time stereo matching Sağlık Özsaraç, Havva; Ünver, Baki Zafer; Ulusoy, İlkay; Department of Electrical and Electronics Engineering (2010) The present graph cut methods cannot be used directly for real time stereo matching applications because of their recursive structure. Graph cut method is modified to change its recursive structure so that making it suitable for real time FPGA (Field Programmable Gate Array) implementation. The modified method is firstly tested by MATLAB on several data sets, and the results are compared with those of previous studies. Although the disparity results of the modified method are not better than other methods’,...
Noise reduction in time-frequency domain Kalyoncu, Özden; SÜnver, Zafer; Department of Electrical and Electronics Engineering (2007) In this thesis work, time-frequency filtering of nonstationary signals in noise using Wigner-Ville Distribution is investigated. Continuous-time, discrete-time and discrete Wigner Ville Distribution definitions, their relations, and properties are given. Time-Frequency Peak Filtering Method is presented. The effects of different parameters on the performance of the method are investigated, and the results are presented. Time-Varying Wiener Filter is presented. Using simulations it is shown that the performa...
Time domain scattering from single and multiple objects Azizoğlu, Süha Alp; Koç, Seyit Sencer; Department of Electrical and Electronics Engineering (2008) The importance of the T-matrix method is well-known when frequency domain scattering problems are of interest. With the relatively recent and wide-spread interest in time domain scattering problems, similar applications of the T-matrix method are expected to be useful in the time domain. In this thesis, the time domain spherical scalar wave functions are introduced, translational addition theorems for the time domain spherical scalar wave functions necessary for the solution of multiple scattering problems ...
Image segmentation based on variational techniques Duramaz, Alper; Ünver, Baki Zafer; Department of Electrical and Electronics Engineering (2006) Recently, solutions to the problem of image segmentation and denoising are developed based on the Mumford-Shah model. The model provides an energy functional, called the Mumford-Shah functional, which should be minimized. Since the minimization of the functional has some difficulties, approximate approaches are proposed. Two such methods are the gradient flows method and the Chan-Vese active contour method. The performance evolution in terms of speed shows that the gradient flows method converges to the bou...
Tracker-aware detection : a theoretical and an experimental study Aslan, Murat Şamil; Saranlı, Afşar; Department of Electrical and Electronics Engineering (2009) A promising line of research attempts to bridge the gap between detector and tracker by means of considering jointly optimal parameter settings for both of these subsystems. Along this fruitful path, this thesis study focuses on the problem of detection threshold optimization in a tracker-aware manner so that a feedback from the tracker to the detector is established to maximize the overall system performance. Special emphasis is given to the optimization schemes based on two non-simulation performance pred...

Citation Formats

S. Akyürek, “The implementation complexity of finite impulse response digital filters under different coefficient quantization schemes and realization structures,” M.S. - Master of Science, Middle East Technical University, 2004.