2011-10-11 03:34 AM
Hi,
I am using STM32F10xxx DSP library (not the CMSIS DSP)algorithm for calculating FFT of an input sequence. I want to know the order in whcih the input samples is expected by this algorithm and the order in which the output is given, For eg: If FFT of x[0] is X[0] so if I give input as x[0],x[1],x[2],x[3] . . . then will I get output as X[0],X[1],X[2],X[3] . . . ie. input in natural orde and output in natural order ie. the algorithm has inbuilt bit reversal implemented. OR the input and output should be in any other order. Also, I want to know that if by any means I can generate twiddle factors of my own then can I use the 64 point, 256 point and 1024 point algorithms for calculating FFT at higher points say 2048.?? #dsp-stm32f10xx-library2011-10-11 10:10 PM
You might find this interesting:
https://my.st.com/public/STe2ecommunities/mcu/Lists/cortex_mx_stm32/Flat.aspx?RootFolder=https://my.st.com/public/STe2ecommunities/mcu/Lists/cortex_mx_stm32/Complexreal, 1632bit, radix42 FFT, windowing, sqrt and magnitude library&FolderCTID=0x01200200770978C69A1141439FE559EB459D7580009C4E14902C3CDE46A77F0FFD06506F5B¤tviews=1762
2011-10-12 12:43 AM
Actually , my question is specificaly for the DSP library provided by STMicroelectronics.
Manual: http://www.st.com/internet/com/TECHNICAL_RESOURCES/TECHNICAL_LITERATURE/USER_MANUAL/CD00208762.pdf Different libraries implement algorithm in different ways . I am using the one provided by ST.2013-03-04 12:03 AM
2013-10-09 05:57 AM
2013-10-09 06:39 AM
http://www.st.com/st-web-ui/static/active/en/resource/technical/document/user_manual/CD00208762.pdf
https://docs.google.com/file/d/0B7OY5pub_GfIRng1WVpHZXJzM2c/edit?usp=sharing
https://docs.google.com/file/d/0B7OY5pub_GfIOGZuTFVRWXdpemM/edit?usp=sharing