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.
Origin : Files produced by the author(s)