• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.4
• /
• pp.318-324
• /
• 2013

For blind channel equalization, the reliability of signal estimate determines the convergence speed and steady-state performance of the equalizer. Therefore the nonlinear estimator and reference signal being used in signal estimate should be chosen appropriately. In this paper, to increase the reliability of the signal estimate, two errors were obtained by applying coarse signal points and dense signal points respectively to signal estimate, the relative reliabilities of two errors were calculated, then the equalizer was adapted deferentially utilizing the reliabilities. At this point, by applying two errors alternately, two modes of operation were smoothly combined. Through computer simulations the proposed method was confirmed to achieve fast transient state convergence and low steady-state error compared to traditional methods.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.4
• /
• pp.3-8
• /
• 2015

In this paper, we propose a blind equalization algorithm based on the error signal linearly combined a constellation-matched error (CME) and a non-constellation-matched error (non-CME). The new error signal was designed to include the non-CME term for reaching initial convergence and the CME term for improving intersymbol interference (ISI) performance of output signals, and it controls the error terms through a combining factor. By controlling the error terms, it generates an appropriate error signal for equalization process and improves convergence speed and ISI cancellation performance compared to those of conventional algorithms. In the simulation for 64-QAM and 256-QAM signals under the multipath channel and additive noise conditions, the proposed method was superior to CMA and CMA+DD concurrent equalization.

• Journal of Korean Society of Steel Construction
• /
• v.12 no.6
• /
• pp.629-638
• /
• 2000

With the positive features of simulated annealing algorithms such as simplicity of the algorithm and the possibility of finding global optimum solution, SA algorithm has been widely applied to structural optimization problems. However, the algorithms are far from practical applications in structural design or optimization of building structures due to requirement of a large number of iterations and dependency on cooling schedule and stopping criteria. In this paper, with the modification of annealing process and stopping criteria, a MSA algorithm is presented in the form of two phase annealing process for optimal seismic design of braced structures. The performance of the proposed algorithm has been illustrated in detail.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.5 no.3
• /
• pp.83-91
• /
• 1995

A neural network with one or more layers of hidden units can be trained using the well-known error back propagation algorithm. According to this algorithm, the synaptic weights of the network are updated during the training by propagating back the error between the expected output and the output provided by the network. However, the error back propagation algorithm is characterized by slow convergence and the time required for training and, in some situation, can be trapped in local minima. A theoretical formulation of a new fast learning method based on tabu search method is presented in this paper. In contrast to the conventional back propagation algorithm which is based solely on the modification of connecting weights of the network by trial and error, the present method involves the calculation of the optimum weights of neural network. The effectiveness and versatility of the present method are verified by the XOR problem. The present method excels in accuracy compared to that of the conventional method of fixed values.

• The Journal of the Acoustical Society of Korea
• /
• v.16 no.6
• /
• pp.85-93
• /
• 1997

Fixed systems are limited in their performances to achieve the more complicated and higher level operations. Accordingly adaptive system, which adjusts itself in accorance with the time-varying environments, has been introduced to camouflarge the defficiency of fixed systems in varying environment, and adaptive filter is the outstanding fields in adaptive system. Adaptive recursive filter is far more efficient in that it can perform the signal processing with relatively lower filter order, but there remains severe problem in stability(convergency). On the basis of hyperstability introduced by V.M. Popov, a hyperstable new adaptive recursive filter is introduced which is theoretically guaranteed in stability. In this paper a more stable algorithm for adaptive recursive filter is devised.

• Journal of IKEEE
• /
• v.24 no.2
• /
• pp.570-578
• /
• 2020

In this paper, we propose an efficient method for implementing the adaptive second-order Volterra filter. To reduce computational load, the UCFD-SVF has been proposed. The UCFD-SVF, however, shows deteriorated convergence performance. We propose a new method that initializes the adaptive filter weights periodically on the fact that the energy of the filter weights is slowly increased. Furthermore, we propose another method that the interval for the weight initialization is variable to guarantee the performance and we shows the method gives the better performance under the non-stationary environment through the computer simulation for the adaptive system identification.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.10B
• /
• pp.1117-1123
• /
• 2009

