The generalized discrete Fourier transform in rings of algebraic integers
From MaRDI portal
Publication:3339231
Recommendations
- Computing the discrete Fourier transform using residue number systems in a ring of algebraic integers
- Generalization of the algebraic discrete Fourier transform with application to fast convolutions
- scientific article; zbMATH DE number 700561
- scientific article; zbMATH DE number 3974248
- scientific article; zbMATH DE number 700555
Cited in
(17)- scientific article; zbMATH DE number 4037044 (Why is no real title available?)
- Discrete Fourier transforms and plane rotations
- Parameter Determination for Complex Number-Theoretic Transforms Using Cyclotomic Polynomials
- Finite field trigonometric transforms
- On the factorization of polynomials and direct sum properties in integer polynomial rings
- Cyclotomic polynomial factorization in finite integer rings with applications to digital signal processing
- Computing the discrete Fourier transform using residue number systems in a ring of algebraic integers
- Abelian semi-simple algebras and algorithms for the discrete Fourier transform
- scientific article; zbMATH DE number 4153169 (Why is no real title available?)
- scientific article; zbMATH DE number 817564 (Why is no real title available?)
- scientific article; zbMATH DE number 4144091 (Why is no real title available?)
- scientific article; zbMATH DE number 4148236 (Why is no real title available?)
- scientific article; zbMATH DE number 3939242 (Why is no real title available?)
- The discrete Fourier transform of distributions
- Generalizing the discrete Fourier transform
- Ring structures and the discrete Fourier transform
- Fast algorithms for computing one- and two-dimensional convolution in integer polynomial rings
This page was built for publication: The generalized discrete Fourier transform in rings of algebraic integers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3339231)