Abstract
The flowgraph originally proposed for the computation of the radix-2 fast Hartley transform (FHT) is restructured for clarity and ease of implementation with hardware and software. By applying the transposition theorem to the newly formed flowgraph (which corresponds to a decimation-in-time algorithm), a decimation-in-frequency algorithm with a similar flowgraph is obtained. The number of operations for the two algorithms is the same because of an existing symmetry, which is also identical to that of another FHT algorithm recently proposed.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
