• Title/Summary/Keyword: Optimum Algorithm

Search Result 1,626, Processing Time 0.042 seconds

A Parallel Equalization Algorithm with Weighted Updating by Two Error Estimation Functions (두 오차 추정 함수에 의해 가중 갱신되는 병렬 등화 알고리즘)

  • Oh, Kil-Nam
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.49 no.7
    • /
    • pp.32-38
    • /
    • 2012
  • In this paper, to eliminate intersymbol interference of the received signal due to multipath propagation, a parallel equalization algorithm using two error estimation functions is proposed. In the proposed algorithm, multilevel two-dimensional signals are considered as equivalent binary signals, then error signals are estimated using the sigmoid nonlinearity effective at the initial phase equalization and threshold nonlinearity with high steady-state performance. The two errors are scaled by a weight depending on the relative accuracy of the two error estimations, then two filters are updated differentially. As a result, the combined output of two filters was to be the optimum value, fast convergence at initial stage of equalization and low steady-state error level were achieved at the same time thanks to the combining effect of two operation modes smoothly. Usefulness of the proposed algorithm was verified and compared with the conventional method through computer simulations.

Optimal Methodology of a Composite Leaf Spring with a Multipurpose Small Commercial Vans (다목적 소형 승합차 복합재 판 스프링의 적층 최적화 기법)

  • Ahn, Sang Ho
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.31 no.5
    • /
    • pp.243-250
    • /
    • 2018
  • In this paper, design technique using genetic algorithms(GA) for design optimization of composite leaf springs is presented here. After the initial design has been validated by the car plate spring as a finite element model, the genetic algorithm suggests the process of optimizing the number of layers of composite materials and their angles. Through optimization process, the weight reduction process of leaf springs and the number of repetitions are compared to the existing algorithm results. The safety margin is calculated by organizing a finite element model to verify the integrity of the structure by applying an additive sequence optimized through the genetic algorithm to the structure. When GA is applied, layer thickness and layer angle of complex leaf springs have been obtained, which contributes to the achievement of minimum weight with appropriate strength and stiffness. A reduction of 65.6% original weight is reached when a leaf steel spring is replaced with a leaf composite spring under identical requirement of design parameters and optimization.

The Optimum SIR-Based Downlink Power Control for HAP W-CDMA (HAP W-CDMA 시스템을 위한 SIR 기반의 최적 다운링크 전력 제어)

  • Kang, Young-Heung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.6A
    • /
    • pp.642-647
    • /
    • 2007
  • HAP(High Altitude Platform) systems have been proposed due to their unique advantages over terrestrial and satellite systems as the alternative wireless communication system to deliver the third generation IMT-2000 wireless services. It has been required to study for the power control in W-CDMA HAP system as well as the terrestrial mobile system in order to mitigate interference and increase the capacity. In this paper, a new power control has been proposed for HAP system considering the interference profile into the DB(distributed balancing) SIR(signal to interference ratio)-based algorithm which has been considered in terrestrial system, and estimated by the outage performance of the proposed DB algorithm is better remarkably than DBPA(distance-based power allocation) which is proposed for HAP system, and it is the same regardless of the antenna maximum gain and its sidelobe characteristics.

A Concurrent MCMA-DD Equalizer with Initial Convergence Detection (초기 수렴 검출 기능을 갖는 동시 MCMA-DD 등화기)

  • Kim, Chul-Min;Choi, Ik-Hyun;Oh, Kil-Nam;Choi, Soo-Chul
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • v.9 no.2
    • /
    • pp.477-480
    • /
    • 2005
  • CMA-DD is proposed to improve the steady-state performance of CMA and its performance is depending on switching time between two modes of operation. Castro et al. who proposed a concurrent equalizer for solving problem of CMA-DD, which reduced the sensibility of switching time. However, concurrent algorithm has a problem that it keeps working after convergence. In this paper, we propose concurrent MCMA-DD equalizer combined modified CMA(MCMA) and DD mode for making better concurrent algorithm. The proposed equalizer is better than previous algorithm in convergence speed and steady-state performance. Also, the proposed algorithm decides optimum switching time using residual ISI of the equalizer output.

  • PDF

