On fast algorithms for one-dimensional digital signal processing in finite integer and complex integer rings (Q5957408)
From MaRDI portal
scientific article; zbMATH DE number 1716865
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On fast algorithms for one-dimensional digital signal processing in finite integer and complex integer rings |
scientific article; zbMATH DE number 1716865 |
Statements
On fast algorithms for one-dimensional digital signal processing in finite integer and complex integer rings (English)
0 references
6 March 2002
0 references
The authors present a number theoretic approach to the computation of one-dimensional cyclic convolutions of sequences, which are defined in either finite integer rings or complex integer rings. They simplify some important cases related to digital signal processing. Their techniques involve the factorization of cyclotomic polynomials modulo prime powers.
0 references
computational complexity
0 references
cyclic convolutions
0 references
finite integer rings
0 references
complex integer rings
0 references
digital signal processing
0 references
factorization of cyclotomic polynomials
0 references
