Fixed-pipeline two-dimensional hadamard transform algorithms

Chih Peng Fan, Jar-Ferr Yang

Research output: Contribution to journalArticle

15 Citations (Scopus)

Abstract

In this correspondence, we first propose a new two-dimensional (2-D) Hadamard transform algorithm, which can be realized in fixed and identical pipeline stages. By introducing exchangeable permutations, the fixed-pipeline algorithm can be further extended to provide all 2-D lower-dimension transformations in intermediate pipeline stages. Finally, the parallel pipeline realization of the proposed algorithm is also suggested. For VLSI implementation, the proposed fixed-pipeline structure with the same computational complexity provides better modularity than the other famous algorithms. With lower dimension transformations, the proposed algorithm is suitable for applications in variable-block-size compression.

Original languageEnglish
Pages (from-to)1669-1674
Number of pages6
JournalIEEE Transactions on Signal Processing
Volume45
Issue number6
Publication statusPublished - 1997 Dec 1

Fingerprint

Hadamard transforms
Pipelines
Computational complexity

All Science Journal Classification (ASJC) codes

  • Signal Processing
  • Electrical and Electronic Engineering

Cite this

@article{f361586459b84b66a16a1c5c7d1c3c3f,
title = "Fixed-pipeline two-dimensional hadamard transform algorithms",
abstract = "In this correspondence, we first propose a new two-dimensional (2-D) Hadamard transform algorithm, which can be realized in fixed and identical pipeline stages. By introducing exchangeable permutations, the fixed-pipeline algorithm can be further extended to provide all 2-D lower-dimension transformations in intermediate pipeline stages. Finally, the parallel pipeline realization of the proposed algorithm is also suggested. For VLSI implementation, the proposed fixed-pipeline structure with the same computational complexity provides better modularity than the other famous algorithms. With lower dimension transformations, the proposed algorithm is suitable for applications in variable-block-size compression.",
author = "Fan, {Chih Peng} and Jar-Ferr Yang",
year = "1997",
month = "12",
day = "1",
language = "English",
volume = "45",
pages = "1669--1674",
journal = "IEEE Transactions on Signal Processing",
issn = "1053-587X",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "6",

}

Fixed-pipeline two-dimensional hadamard transform algorithms. / Fan, Chih Peng; Yang, Jar-Ferr.

In: IEEE Transactions on Signal Processing, Vol. 45, No. 6, 01.12.1997, p. 1669-1674.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Fixed-pipeline two-dimensional hadamard transform algorithms

AU - Fan, Chih Peng

AU - Yang, Jar-Ferr

PY - 1997/12/1

Y1 - 1997/12/1

N2 - In this correspondence, we first propose a new two-dimensional (2-D) Hadamard transform algorithm, which can be realized in fixed and identical pipeline stages. By introducing exchangeable permutations, the fixed-pipeline algorithm can be further extended to provide all 2-D lower-dimension transformations in intermediate pipeline stages. Finally, the parallel pipeline realization of the proposed algorithm is also suggested. For VLSI implementation, the proposed fixed-pipeline structure with the same computational complexity provides better modularity than the other famous algorithms. With lower dimension transformations, the proposed algorithm is suitable for applications in variable-block-size compression.

AB - In this correspondence, we first propose a new two-dimensional (2-D) Hadamard transform algorithm, which can be realized in fixed and identical pipeline stages. By introducing exchangeable permutations, the fixed-pipeline algorithm can be further extended to provide all 2-D lower-dimension transformations in intermediate pipeline stages. Finally, the parallel pipeline realization of the proposed algorithm is also suggested. For VLSI implementation, the proposed fixed-pipeline structure with the same computational complexity provides better modularity than the other famous algorithms. With lower dimension transformations, the proposed algorithm is suitable for applications in variable-block-size compression.

UR - http://www.scopus.com/inward/record.url?scp=0031163857&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0031163857&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0031163857

VL - 45

SP - 1669

EP - 1674

JO - IEEE Transactions on Signal Processing

JF - IEEE Transactions on Signal Processing

SN - 1053-587X

IS - 6

ER -