• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• pp.905-908
• /
• 2005

본 논문에서는 class AB opamp 를 채용한 384kHz differential PWM 신호를 입력으로 하는 2-channel stereo audio amplifier 블록을 공급전압 3.3V 조건에서 SMIC 0.18um thick oxide 기술을 이용하여 설계한다. 여기서 class AB opamp 는 공정 변화에 따른 quiescent current가 변하는 것을 최소화하기 위하여 adaptive load 를 사용하며, 전체적으로는 3 차 Butterworth lowpass filter 와 differential-to-single converter 로 구성된 2 개의 audio amplifier 와 출력전압이 ${\frac{1}{2}}Vdd$ 인 common output 블록으로 구성된다. 이러한 설계를 통하여 32ohm 의 저항 load 를 구동할 수 있는 -60dB THD, 전체 quiescent current 2mA 대인 CMOS class AB stereo audio amplifier 를 구현하였다.

• Journal of KIISE:Information Networking
• /
• v.34 no.4
• /
• pp.239-245
• /
• 2007

New multimedia services over the cellular/WLAN overlay networks require different Quality of Service (QoS). In the cellular/WLAN overlay structure, the main issue of load balancing is to balance the available bandwidth among different networks. In this paper, we propose a new online network management scheme. Our proposed scheme is designed to improve bandwidth utilization by balancing the traffic load between the cellular network and WLANs. Simulation results indicate the superior performance of our proposed framework to strike the appropriate performance balance between contradictory QoS requirements under widely varying diverse traffic loads.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.12
• /
• pp.2635-2643
• /
• 1997

In this paepr, a routing algorithm is proposed in order to reduce average end-to-end delay and congesting in the high speed network. The algorithm proposed here uses the existing one which adaptively modifies routes and the amount of traffic allocated to each link as user traffic partterns flutuate. This algorithm is ELB(Equitable Load Balancing). Also, the new algorithm considers the proportional to the distance between source and destination. It reduces congestion from the ELB and average end-to-end delay from the propagation dealy concepts respectively. Through the simulation, it shows that the algorithm proposed here reduces average end-to-end delay over low load to high load, and it also guarantees the congestion control.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.3
• /
• pp.288-298
• /
• 1995

Load balancing attempts to improve the performance of a distributed computing system by transferring some of the workload of a congested site to others. A load balancing scheme that supports both the source-initiated and the server- initiated load balancing is proposed in this paper. It can model both the m/m/1 queue(no load balancing) and the m/m/n queue(perfect load balancing) as the extreme State variables are replicated into every site, and copy consistency constraints are relaxed more weakly. We propose weak copy consistency constraints which correlate the outdated state information to that of the current state. We also derive sufficient conditions under which each scheduler can guarantee the load balancing without communication Using this model, the problem of load balancing is converted to that of maintaining the consistency of states and communication overhead becomes less than that of the bidding algorithm. The scheme is simulated by event tracing, compared to the two extreme cases and the bidding algorithm. The results show that the mean response time and the number of messages are reduced by 0-35% and 40-100% respectively, compared with the bidding algorithm. Finally the effects of some system parameters are described.

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

Since there are various networks and heterogeneity of nodes in Internet, the existing load-sharing algorithms are hardly adapted for use in Internet-based clustering systems. Therefore, in Internet-based clustering systems, a load-sharing algorithm must consider various conditions such as heterogeneity of nodes, characteristics of a network and imbalance of load, and so on. This paper has proposed an expanded-WF algorithm which is based on a WF (Weighted Factoring) algorithm for load-sharing in Internet-based clustering systems. The proposed algorithm uses an adaptive granularity strategy for load-sharing and duplicate execution of partial job for fault-tolerance. For the simulation, the to matrix multiplication using PVM is performed on the heterogeneous clustering environment which consists of two different networks. Compared to other algorithms such as Send, GSS and Weighted Factoring, the proposed algorithm results in an improvement of performance by 55%, 63% and 20%, respectively. Also, this paper shows that It can process the fault-tolerance.

• Journal of Korea Multimedia Society
• /
• v.5 no.4
• /
• pp.441-449
• /
• 2002

