| 引用本文: | 曾泳泓.离散 Hartley 变换的 MIMD 并行算法.[J].国防科技大学学报,1993,15(4):103-108.[点击复制] |
| Zeng Yonghong.A MIMD Parallel Algorithm for Discrete Hartley Transform[J].Journal of National University of Defense Technology,1993,15(4):103-108[点击复制] |
|
| |
|
|
| 本文已被：浏览 5689次 下载 6382次 |
| 离散 Hartley 变换的 MIMD 并行算法 |
| 曾泳泓 |
|
(系统工程与数学系)
|
| 摘要: |
| 本文把长为 N=N1N2(N1为奇数)的离散 Hartley 变换(DHT)分解成 N1个长N2 的 DHT 及一些附加运算，附加运算也可以变成N2个长N1的 DHT。由此得到计算它的一种 MIMD 并行算法，若用N1台处理机并行计算，只需 M (N2)+N/2+3/2 N2?2个乘法步和A(N2)+N/2+5/2 N2?1个加法步，这里M(N2)和A（N2）分别表示计算的一个长N2的 DHT 所需的乘法数及加法数。并行机的有效利用率接近于1。 |
| 关键词: 离散 Hartley 变换（DHT)，并行算法，快速算法 |
| DOI： |
| 投稿日期：1992-04-16 |
| 基金项目: |
|
| A MIMD Parallel Algorithm for Discrete Hartley Transform |
| Zeng Yonghong |
|
(Department of System Engineering and Mathematics)
|
| Abstract: |
| This paper turns a discrete Hartley transform (DHT) of length N=N1N2 (N1 is odd) into N1 DHT's of length N2 and some additional operations. The additional operations can also be turned to N2 DHT's of length N1. Therefore，a MIMD parallel Algo-rithm is obtained. If N1 processors are available,M(N2)+1/2N+3/2 N2?2 multiplication steps and A (N2)+1/2N+5/2N2?1 addition steps are enough for computing a DHT of length N=N1N2, where M(N2) and A(N2) represent the number of multiplications and additions for a DHT of length N2 respectively. The efficiency of the parallel algorithm with respect to itself is approximately 1. |
| Keywords: discrete Hartley transform (DHT),parallel algorithm,fast algorithm |
|
|
