S.I. Konokhova - Software Engineer, LTD «Special Technological Center» (St. Petersburg)

The FFT calculation based on the elements of FPGA can be implemented by core and megafunctions. It imposes constraints on the inter-face developed device. It was proposed alternative way of implementing the algorithm of FFT calculation based on Radix-N butterfly. De-veloped algorithm can compute FFT different length. No restrictions on the length of input data sequence makes FFT calculation module universal for using.

 

1. Zalmanzon L.A. Preobrazovanija Fure, Uolsha, KHaara i ikh primenenie v upravlenii, svjazi i drugikh oblastjakh. M.: Nauka. 1989. S. 25-99.
2. Zverev V.A., Stromkov A.A. Vydelenie signalov iz pomekh chislennymi metodami. N. Novgorod: Institut prikladnojj fiziki RAN. 2001. S. 7-57.
3. Kester U. Proektirovanie sistem cifrovojj i smeshannojj obrabotki signalov. M.: Tekhnosfera. 2010. S. 101-122.
4. Rukovodstvo polzovatelja megafunkcii BPF kompanii Altera Corporation [EHl. resurs]. Altera Corporation. URL: http://www.lr.ttu.ee/~truuben/MUDELDAMINE/ug_fft.pdf (data obrashhenija 28.10.2015).
5. Rukovodstvo polzovatelja IP-bloka BPF kompanii Altera Corporation [EHl. resurs]. Altera Corporation. URL: https://www.altera.com/content/dam/altera-www/global/en_US/pdfs/literature/ug/ug_fft.pdf (data obrashhenija: 28.10.2015).
6. Specifikacija IP-bloka BPF kompanii Xilinx Inc [EHl. resurs]. Xilinx Inc. URL: http://www.xilinx.com/support/documentation/ip_documentation/xfft_ds260.pdf (data obrashhenija: 28.10.2015).
7. Borevich Z.I. Teorija chisel. M.: Knigapotrebovaniju. 1986. S. 111-112.