一种特殊长度的离散Hartley变换的快速算法

The Fast Algorithm for Discrete Hartley Transform of the Special Length

对特殊长度 3l 的离散 Hartley变换提出一种新快速算法 ,这是一种将长度 3l 转换为长度3l-1的离散 Hartley变换的递归算法 ,和目前已知的其它算法相比较 ,结构更简单 ,运算量也更少。

The fast algorithm for discrete Hartley transform of the special length 3l is presented in this paper.It is a recursion algorithm of discrete Hartley transform in which the length 3l is turned into the length 3l-1.The structure is simpler and arithmetic operations are fewer than those of other known algorithms.