• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.11B
• /
• pp.1020-1029
• /
• 2008

This paper proposes an high speed pattern matching algorithm and its implementation. The pattern matcher is used to check patterns from realtime input packet. The proposed algorithm can find exact string, range of string values, and combination of string values from input packet at high speed. Given string and rule set are modelled as a state transition graph which can find overlapped strings simultaneously, and the state transition graph is partitioned according to input implicants to reduce implementation complexity. The pattern matcher scheme uses the transformed state transition graph and input packet as an input. The pattern matcher was modelled and implemented in VHDL language. Experimental results show the proprieties of the proposed approach.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.1
• /
• pp.11-18
• /
• 2001

In this paper, we proposed the image compression algorithm using triangular feature based GHA. In feature extraction, the input images are divided into eight areas of triangular shape, that has positional information for face image compression. The proposed algorithm reduces blocking effects in image reconstruction and contains informations of face feature and shapes of face as input images are divided into eight. We used triangular feature extraction for positional information and GHA for shape information of face images. Simulation results show that the proposed algorithm has a better performance than the block based K-means and non-parsed image based GHA in PSNR at the same bpp.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.530-535
• /
• 2004

This paper considers a state set estimation (SSE) based model predictive control (MPC) for linear parameter- varying (LPV) systems with input constraint. We estimate, at each time instant, a feasible set of all states which are consistent with system model, measurements and a priori information, rather than the state itself. By combining a state-feedback MPC and an SSE, we design an SSE-based MPC algorithm that stabilizes the closed-loop system. The proposed algorithm is solved by semi-de�nite program involving linear matrix inequalities. A numerical example is included to illustrate the performance of the proposed algorithm.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.28B no.10
• /
• pp.842-913
• /
• 1991

The automatic target detection which automatically identifies the location of the target with its input image is one of the significant subjects of image processing field. Then, there are some problems that should be solved to detect the target automatically from the input image. First of all, the ambiguity of the boundary between targets or between a target and background should be solved and the target should be searched adaptively. In other words, the target should be identified by the relative brightness to the background, not by the absolute brightness. In this paper, to solve these problems, a new algorithm which can identify the target automatically is proposed. This algorithm uses the set of fuzzy for solving the ambiguity between the boundaries, and using the weight according to the brightness of data in the input image, the target is identified adaptively by the relative brightness to the background. Applying this algorithm to real images, it is experimentally proved that it is can be effectively applied to the automatic target detection.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.34C no.12
• /
• pp.43-53
• /
• 1997

In this paper, the optimal synthesis algorithm of multiple-valued logic circuits using universal logic modules (ULM) U$_{f}$ based on 3-variable ternary reed-muller expansions is presented. We check the degree of each varable for the coefficients of reed-muller expansions and determine the order of optimal control input variables that minimize the number of ULM U$_{f}$ modules. The order of optimal control input variables is utilized the realization of multiple-valued logic circuits to be constructed by ULM U$_{f}$ modules based on reed-muller expansions using the circuit cost matrix. This algorithm is performed only unit time in order to search for the optimal control input variables. Also, this algorithm is able to be programmed by computer and the run time on programming is O(p$^{n}$ ).

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.2
• /
• pp.495-513
• /
• 2020

The correlation identification of the subsurface is a novel electrical prospecting method which could suppress stochastic noise. This method is increasingly being utilized by geophysicists. It achieves the frequency response of the underground media through division of the cross spectrum of the input & output signal and the auto spectrum of the input signal. This is subject to the spectral leakage when the cross spectrum and the auto spectrum are computed from cross correlation and autocorrelation function by Discrete Fourier Transformation (DFT, "To obtain an accurate frequency response of the earth system, we propose an improved correlation identification method which uses all phase Fast Fourier Transform (APFFT) to acquire the cross spectrum and the auto spectrum. Simulation and engineering application results show that compared to existing correlation identification algorithm the new approach demonstrates more precise frequency response, especially the phase response of the system under identification.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.11C
• /
• pp.1127-1133
• /
• 2007

This paper proposes one of normalized QR-typed LMS (Least Mean Square) algorithms with computational complexity of O(N). This proposed algorithm shows the normalized property in terms of theoretical characteristics. This proposed algorithm is one of algorithms which normalize variance of input signal in terms of mean because QR-typed LMS is proportional to variance of input signal. In this paper, convergence characteristic analysis of normalized algorithm was made. Computer simulation was made by the algorithms used for echo canceller. Proposed algorithm has similar performance to theoretical value. And, we can see that proposed method shows similar one to performance of NLMS.by comparison among different algorithms.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.4
• /
• pp.685-690
• /
• 1994

A problem associated with vector quantization(VQ) is the computational complexity incurred in searching for a codevector with the closet to a given input vector, where the complexity increases exponentionally with proportion to codebook size and then limits practical application. In this paper, a simple and fast, but efficient, VQ encoding algorithm is presented using a reference codevector as start codevector of premature exit condition, which eliminates distance claculation of unlikely codevectors. The algorithm is to find reference codevector having the possibility to be the nearest vector to input vector first and then to incorporate premature exit condition. The proposed algorithm needs only 10~15% of mathematical operations compared with the conventional full search VQ. Algorithm the number of additions and comparsions of the proposed algorithm is not reduced greatly, the number of multiplication is reduced up to 70~80% compared with other fast VQ encoding methods.

• Journal of the Korea Society of Computer and Information
• /
• v.3 no.1
• /
• pp.125-148
• /
• 1998

The use of shaping mechanism, realized by means of a leaky bucket based algorithm on input traffic of an ATM network allows to achieve higher utilization of network resources, and to guarantee the quality of service requested by the users. The functionalities of the shaping mechanism based on leaky bucket, are characterized by the token pool sire and by input queue size. In this paper we have analyzed, using simulations, the effect on the quality of service in ATM network of leaky bucket algorithm when shaper parameters described above are changed.

• Journal of IKEEE
• /
• v.21 no.2
• /
• pp.130-135
• /
• 2017

Normally, in data transmission, extra parity bits are added to the input message which were derived from its input and a pre-defined algorithm. The same algorithm is used by the receiver to check the consistency of the delivered information, to determine if it is corrupted or not. It recovers and compares the received information, to provide matching and correcting the corrupted transmitted bits if there is any. This paper aims the following objectives: to use an alternative error detection-correction method, to lessens both the fixed number of the required redundancy bits 'r' in cyclic redundancy checking (CRC) because of the required polynomial generator and the overhead of interspersing the r in Hamming code. The experimental results were synthesized using Xilinx Virtex-5 FPGA and showed a significant increase in both the transmission rate and detection of random errors. Moreover, this proposal can be a better option for detecting and correcting errors.