• Title/Summary/Keyword: Iteration

Search Result 1,885, Processing Time 0.027 seconds

A Study on Eigen-properties of a 3-Dim. Resonant Cavity by Krylov-Schur Iteration Method (Krylov-Schur 순환법을 이용한 3-차원 원통구조 도파관의 고유특성 연구)

  • Kim, Yeong Min;Lim, Jong Soo
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.51 no.7
    • /
    • pp.142-148
    • /
    • 2014
  • Krylov-Schur iteration method has been applied to the 3-Dim. resonant cavity of a cylindrical form. The vector Helmholtz equation has been analysed for the resonant field strength in homogeneous media by FEM. An eigen-equation has been constructed from element equations basing on tangential edges of the tetrahedra element. This equation made up of two square matrices associated with the curl-curl form of the Helmholtz operator. By performing Krylov-Schur iteration loops on them, Eigen-values and their modes have been determined from the diagonal components of the Schur matrices and its transforming matrices. Eigen-pairs as a result have been revealed visually in the schematic representations. The spectra have been compared with each other to identify the effect of boundary conditions.

Performance Improvement of AD-MUSIC Algorithm Using Newton Iteration (뉴턴 반복을 이용한 AD-MUSIC 알고리즘 성능향상)

  • Paik, Ji Woong;Kim, Jong-Mann;Lee, Joon-Ho
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.28 no.11
    • /
    • pp.880-885
    • /
    • 2017
  • In AD-MUSIC algorithm, DOD/DOA can be estimated without computationally expensive two-dimensional search. In this paper, to further reduce the computational complexity, the Newton type method has been applied to one-dimensional search. In this paper, we summarize the formulation of the AD-MUSIC algorithm, and present how to apply Newton-type iteration to AD-MUSIC algorithm for improvement of the accuracy of the DOD/DOA estimates. Numerical results are presented to show that the proposed scheme is efficient in the viewpoints of computational burden and estimation accuracy.

Policy Iteration Algorithm Based Fault Tolerant Tracking Control: An Implementation on Reconfigurable Manipulators

  • Li, Yuanchun;Xia, Hongbing;Zhao, Bo
    • Journal of Electrical Engineering and Technology
    • /
    • v.13 no.4
    • /
    • pp.1740-1751
    • /
    • 2018
  • This paper proposes a novel fault tolerant tracking control (FTTC) scheme for a class of nonlinear systems with actuator failures based on the policy iteration (PI) algorithm and the adaptive fault observer. The estimated actuator failure from an adaptive fault observer is utilized to construct an improved performance index function that reflects the failure, regulation and control simultaneously. With the help of the proper performance index function, the FTTC problem can be transformed into an optimal control problem. The fault tolerant tracking controller is composed of the desired controller and the approximated optimal feedback one. The desired controller is developed to maintain the desired tracking performance at the steady-state, and the approximated optimal feedback controller is designed to stabilize the tracking error dynamics in an optimal manner. By establishing a critic neural network, the PI algorithm is utilized to solve the Hamilton-Jacobi-Bellman equation, and then the approximated optimal feedback controller can be derived. Based on Lyapunov technique, the uniform ultimate boundedness of the closed-loop system is proven. The proposed FTTC scheme is applied to reconfigurable manipulators with two degree of freedoms in order to test the effectiveness via numerical simulation.

A Random Deflected Subgradient Algorithm for Energy-Efficient Real-time Multicast in Wireless Networks

  • Tan, Guoping;Liu, Jianjun;Li, Yueheng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.10
    • /
    • pp.4864-4882
    • /
    • 2016
  • In this work, we consider the optimization problem of minimizing energy consumption for real-time multicast over wireless multi-hop networks. Previously, a distributed primal-dual subgradient algorithm was used for finding a solution to the optimization problem. However, the traditional subgradient algorithms have drawbacks in terms of i) sensitivity to iteration parameters; ii) need for saving previous iteration results for computing the optimization results at the current iteration. To overcome these drawbacks, using a joint network coding and scheduling optimization framework, we propose a novel distributed primal-dual Random Deflected Subgradient (RDS) algorithm for solving the optimization problem. Furthermore, we derive the corresponding recursive formulas for the proposed RDS algorithm, which are useful for practical applications. In comparison with the traditional subgradient algorithms, the illustrated performance results show that the proposed RDS algorithm can achieve an improved optimal solution. Moreover, the proposed algorithm is stable and robust against the choice of parameter values used in the algorithm.

