Search - fast hartley transform

Search - fast hartley transform - List

[Compress-Decompress algrithms] HARTLEY.ZIP DL : 0: The frequency domain plays an important role in image processing to smooth, enhance, and detect edges of images. Although image data typically does not include imaginary values, the fast Fourier transform (FFT) has been used for obtaining spectra. In this paper, the fast Hartley transform (FHT) is used to transform two-dimensional image data. Because the Hartley transform is real valued, it does not require complex operations. Both spectra and autocorrelations of two-dimensional ultrasound images of normal and abnormal livers were computed.
Date : 2025-07-09 Size : 4kb User : archit
[Software Engineering] NEW_FHT DL : 0: 快速Hartley变换(简称FHT)的一种新算法-Fast Hartley Transform A new algorithm
Date : 2025-07-09 Size : 227kb User : aiaijie
[Algorithm] HartleyTransform DL : 0: The Fast Hartley Transform (FHT) implementation.
Date : 2025-07-09 Size : 1kb User : Nguyen Phu Binh
[SCM] Parallel-Implementation-of-Fast-Hartley-Transform DL : 0: Parallel Implementation of Fast Hartley Transform (FHT) in Multiprocessor Systems
Date : 2025-07-09 Size : 158kb User : vasso
[Other] THE-FAST-HARTLEY-TRANSFORM-ON-THE-HYPERCUBE-MULTI DL : 0: THE FAST HARTLEY TRANSFORM ON THE HYPERCUBE MULTIPROCESSORS
Date : 2025-07-09 Size : 256kb User : vasso
[Algorithm] two_dimensional_fast_hartley_transform_latest.tar DL : 0: RTL Verilog code to perform Two Dimensional Fast Hartley Transform (2D-FHT) for 8x8 points. Presented algorithm is FHT with decimation in frequency domain.
Date : 2025-07-09 Size : 12kb User : gollasantu
[Other] Fast-radix-2-algorithm DL : 0: 我们发现了一个新的更有效率的基-2算法可以用来计算Ⅱ型离散Hartley变换（序列长度为：N =2n时）。与现有的方法比较，这种递推方法计算次数相对减少，且更容易实现。同时也提出了一种新的更有效率的算法，可以使用两个相邻的DHT-Ⅱ序列（长度分别为N/2），来计算长度为 N的Ⅱ型DHT。-We found a new more efficient base- 2 algorithm can be used to calculate Ⅱ type discrete Hartley transform (sequence length is: N = 2 N). And the existing methods, the recursive method to calculate the relative frequency decrease, and easier to realize. At the same time also puts forward a new, more efficient algorithm, can use two adjacent DHT- Ⅱ sequence (length were N/2), to calculate the length is N Ⅱ type DHT.
Date : 2025-07-09 Size : 252kb User : 张鹏
[assembly language] two_dimensional_fast_hartley_transform_latest.tar DL : 0: VHDL/ Verilog program of fast hartley Transform. Includes testbenches and map/synth files
Date : 2025-07-09 Size : 12kb User : ahmed