DSP_fft32x32s
[Fast Fourier Transform]

Collaboration diagram for DSP_fft32x32s:

---

Detailed Description

void	DSP_fft32x32s (const int *restrict ptr_w, int npoints, int *restrict ptr_x, int *restrict ptr_y)

---

Function Documentation

void DSP_fft32x32s	(	const int *restrict	ptr_w,
		int	npoints,
		int *restrict	ptr_x,
		int *restrict	ptr_y
	)

This routine computes an extended precision complex forward mixed radix FFT with scaling, rounding and digit reversal. Input data x[ ], output data y[ ], and coefficients w[ ] are 32-bit. The output is returned in the separate array y[ ] in normal order. Each complex value is stored with interleaved real and imaginary parts.

Parameters:

	ptr_w	= input twiddle factors
	npoints	= number of points
	ptr_x	= transformed data reversed
	ptr_y	= linear transformed data

Algorithm:

DSP_fft32x32s_cn.c is the natural C equivalent of the optimized intrinsic C code without restrictions. Note that the intrinsic C code is optimized and restrictions may apply.

Assumptions:

In-place computation is not allowed.
Size of FFT, nx, must be power of 2 and 16<=nx<=65536.
The arrays for the complex input data x[], complex output data y[] and twiddle factor w[] must be double word aligned.
The input and output data are complex, with the real/imaginary components stored in adjacent locations in the array. The real components are stored at even array indices, and the imaginary components are stored at odd array indices.

Implementation Notes:

Scaling is performed at each stage by shifting the results right by 1, preventing overflow.

Endian Support: The code supports both big and little endian modes.
Interruptibility: The code is interruptible.

---

Copyright 2014, Texas Instruments Incorporated