• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2002.05a
• /
• pp.1-8
• /
• 2002

A Branch-and-Cut algorithm is a branch-and-bound algorithm in which rutting planes are generated throughout the branch-and-bound tree. It is now one of the most widespread and successful methods for solving mixed integer programming problems. In this paper we presents efficient implementation techniques of branch-and-cut algorithm for miked integer programming problems.

• Journal of The Korean Association of Information Education
• /
• v.17 no.3
• /
• pp.233-242
• /
• 2013

"Problem-solving methods and procedures" sections in the 2009 revised informatics curriculum emphasized active use of algorithmic thinking to solve problems. And it is proposed to solve the various problems of real life using programming language for the implementation of the algorithm. Recently, various Educational Programming Language has been developed for elementary programming activity and many researches showed that students' cognitive burden was reduced in learning programming language with Educational Programming Languages. However implementation of the algorithm is difficult for novice programmer. For the reason, effective way is required for elementary students to connect design of the algorithm and implementation of the algorithm. Therefore, in this study propose the algorithm design worksheets that it is possible to create an algorithm to describe the content needed to implementation in programming education. And this study proved the effect of the algorithm design learning tools through experiment.

• 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 the Korea Society of Computer and Information
• /
• v.19 no.8
• /
• pp.1-10
• /
• 2014

This paper proposes a parallel implementation of the video based 4-stage fire detection algorithm using a general-purpose graphics processing unit (GPGPU) to support real-time processing of the high computational algorithm. In addition, this paper compares the performance of the GPGPU based fire detection implementation with that of the CPU implementation to show the effectiveness of the proposed method. Experimental results using five fire included videos with an SXGA ($1400{\times}1050$) resolution, the proposed GPGPU implementation achieves 6.6x better performance that the CPU implementation, showing 30.53ms per frame which satisfies real-time processing (30 frames per second, 30fps) of the fire detection algorithm.

• Journal of the Institute of Convergence Signal Processing
• /
• v.11 no.1
• /
• pp.41-46
• /
• 2010

In this paper, the DoA(Direction of Arrival) estimator using unitary MUSIC algorithm is studied. The complex-valued correlation matrix of MUSIC algorithm is transformed to the real-valued one using unitary transform for easy implementation. The eigenvalue and eigenvector are obtained by the combined Jacobi-CORDIC algorithm. CORDIC algorithm can be implemented by only ADD and SHIFT operations and MUSIC spectrum computed by 256 point DFT algorithm. Results of unitary MUSIC algorithm designed by System Generator for FPGA implementation is entirely consistent with Matlab results. Its performance is evaluated through hardware co-simulation and resource estimation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.12
• /
• pp.2326-2339
• /
• 2011

To reduce the implementation complexity of the Vertical Bell Labs layered space-time (V-BLAST) systems with respect to the zero-forcing (ZF) criterion, a computationally efficient recursive algorithm is proposed. A fast implementation of the proposed algorithm is developed and its complexity is analyzed in detail. The proposed algorithm matches the ZF-OSIC detection well, and its three significant advantages can be demonstrated by analyses and simulations. Firstly, its speedups over the conventional ZF-OSIC with norm-based ordering, the original fast recursive algorithm (FRA) and the fastest known algorithm (FKA) in the number of flops are 1.58, 2.33 and 1.22, respectively. Secondly, a much simpler implementation than FRA and FKA can be expected. Finally, the storage requirements are lower than those of FRA and FKA. These advantages make the proposed algorithm more efficient and practical.

• Journal of the Institute of Convergence Signal Processing
• /
• v.3 no.3
• /
• pp.63-69
• /
• 2002

Detailed routing is a problem assigning each net to a track after global routing. The most popular algorithms for detailed routing include left-edge algorithm, dogleg algorithm, and greedy channel routing algorithm. In this paper we propose a genetic algorithm searching solution space for the detailed routing problem. We compare the performance of proposed genetic algorithm(GA) for detailed routing with that of greedy channel routing algorithm by analyzing the results of each implementation.

• Proceedings of the IEEK Conference
• /
• 2000.11b
• /
• pp.297-300
• /
• 2000

This paper proposes a high-speed and area-efficient FFT algorithm and performs a hardware implementation. This algorithm, named by “Radix-4/2”, uses the feature of existing radix-2$^3$algorithm, It reduces the number of non-trivial multipliers in SFG to the ratio of 3 to 2 campared with radix-2 or radix-4 algorithm and radix-4/2 has also twice throughput as radix-2$^3$algorithm's. It is proved that FFT processor using the proposed algorithm and 64-point MDC pipeline architecture has twice throughput as radix-2$^3$algorithm's, and reduces areas by 25 percentages in contrast to radix-4 algorithm's.

• Journal of the Institute of Convergence Signal Processing
• /
• v.3 no.2
• /
• pp.89-95
• /
• 2002

Global routing is to assign each net to routing regions to accomplish the required interconnections. The most popular algorithms for global routing inlcude maze routing algorithm, line-probe algorithm, shortest path based algorithm, and Steiner tree based algorithm. In this paper we propose weighted network heuristic(WNH) as a minimal Steiner tree search method in a routing graph and a genetic algorithm based on WNH for the global routing. We compare the genetic algorithm(GA) with simulated annealing(SA) by analyzing the results of each implementation.

• Proceedings of the KIEE Conference
• /
• 1991.11a
• /
• pp.353-356
• /
• 1991

This paper proposes a robust direct adaptive control system implementation using a 80286 microprocessor-based system for controlling the speed of a DC servo motor. In this paper, assuming that the unmodeled dynamics of the plant are sufficiently small in the low-frequency range, the plant as linear time-invariant system is the second relative degree, we construct the direct adaptive control system with the algorithm considering plant unmodeled dynamics and execute the experiment, and compare the characteristics with those of PI algorithm's. It shows that an easy implementation of the built controller is due to the usage of software for the algorithm.