Designing Fast Walsh Hadamard Transform on Various Interconnection Networks Using Tensor Product Formulation
碩士 === 逢甲大學 === 資訊工程所 === 91 === The fast Walsh Hadamard transform is a simple and important algorithm in digital signal processing, especially, in digital image compression. The fast Walsh Hadamard transform is a block recursive algorithm, which can be easily expressed as a tensor product formula....
Main Authors: | Kou-Cheng Ting, 丁國政 |
---|---|
Other Authors: | An-Chi Liu |
Format: | Others |
Language: | en_US |
Published: |
2003
|
Online Access: | http://ndltd.ncl.edu.tw/handle/r8f2ma |
Similar Items
-
Walsh - Hadamard Transformation of a Convolution
by: M. Zajac, et al.
Published: (2002-09-01) -
Design and Implementation of Sequency-Ordered Fast Walsh-Hadamard Transform (FWHT) in WCDMA
by: Safaa M. Z. Al-Ubaidi
Published: (2014-05-01) -
Computationally Efficient Robust Color Image Watermarking Using Fast Walsh Hadamard Transform
by: Suja Kalarikkal Pullayikodi, et al.
Published: (2017-10-01) -
Detection of Focal and Non-Focal Electroencephalogram Signals Using Fast Walsh-Hadamard Transform and Artificial Neural Network
by: Prasanna J., et al.
Published: (2020-09-01) -
Nearly optimal deterministic algorithm for sparse Walsh-Hadamard transform
by: Cheraghchi, Mahdi, et al.
Published: (2018)