Recursive fast algorithm and the role of the tensor product
From MaRDI portal
Publication:4034240
DOI10.1109/78.175736zbMath0771.65098MaRDI QIDQ4034240
Michael Conner, Richard Tolimieri, John Granata
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
tensor products; discrete Fourier transform; Kronecker product; factorization of matrices; discrete cosine transform; discrete Hartley transform; Walsh-Hadamard transform; linear convolution; Strassen matrix multiplication; recursive fast algorithms; SIMD multiprocessor
15A23: Factorization of matrices
65T50: Numerical methods for discrete and fast Fourier transforms
65Y05: Parallel numerical computation
Related Items
PROCESSOR-TIME-OPTIMAL SYSTOLIC ARRAYS, The ubiquitous Kronecker product, Scalable FFT processors and pipelined butterfly units, Stride permutation networks for array processors, Optimal systolic array algorithms for tensor product