Int. J. of Signal and Imaging Systems Engineering   »   2016 Vol.9, No.1

 

 

Title: Design of FRM-based MDFT filter banks in the canonic signed digit space using modified meta-heuristic algorithms

 

Authors: T.S. Bindiya; Elizabeth Elias

 

Addresses:
Department of Electronics and Communication Engineering, National Institute of Technology Calicut, Calicut 673601, Kerala, India
Department of Electronics and Communication Engineering, National Institute of Technology Calicut, Calicut 673601, Kerala, India

 

Abstract: An optimal totally multiplier-less sharp transition width Modified Discrete Fourier Transform (MDFT) filter bank is proposed in this work. Since, here, the aim is to design a low complexity sharp transition width MDFT filter bank, the filters of the filter bank are designed using Frequency Response Masking technique to reduce the number of multipliers and hence the complexity. To replace multipliers with adders and shifters, the filter coefficients are converted into the Canonic Signed Digit space. In order to reduce the number of adders and shifters in the multiplier-less implementation, restricted number of non-zero bits is used in the conversion. This may degrade the performances of the MDFT filter bank. The performances are improved using modified meta-heuristic algorithms. A new hybrid algorithm which combines the qualities of Harmony Search Algorithm and Gravitational Search Algorithm is proposed in this work to optimise the performance of the MDFT filter bank.

 

Keywords: signal processing; DFT filter banks; discrete Fourier transform; MDFT filter banks; modified DFT; FRM; frequency response masking; CSD; canonic signed digit; metaheuristics; GAs; genetic algorithms; differential evolution; ABC; artificial bee colony; HSA; harmony search algorithm; GSA; gravitational search algorithm; filter bank design.

 

DOI: 10.1504/IJSISE.2016.074649

 

Int. J. of Signal and Imaging Systems Engineering, 2016 Vol.9, No.1, pp.20 - 37

 

Available online: 08 Feb 2016

 

 

Editors Full text accessAccess for SubscribersPurchase this articleComment on this article