Optimum Design of Neural Networks for Flight Control System (신경회로망 구조 최적화를 통한 비행제어시스템 설계)

  • Choe,Gyu-Ho;Choe,Dong-Uk;Kim,Yu-Dan
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.31 no.7
    • /
    • pp.75-84
    • /
    • 2003
  • To reduce the effects of the uncertainties due to the modeling error and aerodynamic coefficients, a nonlinear adaptive control system based on neural networks is proposed . Neural networks parameters are adjusted by using an adaptive law. The sliding mode control scheme is used to compensate for the effect of the approximation error of neural networks. Control parameters and neural networks structures are optimized to obtain better performance by using the genetic algorithm. By introducing the concept of multi-groups of populations, the genetic algorithm is modified so that individuals and groups can be simultaneously evolved . To verify the performance of the pro posed algorithm, the optimized neural networks control system is applied to an aircraft longitudinal dynamics.

An Efficient Routing Path Search Technique in Power Line Communication (효율적인 전력선통신 라우팅 경로 탐색 기법)

  • Seo, Chung-Ki;Kim, Jun-Ha;Jung, Joonhong
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.67 no.9
    • /
    • pp.1216-1223
    • /
    • 2018
  • As field of application of AMI, AMR uses the power line as the primary means of communication. PLC has a big merit without installation of the new network for communication in a field using the power line which is the existing equipment. However, there is a serious obstacle in commercialization for the instability by noise and communication environment. Therefore, the technical method for maintaining the communication state which overcome such demerit and was stabilized is required essentially. PLC routing technology is applied with the alternative plan now. The routing technology currently managed by field includes many problems by applying the algorithm of an elementary level. PLC routing path search problem can be modeled with the problem of searching for optimal solution as similar to such as optimal routing problem and TSP(Travelling salesman problem). In this paper, in order to search for a PLC routing path efficiently and to choose the optimal path, GA(Genetic Algorithm) was applied. Although PLC was similar in optimal solution search as compared with typical GA, it also has a difference point by the characteristic of communication, and presented the new methodology over this. Moreover, the validity of application technology was verified by showing the experimental result to which GA is applied and analyzing as compared with the existing algorithm.

Transmit Power and Access Point Selection Algorithm: TA Link and AT Link (전송전력과 엑세스 포인트 선정 알고리즘: AT 링크와 TA 링크)

  • Oh, Changyoon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.24 no.8
    • /
    • pp.1022-1029
    • /
    • 2020
  • We investigate the joint selection problem of the transmit power level and the best access point for multi-access points. We further reduce the transmit power by jointly optimizing the transmit power and the access point selection. Our aim is to minimize the total transmit power, while each terminal maintains minimum signal to interference ratio requirement. We observe that the optimum solution can be achieved through proposed iterative algorithm for both TA link and AT link. Simulation results show that proposed algorithm (joint optimization of transmit power level and access point) outperforms the algorithm which optimizes the transmit power only. We also observe that the duality between the TA link and AT link does not hold in multi-access points environment. Accordingly, the resulting power vectors and the access point vectors for TA link and AT link are different in general.