For multimedia traffics to be supported successfully in wireless network environment, it is necessary to provide Qualify-of-Service(QoS) guarantees among mobile hosts(clients). In order to guarantee the QoS, we have to keep the call blocking probability below a target value during hand-off session. However, the QoS negotiated between the client and the network may not be guaranteed due to lack of available channels for traffic of a new cell, since on service mobile clients should be able to continue their sessions. In this paper, we propose an efficient load-balancing algorithm based on the adaptive bandwidth reservation scheme for enlarging available channels in a cell. Proposed algorithm predicts the direction of clients in a cell and adjusts the amount of the channel to be reserved according to the load status of the cell. This method is used to reserve a part of bandwidths of a cell for hand-off calls to its adjacent cells and this reserved bandwidth can be used for hand-off call prior to new connection requests. If the number of free channels is also under a low threshold value, our scheme use a load-balancing algorithm with an adaptive bandwidth reservation. In order to evaluate the performance of our algorithm, we measure metrics such as the blocking probability of new calls and dropping probability of hand-off calls, and compare with those of existing schemes.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.20 no.3
• /
• pp.265-272
• /
• 2007

The finite element linear buckling analysis of folded plate structures using adaptive h-refinement methods is presented in this paper. The variable-node flat shell element used in this study possesses the drilling D.O.F. which, in addition to improvement of the element behavior, permits an easy connection to other elements with six degrees of freedom per node. The Box-typed structures can be analyzed using these developed flat shell elements. By introducing the variable-node elements some difficulties associated with connecting the different layer patterns, which are common in the adaptive h-refinement on quadrilateral mesh, can be overcome. To obtain better stress field for the error estimation, the super-convergent patch recovery is used. The convergent buckling modes and the critical loads associated with these modes can be obtained.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.12
• /
• pp.2708-2715
• /
• 2012

This paper proposes a new sensorless speed control scheme of induction motor using Model Reference Adaptive Control and Direct Torque Control System. The Model Reference Adaptive Control System is based on the comparison between the outputs of Reference Model and Adjustable Model. The error between the estimated quantities obtained by the two models is used to drive a suitable adaptation mechanism which generates the estimated rotor speed for the Adjustable Model. And the Direct Torque Control scheme controls torque and flux by restricting the flux and torque errors within respective hysteresis bands, and motor torque and flux are controlled by the stator voltage space vector using optimum inverter switching table. The simulation results of proposed method indicate good speed responses from the low speed range to the high, and also show favorable characteristics of load operation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.3A
• /
• pp.261-270
• /
• 2007

The Delay Threshold-based Priority Queueing (DTPQ) scheme has been shown useful for scheduling both real-time (RT) and non-real-time (NRT) service traffic in mobile broadband wireless access (MBWA) systems. The overall system capacity can be maximized subject to their QoS requirement by the DTPQ scheme, which takes the urgency of the RT service into account only when their head-of-line (HOL) packet delays exceed a given delay threshold. In practice, the optimum delay threshold must be configured under the varying service scenarios and a corresponding traffic load, e.g., the number of RT and NRTusers in the system. In this paper, we propose an adaptive version of DTPQ scheme, which updates the delay threshold by taking the urgency and channel conditions of RT service users into account. By evaluating the proposed approach in an orthogonal frequency division multiple access/time division duplex (OFDM/TDD)-based broadband mobile access system, it has been found that our adaptive scheme significantly improves the system capacity as compared to the existing DTPQ scheme with a fixed delay threshold.

• Journal of the Korean Society of Hazard Mitigation
• /
• v.10 no.1
• /
• pp.23-28
• /
• 2010

Reliable dynamic analysis is essential in order to properly maintain structures so that structural hazards may be minimized. The finite element method (FEM) is proven to be an affective approximate method of structural analysis if proper element types and meshes are chosen. When the method is applied to dynamics analyzed in time domain, the meshes may need to be modified at each time step. As many meshes need to be generated, adaptive mesh generation schemes have become an important part in complex time domain dynamic finite element analyses of structures. In this paper, an adaptive mesh generation scheme for dynamic finite element analyses of structures is described. The concept of representative strain value is used for error estimates and the refinements of meshes use combinations of the h-method (node movement) and the r-method (element division). The validity of the scheme is shown through a cantilever beam example under a concentrated load with varying values. The example shows reasonable accuracy and efficient computing time. Furthermore, the study shows the potential for the scheme's effective use in complex structural dynamic problems such as those under seismic or erratic wind loads.