• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1988년도 추계학술대회 논문집 학회본부
• /
• 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.

• 대한전기학회논문지
• /
• 제39권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.

• 약학회지
• /
• 제35권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.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1987년도 전기.전자공학 학술대회 논문집(II)
• /
• 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.

• 한국측량학회지
• /
• 제16권1호
• /
• pp.17-26
• /
• 1998

본 논문은 Fast Hartley Transform 기법을 소개하고 이를 이용하여 한반도 주변의 지오이드를 결정하기 위한 것이다. 본 연구에서 사용한 중력 측정 데이터는 69,001점으로 남한지역과 BGI로부터 획득한 해상중력데이터로 구성하였으며, 북한쪽은 회기분석에 의하여 $1km\times{1km}$ 격자 간격으로 추정하였다. 지오이드의 결정을 위하여 96년에 발표된 EGM96 포텐셜모델을 채택하여 차수 360까지 계산하여 장 파장효과를 구하였고, FHT기법을 적용하여 중력데이터로부터 중 파장효과를 계산하여 이들 두 효과를 합하여 최종 지오이드면을 결정하였다. 본 연구를 통하여 얻어진 지오이드고를 GPS/Leveling에 의하여 구한 지오이드고와 비교한 결과 표준편차가 약 33 cm 이었다.

• 대한전기학회논문지
• /
• 제40권6호
• /
• pp.551-561
• /
• 1991

The probabilistic generation simulation plays a key role in power system expansion and operational planning especially for the calculation of expected energy, loss of load probaility and unserved energy expected. However, it is crucial to develop a probabilistic generation simulation algorithm which gives sufficiently precise results within a reasonable computation time. In a previous paper, we have proposed an efficent method using Fast Hartley Transform in convolution process for considering the thermal and nuclear units. In this paper, a method considering the scheduling of pumped-storage plants and hydro plants with energy constraint is proposed. The method also adopts FHT techniques. We improve the model to include multi-state and multi-block generation. The method has been applied for a real size model system.