• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.6C
• /
• pp.637-644
• /
• 2006

This paper presents performance and implementation comparisons of standard and fast DCT algorithms that are commonly used for subband filter bank in MPEG audio coders. The comparison is made according to the architectural difference of the implementation hardware. Fast DCT algorithms are known to have much less computational complexity than the standard method that involves computing a vector dot product of cosine coefficient. But, due to structural irregularity, fast DCT algorithms require extra cycles to generate the addresses for operands and to realign interim data. When algorithms are implemented using DSP processors that provide special operations such as single-cycle MAC (multiply-accumulate), zero-overhead nested loop, the standard algorithm is more advantageous than the fast algorithms. Also, in case of the finite-precision processing, the error performance of the standard method is far superior to that of the fast algorithms. In this paper, truncation errors and algorithmic suitability are analyzed and implementation results are provided to support the analysis.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.12C
• /
• pp.1215-1227
• /
• 2002

This paper presents a genetic algorithmic approach to shortest path (SP) routing problem. Variable-length chromosomes (strings) and their genes (parameters) have been used for encoding the problem. The crossover operation that exchanges partial chromosomes (partial-routes) at positionally independent crossing sites and the mutation operation maintain the genetic diversity of the population. The proposed algorithm can cure all the infeasible chromosomes with a simple repair function. Crossover and mutation together provide a search capability that results in improved quality of solution and enhanced rate of convergence. Computer simulations show that the proposed algorithm exhibits a much better quality of solution (route optimality) and a much higher rate of convergence than other algorithms. The results are relatively independent of problem types (network sizes and topologies) for almost all source-destination pairs.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.11
• /
• pp.90-98
• /
• 2013

The stereo system based on local matching is very popular due to its algorithmic simplicity, however it is limited to apply to various applications because it shows poor quality with low matching rates. In this paper, we propose and design a realtime stereo system based on an adaptive support-weight and the system shows low error rates and realtime performance. Generally, in the adaptive support-weight algorithm the intermediate computing results can not be reused to reduce the number of computations. In this research we modify the scheduling to reuse the intermediate results for the better performance by processing rows and columns separately. The nonlinear functions such as exponential or arc tangent have been designed with piecewise linear and step functions by empirical simulations and error analysis. The proposed architecture is composed of 9 processing elements for realtime performance. The proposed stereo system has been designed and synthesized using Donbu Hitek 0.18um standard cell library and can run up to 350Mhz operation frequency (33 frames per second) with 424K gates.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.10a
• /
• pp.866-869
• /
• 2015

With the advance in semiconductor technology, the number of elements that can be integrated in system-on-chip(SoC) increases exponentially, and thus voltage scaling is indispensable to enhance energy efficiency. Near-threshold voltage computing(NTC) improves the energy efficiency by an order of degree, hence it is able to overcome the limitation of conventional super-threshold voltage computing(STC). Although NTC-based low performance manycore system can be used to maximize energy efficiency, it demands more number of cores to sustain the performance, which results in considerable increase of area. In this paper, we analyze NTC manycore architecture considering the trade-offs between performance, power, and area. Therefore, we propose an algorithmic methodology that can optimize power consumption and area while satisfying the required performance by determining the constrained number of cores and size of caches and clusters in NTC environment. Experimental results show that proposed NTC architecture can reduce power consumption by approximately 16.5 % while maintaining the performance of STC core under area constraint.

• Journal of The Korean Association For Science Education
• /
• v.21 no.2
• /
• pp.289-298
• /
• 2001

The effect of the instructional approach that asked students to check their problem-solving processes through a paired think-aloud problem solving after presenting molecular-level pictures and a four stage-problem solving strategy was investigated. Four high school classes (N = 191) were randomly assigned to St group (using Strategy individually), SL group (Solver Listener), St-SL group (using Strategy-Solver Listener), and control group. Although the test scores of the St-SL group on strategy performing ability were significantly higher than those of the control group, there was not significant difference for the scores in the multiple-choice algorithmic problems. Regarding the subcategories of strategy performing ability test, students' ability of understanding given of problems and deriving the proper physical quantity was improved, but their ability of setting up subgoals and reviewing their solving process was very low. The preference to the strategy of the St-SL group was more positive than that of the St group.

• Proceedings of the Korea Society for Simulation Conference
• /
• 1994.10a
• /
• pp.1-2
• /
• 1994

