"Rewiring" Filterbanks for Local Fourier Analysis: Theory and Practice

This article describes a series of new results outlining equivalences between certain "rewirings" of filterbank system block diagrams, and the corresponding actions of convolution, modulation, and downsampling operators. This gives rise to a general framework of reverse-order and convolution subband structures in filterbank transforms, which we show to be well suited to the analysis of filterbank coefficients arising from subsampled or multiplexed signals. These results thus provide a means to understand time-localized aliasing and modulation properties of such signals and their subband representations--notions that are notably absent from the global viewpoint afforded by Fourier analysis. The utility of filterbank rewirings is demonstrated by the closed-form analysis of signals subject to degradations such as missing data, spatially or temporally multiplexed data acquisition, or signal-dependent noise, such as are often encountered in practical signal processing applications

Alias-free, real coefficient m-band QMF banks for arbitrary m

Based on a generalized framework for alias free QMF banks, a theory is developed for the design of uniform QMF banks with real-coefficient analysis filters, such that aliasing can be completely canceled by appropriate choice of real-coefficient synthesis filters. These results are then applied for the derivation of closed-form expressions for the synthesis filters (both FIR and IIR), that ensure cancelation of aliasing for a given set of analysis filters. The results do not involve the inversion of the alias-component (AC) matrix

Filterbank optimization with convex objectives and the optimality of principal component forms

This paper proposes a general framework for the optimization of orthonormal filterbanks (FBs) for given input statistics. This includes as special cases, many previous results on FB optimization for compression. It also solves problems that have not been considered thus far. FB optimization for coding gain maximization (for compression applications) has been well studied before. The optimum FB has been known to satisfy the principal component property, i.e., it minimizes the mean-square error caused by reconstruction after dropping the P weakest (lowest variance) subbands for any P. We point out a much stronger connection between this property and the optimality of the FB. The main result is that a principal component FB (PCFB) is optimum whenever the minimization objective is a concave function of the subband variances produced by the FB. This result has its grounding in majorization and convex function theory and, in particular, explains the optimality of PCFBs for compression. We use the result to show various other optimality properties of PCFBs, especially for noise-suppression applications. Suppose the FB input is a signal corrupted by additive white noise, the desired output is the pure signal, and the subbands of the FB are processed to minimize the output noise. If each subband processor is a zeroth-order Wiener filter for its input, we can show that the expected mean square value of the output noise is a concave function of the subband signal variances. Hence, a PCFB is optimum in the sense of minimizing this mean square error. The above-mentioned concavity of the error and, hence, PCFB optimality, continues to hold even with certain other subband processors such as subband hard thresholds and constant multipliers, although these are not of serious practical interest. We prove that certain extensions of this PCFB optimality result to cases where the input noise is colored, and the FB optimization is over a larger class that includes biorthogonal FBs. We also show that PCFBs do not exist for the classes of DFT and cosine-modulated FBs

Implementation of accurate broadband steering vectors for broadband angle of arrival estimation

Motivated by accurate broadband steering vector requirements for applications such as broadband angle of arrival estimation, we review fractional delay filter designs. A common feature across these are their rapidly decreasing performance as the Nyquist rate is approached. We propose a filter bank based approach, which operates standard fractional delay filters on a series of frequency-shifted subband signals, such that they appear in the filters’ lowpass region. We demonstrate the appeal of this approach in simulations

Filter bank based fractional delay filter implementation for widely accurate broadband steering vectors

Applications such as broadband angle of arrival estimation require the implementation of accurate broadband steering vectors, which generally rely on fractional delay filter designs. These designs commonly exhibit a rapidly decreasing performance as the Nyquist rate is approached. To overcome this, we propose a filter bank based approach, where standard fractional delay filters operate on a series of frequency-shifted oversampled subband signals, such that they appear in the filter's lowpass region. Simulations demonstrate the appeal of this approach

Orthogonal transmultiplexers : extensions to digital subscriber line (DSL) communications

An orthogonal transmultiplexer which unifies multirate filter bank theory and communications theory is investigated in this dissertation. Various extensions of the orthogonal transmultiplexer techniques have been made for digital subscriber line communication applications. It is shown that the theoretical performance bounds of single carrier modulation based transceivers and multicarrier modulation based transceivers are the same under the same operational conditions. Single carrier based transceiver systems such as Quadrature Amplitude Modulation (QAM) and Carrierless Amplitude and Phase (CAP) modulation scheme, multicarrier based transceiver systems such as Orthogonal Frequency Division Multiplexing (OFDM) or Discrete Multi Tone (DMT) and Discrete Subband (Wavelet) Multicarrier based transceiver (DSBMT) techniques are considered in this investigation. The performance of DMT and DSBMT based transceiver systems for a narrow band interference and their robustness are also investigated. It is shown that the performance of a DMT based transceiver system is quite sensitive to the location and strength of a single tone (narrow band) interference. The performance sensitivity is highlighted in this work. It is shown that an adaptive interference exciser can alleviate the sensitivity problem of a DMT based system. The improved spectral properties of DSBMT technique reduces the performance sensitivity for variations of a narrow band interference. It is shown that DSBMT technique outperforms DMT and has a more robust performance than the latter. The superior performance robustness is shown in this work. Optimal orthogonal basis design using cosine modulated multirate filter bank is discussed. An adaptive linear combiner at the output of analysis filter bank is implemented to eliminate the intersymbol and interchannel interferences. It is shown that DSBMT is the most suitable technique for a narrow band interference environment. A blind channel identification and optimal MMSE based equalizer employing a nonmaximally decimated filter bank precoder / postequalizer structure is proposed. The performance of blind channel identification scheme is shown not to be sensitive to the characteristics of unknown channel. The performance of the proposed optimal MMSE based equalizer is shown to be superior to the zero-forcing equalizer

On the design of nearly-PR and PR FIR cosine modulated filter banks having approximate cosine-rolloff transition band

This paper proposes an efficient method for designing nearly perfect reconstruction (NPR) and perfect reconstruction (PR) cosine modulated filter banks (CMFBs) with prototype filters having an approximate cosine-rolloff (CR) transition band. It is shown that the flatness condition required for an NPR CMFB can be automatically satisfied by using a prototype filter with a CR transition band. The design problem is then formulated as a convex minimax optimization problem, and it can be solved by second-order cone programming (SOCP). By using the NPR CMFB so obtained as an initial guess to nonlinear optimizers such as Fmincon in Matlab, high-quality PR CMFBs can be obtained. The advantages of the proposed method are that it does not require a user-supplied initial guess of the prototype filter and bumps in the passband of the analysis filters can be effectively suppressed. © 2008 IEEE.published_or_final_versio