In a recent paper, Lun and Siu describe a method of computing prime factor decomposed discrete Hartley transform (DHT) over N points with 2N less additions compared to the existing algorithms of Bracewell and Sorensen. In this correspondence, we show how the method of Lun and Siu can be extended to eliminate the 2N extra additions in the algorithms of Bracewell and Sorenson.
ASJC Scopus subject areas
- Signal Processing
- Electrical and Electronic Engineering