• Proceedings of the KIEE Conference
• /
• 1988.07a
• /
• pp.14-16
• /
• 1988

With the development of VLSI technology, research on special processors for high-speed processing is on the increase and studies are focused on designing VLSI-oriented processors for signal processing. This paper processes a one-dimensional systolic array for Discrete Hartley Transform implementation and also processes processing element which is well described for algorithm. The discrete Hartley Transform(DHT) is a real-valued transform closely related to the DFT of a real-valued sequence can be exploited to reduce both the storage and the computation requried to produce the transform of real-valued sequence to a real-valued spectrum while preserving some of the useful properties of the DFT is something preferred. Finally, the architecture of one-dimensional 8-point systolic array, the detailed diagram of PE, total time units concept on implementation this arrays, and modularity are described.

• Journal of Information Processing Systems
• /
• v.8 no.1
• /
• pp.85-100
• /
• 2012

The Hartley transform based feature extraction method is proposed for fingerprint matching. Hartley transform is applied on a smaller region that has been cropped around the core point. The performance of this proposed method is evaluated based on the standard database of Bologna University and the database of the FVC2002. We used the city block distance to compute the similarity between the test fingerprint and database fingerprint image. The results obtained are compared with the discrete wavelet transform (DWT) based method. The experimental results show that, the proposed method reduces the false acceptance rate (FAR) from 21.48% to 16.74 % based on the database of Bologna University and from 31.29% to 28.69% based on the FVC2002 database.

• Proceedings of the KIEE Conference
• /
• 1988.11a
• /
• pp.131-134
• /
• 1988

This Paper describes a algorithm for evaluating the loss of load probability of a generating system using Fast Hartley Transform. The Fast Hartley Transform(FHT) Is as fast as or faster than the Fast Fourier Transform(FHT) and serves for all the uses such as spectral, digital processing and convolution to which the FFT is at present applied. The method has been tested by applying to IEEE reliability test system and the effectiveness is demonstrated.

• Journal of the Optical Society of Korea
• /
• v.20 no.1
• /
• pp.42-54
• /
• 2016

A hybrid color and grayscale images encryption scheme based on the quaternion Hartley transform (QHT), the two-dimensional (2D) logistic map, the double random phase encoding (DRPE) in gyrator transform (GT) domain and the three-step phase-shifting interferometry (PSI) is presented. First, we propose a new color image processing tool termed as the quaternion Hartley transform, and we develop an efficient method to calculate the QHT of a quaternion matrix. In the presented encryption scheme, the original color and grayscale images are represented by quaternion algebra and processed holistically in a vector manner using QHT. To enhance the security level, a 2D logistic map-based scrambling technique is designed to permute the complex amplitude, which is formed by the components of the QHT-transformed original images. Subsequently, the scrambled data is encoded by the GT-based DRPE system. For the convenience of storage and transmission, the resulting encrypted signal is recorded as the real-valued interferograms using three-step PSI. The parameters of the scrambling method, the GT orders and the two random phase masks form the keys for decryption of the secret images. Simulation results demonstrate that the proposed scheme has high security level and certain robustness against data loss, noise disturbance and some attacks such as chosen plaintext attack.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.39 no.4
• /
• pp.341-348
• /
• 1990

This paper describes an algorithm for evaluating the Loss of Load Probability (LOLP) and calculating the production cost for all the generators in the system using Fast Hartley Transform (FHT). It also suggests the deconvolution procedure which is necessary for the generation expansion planning. The FHT is as fast as or faster than the Fast Fourier Transform (FFT) and serves for all the uses such as spectral, digital processing, and convolution to which the FFT is normally applied. The transformed function using FFT has complex numbers. However, the transformed function using FHT has real numbers and the convolution become quite simple. This method has been applied for the IEEE reliability test system and practical size model system. The test results show the effectiveness of the proposed method.

• YAKHAK HOEJI
• /
• v.35 no.1
• /
• pp.1-6
• /
• 1991

Fast Hartley transform(FHT) was used for the identification of derivative UV spectra of pharmaceuticals, with the advantages of relatively shorter computing time of FHT and more precise results. The arccosine value of dot product of two vectors of normalized FHT coefficients calculated from two compared derivative spectra was a reasonable parameter for the spectral identification. Using this parameter, the similar patterns of derivative spectra of 13 penicillins can be differenciated from each other. The concentration difference and the minor contamination did not interfere the results of identification procedures. All these procedures of identification were accomplished successfully by the computer program, [SPECMAN PLUS] version 1.30, which was developed for this article.

• ETRI Journal
• /
• v.37 no.1
• /
• pp.32-42
• /
• 2015

Orthogonal frequency-division multiplexing (OFDM) suffers from spectral nulls of frequency-selective fading channels. Linear precoded (LP-) OFDM is an effective method that guarantees symbol detectability by spreading the frequency-domain symbols over the whole spectrum. This paper proposes a computationally efficient and low-cost implementation for discrete Hartley transform (DHT) precoded OFDM systems. Compared to conventional DHT-OFDM systems, at the transmitter, both the DHT and the inverse discrete Fourier transform are replaced by a one-level butterfly structure that involves only one addition per symbol to generate the time-domain DHT-OFDM signal. At the receiver, only the DHT is required to recover the distorted signal with a single-tap equalizer in contrast to both the DHT and the DFT in the conventional DHT-OFDM. Theoretical analysis of DHT-OFDM with linear equalizers is presented and confirmed by numerical simulation. It is shown that the proposed DHT-OFDM system achieves similar performance when compared to other LP-OFDMs but exhibits a lower implementation complexity and peak-to-average power ratio.

• Proceedings of the KIEE Conference
• /
• 1989.11a
• /
• pp.194-196
• /
• 1989

The production costing plays a key role in power system expansion and operations planning especially for the calculation of expected energy, loss of load probability and unserved energy. Therefore, it is crucial to develope a probabilistic production costing algorithm which gives sufficiently precise results within a reasonable computational time. In this respect, a number of methods of solving production simulation have been proposed. In previous paper we proposed the method used Fast Hartley Transform in convolution process with considering only the thermal units. In this paper, the method considering the scheduling of pumped-storage plants and hydro plants with energy constraints is proposed.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.16 no.1
• /
• pp.17-26
• /
• 1998

This paper deals with gravimetric geoid determination by Fast Hartely transform (FHT) technique in and around the Korean peninsula. A number of data files were compiled for this work, containing now more than 69, 001 point gravity data on land and ocean areas. Especially, regression was applied to estimate gravity anomalies in the northern area of peninsula. For evaluating accuracy of geoid obtained, GPS/Leveling data of 49 stations were prepared. EGM96 global geopotential model to degree 360 was used in order to determine the long wavelength effect of geoid undulations. By applying the remove-restore technique geoid undulations were determined by combining a geopotential model, free-air gravity anomalies. Fast Hartley Transform technique is a suitable solution that uses the advanced spectral technique on the sphere. It was applied to predict geoid undulations by Stokes's integral. Accuracy of geoid undulations was evaluated by comparing with results derived from GPS/Leveling. Standard deviation of differences is about 33 cm.

• Proceedings of the KIEE Conference
• /
• 1987.07b
• /
• pp.1188-1190
• /
• 1987

Recently, new fast transform (such as discrete Hartley Transform) have been proposed which are best suited for the computation of real sequence. Two approaches using Fourier or Hartley transform are first compared. This paper is treated real sequence, compared number of addition of cyclic convolution with using the FFT and FHT the convolution technique is defined as a separating system impulse response to the given input and output of the system.