• 한국전자파학회논문지
• /
• 제26권1호
• /
• pp.71-80
• /
• 2015

한정된 배터리 용량으로 장시간 모바일 시스템을 구동시키기 위하여 저전력 설계에 대한 요구가 높아지면서 PMIC(Power Management IC)의 핵심 부분인 LDO(Low Drop-Out) 레귤레이터의 설계에 대한 관심이 증가하고 있다. 본 논문에서는 Dongbu HiTek $0.5{\mu}m$ BCDMOS 공정을 이용하여 최적화 기법 중 하나인 기하 프로그래밍(Geometric Programming: GP)을 통해 외부 커패시터가 없는 LDO 레귤레이터의 성능을 최적화하였다. 계수가 양수인 단항식 (monomial)으로 모델링된 트랜지스터의 특성 파라미터들을 이용하여 안정도(stability)와 PSR(Power-Supply Rejection)과 같은 LDO 레귤레이터의 특성을 기하 프로그래밍(Geometric Programming: GP)에 적용 가능한 형태로 유도하였다. 위상 마진(phase margin)과 PSR 모델은 시뮬레이션 결과와 비교하였을 때 각각 평균 9.3 %와 13.1 %의 오차를 보였다. 제안한 모델을 사용하여 PSR 제약 조건이 바뀔 경우, 자동화된 회로 설계를 수행하였고, 모델의 정확도를 검증하였다. 본 논문에서 유도된 안정도와 PSR 모델을 이용하면 회로의 목표 성능이 변화하더라도 부가적인 설계 시간을 줄이면서 목표 성능을 가진 회로를 재설계하는 것이 가능할 것이다.

• 조명전기설비학회논문지
• /
• 제18권6호
• /
• pp.78-83
• /
• 2004

현재 운용되고 있는 직접부하제어 알고리즘은 직접부하제어 사업에 참여에 따른 수용가의 개별 부하별 우선순위가 고려되지 않고 있고, 또한 제어 시간도 수용가의 불편을 고려되지 않고 획일적으로 일정 시간대에 일률적으로 수용가의 부하를 제어함으로써 참여 수용가의 불편 증대로 참여율이 저조한 실정이다. 따라서 본 연구에서는 참여 수용가의 불편을 최소화시키고 또한 개별 부하에 대한 우선순위 요구를 최대한으로 반영하기 위해 우선순위 기반 동적 프로그래밍을 이용한 직접부하제어 알고리즘을 제시한다. 제시되는 알고리즘은 직접부하제어가 발생되기 1시간 전에 참여 수용가가 스스로 해당 부하의 우선순위를 결정하여 직접부하제어 센터로 I-Mail 등으로 보네면 센터에서는 현재 부하의 전력량과 우선순위 그리고 OFF주기 등을 고려하여 동적 프로그래밍을 수행하여 OFF되어야 할 부하들을 선택하게 된다.

• 산업경영시스템학회지
• /
• 제39권4호
• /
• pp.137-146
• /
• 2016

In recent years, business environment is faced with multi uncertainty that have not been suffered in the past. As supply chain is getting expanded and longer, the flow of information, material and production is also being complicated. It is well known that development service industry using application software has various uncertainty in random events such as supply and demand fluctuation of developer's capcity, project effective date after winning a contract, manpower cost (or revenue), subcontract cost (or purchase), and overrun due to developer's skill-level. This study intends to social contribution through attempts to optimize enterprise's goal by supply chain management platform to balance demand and supply and stochastic programming which is basically applied in order to solve uncertainty considering economical and operational risk at solution supplier. In Particular, this study emphasizes to determine allocation of internal and external manpower of developers using S&OP (Sales & Operations Planning) as monthly resource input has constraint on resource's capability that shared in industry or task. This study is to verify how Stochastic Programming such as Markowitz's MV (Mean Variance) model or 2-Stage Recourse Model is flexible and efficient than Deterministic Programming in software enterprise field by experiment with process and data from service industry which is manufacturing software and performing projects. In addition, this study is also to analysis how profit and labor input plan according to scope of uncertainty is changed based on Pareto Optimal, then lastly it is to enumerate limitation of the study extracted drawback which can be happened in real business environment and to contribute direction in future research considering another applicable methodology.

• 전기학회논문지
• /
• 제57권4호
• /
• pp.692-699
• /
• 2008

Semiconductor research and development(R&D) fabs are very different than production fabs in many ways such as the scales of production, job priority, production methods, and performance measures. Efficient operations of R&D fabs are very important to the development of new product, process stability, high yield, and ultimately company competitiveness. This paper proposes the fab-wide scheduling method for operational optimization of the R&D fabs. Most scheduling systems of semiconductor fabs have only focused on maximizing throughput of each separated areas without considering WIP(works in process) flows of entire fab. In this paper, we proposes the a fab-wide scheduling system which schedules all lots to entire fab equipment at once. We develop the MIP(mixed integer programing) model which allocates the lots to production equipment considering many constraints of all processes and the CP(constraint programming) model which determines the sequences of the lots in the production equipment. The proposed FAB-wide scheduling model is applied to the newly constructed R&D fab. As a result, we have accomplished the system based automated job reservation, decrease of the hot lot delay, increase of the queue time satisfaction, the high throughput by maximizing the batch sizes, decrease of the WIP TAT(Turn Around Time).

• Management Science and Financial Engineering
• /
• 제19권2호
• /
• pp.19-29
• /
• 2013

