CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Design of Multiplier-less Sharp Transition Width MDFT Filter Banks using Modified Metaheuristic Algorithms

by Bindiya T. S., Elizabeth Elias
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 88 - Number 2
Year of Publication: 2014
Authors: Bindiya T. S., Elizabeth Elias
10.5120/15321-3642

Bindiya T. S., Elizabeth Elias . Design of Multiplier-less Sharp Transition Width MDFT Filter Banks using Modified Metaheuristic Algorithms. International Journal of Computer Applications. 88, 2 ( February 2014), 1-14. DOI=10.5120/15321-3642

@article{ 10.5120/15321-3642,
author = { Bindiya T. S., Elizabeth Elias },
title = { Design of Multiplier-less Sharp Transition Width MDFT Filter Banks using Modified Metaheuristic Algorithms },
journal = { International Journal of Computer Applications },
issue_date = { February 2014 },
volume = { 88 },
number = { 2 },
month = { February },
year = { 2014 },
issn = { 0975-8887 },
pages = { 1-14 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume88/number2/15321-3642/ },
doi = { 10.5120/15321-3642 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:06:33.333920+05:30
%A Bindiya T. S.
%A Elizabeth Elias
%T Design of Multiplier-less Sharp Transition Width MDFT Filter Banks using Modified Metaheuristic Algorithms
%J International Journal of Computer Applications
%@ 0975-8887
%V 88
%N 2
%P 1-14
%D 2014
%I Foundation of Computer Science (FCS), NY, USA
Abstract

The significant advantage of modified discrete Fourier transform (MDFT) filter banks over the conventional discrete Fourier transform (DFT) filter banks is the structure inherent alias cancellation in the former. When the number of channels is increased, the filters in the filter bank need to be of sharp transition width. This increases the complexity of the filters and hence that of the filter bank. Frequency Response Masking (FRM) approach is known to reduce the complexity of sharp transition width filters. This paper proposes a method to realize MDFT filter banks using FRM with much lesser complexity. To further reduce the complexity, the filter banks are made totally multiplier-less. This is done by converting the coefficients to the canonic signed digit (CSD) representation. Metaheuristic algorithms are used to improve the performance of the CSD represented filter banks. Modified integer coded genetic algorithm, differential evolution, artificial bee colony, harmony search and gravitational search algorithms are proposed to be used for the optimization of the proposed multiplier-less MDFT filter banks. This design method reduces the complexity, power consumption and chip area for the implementation of the uniform filter banks.

References
  1. Fliege, N. J. (1994). Multirate digital signal processing: multirate systems, filter banks, wavelets. John Wiley and Sons, Inc.
  2. Fliege, N. J. (1994, April). Modified DFT polyphase SBC filter banks with almost perfect reconstruction. In Acoustics, Speech, and Signal Processing, 1994. ICASSP-94. , 1994 IEEE International Conference on (Vol. 3, pp. III-149). IEEE.
  3. Karp, T. and Fliege, N. J. (1999). Modified DFT filter banks with perfect reconstruction. Circuits and Systems II: Analog and Digital Signal Processing, IEEE Transactions on, 46(11), 1404-1414.
  4. Lim, Y. (1986). Frequency-response masking approach for the synthesis of sharp linear phase digital filters. Circuits and Systems, IEEE Transactions on, 33(4), 357-364.
  5. Li, N. and Nowrouzian, B. (2006, May). Application of frequency-response masking technique to the design of a novel modified-DFT filter bank. In Circuits and Systems, 2006. ISCAS 2006. Proceedings. 2006 IEEE International Symposium on (pp. 4-pp). IEEE.
  6. Lim, Y. C. , Yang, R. , Li, D. , and Song, J. (1999). Signed power-of-two term allocation scheme for the design of digital filters. Circuits and Systems II: Analog and Digital Signal Processing, IEEE Transactions on, 46(5), 577-584.
  7. Hartley, R. I. (1996). Subexpression sharing in filters using canonic signed digit multipliers. Circuits and Systems II:Analog and Digital Signal Processing, IEEE Transactions on, 43(10), 677-688.
  8. Haupt, R. L. , and Haupt, S. E. (2004). Practical genetic algorithms. John Wiley and Sons.
  9. Bindiya T. S, V. Satish Kumar and Elizabeth Elias, (2012), Design of Low power and Low Complexity Multiplier-less Reconfigurable Non-uniform Channel filter using Genetic Algorithm, Global Journal of Research in Engineering. Vol. 12, Issue. 6.
  10. Fuller, A. T. , Nowrouzian, B. , and Ashrafzadeh, F. (1998, August). Optimization of FIR digital filters over the canonical signed-digit coefficient space using genetic algorithms. In Circuits and Systems, 1998. Proceedings. 1998 Midwest Symposium on (pp. 456-459). IEEE.
  11. Mercier, P. , Mohan-Kilambi, S. , Nowrouzian, B. , 2007, Optimization of FRM FIR digital filters over CSD and DBNS multiplier coefficient spaces employing a novel genetic algorithm, Computers, (7), 20-31.
  12. Manoj, V. J. , and Elias, E. (2009). Design of multiplier-less nonuniform filter bank transmultiplexer using genetic algorithm. Signal Processing, 89(11), 2274-2285.
  13. Storn, R. , and Price, K. (1997). Differential evolutiona simple and efficient heuristic for global optimization over continuous spaces. Journal of global optimization, 11(4), 341-359.
  14. Karaboga, D. , and Basturk, B. (2008). On the performance of artificial bee colony (ABC) algorithm. Applied soft computing, 8(1), 687-697.
  15. Lee, K. S. , and Geem, Z. W. (2005). A new meta-heuristic algorithm for continuous engineering optimization: harmony search theory and practice. Computer methods in applied mechanics and engineering, 194(36), 3902-3933.
  16. Z. W. Geem, Music-Inspired Harmony Search Algorithm: Theory and Applications. New York: Springer-Verlag, ser. Studies in Computational Intelligence Series, 2009.
  17. Rashedi, E. , Nezamabadi-Pour, H. , and Saryazdi, S. (2009). GSA: a gravitational search algorithm. Information sciences, 179(13), 2232-2248.
  18. Manoj, V. J. , and Elias, E. (2012). Artificial bee colony algorithm for the design of multiplier-less nonuniform filter bank transmultiplexer. Information Sciences, 192, 193-203.
  19. Manuel, M. , and Elias, E. (2013). Design of frequency response masking FIR filter in the Canonic Signed Digit space using modified Artificial Bee Colony algorithm. Engineering Applications of Artificial Intelligence, 26(1), 660-668.
  20. Bindiya T. S. and Elias, E. (2012). , Design of Multiplierless Reconfigurable Non-uniform Channel Filters using Metaheuristic Algorithms, International Journal of Computer Applications, Published by Foundation of Computer Science, New York, USA, 59(11):1-11
  21. Saramki, T. , and Lim, Y. C. (2003). Use of the Remez Algorithm for Designing FRM Based FIRr Filters. Circuits, Systems and Signal Processing, 22(2), 77-97.
  22. Yang, X. S. (2009). Harmony search as a metaheuristic algorithm. In Music-inspired harmony search algorithm (pp. 1- 14). Springer Berlin Heidelberg.
  23. Li, D. , Song, J. , and Lim, Y. C. (1993, May). A polynomialtime algorithm for designing digital filters with power-of-two coefficients. In Circuits and Systems, 1993. , ISCAS'93, 1993 IEEE International Symposium on (pp. 84-87). IEEE.
  24. Boyd, S. P. , and Vandenberghe, L. (2004). Convex optimization. Cambridge university press.
Index Terms

Computer Science
Information Sciences

Keywords

Frequency response masking Modified discrete Fourier transform filter banks Canonic signed digit Meta-heuristic algorithms Genetic algorithm Differential evolution Artificial bee colony Harmony search algorithm Gravitational search algorithm

Powered by PhDFocusTM