An algorithm for complex approximations in<tex>Z[e^{2{pi}i/8}]</tex>(Corresp.)

DOI10.1109/TIT.1986.1057203zbMATH Open0609.65012MaRDI QIDQ3750024FDOQ3750024

Authors: Richard A. Games 

Publication date: 1986

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

Recommendations

• Complex approximations using algebraic integers
• Computing the discrete Fourier transform using residue number systems in a ring of algebraic integers
• scientific article; zbMATH DE number 1559520
• Techniques for Computing the Discrete Fourier Transform Using the Quadratic Residue Fermat Number Systems
• Fast and precise Fourier transforms

zbMATH Keywords

discrete Fourier transformresidue number systemcomplex approximationsalgebraic integers

Mathematics Subject Classification ID

General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) Numerical methods for trigonometric approximation and interpolation (65T40) Algorithms for approximation of functions (65D15)

Cited In (3)

• Computing the discrete Fourier transform using residue number systems in a ring of algebraic integers
• Title not available (Why is that?)
• Optimal algebraic integer implementation with application to complex frequency sampling filters

This page was built for publication: An algorithm for complex approximations in&lt;tex&gt;Z[e^{2{pi}i/8}]&lt;/tex&gt;(Corresp.)

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