The trade-off between the additive complexity and the asynchronicity of linear and bilinear algorithms

1986/01/01 by Victor Y. Pan, Victor Ya. Pan · 2 citations
Computer Science · Mathematics · #Digital Filter Design and Implementation #Numerical Methods and Algorithms #Tensor decomposition and applications

paper · doi:10.1016/0020-0190(86)90035-9

crossref issued 1986/01/01 · crossref published 1986/01/01 · crossref published-print 1986/01/01 · openalex publication_date 1986/01/01 · crossref created 2003/03/14 · crossref deposited 2019/03/26 · openalex created_date 2025/10/10 · crossref indexed 2026/04/28 · openalex updated_date 2026/07/23

Citations

• Note on a Lower Bound on the Linear Complexity of the Fast Fourier Transform
• On the multiplicative complexity of the Discrete Fourier Transform

Cited by

• A Modified Split-Radix FFT With Fewer Arithmetic Operations
• Fast Fourier transform [wikipedia]