Selection of a rotation factors in monobit fast Fourier transform

Бесплатный доступ

The article presents the results of a study of the monobit fast Fourier transform algorithm. Variants of the algorithm on the basis of different sets of rotation factors. Choosing rotation factors affect the quality of the result monobit fast Fourier transform on FPGA resources needed to implement the algorithm. Quantitative assessment of this impact in the open literature are given. The subject of the study is the rate of unwanted components in the spectrum of the analyzed signal. The results of calculation of the number of the FPGA resources required for the implementation of different versions of the monobit fast Fourier transform algorithm. The calculations were made for the 1024-point conversion. The research results can be used in the development and practical implementation of digital signal processing on FPGA, using an monobit fast Fourier transforms algorithm.

Еще

Fpga, monobit fft

Короткий адрес: https://sciup.org/147154908

IDR: 147154908

Краткое сообщение