Journal ArticleDOI
Fixed-point error analysis of fast Hartley transform
K.M.M. Prabhu,S.B. Narayanan +1 more
TLDR
In this paper, a fixed-point error analysis has been carried out for the fast Hartley transform (FHT) and the results are compared with the FFT error-analysis results.About:
This article is published in Signal Processing.The article was published on 1990-03-01. It has received 11 citations till now. The article focuses on the topics: Hartley transform & Discrete Hartley transform.read more
Citations
More filters
Journal ArticleDOI
On the fixed-point-error analysis of several fast DCT algorithms
Il Dong Tun,Sang Uk Lee +1 more
TL;DR: It is found that the fixed-point-error characteristics of the row-column approach for 2D DCTs is very similar to that of their 1D counterparts, which shows one of the algorithms is better than others in terms of average SNR performance.
Journal ArticleDOI
Comparative performance of fast cosine transform with fixed-point roundoff error analysis
Chau-Yun Hsu,Jui Chi Yao +1 more
TL;DR: Suitable scaling schemes are chosen for the Lee's and the Hou's fast DCT algorithms, and the relative fixed-point roundoff error analyses are carried out, and it is shown that in DCT and for N>16 stage-by-stage scaling of Hou's algorithm has the best performance, whereas in inverse DCT, the global scaling of either algorithms has thebest performance.
Journal ArticleDOI
On the fixed-point error analysis of several fast IDCT algorithms
Il Dong Yun,Sang Uk Lee +1 more
TL;DR: In this article, a fixed-point error analysis for well-known fast l-D IDCT algorithms, such as Lee, Hou, and Vetterli, is presented.
Journal ArticleDOI
Fixed-point round-off error analysis for the discrete cosine transform
Jui Chi Yao,Chau-Yun Hsu +1 more
TL;DR: A relationship between the range of the twiddle factor and the dimension of the discrete cosine transform is first derived, whence a suitable scaling model is chosen for the DCT algorithm and the average output signal-to-noise ratio is calculated.
Journal ArticleDOI
Fast Hartley transform implementation on DSP chips
TL;DR: Efficient implementation of the FHT on different DSP processors is considered, instead of counting the required arithmetic operations, the necessary number of instruction cycles for an implementation of FHT is used as a measure.
References
More filters
Journal ArticleDOI
Improved Fourier and Hartley transform algorithms: Application to cyclic convolution of real data
Pierre Duhamel,Martin Vetterli +1 more
TL;DR: An algorithm for the in-place computation of the discrete Fourier transform on real data: a decimation-in-time split-radix algorithm, more compact than the previously published one and a new fast Hartley transform algorithm with a reduced number of operations.
Journal ArticleDOI
Fast Hartley transform algorithm
Hans-Jurgen Meckelburg,D. Lipka +1 more
TL;DR: The discrete Hartley transform as mentioned in this paper is a new tool for the analysis, design and implementation of digital signal processing algorithms and systems, which is strictly symmetric concerning the transformation and its inverse.
Journal ArticleDOI
Split-radix fast Hartley transform
Soo-Chang Pei,Ja-Ling Wu +1 more
TL;DR: The split radix was used to develop a fast Hartley transform algorithm, it is performed ''in-place?, and requires the lowest number of arithmetic operations compared with other related algorithms'' as discussed by the authors.
Journal ArticleDOI
Structured fast Hartley transform algorithms
C.P. Kwong,K. Shiu +1 more
TL;DR: A decimation-in-frequency algorithm with a similar flowgraph is obtained that is identical to that of another FHT algorithm recently proposed.
Journal ArticleDOI
Some Results in Fixed-Point Fast Fourier Transform Error Analysis
Sundaramurthy,Reddy +1 more
TL;DR: The results show that the error performance of the decimation-in-frequency algorithm is better than that of decimation -in-time, and two kinds of schemes for preventing overflow are considered in the analysis.
Related Papers (5)
Effects of finite register length in digital filtering and the fast Fourier transform
Alan V. Oppenheim,C. Weinstein +1 more
Method for high-resolution audio frequency measurement based on FFT (Fast Fourier Transform)
Xu Jian,Zhu Weiguo +1 more