V/HS structure for transforms and their fast algorithms

Y. Katiyi, L. Yaroslavsky

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

A general parameterized recursive matrix representation for a wide class of transforms with fast algorithm is suggested that allows to automatically generate an arbitrary transform from the family by selecting a specific set of parameters and to evaluate their computational complexity in a very straightforward way. A regular derivation of pruned transforms is also developed to generating arbitrarily pruned transforms for both, input and output arbitrary pruning. A Matlab code has been developed to test the correctness of algorithms, to evaluate their complexity, to generate their visual representation by flow charts and to automatically generate Matlab executable transform codes. It is demonstrated that these techniques allow also to easily derived fast algorithms for shifted transforms, DCT and transforms of real valued data.

Original languageEnglish
Title of host publicationISPA 2003 - Proceedings of the 3rd International Symposium on Image and Signal Processing and Analysis
EditorsA. Neri, H. Babic, S. Loncaric
PublisherIEEE Computer Society
Pages482-487
Number of pages6
ISBN (Electronic)953184061X
DOIs
StatePublished - 2003
Event3rd International Symposium on Image and Signal Processing and Analysis, ISPA 2003 - Rome, Italy
Duration: 18 Sep 200320 Sep 2003

Publication series

NameInternational Symposium on Image and Signal Processing and Analysis, ISPA
Volume1
ISSN (Print)1845-5921
ISSN (Electronic)1849-2266

Conference

Conference3rd International Symposium on Image and Signal Processing and Analysis, ISPA 2003
Country/TerritoryItaly
CityRome
Period18/09/0320/09/03

Keywords

  • Algorithm design and analysis
  • Automatic testing
  • Computational complexity
  • Computer hacking
  • Discrete Fourier transforms
  • Discrete cosine transforms
  • Fast Fourier transforms
  • Flowcharts
  • Kernel
  • Signal processing algorithms

Fingerprint

Dive into the research topics of 'V/HS structure for transforms and their fast algorithms'. Together they form a unique fingerprint.

Cite this