Method of flow graph simplification for the 16-point discrete Fourier transform

DOI10.1109/TSP.2004.838970zbMath1372.65362MaRDI QIDQ5355638

Artyom M. Grigoryan, Veerabhadra S. Bhamidipati

Publication date: 20 September 2017

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50)

Related Items (2)

Representation of the Fourier transform by Fourier series ⋮ Two classes of elliptic discrete Fourier transforms: properties and examples

This page was built for publication: Method of flow graph simplification for the 16-point discrete Fourier transform