Abstract:

By decomposing the Flipping Structure (FS) into even phase and odd phase, this paper proposes an onthefly implementation of DWT called Decomposed Flipping Structure (DFS), which is characterized by lowmemory budget, lowcomputational complexity and balanced workload. For the CDF 9/7 wavelet filterbank popular in waveletbased image/video coding schemes, the DFS has the same computational complexity as the FS, while the memory requirement reduces from six memory cells to five ones. The experimental results show that the proposed implementation has a speedup of about 44% and 14%, respectively, compared with the traditional lifting scheme and onthefly LS.

Key words: discrete wavelet transform;flipping structure;low memory;reduced complexity