Hartley transforms over finite fields

DOI10.1109/18.259646MaRDI QIDQ4307375zbMATH OpenOpenAlexWikidataFDO

Authors Jonathan Hong, Martin Vetterli

Publication date 3 October 1994

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://infoscience.epfl.ch/record/33895/files/HongV93.pdf

zbMATH Keywords

complexityconvolutiondiscrete Fourier transformfast algorithmsfinite fieldsHartley transforms

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Numerical methods for discrete and fast Fourier transforms (65T50)

Recommendations

• On fast multiplication of polynomials, the Fourier and Hartley transforms
• Generalized discrete Hartley transforms
• Finite-field wavelet transforms
• Generalization of the algebraic discrete Fourier transform with application to fast convolutions

Cited in

(9)

• Invariant spaces and fast transforms
• A study on Ateb transform as a generalization of Fourier transform
• Expediting factor-type fast finite field transform algorithms
• On prime factor mapping for the discrete Hartley transform
• scientific article; zbMATH DE number 1263453 (Why is no real title available?)
• A generalized reverse jacket transform
• scientific article; zbMATH DE number 910739 (Why is no real title available?)
• Family of fastest linearly independent transforms over GF(3): generation, relations, and hardware implementation
• The eigenstructure of finite field trigonometric transforms

This page was built for publication: Hartley transforms over finite fields

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