Odd-factor algorithms for multidimensional discrete W transform

DOI10.1007/S00034-004-7038-9MaRDI QIDQ1429414zbMATH OpenOpenAlexFDO

Authors Guoan Bi, Yonghong Zeng, Zhiping Lin

Publication date 18 May 2004

Published in Circuits, Systems, and Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00034-004-7038-9

zbMATH Keywords

digital image processingdiscrete \(W\) transformfast algorithmsgeneralized discrete Hartley transform

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Recommendations

• Fast algorithms for the 2-D discrete W transform.
• On computation of the discrete W transform
• Fast W transform. Algorithms and programs
• Fast algorithms for the discrete W transform and for the discrete Fourier transform
• New algorithms for multidimensional discrete Hartley transform

Cited in

(5)

• Fast algorithms for the 2-D discrete W transform.
• Multidimensional polynomial transform algorithm for multidimensional discrete W transform
• scientific article; zbMATH DE number 1247162 (Why is no real title available?)
• On the odd-DFT and its applications to DCT/IDCT computation
• Radix-2 algorithm for the fast computation of type-III 3-D discrete W transform

This page was built for publication: Odd-factor algorithms for multidimensional discrete \(W\) transform

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1429414)