• Title/Summary/Keyword: 수렴도

Search Result 4,122, Processing Time 0.03 seconds

An Optmival design of Circularly Polarization Antenna for Sensor Node using Adaptive Particle Swarm Optimization (APSO 알고리즘을 이용한 센서노드용 원형편파 안테나 최적설계)

  • Kim, Koon-Tae;Kang, Seong-In;Oh, Seung-Hun;Lee, Jeong-Hyeok;Han, Jun-Hee;Jang, Dong-Hyeok;Wu, Chao;Kim, Hyeong-Seok
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2014.05a
    • /
    • pp.682-685
    • /
    • 2014
  • In this paper, an improved designed of the circularly polarization antenna for sensor node. Stochastic optimization algorithms of Particle Swarm Optimization (PSO) and Adaptive Particle Swam Optimization(APSO) are studied and compared. To verify that the APSO is working better than the standard PSO, the design of a circularly polarization antenna is shows the optimized result with 27 iterations in the APSO and 41 iterations in th PSO.

  • PDF

Variable Step Size LMS Algorithm Using the Error Difference (오류 차이를 활용한 가변 스텝 사이즈 LMS 알고리즘)

  • Woo, Hong-Chae
    • The Journal of the Acoustical Society of Korea
    • /
    • v.28 no.3
    • /
    • pp.245-250
    • /
    • 2009
  • In communications and signal processing area, a number of least mean square adaptive algorithms have been used because of simplicity and robustness. However the LMS algorithm is known to have slow and non-uniform convergence. Various variable step size LMS adaptive algorithms have been introduced and researched to speed up the convergence rate. A variable step size LMS algorithm using the error difference for updating the step size is proposed. Compared with other algorithms, simulation results show that the proposed LMS algorithm has a fast convergence. The theoretical performance of the proposed algorithm is also analyzed for the steady state.

A Study on Estimate for Error and Convergence of Membrane Structures According to the Nonlinear Form-finding Techniques (비선형 형상 탐색 기법에 따른 막구조물의 오차와 수렴성 평가에 관한 연구)

  • Shon, Su-Deok;Kim, Seung-Deog;Jeong, Eul-Seok;Jeon, Jin-Hyung
    • Journal of Korean Association for Spatial Structures
    • /
    • v.7 no.3 s.25
    • /
    • pp.57-66
    • /
    • 2007
  • The membrane structures, a kind of lightweight soft structural system, are used for spatial structures. The material property of the membrane has strong axial stiffness, but little bending stiffness. The design procedure of membrane structures are needed to do shape finding, stress-deformation analysis and cutting pattern generation. In shape finding, membrane structures are unstable structures initially. These soft structures need to be introduced initial stresses because of its initial unstable state, and happen large deformation phenomenon. Therefore, in this paper, we investigate the convergence of solution and the speed according to the control variables and the method of shape analysis.

  • PDF

Convergence Complexity Reduction for Block-based Compressive Sensing Reconstruction (블록기반 압축센싱 복원을 위한 수렴 복잡도 저감)

  • Park, Younggyun;Shim, Hiuk Jae;Jeon, Byeungwoo
    • Journal of Broadcast Engineering
    • /
    • v.19 no.2
    • /
    • pp.240-249
    • /
    • 2014
  • According to the compressive sensing theory, it is possible to perfectly reconstruct a signal only with a fewer number of measurements than the Nyquist sampling rate if the signal is a sparse signal which satisfies a few related conditions. From practical viewpoint for image applications, it is important to reduce its computational complexity and memory burden required in reconstruction. In this regard, a Block-based Compressive Sensing (BCS) scheme with Smooth Projected Landweber (BCS-SPL) has been already introduced. However, it still has the computational complexity problem in reconstruction. In this paper, we propose a method which modifies its stopping criterion, tolerance, and convergence control to make it converge faster. Experimental results show that the proposed method requires less iterations but achieves better quality of reconstructed image than the conventional BCS-SPL.

Material Topology Optimization Design of Structures using SIMP Approach Part I : Initial Design Domain with Topology of Partial Holes (SIMP를 이용한 구조물의 재료 위상 최적설계 Part I : 부분적인 구멍의 위상을 가지는 초기 설계영역)

  • Lee, Dong-Kyu;Park, Sung-Soo;Shin, Soo-Mi
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.20 no.1
    • /
    • pp.9-18
    • /
    • 2007
  • This study shows an implementation of partial holes in an initial design domain in order to improve convergences of topology optimization algorithms. The method is associated with a bubble method as introduced by Eschenauer et al. to overcome slow convergence of boundary-based shape optimization methods. However, contrary to the bubble method, initial holes are only implemented for initializations of optimization algorithm in this approach, and there is no need to consider a characteristic function which defines hole's deposition during every optimization procedure. In addition, solid and void regions within the initial design domain are not fixed but merged or split during optimization Procedures. Since this phenomenon activates finite changes of design parameters without numerically calculating movements and positions of holes, convergences of topology optimization algorithm can be improved. In the present study, material topology optimization designs of Michell-type beam utilizing the initial design domain with initial holes of varied sizes and shapes is carried out by using SIMP like a density distribution method. Numerical examples demonstrate the efficiency and simplicity of the present method.

