split radix fft without using cordic

[Deepak.akon]

can any one tell me how to implement split radix fft algorithm without using cordic processor.

why we used cordic processor in split radix fft algorithm implementation.can anyone post proper reasons

 

[achaleus]

Cordic processor is used to generate sine, cos or hyperbolic functions depending on how you design. Here we use cordic processor to generate twiddle factors for FFT. If your 'N' no' of samples are fixed, no need to go for CORDIC. Simply generate twiddle factor values and store it in a RAM block and call those values when ever you needed.
If your 'N' varies it is better to go for cordic which generates twiddle factor values at run time. The other way is using multiple RAM'S which stores twiddle factors for particular value of 'N' and enable particular RAM using some case statement or so....

 

[Deepak.akon]

thanks.....

 

[Nicolás Celedón]

You could aproximante and split the functions(sine cos, etc) into segments(y=mx+b), and you just save in RAM the "m" and "b" values of each segment. This gives you pressision and doesn't need too much memory. of course it dependes on how many segments are you considering.