The design of low complexity two-channel lattice-structure perfect-reconstruction filter banks using genetic algorithms

S Sriranganathan; David Bull; DW Redmill

doi:10.1109/ISCAS.1997.612805

The design of low complexity two-channel lattice-structure perfect-reconstruction filter banks using genetic algorithms

S Sriranganathan, David Bull, DW Redmill

Research output: Contribution to conference › Conference Abstract

347 Downloads (Pure)

Abstract

This paper considers the design of reduced complexity 2 band QMF filter banks. In order to ensure perfect reconstruction, a lattice architecture has been adopted. Genetic algorithms are used to search for an optimal set of coefficients comprising simple sums of signed power of two terms. This allows the entire filter bank to be implemented using only additions and a single multiplicative scaling factor. Results are presented which show that the proposed method can be used to design filters with superior (in terms of minimax ripple) performance, compared to various infinite precision designs. Genetic algorithms can also be used to jointly optimise both performance and complexity in order to achieve an optimum performance/complexity trade off

Original language	English
Pages	2393 - 2396
DOIs	https://doi.org/10.1109/ISCAS.1997.612805
Publication status	Published - Jun 1997

Bibliographical note

Sponsorship: S.Sriranganat1ian acknowledges the support of the committee of vice chancellors and principals and the University of Bristol for scholarship. The authors also would like to thank the Centre for Communications Research of the University of Bristol. This work was performed under EPSRC grant GW25892

Terms of use: Copyright © 1997 IEEE. Reprinted from IEEE International Symposium on Circuits and Systems, 1997 (ISCAS '97).

This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of the University of Bristol's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to [email protected].

By choosing to view this document, you agree to all provisions of the copyright laws protecting it.

Name of Conference: International Symposium on Circuits and Systems
Venue of Conference: Hong Kong

Keywords

genetic algorithms
QMF filter banks

Access to Document

10.1109/ISCAS.1997.612805

Srirnaganathan IEEE ISCAS 1997Accepted author manuscript, 304 KB

http://hdl.handle.net/1983/1496

Handle.net

Persistent link

Cite this

@conference{321d4136a3574e87ade0352da599b0b8,

title = "The design of low complexity two-channel lattice-structure perfect-reconstruction filter banks using genetic algorithms",

abstract = "This paper considers the design of reduced complexity 2 band QMF filter banks. In order to ensure perfect reconstruction, a lattice architecture has been adopted. Genetic algorithms are used to search for an optimal set of coefficients comprising simple sums of signed power of two terms. This allows the entire filter bank to be implemented using only additions and a single multiplicative scaling factor. Results are presented which show that the proposed method can be used to design filters with superior (in terms of minimax ripple) performance, compared to various infinite precision designs. Genetic algorithms can also be used to jointly optimise both performance and complexity in order to achieve an optimum performance/complexity trade off",

keywords = "genetic algorithms, QMF filter banks",

author = "S Sriranganathan and David Bull and DW Redmill",

note = "Sponsorship: S.Sriranganat1ian acknowledges the support of the committee of vice chancellors and principals and the University of Bristol for scholarship. The authors also would like to thank the Centre for Communications Research of the University of Bristol. This work was performed under EPSRC grant GW25892 Terms of use: Copyright {\textcopyright} 1997 IEEE. Reprinted from IEEE International Symposium on Circuits and Systems, 1997 (ISCAS '97). This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of the University of Bristol's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to [email protected]. By choosing to view this document, you agree to all provisions of the copyright laws protecting it. Name of Conference: International Symposium on Circuits and Systems Venue of Conference: Hong Kong",

year = "1997",

month = jun,

doi = "10.1109/ISCAS.1997.612805",

language = "English",

pages = "2393 -- 2396",

}

TY - CONF

T1 - The design of low complexity two-channel lattice-structure perfect-reconstruction filter banks using genetic algorithms

AU - Sriranganathan, S

AU - Bull, David

AU - Redmill, DW

N1 - Sponsorship: S.Sriranganat1ian acknowledges the support of the committee of vice chancellors and principals and the University of Bristol for scholarship. The authors also would like to thank the Centre for Communications Research of the University of Bristol. This work was performed under EPSRC grant GW25892 Terms of use: Copyright © 1997 IEEE. Reprinted from IEEE International Symposium on Circuits and Systems, 1997 (ISCAS '97). This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of the University of Bristol's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to [email protected]. By choosing to view this document, you agree to all provisions of the copyright laws protecting it. Name of Conference: International Symposium on Circuits and Systems Venue of Conference: Hong Kong

PY - 1997/6

Y1 - 1997/6

N2 - This paper considers the design of reduced complexity 2 band QMF filter banks. In order to ensure perfect reconstruction, a lattice architecture has been adopted. Genetic algorithms are used to search for an optimal set of coefficients comprising simple sums of signed power of two terms. This allows the entire filter bank to be implemented using only additions and a single multiplicative scaling factor. Results are presented which show that the proposed method can be used to design filters with superior (in terms of minimax ripple) performance, compared to various infinite precision designs. Genetic algorithms can also be used to jointly optimise both performance and complexity in order to achieve an optimum performance/complexity trade off

AB - This paper considers the design of reduced complexity 2 band QMF filter banks. In order to ensure perfect reconstruction, a lattice architecture has been adopted. Genetic algorithms are used to search for an optimal set of coefficients comprising simple sums of signed power of two terms. This allows the entire filter bank to be implemented using only additions and a single multiplicative scaling factor. Results are presented which show that the proposed method can be used to design filters with superior (in terms of minimax ripple) performance, compared to various infinite precision designs. Genetic algorithms can also be used to jointly optimise both performance and complexity in order to achieve an optimum performance/complexity trade off

KW - genetic algorithms

KW - QMF filter banks

U2 - 10.1109/ISCAS.1997.612805

DO - 10.1109/ISCAS.1997.612805

M3 - Conference Abstract

SP - 2393

EP - 2396

ER -

The design of low complexity two-channel lattice-structure perfect-reconstruction filter banks using genetic algorithms

Abstract

Bibliographical note

Keywords

Access to Document

Handle.net

Fingerprint

Cite this