Convergence Decision Method Using Eigenvectors of QR Iteration (QR 반복법의 고유벡터를 이용한 수렴 판단 방법)

  • Kim, Daehyun;Lee, Jingu;Jeong, Seonghee;Lee, Jaeeun;Kim, Younglok
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.41 no.8
    • /
    • pp.868-876
    • /
    • 2016
  • MUSIC (multiple signal classification) algorithm is a representative algorithm estimating the angle of arrival using the eigenvalues and eigenvectors. Generally, the eigenvalues and eigenvectors are obtained through the eigen-analysis, but this analysis requires high computational complexity and late convergence time. For this reason, it is almost impossible to construct the real-time system with low-cost using this approach. Even though QR iteration is considered as the eigen-analysis approach to improve these problems, this is inappropriate to apply to the MUSIC algorithm. In this paper, we analyze the problems of conventional method based on the eigenvalues for convergence decision and propose the improved decision algorithm using the eigenvectors.

Variable Length Optimum Convergence Factor Algorithm for Adaptive Filters (적응 필터를 위한 가변 길이 최적 수렴 인자 알고리듬)

  • Boo, In-Hyoung;Kang, Chul-Ho
    • The Journal of the Acoustical Society of Korea
    • /
    • v.13 no.4
    • /
    • pp.77-85
    • /
    • 1994
  • In this study an adaptive algorithm with optimum convergence factor for steepest descent method is proposed, which controls automatically the filter order to take the appropriate level. So far, fixed order filters have been used when adaptive filter is employed according to the priori knowledge or experience in various adaptive signal processing applications. But, it is so difficult to know the filter order needed in real implementations that high order filters have to be performed. As a result, redundant calculations are increased in the case of high order filters. The proposed variable length optimum convergence factor (VLOCF) algorithm takes the appropriated filter order within the given one so that the redundant calculation is decreased to get the enhancement of convergence speed and smaller convergence error during the steady state. The proposed algorithm is evaluated to prove the validity by computer simulation for system Identification.

  • PDF

Performance Improvement of Frequency Synchronization in ATSC DTV System using Signal Power at Both Edges of Spectrum (ATSC DTV 시스템에서 스펙트럼 양끝의 신호전력을 이용한 주파수 동기 성능 개선)

  • Song Hyun Keun;Lee Joo Hyung;Kim Jae Moung;Eum Ho Min;Kim Seung Won
    • Journal of Broadcast Engineering
    • /
    • v.10 no.1 s.26
    • /
    • pp.31-42
    • /
    • 2005
  • ATSC DTV system uses FPLL block for acquiring the frequency synchronization. Because the FPLL uses only the pilot signal, the frequency convergence range becomes narrower and it takes a more time to acquire the frequency synchronization as the pilot is distorted. And the spectrum shape around the pilot makes an asymmetric convergence range between the positive frequency offset and the negative frequency offset. This paper proposes the algorithm that requires the Installation of the fitters at the both edges of a VSB spectrum and uses the signal power that passes these filters. The proposed algorithm complements the problems of the asymmetric convergence range and overcomes the performance degradation due to the distortion of a pilot level.

A Study of Improved Convergence on the Preisach Model Method by Using M-B Variables (M-B 변수를 이용한 Preisach 모델링의 수렴성 향상에 관한 연구)

  • Won, Hyuk;Park, Gwan-Soo;Chung, Hyun-Ju;Yang, Chang-Seob
    • Journal of the Korean Magnetics Society
    • /
    • v.21 no.1
    • /
    • pp.15-22
    • /
    • 2011
  • It is necessary to describe the hysteresis characteristics of magnetic material precisely for the analysis or design of system with ferromagnetic materials. Although Preisach model is regarded as the most accurate method to describe the hysteresis characteristics, it is not widely applied to the real systems because of some difficulties. The conventional Preisach model shows the numerical instabilities during the iterative computations because the density distribution obtained from the sets of M-H curves are strongly localized. To remove such numerical instabilities, M-B instead of M-H is adopted as an implementation variable in normal Preisach modeling. The two dimensional computations with hysteresis characteristics by using normal Preisach modeling are tested and the result showed that the modeling by using M-B variables showed better stabilities than M-H variables.

The Bi-directional Least Mean Square Algorithm and Its Application to Echo Cancellation (양방향 최소 평균 제곱 알고리듬과 반향 제거로의 응용)

  • Kwon, Oh-Sang
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.9 no.12
    • /
    • pp.1337-1344
    • /
    • 2014
  • The objective of an echo canceller connected to any end of a communication line such as digital subscriber line (DSL) is to compensate the outgoing transmit signal in the receiving path that the hybrid circuit leaks. The echo canceller working in a full duplex environment is an adaptive system driven by the local signal. Conventional echo canceller that implement the least mean square (LMS) algorithm provides a low computational burden but poor convergence properties. The length of the echo canceller will directly affect both the degree of performance and the convergence speed of the adaptation process. To cancel long time-varying echoes, the number of tap coefficients of a conventional echo canceller must be large, which decreases the convergence speed of the adaptive filter. This paper proposes an alternative technique for the echo cancellation in a telecommunication channel. The new technique employs the bi-directional least mean square (LMS) algorithm for adaptively computing the optimal set of the coefficients of the echo canceller, which is composed of weighted combination of both feedforward and feedback algorithms. Finally, Simulation results as well as mathematical analysis demonstrates that the proposed echo canceller has faster convergence speed than the conventional LMS echo canceller with nearly equivalent complexity of computation.