<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd"> <!--Rendered using the Haskell Html Library v0.2--> <HTML ><HEAD ><META HTTP-EQUIV="Content-Type" CONTENT="text/html; charset=UTF-8" ><TITLE >ForSyDe.DFT</TITLE ><LINK HREF="haddock.css" REL="stylesheet" TYPE="text/css" ><SCRIPT SRC="haddock-util.js" TYPE="text/javascript" ></SCRIPT ><SCRIPT TYPE="text/javascript" >window.onload = function () {setSynopsis("mini_ForSyDe-DFT.html")};</SCRIPT ></HEAD ><BODY ><TABLE CLASS="vanilla" CELLSPACING="0" CELLPADDING="0" ><TR ><TD CLASS="topbar" ><TABLE CLASS="vanilla" CELLSPACING="0" CELLPADDING="0" ><TR ><TD ><IMG SRC="haskell_icon.gif" WIDTH="16" HEIGHT="16" ALT=" " ></TD ><TD CLASS="title" >ForSyDe-3.1.1: ForSyDe's Haskell-embedded Domain Specific Language.</TD ><TD CLASS="topbut" ><A HREF="src/ForSyDe-DFT.html" >Source code</A ></TD ><TD CLASS="topbut" ><A HREF="index.html" >Contents</A ></TD ><TD CLASS="topbut" ><A HREF="doc-index.html" >Index</A ></TD ></TR ></TABLE ></TD ></TR ><TR ><TD CLASS="modulebar" ><TABLE CLASS="vanilla" CELLSPACING="0" CELLPADDING="0" ><TR ><TD ><FONT SIZE="6" >ForSyDe.DFT</FONT ></TD ><TD ALIGN="right" ><TABLE CLASS="narrow" CELLSPACING="0" CELLPADDING="0" ><TR ><TD CLASS="infohead" >Portability</TD ><TD CLASS="infoval" >portable</TD ></TR ><TR ><TD CLASS="infohead" >Stability</TD ><TD CLASS="infoval" >experimental</TD ></TR ><TR ><TD CLASS="infohead" >Maintainer</TD ><TD CLASS="infoval" >forsyde-dev@ict.kth.se</TD ></TR ></TABLE ></TD ></TR ></TABLE ></TD ></TR ><TR ><TD CLASS="s15" ></TD ></TR ><TR ><TD CLASS="section1" >Description</TD ></TR ><TR ><TD CLASS="doc" >This module includes the standard Discrete Fourier Transform (DFT) function, and a fast Fourier transform (FFT) algorithm, for computing the DFT, when the input vectors' length is a power of 2. </TD ></TR ><TR ><TD CLASS="s15" ></TD ></TR ><TR ><TD CLASS="section1" >Synopsis</TD ></TR ><TR ><TD CLASS="s15" ></TD ></TR ><TR ><TD CLASS="body" ><TABLE CLASS="vanilla" CELLSPACING="0" CELLPADDING="0" ><TR ><TD CLASS="decl" ><A HREF="#v%3Adft" >dft</A > :: <SPAN CLASS="keyword" >forall</SPAN > s. <A HREF="/usr/share/doc/ghc/html/libraries/type-level-0.2.4/Data-TypeLevel-Num-Sets.html#t%3ANat" >Nat</A > s => <A HREF="/usr/share/doc/ghc/html/libraries/parameterized-data-0.1.5/Data-Param-FSVec.html#t%3AFSVec" >FSVec</A > s (<A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Complex.html#t%3AComplex" >Complex</A > <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Prelude.html#t%3ADouble" >Double</A >) -> <A HREF="/usr/share/doc/ghc/html/libraries/parameterized-data-0.1.5/Data-Param-FSVec.html#t%3AFSVec" >FSVec</A > s (<A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Complex.html#t%3AComplex" >Complex</A > <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Prelude.html#t%3ADouble" >Double</A >)</TD ></TR ><TR ><TD CLASS="s8" ></TD ></TR ><TR ><TD CLASS="decl" ><A HREF="#v%3Afft" >fft</A > :: (<A HREF="/usr/share/doc/ghc/html/libraries/type-level-0.2.4/Data-TypeLevel-Num-Sets.html#t%3ANat" >Nat</A > s, <A HREF="/usr/share/doc/ghc/html/libraries/type-level-0.2.4/Data-TypeLevel-Num-Ops.html#t%3AIsPowOf" >IsPowOf</A > <A HREF="/usr/share/doc/ghc/html/libraries/type-level-0.2.4/Data-TypeLevel-Num-Reps.html#t%3AD2" >D2</A > s) => <A HREF="/usr/share/doc/ghc/html/libraries/parameterized-data-0.1.5/Data-Param-FSVec.html#t%3AFSVec" >FSVec</A > s (<A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Complex.html#t%3AComplex" >Complex</A > <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Prelude.html#t%3ADouble" >Double</A >) -> <A HREF="/usr/share/doc/ghc/html/libraries/parameterized-data-0.1.5/Data-Param-FSVec.html#t%3AFSVec" >FSVec</A > s (<A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Complex.html#t%3AComplex" >Complex</A > <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Prelude.html#t%3ADouble" >Double</A >)</TD ></TR ></TABLE ></TD ></TR ><TR ><TD CLASS="s15" ></TD ></TR ><TR ><TD CLASS="section1" >Documentation</TD ></TR ><TR ><TD CLASS="s15" ></TD ></TR ><TR ><TD CLASS="topdecl" ><TABLE CLASS="declbar" ><TR ><TD CLASS="declname" ><A NAME="v:dft" ><A NAME="v%3Adft" ></A ></A ><B >dft</B > :: <SPAN CLASS="keyword" >forall</SPAN > s. <A HREF="/usr/share/doc/ghc/html/libraries/type-level-0.2.4/Data-TypeLevel-Num-Sets.html#t%3ANat" >Nat</A > s => <A HREF="/usr/share/doc/ghc/html/libraries/parameterized-data-0.1.5/Data-Param-FSVec.html#t%3AFSVec" >FSVec</A > s (<A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Complex.html#t%3AComplex" >Complex</A > <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Prelude.html#t%3ADouble" >Double</A >) -> <A HREF="/usr/share/doc/ghc/html/libraries/parameterized-data-0.1.5/Data-Param-FSVec.html#t%3AFSVec" >FSVec</A > s (<A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Complex.html#t%3AComplex" >Complex</A > <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Prelude.html#t%3ADouble" >Double</A >)</TD ><TD CLASS="declbut" ><A HREF="src/ForSyDe-DFT.html#dft" >Source</A ></TD ></TR ></TABLE ></TD ></TR ><TR ><TD CLASS="doc" >The function <TT ><A HREF="ForSyDe-DFT.html#v%3Adft" >dft</A ></TT > performs a standard Discrete Fourier Transformation </TD ></TR ><TR ><TD CLASS="s15" ></TD ></TR ><TR ><TD CLASS="topdecl" ><TABLE CLASS="declbar" ><TR ><TD CLASS="declname" ><A NAME="v:fft" ><A NAME="v%3Afft" ></A ></A ><B >fft</B > :: (<A HREF="/usr/share/doc/ghc/html/libraries/type-level-0.2.4/Data-TypeLevel-Num-Sets.html#t%3ANat" >Nat</A > s, <A HREF="/usr/share/doc/ghc/html/libraries/type-level-0.2.4/Data-TypeLevel-Num-Ops.html#t%3AIsPowOf" >IsPowOf</A > <A HREF="/usr/share/doc/ghc/html/libraries/type-level-0.2.4/Data-TypeLevel-Num-Reps.html#t%3AD2" >D2</A > s) => <A HREF="/usr/share/doc/ghc/html/libraries/parameterized-data-0.1.5/Data-Param-FSVec.html#t%3AFSVec" >FSVec</A > s (<A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Complex.html#t%3AComplex" >Complex</A > <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Prelude.html#t%3ADouble" >Double</A >) -> <A HREF="/usr/share/doc/ghc/html/libraries/parameterized-data-0.1.5/Data-Param-FSVec.html#t%3AFSVec" >FSVec</A > s (<A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Complex.html#t%3AComplex" >Complex</A > <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Prelude.html#t%3ADouble" >Double</A >)</TD ><TD CLASS="declbut" ><A HREF="src/ForSyDe-DFT.html#fft" >Source</A ></TD ></TR ></TABLE ></TD ></TR ><TR ><TD CLASS="doc" >The function <TT ><A HREF="ForSyDe-DFT.html#v%3Afft" >fft</A ></TT > implements a fast Fourier transform (FFT) algorithm, for computing the DFT, when the size N is a power of 2. </TD ></TR ><TR ><TD CLASS="s15" ></TD ></TR ><TR ><TD CLASS="botbar" >Produced by <A HREF="http://www.haskell.org/haddock/" >Haddock</A > version 2.6.1</TD ></TR ></TABLE ></BODY ></HTML >