Prime factor fast Hartley transform

DOI10.1049/EL:19900082MaRDI QIDQ3201722zbMATHOpenAlexFDO

Authors Dekun Yang

Publication date 1990

Published in Electronics Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1049/el:19900082

zbMATH Keywords

signal processingdiscrete Hartley transformprime factor algorithmWinograd Hartley transform algorithm

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Numerical methods for discrete and fast Fourier transforms (65T50)

Recommendations

• On prime factor mapping for the discrete Hartley transform
• Fast computation of the discrete Hartley transform
• The Fast Hartley Transform Algorithm
• Parallel prime-factor discrete Hartley transform on the orthogonal multiprocessor
• scientific article; zbMATH DE number 7607907

Cited in

(4)

• An efficient algorithm for cyclic convolution based on fast-polynomial and fast-\(W\) transforms
• scientific article; zbMATH DE number 7607907 (Why is no real title available?)
• Parallel prime-factor discrete Hartley transform on the orthogonal multiprocessor
• A structured dual split-radix algorithm for the discrete Hartley transform of length \(2^{N}\)

This page was built for publication: Prime factor fast Hartley transform

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