15 research outputs found

    Orthonormal and biorthonormal filter banks as convolvers, and convolutional coding gain

    Get PDF
    Convolution theorems for filter bank transformers are introduced. Both uniform and nonuniform decimation ratios are considered, and orthonormal as well as biorthonormal cases are addressed. All the theorems are such that the original convolution reduces to a sum of shorter, decoupled convolutions in the subbands. That is, there is no need to have cross convolution between subbands. For the orthonormal case, expressions for optimal bit allocation and the optimized coding gain are derived. The contribution to coding gain comes partly from the nonuniformity of the signal spectrum and partly from nonuniformity of the filter spectrum. With one of the convolved sequences taken to be the unit pulse function,,e coding gain expressions reduce to those for traditional subband and transform coding. The filter-bank convolver has about the same computational complexity as a traditional convolver, if the analysis bank has small complexity compared to the convolution itself

    Theory of optimal orthonormal subband coders

    Get PDF
    The theory of the orthogonal transform coder and methods for its optimal design have been known for a long time. We derive a set of necessary and sufficient conditions for the coding-gain optimality of an orthonormal subband coder for given input statistics. We also show how these conditions can be satisfied by the construction of a sequence of optimal compaction filters one at a time. Several theoretical properties of optimal compaction filters and optimal subband coders are then derived, especially pertaining to behavior as the number of subbands increases. Significant theoretical differences between optimum subband coders, transform coders, and predictive coders are summarized. Finally, conditions are presented under which optimal orthonormal subband coders yield as much coding gain as biorthogonal ones for a fixed number of subbands

    Polynomial eigenvalue decomposition for multichannel broadband signal processing

    Get PDF
    This article is devoted to the polynomial eigenvalue decomposition (PEVD) and its applications in broadband multichannel signal processing, motivated by the optimum solutions provided by the eigenvalue decomposition (EVD) for the narrow-band case [1], [2]. In general, the successful techniques from narrowband problems can also be applied to broadband ones, leading to improved solutions. Multichannel broadband signals arise at the core of many essential commercial applications such as telecommunications, speech processing, healthcare monitoring, astronomy and seismic surveillance, and military technologies like radar, sonar and communications [3]. The success of these applications often depends on the performance of signal processing tasks, including data compression [4], source localization [5], channel coding [6], signal enhancement [7], beamforming [8], and source separation [9]. In most cases and for narrowband signals, performing an EVD is the key to the signal processing algorithm. Therefore, this paper aims to introduce PEVD as a novel mathematical technique suitable for many broadband signal processing applications

    Theory of optimal orthonormal subband coders

    Full text link

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

    Get PDF
    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

    Enhanced multi-user DMT spectrum management using polynomial matrix decomposition techniques

    Get PDF
    This thesis researches the increasingly critical roles played by intelligent resource management and interference mitigation algorithms in present-day input multiple output (MIMO) communication systems. This thesis considers the application of polynomial matrix decomposition (PMD) algorithms, an emerging broadband factorisation technology for broadband MIMO access networks. Present DSL systems’ performance is constrained by the presence of interference (crosstalk) between multiple users sharing a common physical cable bundle. Compared to the traditional static spectrum management methods that define their survival to the worst-case scenarios, DSM methods provides some degree of flexibility to both direct channel and noise parameters to improve evolvability and robustness significantly. A novel crosstalk-aware DSM algorithm is proposed for the efficient management of multi-user DSL systems. Joint power allocation procedures are considered for the proposed single-channel equalisation method in DSL access networks. This thesis then shows that DSM can also benefit overdetermined precoding-equalisation systems, when the channel state information (CSI) parameters call for a specific decision feedback criterion to achieve a perfect reconstruction. A reasonable redundancy is introduced to reformulate the original multi-user MIMO problem into the simplest case of power management problem. DSM algorithms are primarily applied to solve the power allocation problem in DSM networks with the aim of maximising the system attribute rather than meeting specific requirements. Also, a powerful PMD algorithm known as sequential matrix diagonalisation (SMD) is used for analysing the eigenvalue decomposition problem by quantifying the available system resource including the effects of the crosstalk and its parameters. This analysis is carried out through joint precoding and equalisation structures. The thesis also investigates dynamic interference mitigation strategies for improving the performance of DSL networks. Two different mitigation strategies through a decision feedback equalisation (DFE) criterion are considered, including zero-forcing (ZF) and minimum mean square error (MMSE) equalisers. The difference between ZF and MMSE equalisations is analysed. Some experimental simulation results demonstrate the performance of both ZF and MMSE equalisation under the DFE equalisation constraint settings. Model reduction on the MMSE equalisation is thus applied to balance the crosstalk interference and enhance the data-rate throughput. Finally, the thesis studies a multi-user MIMO problem under the utility maximisation framework. Simulation results illustrate that the power allocation of multi-user DSL transmission can be jointly controlled and the interference can often be mitigated optimally on a single user basis. Driven by imperfect CSI information in current DSL networks, the research presents a novel DSM method that allows not only crosstalk mitigation, but also the exploitation of crosstalk environments through the fielding of versatile, flexible and evolvable systems. The proposed DSM tool is presented to achieve a robust mitigating system in any arbitrary overdetermined multi-user MIMO environment. Numerical optimisation results show that the mitigation of crosstalk impairment using the proposed DSM strategy. The design and implementation of the proposed DSM are carried out in the environment of MATLAB

    Efficient Multiband Algorithms for Blind Source Separation

    Get PDF
    The problem of blind separation refers to recovering original signals, called source signals, from the mixed signals, called observation signals, in a reverberant environment. The mixture is a function of a sequence of original speech signals mixed in a reverberant room. The objective is to separate mixed signals to obtain the original signals without degradation and without prior information of the features of the sources. The strategy used to achieve this objective is to use multiple bands that work at a lower rate, have less computational cost and a quicker convergence than the conventional scheme. Our motivation is the competitive results of unequal-passbands scheme applications, in terms of the convergence speed. The objective of this research is to improve unequal-passbands schemes by improving the speed of convergence and reducing the computational cost. The first proposed work is a novel maximally decimated unequal-passbands scheme.This scheme uses multiple bands that make it work at a reduced sampling rate, and low computational cost. An adaptation approach is derived with an adaptation step that improved the convergence speed. The performance of the proposed scheme was measured in different ways. First, the mean square errors of various bands are measured and the results are compared to a maximally decimated equal-passbands scheme, which is currently the best performing method. The results show that the proposed scheme has a faster convergence rate than the maximally decimated equal-passbands scheme. Second, when the scheme is tested for white and coloured inputs using a low number of bands, it does not yield good results; but when the number of bands is increased, the speed of convergence is enhanced. Third, the scheme is tested for quick changes. It is shown that the performance of the proposed scheme is similar to that of the equal-passbands scheme. Fourth, the scheme is also tested in a stationary state. The experimental results confirm the theoretical work. For more challenging scenarios, an unequal-passbands scheme with over-sampled decimation is proposed; the greater number of bands, the more efficient the separation. The results are compared to the currently best performing method. Second, an experimental comparison is made between the proposed multiband scheme and the conventional scheme. The results show that the convergence speed and the signal-to-interference ratio of the proposed scheme are higher than that of the conventional scheme, and the computation cost is lower than that of the conventional scheme

    Wavelets and Subband Coding

    Get PDF
    First published in 1995, Wavelets and Subband Coding offered a unified view of the exciting field of wavelets and their discrete-time cousins, filter banks, or subband coding. The book developed the theory in both continuous and discrete time, and presented important applications. During the past decade, it filled a useful need in explaining a new view of signal processing based on flexible time-frequency analysis and its applications. Since 2007, the authors now retain the copyright and allow open access to the book
    corecore