• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.8 no.1
• /
• pp.75-81
• /
• 2008

This paper presents a top-down approach to implement an MPEG-2 audio encoder in VLSI. As the algorithm of an MPEG-2 audio encoder is heavy-weighted and heterogeneous(to be mixture of several strategies), the encoder design process is undertaken carefully from the algorithmic level to the architectural level. Firstly, the encoding algorithm is analyzed and divided into sub-algorithms, called tasks, and the tasks are partitioned in the way of reusing the same designs. Secondly, the partitioned tasks are scheduled and synthesized to make the most efficient use of time and space. In the end, a real-time 5 channel MPEG-2 audio encoder is designed which is a heterogeneous multiprocessor system; two hardwired logic blocks and one specialized DSP processor.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.12
• /
• pp.880-884
• /
• 2006

In an edge-weighted(positive, negative, or zero weights are possible) tree, we want to solve the problem of finding a longest path such that the sum of the weights of the edges in tile path is non-negative. To find a longest non-negative path of a tree we present a sequential algorithm with O(n logn) time and a CREW PRAM parallel algorithm with $O(log^2n)$ time and O(n) processors. where n is the number of nodes in the tree.

• Journal of the Institute of Convergence Signal Processing
• /
• v.16 no.1
• /
• pp.29-34
• /
• 2015

The ECG(Electrocardiograph) ambulatory test as called Holter is performed usually to diagnose several heart diseases causing different arrhythmias. This paper exposes the insights of the design of a 10-lead ambulatory ECG recorder. Reducing the size and minimizing the power consumption of the ECG recorder are crucial to allow long recording time without causing discomfort to the patient. This paper proposes lower hardware design and differential compression algorithm to extend the maximum 72 hours recording time in consideration of smaller and light-weighted recorder size. The performance results by newly introduced compression algorithm are shown and discussed.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.5
• /
• pp.1690-1707
• /
• 2021

Precipitation prediction during flood season has been a key task of climate prediction for a long time. This type of prediction is linked with the national economy and people's livelihood, and is also one of the difficult problems in climatology. At present, there are some precipitation forecast models for the flood season, but there are also some deviations from these models, which makes it difficult to forecast accurately. In this paper, based on the measured precipitation data from the flood season from 1993 to 2019 and the precipitation return data of CWRF, ANN cycle modeling and a weighted integration method is used to correct the CWRF used in today's operational systems. The MAE and TCC of the precipitation forecast in the flood season are used to check the prediction performance of the proposed algorithm model. The results demonstrate a good correction effect for the proposed algorithm. In particular, the MAE error of the new algorithm is reduced by about 50%, while the time correlation TCC is improved by about 40%. Therefore, both the generalization of the correction results and the prediction performance are improved.

• The Journal of the Korea Contents Association
• /
• v.22 no.6
• /
• pp.56-68
• /
• 2022

Recently, as the demand for real-time processing increases, studies on a dynamic graph that changes over time has been actively done. There is a connected components processing algorithm as one of the algorithms for analyzing dynamic graphs. GPUs are suitable for large-scale graph calculations due to their high memory bandwidth and computational performance. However, when computing the connected components of a dynamic graph using the GPU, frequent data exchange occurs between the CPU and the GPU during real graph processing due to the limited memory of the GPU. The proposed scheme utilizes the Weighted-Quick-Union algorithm to process large-scale graphs on the GPU. It supports fast connected components computation by applying the size to the connected component label. It computes the connected component by determining the parts to be recalculated and minimizing the data to be transmitted to the GPU. In addition, we propose a processing structure in which the GPU and the CPU execute asynchronously to reduce the data transfer time between GPU and CPU. We show the excellence of the proposed scheme through performance evaluation using real dataset.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.9
• /
• pp.454-460
• /
• 2003

