The regularized fast Hartley transform. Optimal formulation of real-data fast Fourier transform for silicon-based implementation in resource-constrained environments.

DOI10.1007/978-90-481-3917-0zbMath1191.94001OpenAlexW2494175050MaRDI QIDQ847617

N. E. Zubov

Publication date: 18 February 2010

Published in: Signals and Communication Technology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-90-481-3917-0

zbMATH Keywords

textbookdiscrete Fourier transformparallel computingparallelizationdiscrete Hartley transformdouble-sized butterflyradix-4 lengthreal-data fast Fourier transformregularized fast Hartley transformsource code in C

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Numerical methods for discrete and fast Fourier transforms (65T50) Parallel numerical computation (65Y05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory (94-01)

This page was built for publication: The regularized fast Hartley transform. Optimal formulation of real-data fast Fourier transform for silicon-based implementation in resource-constrained environments.