Iterative greedy algorithm for solving the FIR paraunitary approximation problem

In this paper, a method for approximating a multi-input multi-output (MIMO) transfer function by a causal finite-impulse response (FIR) paraunitary (PU) system in a weighted least-squares sense is presented. Using a complete parameterization of FIR PU systems in terms of Householder-like building blocks, an iterative algorithm is proposed that is greedy in the sense that the observed mean-squared error at each iteration is guaranteed to not increase. For certain design problems in which there is a phase-type ambiguity in the desired response, which is formally defined in the paper, a phase feedback modification is proposed in which the phase of the FIR approximant is fed back to the desired response. With this modification in effect, it is shown that the resulting iterative algorithm not only still remains greedy, but also offers a better magnitude-type fit to the desired response. Simulation results show the usefulness and versatility of the proposed algorithm with respect to the design of principal component filter bank (PCFB)-like filter banks and the FIR PU interpolation problem. Concerning the PCFB design problem, it is shown that as the McMillan degree of the FIR PU approximant increases, the resulting filter bank behaves more and more like the infinite-order PCFB, consistent with intuition. In particular, this PCFB-like behavior is shown in terms of filter response shape, multiresolution, coding gain, noise reduction with zeroth-order Wiener filtering in the subbands, and power minimization for discrete multitone (DMT)-type transmultiplexers

Designing Gabor windows using convex optimization

Redundant Gabor frames admit an infinite number of dual frames, yet only the canonical dual Gabor system, constructed from the minimal l2-norm dual window, is widely used. This window function however, might lack desirable properties, e.g. good time-frequency concentration, small support or smoothness. We employ convex optimization methods to design dual windows satisfying the Wexler-Raz equations and optimizing various constraints. Numerical experiments suggest that alternate dual windows with considerably improved features can be found

Graph Signal Processing: Overview, Challenges and Applications

Research in Graph Signal Processing (GSP) aims to develop tools for processing data defined on irregular graph domains. In this paper we first provide an overview of core ideas in GSP and their connection to conventional digital signal processing. We then summarize recent developments in developing basic GSP tools, including methods for sampling, filtering or graph learning. Next, we review progress in several application areas using GSP, including processing and analysis of sensor network data, biological data, and applications to image processing and machine learning. We finish by providing a brief historical perspective to highlight how concepts recently developed in GSP build on top of prior research in other areas.Comment: To appear, Proceedings of the IEE

On the spectral factor ambiguity of FIR energy compaction filter banks

This paper focuses on the design of signal-adapted finite-impulse response (FIR) paraunitary (PU) filter banks optimized for energy compaction (EC). The design of such filter banks has been shown in the literature to consist of the design of an optimal FIR compaction filter followed by an appropriate Karhunen-Loe/spl grave/ve transform (KLT). Despite this elegant construction, EC optimal filter banks have been shown to perform worse than common nonadapted filter banks for coding gain, contrary to intuition. Here, it is shown that this phenomenon is most likely due to the nonuniqueness of the compaction filter in terms of its spectral factors. This nonuniqueness results in a finite set of EC optimal filter banks. By choosing the spectral factor yielding the largest coding gain, it is shown that the resulting filter bank behaves more and more like the infinite-order principal components filter bank (PCFB) in terms of numerous objectives such as coding gain, multiresolution, noise reduction with zeroth-order Wiener filters in the subbands, and power minimization for discrete multitone (DMT)-type nonredundant transmultiplexers

Residual echo signal in critically sampled subband acoustic echo cancellers based on IIR and FIR filter banks

Published versio

A Generalized Window Approach for Designing Transmultiplexers

This paper proposes a computational, very efficient, approach for designing a novel family of M-channel maximally decimated nearly perfect-reconstruction cosine-modulated transmultiplexers. This approach is referred to as the generalized windowing method for transmultiplexers because after knowing the transmission channel a proper weighted sum of the inter-channel and inter-symbol interferences can be properly taken into account in the optimization of the window function, unlike in other existing windowing techniques. The proposed approach has also the following two advantages. First, independent of the number of subchannels and the common order of the subchannel filters, the number of unknowns is only four. Second, the overall optimization procedure is made considerably fast by estimating the above-mentioned sum in terms of two novel measures, namely, the signal to inter-symbol and the signal to inter-channel interferences, which are very easy to evaluate. Furthermore, when the transmission channel is not considered in the design, a table is provided, which contains the parameters for designing the prototype filter directly by using the windowing method without any time-consuming optimization. When comparing the resulting transmultiplexers with the corresponding perfect-reconstruction designs (the same number of subchannels and same prototype filter order), the levels of interferences are practically the same. However, when the system is affected by a strong narrowband interference, the proposed transmultiplexers outperform their PR counterparts. Design examples are included illustrating the efficiency of the proposed design approach over other existing techniques based on the use of the windowing method

Parametric dictionary design for sparse coding

Abstract—This paper introduces a new dictionary design method for sparse coding of a class of signals. It has been shown that one can sparsely approximate some natural signals using an overcomplete set of parametric functions, e.g. [1], [2]. A problem in using these parametric dictionaries is how to choose the parameters. In practice these parameters have been chosen by an expert or through a set of experiments. In the sparse approximation context, it has been shown that an incoherent dictionary is appropriate for the sparse approximation methods. In this paper we first characterize the dictionary design problem, subject to a constraint on the dictionary. Then we briefly explain that equiangular tight frames have minimum coherence. The complexity of the problem does not allow it to be solved exactly. We introduce a practical method to approximately solve it. Some experiments show the advantages one gets by using these dictionaries