Implementation of RSA Exponentiator Based on Radix-$2^k$ Modular Multiplication Algorithm (Radix-$2^k$ 모듈라 곱셈 알고리즘 기반의 RSA 지수승 연산기 설계)

  • 권택원;최준림
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.12 no.2
    • /
    • pp.35-44
    • /
    • 2002
  • In this paper, an implementation method of RSA exponentiator based on Radix-$2^k$ modular multiplication algorithm is presented and verified. We use Booth receding algorithm to implement Radix-$2^k$ modular multiplication and implement radix-16 modular multiplier using 2K-byte memory and CSA(carry-save adder) array - with two full adder and three half adder delays. For high speed final addition we use a reduced carry generation and propagation scheme called pseudo carry look-ahead adder. Furthermore, the optimum value of the radix is presented through the trade-off between the operating frequency and the throughput for given Silicon technology. We have verified 1,024-bit RSA processor using Altera FPGA EP2K1500E device and Samsung 0.3$\mu\textrm{m}$ technology. In case of the radix-16 modular multiplication algorithm, (n+4+1)/4 clock cycles are needed and the 1,024-bit modular exponentiation is performed in 5.38ms at 50MHz.

Robust optimum design of MTMD for control of footbridges subjected to human-induced vibrations via the CIOA

  • Leticia Fleck Fadel Miguel;Otavio Augusto Peter de Souza
    • Structural Engineering and Mechanics
    • /
    • v.86 no.5
    • /
    • pp.647-661
    • /
    • 2023
  • It is recognized that the installation of energy dissipation devices, such as the tuned mass damper (TMD), decreases the dynamic response of structures, however, the best parameters of each device persist hard to determine. Unlike many works that perform only a deterministic optimization, this work proposes a complete methodology to minimize the dynamic response of footbridges by optimizing the parameters of multiple tuned mass dampers (MTMD) taking into account uncertainties present in the parameters of the structure and also of the human excitation. For application purposes, a steel footbridge, based on a real structure, is studied. Three different scenarios for the MTMD are simulated. The proposed robust optimization problem is solved via the Circle-Inspired Optimization Algorithm (CIOA), a novel and efficient metaheuristic algorithm recently developed by the authors. The objective function is to minimize the mean maximum vertical displacement of the footbridge, whereas the design variables are the stiffness and damping constants of the MTMD. The results showed the excellent capacity of the proposed methodology, reducing the mean maximum vertical displacement by more than 36% and in a computational time about 9% less than using a classical genetic algorithm. The results obtained by the proposed methodology are also compared with results obtained through traditional TMD design methods, showing again the best performance of the proposed optimization method. Finally, an analysis of the maximum vertical acceleration showed a reduction of more than 91% for the three scenarios, leading the footbridge to acceleration values below the recommended comfort limits. Hence, the proposed methodology could be employed to optimize MTMD, improving the design of footbridges.

Finding the One-to-One Optimum Path Considering User's Route Perception Characteristics of Origin and Destination (Focused on the Origin-Based Formulation and Algorithm) (출발지와 도착지의 경로인지특성을 반영한 One-to-One 최적경로탐색 (출발지기반 수식 및 알고리즘을 중심으로))

  • Shin, Seong-Il;Sohn, Kee-Min;Cho, Chong-Suk;Cho, Tcheol-Woong;Kim, Won-Keun
    • Journal of Korean Society of Transportation
    • /
    • v.23 no.7 s.85
    • /
    • pp.99-110
    • /
    • 2005
  • Total travel cost of route which connects origin with destination (O-D) is consist of the total sum of link travel cost and route perception cost. If the link perception cost is different according to the origin and destination, optimal route search has limitation to reflect the actual condition by route enumeration problem. The purpose of this study is to propose optimal route searching formulation and algorithm which is enable to reflect different link perception cost by each route, not only avoid the enumeration problem between origin and destination. This method defines minimum unit of route as a link and finally compares routes using link unit costs. The proposed method considers the perception travel cost at both origin and destination in optimal route searching process, while conventional models refect the perception cost only at origin. However this two-way searching algorithm is still not able to guarantee optimum solution. To overcome this problem, this study proposed an orign based optimal route searching method which was developed based on destination based optimal perception route tree. This study investigates whether proposed numerical formulas and algorithms are able to reflect route perception behavior reflected the feature of origin and destination in a real traffic network by the example research including the diversity of route information for the surrounding area and the perception cost for the road hierarchy.