New radix-3 FHT algorithm
N. Anupindi, Subramanian Narayanan, K.M.M. Prabhu · Electronics Letters · 1990
An efficient radix-3 fast Hartley transform (FHT) algorithm is introduced. The usual decomposition formula for a radix-3 FHT case is modified, resulting in less computations. It is useful in cases where the sequence length is closer to a power of 3 than a power of 2.