| 引用本文: | 李均.一维长序列的多维处理.[J].国防科技大学学报,1982,(1):105-115.[点击复制] |
| Li Jun.Multidimensional Processing of Long One-dimensional Sequence[J].Journal of National University of Defense Technology,1982,(1):105-115[点击复制] |
|
| |
|
|
| 本文已被：浏览 4895次 下载 5195次 |
| 一维长序列的多维处理 |
| 李均 |
|
()
|
| 摘要: |
| 人们经常需要对一维长序列(数字信号)进行变换或卷积。如嫌序列太长，则可采用多维处理。本文列出几种常用的一维化多维的处理方法，并给出简明的处理步 骤。最后，提出一种 WFTA-FNT复合算法，充分利用了FNT 的简便性、快速性和精确性，而FNT在变换长度和字长较长时，输出模溢出而造成数值模糊的缺点，则由 WFTA 加以补偿。 |
| 关键词: |
| DOI： |
| 投稿日期：1981-09-15 |
| 基金项目: |
|
| Multidimensional Processing of Long One-dimensional Sequence |
| Li Jun |
| Abstract: |
| It is often necessary to perform a long one-dimensional sequence transformation or convolution. If the sequence is too long to process，the multidimensional techniques can be used. This article describes some methods of multidimensional processing to replace the method of one-dimensional processing，and gives out their distinct processing procedure. On the basis of this，this paper provides a compound algorithm WFTA-FNT，it takes good advantages of simplicity，speediness and accuracy of FNT，while the restriction on sequence length imposed by word length or the ambiguous representation of the output is avoided by WFTA. |
| Keywords: |
|
|
