• Economic and Environmental Geology
• /
• v.27 no.1
• /
• pp.41-47
• /
• 1994

A fast Hankel transform (FHT) algorithm (Anderson, 1982) is applied to numerical evaluation of many Green's tensor integrals encountered in three-dimensional electromagnetic modeling using integral equations. Efficient computation of Hankel transforms is obtained by a combination of related and lagged convolutions which are available in the FHT. We express Green's tensor integrals for a layered half-space, and rewrite those to a form of related functions so that the FHT can be applied in an efficient manner. By use of the FHT, a complete or full matrix of the related Hankel transform can be rapidly and accurately calculated for about the same computation time as would be required for a single direct convolution. Computing time for a five-layer half-space shows that the FHT is about 117 and 4 times faster than conventional direct and multiple lagged convolution methods, respectively.

• Korean Journal of Breeding Science
• /
• v.40 no.4
• /
• pp.422-429
• /
• 2008

In this work, we analyzed the activity of control enzymes of flower color biosynthesis, chalcone synthase (CHS) and flavanone 3-hydroxylase (FHT) using biochemical and enzymological methods in Lilium longiflorum and 11 Lilium cultivars. The results obtained are as follows ; Naringenin (NAR) was synthesized in all Lilium cultivars tested by the catalytic activity of CHS which used malonyl-CoA and 4-coumaryol-CoA as substrates. Substrate-specific activity of CHS was observed because eridictiol (ERI), which uses caffeoyl-CoA as a substrate, was not detected in tested cultivars. In next step, dihydroflavone product was synthesized by FHT using flavanones as a substrate. FHT synthesized dihydrokaempferol (DHK) by using NAR as substrates. A remarkable activity of FHT was observed in other 11 cultivars.

• Journal of Plant Biotechnology
• /
• v.33 no.2
• /
• pp.85-91
• /
• 2006

Flavanone 3$\beta$-hydroxylase (FHT) is an enzyme acting in the central part of the flavonoid biosynthesis pathway. FHT catalyses the hydroxylation of flavanone to dihydroflavonols in the anthocyanin pathway. In this paper we describe the cloning and expression of the genes encoding the flavonoid-biosynthetic enzyme FHT in Gypsophila paniculata L. A heterologous cDHA probe from Dianthus cavophyllus was used to isolate FHT-encoding cDHA clones from Gypsophila paniculata L.. Inspection of the 1471 bp long sequence revealed an open reading frame 1047 bp, including a 190 bp 5' leader region and 288 bp 3' untranslated region. Comparison of the coding region of this FHT cDHA sequence including the sequences of Arabidopsis thaliana, Citrus sinensis, Dianthus caryophyllus, Ipomoea batatas, Matthiola incana, Nierembergia sp, Petunia hybrida, Solanum tuberosum, Vitis vinifera reveals a identity higher than 69% at the nucleotide level. The function of this nucleotide sequences were verified by comparison with amino acid sequences of the amino-terminus and tryptic peptides from purified plant enzyme, by northern blotting with mRHA from wild type and mutant plants, by in vitro expression yielding and enzymatically active hydroxylase, as indicated by the small dihydrokaempferol peak. Genomic southern blot analysis showed the presence of only one gene for FHT in Gypsophila paniculata.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.1A
• /
• pp.43-50
• /
• 2012

The use of an error-correcting code is essential in digital communication systems where the channel is noisy. Unless a receiver has accurate channel coding parameters, it becomes difficult to decode the digitized encoding bits correctly. In this paper, estimation algorithm for RM(Reed-Muller) codes using FHT (Fast Hadamard algorithm) is proposed. The proposed algorithm estimates the channel coding parameters of RM codes and then decodes the codes using the characteristic of FHT. And we also verify the algorithm by performing intensive computer simulation in additive white gaussian noise (AWGN) channel.

• 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.

• 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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.8A
• /
• pp.898-908
• /
• 2004

In this paper, we propose a high speed preamble searcher feasible for RACH(Random Access Channel) preamble structure in WCDMA reverse link receiver. Unlike IS-95, WCDMA system uses AISMA(Acquisition Indication Sense Multiple Access) process. Because of the time limit between RACH preamble transmission and AI(Acquisition Indicators), and the restriction on the number of RACH signatures assigned to RACH preamble, fast acquisition indication is required for efficient operation. The preamble searcher proposed in this paper is based on 2-antenna system and has adopted FHT algorithm that has the radix-2 16 point FFT structure. The acquisition speed using FHT is 64 times faster than the conventional method that correlates each signature. Based on their fast aquisition scheme, we improved the acquisition performance by calculating the correlation up to the 4096 chips of the total preamble length. The performance is analyzed by using Neyman-pearson method. The proposed algorithm has been applied for the implementation of WCDMA reverse link receiver modem successfully.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.31 no.1
• /
• pp.53-61
• /
• 2018

Ballast track requires constant maintenance work due to progress of track irregularity. Fast Hardening Track(FHT) has been developed to reduce the maintenance effort done by injecting fast hardening mortar in aged ballast to convert slab track. For the application of FHT to a railway bridge, post-installed anchors should be placed at center of the track segment to fix it on bridge. This paper presents track-bridge interaction analysis results with FHT considering stiffness and strength of post-installed anchor, age of FHT concrete and friction between FHT and bridge deck surface. Based on the analysis results, this study suggests when is good to install the anchors and allow normal operation of passing train.

• 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.

• 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.