Refuse collection network design, one of major decision problems in reverse logistics, is the problem of locating collection points and allocating refuses at demand points to the opened collection points. As an extension of the previous models, we consider capacity and maximum allowable distance constraints at each collection point. In particular, the maximum allowable distance constraint is additionally considered to avoid the impractical solutions in which collection points are located too closely. Also, the additional distance constraint represents the physical distance limit between collection and demand points. The objective is to minimize the sum of fixed costs to open collection points and variable costs to transport refuses from demand to collection points. After formulating the problem as an integer programming model, we suggest an optimal branch and bound algorithm that generates all feasible solutions by a simultaneous location and allocation method and curtails the dominated ones using the lower bounds developed using the relaxation technique. Also, due to the limited applications of the optimal algorithm, we suggest two heuristics. To test the performances of the algorithms, computational experiments were done on a number of test instances, and the results are reported.

• 한국자동차공학회논문집
• /
• 제16권3호
• /
• pp.166-171
• /
• 2008

In this paper, the optimization design module for the brake system of a vehicle is developed. As using this module, design variables, that minimize an object function and satisfy nonlinear constraint conditions, can be found easily. Before an optimization is operated, Plackett-Burman design, one of the factorial design methods, is used to choose the design variables which affect a response function significantly. Using the response surface analysis, second order recursive model function, which informs a relation between design variables and response function, is estimated. In order to verify the reliability of the model function, analysis of variances(ANOVA) table is used. The value of design variables which minimize the model function and satisfy the constraint conditions is predicted through Sequential Quadratic-Programming (SQP) method. As applying the above procedure to a real vehicle simulation model and comparing the values of object functions of a current and optimized system, the optimization results are verified.

• International Journal of CAD/CAM
• /
• 제7권1호
• /
• pp.41-49
• /
• 2007

In density-based topology optimization, 0/1 solutions are sought. Discrete topological problems are often relaxed with continuous design variables so that they can be solved using continuous mathematical programming. Although the relaxed methods are practical, grey areas appear in the optimum topologies. SIMP (Solid Isotropic Microstructures with Penalization) employs penalty schemes to suppress the intermediate densities. SRV (the Sum of the Reciprocal Variables) drives the solution to a 0/1 layout with the SRV constraint. However, both methods cannot effectively remove all the grey areas. SRV has some numerical aspects. In this work, a new scheme SIMP-SRV is proposed by combining SIMP and SRV approaches, where SIMP is employed to generate an intermediate solution to initialize the design variables and SRV is then adopted to produce the final design. The new method turned out to be very effective in conjunction with the method of moving asymptotes (MMA) when using for the stiffness topology optimization of continuum structures for minimum compliance. The numerical examples show that the hybrid technique can effectively remove all grey areas and generate stiffer optimal designs characterized with a sharper boundary in contrast to SIMP and SRV.

• Journal of Communications and Networks
• /
• 제18권2호
• /
• pp.173-181
• /
• 2016

In this paper, we address a new robust optimization problem in a multiuser multiple-input single-output broadcasting system with simultaneous wireless information and power transmission, where a multi-antenna base station (BS) sends energy and information simultaneously to multiple users equipped with a single antenna. Assuming that perfect channel-state information (CSI) for all channels is not available at the BS, the uncertainty of the CSI is modeled by an Euclidean ball-shaped uncertainty set. To optimally design transmit beamforming weights and receive power splitting, an average total transmit power minimization problem is investigated subject to the individual harvested power constraint and the received signal-to-interference-plus-noise ratio constraint at each user. Due to the channel uncertainty, the original problem becomes a homogeneous quadratically constrained quadratic problem, which is NP-hard. The original design problem is reformulated to a relaxed semidefinite program, and then two different approaches based on convex programming are proposed, which can be solved efficiently by the interior point algorithm. Numerical results are provided to validate the robustness of the proposed algorithms.

• Journal of Communications and Networks
• /
• 제11권2호
• /
• pp.157-165
• /
• 2009

In this paper, we investigate a dynamic spectrum sharing problem for the centralized uplink cognitive radio networks using orthogonal frequency division multiple access. We formulate a large-scale joint rate and power allocation as an optimization problem under quality of service constraint for secondary users and interference constraint for primary users. We also suggest admission control to nd a feasible solution to the optimization problem. To implement the resource allocation on a large-scale, we introduce a notion of using the conservative factors $\alpha$ and $\beta$ depending on the outage and violation probabilities. Since estimating instantaneous channel gains is costly and requires high complexity, the proposed algorithm pursues a practical and implementation-friendly resource allocation. Simulation results demonstrate that the large-scale joint rate and power allocation incurs a slight loss in system throughput over the instantaneous one, but it achieves lower complexity with less sensitivity to variations in shadowing statistics.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권1호
• /
• pp.16-33
• /
• 2019

In this paper, a full-duplex NOMA relaying based underlay device-to-device (D2D) communication scheme is proposed, in which D2D transmitter assists cellular downlink transmission as a full-duplex relay. Specifically, D2D transmitter receives signals from base station and transmits the superposition signals to D2D receiver and cellular user in NOMA scheme simultaneously. Furthermore, we investigate the power allocation under the proposed scheme, aiming to maximize D2D link's achievable transmit rate under cellular link's transmit rate constraint and total power constraint. To tackle the power allocation problem, we first propose a power allocation method based on linear fractional programming. In addition, we derive closed-form expressions of the optimal transmit power for base station and D2D transmitter. Simulation results show that the performance of two solutions matches well and the proposed full-duplex NOMA relaying based underlay D2D communication scheme outperforms existing full-duplex relaying based D2D communication scheme.