• Journal of the Korean Operations Research and Management Science Society
• /
• v.23 no.3
• /
• pp.17-26
• /
• 1998

Shortest path problem in road network with turn penalties and prohibitions frequently arises from various transportation optimization models. In this paper, we propose a new algorithm for the shortest Path problem with turn prohibitions and delays. The proposed algorithm maintains distance labels of arcs, which is similar to labels of nodes of Dijkstra's algorithm. Fibonacci heap implementation of the proposed algorithm solves the problem in O(mn ＋ mlogm). We provide a new insight in transforming network with turn penalties and prohibitions into another network in which turn penalties and prohibitions are implicitly considered. The proposed algorithm is implemented using new data structure and compared with Ziliaskopoulos' algorithm. Computational results show that the proposed algorithm is very efficient.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.9 no.1
• /
• pp.95-102
• /
• 2013

This paper covers nulling algorithm. In this algorithm, we assume that nulling points are already known. In general, nulling algorithm using matrix equation was utilized. But, this algorithm is pointed out that computational complexity is disadvantage. So, we choose gradient method to reduce the computational complexity. In order to further reduce the computational complexity, we propose approximate gradient method using characteristic of trigonometric functions. The proposed method has same performance compared with conventional method while having half the amount of computation when the number of antenna and nulling point are 20 and 1, respectively. In addition, we could virtually eliminate the trigonometric functions arithmetic. Trigonometric functions arithmetic cause a big problem in actual implementation like FPGA processor(Field Programmable gate array). By utilizing the above algorithm in a multi-cell environment, beamforming gain can be obtained and interference can be reduced at same time. By the above results, the algorithm can show excellent performance in the cell boundary.

• ETRI Journal
• /
• v.26 no.5
• /
• pp.432-436
• /
• 2004

In this paper, we propose the modified uniformly most powerful (UMP) belief-propagation (BP)-based decoding algorithm which utilizes multiplicative and additive factors to diminish the errors introduced by the approximation of the soft values given by a previously proposed UMP BP-based algorithm. This modified UMP BP-based algorithm shows better performance than that of the normalized UMP BP-based algorithm, i.e., it has an error performance closer to BP than that of the normalized UMP BP-based algorithm on the additive white Gaussian noise channel for low density parity check codes. Also, this algorithm has the same complexity in its implementation as the normalized UMP BP-based algorithm.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.16 no.4
• /
• pp.537-544
• /
• 2013

This paper proposes a recursive localized Normalized Mutual Information(NMI) algorithm to overcome shortcomings of the conventional NMI algorithm and the localized NMI algorithm which proposed before. The localized NMI algorithm divides images into few fixed size segments and applies NMI algorithm to each segments. By extension, the proposed algorithm uses variable size segments using its characteristic. Dividing each segment recursively, the algorithm selects a suitable segment size and improves a performance of the image registration. Experimental result shows the performance of the proposed algorithm.

• Journal of Auto-vehicle Safety Association
• /
• v.14 no.4
• /
• pp.6-15
• /
• 2022

In this study, a traffic light recognition algorithm was implemented and validated for low-speed special purpose vehicles in an urban environment. Real-time image data using a camera and YOLO algorithm were applied. Two methods were presented to increase the accuracy of the traffic light recognition algorithm, and it was confirmed that the second method had the higher accuracy according to the traffic light type. In addition, it was confirmed that the optimal YOLO algorithm was YOLO v5m, which has over 98% mAP values and higher efficiency. In the future, it is thought that the traffic light recognition algorithm can be used as a dual system to secure the platform safety in the traffic information error of C-ITS.

• Journal of the Chungcheong Mathematical Society
• /
• v.15 no.2
• /
• pp.85-96
• /
• 2003

An efficient algorithm for the multiplication in a binary finite filed using a normal basis representation of $F_{2^m}$ is discussed and proposed for software implementation of elliptic curve cryptography. The algorithm is developed by using the storage scheme of sparse matrices.

• Proceedings of the IEEK Conference
• /
• 2004.06b
• /
• pp.481-484
• /
• 2004

To make production and equipment investment plans in semiconductor Line, implementation of many variables is needed. But these factors could bring many changes and the result is hard to predict. Because prediction is hard, it is hard to make a standard. So this project established Semiconductor production plans using LP Algorithm to satisfy all the conditions from the factors and came up with thesis on reasonable and standardized process.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1994.06c
• /
• pp.199-204
• /
• 1994

In this paper, we researched abut CELP speech coding algorithm using efficlent pseudo-stochastic block codes, adaptive-codebook and improved fixed-gain codebook. The pseudo-stochastic block codes refer to stochastically populated block codes in which the adjacent codewords in an innovation codebook are non-independent. The adaptive-codebook was made with previous prediction speech data by storage-shift register. This CELP coding algorithm enables the coding of toll quality speech at bit rates from 4.8kbits/s to 9.6 kbits/s. This algorithm was realized TMS320C30 microprocessor in realtime.

• Proceedings of the IEEK Conference
• /
• 2003.07d
• /
• pp.1503-1506
• /
• 2003

In this paper, we propose a mutual Authentication module, using ECDSA(Elliptic Curve Digital Signature Algorithm) for web-Camera system. which. is based on three module. first is authentication module which is based on ECDSA algorithm. second is transfort module using stream socket. the last module is graphic module. This paper describes cipher algorithm which can be used restrict condition for the same secret service with wire internet. we made a authentication module using based client and server system.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.1195-1198
• /
• 1998

A Novel Stop-&-Go Algorithm which incorporate a Bank structure for blind equalization is investigated in this paper. 16-QAM and $\pi/4-DQPSK$ modulation used in this paper. A Proposed novel algorithm of characteristic is high speed transfer by implementation of the equalization algorithm with less computations capacity. The computer simulations result reveal that the proposed Novel Stop-&-Go shows the comparable performance to the conventional Stop-&-Go, while requiring much less computations.