• Journal of IKEEE
• /
• v.19 no.3
• /
• pp.378-384
• /
• 2015

In conventional HEVC inverse core transform architectures, extra $n{\times}n$ inverse transform block is added to $2n{\times}2n$ inverse transform block, and it operates as one $2n{\times}2n$ inverse transform block or two $n{\times}n$ inverse transform blocks. Thus, same number of pixels are processed in the same time, but it suffers from increased hardware size due to extra $n{\times}n$ inverse transform block. To avoid this problem, a novel $8{\times}8$ HEVC inverse core transform architecture was proposed to eliminate extra $4{\times}4$ inverse transform block based on multiplier reuse. This paper extends this approach and proposes a novel HEVC $16{\times}16$ inverse core transform architecture. Its frame processing time is same in $4{\times}4$, $8{\times}8$, and $16{\times}16$ inverse core transforms, and reduces gate counts by 13%.

• ETRI Journal
• /
• v.27 no.5
• /
• pp.511-524
• /
• 2005

In this paper, we propose a novel hardware architecture for an intra-prediction, integer transform, quantization, inverse integer transform, inverse quantization, and mode decision module for the macroblock engine of a new video coding standard, H.264. To reduce the cycle of intra prediction, transform/quantization, and inverse quantization/inverse transform of H.264, a reduction method for cycle overhead in the case of I16MB mode is proposed. This method can process one macroblock for 927 cycles for all cases of macroblock type by processing $4{\times}4$ Hadamard transform and quantization during $16{\times}16$ prediction. This module was designed using Verilog Hardware Description Language (HDL) and operates with a 54 MHz clock using the Hynix $0.35 {\mu}m$ TLM (triple layer metal) library.

• Proceedings of the Korean Geotechical Society Conference
• /
• 2003.03a
• /
• pp.249-256
• /
• 2003

To investigate the safety and stability of the concrete lining, numerous studies have been conducted over the years and several methods have been developed. Most signal processing method of NDT techniques has based on the Fourier analysis. However, the application of Fourier analysis to analyze recorded signal shows results only in frequency domain, it is not enough to analyze transient waves precisely. In this study, a new NDT technique .using the wavelet theory was employed for the analysis of non-stationary wave propagation induced by mechanical impact in the concrete lining. The wavelet transform of transient signals provides a method for mapping the frequency spectrum as a function of time. To verify the availability of wavelet transform as a time- frequency analysis tool, model experiments have been conducted on the concrete lining model. From this study, it was found that the contour map by Wavelet transform provides more distinct results than the power spectrum by Fourier transform and it was concluded that Wavelet transform was an effective tool for the experimental analysis of dispersive waves in concrete structures.

• 제어로봇시스템학회:학술대회논문집
• /
• 1997.10a
• /
• pp.1367-1370
• /
• 1997

This paper presents a vision algorithm for finding the centers of steam generator tubes using the generalized symmetry transform, which is used for ECT(Eddy Current Test) of steam generator tubes in nuclear power plants. The geometrical properties of the image representing steam generator tubes shows that they have amost circular or somewhat elliptic appearances and each tube has strong symmetry about its center. So we apply the generalized symmetry transform to finding centers of steam geneator tubes. But applying the generalized symmetry transform itself without any modification gives difficulties in obtaining the exact centers of steam generator tubes. But applying the generalized symmetry transform itself without any modification gives difficulties in obtaining the exact centers of tubes due to the shadow effect generated by the local light installed inside steam generator. Therefore we make the generalized symmetry transform modified, which uses a modified phase weight function in getting the symmetry magnitude in order to overcome the misleading effect by the local light. The experimental results indicate that the proposed vision algorithm efficiently recongnizes centers of steam generator tubes.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.7
• /
• pp.91-100
• /
• 1994

The lapped orthogonal transform(LOT) has been recently proposed to alleviate the blocking effects in transform coding. The LOT is known to provide an improved coding gain than the conventional transform. In this paper, we propose a prefilter approach to design the LOT bases with the view of maximizing the transform coding gain. Since the nonlinear phase basis is inappropriate to the image coding only the linear phase basis is considered in this paper. Our approach is mainly based on decomposing the transform matrix into the orthogonal matrix and the prefilter matrix. And by assuming that the input is the 1st order Markov source we design the prefilter matrix and the orthogonal matirx maximizing the transform coding gain. The computer simulation results show that the proposed LOT provides about 0.6~0.8 dB PSNR gain over the DCT and about 0.2~0.3 dB PSNR gain over the conventional LOT [7]. Also, the subjective test reveals that the proposed LOT shows less blocking effect than the DCT.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2005.05b
• /
• pp.583-587
• /
• 2005

