Fast computation of real discrete Fourier transform for any number of data points

DOI10.1109/31.99157zbMath0751.65073OpenAlexW2027232578MaRDI QIDQ3986791

Neng-Chung Hu, Okan K. Ersoy

Publication date: 27 June 1992

Published in: IEEE Transactions on Circuits and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/31.99157

zbMATH Keywords

fast algorithmsartificial neural networksimage codingimage enhancementdiscrete cosine transformmatrix factorizationdiscrete sine transformKronecker-productnonlinear matched filteringreal discrete Fourier transformreal Fourier coefficients

Mathematics Subject Classification ID

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

Related Items (1)

A new matrix approach to real FFTs and convolutions of length \(2^k\)

This page was built for publication: Fast computation of real discrete Fourier transform for any number of data points