• Journal of electromagnetic engineering and science
• /
• 제11권2호
• /
• pp.71-75
• /
• 2011

The sum-rate maximization rule can find an optimal user set that maximizes the sum capacity in multiple input multiple output (MIMO) broadcast channels (BCs), but the search space for finding the optimal user set becomes prohibitively large as the number of users increases. The proposed algorithm selects a user set of the largest effective channel norms based on statistical channel state information (CSI) for reducing the computational complexity, and uses Tomlinson-Harashima precoding (THP) for minimizing the interference between selected users in time-varying MIMO BCs.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1998년도 추계종합학술대회 논문집
• /
• pp.75-78
• /
• 1998

In this paper, we propose a new cell discarding and scheduling scheme which reduce cell loss rate by measuring, in real time, the number of discarded cells in the queuing system with a different loss priority for each class of service such that each class of service meets its cell loss rate requirements and reduce average delay rate for the traffic that is sensitive in cell delay in output buffer of the ATM switch. Throughout the computer simulation, the existing scheduling scheme and proposed scheme are compared with respect to cell loss rate and average delay time.

• 전자공학회논문지S
• /
• 제34S권11호
• /
• pp.25-33
• /
• 1997

The end-to-end rate-based control mechanism is used for the flow control of the ABR service to allow much more flexibility in ATM switching system. To accommodate the ABR service effciently many algorithms such as EFCI, EPRCA, ERICA, and CAPC2 have been proposed for the switch algorithm. ABR cells and related RM cells are received at the ATM switch fabric transparently without any processing. And then cells received from the traffic source are queued in the ABR buffer of switching system. The ABR buffer usually has some thresholds for easy congestion control signal transmission. Whatever we use, therefore, these can be many ABR traffic control algorithms to implement the ABR transfer capability. The genertion of congestion indicate signal for ABR control algorithms is determined by ABR buffer satus. And ABR buffer status is determined by ABR cells transfer ratio in ATM switch fabrics. In this paper, we presented the functional structures for control of the ABR traffic capability, proposed the readout scheduling, cell slot allocation of output link and the buffer allocation model for effective ABR traffic guranteeing with considering CBR/VBR traffics in ATM switch. Since the proposed readout scheduling scheme can provide more avaliable space to ABR buffer than existing readout scheduling scheme, generation rate of a SEND signal, that is, BCN signal in destination node can be increased for ABR call connection. Therefore, the proposed scheme, in this paper, can be appropriate as algorithm for effective ABR traffic service on output link of ATM switching node.

• 한국통신학회논문지
• /
• 제33권12A호
• /
• pp.1209-1216
• /
• 2008

무선통신 시스템에 있어서 스펙트럼 효율성과 전송속도의 극대화를 위해 MIMO(Multiple Input Multiple Output) 기술을 시스템에 적용하는 노련이 계속되고 있다. 최근 대두되고 있는 WiMAX와 LTE는 OFDM 기반 기술로서 CDMA보다 MIMO기술을 적용하기 쉽다는 장점에 의해 MIMO 기술을 기본으로 채택하고 있다. 하향 링크에서는 STC(Space Time Coding) 방식과 SM(Spatial Multiplexing) 방식을 사용하여 MIMO 방식을 기본 기술로 적용하였으며 상향링크에서는 C-MIMO(Collaborative MIMO) 기술이 사용된다. 특히, 상향링크는 양방향 데이터 통신을 활용한 다양한 신규 서비스가 제안되고 있어 전송 성능을 개선시킬 수 있는 C-MIMO의 성능향상이 기술 쟁점이 되고 있다. 본 논문에서는 C-MIMO 성능 향상을 위하여 기존에 사용되고 있는 신호간 직교성(OF: Orthogonal Factor)의 성질을 이용하여 단말 조합을 선택하는 방식(DPS: Determinant Pairing Scheduling)과 신호간 직교성을 사용하지 않고 단말 조합을 선택하는 방식(RPS: Random Pairing Scheduling)을 분석하였다. 또한 DPS와 RPS 방식을 보완한 새로운 알고리즘을 제안 하여 스펙트럼 효율을 높이는 방법을 고안하였다. 결과에 의하면 새로운 알고리즘을 통하여 RPS 대비 $2{\sim}3dB$ 이득을 보았으며 DPS에 비하여 현격하게 복잡도를 감소 시켰다.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1993년도 한국자동제어학술회의논문집(국내학술편); Seoul National University, Seoul; 20-22 Oct. 1993
• /
• pp.1111-1116
• /
• 1993

