Please note: In order to keep Hive up to date and provide users with the best features, we are no longer able to fully support Internet Explorer. The site is still available to you, however some sections of the site may appear broken. We would encourage you to move to a more modern browser like Firefox, Edge or Chrome in order to experience the site fully.

Efficient Algorithms for Discrete Wavelet Transform : With Applications to Denoising and Fuzzy Inference Systems, PDF eBook

Efficient Algorithms for Discrete Wavelet Transform : With Applications to Denoising and Fuzzy Inference Systems PDF

Part of the SpringerBriefs in Computer Science series

PDF

Please note: eBooks can only be purchased with a UK issued credit card and all our eBooks (ePub and PDF) are DRM protected.

Description

Due to its inherent time-scale locality characteristics, the discrete wavelet transform (DWT) has received considerable attention in signal/image processing.

Wavelet transforms have excellent energy compaction characteristics and can provide perfect reconstruction.

The shifting (translation) and scaling (dilation) are unique to wavelets. Orthogonality of wavelets with respect to dilations leads to multigrid representation.

As the computation of DWT involves filtering, an efficient filtering process is essential in DWT hardware implementation.

In the multistage DWT, coefficients are calculated recursively, and in addition to the wavelet decomposition stage, extra space is required to store the intermediate coefficients.

Hence, the overall performance depends significantly on the precision of the intermediate DWT coefficients.

This work presents new implementation techniques of DWT, that are efficient in terms of computation, storage, and with better signal-to-noise ratio in the reconstructed signal.

Information

Other Formats

Information

Also in the SpringerBriefs in Computer Science series  |  View all