• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.6C
• /
• pp.601-609
• /
• 2002

The efficient Viterbi decoder that supports full data-rate output of DAB system was proposed. Viterbi decoder consumes lots of computational load and should be designed to be fast specific hardware. In this paper, SST scheme was adopted for Viterbi decoder with puncturing to reduced the power consumption. Puncturing vector tables are modified and re-arranged to be designed by a hardwired logic to save the system area. New re-scaling scheme which uses the fact that the difference of the maximum and minimum of the path metric values is bounded is proposed. The proposed re-scaling scheme optimizes the wordlength of path metric memory and greatly reduces the computational load for re-scaling by controlling MSB of path metric memory. Another saving of computation is done by proposed algorithm for branch metric calculation, which makes use of pre-calculated metric values. The designed Viterbi decoder was synthesized using SAMSUNG 0.35$\mu$ standard cell library and occupied small area and showed lower power consumption.

• Journal of Communications and Networks
• /
• v.17 no.2
• /
• pp.184-197
• /
• 2015

This paper builds on a recent method, chain routing with even energy consumption (CREEC), for designing a wireless sensor network with chain topology and for scheduling the communication to ensure even average energy consumption in the network. In here a new suboptimal design is proposed and compared with the CREEC design. The chain topology in CREEC is reconfigured after each group of n converge-casts with the goal of making the energy consumption along the new paths between the nodes in the chain as even as possible. The new method described in this paper designs a single near-optimal Hamiltonian circuit, used to obtain multiple chains having only the terminal nodes different at different converge-casts. The advantage of the new scheme is that for the whole life of the network most of the communication takes place between same pairs of nodes, therefore keeping topology reconfigurations at a minimum. The optimal scheduling of the communication between the network and base station in order to maximize network lifetime, given the chosen minimum length circuit, becomes a simple linear programming problem which needs to be solved only once, at the initialization stage. The maximum lifetime obtained when using any combination of chains is shown to be upper bounded by the solution of a suitable linear programming problem. The upper bounds show that the proposed method provides near-optimal solutions for several wireless sensor network parameter sets.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.1
• /
• pp.285-288
• /
• 2005

Neural networks are known as kinds of intelligent strategies since they have learning capability. There are various their applications from intelligent control fields; however, their applications have limits from the point that the stability of the intelligent control systems is not usually guaranteed. In this paper we propose a neuro-adaptive controller for robot manipulators using the radial basis function network(RBFN) that is a kind of a neural network. Adaptation laws for parameters of the RBFN are developed based on the Lyapunov stability theory to guarantee the stability of the overall control scheme. Filtered tracking errors between the actual outputs and desired outputs are discussed in the sense of the uniformly ultimately boundedness(UUB). Additionally, it is also shown that the parameters of the RBFN are bounded. Experimental results for a SCARA-type robot manipulator show that the proposed neuro-adaptive controller is adaptable to the environment changes and is more robust than the conventional PID controller and the neuro-controller based on the multilayer perceptron.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.1 no.2
• /
• pp.145-158
• /
• 1997

