A flexible implementation of a matrix Laurent series-based 16-point fast Fourier and Hartley transforms
R. C. de Oliveira, H. M. de Oliveira, R. Campello de Souza, Edval J.P. Santos · 2010
This paper describes a flexible architecture for implementing a new fast computation of the discrete Fourier and Hartley transforms, which is based on a matrix Laurent series. The device calculates the transforms based on a single bit selection operator. The hardware structure and synthesis are presented, which handled a 16-point fast transform in 65 nsec, with a Xilinx SPARTAN 3E device.