Computing m DFTs over GF(q) with one DFT over GF(q/sup m/)

DOI10.1109/18.179373MaRDI QIDQ4034468zbMATHOpenAlexDBLPWikidataFDO

Authors Jonathan Hong, Martin Vetterli

Publication date 16 May 1993

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

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

zbMATH Keywords

complexityfinite fieldsdiscrete Fourier transforms

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Finite fields and commutative rings (number-theoretic aspects) (11T99) Number-theoretic algorithms; complexity (11Y16) Numerical methods for discrete and fast Fourier transforms (65T50)

Recommendations

• Some properties of the discrete Fourier transform in the field of complex numbers and in the fields of finite characteristics
• Fast, prime factor, discrete Fourier transform algorithms over \(\text{GF}(2^m)\) for \(8 \leqslant m \leqslant 10\)
• scientific article; zbMATH DE number 817564
• Multiplicative complexity of the two-dimensional discrete Fourier transform DFT (2n; 2)
• Fast Fourier transforms over poor fields

Cited in

(4)

• Some properties of the discrete Fourier transform in the field of complex numbers and in the fields of finite characteristics
• scientific article; zbMATH DE number 817564 (Why is no real title available?)
• Generalising the simultaneous computation of the DFTs of two real sequences using a single \(N-\)point DFT
• scientific article; zbMATH DE number 2058227 (Why is no real title available?)

This page was built for publication: Computing m DFTs over GF(q) with one DFT over GF(q/sup m/)

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