• 제목/요약/키워드: algorithm

검색결과 62,593건 처리시간 0.058초

PSA: A Photon Search Algorithm

  • Liu, Yongli;Li, Renjie
    • Journal of Information Processing Systems
    • /
    • 제16권2호
    • /
    • pp.478-493
    • /
    • 2020
  • We designed a new meta-heuristic algorithm named Photon Search Algorithm (PSA) in this paper, which is motivated by photon properties in the field of physics. The physical knowledge involved in this paper includes three main concepts: Principle of Constancy of Light Velocity, Uncertainty Principle and Pauli Exclusion Principle. Based on these physical knowledges, we developed mathematical formulations and models of the proposed algorithm. Moreover, in order to confirm the convergence capability of the algorithm proposed, we compared it with 7 unimodal benchmark functions and 23 multimodal benchmark functions. Experimental results indicate that PSA has better global convergence and higher searching efficiency. Although the performance of the algorithm in solving the optimal solution of certain functions is slightly inferior to that of the existing heuristic algorithm, it is better than the existing algorithm in solving most functions. On balance, PSA has relatively better convergence performance than the existing metaheuristic algorithms.

Fast short length running FIR structure in discrete wavelet adaptive algorithm

  • 이채욱
    • 융합신호처리학회논문지
    • /
    • 제13권1호
    • /
    • pp.19-25
    • /
    • 2012
  • An adaptive system is a well-known method for removing noise from noise-corrupted speech. In this paper, we perform a least mean square (LMS) based on wavelet adaptive algorithm. It establishes the faster convergence rate of as compared to time domain because of eigenvalue distribution width. And this paper provides the basic tool required for the FIR algorithm whose algorithm reduces the arithmetic complexity. We consider a new fast short-length running FIR structure in discrete wavelet adaptive algorithm. We compare FIR algorithm and short-length fast running FIR algorithm (SFIR) to the proposed fast short-length running FIR algorithm(FSFIR) for arithmetic complexities.

GOST 암호화 알고리즘의 구현 및 분석 (Design and Analysis of the GOST Encryption Algorithm)

  • 류승석;정연모
    • 한국시뮬레이션학회논문지
    • /
    • 제9권2호
    • /
    • pp.15-25
    • /
    • 2000
  • Since data security problems are very important in the information age, cryptographic algorithms for encryption and decryption have been studied for a long time. The GOST(Gosudarstvennyi Standard or Government Standard) algorithm as a data encryption algorithm with a 256-bit key is a 64-bit block algorithm developed in the former Soviet Union. In this paper, we describe how to design an encryption chip based on the GOST algorithm. In addition, the GOST algorithm is compared with the DES(Data Encryption Standard) algorithm, which has been used as a conventional data encryption algorithm, in modeling techniques and their performance. The GOST algorithm whose key size is relatively longer than that of the DES algorithm has been expanded to get better performance, modeled in VHDL, and simulated for implementation with an CPLD chip.

  • PDF

유연자원할당 및 자원제약하의 일정계획을 위한 발견적 알고리즘 (A heuristic algorithm for resource constrained scheduling with flexible resource allocation)

  • 유재건
    • 대한산업공학회지
    • /
    • 제23권2호
    • /
    • pp.433-450
    • /
    • 1997
  • In this study, a heuristic algorithm is developed to solve a resource-constrained scheduling problem. The problem involves multiple projects and multiple resource categories, and allows flexible resource allocation to each activity. The objective is to minimize the maximum completion time. The algorithm takes advantage of the basic structure of a heuristic algorithm, called the exchange heuristic, but employs different strategies on some critical steps of the original algorithm which have significant effects on the algorithm performance. The original algorithm and the modified algorithm were compared through an experimental investigation. The modified algorithm produces significantly shorter schedules than the original algorithm, though it requires up to three times more computation time.

  • PDF

EPC Class 1 RFID 시스템에서 태그 인식 속도 향상을 위한 고속 태그 충돌 방지 알고리즘 (Fast Anti-collision Algorithm for Improving Tag Identification Speed in EPC Class 1 RFID System)

  • 이충희;김재현
    • 한국통신학회논문지
    • /
    • 제33권6B호
    • /
    • pp.450-455
    • /
    • 2008
  • 본 논문에서는 기존의 EPC Class 1 RFID 시스템에서의 태그 인식 절차와 태그 충돌 방지 알고리즘을 분석하였으며, 태그 인식 속도를 향상시키기 위한 고속 충돌 방지 알고리즘을 제안한다. 고속 충돌 방지 알고리즘에서는 태그 인식 과정에서 태그의 충돌 정보를 이용하고, 기존의 알고리즘에서 존재하던 불필요한 절차를 생략하였다. 성능 평가를 위하여 기존의 알고리즘과 제안한 알고리즘을 수학적으로 분석하였고, 이를 시뮬레이션으로 검증하였다. 결과에 따르면, 고속 충돌 방지 알고리즘이 기존의 알고리즘에 비해 상당한 성능향상을 보임을 확인할 수 있었다.

