A fast algorithm for computing the discrete Hartley transform of a real-symmetric data sequence is introduced. The number of computations required is significantly less than that required by the usual split-radix fast Hartley transform. © 1990, The Institution of Electrical Engineers. All rights reserved.