Documentation
¶
Overview ¶
Package fft provides a radix-2 Cooley-Tukey FFT implementation for cross-correlation in the subsync package.
Index ¶
Constants ¶
This section is empty.
Variables ¶
View Source
var WorkspacePool = sync.Pool{ New: func() any { return &Workspace{} }, }
WorkspacePool reuses allocated complex128 slices across correlations to reduce GC pressure from large FFT buffers.
Functions ¶
func FFT ¶
func FFT(x []complex128) []complex128
FFT computes the discrete Fourier transform in-place using the iterative Cooley-Tukey radix-2 decimation-in-time algorithm. Input length must be a power of 2. Variable names follow standard DSP convention.
func IFFT ¶
func IFFT(x []complex128) []complex128
IFFT computes the inverse discrete Fourier transform by conjugating, applying the forward FFT, then conjugating and scaling.
Types ¶
Source Files
Click to show internal directories.
Click to hide internal directories.