Notification:
We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

A prime factor fast W transform algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Wang, Z. ; Dept. of Electr. Eng., Beijing Univ. of Posts & Telecommun., China

A method for converting any nesting DFT algorithm to the type-I discrete W transform (DWT-I) is introduced. A nesting algorithm that differs from either the Windograd Fourier transform algorithm (WFTA) or the prime factor FFT algorithm (PFA) is presented. New small- N DETs, which are suitable for this nesting algorithm, are developed based on using sparse matrix decomposition. The proposed algorithm is more efficient that either WFTA or PFA for large N, and it is more flexible for the choice of transform length, because 32 points are used. For 2D processing, the proposed algorithm is more efficient than the polynomial transform

Published in:

Signal Processing, IEEE Transactions on  (Volume:40 ,  Issue: 9 )