1 February 2004 Optimal wordlength calculation for forward and inverse discrete wavelet transform architectures
Abdsamad Benkrid, Khaled Benkrid, Danny Crookes
Author Affiliations +
Discrete wavelet transforms (DWTs) have become a very powerful tool in signal processing. The first point to be considered if implemented in hardware is what wordlength to use. We detail a mathematical approach that enables the determination of the exact dynamic range at any filter output of a J-stage 1-D and 2-D forward or inverse DWT for any arbitrary input signal. Once applied on the forward transform, our approach leads to wordlength bit savings compared to the work published in the literature. These savings are relevant when implementing the transform in hardware since they lead to considerable area savings and speed improvement. In addition, we provide the first investigation in determining the exact dynamic range of the inverse transform stages. Although our focus is on the DWTs, the approach can be applied on any finite impulse response (FIR)-filter-based architecture.
©(2004) Society of Photo-Optical Instrumentation Engineers (SPIE)
Abdsamad Benkrid, Khaled Benkrid, and Danny Crookes "Optimal wordlength calculation for forward and inverse discrete wavelet transform architectures," Optical Engineering 43(2), (1 February 2004). https://doi.org/10.1117/1.1637613
Published: 1 February 2004
Lens.org Logo
CITATIONS
Cited by 6 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Discrete wavelet transforms

Electronic filtering

Optical filters

Linear filtering

Convolution

S band

Optical engineering

RELATED CONTENT

Arithmetic gain of the lifting scheme
Proceedings of SPIE (December 05 2001)
Time localization techniques for wavelet transforms
Proceedings of SPIE (October 25 1994)

Back to Top