EP0905922A2

Resource assigning method, communication resource assigning method, and base station and terminal unit

Abstract

A resource assigning method, a communication resource assigning method, and a base station and a terminal unit for enabling channels to be simply assigned if data (tasks) of different capacities are mixed together. If (n) continuous resources each having the same capacity (c) are assigned to a plurality of tasks having different sizes represented by c□∼2k (k = 0, 1, 2, ..., M), unavailable resource detecting processing detects the position (j) of an unavailable resource; unassigned resource setting processing defines as an unassigned resource the communication resource in a part x1 to x6 having a capacity of c□∼2k relative to the respective ends of the resource and defining the position (j) of the unavailable resource detected by the unavailable resource detecting processing, as unassigned resource; and a resource setting processing sequentially assigns the resource except for the position defined as unassigned one by the unassigned resource setting processing, to a task of a capacity of c□∼2k from the respective ends of the resource at an interval of this capacity and sequentially assigns a resource of a capacity smaller than c□∼2k that could not be assigned to a task of the same capacity at an interval of c□∼2k-1 until (k) reaches a value that cannot be assigned.

EP0905922A2, drawing sheet 1
Sheet 1 of 8

Term

Term ended

Projected expiry passed 29 September 2018, 8 years ago.

  1. Priority
  2. Filed
  3. Published
  4. Projected expiry
  5. Today

