• Korean Journal of Optics and Photonics
• /
• v.34 no.1
• /
• pp.1-12
• /
• 2023

In this study, we propose a hybrid phase-control algorithm for multi-channel coherent beam combining (CBC) system by combining the covariant matrix adaption evolution strategy (CMA-ES) and stochastic parallel gradient descent (SPGD) algorithms and analyze its operational performance. The proposed hybrid CMA-ES/SPGD algorithm is a sequential process which initially runs the CMA-ES algorithm until the combined final output intensity reaches a preset interim value, and then switches to running the SPGD algorithm to the end of the whole process. For ideal 7-channel and 19-channel all-fiber-based CBC systems, we have found that the mean convergence time can be reduced by about 10% in comparison with the case when the SPGD algorithm is implemented alone. Furthermore, we analyzed a more realistic situation in which some additional phase noise was introduced in the same CBC system. As a result, it is shown that the proposed algorithm reduces the mean convergence time by about 17% for a 7-channel CBC system and 16-27% for a 19-channel system compared to the existing SPGD alone algorithm. We expect that for implementing a CBC system in a real outdoor environment where phase noise cannot be ignored, the hybrid CMA-ES/SPGD algorithm proposed in this study will be exploited very usefully.

• Korean Journal of Cognitive Science
• /
• v.4 no.2
• /
• pp.181-200
• /
• 1994

In the learning phase of multilyer feedforword neural network,there are problems such that local minimum,learning praralysis and slow learning speed when backpropagation algorithm used.To overcome these problems, the genetic algorithm has been used as learing method in the multilayer feedforword neural network instead of backpropagation algorithm.However,because the genetic algorith, does not have any mechanism for fine-tuned local search used in backpropagation method,it takes more time that the genetic algorithm converges to a global optimal solution.In this paper,we suggest a new GA-BP method which provides a fine-tunes local search to the genetic algorithm.GA-BP method uses gradient descent method as one of genetic algorithm's operators such as mutation or crossover.To show the effciency of the developed method,we applied it to the 3-parity bit problem with analysis.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.4
• /
• pp.997-1005
• /
• 1998

This paper presents a modified on-off algorithm based on the gradient method for providing the phase of each antenna element more accurately and simply compared to the conventional on-off algorithm. The sup4erisority of theproposed method is due to the fact that the proposed method finds the increase and decrease of the array output power more accurately by utilizing the gradient of array output power with respect to the instantaneous phase of array element. The array antenna adopting to the proposed method formsmaximum beam-pattern along the direction of the desired signal by aligning the phase of every antenna enement. The proposed method is applied to both linear and two-dimentional aray for analyzing the result. The capability of the real-time processing of the proposed technique is confirmed by implementing the proposed algorithm with TMS320C30 Evaluation Module. Since the computational load required to form the beam-pattern per snapshot is small, the proposed method is suitable for the mobile communication system of which the response must be fast. By the results obtained from the application of the proposed method to the CDMA mobile communication environment, it is vreified that the performance of the received signal is consideralbly improved.

• Journal of the Institute of Electronics Engineers of Korea TE
• /
• v.39 no.2
• /
• pp.17-28
• /
• 2002

Recently, the study on non-linear equalization, self-recovering equalization using the neural Network structure or Fuzzy logic, is lively in progress. In this thesis, if the value of error difference is large, coefficient adaptation rate is bigger, and if being small, it is smaller. We proposed the new FSG(Fuzzy Stochastic Gradient)/CMA algorithm combining TS(Tagaki-Sugeno) fuzzy model having fast convergence rate and low mean square error(MSE) and CMA(Constant Modulus Algorithm) which is prone to ISI and insensitive to phase alteration. As a simulation result of the designed channel adaptive equalizer using the proposed FSG/CMA algorithm, it is shown that SNR is improved about 3.5dB comparing to the conventional algorithm. 

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.29A no.3
• /
• pp.1-7
• /
• 1992

This paper discusses the self-adaptive equalization technique which has adaptibility to channel characteristics varation without training sequence. The criterion function used in this paper is based on the concept of cumulant matching. This function can be applied to nonminimum phase channel, and we can verify the fact that if the constrained condition is satisfied. this criterion has no local optimum. As the adaption algorithm, the normalized gradient-searching technique is used. Simulations verify the performance of our method in case of 8PAM, 8PSK(CCITT V.27), 16QAM(CCITT V.29) sources and three type nonminimum phase channels.

