US 2015/0031406 A1 · System and Method for Greedy-Based Autonomous Resource Block Assignment Scheme for Cellular Networks with Self-Organizing Relaying Terminals

Abstract

Iterative sequential selection techniques can be used to efficiently compute RB assignment sequences in relay-assisted networks. Embodiment techniques construct a graphical representation of a cyclic group based on a selected pattern in a set of patterns and a selected cyclic-shift in a plurality of cyclic shifts. Remaining patterns are placed in a unitary group, and an iterative sequential selection technique is used to evaluate the remaining patterns in the unitary group for each of the cyclic shifts over a sequence of iterations, thereby complete the list of RB assignment sequences. At the end of each iteration, a new RB assignment sequence is added based on the pattern, cyclic shift tuple producing the fewest collisions with occupied resource blocks of the graphical representation.

Claims21

Dependent claims

A method for efficiently generating resource block (RB) assignment sequences for relays, the method comprising:

obtaining a plurality of patterns for assigning available RBs of a cell;
selecting both a first pattern from the plurality of patterns and a cyclic shift from a plurality of cyclic shifts to obtain a first pattern, cyclic-shift tuple, wherein remaining patterns in the plurality of patterns are included in a unitary group;
constructing a cyclic group in accordance with the first pattern, cyclic-shift tuple, wherein the cyclic group is constrained by occupied RBs corresponding to effective RBs of the first pattern, cyclic-shift tuple;
performing iterative sequential selection of remaining patterns in the unitary group over the plurality of cyclic shifts to obtain an ordering of RB assignment sequences, wherein the first pattern, cyclic-shift tuple specifies a first RB assignment sequence in the ordering of RB assignment sequences;
and
configuring lookup tables in each of the relay terminals in accordance with the ordering of RB assignment sequences.

3 more elements

An apparatus adapted to efficiently generate resource block (RB) assignment sequences for relays, the apparatus comprising:

a processor;
and
a computer readable storage medium storing programming for execution by the processor, the programming including instructions to:
obtain a plurality of patterns for assigning available RBs of a cell;
select both a first pattern from the plurality of patterns and a cyclic shift from a plurality of cyclic shifts to obtain a first pattern, cyclic-shift tuple, wherein remaining patterns in the plurality of patterns are included in a unitary group;
construct a cyclic group in accordance with the first pattern, cyclic-shift tuple, wherein the cyclic group is constrained by occupied RBs corresponding to effective RBs of the first pattern, cyclic-shift tuple;
perform iterative sequential selection of remaining patterns in the unitary group over the plurality of cyclic shifts to obtain an ordering of RB assignment sequences, wherein the first pattern, cyclic-shift tuple specifies a first RB assignment sequence in the ordering of RB assignment sequences;
and
configure lookup tables in each of the relay terminals in accordance with the ordering of RB assignment sequences.

6 more elements

Dependencies are inferred from the claim text.

System and Method for Greedy-Based Autonomous Resource Block Assignment Scheme for Cellular Networks with Self-Organizing Relaying Terminals

Life of this patent

System and Method for Greedy-Based Autonomous Resource Block Assignment Scheme for Cellular Networks with Self-Organizing Relaying Terminals

Life of this patent

Abstract

Claims21