Fast computation of discrete W transform through discrete Hartley transform (DHT)

摘要

A new algorithm is presented for the type-II, -III and -IV discrete W transforms which involves the simple conversion of a length-N discrete W transform into a length-N discrete Hartley transform. The total number of additional arithmetic operations introduced by the conversion is less than 5N.