At present, various methods are available to analyze storm runoff data. Among these, application of Z-transform is comparatively simple and new, and the technique can be used to identify rainfall and unit hydrograph from analysis of a single storm runoff. The technique has been developed under the premise that the rainfall-runoff process behaves as a linear system for which the Z-transform of the direct runoff equals the product of the Z-transforms of the transfer function and the rainfall. In the hydrologic literatures, application aspects of this method to the rainfall-runoff process are lacking and some of the results are questionable. Thus, the present study provides the estimation of Z-transform technique by analyzing the application process and the results using hourly runoff data observed at the research basin of International Hydrological Program (IHP), the Pyeongchanggang River basin. This study also provides the backgrounds for the problems that can be included in the application processes of the Z-transform technique.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.63 no.7
• /
• pp.1001-1007
• /
• 2014

This paper proposes a method to reduce operation time using discrete cosine transform and to improve image quality by the DC gain correction. Conventional filtered back projection (FBP) filtering in the frequency domain using Fourier transform, but the filtering process uses complex number operations. To simplify the filtering process, we propose a filtering process using discrete cosine transform. In addition, the image quality of reconstructed images are improved by correcting DC gain of sinograms. To correct the DC gain, we propose to find an optimum DC weight is defined as the ratio of sinogram DC and optimum DC. Experimental results show that the proposed method gets better performance than the conventional method for phantom and clinical CT images.

• Communications of the Korean Mathematical Society
• /
• v.19 no.1
• /
• pp.93-111
• /
• 2004

In this paper, we use a generalized Brownian motion process to define a generalized Feynman integral and a generalized Fourier-Feynman transform. We also define the concepts of the multiple Lp analytic generalized Fourier-Feynman transform and the generalized convolution product of functional on function space $C_{a,\;b}[0,\;T]$. We then verify the existence of the multiple $L_{p}$ analytic generalized Fourier-Feynman transform for functional on function space that belong to a Banach algebra $S({L_{a,\;b}}^{2}[0, T])$. Finally we establish some relationships between the multiple $L_{p}$ analytic generalized Fourier-Feynman transform and the generalized convolution product for functionals in $S({L_{a,\;b}}^{2}[0, T])$.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.10
• /
• pp.1617-1623
• /
• 1989

The introduction of the fast Fourier transform(FFT),an efficient computational algorithm for the discrete Fourier transform(DFT) by Cooley and Tukey(1965), has brought to the limelight various other discrete transforms. Some of the analog functions from which these transforms have been derived date back to the early 1920's, for example, Walsh functions (Walsh, 1923) and Hadamard Transform(Enomoto et al, 1965). Fast algorithms developed for the forward transform are equally applicable, exept for minor changes, to the inverse transform. In this paper, we present a simple pipelined Hadamard matrix(HM) which is used to develop a fast algorithm for the Hadamard Processor (HP). The Fast Hadamard Transform(FHT) can be derived using matrix partitioning techniques. The HP system is incorporated through a modular design which permits tailoring to meet a wide range of video data link applications. Emphasis has been placed on a low cost, a low power design suitable for airbone system and video codec.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.5
• /
• pp.26-33
• /
• 1994

Phase retrieval is concerned with the reconstruction of a signal from its Fourier transform magnitude (or intensity), which arises in many areas such as X-ray crystallography, optics, astronomy, or digital signal processing. In such areas, the Fourier transform phase of the desired signal is lost while measuring Fourier transform magnitude (F.T.M.). However, if a reference 'signal is added to the desired signal, then, in the Fourier trans form magnitude of the added signal, the Fourier transform phase of the desired signal is encoded. This paper addresses uniqueness and retrieval of the encoded Fourier phase of a multidimensional signal from the Fourier transform magnitude of the added signal along with the Fourier transform magnitude of the desired signal and the information of the additive reference signal. In Part I, several conditions under which the desired signal can be uniquely specified from the two Fourier transform magnitudes and the additive reference signal are presented. In Part II, the development of non-iterative algorithms and an iterative algorithm that may be used to reconstruct the desired signal(s) is considered.