Improved algorithm about NSFOT

DOI10.1016/j.amc.2009.03.042zbMath1175.65156OpenAlexW1966117473MaRDI QIDQ734837

Zhimeng Luo, Li Mo, Chaoshun Li, Xiu-Qiao Xiang, Jian-Zhong Zhou

Publication date: 14 October 2009

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2009.03.042

zbMATH Keywords

numerical examplesfast algorithmdistributed computingWalsh transformHaar transformno sinusoidal family orthogonal transforms

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50)

Related Items (2)

Evolving generation and fast algorithms of slantlet transform and slantlet-Walsh transform ⋮ NSFOT

Cites Work

• Unnamed Item
• Direct Walsh-wavelet packet method for variational problems
• Image restoration by cosine transform-based iterative regularization
• Kronecker operational matrices for fractional calculus and some applications
• Generalized parametric slant-Hadamard transform
• A block splitting technique for fast 2D Walsh transform
• Modelling Hadamard Haar transform algorithm for Omega connected multiprocessors
• Sparse orthogonal matrices and the Haar wavelet
• Two new algorithms based on product system for discrete cosine transform

This page was built for publication: Improved algorithm about NSFOT