Generalized orthogonal discrete W transform and its fast algorithm
From MaRDI portal
Publication:2657434
DOI10.1155/2021/2529754zbMath1465.65164OpenAlexW3120872039MaRDI QIDQ2657434
Publication date: 12 March 2021
Published in: Discrete Dynamics in Nature and Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2021/2529754
Numerical methods for integral transforms (65R10) Fourier and Fourier-Stieltjes transforms and other transforms of Fourier type (42A38)
Cites Work
- Unnamed Item
- Memoryless block transceivers with minimum redundancy based on Hartley transforms
- The generalized unified computation of multidimensional discrete orthogonal transforms
- The discrete W transform
- On a set of matrix algebras related to discrete Hartley-type transforms
- Directional Hartley transform and content based image retrieval
- On computation of the discrete W transform
- Discrete fractional Hartley and Fourier transforms
- On the Hartley - Fourier sine generalized convolution
- Fast algorithms for the discrete W transform and for the discrete Fourier transform
- The Fast Hartley Transform Algorithm
- Generalized discrete Hartley transforms
- Fast Algorithms for the Computation of Sliding Discrete Hartley Transforms
- New Parametric Discrete Fourier and Hartley Transforms, and Algorithms for Fast Computation
- An Algorithm for the Machine Calculation of Complex Fourier Series
- A Generalization of the Fast Fourier Transform
This page was built for publication: Generalized orthogonal discrete W transform and its fast algorithm