| 引用本文: | 汤国熙.矩阵形式的快速沃尔什变换法.[J].国防科技大学学报,1983,(4):101-112.[点击复制] |
| Tang Guoxi.Fast Walsh Transform into Form of Matrix[J].Journal of National University of Defense Technology,1983,(4):101-112[点击复制] |
|
| |
|
|
| 本文已被：浏览 5116次 下载 6164次 |
| 矩阵形式的快速沃尔什变换法 |
| 汤国熙 |
|
()
|
| 摘要: |
| 本文用矩阵形式，建立系统地快速沃尔什变换 (FWT) 运算方法，它应用了二进制顺序 Walsh-paley，列率顺序 Walsh-Kaczmarz 和 Kronecker 顺序 Walsh-Hadamard 变换。由文献可知，某些 FWT 运算是借助于一定的矩阵编制计算程序的新方法，这样的变换法，可作为数字计算机的辅助设备。 |
| 关键词: |
| DOI： |
| 投稿日期：1983-09-20 |
| 基金项目: |
|
| Fast Walsh Transform into Form of Matrix |
| Tang Guoxi |
| Abstract: |
| A method for systematically constructing Fast Walsh Transform algorithms is given，This method is applicable to binary-ordered Walsh-，Paley-，Sequency-ordered Walsh-Kaczmarz-and Kronecker-ordered Walsh-Hadamard Transformations.Using this method，some FWT algorithms already known from literature can be presented in a novel way by means of certain matrix factorizations，As the transformations are normally done with the aid of a digital computer，it is important to establish effective and time-saving computer algorithms. |
| Keywords: |
|
|