With the prevalence of computers in modern organizations, simulation is receiving more atention as an effectvie decision -making tool. Simualtion is a computer-based numerical technique which uses mathmatical and logical models to approximate the behaviror of a real-world system. However, iptimization of synamic stochastic systems often defy analytical and algorithmic soluions. Although a simulation approach is often free fo the liminting assumption s of mathematical modeling, cost and time consiceration s make simulation the henayst's last resort. Therefore, whenever possible, analytical and algorithmica solutions are favored over simulation. This paper discussed the issues and procedrues for using simulation as a tool for optimization of stochastic complex systems that are dmodeled by computer simulation . Its emphasis is mostly on issues that are speicific to simulation optimization instead of consentrating on the general optimizationand mathematical programming techniques . A simulation optimization problem is an optimization problem where the objective function. constraints, or both are response that can only be evauated by computer simulation. As such, these functions are only implicit functions of decision parameters of the system, and often stochastic in nature as well. Most of optimization techniqes can be classified as single or multiple-resoneses techniques . The optimization of single response functins has been researched extensively and consists of many techniques. In the single response category, these strategies are gradient based search techniques, stochastic approximate techniques, response surface techniques, and heuristic search techniques. In the multiple response categroy, there are basically five distinct strategies for treating the responses and finding the optimum solution. These strategies are graphica techniqes, direct search techniques, constrained optimization techniques, unconstrained optimization techniques, and goal programming techniques. The choice of theprocedreu to employ in simulation optimization depends on the analyst and the problem to be solved. For many practival and industrial optimization problems where some or all of the system components are stochastic, the objective functions cannot be represented analytically. Therefore, modeling by computersimulation is one of the most effective means of studying such complex systems. In this paper, after discussion of simulation optmization techniques, the applications of above techniques will be presented in the modeling process of many flexible manufacturing systems.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.2
• /
• pp.390-396
• /
• 2015

The drastic growth of mobile communication and spreading of smart phone make the significant attention on Location Based Service. The one of most important things for vitalizations of LBS is the accurate estimating position for mobile object. Focusing on an image sensor deployed in smart phone, we develop a LED based positioning estimation framework. The developed approaches can strengthen the advantages of independent indoor applicability of LED. The estimation of LED based positioning is effectively applied to any indoor environment. We put a focus especially on the algorithmic framework. of image processing of smart phone. From LED lighting, we can obtain a typical signal image which contains the unique positioning information. Furthermore test-bed based on smart phone platform is practically developed and all data have been harvested from the actual measurement of test indoor area. This can approve the practical usefulness of proposed framework.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.7 no.1
• /
• pp.45-51
• /
• 2012

Programming is an area that many students have difficulty on because it requires various skills, such as problem analysis, logical thinking, and procedural problem-solving skills. In this paper, a system visualizing algorithm was used to set up algorithmic concepts easily and effectiveness of the system was analyzed through scholastic achievement test and survey after learning through this process. For evaluation, we divided students who take courses on programming language and algorithm in 3 universities into 2 groups with 6 teams in each group. The group that trained this system visualizing algorithm had scored 17.4 points higher in terms of scholastic achievement than the group that did not train such method. Moreover, according to the survey, the group had higher scores in terms of interest level, concentration level, comprehension, effectiveness, and convenience.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.22 no.4
• /
• pp.676-682
• /
• 2018

In wireless sensor networks, we propose an optimization algorithm in order to minimize the consumed energy of nodes for maritime search and rescue. In the marine environment, search and rescue operations are mainly performed on the surveillance side and passively on the rescued side. A self-configurable wireless sensor network can build a system that can send rescue signals in the operations. A simulated annealing algorithm is proposed to minimize the consumed energy of nodes in the networks with many nodes. As the density of nodes becomes higher, the algorithmic computation will increase highly. To search the good result in a proper execution time, the proposed algorithm proposes a new neighborhood generating operation and improves the efficiency of the algorithm. The proposed algorithm was evaluated in terms of the consumed energy of the nodes and algorithm execution time, and the proposed algorithm performed better than other optimization algorithms in the performance results.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.4B
• /
• pp.298-305
• /
• 2003

In this paper, we proposed a high performance lookup controller for IP packet forwarding engine of ATM based label edge routers. The lookup controller is designed to provide services such as MPLS, VPN, ELL, and RT services as well as the best effort. For high speed searching for IP addresses, we employed a TCAM based hardware search device not using traditional algorithmic approaches. We also implement lookup control functions into FPGA for fast processing of packet header and lookup control. The proposed lookup controller is designed to support differenciated services for users and to process in pipelined mechanism for performance improvement. A two-step search scheme is also applied to perform lookup for the key combined with multi-field of packet header. We found that the proposed lookup controller provides the performance of about 16M packets per second through simulations.