摘要
以修正哈达马变换为基础，建立了修正哈达马变换的快速算法。首先，从Ｎ＝８这种特殊情况出发，利用矩阵分解法，获得了快速修正哈达马变换及其逆变换的基本原理和方法。然后，又导出了快速算法的一般迭代公式。
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.
出处
《成都理工学院学报》
CSCD
1994年第2期100-109,共10页
Journal of Chengdu University of Technology
关键词
哈达马变换
修正
快速算法
正交性
modified Hadamard maxtrix
orthogonality
maxtrix decomposition
flow graph
FFT
