Multiplierless lifting-based fast X transforms derived from fast Hartley transform factorization
From MaRDI portal
Publication:784516
DOI10.1007/s11045-016-0457-5zbMath1450.94023OpenAlexW2523354626MaRDI QIDQ784516
Masaaki Ikehara, Taizo Suzuki, Seisuke Kyochi, Yu-ichi Tanaka
Publication date: 3 August 2020
Published in: Multidimensional Systems and Signal Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11045-016-0457-5
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Numerical methods for discrete and fast Fourier transforms (65T50)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Factoring wavelet transforms into lifting steps
- A new algorithm to compute the discrete cosine Transform
- Fast algorithms for the discrete W transform and for the discrete Fourier transform
- On computing the discrete Fourier and cosine transforms
- A Fast Computational Algorithm for the Discrete Cosine Transform
- Embedded image coding using zerotrees of wavelet coefficients
- An Algorithm for the Machine Calculation of Complex Fourier Series
- Integer fast Fourier transform
- Lapped transform via time-domain pre- and post-filtering
- Directional Lapped Transforms for Image Coding
This page was built for publication: Multiplierless lifting-based fast X transforms derived from fast Hartley transform factorization