Regular mixed-radix DFT matrix factorization for in-place FFT accelerators
Sergey Salishev

TL;DR
This paper introduces a regular mixed-radix DFT matrix factorization method tailored for in-place FFT accelerators, enhancing understanding of architecture needs and simplifying algorithm development and correctness verification.
Contribution
It proposes a novel mixed-radix factorization aligned with vector memory based FFT architectures, aiding in design and correctness proof.
Findings
Improved understanding of architecture requirements
Simplified development of conflict-free addressing schemes
Facilitated correctness proofs for FFT algorithms
Abstract
The generic vector memory based accelerator is considered which supports DIT and DIF FFT with fixed datapath. The regular mixed-radix factorization of the DFT matrix coherent with the accelerator architecture is proposed and the correction proof is presented. It allows better understanding of architecture requirements and simplifies the developing and proving correctness of more complicated algorithms and conflict-free addressing schemes.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDigital Filter Design and Implementation · Cryptography and Residue Arithmetic · Numerical Methods and Algorithms
