• 전자공학회논문지A
• /
• 제32A권5호
• /
• pp.14-23
• /
• 1995

A new dual-mode algorithm for blind equalization of quadrature amplitude modulation (QAM) signals is proposed. To solve the problem that the constant modulus algorithm (CMA) converges to the constellation with the arbitrary phase rotation, with the modification of the CMA, the proposed algorithm accomplishes blind equalization and carrier phase recovery simultaneously. In addition, the dual-mode algorithm combining the modified constant modulus algorithm (MCMA) with decision-directed (DD) algorithm achieves the performance enhancement of blind convergence speed and steady-state residual ISI. So we can refer the proposed algorithm to as a scheme for joint blind equalization and carrier phase recovery. Simulation results for i.i.d. input signals confirm that the dual-mode algorithm results in faster convergence speed, samller residual ISI, and better carrier phase recovery than those of the CMA and DD algorithm without any significant increase in computational complexity.

• Journal of information and communication convergence engineering
• /
• 제7권3호
• /
• pp.292-296
• /
• 2009

The performance of anti-collision algorithm in RFID systems, which are based on FSA algorithm, may be affected by the frame size a query round. In this paper, an anti-collision algorithm with early cancellation of query round is proposed to enhance the performance of EPCglobal Class-1 Gen-2. The Q-algorithm calculates a Q value to determine the next frame size during a query round. In the proposed algorithm, if the new Q value is different from the previous one, the reader transmits a QueryAdjust command to cancel the current query round. The simulation results show that the proposed algorithm can have a stable performance irrespective of the C value of Q-algorithm and the number of tags.

• 한국시뮬레이션학회논문지
• /
• 제9권2호
• /
• pp.15-25
• /
• 2000

Since data security problems are very important in the information age, cryptographic algorithms for encryption and decryption have been studied for a long time. The GOST(Gosudarstvennyi Standard or Government Standard) algorithm as a data encryption algorithm with a 256-bit key is a 64-bit block algorithm developed in the former Soviet Union. In this paper, we describe how to design an encryption chip based on the GOST algorithm. In addition, the GOST algorithm is compared with the DES(Data Encryption Standard) algorithm, which has been used as a conventional data encryption algorithm, in modeling techniques and their performance. The GOST algorithm whose key size is relatively longer than that of the DES algorithm has been expanded to get better performance, modeled in VHDL, and simulated for implementation with an CPLD chip.

• 대한설비공학회:학술대회논문집
• /
• 대한설비공학회 2008년도 동계학술발표대회 논문집
• /
• pp.399-404
• /
• 2008

Condensing gas boiler units may make a big role for the reduction of energy consumption in heating industries. In order to decrease the energy consumption of a condensing gas boiler unit, the effective control of the system is necessary. In this study, control algorithms of a condensing gas boiler were developed. Control algorithms are composed of the setpoint algorithm and the control algorithm. The setpoint algorithm consists of the supply water temperature setpoint algorithm and the pump setpoint algorithm. The control algorithm consists of the gas valve control algorithm and the blower control algorithm. In order to analyse the performance of control algorithms, dynamic models of a condensing gas boiler system were used. Simulation results showed that control algorithms developed for this study may be practically applied to the condensing gas boiler.

• 전자공학회논문지T
• /
• 제35T권2호
• /
• pp.13-19
• /
• 1998

가산잡음으로 훼손된 영상을 복원하는 Filter Algorithm 중 Mean Filter Algorithm은 화소들의 묶음을 산술평균한 값을 화소로 삼는다. 그러나 산술평균은 화소간의 편차를 고려하지 않으므로 편차가 심한 화소-윤곽선이 훼손되고, 화소들에 포함되지 않은 값이 화소로 채택될수 있다. 이를 보완한 Median Filter Algorithm은 화소들의 묶음을 정렬하여 중앙값을 화소로 삼아 편차가 심한 화소를 보존하고, 화소들에 포함되지 않은 값이 화소로 선택되는 오류를 방지한다. 그러나 Median Filter Algorithm은 화소들의 묶음을 정렬하고, 중위수를 구하는데 소모되는 시간이 Mean Filter Algorithm의 화소들의 평균을 구하는 시간보다 상대적으로 많이 소모되고, 잡음이 화소로 선택될 오류가 발생한다. 이러한 단점을 보완한 Fast Median Filter Algorithm을 제안한다. Fast Median Filter Algorithm은 훼손영상을 전체집합으로, 국부영상을 부분집합 1, 2로 두어 Median Filter Algorithm보다 효율적으로 화소들을 정렬한다. 시험결과는 IBM 기종(80586)에서 구동되었으며 기존의 Filter Algorithm들과 비교분석한 결과 Mean Filter Algorithm과 대등한 속도와 Median Filter Algorithm의 결과영상을 얻음으로서 Fast Median Filter Algorithm의 우수성을 확인할 수 있었다.

