• Title/Summary/Keyword: Channel reallocation

Search Result 13, Processing Time 0.015 seconds

Improved Subcarrier Allocation Algorithm for Multiuser OFDM Systems (다중 사용자 OFDM 시스템을 위한 개선된 부반송파 할당 알고리즘)

  • Lee, Jae-Yoon;Yoon, Dong-Weon;Park, Sang-Kyu;Hyun, Kwang-Min
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.44 no.9
    • /
    • pp.9-16
    • /
    • 2007
  • In the multiuser OFDM systems, an efficient resource allocation is necessary in order to provide the service to more users. This paper proposes u improved subcarrier allocation algorithm, satisfying each user's QoS under the limited resources, to maximize total transmission data rate and spectral efficiency. The proposed algorithm is divided into two steps. In the first step, users who are eligible for services are determined by using BER, user's minimum data rate requirement, and channel information. In the second step, first, subcarriers are allocated to users on the basis of channel state. And then, reallocation is fulfilled so that the total transmission data rate is maximized and the least reduction in the overall throughput is caused.

Resource Reallocation Algorithm for Layered Video Multicast (계층적 비디오 멀티캐스트를 위한 자원 재할당 알고리즘)

  • Yun, Jiun;Park, Dong Chan;Hwang, Sung Sue;Kim, Min Ki;Kim, Suk Chan
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39A no.5
    • /
    • pp.293-301
    • /
    • 2014
  • It has been grown interests ot the convergence services about broadcasting and multicasting services such as Mobile IPTV. It needs the efficient scheduling and resource allocation algorithm because video contents have the large data. This paper proposes the resource allocation algorithm for the layered-encoded video coding in the multicasting services. Existing approaches only deal with the utility maximization in the current video frames. However, these algorithms have a problem for the Quality of Services(QoS) if the user's channel states are not good. We apply the delay constraint and find to maximize the utility values using the current content's frames and already assigned content's frames within the constraint periods. The performance of the proposed algorithm is evaluated by the higher layer transmission rates compared the existing algorithm and significantly improved for the QoS.

Superposition Coding Multiplexing for Fading Broadcast Channels with Rate Constraints (전송률 제한을 둔 페이딩 방송채널을 위한 중첩코딩 다중화)

  • Lee, Min;Oh, Seong-Keun;Jeong, Byung-Jang
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.11A
    • /
    • pp.1072-1078
    • /
    • 2008
  • In this paper, we propose an efficient superposition coding multiplexing(SCM) method based on power allocation in descending order for fading broadcast channels in which per-user minimum and maximum rate constraints are considered in order to maximize the transmission effectiveness. It consists of three steps as follows. In the first step, a user group is selected to maximize the number of users with whom a transmitter can communicate instantaneously. In the second step, per-user power allocation for each user is done in descending order of transmit power by determining a maximum allowable interference power from all subsequent interfering users in order to guarantee its corresponding minimum rate, and then a residual power is calculated. The final step is performed if some power remains even after the second step. In this step, additional power allocation is performed up to the maximum transmit power to provide the maximum rate to the corresponding user, again in ascending order, starting from the last user in descending order. But, this method does not require power reallocation to subsequent users because tentative power allocation in the second step has been performed in descending order to guarantee the minimum rate for each user, taking into account the maximum allowable interference power from all the subsequent users. Therefore, the proposed method gets more efficient in term of computational complexity when per-user minimum as well as maximum rate constraints exist, especially as the number of users increases.