DSPF_sp_bitrev_cplx
[Fast Fourier Transform]

Collaboration diagram for DSPF_sp_bitrev_cplx:

---

Detailed Description

void	DSPF_sp_bitrev_cplx (double *restrict x, short *restrict index, int nx)

---

Function Documentation

void DSPF_sp_bitrev_cplx	(	double *restrict	x,
		short *restrict	index,
		int	nx
	)

This routine performs the bit-reversal of the input array x[], where x[] is a float array of length 2*nx containing single-precision floating-point complex pairs of data. This routine requires the index array provided by the program below. This index should be generated at compile time, not by the DSP. TI retains all rights, title and interest in this code and only authorizes the use of the bit-reversal code and related table generation code with TMS320 family DSPs manufactured by TI.

Parameters:

	x	Complex input array to be bit reversed. Contains 2*nx floats
	index	Array of size ~sqrt(nx) created by the routine bitrev_index to allow the fast implementation of the bit reversal
	nx	Number of elements in array x[]

Algorithm:

DSPF_sp_bitrev_cplx_cn.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:

nx must be a power of 2.
The table from bitrev_index is already created.
The array x is actually an array of 2*nx floats.
Array x is assumed to be double word aligned.

Implementation Notes:

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

---

Copyright 2014, Texas Instruments Incorporated