• Title/Summary/Keyword: output scheduling

Search Result 137, Processing Time 0.02 seconds

Fairness-aware Scheduling Scheme for MIMO OFDM Multiuser Diversity System. (MIMO OFDM 다중사용자 시스템 사용자간 공평성을 고려한 스케쥴링 기법)

  • An Sehyun;Yoo Myungsik;Lee Woncheol;Shin Yoan
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.6A
    • /
    • pp.474-480
    • /
    • 2005
  • In this paper, we present a new scheduling scheme for MIMO OFDM Multiuser Diversity System. This scheduling scheme maximizes the system throughput, and at the same time fairly shares the resources based on the feedback information from the receivers and the queue information. To show the effectiveness of the proposed algorithm, we evaluate the performance of the proposed algorithm as compared to K&H and RR algorithms.

Pipelined and Prioritized Round Robin Scheduling in an Input Queueing Switch (입력큐 교환기에서의 우선순위 파이프라인 순환 스케줄링)

  • 이상호;신동렬
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.52 no.6
    • /
    • pp.365-371
    • /
    • 2003
  • Input queued switch is useful for high bandwidth switches and routers because of lower complexity and fewer circuits than output queued. The input queued switch, however, suffers the HOL-Blocking, which limits its throughput to 58%. To overcome HOL-Blocking problem, many input-queued switch controlled by a scheduling algorithm. Most scheduling algorithms are implemented based on a centralized scheduler which restrict the design of the switch architecture. In this paper, we propose a simple scheduler called Pipelined Round Robin (PRR) which is intrinsically distributed by each input port. We presents to show the effectiveness of the proposed scheduler.

An Algorithm for Iterative Detection and Decoding MIMO-OFDM HARQ with Antenna Scheduling

  • Kim, Kyoo-Hyun;Kang, Seung-Won;Mohaisen, Manar;Chang, Kyung-Hi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.2 no.4
    • /
    • pp.194-208
    • /
    • 2008
  • In this paper, a multiple-input-multiple-output (MIMO) hybrid-automatic repeat request (HARQ) algorithm with antenna scheduling is proposed. It retransmits the packet using scheduled transmit antennas according to the state of the communication link, instead of retransmitting the packet via the same antennas. As a result, a combination of conventional HARQ systems, viz. chase combining (CC) and incremental redundancy (IR) are used to achieve better performance and lower redundancy. The proposed MIMO-OFDM HARQ system with antenna scheduling is shown to be superior to conventional MIMO HARQ systems, due to its spatial diversity gain.

Optimal Scheduling of Level 5 Electric Vehicle Chargers Based on Voltage Level

  • Sung-Kook Jeon;Dongho Lee
    • Journal of the Korean Society of Industry Convergence
    • /
    • v.26 no.6_1
    • /
    • pp.985-991
    • /
    • 2023
  • This study proposes a solution to the voltage drop in electric vehicle chargers, due to the parasitic resistance and inductance of power cables when the chargers are separated by large distances. A method using multi-level electric vehicle chargers that can output power in stages, without installing an additional energy supply source such as a reactive power compensator or an energy storage system, is proposed. The voltage drop over the power cables, to optimize the charging scheduling, is derived. The obtained voltage drop equation is used to formulate the constraints of the optimization process. To validate the effectiveness of the obtained results, an optimal charging scheduling is performed for each period in a case study based on the assumed charging demands of three connected chargers. From the calculations, the proposed method was found to generate an annual profit of $20,800 for a $12,500 increase in installation costs.

Multiuser Heterogeneous-SNR MIMO Systems

  • Jo, Han-Shin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.8
    • /
    • pp.2607-2625
    • /
    • 2014
  • Previous studies on multiuser multiple-input multiple-output (MIMO) mostly assume a homogeneous signal-to-noise ratio (SNR), where each user has the same average SNR. However, real networks are more likely to feature heterogeneous SNRs (a random-valued average SNR). Motivated by this fact, we analyze a multiuser MIMO downlink with a zero-forcing (ZF) receiver in a heterogeneous SNR environment. A transmitter with Mantennas constructs M orthonormal beams and performs the SNR-based proportional fairness (S-PF) scheduling where data are transmitted to users each with the highest ratio of the SNR to the average SNR per beam. We develop a new analytical expression for the sum throughput of the multiuser MIMO system. Furthermore, simply modifying the expression provides the sum throughput for important special cases such as homogeneous SNR, max-rate scheduling, or high SNR. From the analysis, we obtain new insights (lemmas): i) S-PF scheduling maximizes the sum throughput in the homogeneous SNR and ii) under high SNR and a large number of users, S-PF scheduling yields the same multiuser diversity for both heterogeneous SNRs and homogeneous SNRs. Numerical simulation shows the interesting result that the sum throughput is not always proportional to M for a small number of users.

