A novel scaling scheme for fast Hartley transform
Resource
Signal Processing 34 (1): 123-129
Journal
Signal Processing
Journal Volume
34
Journal Issue
1
Pages
123-129
Date Issued
1993
Date
1993
Author(s)
Abstract
This paper presents some results on fixed-point error analysis of the fast Hartley transform algorithms. A novel scheme for preventing overflow is considered in the analysis. It is proved that error performance, defined based on the signal-to-noise ratio, can be improved for both the decimation-in-frequency and the decimation-in-time fast Hartley transform algorithms. © 1993.
Subjects
Discrete Hartley transform; error analysis; fixed-point arithmetic; round-off error
Other Subjects
Error analysis; Fourier transforms; Discrete Hartley transform; Error performance; Fixed point arithmetic; Round off error; Mathematical transformations
Type
journal article
File(s)![Thumbnail Image]()
Loading...
Name
06.pdf
Size
354.99 KB
Format
Adobe PDF
Checksum
(MD5):64b648879831aa34cd91dcddc8dbd4eb