| 离散 Hartley 变换的 MIMD 并行算法 |
| |
| 引用本文： | 曾泳泓. 离散 Hartley 变换的 MIMD 并行算法[J]. 国防科技大学学报, 1993, 15(4): 103-108 |
| |
| 作者姓名： | 曾泳泓 |
| |
| 作者单位： | 国防科技大学系统工程与数学系 |
| |
| 摘 要： | 本文把长为N=N_1N_2(N_1为奇数)的离散Hartley变换(DHT)分解成N_1个长N_2的DHT及一些附加运算,附加运算也可以变成N_2个长N_1的DHT。由此得到计算它的一种MIMD并行算法,若用N_1台处理机并行计算,只需(?)个乘法步和(?)个加法步,这里M(N_2)和A(N_2)分别表示计算一个长N_2的DHT所需的乘法数及加法数。并行机的有效利用率接近于1。
|
| 关 键 词： | 离散Hartley变换(DHT) 并行算法 快速算法 |
| 收稿时间： | 1992-04-16 |
A MIMD Parallel Algorithm for Discrete Hartley Transform |
| |
| Zeng Yonghong. A MIMD Parallel Algorithm for Discrete Hartley Transform[J]. Journal of National University of Defense Technology, 1993, 15(4): 103-108 |
| |
| Authors: | Zeng Yonghong |
| |
| Affiliation: | Department of System Engineering and Mathamatics |
| |
| Abstract: | This paper turns a discrete Hartley transform (DHT) of length N=N_1N_2 (N_1 isodd) into N_1 DHT's of length N_2 and some additional operations. The additional opera-tions can also be turned to N_2 DHT's of length N_1. Therefore, a MIMD parallel algo-rithm is obtained. If N_1 processors are available, M (N_2)+1/2N+3/2N_2-2 multiplicationsteps and A M(N_2)+1/2N+5/2N_2-1 addition steps are enough for computing a DHT oflength N=N_1N_2, where M (N_2) and A (N_2) represent the number of multiplications andadditions for a DHT of length N_2 respectively. The efficiency of the parallel algorithmwith respect to itself is approximately 1. |
| |
| Keywords: | discrete Hartley transform (DHT) parallel algorithm fast algorithm |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《国防科技大学学报》浏览原始摘要信息 |
|
点击此处可从《国防科技大学学报》下载全文 |
