Calculating the FHT in hardware

DOI10.1109/78.139240MaRDI QIDQ4017815zbMATH OpenOpenAlexFDO

Authors Adam C. Erickson, Barry S. Fagin

Publication date 16 January 1993

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

Full work available at URL https://semanticscholar.org/paper/90526c1473d8b5703f4149e07b2450aa93f47219

zbMATH Keywords

fast Hartley transform

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Numerical methods for discrete and fast Fourier transforms (65T50) Numerical algorithms for specific classes of architectures (65Y10) Mathematical problems of computer architecture (68M07)

Cited in

(2)

• A structured dual split-radix algorithm for the discrete Hartley transform of length \(2^{N}\)
• An efficient implementation of the sign LMS algorithm using block floating point format

This page was built for publication: Calculating the FHT in hardware

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4017815)