AI Chat AI Image Generator AI Video Text to Speech

A Formalisation of a Fast Fourier Transform

10/11/2022
∙
by   Laurent Théry, et al.
∙
0
∙

This notes explains how a standard algorithm that constructs the discrete Fourier transform has been formalised and proved correct in the Coq proof assistant using the SSReflect extension.

READ FULL TEXT

page 1

page 2

page 3

page 4

Related Research

research
∙ 09/15/2018

The inverse cyclotomic Discrete Fourier Transform algorithm

The proof of the theorem concerning to the inverse cyclotomic Discrete F...
0 Sergei V. Fedorenko, et al. ∙
research
∙ 08/17/2019

Discrete and Fast Fourier Transform Made Clear

Fast Fourier transform was included in the Top 10 Algorithms of 20th Cen...
0 Peter Zeman, et al. ∙
research
∙ 02/15/2016

An Illustrated Introduction to the Truncated Fourier Transform

The Truncated Fourier Transform (TFT) is a variation of the Discrete Fou...
0 Paul Vrbik, et al. ∙
research
∙ 11/01/2017

Analyzing the Approximation Error of the Fast Graph Fourier Transform

The graph Fourier transform (GFT) is in general dense and requires O(n^2...
0 Luc LeMagoarou, et al. ∙
research
∙ 07/14/2022

FFTc: An MLIR Dialect for Developing HPC Fast Fourier Transform Libraries

Discrete Fourier Transform (DFT) libraries are one of the most critical ...
9 Yifei He, et al. ∙
research
∙ 07/25/2017

An Algorithm for the 2D Radix-2 Sliding Window Fourier Transform

We present a new algorithm for the 2D Radix-2 Sliding Window Fourier Tra...
0 Lee F. Richardson, et al. ∙
research
∙ 08/28/2020

Fast Partial Fourier Transform

Given a time series vector, how can we efficiently compute a specified p...
0 Yong-chan Park, et al. ∙

Please sign up or login with your details

Forgot password? Click here to reset

Out of credits

Refill your membership to continue using DeepAI

Stripe
Paypal