The search functionality is under construction.
The search functionality is under construction.

Keyword Search Result

[Keyword] resource assignment(4hit)

1-4hit
  • Interference-Aware Resource Allocation Scheme for Femtocell in OFDMA Systems

    Byungchan KWON  Junwoo JUNG  Jaesung LIM  

     
    LETTER-Wireless Communication Technologies

      Vol:
    E93-B No:8
      Page(s):
    2207-2210

    In this letter, we propose an interference-aware resource allocation algorithm for the uplink of OFDMA systems. It comprises a macrocell overlaid with short range femtocells. We define the interferences that occur between a macrocell and femtocells and present the resource assignment algorithm to resolve and mitigate the cross-tier interference effect based on the defined interference factors. Simulation results show that the proposed algorithm performs well in a macrocell and femtocells.

  • Dynamic Resource Assignment Scheme in Mesh-Topology Millimeter-Wave Broadband Entrance Networks

    Jaturong SANGIAMWONG  Katsutoshi TSUKAMOTO  Shozo KOMAKI  

     
    PAPER

      Vol:
    E87-A No:10
      Page(s):
    2668-2675

    This paper proposes the dynamic resource assignment (DRA) scheme in the multi-carrier mesh-topology millimeter-wave (MMW) broadband entrance networks. In the DRA scheme, the radio path allocation and the frequency channel assignment techniques are deployed to maximize the network throughput. In the radio path allocation technique, the traffic load is distributed into the appropriate paths. On the other hand, the frequency channel assignment is performed based on the linear programming (LP) method. As the results, the proposed DRA scheme yields higher throughput performance than the conventional scheme using the random frequency channel assignment. In addition, the proposed scheme can guarantee the throughput performance when the number of frequency channels is 36 and the input load is no more than 9 Gbps. Moreover, the proposed scheme can yield the satisfaction sub-optimum throughput with the small computational complexity.

  • Assignment-Driven Loop Pipeline Scheduling and Its Application to Data-Path Synthesis

    Toshiyuki YOROZUYA  Koji OHASHI  Mineo KANEKO  

     
    PAPER

      Vol:
    E85-A No:4
      Page(s):
    819-826

    In this paper, we study loop pipeline scheduling problem under given resource assignment (operation to functional unit assignments and data to register assignments), which is one of the key tasks in data-path synthesis based on the assignment solution space exploration. We show an approach using a precedence constraint graph with parametric disjunctive arcs generated from the specified assignment information, and derive a scheduling method using branch-and-bound exploration of the parameter space. As an application of the proposed scheduling method, it is incorporated with Simulated-Annealing (SA) based exploration of assignment solution space, and it is demonstrated that data-paths of the fifth-order elliptic wave filter are successfully synthesized.

  • Radio Resource Assignment in Multiple-Chip-Rate DS/CDMA Systems Supporting Multimedia Services

    Young-Woo KIM  Seung Joon LEE  Min Young CHUNG  Jeong Ho KIM  Dan Keun SUNG  

     
    PAPER-Mobile Communication

      Vol:
    E82-B No:1
      Page(s):
    145-155

    This paper is concerned with radio resource allocation in multiple-chip-rate (MCR) DS/CDMA systems accommodating multimedia services with different information rates and quality requirements. Considering both power spectral density (PSD) over a radio frequency (RF) band and the effect of RF input filtering on the receiver in MCR-DS/CDMA systems, criteria for capacity estimation are presented and the characteristics of co-channel interference between subsystems are investigated. System performance in MCR-DS/CDMA systems is strongly affected by radio resource assignment. A minimum power-increment-based resource assignment scheme for an efficient resource assignment scheme is proposed herein. The performance of this scheme is compared with that of a random-based resource assignment scheme in terms of blocking probability and normalized throughput. The minimum power-increment-based resource assignment scheme yields a better performance than the random-based resource assignment scheme for multimedia services.