Low Complexity Hybrid Precoding in Millimeter Wave Massive MIMO Systems

  • Cheng, Tongtong;He, Yigang;Wu, Yuting;Ning, Shuguang;Sui, Yongbo;Huang, Yuan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.4
    • /
    • pp.1330-1350
    • /
    • 2022
  • As a preprocessing operation of transmitter antennas, the hybrid precoding is restricted by the limited computing resources of the transmitter. Therefore, this paper proposes a novel hybrid precoding that guarantees the communication efficiency with low complexity and a fast computational speed. First, the analog and digital precoding matrix is derived from the maximum eigenvectors of the channel matrix in the sub-connected architecture to maximize the communication rate. Second, the extended power iteration (EPI) is utilized to obtain the maximum eigenvalues and their eigenvectors of the channel matrix, which reduces the computational complexity caused by the singular value decomposition (SVD). Third, the Aitken acceleration method is utilized to further improve the convergence rate of the EPI algorithm. Finally, the hybrid precoding based on the EPI method and the Aitken acceleration algorithm is evaluated in millimeter-wave (mmWave) massive multiple-input and multiple-output (MIMO) systems. The experimental results show that the proposed method can reduce the computational complexity with the high performance in mmWave massive MIMO systems. The method has the wide application prospect in future wireless communication systems.

The Optimization of Reconstruction Method Reducing Partial Volume Effect in PET/CT 3D Image Acquisition (PET/CT 3차원 영상 획득에서 부분용적효과 감소를 위한 재구성법의 최적화)

  • Hong, Gun-Chul;Park, Sun-Myung;Kwak, In-Suk;Lee, Hyuk;Choi, Choon-Ki;Seok, Jae-Dong
    • The Korean Journal of Nuclear Medicine Technology
    • /
    • v.14 no.1
    • /
    • pp.13-17
    • /
    • 2010
  • Purpose: Partial volume effect (PVE) is the phenomenon to lower the accuracy of image due to low estimate, which is to occur from PET/CT 3D image acquisition. The more resolution is declined and the lesion is small, the more it causes a big error. So that it can influence the test result. Studied the optimum image reconstruction method by using variation of parameter, which can influence the PVE. Materials and Methods: It acquires the image in each size spheres which is injected $^{18}F$-FDG to hot site and background in the ratio 4:1 for 10 minutes by using NEMA 2001 IEC phantom in GE Discovey STE 16. The iterative reconstruction is used and gives variety to iteration 2-50 times, subset number 1-56. The analysis's fixed region of interest in detail part of image and compute % difference and signal to noise ratio (SNR) using $SUV_{max}$. Results: It's measured that $SUV_{max}$ of 10 mm spheres, which is changed subset number to 2, 5, 8, 20, 56 in fixed iteration to times, SNR is indicated 0.19, 0.30, 0.40, 0.48, 0.45. As well as each sphere's of total SNR is measured 2.73, 3.38, 3.64, 3.63, 3.38. Conclusion: In iteration 6th to 20th, it indicates similar value in % difference and SNR ($3.47{\pm}0.09$). Over 20th, it increases the phenomenon, which is placed low value on $SUV_{max}$ through the influence of noise. In addition, the identical iteration, it indicates that SNR is high value in 8th to 20th in variation of subset number. Therefore, to reduce partial volume effect of small lesion, it can be declined the partial volume effect in iteration 6 times, subset number 8~20 times, considering reconstruction time.

  • PDF

A Variable Latency K'th Order Newton-Raphson's Floating Point Number Divider (가변 시간 K차 뉴톤-랍손 부동소수점 나눗셈)

  • Cho, Gyeong-Yeon
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.9 no.5
    • /
    • pp.285-292
    • /
    • 2014
  • The commonly used Newton-Raphson's floating-point number divider algorithm performs two multiplications in one iteration. In this paper, a tentative K'th Newton-Raphson's floating-point number divider algorithm which performs K times multiplications in one iteration is proposed. Since the number of multiplications performed by the proposed algorithm is dependent on the input values, the average number of multiplications per an operation in single precision and double precision divider is derived from many reciprocal tables with varying sizes. In addition, an error correction algorithm, which consists of one multiplication and a decision, to get exact result in divider is proposed. Since the proposed algorithm only performs the multiplications until the error gets smaller than a given value, it can be used to improve the performance of a floating point number divider unit. Also, it can be used to construct optimized approximate reciprocal tables.