• Journal of the Korean Institute of Telematics and Electronics
• /
• v.24 no.6
• /
• pp.1068-1073
• /
• 1987

Traditional circuit partitioning algorithm using the cluster development method, which is suitable for such applications as single chip floor planning or multiple layer PCB system placement, where the clusters are formed so that inter-cluster nets are localized within the I/O connector pins, may not be appropriate for the functiona block placement in truly 3-D electronic modules. 3-D hybrid IC is one such example where the inter-layer routing as well as the intra-layer routing can be maximally incorporated to reduce the overall circuit size, cooling requirements and to improve the speed performance. In this paper, we propose a new algorithm called MBE(Minimum Box Embedding) for the layer assignment of each functional block in 3-D hybrid IC design. The sequence of MBE is as follows` i) force-directed relaxation in 3-D space, ii) exhaustive search for the optimal orientation of the slicing plane and iii) layer assignment. The algorithm is first explaines for a 2-D reduced problem, and then extended for 3-D applications. An example result for a circuit consisting of 80 blocks has been shown.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2004.11a
• /
• pp.203-208
• /
• 2004

The objective of this study is to analyze the efficiency of marshalling work using ATC(automated transfer crane) for ACT(automated container terminal). It is important fact to assignment of containers, because the character of ACT which block layout is vertical for berth and there are four other works which are inbound, oubound, loading and unloading in one block. And then there is need which assignment of containers with remarshaling work using ATCs in one block. Therefore, we analyze the efficiency of remarshaling work using simulation and suggest the assignment methodology of containers in yard

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.41 no.10
• /
• pp.9-16
• /
• 2004

The state assignment for a finite state machine greatly affects the delay, area, power dissipation, and testabilities of the sequential circuits. In order to improve the testabilities and power consumption, a new state assignment technique based on m-block partition is introduced in this paper. The algorithm minimizes the dependencies between groups of state variables are minimized and reduces switching activity by grouping the states depending on the state transition probability. In the sequel the length and number of feedback cycles are reduced with minimal switching activity on the state variables. Experiment shows significant improvement in testabilities and Power dissipation for benchmark circuits.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.8A
• /
• pp.889-897
• /
• 2004

In this Paper, we propose the algorithm to provide stable communication in OFDM system under the highly interfered environment by the same/different systems which use same bandwidth or other jamming signal, i.e., radar signal. The proposed Adaptive Subcarrier Assignment(ASA) method first estimates the received power of each subcarrier in the block or fin or OFDM receiver. Then we estimate the threshold level which is the average power of the transmitted OFDM signal with AWGN. The highly interfered subcarriers, which are greater powers than the specified threshold level, are rejected in the next transmission and the only non-interfered subcarriers are selected as the next transmission. This algorithm provides stable communication in any OFDM systems without changing the physical layer under the highly interfered communication environment. We estimated the status of the subcarriers based on the bandwidth and power of the jamming signal and showed the performance of the proposed algorithm by the simulation.

• Korean Management Science Review
• /
• v.13 no.1
• /
• pp.1-12
• /
• 1996

This paper deals with production scheduling of block assembly shop in shipbuilding company. The Objectives of the schedule are leveling of daily total workload and fair assignment of workload to each department of the shop. Optimizing the objectives, we consider some restrictions which consisit of block due dates, workability of each department, and space restriction. We formulate the problem in mathematical form. But the model is too complex to find the optimal solution (the problem is NP-complete) and we use the genetic algorithm to find a good solution.

• 제어로봇시스템학회:학술대회논문집
• /
• 1986.10a
• /
• pp.90-94
• /
• 1986

This paper describes expansion of the state space pole assignment self-tuning control of SISO systems with system noise and abservation noise to that of MIMO systems. Resursive Prediction Error method is used for both parameter and state estimation in the block controllable canonical form. This simplifies the state feedback law by eliminating the online computation of transformation matrix.

• Journal of Internet Computing and Services
• /
• v.9 no.1
• /
• pp.55-67
• /
• 2008

This paper presents the assignment motion algorithm unrestricted for code optimization computationally. So, this algorithm is suppressed the unnecessary code motion in order to avoid the superfluous register pressure, we propose the assignment motion algorithm added to the final optimization phase. This paper improves an ambiguous meaning of the predicate. For mixing the basic block level analysis with the instruction level analysis, an ambiguity occurred in Knoop's algorithm. Also, we eliminate an ambiguity of it. Our proposal algorithm improves the runtime efficiency of a program by avoiding the unnecessary recomputations and reexecutions of expressions and assignment statements.

• The KIPS Transactions:PartA
• /
• v.8A no.1
• /
• pp.27-35
• /
• 2001

This paper presents the assignment motion algorithm unrestricted for code optimization computationally. So, this algorithm is suppressed the unnecessary code motion in order to avoid the superfluous register pressure, we propose the assignment motion algorithm added to the final optimization phase. This paper improves an ambiguous meaning of the predicated. For mixing the basic block level analysis with the instruction level analysis, an ambiguity occurred in knoop’s algorithm. Also, we eliminate an ambiguity of it. Our proposal algorithm improves the runtime efficiency of a program by avoiding the unnecessary recomputations and reexecutions of expressions and assignment statements.

• Journal of the Korean Society for Precision Engineering
• /
• v.15 no.11
• /
• pp.108-120
• /
• 1998

In this paper, a new control system design algorithm, which has the advantages of the existing LQR and eigenstrcture assignment methods, is proposed. The method of the transformation matrix via block controller is utilized to develop the scheme. Using the proposed algorithm, LQR weighting matrices q and R, which satisfy the desired closed-loop eigenvalues and eigenvectors, can be achieved using only simple matrix computations. The usefulness of the proposed scheme is verified by applying to a numerical example and an automotive active suspension control system design.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.37 no.11
• /
• pp.67-73
• /
• 2000

The state assignment for a finite state machine greatly affects the delay, area, and testabilities of the sequential circuits. In order to minimize the dependencies among groups of state variables, therefore possibly to reduce the length and number of feedback cycles, a new state assignment technique based on m-block partition is introduced in this paper. After the completion of proposed state assignment and logic synthesis, partial scan design is performed to choose minimal number of scan flip-flops. Experiment shows drastic improvement in testabilities while preserving low area and delay overhead.