• 한국소음진동공학회:학술대회논문집
• /
• 한국소음진동공학회 2009년도 추계학술대회 논문집
• /
• pp.231-239
• /
• 2009

The filtered-x LMS (FX-LMS) algorithm has been applied to the active noise control (ANC) system in an acoustic duct. This algorithm is designed based on the FIR (finite impulse response) filter, but it has a slow convergence problem because of a large number of zero coefficients. In order to improve the convergence performance, the step size of the LMS algorithm was modified from fixed to variable. However, this algorithm is still not suitable for the ANC system of a short acoustic duct since the reference signal is affected by the backward acoustic wave propagated from a secondary source. Therefore, the recursive filteredu LMS algorithm (FU-LMS) based on infinite impulse response (IIR) is developed by considering the backward acoustic propagation. This algorithm, unfortunately, generally has a stability problem. The stability problem was improved by using an error smoothing filter. In this paper, the recursive LMS algorithm with variable step size and smoothing error filter is designed. This recursive LMS algorithm, called FU-VSSLMS algorithm, uses an IIR filter. With fast convergence and good stability, this algorithm is suitable for the ANC system in a short acoustic duct such as the intake system of an automotive. This algorithm is applied to the ANC system of a short acoustic duct. The disturbance signals used as primary noise source are a sinusoidal signal embedded in white noise and the chirp signal of which the instantaneous frequency is variable. Test results demonstrate that the FU-VSSLMS algorithm has superior convergence performance to the FX-LMS algorithm and FX-LMS algorithm. It is successfully applied to the ANC system in a short duct.

• Journal of information and communication convergence engineering
• /
• 제3권3호
• /
• pp.119-121
• /
• 2005

This paper aims to estimate the delay time of multiple signals in a multi-path environment. It also seeks to carry out a comparative analysis with the existing delay time under the proposed algorithm to develop a new algorithm that applies the space average method in a MUSIC algorithm. Unlike the existing delay time estimation algorithm, the developed algorithm was able to estimate the delay time in 5ns low. Therefore, the algorithm proposed in this paper improved the existing delay time estimated algorithm.

• 전자공학회논문지A
• /
• 제33A권7호
• /
• pp.34-43
• /
• 1996

In this paper a simpel algorithm for all-digial high speed symbol synchronization is proposed. The proposed algorithm has a structure based on BECM (band-edge component maximization). The algorithm requires only tow samples per symbol for its operation. We analyze and evaluate performance of the proposed algorithm. Simulation results reveal that the proposed algorithm has better performance than the gardner algorithm in narrowband.

• 한국산업정보학회:학술대회논문집
• /
• 한국산업정보학회 2008년도 추계 공동 국제학술대회
• /
• pp.463-467
• /
• 2008

Heuristic optimization using hybrid algorithms have provided a robust and efficient approach for solving many optimization problems. In this paper, a new hybrid algorithm using adaptive genetic algorithm (aGA) and particle swarm optimization (PSO) is proposed. The proposed hybrid algorithm is applied to solve numerical optimization functions. The results are compared with those of GA and other conventional PSOs. Finally, the proposed hybrid algorithm outperforms others.

• Journal of applied mathematics & informatics
• /
• 제28권5_6호
• /
• pp.1239-1248
• /
• 2010

In this paper, an implementable BFGS bundle algorithm for solving a nonsmooth convex optimization problem is presented. The typical method minimizes an approximate Moreau-Yosida regularization using a BFGS algorithm with inexact function and the approximate gradient values which are generated by a finite inner bundle algorithm. The approximate subgradient of the objective function is used in the algorithm, which can make the algorithm easier to implement. The convergence property of the algorithm is proved under some additional assumptions.