Centralized Fast Slant Transform Algorithms

Jar-Ferr YANG; Chih-Peng FAN

Centralized Fast Slant Transform Algorithms

Jar-Ferr YANG, Chih-Peng FAN

Full Text Views

0

Share
Cite this

Summary :

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.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E80-A No.4 pp.705-711

Publication Date: 1997/04/25

Publicized

Online ISSN

DOI

Type of Manuscript

Category: Digital Signal Processing

Cite this

Copy

Jar-Ferr YANG, Chih-Peng FAN, "Centralized Fast Slant Transform Algorithms" in IEICE TRANSACTIONS on Fundamentals, vol. E80-A, no. 4, pp. 705-711, April 1997, doi: .
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.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1587/e80-a_4_705/_p

Copy

@ARTICLE{e80-a_4_705,
author={Jar-Ferr YANG, Chih-Peng FAN, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Centralized Fast Slant Transform Algorithms},
year={1997},
volume={E80-A},
number={4},
pages={705-711},
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.},
keywords={},
doi={},
ISSN={},
month={April},}

Copy

TY - JOUR
TI - Centralized Fast Slant Transform Algorithms
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 705
EP - 711
AU - Jar-Ferr YANG
AU - Chih-Peng FAN
PY - 1997
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E80-A
IS - 4
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - April 1997
AB - 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.
ER -