Centralized fast slant transform algorithms

Jar Ferr Yang, Chih Peng Fan

Research output: Contribution to journalArticle

9 Citations (Scopus)

Abstract

In this paper, we propose general fast one dimensional (1-D) and two dimensional (2-D) slant transform algorithms. By introducing simple and structural permutations, the heavily computational operations are centralized to become standardized and localized processing units. The total numbers of multiplications for the proposed fast 1-D and 2-D slant transforms are less than those of the existed methods. With advantages of convenient description in formulation and efficient computation for realization, the proposed fast slant transforms are suitable for applications in signal compression and pattern recognition.

Original languageEnglish
Pages (from-to)705-711
Number of pages7
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
VolumeE80-A
Issue number4
Publication statusPublished - 1997 Jan 1

All Science Journal Classification (ASJC) codes

  • Signal Processing
  • Computer Graphics and Computer-Aided Design
  • Electrical and Electronic Engineering
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Centralized fast slant transform algorithms'. Together they form a unique fingerprint.

  • Cite this