In this paper, we present a novel method of parallelization of the modular multiplication algorithm to improve time and space complexity on RNS (Residue Number System). The parallel algorithm executes modular reduction using new table lookup based reduction method. MRS (Mixed Radix number System) is used because algebraic comparison is difficult in RNS which has a non-weighted number representation. Conversion from residue number system to certain MRS is relatively fast in residue computer. Therefore magnitude comparison is easily Performed on MRS. By the analysis of the algorithm, it is known that it requires only 1/2 table size than previous approach. And it requires 0(ι) arithmetic operations using 2ㅣ processors.

• Nuclear Engineering and Technology
• /
• v.55 no.9
• /
• pp.3301-3312
• /
• 2023

This study incorporates a high-fidelity transient analysis solver based on multigroup CMFD in the MOC code STREAM. Transport modeling with heterogeneous geometries of the reactor core increases computational cost in terms of memory and time, whereas the multigroup CMFD reduces the computational cost. The reactor condition does not change at every time step, which is a vital point for the utilization of CMFD. CMFD correction factors are updated from the transport solution whenever the reactor core condition changes, and the simulation continues until the end. The transport solution is adjusted once CMFD achieves the solution. The flux-weighted method is used for rod decusping to update the partially inserted control rod cell material, which maintains the solution's stability. A smaller time-step size is needed to obtain an accurate solution, which increases the computational cost. The adaptive step-size control algorithm is robust for controlling the time step size. This algorithm is based on local errors and has the potential capability to accept or reject the solution. Several numerical problems are selected to analyze the performance and numerical accuracy of parallel computing, rod decusping, and adaptive time step control. Lastly, a typical pressurized LWR was chosen to study the rod-ejection accident.

• Journal of Korea Multimedia Society
• /
• v.14 no.12
• /
• pp.1559-1571
• /
• 2011

In wireless ad hoc networks, nodes communicate with each other using multihop routed transmission in which hop-by-hop cooperative diversity can be effectively employed. This paper proposes (i) two cooperation models for per-link cooperation (PLC) and per-node cooperation (PNC) for exploiting cooperative diversity in wireless ad hoc networks and (ii) a cooperative routing algorithm for the above models in which best relays are selected for cooperative transmission. First, two cooperation models for PLC and PNC are introduced and represented as an edge-weighted graph with effective link quality. Then, the proposed models are transformed into a simplified graph and a cooperative routing algorithm with O(n2) time is developed, where n is the number of nodes in the network. The effectiveness of the algorithm is confirmed for the two cooperation models using simulation.

• 전기의세계
• /
• v.30 no.12
• /
• pp.822-831
• /
• 1981

Many different schemes of the adaptive observer and controller have been developed for both continuous and discrete systems. In this paper we have presented a new scheme of the reduced order adaptive observer for the single input discrete linear time invariant plant. The output equation of the plant, is transformed into the bilinear form in terms of system parameters and the states of the state variable filters. Using the plant output equation the discrete implicit adaptive observer based on the similar philosophy to Nuyan and Carroll is derived and the parameter adaptation algorithm is derived based on the exponentially weighted least square method. The adaptive model following control system is also constructed according to the proposed observer scheme. The proposed observer and controller are rather than simple structure and have a fast adaptive algorithm, so it may be expected that the scheme is suitable to the practical application of control system design. The effectiveness of the algorithm and structure is illustrated by the computer simulation of a third order system. The simulation results show that the convergence speed is proportinal to the increasing of weighting factor alpha, and that the full order and reduced order observer have similar convergence characteristics.

• Journal of IKEEE
• /
• v.11 no.4
• /
• pp.307-314
• /
• 2007

In this paper, we propose an image contrast enhancement algorithm for an LCD TV. The proposed algorithm consists of two processes: the image segmentation process and the tone curve control process. The first process uses an automatic threshold technique to decompose an input image into two regions and then utilizes a hierarchical structure for real-time processing. The second process generates a gray level tone curve for contrast enhancement using a weighted sum of average tone curves for two segmented regions. Experimental result shows that the proposed algorithm outperforms the conventional contrast enhancement methods for an LCD TV.