• Title/Summary/Keyword: A* algorithm

Search Result 54,128, Processing Time 0.059 seconds

Anti-collision Algorithm with Early Cancellation of Query Round in RFID Systems

  • Lim, In-Taek
    • Journal of information and communication convergence engineering
    • /
    • v.7 no.3
    • /
    • pp.292-296
    • /
    • 2009
  • The performance of anti-collision algorithm in RFID systems, which are based on FSA algorithm, may be affected by the frame size a query round. In this paper, an anti-collision algorithm with early cancellation of query round is proposed to enhance the performance of EPCglobal Class-1 Gen-2. The Q-algorithm calculates a Q value to determine the next frame size during a query round. In the proposed algorithm, if the new Q value is different from the previous one, the reader transmits a QueryAdjust command to cancel the current query round. The simulation results show that the proposed algorithm can have a stable performance irrespective of the C value of Q-algorithm and the number of tags.

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

  • 류승석;정연모
    • Journal of the Korea Society for Simulation
    • /
    • v.9 no.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

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

  • Han, Do-Young;Kim, Sung-Hak
    • Proceedings of the SAREK Conference
    • /
    • 2008.11a
    • /
    • 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

Performance Evaluation of Lower Complexity Hybrid-Fix-and-Round-LLL Algorithm for MIMO System

  • Lv, Huazhang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.6
    • /
    • pp.2554-2580
    • /
    • 2018
  • Lenstra-Lenstra-$Lov{\acute{a}}sz$ (LLL) is an effective receiving algorithm for Multiple-Input-Multiple-Output (MIMO) systems, which is believed can achieve full diversity in MIMO detection of fading channels. However, the LLL algorithm features polynomial complexity and shows poor performance in terms of convergence. The reduction of algorithmic complexity and the acceleration of convergence are key problems in optimizing the LLL algorithm. In this paper, a variant of the LLL algorithm, the Hybrid-Fix-and-Round LLL algorithm, which combines both fix and round measurements in the size reduction procedure, is proposed. By utilizing fix operation, the algorithmic procedure is altered and the size reduction procedure is skipped by the hybrid algorithm with significantly higher probability. As a consequence, the simulation results reveal that the Hybrid-Fix-and-Round-LLL algorithm carries a faster rate of convergence compared to the original LLL algorithm, and its algorithmic complexity is at most one order lower than original LLL algorithm in real field. Comparing to other families of LLL algorithm, Hybrid-Fix-and-Round-LLL algorithm can make a better compromise in performance and algorithmic complexity.

A Fast Median Filter Algorithm for Noised Digital Image (가산잡음에 대한 고속 메디안 필터 알고리즘)

  • Kwon, Kee-Hong
    • Journal of the Korean Institute of Telematics and Electronics T
    • /
    • v.35T no.2
    • /
    • pp.13-19
    • /
    • 1998
  • The Median of a set of number is a number which partitions the given set. The specified numbers of a set partitions in one subset and in another subset. In Image Processing, The Sorting method of numbers of one subset equal to the previous Median Filtering. but The Sorting method of numbers of another subset not equal to in the other. In this paper, a fast two-dimentional Median Filtering Algorithm is proposed. The Algorithm designed in such a during the partitioning of the previous window are used. Test results obtained by running the Algorithm on IBM PC(586) are presented and its filtering. It is shown that the proposed Algorithm's processing time is faster and independent of the number of bits used to represent the data values.

  • PDF

