A 2D DWT architecture suitable for the Embedded Zerotree Wavelet Algorithm

Digital Imaging has had an enormous impact on industrial applications such as the Internet and video-phone systems. However, demand for industrial applications is growing enormously. In particular, internet application users are, growing at a near exponential rate. The sharp increase in applications using digital images has caused much emphasis on the fields of image coding, storage, processing and communications. New techniques are continuously developed with the main aim of increasing efficiency. Image coding is in particular a field of great commercial interest. A digital image requires a large amount of data to be created. This large amount of data causes many problems when storing, transmitting or processing the image. Reducing the amount of data that can be used to represent an image is the main objective of image coding. Since the main objective is to reduce the amount of data that represents an image, various techniques have been developed and are continuously developed to increase efficiency. The JPEG image coding standard has enjoyed widespread acceptance, and the industry continues to explore its various implementation issues. However, recent research indicates multiresolution based image coding is a far superior alternative. A recent development in the field of image coding is the use of Embedded Zerotree Wavelet (EZW) as the technique to achieve image compression. One of The aims of this theses is to explain how this technique is superior to other current coding standards. It will be seen that an essential part orthis method of image coding is the use of multi resolution analysis, a subband system whereby the subbands arc logarithmically spaced in frequency and represent an octave band decomposition. The block structure that implements this function is termed the two dimensional Discrete Wavelet Transform (2D-DWT). The 20 DWT is achieved by several architectures and these are analysed in order to choose the best suitable architecture for the EZW coder. Finally, this architecture is implemented and verified using the Synopsys Behavioural Compiler and recommendations are made based on experimental findings

A Theory for Multiresolution Signal Decomposition: The Wavelet Representation

It is now well admitted in the computer vision literature that a multi-resolution decomposition provides a useful image representation for vision algorithms. In this paper we show that the wavelet theory recently developed by the mathematician Y. Meyer enables us to understand and model the concepts of resolution and scale. In computer vision we generally do not want to analyze the images at each resolution level because the information is redundant. After processing the signal at a resolution r0, it is more efficient to analyze only the additional details which are available at a higher resolution rl. We prove that this difference of information can be computed by decomposing the signal on a wavelet orthonormal basis and that it can be efficiently calculated with a pyramid transform. This can also be interpreted as a division of the signal in a set of orientation selective frequency channels. Such a decomposition is particularly well adapted for computer vision applications such as signal coding, texture discrimination, edge detection, matching algorithms and fractal analysis

Channelization for Multi-Standard Software-Defined Radio Base Stations

As the number of radio standards increase and spectrum resources come under more pressure, it becomes ever less efficient to reserve bands of spectrum for exclusive use by a single radio standard. Therefore, this work focuses on channelization structures compatible with spectrum sharing among multiple wireless standards and dynamic spectrum allocation in particular. A channelizer extracts independent communication channels from a wideband signal, and is one of the most computationally expensive components in a communications receiver. This work specifically focuses on non-uniform channelizers suitable for multi-standard Software-Defined Radio (SDR) base stations in general and public mobile radio base stations in particular. A comprehensive evaluation of non-uniform channelizers (existing and developed during the course of this work) shows that parallel and recombined variants of the Generalised Discrete Fourier Transform Modulated Filter Bank (GDFT-FB) represent the best trade-off between computational load and flexibility for dynamic spectrum allocation. Nevertheless, for base station applications (with many channels) very high filter orders may be required, making the channelizers difficult to physically implement. To mitigate this problem, multi-stage filtering techniques are applied to the GDFT-FB. It is shown that these multi-stage designs can significantly reduce the filter orders and number of operations required by the GDFT-FB. An alternative approach, applying frequency response masking techniques to the GDFT-FB prototype filter design, leads to even bigger reductions in the number of coefficients, but computational load is only reduced for oversampled configurations and then not as much as for the multi-stage designs. Both techniques render the implementation of GDFT-FB based non-uniform channelizers more practical. Finally, channelization solutions for some real-world spectrum sharing use cases are developed before some final physical implementation issues are considered

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

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

Univariate Potential Output Estimations for Hungary

Potential output figures are important ingredients of many macroeconomic models and are routinely applied by policy makers and global agencies. Despite its widespread use, estimation of potential output is at best uncertain and depends heavily on the model. The task of estimating potential output is an even more dubious exercise for countries experiencing huge structural changes, such as transition countries. In this paper we apply univariate methods to estimate and evaluate Hungarian potential output, paying special attention to structural breaks. In addition to statistical evaluation, we also assess the appropriateness of various methods by expertise judgement of the results, since we argue that mechanical adoption of univariate techniques might led to erroneous interpretation of the business cycle. As all methods have strengths and weaknesses, we derive a single measure of potential output by weighting those methods that pass both the statistical and expertise criteria. As standard errors, which might be used for deriving weights, are not available for some of the methods, we base our weights on similar but computable statistics, namely on revisions of the output gap for all dates by recursively estimating the models. Finally, we compare our estimated gaps with the result of the only published Hungarian output gap measure of Darvas-Simon (2000b), which is based on an economic model.combination, detrending, output gap, revision.

Univariate Potential Output Estimations for Hungary

Potential output figures are important ingredients of many macroeconomic modelsand are routinely applied by policy makers and global agencies. Despite itswidespread use, estimation of potential output is at best uncertain and dependsheavily on the model. The task of estimating potential output is an even moredubious exercise for countries experiencing huge structural changes, such astransition countries. In this paper we apply univariate methods to estimate andevaluate Hungarian potential output, paying special attention to structural breaks.In addition to statistical evaluation, we also assess the appropriateness of variousmethods by expertise judgement of the results, since we argue that mechanicaladoption of univariate techniques might led to erroneous interpretation of thebusiness cycle. As all methods have strengths and weaknesses, we derive a singlemeasure of potential output by weighting those methods that pass both thestatistical and expertise criteria. As standard errors, which might be used forderiving weights, are not available for some of the methods, we base our weightson similar but computable statistics, namely on revisions of the output gap for alldates by recursively estimating the models. Finally, we compare our estimated gapswith the result of the only published Hungarian output gap measure of Darvas-Simon (2000b), which is based on an economic model.ombination, detrending, new EU members, OCA, output gap, revision