| 子群卷积及其快速算法 |
| |
| 引用本文： | 沈乃汉.子群卷积及其快速算法[J].南京邮电大学学报(自然科学版),1987(1). |
| |
| 作者姓名： | 沈乃汉 |
| |
| 摘 要： | 本文介绍了长度N=P~M-1为麦森素数的子群卷积的基本原理和应用中国余数定理对这种子群卷积进行排序的算法及步骤。改进了这种排序方法,提出了计算简单的快速排序法,并提出了用于群卷积计算DFT的混合嵌套快速算法。
|
| 关 键 词： | 快速卷积 快速算法 子群 莫森数 |
Subgroup Convolution and its Fast Algorithm |
| |
| Shen Naihan.Subgroup Convolution and its Fast Algorithm[J].Journal of Nanjing University of Posts and Telecommunications,1987(1). |
| |
| Authors: | Shen Naihan |
| |
| Institution: | Shen Naihan |
| |
| Abstract: | In this dissertation, we describe fundamental principle of subgroup convolution for length N=P~M-1 being prime Mersenne number, and describe algorithm and step by which the subgroup convolution is ordered with Chinease remainder theorem. The ordering method is improved and a kind of simple fast ordering method for calculation is proposed. Futhermore, a kind of fast algorithm of hybrid nesting of using the subgroup convolution to compute DFT is proposed. |
| |
| Keywords: | Fast convolution Fast algorithm Subgroup Mersenne number |
| 本文献已被 CNKI 等数据库收录！ |