Design of a New VSS-Adaptive Filter for a Potential Application of Active Noise Control to Intake System (흡기계 능동소음제어를 위한 적응형 필터 알고리즘의 개발)

  • Kim, Eui-Youl;Kim, Ho-Wuk;Lee, Sang-Kwon
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 2009.10a
    • /
    • pp.231-239
    • /
    • 2009
  • The filtered-x LMS (FX-LMS) algorithm has been applied to the active noise control (ANC) system in an acoustic duct. This algorithm is designed based on the FIR (finite impulse response) filter, but it has a slow convergence problem because of a large number of zero coefficients. In order to improve the convergence performance, the step size of the LMS algorithm was modified from fixed to variable. However, this algorithm is still not suitable for the ANC system of a short acoustic duct since the reference signal is affected by the backward acoustic wave propagated from a secondary source. Therefore, the recursive filteredu LMS algorithm (FU-LMS) based on infinite impulse response (IIR) is developed by considering the backward acoustic propagation. This algorithm, unfortunately, generally has a stability problem. The stability problem was improved by using an error smoothing filter. In this paper, the recursive LMS algorithm with variable step size and smoothing error filter is designed. This recursive LMS algorithm, called FU-VSSLMS algorithm, uses an IIR filter. With fast convergence and good stability, this algorithm is suitable for the ANC system in a short acoustic duct such as the intake system of an automotive. This algorithm is applied to the ANC system of a short acoustic duct. The disturbance signals used as primary noise source are a sinusoidal signal embedded in white noise and the chirp signal of which the instantaneous frequency is variable. Test results demonstrate that the FU-VSSLMS algorithm has superior convergence performance to the FX-LMS algorithm and FX-LMS algorithm. It is successfully applied to the ANC system in a short duct.

  • PDF

Delay Time Estimation in Frequency Selective Fading Channels

  • Lee Kwan-Houng;Song Woo-Young
    • Journal of information and communication convergence engineering
    • /
    • v.3 no.3
    • /
    • pp.119-121
    • /
    • 2005
  • This paper aims to estimate the delay time of multiple signals in a multi-path environment. It also seeks to carry out a comparative analysis with the existing delay time under the proposed algorithm to develop a new algorithm that applies the space average method in a MUSIC algorithm. Unlike the existing delay time estimation algorithm, the developed algorithm was able to estimate the delay time in 5ns low. Therefore, the algorithm proposed in this paper improved the existing delay time estimated algorithm.

Modified BECM(M-BECM) algorithm for all-digital high speed symbol synchronization (고속 all-digital 심볼동기 위한 modified-BECM(M-BECM) 알고리즘)

  • 이경하;김용훈;최형진
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.33A no.7
    • /
    • pp.34-43
    • /
    • 1996
  • In this paper a simpel algorithm for all-digial high speed symbol synchronization is proposed. The proposed algorithm has a structure based on BECM (band-edge component maximization). The algorithm requires only tow samples per symbol for its operation. We analyze and evaluate performance of the proposed algorithm. Simulation results reveal that the proposed algorithm has better performance than the gardner algorithm in narrowband.

  • PDF

A Hybridization of Adaptive Genetic Algorithm and Particle Swarm Optimization for Numerical Optimization Functions

  • Yun, Young-Su;Gen, Mitsuo
    • Proceedings of the Korea Society for Industrial Systems Conference
    • /
    • 2008.10b
    • /
    • pp.463-467
    • /
    • 2008
  • Heuristic optimization using hybrid algorithms have provided a robust and efficient approach for solving many optimization problems. In this paper, a new hybrid algorithm using adaptive genetic algorithm (aGA) and particle swarm optimization (PSO) is proposed. The proposed hybrid algorithm is applied to solve numerical optimization functions. The results are compared with those of GA and other conventional PSOs. Finally, the proposed hybrid algorithm outperforms others.

  • PDF

A MODIFIED BFGS BUNDLE ALGORITHM BASED ON APPROXIMATE SUBGRADIENTS

  • Guo, Qiang;Liu, Jian-Guo
    • Journal of applied mathematics & informatics
    • /
    • v.28 no.5_6
    • /
    • pp.1239-1248
    • /
    • 2010
  • In this paper, an implementable BFGS bundle algorithm for solving a nonsmooth convex optimization problem is presented. The typical method minimizes an approximate Moreau-Yosida regularization using a BFGS algorithm with inexact function and the approximate gradient values which are generated by a finite inner bundle algorithm. The approximate subgradient of the objective function is used in the algorithm, which can make the algorithm easier to implement. The convergence property of the algorithm is proved under some additional assumptions.