Comparative study of time efficiency of several algorithms for discrete W transform and discrete Hartley transform

Subroutines for several algorithms for the computation of the discrete W transform and the discrete Hartley transform are implemented in a YNC-M240D computer for testing of their time efficiency. Results show that the subroutines for the fast W transform algorithm reported recently are more efficient than subroutines for radix-2, radix-4 and the split radix fast Hartley transform algorithms.