Module

Data.Complex.FFT

Package: purescript-fft
Repository: Ebmtranceboy/purescript-fft

#nth Source

nth :: forall a. Array a -> Int -> a

#(!!) Source

Operator alias for Data.Complex.FFT.nth (left-associative / precedence 6)

#Complex Source

type Complex = Cartesian Number

#Index Source

type Index = Int

#PowerOfTwo Source

type PowerOfTwo = Int

#ExponentOfTwo Source

type ExponentOfTwo = Int

#initialSort Source

initialSort :: ExponentOfTwo -> Index -> Index

#Direction Source

data Direction

Constructors

Forward
Backward

#trigTable Source

trigTable :: forall h. PowerOfTwo -> STArray h Complex -> ST h Unit

#unsafePeek Source

unsafePeek :: forall a. Int -> STArray a Complex -> ST a Complex

#process Source

process :: forall h. Direction -> ExponentOfTwo -> Array Complex -> STArray h Complex -> ST h Unit

#fft Source

fft :: Direction -> Array Complex -> Array Complex

U_i = fft Forward ((u_n)) sr : sample rate Te : sampling period => Te = 1 / sr N : number of sample fe : frequency precision => fe = sr / (N - 1) T : signal duration u_n : sample at time t = n Te u_{N-1} : last sample at time t = T => T = (N-1) Te = 1 / fe U_i : bin at frequency f = i fe => i < (n-1) / 2 U_{N/2-1} : last useful bin at frequency f = sr/2

#ZipList Source

newtype ZipList a

Constructors

ZipList (Array a)

Instances

#transpose Source

transpose :: forall a. Array (Array a) -> Array (Array a)

#fft2 Source

fft2 :: Direction -> Array (Array Complex) -> Array (Array Complex)

#Freq Source

type Freq = Int

#Bin Source

type Bin = { freq :: Freq, im :: Number, mag :: Number, phase :: Number, re :: Number }

#bin Source

bin :: Freq -> Complex -> Bin

#sortByMagnitude Source

sortByMagnitude :: Array Complex -> Array Bin

Modules: Data.Complex.FFT