Novel fixed-point roundoff analysis of the decimation-in-time FHT

A least upper bound for the increasing factor of the magnitude of the decimation-in-time fast Hartley transform (FHT) in fixed-point arithmetic is developed and a new scaling model for the roundoff analysis in the fixed-point arithmetic computation is proposed. In this new scaling model, the input data for each computing stage of the decimation-in-time FHT only need to be divided by a constant of 2, and this can prevent overflow successfully. Hence, the novel approach would result in a higher noise-to-signal ratio for the fixed-point computation of FHT