• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.10C
• /
• pp.1000-1010
• /
• 2006

This paper proposes a new architecture for DCT-based motion estimation and compensation. Previous methods do riot take sufficient advantage of the sparseness of 2-D DCT coefficients to reduce execution time. We first derive a recursion equation to perform DCT domain motion estimation more efficiently; we then use it to develop a wavefront array processor (WAP) consisting of processing elements. In addition, we show that the recursion equation enables motion predicted images with different frequency bands, for example, from the images with low frequency components to the images with low and high frequency components. The wavefront way Processor can reconfigure to different motion estimation algorithms, such as logarithmic search and three step search, without architectural modifications. These properties can be effectively used to reduce the energy required for video encoding and decoding. The proposed WAP architecture achieves a significant reduction in computational complexity and processing time. It is also shown that the motion estimation algorithm in the transform domain using SAD (Sum of Absolute Differences) matching criterion maximizes PSNR and the compression ratio for the practical video coding applications when compared to tile motion estimation algorithm in the spatial domain using either SAD or SSD.

• Proceedings of the KIEE Conference
• /
• 2007.04a
• /
• pp.38-40
• /
• 2007

In this paper, we propose a novel architecture, which is based on DCT (Discrete Cosine Transform), for ME (Motion Estimation) and MC (Motion Compensation). The traditional algorithms of ME and MC based on DCT did not suffer the advantage of the coarseness of the 2-dimensional DCT (2-D DCT) coefficients to reduce the operational time. Therefore, we derive a recursion equation for transform-domain ME and MC and design the structure by using highly regular, parallel, and pipeline processing elements. The main difference with others is removing the IDCT block by using to transform domain. Therefore, the performance of our algorithm is more efficient in practical image processing such as DVR (Digital Video Recorder) system. We present the simulation result which is compare with the spatial domain methods. it shows reducing the calculation cost. compression ratio. and peak signal to noise ratio (PSNR).

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.973-978
• /
• 2005

In this paper, we investigate an improved mobile robot localization method using Kalman filter. The highlight of the paper lies in the formulation of combined Kalman filter and its application to mobile robot experiment. The combined Kalman filter is a kind of extended Kalman filter which has an extra degree of freedom in Kalman filtering recursion. It consists of the standard Kalman filter, i.e., the predictor-corrector and the perturbation estimator which reconstructs unknown dynamics in the state transition equation of mobile robot. The combined Kalman filter (CKF) enables to achieve robust localization performance of mobile robot in spite of heavy perturbation such as wheel slip and doorsill crossover which results in large odometric errors. Intrinsically, it has the property of integrating the innovation in Kalman filtering, i.e., the difference between measurement and predicted measurement and thus it is so much advantageous in compensating uncertainties which has not been reflected in the state transition model of mobile robot. After formulation of the CKF recursion equation, we show how the design parameters can be determined and how much beneficial it is through simulation and experiment for a two-wheeled mobile robot under indoor GPS measurement system composed of four ultrasonic satellites. In addition, we discuss what should be considered and what prerequisites are needed to successfully apply the proposed CKF in mobile robot localization.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.39 no.4
• /
• pp.470-476
• /
• 2002

This paper presents an analysis of the performance degradation of coefficient approximation and frequency deviation in phase measurement algorithm based on Sliding-DFT. The analytic derivation is based on the statistics of the error dynamic equation that describes the error propagation of the recursion. The analysis result is intended to obtain a closed-form equation of error variance in terms of the number of bits used in coefficient approximation, the length of the DFT data block, and noise. It is verified with data obtained from the computer simulations.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.21 no.2
• /
• pp.8-12
• /
• 1984

Algorithms for solving a set of nonlinear simultaneous equations, which is frequently required in problems of controlling nonlinear processes, are proposed. Here the equation variables are first parameterized and a recursive identification technique is utilized. The forms and characteristics of the resultant algorithms are vary similar to the Broyden's quasi-Newton method, but their derivations and final recursion equations are different. Our methods possess almost all the merits of the Broyden's and numerical comparisons show our methods to be more efficient and reliable for some difficult problems.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.5A
• /
• pp.311-316
• /
• 2012

In this paper, a bit-mapping scheme is proposed for partial Chase combining in LDPC-coded systems. Contrary to the previously known bit mapping that assigns the information bits to more reliable channels, the proposed mapping assigns the codeword bits of irregular LDPC codes to distinct Gaussian channels by considering the characteristics of LDPC codes and channels. The recursion equation for partial Chase combining is derived by using the density evolution technique, based on it, the best bit mapping among the various bit-mapping schemes is derived, and the validity of them is confirmed through simulation.

• Journal of the Korean Institute of Gas
• /
• v.18 no.3
• /
• pp.1-12
• /
• 2014

In this paper, we developed an explosion proof type and portable combustible gas leak detector and proposed an algorithm to improve the accuracy for measuring gaseous concentrations. The nation's first we developed an infrared gas leak detector with explosion proof standard(Ex d ib) and improved measuring accuracy by using linearization recursion equation and 2nd Lagrange interpolation polynomial. Together, we advanced their performances and added their easy functions after investigating field demands. To compare our and other company's detectors, we performed measurement tests with eight standard gases made by Korea Gas Safety Corporation. We demonstrated the excellence of our instruments in measuring accuracy other than detecters through experimental results.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.17 no.12
• /
• pp.1343-1352
• /
• 1992

This paper presents a new and easy method to obtain the Fourier transforms of the n-th order cosine-pulses whose maximum amplitudes are uniform. The new method is focused on deriving a formula which is recursively related following their orders and can be well applied to some numerical solutions. On the other hand, this method also offers more compact procedures in view of analytical solutions than the conventional methods because the results are consist of the sum of two functions which are easily calculated. Especially, the formula can be represented as a complete recursion by the separation of coefficients originated by the authors and the resulting difference equation is given by the sum of the original 'sinc' functions shifted by some symmetrical factors and multiplied by some constants. The constants are easily decided from the binomial coefficients and the shifting factors from the corresponding exponential differences in the expansion of $(a+b)^n$.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.11C
• /
• pp.917-924
• /
• 2008

Motion estimation and compensation in the spatial domain check the searching area of specified size in the previous frame and search block to minimize the difference with current block. When we check the searching area, it consumes the most encoding times due to increasing the complexity. We can solve this fault by means of motion estimation using shifting matrix in the transform domain instead of the spatial domain. We derive so the existed shifting matrix to a new recursion equation that we decrease more computations. We modify simply vertical shifting matrix and horizontal shifting matrix in the transform domain for motion estimation of half-pixel accuracy. So, we solve increasing computation due to bilinear interpolation in the spatial domain. Simulation results prove that motion estimation by the proposed algorithm in DCT-based transform domain provides higher PSNR using fewer bits than results in the spatial domain.