• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.3
• /
• pp.571-578
• /
• 2012

In this paper, we propose two main points. The first is the constraint for logic synthesis, and the second is an efficient logic synthesis method. Logic synthesis is a process to obtain the gate-level netlist from RTL (register transfer level) codes using logic mapping and optimization with the specified constraints. The result of logic synthesis is tightly dependent on constraint and logic synthesis method. Since the size and timing can be dramatically changed by these, we should precisely consider them. In this paper, we present the considering items in the process of logic synthesis by using our experience and experimental results. The proposed techniques was applied to a circuit with the hardware resource of about 650K gates. The synthesis time for the hybrid method was reduced by 47% comparing the bottom-up method and It has better timing property about slack than top-down method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.1A
• /
• pp.13-23
• /
• 2007

In this paper, a packet scheduling scheme that supports real-time traffic having multi-level delay constraints in OFDMA systems is proposed. The proposed scheme pursues to satisfy the delay constraint first, and then manage the residual radio resource in order to enhance the overall throughput. A parameters named tolerable delay time (TDT) is newly defined to deal with the differentiated behaviors of packet scheduling according to the delay constraint level. Assuming that the packets violating the delay constraint are discarded, the proposed scheme is evaluated in terms of the packet loss probability, throughput, channel utilization. It is then compared with existing schemes for real-time traffic support such as the Exponential Scheduling (EXP) scheme, the Modified Largest Weighted Delay First (M-LWDF) scheme, and the Round robin scheme. The numerical results show that the proposed scheduling scheme performs much better than the aforementioned scheduling schemes in terms of the packet loss probability, while slightly better in terms of throughput and channel utilization.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.26 no.2
• /
• pp.165-171
• /
• 2013

Due to the difficulty in considering dynamic load in the view point of a computer resource and computing time, it is common that external load is assumed as ideal static loads. However, structural analysis under static load cannot guarantee the safety of design of the structures under dynamic loadings. Recently, the systematic method to construct equivalent static load from the given dynamic load has been proposed. Previous study has calculated equivalent static load through the optimization procedure under displacement constraints. However, previously reported works to distribute equivalent static load were based on ad-hoc methods. Improper selection of equivalent static loading positions may results in unreliable prediction of structural design. The present study proposes the selection method of the proper locations of equivalent static loads to dynamically applied loads when we consider transient dynamic structural problems. Moreover, it is appropriate to take into account the stress constraint as well as displacement constraint condition for the safety design. But the previously reported studies of equivalent static load design methods considered only displacement constraint conditions but not stress constraint conditions. In the present study we consider not only displacement constraint but also stress constraint conditions. Through a few numerical examples, the efficiency and reliability of proposed scheme is verified by comparison of the equivalent stress between equivalent static loading and dynamic loading.

• Proceedings of the Society of Korea Industrial and System Engineering Conference
• /
• 2002.05a
• /
• pp.203-208
• /
• 2002

In case of the problems with multiple plants, alternative operation sequence, alternative machine, setup time, and transportation time between plants, we need a robust methodology for the integration of process planning and scheduling in supply chain. The objective of this model is to minimize the tardiness and to maximize the resource utilization. So, we propose a multi-objective model with limited-capacity constraint. To solve this model, we develope an efficient and flexible model using adaptive genetic algorithm(AGA), compared to traditional genetic algorithm(TGA)

• Journal of the Korean Home Economics Association
• /
• v.47 no.6
• /
• pp.79-90
• /
• 2009

The purpose of this study was to improve the understanding of housing experiences of the married women in Korean sociocultural context and to explore their housing mobility. The grounded theory was adopted in this qualitative study. Data were collected through in-depth interviews with the seventeen married women. The major categories found in the data are 1) the inducement of housing mobility, 2) social constraint and opportunity, 3) the strategy and resource of housing mobility, 4) the intervening conditions, and 5) self-evaluation of their own housing life history. People construct their housing life history toward home ownership. There are a few factors to induce housing mobility, and social constraints and opportunity have an effect on obtaining home ownership. They utilize the diverse strategy and resource to solve their housing matter. Through interview, it is founded that they evaluate their housing career in the light of their life through interview.

• IE interfaces
• /
• v.14 no.3
• /
• pp.218-226
• /
• 2001

Scheduling for shipbuilding processes has many alternative solutions since it has long time horizon and handles many jobs. This requests the scheduling system to generate and search feasible alternative solutions in short period of time. Among shipbuilding schedules, the ship erection schedule in a dock is the most important since the dock is the most critical resource in shipyard. In this research, we model the erection scheduling problem for shipbuilding and develop a new problem solving method using CST(Constraint Satisfaction Technique) and ILOG Scheduler. Experimental results show that the proposed scheduling method outperforms the existing manual scheduling methods in terms of schedule performance and required time.

• Proceedings of the Korean Information Science Society Conference
• /
• 2011.06a
• /
• pp.352-354
• /
• 2011

The performance of multihop cognitive radio networks (CRN) can be improved significantly by using multiple channels in spectrum underlay fashion. However, interference due to the sharing of common radio channel and congestion due to the contention among those flows that share the same links become an obstacle to meet this challenge. How to control efficiently congestion and allocate power optimally to obtain a high end-to-end throughput is a key objective in this work. We reexamined the Network Utility Maximum (NUM) problem with a new primary outage constraint and proposed a novel resource allocation strategy to solve it effectively and efficiently.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.7A
• /
• pp.660-668
• /
• 2010

In energy resource constrained networks, the network lifetime can be enhanced by optimally allocating energy resource among users based on the available channel state information and the residual energy information at each node. In this paper, we propose the relay selection scheme and power allocation scheme to maximize the network lifetime in wireless relay networks with capacity constraint. The computer simulation results show that the proposed scheme increase the network lifetime in comparison to the conventional schemes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.5
• /
• pp.1638-1653
• /
• 2014

A sequential optimization algorithm (SOA) for resource allocation in a cyclic-prefixed single-carrier cognitive relay system is proposed in this study. Both subcarrier pairing (SP) and power allocation are performed subject to a primary user interference constraint to minimize the mean squared error of frequency-domain equalization at the secondary destination receiver. Under uniform power allocation at the secondary source and optimal power allocation at the secondary relay, the ordered SP is proven to be asymptotically optimal in maximizing the matched filter bound on the signal-to-interference-plus-noise ratio. SOA implements the ordered SP before power allocation optimization by decoupling the ordered SP from the power allocation. Simulation results show that SOA can optimize resource allocation efficiently by significantly reducing complexity.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.11 no.1
• /
• pp.51-58
• /
• 2011

Extensible processors provide an efficient mechanism to boost the performance of the whole system without losing much flexibility. However, due to the intense demand of low cost and power consumption, customizing an embedded system has been more difficult than ever. In this paper, we present a framework for custom instruction generation considering both area constraints and resource sharing. We also present how we can speed up the process through pruning and library-based design space exploration.