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

Design and FPGA Implementation of Variable FIR Filters using the Spectral Parameter Approximation and Time-Domain Approach

This brief present a design and FPGA implementation of variable FIR filters using time domain approach of the spectral parameter approximation (SPA) technique. Farrow structure is used to implement the SPA-based filter. In the design of variable filters first design the practical filters which satisfy the given transition bandwidth, passband ripple, and stopband attenuation specifications and then approximate the coefficients of these filters by the impulse response of the Farrow structure. Least-squares technique is used to approximation problem. Various design and implementation cases with FPGA synthesis results are presented

Eigenfilters: A new approach to least-squares FIR filter design and applications including Nyquist filters

A new method of designing linear-phase FIR filters is proposed by minimizing a quadratic measure of the error in the passband and stopband. The method is based on the computation of an eigenvector of an appropriate real, symmetric, and positive-definite matrix. The proposed design procedure is general enough to incorporate both time- and frequency-domain constraints. For example, Nyquist filters can be easily designed using this approach. The design time for the new method is comparable to that of Remez exchange techniques. The passband and stopband errors in the frequency domain can be made equiripple by an iterative process, which involves feeding back the approximation error at each iteration. Several numerical design examples and comparisons to existing methods are presented, which demonstrate the usefulness of the present approach

A robust orthogonal adaptive approach to SISO deconvolution

This paper formulates in a common framework some results from the fields of robust filtering, function approximation with orthogonal basis, and adaptive filtering, and applies them for the design of a general deconvolution processor for SISO systems. The processor is designed to be robust to small parametric uncertainties in the system model, with a partially adaptive orthogonal structure. A simple gradient type of adaptive algorithm is applied to update the coefficients that linearly combine the fixed robust basis functions used to represent the deconvolver. The advantages of the design are inherited from the mentioned fields: low sensitivity to parameter uncertainty in the system model, good numerical and structural behaviour, and the capability of tracking changes in the systems dynamics. The linear equalization of a simple ADSL channel model is presented as an example including comparisons between the optimal nominal, adaptive FIR, and the proposed design.Facultad de IngenieríaComisión de Investigaciones Científicas de la provincia de Buenos Aire

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

Stochastic Analysis of the LMS Algorithm for System Identification with Subspace Inputs

This paper studies the behavior of the low rank LMS adaptive algorithm for the general case in which the input transformation may not capture the exact input subspace. It is shown that the Independence Theory and the independent additive noise model are not applicable to this case. A new theoretical model for the weight mean and fluctuation behaviors is developed which incorporates the correlation between successive data vectors (as opposed to the Independence Theory model). The new theory is applied to a network echo cancellation scheme which uses partial-Haar input vector transformations. Comparison of the new model predictions with Monte Carlo simulations shows good-to-excellent agreement, certainly much better than predicted by the Independence Theory based model available in the literature