In this study, we discuss the design of the expert system for the scheduling of the FMC(Flexible Manufacturing Cell) consisting of the several versatile machines. Due to the NP property, the scheduling problem of several machine FMC is very complex task. Thus we proposed the two heuritstic shceduling algorithms for solving the problem and constituted the algorithm based of solving the problem and constituted the algorithm base of ISS(Intelligent Scheduling System) using them. By the rules in the rule base, the best alternative among various algorithms in algorithm base is selected and applied in controlling the FMC. To show the efficiency of ISS, the scheduling output of ISS and the existent dynamic dispatching rule were tested and compared. The results indicate that the ISS is superior to the existent dynamic dispatching rules in various performance indexes.

• Journal of Electrical Engineering and information Science
• /
• 제3권1호
• /
• pp.1-7
• /
• 1998

High-Level synthesis of digital circuits calls for automatic translation of a behavioral description to a structural design entity represented in terms of components and connection. One of the critical steps in high-level synthesis is to determine a particular scheduling algorithm that will assign behavioral operations to control states. A new scheduling algorithm called Data Availability Scheduling (DAS) for high-level synthesis is presented. It can determine an appropriate scheduling algorithm and minimize the number of states required using data availability and dependency conditions extracted from the behavioral code, taking into account of states required using data availability and dependency conditions extracted from the behavioral code, taking into account resource constraint in each control state. The DAS algorithm is efficient because data availability conditions, and conditional and wait statements break the behavioral code into manageable pieces which are analyzed independently. The output is the number of states in a finite state machine and shows better results than those of previous algorithms.

• Industrial Engineering and Management Systems
• /
• 제7권1호
• /
• pp.99-107
• /
• 2008

This paper is concerned with scheduling in Flexible Manufacturing Systems (FMS) using a Fuzzy Logic (FL) approach. Four fuzzy input variables: machine allocated processing time, machine priority, machine available time and transportation priority are defined. The job priority is the output fuzzy variable, showing the priority status of a job to be selected for the next operation on a machine. The model will first select the machines and then assign operations based on a multi-criteria scheduling scheme. System/machine utilization, minimizing mean flow time and balancing machine usage will be covered. Experimental and comparative tests indicate the superiority of this fuzzy based scheduling model over the existing approaches.

• 한국산업정보학회:학술대회논문집
• /
• 한국산업정보학회 1997년도 춘계학술대회 발표논문집
• /
• pp.235-246
• /
• 1997

Hybrid fuzzy gain scheduling controller is composed of a PD control and a fuzzy control for taking the advantage of each scheme. The key structure of the hybrid fuzzy gain scheduling control scheme is so called a switch which calculates weighting values between the fuzzy controller and the PD controller. However, due to the requirement of the switch , the hybrid fuzzy gain scheduling control scheme needs extra fuzzy logic processing, thus the structure is complicated. and requires more calculation time. To eliminate the drawbacks, a new hybrid fuzzy gain scheduling control scheme is proposed in this paper. In the proposed scheme, the membership function, for calculating of weithting value, and the input and output membership functions are combined. Thus the proposed hybrid scheme does not require switch for calculation of weighting value, and as a result, the calculation time is faster and the structure is more simple than the existing hybrid controller. Computer simulation results for an inverted pendulum model under Pole-Placement PID controller, fuzzy gain scheduling controller,existing hybrid controller , and proposed hybrid controller are compared to demonstrate the good property of the proposed hybrid controller.

• ETRI Journal
• /
• 제31권5호
• /
• pp.481-488
• /
• 2009

This paper proposes a new multiuser scheduling algorithm that can simultaneously support a variety of different quality-of-service (QoS) user groups while satisfying fairness among users in the same QoS group in MIMO broadcast channels. Toward this goal, the proposed algorithm consists of two parts: a QoS-aware fair (QF) scheduling within a QoS group and an antenna trade-off scheme between different QoS groups. The proposed QF scheduling algorithm finds a user set from a certain QoS group which can satisfy the fairness among users in terms of throughput or delay. The antenna trade-off scheme can minimize the QoS violations of a higher priority user group by trading off the number of transmit antennas allocated to different QoS groups. Numerical results demonstrate that the proposed QF scheduling method satisfies different types of fairness among users and can adjust the degree of fairness among them. The antenna trade-off scheme combined with QF scheduling can improve the probability of QoS-guaranteed transmission when supporting different QoS groups.

• ETRI Journal
• /
• 제32권5호
• /
• pp.657-664
• /
• 2010

Many embedded multimedia systems employ special hardware blocks to co-process with the main processor. Even though an efficient handling of such hardware blocks is critical on the overall performance of real-time multimedia systems, traditional real-time scheduling techniques cannot afford to guarantee a high quality of multimedia playbacks with neither delay nor jerking. This paper presents a hardware-aware rate monotonic scheduling (HA-RMS) algorithm to manage hardware tasks efficiently and handle special hardware blocks in the embedded multimedia system. The HA-RMS prioritizes the hardware tasks over software tasks not only to increase the hardware utilization of the system but also to reduce the output jitter of multimedia applications, which results in reducing the overall response time.