Head fixed type multi-focus display system using Galvano-scanner and DMD(Digital Micro-mirror Device), which is able to perfectly accommodate, can solve eye fatigue due to conflict between convergence eye movement and accommodation action in stereoscopic display. This system is able to accommodate through making convergence point about each view point and offering it in front of observer's pupil by using laser scanning method. In this paper, we analyzed laser scanning method of this multi-focus display system. And multi-focus display system based on this analysis was made, which showed that focus adjustment was possible through video camera. As a result, formation principle of view point of multi-focus system by laser scanning method was verified.

• Journal of the Institute of Convergence Signal Processing
• /
• v.5 no.1
• /
• pp.32-39
• /
• 2004

Biological neurons generally have chaotic characteristics for permanent or transient period. The effects of chaotic response of biological neuron have not yet been verified by using analytical methods. Even though the transient chaos of neuron could be beneficial to overcoming the local minimum problem, the permanent chaotic response gives adverse effect on optimization problems in general. To solve optimization problems, which are needed in almost all neural network applications such as pattern recognition, identification or prediction, and control, the neuron should have one stable fixed point. In this paper, the dynamic characteristics of the chaotic dynamic neuron and the condition that produces the chaotic response are analyzed, and the convergence conditions are presented.

• The KIPS Transactions:PartB
• /
• v.8B no.4
• /
• pp.343-350
• /
• 2001

백터 양자화기 설계는 다차원의 목적함수를 최소화하는 학습 알고리즘을 필요로 한다. 일반화된 Lloyd 방법(GLA)은 벡터 양자화기 설계를 위해 오늘날 가장 널리 사용되는 알고리즘이다. GLA 는 일괄처리(batch) 방식으로 코드북을 생성하며 목적함수를 단조 감소시키는 강하법(descent algorithm)의 일종이다. 한편 Kohonen 학습법(KLA)은 학습벡터가 입력되는 동안 코드북이 갱신되는 온라인 벡터 양자화기 설계 알고리즘 이다. KLA는 원래 신경망 학습을 위해 Kohonen에 의해 제안되었다. KLA 역시 GLA와 마찬가지로 강하법의 일종이라 할 수 있다. 따라서 이들 두 알고리즘은, 비록 사용하기 편리하고 안정적으로 동작을 하지만, 극소(local minimum) 점으로 수렴하는 문제를 안고 있다. 우리는 이 문제와 관련하여 simulated annealing(SA) 방법의 응용을 논하고자 한다. SA는 현재까지 극소에 빠지지 않고 최소(global minimum)로 수렴하면서, 해의 수렴이 (통계적으로) 보장되는 유일한 방법이라 할 수 있다. 우리는 먼저 GLA에 SA를 응용한 그 동안의 연구를 개괄한다. 다음으로 온라인 방식의 벡터 양자화가 설계에 SA 방법을 응용함으로써 SA 방법에 기초한 새로운 온라인 학습 알고리즘을 제안한다. 우리는 이 알고리즘을 OLVQ-SA 알고리즘이라 부르기로 한다. 가우스-마코프 소스와 음성데이터에 대한 벡터양자화 실험 결과 제안된 방법이 KLA 보다 일관되게 우수한 코드북을 생성함을 보인다.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.2
• /
• pp.552-557
• /
• 2000

In the paper, we proposed a face recognition method that uses GA-BP(Genetic Algorithm-Back propagation Network) that optimizes initial parameters such as bias values or weights. Each pixel in the picture is used for input of the neuralnetwork. The initial weights of neural network is consist of fixed-point real values and converted to bit string on purpose of using the individuals that arte expressed in the Genetic Algorithm. For the fitness value, we defined the value that shows the lowest error of neural network, which is evaluated using newly defined adaptive re-learning operator and built the optimized and most advanced neural network. Then we made experiments on the face recognition. In comparison with learning convergence speed, the proposed algorithm shows faster convergence speed than solo executed back propagation algorithm and provides better performance, about 2.9% in proposed method than solo executed back propagation algorithm.