Design of FIR paraunitary filter banks for subband coding using a polynomial eigenvalue decomposition

Soydan Redif, John G. McWhirter, Stephan Weiss

Research output: Contribution to journalArticle

47 Citations (Scopus)

Abstract

The problem of paraunitary filter bank design for subband coding has received considerable attention in recent years, not least because of the energy preserving property of this class of filter banks. In this paper, we consider the design of signal-adapted, finite impulse response (FIR), paraunitary filter banks using polynomial matrix EVD (PEVD) techniques. Modifications are proposed to an iterative, time-domain PEVD method, known as the sequential best rotation (SBR2) algorithm, which enables its effective application to the problem of FIR orthonormal filter bank design for efficient subband coding. By choosing an optimisation scheme that maximises the coding gain at each stage of the algorithm, it is shown that the resulting filter bank behaves more and more like the infiniteorder principle component filter bank (PCFB). The proposed method is compared to state-of-the-art techniques, namely the iterative greedy algorithm (IGA), the approximate EVD (AEVD), standard SBR2 and a fast algorithm for FIR compaction filter design, called the window method (WM). We demonstrate that for the calculation of the subband coder, the WM approach offers a low-cost alternative at lower coding gains, while at moderate to high complexity, the proposed approach outperforms the benchmarkers. In terms of run-time complexity, AEVD performs well at low orders, while the proposed algorithm offers a better coding gain than the benchmarkers at moderate to high filter order for a number of simulation scenarios.
LanguageEnglish
Pages5253-5264
Number of pages12
JournalIEEE Transactions on Signal Processing
Volume59
Issue number11
Early online date1 Aug 2011
DOIs
Publication statusPublished - Nov 2011

Fingerprint

Filter banks
FIR filters
Polynomials
Decomposition
Impulse response
Compaction
Costs

Keywords

  • algorithm design and analysis
  • compaction
  • covariance matrix
  • encoding
  • matrix decomposition
  • polynomials
  • signal processing algorithms

Cite this

@article{b6014069370b424688e3415f3b768848,
title = "Design of FIR paraunitary filter banks for subband coding using a polynomial eigenvalue decomposition",
abstract = "The problem of paraunitary filter bank design for subband coding has received considerable attention in recent years, not least because of the energy preserving property of this class of filter banks. In this paper, we consider the design of signal-adapted, finite impulse response (FIR), paraunitary filter banks using polynomial matrix EVD (PEVD) techniques. Modifications are proposed to an iterative, time-domain PEVD method, known as the sequential best rotation (SBR2) algorithm, which enables its effective application to the problem of FIR orthonormal filter bank design for efficient subband coding. By choosing an optimisation scheme that maximises the coding gain at each stage of the algorithm, it is shown that the resulting filter bank behaves more and more like the infiniteorder principle component filter bank (PCFB). The proposed method is compared to state-of-the-art techniques, namely the iterative greedy algorithm (IGA), the approximate EVD (AEVD), standard SBR2 and a fast algorithm for FIR compaction filter design, called the window method (WM). We demonstrate that for the calculation of the subband coder, the WM approach offers a low-cost alternative at lower coding gains, while at moderate to high complexity, the proposed approach outperforms the benchmarkers. In terms of run-time complexity, AEVD performs well at low orders, while the proposed algorithm offers a better coding gain than the benchmarkers at moderate to high filter order for a number of simulation scenarios.",
keywords = "algorithm design and analysis, compaction, covariance matrix , encoding, matrix decomposition, polynomials, signal processing algorithms",
author = "Soydan Redif and McWhirter, {John G.} and Stephan Weiss",
year = "2011",
month = "11",
doi = "10.1109/TSP.2011.2163065",
language = "English",
volume = "59",
pages = "5253--5264",
journal = "IEEE Transactions on Signal Processing",
issn = "1053-587X",
number = "11",

}

Design of FIR paraunitary filter banks for subband coding using a polynomial eigenvalue decomposition. / Redif, Soydan ; McWhirter, John G. ; Weiss, Stephan.

In: IEEE Transactions on Signal Processing, Vol. 59, No. 11, 11.2011, p. 5253-5264.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Design of FIR paraunitary filter banks for subband coding using a polynomial eigenvalue decomposition

AU - Redif, Soydan

AU - McWhirter, John G.

AU - Weiss, Stephan

PY - 2011/11

Y1 - 2011/11

N2 - The problem of paraunitary filter bank design for subband coding has received considerable attention in recent years, not least because of the energy preserving property of this class of filter banks. In this paper, we consider the design of signal-adapted, finite impulse response (FIR), paraunitary filter banks using polynomial matrix EVD (PEVD) techniques. Modifications are proposed to an iterative, time-domain PEVD method, known as the sequential best rotation (SBR2) algorithm, which enables its effective application to the problem of FIR orthonormal filter bank design for efficient subband coding. By choosing an optimisation scheme that maximises the coding gain at each stage of the algorithm, it is shown that the resulting filter bank behaves more and more like the infiniteorder principle component filter bank (PCFB). The proposed method is compared to state-of-the-art techniques, namely the iterative greedy algorithm (IGA), the approximate EVD (AEVD), standard SBR2 and a fast algorithm for FIR compaction filter design, called the window method (WM). We demonstrate that for the calculation of the subband coder, the WM approach offers a low-cost alternative at lower coding gains, while at moderate to high complexity, the proposed approach outperforms the benchmarkers. In terms of run-time complexity, AEVD performs well at low orders, while the proposed algorithm offers a better coding gain than the benchmarkers at moderate to high filter order for a number of simulation scenarios.

AB - The problem of paraunitary filter bank design for subband coding has received considerable attention in recent years, not least because of the energy preserving property of this class of filter banks. In this paper, we consider the design of signal-adapted, finite impulse response (FIR), paraunitary filter banks using polynomial matrix EVD (PEVD) techniques. Modifications are proposed to an iterative, time-domain PEVD method, known as the sequential best rotation (SBR2) algorithm, which enables its effective application to the problem of FIR orthonormal filter bank design for efficient subband coding. By choosing an optimisation scheme that maximises the coding gain at each stage of the algorithm, it is shown that the resulting filter bank behaves more and more like the infiniteorder principle component filter bank (PCFB). The proposed method is compared to state-of-the-art techniques, namely the iterative greedy algorithm (IGA), the approximate EVD (AEVD), standard SBR2 and a fast algorithm for FIR compaction filter design, called the window method (WM). We demonstrate that for the calculation of the subband coder, the WM approach offers a low-cost alternative at lower coding gains, while at moderate to high complexity, the proposed approach outperforms the benchmarkers. In terms of run-time complexity, AEVD performs well at low orders, while the proposed algorithm offers a better coding gain than the benchmarkers at moderate to high filter order for a number of simulation scenarios.

KW - algorithm design and analysis

KW - compaction

KW - covariance matrix

KW - encoding

KW - matrix decomposition

KW - polynomials

KW - signal processing algorithms

U2 - 10.1109/TSP.2011.2163065

DO - 10.1109/TSP.2011.2163065

M3 - Article

VL - 59

SP - 5253

EP - 5264

JO - IEEE Transactions on Signal Processing

T2 - IEEE Transactions on Signal Processing

JF - IEEE Transactions on Signal Processing

SN - 1053-587X

IS - 11

ER -