• The Transactions of the Korean Institute of Electrical Engineers P
• /
• v.59 no.1
• /
• pp.53-57
• /
• 2010

Low-density parity-check (LDPC) codes with belief-propagation (BP) algorithm achieve a remarkable performance close to the Shannon limit at reasonable decoding complexity. Conventionally, each iteration in decoding process contains two steps, the horizontal step and the vertical step. In this paper, an efficient implementation of the adaptive offset min-sum (AOMS) algorithm for decoding LDPC codes using the single-step method is proposed. Furthermore, the performances of the AOMS algorithm compared with belief-propagation (BP) algorithm are investigated. The algorithms using the single-step method reduce the implementation complexity, speed up the decoding process and have better efficiency in terms of memory requirements.

• Journal of information and communication convergence engineering
• /
• v.8 no.3
• /
• pp.307-311
• /
• 2010

EPCglobal Class-1 Gen-2 protocol has been proposed for UHF-band RFID systems. In Gen-2 standard, Q-algorithm was proposed to select a frame size for the next query round without estimating the number of tags. Therefore, the Q-algorithm has advantage that the reader's algorithm is simpler than other algorithms. However, it is impossible to allocate the optimized frame size. Also, the original Q-algorithm did not define an optimized parameter C for adjusting the frame size. In this paper, we propose an adaptive Q-algorithm with the different parameter $C_c$ and $C_i$ in accordance with the status of reply slot. Simulation results show that the proposed adaptive Q-algorithm outperforms the original Gen-2 Q-algorithm.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.51 no.8
• /
• pp.344-351
• /
• 2002

The proposed immune algorithm has an uncomplicated structure and memory-cell mechanism as the optimization algorithm which imitates the principle of humoral immune response. We use the proposed algorithm to solve parameter optimization problems. Up to now, the applications of immune algorithm have been optimization problems with non-varying system parameters. Therefore the usefulness of memory-cell mechanism in immune algorithm is without. This paper proposes the immune algorithm using a memory-cell mechanism which can be the application of system with nonlinear varying parameters. To verified performance of the proposed immune algorithm, the speed control of nonlinear DC motor are performed. The results of Computer simulations represent that the proposed immune algorithm shows a fast convergence speed and a good control performances under the varying system parameters.

• Journal of Advanced Marine Engineering and Technology
• /
• v.32 no.1
• /
• pp.192-199
• /
• 2008

In order for a mobile robot to move under unknown or uncertain environment. it is very important to collect environmental information. This paper suggests a traveling algorithm which leads to the map building algorithm and the $A^*$ algorithm under the assumption that environmental information should already be collected. In order to apply the proposed traveling algorithm to a real mobile robot. this paper additionally discusses a path amendment algorithm. For the purpose of verifying the proposed algorithms, several simulations are executed based on a UI host program-based simulation interface and an experiment is executed using a mobile robot under a real unknown environment.

• Journal of Institute of Control, Robotics and Systems
• /
• v.2 no.3
• /
• pp.242-247
• /
• 1996

In this paper, an optimal coning compensation algorithm for strapdown system is proposed by minimizing the coning error. The proposed algorithm is derived as a generalized form in that it contains the class of the existing coning algorithms and allows the design of optimal algorithm for various combinations of gyro samples. It is shown the magnitude of resulting algorithm errors depends mainly on the total number of gyro samples including present and previous gyro samples. Based on the results, the proposed algorithm enables the algorithm designers to develop the effective coning compensation algorithm according to their attitude computation specifications with ease. In addition, the multirate method which can efficiently implement the algorithm is presented.

• Proceedings of the SAREK Conference
• /
• 2009.06a
• /
• pp.161-166
• /
• 2009

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 boiler unit, the effective operation is necessary. In this study, the supply water temperature algorithm of a condensing gas boiler was developed. This includes the setpoint algorithm and the control algorithm of the supply water temperature. The setpoint algorithm was developed by the fuzzy logic and the control algorithm was developed by the proportional integral algorithm. In order to analyse the performance of the supply water temperature algorithm, the dynamic model of a condensing gas boiler system was used. Simulation results showed that the supply water temperature algorithm developed for this study may be practically applied for the control of the condensing gas boiler.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.32A no.5
• /
• pp.14-23
• /
• 1995

A new dual-mode algorithm for blind equalization of quadrature amplitude modulation (QAM) signals is proposed. To solve the problem that the constant modulus algorithm (CMA) converges to the constellation with the arbitrary phase rotation, with the modification of the CMA, the proposed algorithm accomplishes blind equalization and carrier phase recovery simultaneously. In addition, the dual-mode algorithm combining the modified constant modulus algorithm (MCMA) with decision-directed (DD) algorithm achieves the performance enhancement of blind convergence speed and steady-state residual ISI. So we can refer the proposed algorithm to as a scheme for joint blind equalization and carrier phase recovery. Simulation results for i.i.d. input signals confirm that the dual-mode algorithm results in faster convergence speed, samller residual ISI, and better carrier phase recovery than those of the CMA and DD algorithm without any significant increase in computational complexity.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.21 no.4
• /
• pp.96-103
• /
• 2007

In this paper, we present a novel and numerically efficient algorithm for high resolution TOA(Time Of Arrival) estimation under indoor radio propagation channels. The proposed algorithm is not dependent on the structure of receivers, i.e, it can be used with either coherent or non-coherent receivers. The TOA estimation algorithm is based on a high resolution frequency estimation algorithm of Minimum-norm. The efficiency of the proposed algorithm relies on numerical analysis techniques in computing signal or noise subspaces. The algorithm is based on the two step procedures, one for transforming input data to frequency domain data and the other for estimating the unknown TOA using the proposed efficient algorithm. The efficiency in number of operations over other algorithms is presented. The performance of the proposed algorithm is investigated by means of computer simulations.. Throughout the analytic and computer simulation results, we show that the proposed algorithm exhibits superior performance in estimating TOA estimation with limited computational cost.

• 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.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.52 no.10
• /
• pp.591-597
• /
• 2003

In this paper, a best-basis selection algorithm that improves the performance of the coding gains and the computational complexity is proposed. The proposed algorithm limits the computational complexity according to the resolved threshold value and decomposes the parent subbands by using the top-down tree search and the relative energy between the parent subbands and the child subbands. For the experiments of the proposed algorithm, the bit-rates, the peak signal-to-noise ratio (PSNR), and the reconstructed images are presented by using the Quad-tree coder. The result of the proposed algorithm is compared to that of DWT algorithm using the Quad-tree coder for a set of standard test images. In addition, the result of the proposed algorithm is compared to that of JPEG-2000 algorithm and that of S+P algorithm.