The recursive pyramid algorithm for the discrete wavelet transform

Authors:
M. Vishwanath
Affiliations:
Dept. of Comput. Sci., Pennsylvania State Univ., University Park, PA
Venue:
IEEE Transactions on Signal Processing
Year:
1994

Citing 0
Cited 5

A high-throughput, memory efficient architecture for computing the tile-based 2D discrete wavelet transform for the JPEG2000

Integration, the VLSI Journal
A unified framework for low-memory and on-the-fly implementation of generic tree-structured M-channel QMF banks

Signal Processing
An efficient architecture for lifting-based two-dimensional discrete wavelet transforms

Integration, the VLSI Journal - Special issue: ACM great lakes symposium on VLSI
Performance evaluation of the fractional wavelet filter: A low-memory image wavelet transform for multimedia sensor networks

Ad Hoc Networks
Arabic vowels recognition based on wavelet average framing linear prediction coding and neural network

Speech Communication

Quantified Score

Hi-index	35.68

Visualization

Abstract

The recursive pyramid algorithm (RPA) is a reformulation of the classical pyramid algorithm (PA) for computing the discrete wavelet transform (DWT). The RPA computes the N-point DWT in real time (running DWT) using just L(log N-1) words of storage, as compared with O(N) words required by the PA. L is the length of the wavelet filter. The RPA is combined with the short-length FIR filter algorithms to reduce the number of multiplications and additions