13 claims: 6 independent, 7 dependent

  1. 1
    A resource assigning method for assigning (n) ((n) is an arbitrary integer) continuous resources each having the same capacity to a plurality of tasks having different sizes, wherein when the size of said plurality of tasks is represented as c □∼2k (k = 0, 1, 2, ..., M) when the capacity of each of said resources is designated as (c), the method comprises:an unavailable resource detecting step for detecting the positions of unavailable resources;an unassigned resource setting step for defining the resources in a part having a capacity of c□∼2k relative to the respective ends of said (n) continuous resources, as unassigned resources and defining the unavailable resources detected in said unavailable resource detecting step, as unassigned resources;a k-th resource assigning step for sequentially assigning the resources other than said unassigned resources, from the respective ends at intervals of a capacity of c□∼2k;a first repeating loop for sequentially repeating said unassigned resource setting step and k-th resource assigning step until (k) has changed from M to 0, using those resources of a capacity less than c□∼2k which could not be assigned in said k-th resource assigning step, as original resources in the subsequent (k-1)-th resource assigning step;a k-th task assigning step for assigning c□∼2k of tasks with c□∼2k of resources assigned by said repetition and after assigning these resources to all of said c□∼2k of tasks, assigning resources to c□∼2k-1 of tasks if there are resources remaining;a (k-1)-th resource synthesizing step for dividing into two the resources to which the capacity of c□∼2k-1 was assigned during said k-th task assigning step and synthesizing these two resources and the resources assigned in said (k-1)-th resource assigning step, as original resources in a (k-1)-th task assigning step;and a second repeating loop for sequentially repeating said k-th task assigning step and said (k-1)-th resource synthesizing step until (k) changes from M to 0
  2. 2
    A resource assigning method for assigning (n) ((n) is an arbitrary integer) continuous resources each having the same capacity to a plurality of tasks having different sizes, wherein when the size of said plurality of tasks is represented as c □∼2k (k = 0, 1, 2, ..., M) when the capacity of each of said resources is designated as (c), the method comprises:an unavailable resource detecting step for detecting the positions of unavailable resources;an unassigned resource setting step for defining the resources in a part having a capacity of c□∼2k relative to the respective ends of said (n) continuous resources, as unassigned resources and defining the unavailable resources detected in said unavailable resource detecting step, as unassigned resources;a k-th resource assigning step for sequentially assigning the resources other than said unassigned resources, from the respective ends at intervals of a capacity of c□∼2k;a first repeating loop for sequentially repeating said unassigned resource setting step and k-th resource assigning step until (k) has changed from M to 0, using those resources of a capacity less than c□∼2k which could not be assigned in said k-th resource assigning step, as original resources in the subsequent (k-1) th resource assigning step;a k-th task assigning step for assigning c□∼2k of tasks with c□∼2k of resources assigned by said repetition and after assigning these resources to all of said c□∼2k of tasks, assigning resources to c□∼2k-1 of tasks if there are resources remaining;a k-th assignment changing step for changing the correspondence between the resources and the tasks assigned during said k-th task assigning step;a (k-1)-th resource synthesizing step for dividing into two the resources to which the capacity of c□∼2k-1 was assigned during said k-th task assigning step and which were then changed by said k-th assignment changing step and synthesizing these resources and the resources assigned by said (k-1)-th resource assigning step, as original resources in a (k-1)-th task assigning step;and a second repeating loop for sequentially repeating said k-th task assigning step, said k-th assignment changing step, and said (k-1)-th resource synthesizing step until (k) changes from M to 0.
  3. 4
    A method for assigning a plurality of communication information having different sizes with a communication resource composed of (n) ((n) is an arbitrary integer) continuous slots each having the same capacity, characterized in that    when the size of said plurality of communication information is represented as c□∼2k (k = 0, 1, 2, ..., M) when the capacity of each of said slot is designated as (c), the method comprises:an unavailable slot detecting step for detecting the positions of unavailable slots;an unassigned communication resource setting step for defining as an unassigned resource, the communication resource in a part having a capacity of c□∼2k relative to the respective ends of said communication resource of (n) continuous slots and defining the unavailable communication resource detected in said unavailable slot detecting step, as an unassigned resource;a k-th communication resource assigning step for sequentially assigning the communication resource except for said unassigned part, from the respective ends at intervals of a capacity of c□∼2k;a first repeating loop for sequentially repeating said unassigned communication resource setting step and k-th communication resource assigning step until (k) has changed from M to 0, using those communication resource of a capacity less than c □∼2k which could not assigned in said k-th communication resource assigning step, as an original communication resource in the subsequent (k-1)-th communication resource assigning step;a k-th communication information assigning step for assigning c□∼2k of communication information with c□∼2k of communication resource assigned by said repetition and after assigning this resource to all of said c□∼2k of communication information, assigning a resource to c□∼2k-1 of communication information if there is a resource remaining;a (k-1)-th communication resource synthesizing step for dividing into two the communication resources to which the capacity of c□∼2k-1 was assigned during said k-th communication information assigning step and synthesizing these two resources and the communication resource assigned in said (k-1)-th communication resource assigning step, as an original communication resource in a (k-1)-th communication information assigning step;and a second repeating loop for sequentially repeating said k-th communication information assigning step and said (k-1)-th communication resource synthesizing step until (k) changes from M to 0.
  4. 5
    A method for assigning a plurality of communication information having different sizes with a communication resource composed of (n) ((n) is an arbitrary integer) continuous slots each having the same capacity, characterized in that:when the size of said plurality of communication information is represented as c□∼2k (k = 0, 1, 2, ..., M) when the capacity of each of said slot is designated as (c), the method comprises: an unavailable slot detecting step for detecting the positions of unavailable slots;an unassigned communication resource setting step for defining as an unassigned resource, the communication resource in a part having a capacity of c□∼2k relative to the respective ends of said communication resource of (n) continuous slots and defining the unavailable communication resource detected in said unavailable slot detecting step, as an unassigned resource;a k-th communication resource assigning step for sequentially assigning the communication resource except for said unassigned part, from the respective ends at intervals of a capacity of c□∼2k;a first repeating loop for sequentially repeating said unassigned communication resource setting step and k-th communication resource assigning step until (k) has changed from M to 0, using that communication resource of a capacity less than c□∼2k which could not assigned in said k-th communication resource assigning step, as an original communication resource in the subsequent (k-1)-th communication resource assigning step;a k-th communication information assigning step for assigning c□∼2k of communication information with c□∼2k of communication resource assigned by said repetition and after assigning this resource to all of said c□∼2k of communication information, assigning a resource to c□∼2k-1 of communication information if there is a resource remaining;a k-th communication information assignment changing step for changing the correspondence between the communication resource and the communication information assigned during said k-th communication information assigning step;a (k-1)-th communication resource synthesizing step for dividing into two the communication resources to which the capacity of c□∼2k-1 was assigned during said k-th communication information assigning step and which were then changed by said k-th communication information assignment changing step and synthesizing these two resources and the communication resource assigned by said (k-1)-th communication resource assigning step, as an original communication resource in a (k-1)-th communication information assigning step;and a second repeating loop for sequentially repeating said k-th communication information assigning step, said k-th communication information assignment changing step, and said (k-1)-th communication resource synthesizing step until (k) changes from M to 0.
  5. 7
    A base station to which a communication resource composed of (n) ((n) is an arbitrary integer) continuous slots each having the same transmission capacity (c) and which assigns said communication resource with a plurality of units of communication information having different sizes represented by c□∼2k (k = 0, 1, 2, ..., M) before transmitting the information to a terminal unit, characterized in that the station comprises:an interfering-wave detecting means for detecting a slot position at which an interfering wave is present;an unassigned slot setting means for defining as an unassigned resource, the communication resource in a part having a capacity of c□∼2k relative to the respective ends of said communication resource of (n) continuous slots and defining the slot position detected by said interfering-wave detecting means, as unassigned position;a communication resource setting means for sequentially assigning the communication resource except for the slots defined as unassigned ones by said unassigned slot setting means, to the same capacity of communication information from the respective ends at intervals of a capacity of c□∼2k, and assigning that communication resource of a capacity less than c□∼2k which could not be assigned, to the same capacity of communication information at intervals of a capacity of c□∼2k-1, until (k) reaches a value that cannot be assigned;and a communication processing means for communicating with the terminal unit using the slot assignment set by said communication resource setting means.
  6. 11
    A terminal unit for communicating from a base station assigned with a communication resource composed of (n) ((n) is an arbitrary integer) continuous slots each having the same transmission capacity (c), a signal transmitted in such a way that said communication resource is assigned with a plurality of units of communication information having different sizes represented by c□∼2k (k = 0, 1, 2, ..., M), characterized in that the unit comprises:a communication means for communicating with said base station;a slot assignment judging means for determining control information transmitted from said base station using said communication means, and judging the state in which said communication information is assigned, based on the slot assignment information included in the control information;and a selection means for selecting a slot that communicates with said base station using said communication means, based on the judgement executed by said slot assignment judging means;and in that: as judgement processing, said slot assignment judging means executes: unassigned slot setting processing for defining the communication resource in a part having a capacity of c□∼2k relative to the respective ends of said communication resource of at least (n) continuous slots, as an unassigned resource;and communication resource setting processing for sequentially assigning the communication resource except for the slots defined as unassigned ones by said unassigned slot setting processing, to the same capacity of communication information from the respective ends at intervals of a capacity of c□∼2k, and assigning that communication resource of a capacity less than c□∼2k which could not be assigned, to the same capacity of communication information at intervals of a capacity of c□∼2k-1, until (k) reaches a value that cannot be assigned;