The AICE-CRT and digital signal processing algorithms: The complex case

DOI10.1007/BF01183749zbMath0811.65138OpenAlexW2085898026MaRDI QIDQ1345182

V. Pereyra

Publication date: 2 March 1995

Published in: Circuits, Systems, and Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01183749

zbMATH Keywords

fast algorithmsconvolutionsdigital signal processingChinese remainder theoremcomplex-valued integer sequencesnumber-theoretic-transforms

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Numerical methods for discrete and fast Fourier transforms (65T50)

Related Items (5)

On the factorization of polynomials and direct sum properties in integer polynomial rings ⋮ On algorithms for digital signal processing of sequences ⋮ Analysis of the Chinese remainder theorem and cyclotomic polynomials-based algorithms for cyclic convolution. I: Rational number system ⋮ Analysis of the Chinese remainder theorem and cyclotomic polynomials-based algorithms for cyclic convolution. II: Complex rational number system ⋮ Fast algorithms for computing one- and two-dimensional convolution in integer polynomial rings

Cites Work

• Fast algorithms for computing one- and two-dimensional convolution in integer polynomial rings
• On the factorization of polynomials and direct sum properties in integer polynomial rings
• Rings, fields, the Chinese remainder theorem and an extension-Part I: theory
• Rings, fields, the Chinese remainder theorem and an extension-Part II: applications to digital signal processing
• Discrete Convolutions via Mersenne Transforms
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The AICE-CRT and digital signal processing algorithms: The complex case