共查询到20条相似文献,搜索用时 0 毫秒
1.
Efficient algorithms for the fast computation of 2D and 3D discrete Hartley transforms have been proposed. It is shown that the proposed algorithms offer a significant saving in computation over the existing methods for various array sizes.<> 相似文献
2.
A relationship between the discrete cosine transform (DCT) and the discrete Hartley transform (DHT) is derived. It leads to a new fast and numerically stable algorithm for the DCT. 相似文献
3.
A new fast algorithm is proposed to compute the discrete Hartley transform (DHT) via the Walsh?Hadamard transform (WHT). The processing is carried out on an interframe basis in (N × N) data blocks, where N is an integer power of two. The WHT coefficients are obtained directly, and then used to obtain the DHT coefficients. This is achieved by a transform matrix, the H-transform matrix, which is ortho-normal and has a block-diagonal structure. A complete derivation of the block-diagonal structure for the H-transform matrix is given. 相似文献
4.
Prabhu K.M.M. Shanmuga Sundaram R. 《Vision, Image and Signal Processing, IEE Proceedings -》1996,143(6):383-386
A new fast algorithm is proposed to compute pseudodiscrete Wigner-Ville distribution (PDWVD) in real-time applications. The proposed algorithm uses the moving discrete Hartley transform to compute the Hilbert transform and thereby implements the PDWVD in real domain. The computational complexity of the proposed algorithm is derived and compared with the existing algorithm to compute the PDWVD 相似文献
5.
The discrete Hartley transform is a new tool for the analysis, design and implementation of digital signal processing algorithms and systems. It is strictly symmetrical concerning the transformation and its inverse. A new fast Hartley transform algorithm has been developed. Applied to real signals, it is faster than a real fast Fourier transform, especially in the case of the inverse transformation. The speed of operation for a fast convolution can thus be increased. 相似文献
6.
Fast two-dimensional Hartley transform 总被引:3,自引:0,他引:3
《Proceedings of the IEEE. Institute of Electrical and Electronics Engineers》1986,74(9):1282-1283
The fast Hartley transform algorithm introduced in 1984 offers an alternative to the fast Fourier transform, with the advantages of not requiring complex arithmetic or a sign change of i to distinguish inverse transformation from direct. A two-dimensional extension is described that speeds up Fourier transformation of real digital images. 相似文献
7.
Based on a decimation-in-time decomposition, a fast split-radix algorithm for the 2D discrete Hartley transform is presented. Compared to other reported algorithms, the proposed algorithm achieves substantial savings on the number of operations and provides a wider choice of transform sizes 相似文献
8.
9.
Recently, R.N. Bracewell (1983) introduced the discrete Hartley transform (DHT) as an alternative to the discrete Fourier transform (DFT). Two linear systolic array models for the (DHT) are derived. One model requires O (2N -1) in the computational phase and O (N ) in the preloading phase. The other model requires O (2N -1) in the computational phase and O (N ) in the output phase. A square systolic array for two-dimensional DHT is also constructed by combining the individual advantages of each model. The CORDIC algorithm is proposed as an alternative to conventional multipliers. To speed up the systolic array, two-level pipelining with CORDIC is also possible 相似文献
10.
Guoan Bi Chao Lu 《Electronics letters》1999,35(20):1708-1710
A prime factor fast algorithm for the type-II generalised discrete Hartley transform is presented. In addition to reducing the number of arithmetic operations and achieving a regular computational structure, a simple index mapping method is proposed to minimise the overall implementation complexity 相似文献
11.
The use of fast Hartley transform for fast discrete interpolation is considered. The computational method uses the sprit-radix algorithm which requires the least number of operations compared with other Hartley algorithms. Results from this method are compared with those using the fast Fourier transform. 相似文献
12.
New split-radix algorithm for the discrete Hartley transform 总被引:2,自引:0,他引:2
This paper presents a split-radix algorithm that can flexibly compute the discrete Hartley transforms of various sequence lengths. Comparisons with previously reported algorithms are made in terms of the required number of additions and multiplications. It shows that the length-3*2m DHTs need a smaller number of multiplications than the length-2m DHTs. However, they both require about the same computational complexity in terms of the total number of additions and multiplications. Optimized computation of length-12, -16 and -24 DFTs are also provided 相似文献
13.
Comments on "Generalized discrete Hartley transform" 总被引:2,自引:0,他引:2
Zhongde Wang 《Signal Processing, IEEE Transactions on》1995,43(7):1711-1712
The author comments on the paper by Hu et al. (IEEE Trans. Signal Processing, vol.40, no.12, p.2951-60, 1992). Information is provided about prior published work that precedes the transforms and convolution procedures defined in the above paper.<> 相似文献
14.
A new split radix fast algorithm for the discrete Hartley transform is presented. Comparisons with other reported algorithms are made in terms of the number of additions and multiplications. The algorithm is also simple and straightforward and can be easily implemented 相似文献
15.
本文提出一种FFT新算法,其计算量不大于现有的各种基2DFT算法.然后,与Winograd小DFT(4,8,16点)结合使用,得出一种计算DFT的最快速算法. 相似文献
16.
Dekun Yang 《Electronics letters》1989,25(25):1705-1706
A new fast algorithm for computing the two-dimensional discrete Hartley transform is presented. This algorithm requires the lowest number of multiplications compared with other related algorithms.<> 相似文献
17.
Vector-radix algorithm for a 2-D discrete Hartley transform 总被引:2,自引:0,他引:2
A new multidimensional Hartley transform is defined and a vector-radix algorithm for fast computation of the transform is developed. The algorithm is shown to be faster (in terms of multiplication and addition count) compared to other related algorithms. 相似文献
18.
The authors propose a new prime factor mapping scheme, which requires no extra arithmetic operations for the realization of prime factor mapping, for the computation of the discrete Hartley transform (DHT). It is achieved by embedding all the extra arithmetic operations into the subsequent short-length computations, with the computational complexities of these embedded short lengths remaining unchanged. Consequently, the present approach significantly eliminates the burden which is introduced by the extra arithmetic operations. With this mapping scheme, it is further demonstrated that a prime-factor-mapped DHT would have superb performance compared with other fast DHT algorithms 相似文献
19.
Meher P.K. Srikanthan T. Patra J.C. 《IEEE transactions on circuits and systems. I, Regular papers》2006,53(5):1065-1077
In this paper, we present a design framework for scalable memory-based implementation of the discrete Hartley transform (DHT) using simple and efficient systolic and systolic-like structures for short and prime transform lengths, as well as, for lengths 4 and 8. We have used the proposed short-length structures to construct highly modular architectures for higher transform lengths by a new prime-factor implementation approach. The structures proposed for the prime-factor DHT, interestingly, do not involve any transposition hardware/time. Besides, it is shown here that an N-point DHT can be computed efficiently from two (N/2)-point DHTs of its even- and odd-indexed input subsequences in a recursive manner using a ROM-based multiplication stage. Apart from flexibility of implementation, the proposed structures offer significantly lower area-time complexity compared with the existing structures. The proposed schemes of computation of the DHT can conveniently be scaled not only for higher transform lengths but also according to the hardware constraint or the throughput requirement of the application. 相似文献
20.
It is shown that an N point type I odd discrete cosine transform can be reformulated as a (2N-1) point DFT of a real-symmetric sequence efficiently computed by the real-symmetric PFA-FFT. Using simple index mappings, the type II and III ODCTs are efficiently computed from the ODCT-1 of the same length. The ODCT-IV are then computed from ODCT-II or III using simple recurrence formulas.<> 相似文献