快速Hartley变换在实时相关器中的应用

快速Ｈａｒｔｌｅｙ变换（ＦＨＴ）是离散Ｈａｒｔｌｅｙ变换（ＤＨＴ）的快速算法，它是一种实序的变换，其正反变换具有完全相同的形式。利用ＦＨＴ进行实数据相关可以避免复数运算，特别适用于采和可编程数字信号处理器（ＤＳＰ）来实现的实时相关器。和ＦＦＴ相关算法相比，在保持同样数据吞吐率的情况下，采用ＦＨＴ方法，可显著减少系统所需的高速存贮器，从而，可降低系统的成本。本文讨论了ＤＨＴ的有关性质和ＦＨＴ算法和运

Applying fast Hartley transform in real-time correlator

FHT (Fast Hartley transform ) represents a fast algorithm for discrcte Hartley transform (DHT ) applied to real sequences to avoid operations on complex numbers f which operatcs in much the same way in both the forward and inverse applications. It appears particularly appropriate for the real-time correlator using programmable digital signal precessor (DSP). Using FHT algorithm may lead to the significant reduction of the high-speed memory space and subsequently the operation cost with the same data throughput hold as compared to FFT algorithm. This paper intends to address itseIf to some properties of DHT, the amount of operations and the size of memory space necessary for the FHT algorithm.