Abstract
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. >
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
