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

---

Tezin Türü: Yüksek Lisans

Tezin Yürütüldüğü Kurum: Orta Doğu Teknik Üniversitesi, Mühendislik Fakültesi, Elektrik ve Elektronik Mühendisliği Bölümü, Türkiye

Tezin Onay Tarihi: 2004

Öğrenci: SEFA AKYÜREK

Danışman: TOLGA ÇİLOĞLU

Özet:

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.