A Flexible Implementation of a Matrix Laurent Series-Based 16-Point Fast Fourier and Hartley Transforms
Numerical Analysis
2018-01-26 v1 Discrete Mathematics
Signal Processing
Abstract
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.
Keywords
Cite
@article{arxiv.1502.05880,
title = {A Flexible Implementation of a Matrix Laurent Series-Based 16-Point Fast Fourier and Hartley Transforms},
author = {R. C. de Oliveira and H. M. de Oliveira and R. M. Campello de Souza and E. J. P. Santos},
journal= {arXiv preprint arXiv:1502.05880},
year = {2018}
}
Comments
4 pages, 4 figures. IEEE VI Southern Programmable Logic Conference 2010