The Discrete Fourier Transform Over Finite Rings with Application to Fast Convolution
From MaRDI portal
Publication:4174615
DOI10.1109/TC.1978.1675158zbMath0392.94002OpenAlexW1819199145MaRDI QIDQ4174615
Eric Dubois, Anastasios N. Venetsanopoulos
Publication date: 1978
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tc.1978.1675158
AlgorithmsDiscrete Fourier TransformFinite RingsComputation Of Digital ConvolutionsDirect Sum of Local RingsFast ConvolutionFermat Number Transform
Related Items (4)
Transform domain characterization of cyclic codes over \(\mathbb{Z}_ m\) ⋮ On the factorization of polynomials and direct sum properties in integer polynomial rings ⋮ Group character tables in discrete transform theory ⋮ Fast algorithms for computing one- and two-dimensional convolution in integer polynomial rings
This page was built for publication: The Discrete Fourier Transform Over Finite Rings with Application to Fast Convolution