Fast algorithms for the 2-D discrete W transform.

DOI10.1016/S0165-1684(98)00217-5MaRDI QIDQ1292517zbMATH OpenOpenAlexFDO

Authors Guoan Bi

Publication date 21 June 1999

Published in Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0165-1684(98)00217-5

zbMATH Keywords

Discrete Fourier transformDiscrete W transformGeneralized Hartley transform

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Recommendations

• On computation of the discrete W transform
• scientific article; zbMATH DE number 1372536
• Fast W transform. Algorithms and programs
• scientific article; zbMATH DE number 465374
• Odd-factor algorithms for multidimensional discrete \(W\) transform

Cited in

(10)

• Odd-factor algorithms for multidimensional discrete \(W\) transform
• Fast W transform. Algorithms and programs
• Fast unified computation of the multi-dimensional discrete sinusoidal transforms
• Generalized orthogonal discrete W transform and its fast algorithm
• On computation of the discrete W transform
• Theory and algorithms for two-dimensional warped discrete Fourier transform
• scientific article; zbMATH DE number 465374 (Why is no real title available?)
• scientific article; zbMATH DE number 1372536 (Why is no real title available?)
• A block splitting technique for fast 2D Walsh transform
• Radix-2 algorithm for the fast computation of type-III 3-D discrete W transform

This page was built for publication: Fast algorithms for the 2-D discrete W transform.

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