Method for synchronizing multimedia data is needed to support continuous transmission of multimedia data through a network in a bounded time and it also required for supporting continuous presentation of multimedia data with the required norminal playout rate in distributed network environments. This paper describes a new synchronization method for supporting delay-sensitive multimedia Presentation without degration of Quality of services of multimedia application. It mainly aims to support both intermedia and intermedia synchronization by absorbing network variations which may cause skew or jitter. In order to remove asynchonization problems, we make use of logical time system, dynamic buffer control method, and adjusting synchronization intervals based on the quality of services of a multimedia. It might be more suitable for working on distribute[1 multimedia systems where the network delay variation is changed from time to time and no global clock is supported. And it also can effectively reduce the amount of buffer requirements needed for transfering multimedia data between source and destination system by adjusting synchronization intervals with acceptable packet delay limits and packet loss rates.

• Journal of Korean Society of Coastal and Ocean Engineers
• /
• v.8 no.2
• /
• pp.193-203
• /
• 1996

Long period waves were measured at two stations outside and inside Chukpyon Harbor using two pressure-type wave gauges for one week that covers storm sea period. Based on the collected data the characteristics of long-period resonant oscillations were analysed: the resonant period corresponding to the peak spectral density are slightly different from one to the component wave period with the largest amplification ratio, and the latter period is suggested as that of the first resonant mode. From the analysed field data and numerical modeling, the first resonant mode of Chukpyon Harbor region appeared to be around 12 minutes with amplification ratio of 7, whose amplitude varies 10-20 cm inside of the harbour, and also the second mode appeared to be around 6 minutes. The waves of 2-3 minute periods were resonated apparently in the harbour, which is considered to be generated from group-bounded irregular waves and non-linear wave-wave interaction etc. The linearly decreasing reflection coefficients used in the numerical modeling appeared to be an alternative in calculating reflected waves in harbor.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.11
• /
• pp.2822-2831
• /
• 1997

A B-ISDN network based on ATM must support several kinds of transport services with different traffic characteristics and service requirements. There is neither link-by-link flow control nor error control in the ATM layer. For different services, different flow/error controls could be performed at the AAL layer or at a higher Iayer(e.g. transport layer). In traditional data networks, the window now control mechanism combined with error control was used prevalently. But, the window flow control mechanism might be useless in ATM networks because the propagation delay is too large compared with the transmission rate. In this paper, we propose a simple flow control mechanism, called RCT(Rate Control for end-to-end Transport), for end-to-end data transport. The RCT shows acceptable performance when the average overload period is bounded by a certain time.

• The KIPS Transactions:PartA
• /
• v.10A no.3
• /
• pp.199-206
• /
• 2003

The object-oriented (OO) distributed real-time (RT) programming movement started in 1990´s and is growing rapidly at this turn of the century. Distributed real-time simulation is a field in its infancy but it is bounded to receive steadily growing recognition for its importance and wide applicability. The scheme is called the distributed time-triggered simulation scheme which is conceptually simple and easy to use but widely applicable. A new generation object oriented (OO) RT programming scheme is called the time-triggered message triggered object(TMO) programming scheme and it is used to make specific illustrations of the issues. The TMO structuring scheme is a general-style components structuring scheme and supports design of all types of component including hard real time objects and non real time objects within one general structure.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.7
• /
• pp.1660-1670
• /
• 2015

Many robust controllers have been studied but most are considered in the theoretical point of view and can be used for only specific systems. So, in this paper, a more practical robust controller is proposed based on SMC(sliding mode control) and disturbance observer. The integral sliding mode is used to eliminate the reaching phase and minimizes the steady-state error, and the disturbance observer reduces the chattering due to the switching input for the bounded disturbances. The inevitable chattering of SMC is also removed by replacing the sign function with dead-zone function. The proposed controller has the improved steady-state error and robustness compared to PID controller.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.38 no.4
• /
• pp.117-131
• /
• 2015

Conventional data envelopment analysis (DEA) models require that inputs and outputs are given as crisp values. Very often, however, some of inputs and outputs are given as imprecise data where they are only known to lie within bounded intervals. While a typical approach to addressing this situation for optimization models such as DEA is to conduct sensitivity analysis, it provides only a limited ex-post measure against the data imprecision. Robust optimization provides a more effective ex-ante measure where the data imprecision is directly incorporated into the model. This study aims to apply robust optimization approach to DEA models with imprecise data. Based upon a recently developed robust optimization framework which allows a flexible adjustment of the level of conservatism, we propose two robust optimization DEA model formulations with imprecise data; multiplier and envelopment models. We demonstrate that the two models consider different risks regarding imprecise efficiency scores, and that the existing DEA models with imprecise data are special cases of the proposed models. We show that the robust optimization for the multiplier DEA model considers the risk that estimated efficiency scores exceed true values, while the one for the envelopment DEA model deals with the risk that estimated efficiency scores fall short of true values. We also show that efficiency scores stratified in terms of probabilistic bounds of constraint violations can be obtained from the proposed models. We finally illustrate the proposed approach using a sample data set and show how the results can be used for ranking DMUs.

• Journal of the Korea Society of Computer and Information
• /
• v.25 no.4
• /
• pp.123-131
• /
• 2020

The pattern query in graph database has advantages of easy query expression and high query processing performance compared to relational database SQL. However, unlike the relational database, the graph database may not utilize the advantages of pattern query depending on modeling because the methodology for building the logical data model is not defined. In this study, in the is-a node modeling method that appears during the graph modeling process, we experiment that there is a difference in performance between graph pattern query when designing with a generalization model and designing with a specialization model. As a result of the experiment, it was shown that better performance can be obtained when the is-a node is designed as a specialization model. In addition, when writing a pattern query, we show that if a variable is bound to a node or edge, performance may be better than that of the variable of not bounded. The experimental results can be presented as an is-a node modeling method for pattern query and a graph query writing method in the graph database.