The fast algorithm for discrete Hartley transform of the speciallength 31 is presented in this paper. It is a recurS10n algorithm of discrete Hartley transform m which the length 31 is turned mto the length 3/- 1• The structure lS slmpler and arithmet1c operatlOns are fewer than those ofother known algorithms.