Block wavelet transforms for image coding

Cataloged from PDF version of article.In this paper, a new class of block transforms is presented. These transforms are constructed from subband decomposition filter banks corresponding to regular wavelets. New transforms are compared to the discrete cosine transform (DCT). Image coding schemes that employ the block wavelet transform (BWT) are developed. BWT's can be implemented by fast (O(N log N)) algorithms

Design of doubly-complementary IIR digital filters using a single complex allpass filter, with multirate applications

It is shown that a large class of real-coefficient doubly-complementary IIR transfer function pairs can be implemented by means of a single complex allpass filter. For a real input sequence, the real part of the output sequence corresponds to the output of one of the transfer functions G(z) (for example, lowpass), whereas the imaginary part of the output sequence corresponds to its "complementary" filter H(z)(for example, highpass). The resulting implementation is structurally lossless, and hence the implementations of G(z) and H(z) have very low passband sensitivity. Numerical design examples are included, and a typical numerical example shows that the new implementation with 4 bits per multiplier is considerably better than a direct form implementation with 9 bits per multiplier. Multirate filter bank applications (quadrature mirror filtering) are outlined

Tree-structured complementary filter banks using all-pass sections

Tree-structured complementary filter banks are developed with transfer functions that are simultaneously all-pass complementary and power complementary. Using a formulation based on unitary transforms and all-pass functions, we obtain analysis and synthesis filter banks which are related through a transposition operation, such that the cascade of analysis and synthesis filter banks achieves an all-pass function. The simplest structure is obtained using a Hadamard transform, which is shown to correspond to a binary tree structure. Tree structures can be generated for a variety of other unitary transforms as well. In addition, given a tree-structured filter bank where the number of bands is a power of two, simple methods are developed to generate complementary filter banks with an arbitrary number of channels, which retain the transpose relationship between analysis and synthesis banks, and allow for any combination of bandwidths. The structural properties of the filter banks are illustrated with design examples, and multirate applications are outlined

Dsign of I-D Recursive Digital Filters With Linear Phase Using Two All-Pass Filters With/Without Integer Coefficients

Digital signal processing is becoming increasingly important, and is finding applications in speech processing and telecommunications in the area of 1-D signal processing. One of the important branches 1n digital signal processing 1s digital filtering. Among the numbers of structure of digital filters, the recursive(IIR) filter is known for its computational efficiency compared to the FIR counterparts. In this thesis, an alternative approach to the direct design of 1-D recursive digital filters satisfying prescribed magnitude specifications with or without constant group delay characteristic using two all-pass filters is presented. It is known that, by this approach, the most computationally efficient realization can be obtained among IIR filters for meeting the filter specifications. The method uses unconstrained optimization techniques for the filter design to approximate both the group delay and the magnitude response of the desired filter simultaneously if the constant group delay characteristic is required. Two different approaches are chosen for the stability of the filter. In the first approach, a new stability test is used to generate the stable polynomials. In the second approach, one-variable Hurwitz polynomials(HPs) using properties of positive definite matrices are generated. Bilinear transformations are applied to the HPs to obtain the stable polynomials in z domain. The polynomials generated using the approaches explained above are imposed on the filter\u27s denominator polynomials through the variable subs ti tut ion method, hence ensuring the stability .of the designed filter. The designed filters using this method are stable in nature and neither stability check nor stabilization procedure is required. To illustrate the usefulness of the technique, the results obtained are compared with a well known direct method design using a general 1-D IIR transfer function. Once the infinite precision filter is obtained, through a procedure based on discretization and reoptimization technique we discretize all coefficients to integer values. By this algorithm, the error caused by truncating the filter coefficients is minimized. Examples are given with comparisons in order to demonstrate the usefulness of the algorithm