A Formalisation of a Fast Fourier Transform - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Preprints, Working Papers, ... Year : 2022

A Formalisation of a Fast Fourier Transform

Abstract

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.
Fichier principal
Vignette du fichier
Note.pdf (111.34 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03807965 , version 1 (10-10-2022)
hal-03807965 , version 2 (11-10-2022)
hal-03807965 , version 3 (12-10-2022)
hal-03807965 , version 4 (13-10-2022)

Identifiers

Cite

Laurent Théry. A Formalisation of a Fast Fourier Transform. 2022. ⟨hal-03807965v4⟩
33 View
30 Download

Altmetric

Share

Gmail Facebook X LinkedIn More