SOO-CHANG PEIJaw, Sy-BeenSy-BeenJaw2009-03-042018-07-062009-03-042018-07-06199601651684http://ntur.lib.ntu.edu.tw//handle/246246/142439https://www.scopus.com/inward/record.uri?eid=2-s2.0-0029734274&doi=10.1016%2f0165-1684%2895%2900129-8&partnerID=40&md5=109da4e5f522f445f1975bff463872a7This paper presents two Fortran programs that calculate the mixed radix discrete Hartley transform (DHT) using a general odd length p-point DHT module and several short length Winograd DHT (WDHT) modules. Each program has its own advantages such as simplicity for implementation or minimum arithmetic complexity. New efficient radix-3, odd radix-p FHT algorithms and short WDHT modules have been developed to be incorporated into a general FHT algorithm. It allows a much wider selection of transform sizes, and calculates the DHT in order.application/pdf877668 bytesapplication/pdfen-USFast algorithm; Hartley transform; Mixed radixAlgorithms; Efficiency; Mathematical transformations; FORTRAN 4460068; Harley transforms; Computer softwarejournal article2-s2.0-0029734274http://ntur.lib.ntu.edu.tw/bitstream/246246/142439/1/27.pdf