A prime factor fast algorithm for the type-II generalised discrete Hartley
transform is presented. In addition to reducing the number of arithmetic op
erations and achieving a regular computational structure, a simple index ma
pping method is proposed to minimise the overall implementation complexity.