• Title/Summary/Keyword: max CIR

Search Result 3, Processing Time 0.017 seconds

Fairness Scheduling Algorithm Using Adaptive Channel Assignment Based on SIR in HSDPA System (HSDPA시스템에서 수신 SIR기반의 유연한 채널 할당 방식의 공평한 스케줄링 기법에 관한 연구)

  • Lee, Seung-Hwan;Kim, Sung-Won;Park, Yong-Wan
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.9A
    • /
    • pp.878-887
    • /
    • 2007
  • In this paper, a fairness scheme is proposed that assigns different number of HS-PDSCH to the service user according to the received SIR of CPICH. Assigned channel number is determined by the SIR level. The highest SIR user gets the number of channels based on the SIR table and the remained channels are assigned to the other SIR users. This scheme can serve the similar maximum service throughput and higher fairness than MAX CIR packet scheduling algorithm. This scheme can also serve the higher service throughput than Proportional Fairness scheme.

Activites of Molds and Insects during Rice Storage -Part II. Activities of rice weevil(Sitophilus oryzae L.) and Aspergillus species- (쌀 저장중의 곰팡이와 저곡해충 -제2보. 쌀 바구미(Sitophilus oryzae L.)와 Aspergillus species의 생육-)

  • Kim, Young-Bae;Ryoo, Mun-Il
    • Applied Biological Chemistry
    • /
    • v.25 no.4
    • /
    • pp.257-260
    • /
    • 1982
  • During the rice storage at $28^{\cir}{\pm}1^{\cir}C$ and $60{\sim}70%$ R.H., the moisture content of rice, was increased max. 1. 6% by the activity of rice weevil. The growth of Asp. repens was not affected, while Asp. niger was inhibited after the appearance of its second generation adults. The development of rice weevil was generally accelerated by both of Asp. repens and Asp. niger, but decelerated at higher density of Asp. niger($1.6{\times}10^4$ propagules/g). The total number of rice weevil showed no significant difference during six weeks.

  • PDF

Multi-user Diversity Scheduling Methods Using Superposition Coding Multiplexing (중첩 코딩 다중화를 이용한 다중 사용자 다이버시티 스케줄링 방법)

  • Lee, Min;Oh, Seong-Keun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.4A
    • /
    • pp.332-340
    • /
    • 2010
  • In this paper, we deal with multi-user diversity scheduling methods that transmit simultaneously signals from multiple users using superposition coding multiplexing. These methods can make various scheduling methods be obtained, according to strategies for user selection priority from the first user to the first-following users, strategies for per-user power allocation, and resulting combining strategies. For the first user selection, we consider three strategies such as 1) higher priority for a user with a better channel state, 2) following the proportional fair scheduling (PFS) priority, 3) higher priority for a user with a lower average serving rate. For selection of the first-following users, we consider the identical strategies for the first user selection. However, in the second strategy, we can decide user priorities according to the original PFS ordering, or only once an additional user for power allocation according to the PFS criterion by considering a residual power and inter-user interference. In the strategies for power allocation, we consider two strategies as follows. In the first strategy, it allocates a power to provide a permissible per-user maximum rate. In the second strategy, it allocates a power to provide a required per-user minimum rate, and then it reallocates the residual power to respective users with a rate greater than the required minimum and less than the permissible maximum. We consider three directions for scheduling such as maximizing the sum rate, maximizing the fairness, and maximizing the sum rate while maintaining the PFS fairness. We select the max CIR, max-min fair, and PF scheduling methods as their corresponding reference methods [1 and references therein], and then we choose candidate scheduling methods which performances are similar to or better than those of the corresponding reference methods in terms of the sum rate or the fairness while being better than their corresponding performances in terms of the alternative metric (fairness or sum rate). Through computer simulations, we evaluate the sum rate and Jain’s fairness index (JFI) performances of various scheduling methods according to the number of users.