论文部分内容阅读
本文提出了利用子群卷积计算长为(p~n-1)的Hartley变换的快速算法,利用这个新算法计算实值序列的DFT只需实数运算和实数存贮。
In this paper, we propose a fast algorithm for calculating the Hartley transform with length (p ~ n-1) using sub-group convolution. The DFT that uses this new algorithm to compute real-valued sequence only needs real number operation and real number storage.