Recursive fast algorithm and the role of the tensor product

DOI10.1109/78.175736zbMath0771.65098OpenAlexW2021267552MaRDI QIDQ4034240

John Granata, Michael Conner, Richard Tolimieri

Publication date: 16 May 1993

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/78.175736

zbMATH Keywords

tensor productsdiscrete Fourier transformKronecker productfactorization of matricesdiscrete cosine transformdiscrete Hartley transformWalsh-Hadamard transformlinear convolutionStrassen matrix multiplicationrecursive fast algorithmsSIMD multiprocessor

Mathematics Subject Classification ID

Factorization of matrices (15A23) Numerical methods for discrete and fast Fourier transforms (65T50) Parallel numerical computation (65Y05)

Related Items (5)

PROCESSOR-TIME-OPTIMAL SYSTOLIC ARRAYS ⋮ Scalable FFT processors and pipelined butterfly units ⋮ Stride permutation networks for array processors ⋮ Optimal systolic array algorithms for tensor product ⋮ The ubiquitous Kronecker product

This page was built for publication: Recursive fast algorithm and the role of the tensor product