6,156 research outputs found
Computation of the para-pseudoinverse for oversampled filter banks: Forward and backward Greville formulas
This is the author's accepted manuscript. The final published article is available from the link below. Copyright @ 2008 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works.Frames and oversampled filter banks have been extensively studied over the past few years due to their increased design freedom and improved error resilience. In frame expansions, the least square signal reconstruction operator is called the dual frame, which can be obtained by choosing the synthesis filter bank as the para-pseudoinverse of the analysis bank. In this paper, we study the computation of the dual frame by exploiting the Greville formula, which was originally derived in 1960 to compute the pseudoinverse of a matrix when a new row is appended. Here, we first develop the backward Greville formula to handle the case of row deletion. Based on the forward Greville formula, we then study the computation of para-pseudoinverse for extended filter banks and Laplacian pyramids. Through the backward Greville formula, we investigate the frame-based error resilient transmission over erasure channels. The necessary and sufficient condition for an oversampled filter bank to be robust to one erasure channel is derived. A postfiltering structure is also presented to implement the para-pseudoinverse when the transform coefficients in one subband are completely lost
Improved technique for design of perfect reconstruction FIR QMF banks with lossless polyphase matrices
A technique is developed for the design of analysis filters in an M-channel maximally decimated, perfect reconstruction, finite-impulse-response quadrature mirror filter (FIR QMF) bank that has a lossless polyphase-component matrix E(z). The aim is to optimize the parameters characterizing E(z) until the sum of the stopband energies of the analysis filters is minimized. There are four novel elements in the procedure reported here. The first is a technique for efficient initialization of one of the M analysis filters, as a spectral factor of an Mth band filter. The factorization itself is done in an efficient manner using the eigenfilters approach, without the need for root-finding techniques. The second element is the initialization of the internal parameters which characterize E(z), based on the above spectral factor. The third element is a modified characterization, mostly free from rotation angles, of the FIR E(z). The fourth is the incorporation of symmetry among the analysis filters, so as to minimize the number of unknown parameters being optimized. The resulting design procedure always gives better filter responses than earlier ones (for a given filter length) and converges much faste
Algorithms and architectures for the multirate additive synthesis of musical tones
In classical Additive Synthesis (AS), the output signal is the sum of a large number of independently controllable sinusoidal partials. The advantages of AS for music synthesis are well known as is the high computational cost. This thesis is concerned with the computational optimisation of AS by multirate DSP techniques. In note-based music synthesis, the expected bounds of the frequency trajectory of each partial in a finite lifecycle tone determine critical time-invariant partial-specific sample rates which are lower than the conventional rate (in excess of 40kHz) resulting in computational savings. Scheduling and interpolation (to suppress quantisation noise) for many sample rates is required, leading to the concept of Multirate Additive Synthesis (MAS) where these overheads are minimised by synthesis filterbanks which quantise the set of available sample rates. Alternative AS optimisations are also appraised. It is shown that a hierarchical interpretation of the QMF filterbank preserves AS generality and permits efficient context-specific adaptation of computation to required note dynamics. Practical QMF implementation and the modifications necessary for MAS are discussed. QMF transition widths can be logically excluded from the MAS paradigm, at a cost. Therefore a novel filterbank is evaluated where transition widths are physically excluded. Benchmarking of a hypothetical orchestral synthesis application provides a tentative quantitative analysis of the performance improvement of MAS over AS. The mapping of MAS into VLSI is opened by a review of sine computation techniques. Then the functional specification and high-level design of a conceptual MAS Coprocessor (MASC) is developed which functions with high autonomy in a loosely-coupled master- slave configuration with a Host CPU which executes filterbanks in software. Standard hardware optimisation techniques are used, such as pipelining, based upon the principle of an application-specific memory hierarchy which maximises MASC throughput
Design of FIR paraunitary filter banks for subband coding using a polynomial eigenvalue decomposition
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
SETI science working group report
This report covers the initial activities and deliberations of a continuing working group asked to assist the SETI Program Office at NASA. Seven chapters present the group's consensus on objectives, strategies, and plans for instrumental R&D and for a microwave search for extraterrestrial in intelligence (SETI) projected for the end of this decade. Thirteen appendixes reflect the views of their individual authors. Included are discussions of the 8-million-channel spectrum analyzer architecture and the proof-of-concept device under development; signal detection, recognition, and identification on-line in the presence of noise and radio interference; the 1-10 GHz sky survey and the 1-3 GHz targeted search envisaged; and the mutual interests of SETI and radio astronomy. The report ends with a selective, annotated SETI reading list of pro and contra SETI publications
Rates of convergence for the approximation of dual shift-invariant systems in
A shift-invariant system is a collection of functions of the
form . Such systems play an important role in
time-frequency analysis and digital signal processing. A principal problem is
to find a dual system such that each
function can be written as . The
mathematical theory usually addresses this problem in infinite dimensions
(typically in or ), whereas numerical methods have to operate
with a finite-dimensional model. Exploiting the link between the frame operator
and Laurent operators with matrix-valued symbol, we apply the finite section
method to show that the dual functions obtained by solving a finite-dimensional
problem converge to the dual functions of the original infinite-dimensional
problem in . For compactly supported (FIR filter banks) we
prove an exponential rate of convergence and derive explicit expressions for
the involved constants. Further we investigate under which conditions one can
replace the discrete model of the finite section method by the periodic
discrete model, which is used in many numerical procedures. Again we provide
explicit estimates for the speed of convergence. Some remarks on tight frames
complete the paper
- …