Abstract
A prime factor fast algorithm for the type-II generalised discrete Hartley transform is presented. In addition to reducing the number of arithmetic operations and achieving a regular computational structure, a simple index mapping method is proposed to minimise the overall implementation complexity.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have