Algorithms of two-dimensional discrete orthogonal transforms realized in Hamilton-Eisenstein codes

MaRDI QIDQ1814648zbMATH OpenFDO

Authors V. M. Chernov

Publication date 19 August 1998

Published in Problems of Information Transmission (Search for Journal in Brave)

zbMATH Keywords

fast algorithmsHamilton-Eisenstein codestwo-dimensional discrete Fourier transform

Mathematics Subject Classification ID

Numerical methods for integral transforms (65R10) Numerical methods for discrete and fast Fourier transforms (65T50) Arithmetic codes (94B40)

Recommendations

• scientific article; zbMATH DE number 3926791
• Multiplicative complexity of the two-dimensional discrete Fourier transform DFT (2n; 2)
• Abelian semi-simple algebras and algorithms for the discrete Fourier transform
• scientific article; zbMATH DE number 3926790
• New fast algorithm for two-dimensional discrete Fourier transform DFT(2ⁿ; 2)

Cited in

(3)

• Abelian semi-simple algebras and algorithms for the discrete Fourier transform
• Complex and hypercomplex discrete Fourier transforms based on matrix exponential form of Euler's formula
• scientific article; zbMATH DE number 1670690 (Why is no real title available?)

This page was built for publication: Algorithms of two-dimensional discrete orthogonal transforms realized in Hamilton-Eisenstein codes

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