• Proceedings of the KIEE Conference
• /
• 1999.07g
• /
• pp.2809-2811
• /
• 1999

In this paper, we develope an algorithm to calculate field inhomogeneity in MR imaging using a dual fast spin echo pulse sequence. Because phase modulation time can be easily modified with this pulse sequence, high resolution image can be obtained and acquisition time can be reduced compared to gradient echo technique. In the case of phase wrapping in field map, phase corrected using image processing technique. We assume the field pattern to be second order polynomial and apply Pseudo-Inverse equation to calculate second order polynomial coefficients. These coefficients can be used for the shimming of the magnetic field.

• Transactions on Control, Automation and Systems Engineering
• /
• v.1 no.1
• /
• pp.69-74
• /
• 1999

Adaptive algorithms based on gradient adaptation have been extensively investigated and successfully joined with active noise/vibration control applications. The Filtered-X LMS algorithm became one of the basic feedforward algorithms in such applications, but is not fully understood yet. Effects of cancellation path model on the Filtered-X LMS algorithm have investigated and some useful properties related to stability were discovered. Most of the results stated that the error in the cancellation path model is undesirable to the Filtered X LMS. However, we started convergence analysis of Filtered-X LMS based on the assumption that erroneous model does not always degrade its performance. In this paper, we present a way of optimizing the cancellation path modern in order to enhance the convergence speed by introducing intentional phase error. Carefully designed intentional phase error enhances the convergence speed of the Filtered X LMS algorithm for pure tone noise suppression application without any performance loss at steady state.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.6
• /
• pp.55-61
• /
• 2014

This paper related with the ECMA (Enchanced CMA) algorithm performance which is possible to simultaneously compensation of the amplitude and phase by appling the minimum disturbance techniques in the CMA adatpve equalizer. The ECMA can improving the gradient noise amplification problem, stability and roburstness performance by the minimum disturbance technique that is the minimization of the equalizer tap weight variation in the point of squared euclidiean norm and the decision directed mode, and then the now cost function were proposed in order to simultaneouly compensation of amplitude and phase of the received signal with the minimum increment of computational operations. The performance of ECMA algorithm was compared to present MCMA by the computer simulation. For proving the performance, the recovered signal constellation that is the output of equalizer output signal and the residual isi and Maximum Distortion charateristic and MSE learning curve that are presents the convergence performance in the equalizer and the overall frequency transfer function of channel and equalizer were used. As a result of computer simulation, the ECMA has more better compensation capability of amplitude and phase in the recovered constellation, and the convergence time of adaptive equalization has improved compared to the MCMA.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.8
• /
• pp.1918-1924
• /
• 2010

This In this paper, we propose an efficient algorithm for motion estimation of the image sequences with luminance fluctuation. For such sequences, conventional motion estimation methods based on the difference of pixel values usually produce the erroneous motion information. The proposed algorithm defines the luminance fluctuation as a linear model with gain and offset parameter, and extracts motion information using gradient and phase of the corresponding local region within consecutive frames. Therefor the method is robust to the luminance change of the frames. We test our algorithm for the ground truth sequence with artificially added luminance change and motion, and real sequences corrupted by the flicker. The results shows that the proposed algorithm outperforms the conventional methods.

• Structural Engineering and Mechanics
• /
• v.65 no.6
• /
• pp.707-719
• /
• 2018

In this article, a new method is introduced to improve the local search capability of meta-heuristic algorithms using the projection of the path on the border of constraints. In a mathematical point of view, the Gradient Projection Method is applied through a new approach, while the imposed limitations are removed. Accordingly, the gradient vector is replaced with a new meta-heuristic based vector. Besides, the active constraint identification algorithm, and the projection method are changed into less complex approaches. As a result, if a constraint is violated by an agent, a new path will be suggested to correct the direction of the agent's movement. The presented procedure includes three main steps: (1) the identification of the active constraint, (2) the neighboring point determination, and (3) the new direction and step length. Moreover, this method can be applied to some meta-heuristic algorithms. It increases the chance of convergence in the final phase of the search process, especially when the number of the violations of the constraints increases. The method is applied jointly with the authors' newly developed meta-heuristic algorithm, entitled Star Graph. The capability of the resulted hybrid method is examined using the optimal design of truss and frame structures. Eventually, the comparison of the results with other meta-heuristics of the literature shows that the hybrid method is successful in the global as well as local search.