Abstract：Some practical applications indicate that in real,sequence data processing，discrete Hartley transform (DHT) is not only equivalent to Fourier transform but also more effective and economic than Fourier transform. From the point of algebra，a block decomposition formula for coefficient matrix of discrete Hartley transform is given，from which a new fast DHT recursive algorithm is derived. As to the DHT calculation of N=2t real sequence，the arithmetic complexity is 1/2Nlog2N+O(N) real multiplication and 1/6Nlog2N+O(N) real addition，which means a new algorithm involving the least operation.
