Now showing items 1-14 of 14

  • The Dual-Tree Complex Wavelet Transform 

    Selesnick, Ivan W.; Baraniuk, Richard G.; Kingsbury, Nicholas G. (2005-11-01)
    The paper discusses the theory behind the dual-tree transform, shows how complex wavelets with good properties can be designed, and illustrates a range of applications in signal and image processing. The authors use the ...
  • Complex Wavelet Transforms with Allpass Filters 

    Fernandes, Felix; Selesnick, Ivan W.; van Spaendonck, Rutger; Burrus, C. Sidney (2003-08-20)
    Complex discrete wavelet transforms have significant advantages over real wavelet transforms for certain signal processing problems. Two approaches to the implementation of complex wavelet transforms have been proposed ...
  • Exchange Algorithms that Complement the Parks-McClellan Algorithm for Linear Phase FIR Filter Design 

    Selesnick, Ivan W.; Burrus, C. Sidney (1997-02-01)
    This paper describes an exchange algorithm for the frequency domain design of linear phase FIR equiripple filters where the Chebyshev error in each band is specified. The algorithm is a hybrid of the algorithm of Hofstetter, ...
  • Nonlinear-Phase Maximally-Flat FIR Filter Deisgn 

    Selesnick, Ivan W.; Burrus, C. Sidney (1996-09-20)
    This paper reports a new analytic technique for the design of nonlinear-phase maximally-flat lowpass FIR filters. By subjecting the response magnitude and the group delay (individually) to differing numbers of flatness ...
  • Generalized Digital Butterworth Filter Design 

    Selesnick, Ivan W.; Burrus, C. Sidney (1996-01-15)
    This paper presents a formula-based method for the design of IIR filters having more zeros than (nontrivial) poles. The filters are designed so that their square magnitude frequency responses are maximally-flat at <i>m</i> ...
  • Constrained Least Square Design of FIR Filters Without Specified Transition Bands 

    Selesnick, Ivan W.; Lang, Markus; Burrus, C. Sidney (1996-01-15)
    We consider the design of digital filters and discuss the inclusion of explicitly specified transition bands in the frequency domain design of FIR filters. We put forth the notion that explicitly specified transition bands ...
  • Automatic Generation of Prime Length FFT Programs 

    Selesnick, Ivan W.; Burrus, C. Sidney (1996-01-01)
    We describe a set of programs for circular convolution and prime length FFTs that are short, possess great structure, share many computational procedures, and cover a large variety of lengths. The programs make clear the ...
  • Constrained Least Square Design of FIR Filters Without Specified Transition Bands 

    Selesnick, Ivan W.; Lang, Markus; Burrus, C. Sidney (1995-01-15)
    We consider the design of digital filters and discuss the inclusion of explicitly specified transition bands in the frequency domain design of FIR filters. We put forth the notion that explicitly specified transition bands ...
  • Generalized Digital Butterworth Filter Design 

    Selesnick, Ivan W.; Burrus, C. Sidney (1995-01-15)
    This paper presents a formula-based method for the design of IIR filters having more zeros than (nontrivial) poles. The filters are designed so that their square magnitude frequency responses are maximally-flat at <i>m</i> ...
  • Wavelet Based Speckle Reduction with Applications to SAR based ATD/R 

    Guo, Haitao; Odegard, Jan E.; Lang, Markus; Gopinath, Ramesh A.; Selesnick, Ivan W.; Burrus, C. Sidney (1994-11-20)
    This paper introduces a novel speckle reduction method based on thresholding the wavelet coefficients of the logarithmically transformed image. The method is computational efficient and can sinificantly reduce the speckle ...
  • Constrained FIR Filter Design for 2-band Filter Banks and Orthonormal Wavelets 

    Markus, Lang; Selesnick, Ivan W.; Odegard, Jan E.; Burrus, C. Sidney (1994-10-20)
    2-band paraunitary FIR filter banks can be used to generate a multiresolution analysis with compactly supported orthonormal (ON) wavelets. The filter design problem is formulated and solved (a) as a constrained L<sub>Â â ...
  • Magnitude Squared Design of Recursive Filters with the Chebyshev Norm Using a Constrained Rational Remez Algorithm 

    Selesnick, Ivan W.; Lang, Markus; Burrus, C. Sidney (1994-10-01)
    We describe a Remez type exchange algorithm for the design of stable recursive filters for which the Chebyschev norm of H(w) - F(w) is minimized, where H(w) and F(w) are the realized and desired magnitude squared frequency ...
  • Magnitude Squared Design of Recursive Filters with the Chebyshev Norm Using a Constrained Rational Remez Algorithm 

    Selesnick, Ivan W.; Lang, Markus; Burrus, C. Sidney (1994-05-01)
    We describe a Remez type exchange algorithm for the design of stable recursive filters for which the Chebyschev norm of H(w) - F(w) is minimized, where H(w) and F(w) are the realized and desired magnitude squared frequency ...
  • Extending Winograd's Small Convolution Algorithm to Longer Lengths 

    Selesnick, Ivan W.; Burrus, C. Sidney (1994-01-15)
    For short data sequences, Winograd's convolution algorithms attaining the minimum number of multiplications also attain a low number of additions, making them very efficient. However, for longer lengths they require a ...