DSPF_dp_fftDPXDP
[Fast Fourier Transform]

Collaboration diagram for DSPF_dp_fftDPXDP:

---

Detailed Description

void	DSPF_dp_fftDPxDP (int N, double *ptr_x, double *ptr_w, double *ptr_y, int n_min, int offset, int n_max)

---

Function Documentation

void DSPF_dp_fftDPxDP	(	int	N,
		double *	ptr_x,
		double *	ptr_w,
		double *	ptr_y,
		int	n_min,
		int	offset,
		int	n_max
	)

The benchmark performs a mixed radix forwards fft.

Parameters:

	N	length of FFT in complex samples
	ptr_x	pointer to complex data input
	ptr_w	pointer to complex twiddle factor
	ptr_y	pointer to complex output data
	n_min	should be 4 if N can be represented as Power of 4 else, n_min should be 2
	offset	index in complex samples of sub-fft from start of main fft
	n_max	size of main fft in complex samples

Algorithm:

DSPF_dp_fftDPxDP.c is the natural C equivalent of the optimized linear assembly code without restrictions. Note that the linear assembly code is optimized and restrictions may apply.

Assumptions:

N needs to be power of 2
8 <= N <= 131072
Arrays pointed by ptr_x, ptr_w, and ptr_y should not overlap
Arrays pointed by ptr_x, ptr_w, and ptr_y should align on the double words boundary

Implementation Notes:

Interruptibility: The code is interrupt-tolerant but not interruptible.
Endian Support: The code supports both big and little endian modes.

---

Copyright 2014, Texas Instruments Incorporated