On algorithms for digital signal processing of sequences

H. Krishna Garg, C. C. Ko, K. Y. Lin, H. Liu

Research output: Contribution to journalArticle

1 Scopus citations

Abstract

In this work, we analyze the algebraic structure of fast algorithms for computing one- and two-dimensional convolutions of sequences defined over the fields of rational and complex rational numbers. The algorithms are based on factorization properties of polynomials and the direct sum property of modulo computation over such fields. Algorithms are described for cyclic as well as acyclic convolution. It is shown that under certain nonrestrictive conditions, all the previously defined algorithms over the fields of rational and complex rational numbers are also valid over the rings of finite integers. Examples are presented to illustrate the results.

Original languageEnglish (US)
Pages (from-to)437-452
Number of pages16
JournalCircuits, Systems, and Signal Processing
Volume15
Issue number4
DOIs
StatePublished - 1996
Externally publishedYes

ASJC Scopus subject areas

  • Signal Processing
  • Applied Mathematics

Fingerprint Dive into the research topics of 'On algorithms for digital signal processing of sequences'. Together they form a unique fingerprint.

  • Cite this