응축형가스보일러의 제어알고리즘 (Control Algorithms of a Condensing Gas Boiler)

  • 한도영;김성학
    • 대한설비공학회:학술대회논문집
    • /
    • 대한설비공학회 2008년도 동계학술발표대회 논문집
    • /
    • pp.399-404
    • /
    • 2008
  • Condensing gas boiler units may make a big role for the reduction of energy consumption in heating industries. In order to decrease the energy consumption of a condensing gas boiler unit, the effective control of the system is necessary. In this study, control algorithms of a condensing gas boiler were developed. Control algorithms are composed of the setpoint algorithm and the control algorithm. The setpoint algorithm consists of the supply water temperature setpoint algorithm and the pump setpoint algorithm. The control algorithm consists of the gas valve control algorithm and the blower control algorithm. In order to analyse the performance of control algorithms, dynamic models of a condensing gas boiler system were used. Simulation results showed that control algorithms developed for this study may be practically applied to the condensing gas boiler.

  • PDF

A return mapping algorithm for plane stress and degenerated shell plasticity

  • Liu, Z.;Al-Bermani, F.G.A.
    • Structural Engineering and Mechanics
    • /
    • 제3권2호
    • /
    • pp.185-192
    • /
    • 1995
  • A numerical algorithm for plane stress and shell elasto-plasticity is presented in this paper. The proposed strain decomposition (SD) algorithm is an elastic predictor/plastic corrector algorithm, and in the context of operator splitting, is a return mapping algorithm. However, it differs significantly from other return mapping algorithms in that only the necessary response functions are used without invoking their gradients, and the stress increment is updated only at the end of the time step. This makes the proposed SD algorithm more suitable for materials with complex yield surfaces and will guard against error accumulation during the time step. Comparative analyses of structural systems using the proposed strain decomposition (SD) algorithm and the iterative radial return (IRR) algorithm are presented. The results demonstrate the accuracy and usefulness of the proposed algorithm.

변류기 포화 곤단 알고리즘으로 억제된 모선보호용 비율 전류차동 계전방식 (A Percentage Current Differential Relaying Algorithm for Bus Protection Blocked by a CT Saturation Detection Algorithm)

  • 강용철;윤재성
    • 대한전기학회논문지:전력기술부문A
    • /
    • 제52권1호
    • /
    • pp.44-49
    • /
    • 2003
  • This paper describes a percentage current differential relaying algorithm for bus protection blocked by a CT saturation detection algorithm. The detection algorithm blocks the output of a current differential relay only if a differential current is caused by CT saturation in the case of an external fault. Moreover, if a current differential relay operates faster than the detection algorithm, the blocking signal is not ignited. On the other hand. if the detection algorithm operates faster than a current differential relay, the output of the relay is blocked. The results of the simulation show that the proposed algorithm can discriminate internal faults from external faults ever when a CT is saturated in both cases. This paper concludes by implementing the algorithm into the TMS320C6701 digital signal processor. The results of hardware implementation are also satisfactory The algorithm can not only increase the sensitivity of the current differential relay but Improve the stability of the relay for an external faults.

An Analysis on the Echo Cancellation Algorithm Reducing the Computational Quantities

  • Lee, Haeng-Woo
    • Journal of information and communication convergence engineering
    • /
    • 제2권2호
    • /
    • pp.89-92
    • /
    • 2004
  • An adaptive algorithm for reducing the hardware complexity is presented. This paper proposes a modified LMS algorithm for the adaptive system and analyzes its convergence characteristics mathematically. An objective of the proposed algorithm is to reduce the hardware complexity. In order to test the performances, it is applied to the echo canceller, and a program is described. The results from simulations show that the echo canceller adopting the proposed algorithm achieves almost the same performances as one adopting the NLMS algorithm. If an echo canceller is implemented with this algorithm, its computation quantities are reduced to the one third as many as the one that is implemented with the NLMS algorithm, without so much degradation of performances.

Highly Efficient and Precise DOA Estimation Algorithm

  • Yang, Xiaobo
    • Journal of Information Processing Systems
    • /
    • 제18권3호
    • /
    • pp.293-301
    • /
    • 2022
  • Direction of arrival (DOA) estimation of space signals is a basic problem in array signal processing. DOA estimation based on the multiple signal classification (MUSIC) algorithm can theoretically overcome the Rayleigh limit and achieve super resolution. However, owing to its inadequate real-time performance and accuracy in practical engineering applications, its applications are limited. To address this problem, in this study, a DOA estimation algorithm with high parallelism and precision based on an analysis of the characteristics of complex matrix eigenvalue decomposition and the coordinate rotation digital computer (CORDIC) algorithm is proposed. For parallel and single precision, floating-point numbers are used to construct an orthogonal identity matrix. Thus, the efficiency and accuracy of the algorithm are guaranteed. Furthermore, the accuracy and computation of the fixed-point algorithm, double-precision floating-point algorithm, and proposed algorithm are compared. Without increasing complexity, the proposed algorithm can achieve remarkably higher accuracy and efficiency than the fixed-point algorithm and double-precision floating-point calculations, respectively.