修正哈达马变换的快速算法  

A FAST ALGORITHM FOR MODIFIED HADAMARD TRANSFORM

作　　者：何永富[1] 刘争平[1] 陈天与[1] 

机构地区：[1]成都理工学院计算机工程系,成都理工学院应用地球物理系

出　　处：《成都理工学院学报》1994年第2期100-109,共10页Journal of Chengdu University of Technology

摘　　要：以修正哈达马变换为基础，建立了修正哈达马变换的快速算法。首先，从Ｎ＝８这种特殊情况出发，利用矩阵分解法，获得了快速修正哈达马变换及其逆变换的基本原理和方法。然后，又导出了快速算法的一般迭代公式。On the basis of modified Hadamard transform,a fast algorithm for modied Hadamard transform is established in this paper. From special case of N=8,and by the method of the matrix decomposition,the principle and method of the fast modified Hadamard transform and its inversion transform are obtained. Subsequently the iteractive formula for general case are induced. The result shows that the algorithm is of high efficiency and fast speed.

关 键 词：哈达马变换 修正 快速算法 正交性 

分 类 号：O241.6[理学—计算数学]