On the Multiuser Diversity in SIMO Interfering Multiple Access Channels: Distributed User Scheduling Framework

  • Shin, Won-Yong;Park, Dohyung;Jung, Bang Chul
    • Journal of Communications and Networks
    • /
    • v.17 no.3
    • /
    • pp.267-274
    • /
    • 2015
  • Due to the difficulty of coordination in the cellular uplink, it is a practical challenge how to achieve the optimal throughput scaling with distributed scheduling. In this paper, we propose a distributed and opportunistic user scheduling (DOUS) that achieves the optimal throughput scaling in a single-input multiple-output interfering multiple-access channel, i.e., a multi-cell uplink network, with M antennas at each base station (BS) and N users in a cell. In a distributed fashion, each BS adopts M random receive beamforming vectors and then selects M users such that both sufficiently large desired signal power and sufficiently small generating interference are guaranteed. As a main result, it is proved that full multiuser diversity gain can be achieved in each cell when a sufficiently large number of users exist. Numerical evaluation confirms that in a practical setting of the multi-cell network, the proposed DOUS outperforms the existing distributed user scheduling algorithms in terms of sum-rate.

Beamforming Matrix Transformation and User Scheduling for MIMO Systems (다중 안테나 빔형성 메트릭스 변환 기법 및 사용자 선택 기법)

  • Park, Jong-Rok;Lee, Sang-Hoon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.1A
    • /
    • pp.25-33
    • /
    • 2012
  • Random beamforming (RBF) uses the signal to interference plus noise ratio (SINR) feedback to select users in multiple-input multiple-output (MIMO) systems. A large number of users are required to obtain the gain of multi-user diversity for a downlink transmission. However, if the number is not large enough, it may be difficult to obtain multi-user diversity, leading to a rapid degradation in performance. To resolve this problem, we propose the beamforming matrix transformation and the user scheduling method. The beamforming matrix transformation scheme uses the SINRs of each users and have a better performance than conventional schemes over a small number of users. In addition, we propose the user scheduling scheme corresponding to the beamforming matrix transformation. In simulation results, we demonstrate that the sum-rate can be improved according to the number of users.

A Packet Scheduling for Input-Queued Router with Deadline Constraints

  • Joo, Un-Gi;Lee, Heyung-Sub;Lee, Hyeong-Ho;Kim, Whan-Woo
    • Proceedings of the IEEK Conference
    • /
    • 2002.07b
    • /
    • pp.884-887
    • /
    • 2002
  • This paper considers a scheduling problem of routers with VOQ(Virtual Output Queue)s, where the router has an N ${\times}$N port input-queued switch and each input queue is composed of N VOQs. The objective of the paper is to develope scheduling algorithms which minimize mean tardiness under a common due date. The paper characterizes the optimal solution properties. Based upon the characterization, a integer programming is formulated for the optimal solution and two optimal solution algorithms are developed for two special cases of 2 ${\times}$2 switch and N${\times}$N switch with identical traffic.

  • PDF

Novel Beamforming and Scheduling Method for Interference Mitigation at Cell Edge (셀 경계 지역 간섭 완화를 위한 효율적 빔포밍 및 스케쥴링 방법)

  • Kim, Kyung Hoon;Choi, Seung Won
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.8 no.4
    • /
    • pp.129-133
    • /
    • 2012
  • Coordinated multi-point transmission (CoMP) is a candidate technique for next generation cellular communications systems. One of the primary elements discussed in LTE-Advanced technology is CoMP, which can improve cell edge user data rate as well as spectral efficiency due to multiple input multiple output - orthogonal frequency division multiplex (MIMO-OFDM). We consider a system with multiple cells in which base stations coordinate with each other by sharing user channel state information (CSI), which mitigates inter cell interference (ICI), especially for users located at the cell edge. We introduce a new user scheduling method of ICI cancellation and the loss reduction of effective channel gain during the beamforming process, the proposed method improves the system sum rate, when compared to the conventional method by an average of 0.55bps/Hz in different number of total users per cell. It also outperforms the conventional method by approximately 0.38bps/Hz using different SNRs.

A MU-MIMO User Scheduling Mechanism based on Active CSI Exchange (능동적 CSI 교환을 기반으로 한 MU-MIMO 유저 스케줄링 기법)

  • Lee, Kyu-Haeng;Kim, Chong-Kwon
    • Journal of KIISE:Information Networking
    • /
    • v.41 no.4
    • /
    • pp.192-201
    • /
    • 2014
  • User scheduling boosts the Multi-User Multi-Input Multi-Output (MU-MIMO) gain by selecting an optimal set of users to increase the 802.11 Wi-Fi system capacities. Many kinds of user scheduling algorithms, however, fail to realize the advantages of MU-MIMO due to formidable Channel State Information (CSI) overhead. In this paper, we propose a user scheduling method considering such CSI exchange overhead and its MAC protocol, called ACE (Active CSI Exchange based User Scheduling for MU-MIMO Transmission). Unlike most proposals, where user scheduling is performed after an Access Point (AP) receives CSI from all users, ACE determines the best user set during the CSI exchange phase. In particular, the AP broadcasts a channel hint about previously scheduled users, and the remaining users actively send CSI reports according to their Effective Channel Gains (ECGs) calculated from the hint. Through trace-driven MATLAB simulations, we prove that the proposed scheme improves the throughput gain significantly.