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: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | en_US |
Published: |
2003
|
Online Access: | http://ndltd.ncl.edu.tw/handle/r8f2ma |
id |
ndltd-TW-091FCU05392057 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-091FCU053920572018-06-25T06:06:39Z http://ndltd.ncl.edu.tw/handle/r8f2ma Designing Fast Walsh Hadamard Transform on Various Interconnection Networks Using Tensor Product Formulation 利用張量乘積設計各種互連網路上的快速WalshHadamard轉換 Kou-Cheng Ting 丁國政 碩士 逢甲大學 資訊工程所 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. Also, the tensor product notation can be used to express the topology of interconnection networks. In this thesis, we will emerge the specification of tensor product formulation of block recursive algorithms and interconnection networks to design fast Walsh Hadamard transform algorithms on various interconnection networks, including hypercube networks, omega networks, and baseline networks. The design process starts from a tensor product formula of the fast Walsh Hadamard transform. Given a specific interconnection network, we will manipulate the tensor product formula of the fast Walsh Hadamard transform to an equivalent formula which fits the form of the tensor product formula of that interconnection network. The resulting algorithms are suitable for designing VLSI circuits of DSP algorithms. An-Chi Liu Chua-Huang Huang 劉安之 黃秋煌 2003 學位論文 ; thesis 25 en_US |
collection |
NDLTD |
language |
en_US |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 逢甲大學 === 資訊工程所 === 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. Also, the tensor product notation can be used to express the topology of interconnection networks. In this thesis, we will emerge the specification of tensor product formulation of block recursive algorithms and interconnection networks to design fast Walsh Hadamard transform algorithms on various interconnection networks, including hypercube networks, omega networks, and baseline networks. The design process starts from a tensor product formula of the fast Walsh Hadamard transform. Given a specific interconnection network, we will manipulate the tensor product formula of the fast Walsh Hadamard transform to an equivalent formula which fits the form of the tensor product formula of that interconnection network. The resulting algorithms are suitable for designing VLSI circuits of DSP algorithms.
|
author2 |
An-Chi Liu |
author_facet |
An-Chi Liu Kou-Cheng Ting 丁國政 |
author |
Kou-Cheng Ting 丁國政 |
spellingShingle |
Kou-Cheng Ting 丁國政 Designing Fast Walsh Hadamard Transform on Various Interconnection Networks Using Tensor Product Formulation |
author_sort |
Kou-Cheng Ting |
title |
Designing Fast Walsh Hadamard Transform on Various Interconnection Networks Using Tensor Product Formulation |
title_short |
Designing Fast Walsh Hadamard Transform on Various Interconnection Networks Using Tensor Product Formulation |
title_full |
Designing Fast Walsh Hadamard Transform on Various Interconnection Networks Using Tensor Product Formulation |
title_fullStr |
Designing Fast Walsh Hadamard Transform on Various Interconnection Networks Using Tensor Product Formulation |
title_full_unstemmed |
Designing Fast Walsh Hadamard Transform on Various Interconnection Networks Using Tensor Product Formulation |
title_sort |
designing fast walsh hadamard transform on various interconnection networks using tensor product formulation |
publishDate |
2003 |
url |
http://ndltd.ncl.edu.tw/handle/r8f2ma |
work_keys_str_mv |
AT kouchengting designingfastwalshhadamardtransformonvariousinterconnectionnetworksusingtensorproductformulation AT dīngguózhèng designingfastwalshhadamardtransformonvariousinterconnectionnetworksusingtensorproductformulation AT kouchengting lìyòngzhāngliàngchéngjīshèjìgèzhǒnghùliánwǎnglùshàngdekuàisùwalshhadamardzhuǎnhuàn AT dīngguózhèng lìyòngzhāngliàngchéngjīshèjìgèzhǒnghùliánwǎnglùshàngdekuàisùwalshhadamardzhuǎnhuàn |
_version_ |
1718706406030311424 |