摘要
在数字信号的逻辑处理基础上,利用布尔函数的分解方法,导出了离散Walsh变换的一种并行算法及其快速并行算法。对已有Walsh变换算法及本文算法的时间复杂度进行了分析,该分析表明本文算法时间复杂度有一定程度下降。当变量个数为20时,本文提出的Walsh并行算法速度是Walsh变换算法速度的29倍,快速并行算法速度是快速Walsh变换算法速度的210倍。本文提出的算法适用于高级语言编程实现。
Based on the logical processing of the digital signals, a parallel algorithm and its fast parallel algorithm of the Walsh transform have been developed by using decomposition method of the Boolean functions. The time complexities of the existing Walsh transform algorithms and the algorithms proposed in this paper were analyzed. It is shown that the time complexity of the algorithm in this paper has been reduced to a certain extent. When the number of variables is 20, the speed of Walsh parallel algorithm proposed in this paper is 29 times faster than the existing Walsh transformation algorithm. The speed of Walsh parallel fast algorithm proposed in this paper is 210 times faster than the existing Walsh transformation fast algorithm. The algorithm proposed in this paper is suitable for advanced language programming implementation.
作者
姜恩华
JIANG Enhua(School of Electronic Information,Huaibei Normal University,Huaibei 235000,Anhui,China)
出处
《武汉大学学报（理学版）》
CAS
CSCD
北大核心
2019年第6期576-580,共5页
Journal of Wuhan University:Natural Science Edition
基金
国家自然科学基金资助项目（41275027,11504121）
