Self-organized distributed assignment, optimization, and use of physical cell IDs
AssigneeNokia Solutions and Networks Oy
InventorIan Dexter Garcia
Life of this patent
Estimating the term…
Abstract
At a base station in a wireless network, interference is determined for a plurality of pairs of cells. Each pair of cells is between an individual one of one or more serving cells formed by the base station and an individual one of other cells that surround the one or more serving cells. At the base station, values for physical cell identifications are allocated for the one or more serving cells based on the interference for the plurality of pairs of cells. Systems, methods, apparatus, programs, and program products are disclosed. The examples may also take into account modulo 30, modulo 3, and modulo 6 collisions.
Claims18
A method, comprising:
- determining, at a base station in a wireless network, interference for a plurality of pairs of cells, wherein each pair of cells is between an individual one of one or more serving cells formed by the base station and an individual one of other cells that surround the one or more serving cells;
- and
- allocating, at the base station, values for physical cell identifications for the one or more serving cells based on the interference for the plurality of pairs of cells;
- wherein allocating values for physical cell identifications for the one or more serving cells further comprises solving the following problem:
- Trace((GzPCI)T(Γneighbourhood+Z)GzPCI)=0,
- where Trace( ) is a trace operation, Γneighbourhood is a matrix of interference consisting of Γtarget(t), which is a first matrix for only a first plurality of pairs of cells, when only the first plurality of pairs of cells is used, and comprising Γtarget(t) and a plurality of Γpartial(t), each of which is a second matrix, when both the first matrix and the second matrices are used,
- Z
- i
- ,
- j
- =
- {
- 1
- cell
-
-
- i
-
-
- and
-
-
- j
-
-
- are
-
-
- neighbours
-
-
- or
-
-
- neighbour
-
- -
-
- of
-
- -
-
- neighbours
- 0
- otherwise
- ,
- GzPCI is a grouping matrix whose element at row i column j is given by
- G
- z
- ,
- i
- ,
- j
- PCI
- =
- {
- 1
- j
- =
- p
- z
- ,
- i
- +
- 1
- 0
- otherwise
- ,
- where pz represent a z'th candidate solution for the physical cell identifications, and the values for the physical cell identifications for the one or more serving cells are popt, which is determined by the GzPCI that makes the equation in the problem true.
An apparatus, comprising:
- one or more processors;
- and
- one or more memories including computer program code,
- the one or more memories and the computer program code configured, with the one or more processors, to cause the apparatus to perform at least the following:
- determining, at a base station in a wireless network, interference for a plurality of pairs of cells, wherein each pair of cells is between an individual one of one or more serving cells formed by the base station and an individual one of other cells that surround the one or more serving cells;
- and
- allocating, at the base station, values for physical cell identifications for the one or more serving cells based on the interference for the plurality of pairs of cells;
- wherein the allocating values for physical cell identifications for the one or more serving cells further comprises solving the following problem:
- Trace((GzPCI)T(Γneighbourhood+Z)GzPCI)=0,
- where Trace( ) is a trace operation, Γneighbourhood is a matrix of interference consisting of Γtarget(t), which is a first matrix for only a first plurality of pairs of cells, when only the first plurality of pairs of cells is used, and comprising Γtarget(t) and a plurality of Γpartial(t), each of which is a second matrix, when both the first matrix and the second matrices are used,
- Z
- i
- ,
- j
- =
- {
- 1
- cell
-
-
- i
-
-
- and
-
-
- j
-
-
- are
-
-
- neighbours
-
-
- or
-
-
- neighbour
-
- -
-
- of
-
- -
-
- neighbours
- 0
- otherwise
- ,
- GzPCI is a grouping matrix whose element at row i column j is given by
- G
- z
- ,
- i
- ,
- j
- PCI
- =
- {
- 1
- j
- =
- p
- z
- ,
- i
- +
- 1
- 0
- otherwise
- ,
- where pz represent a z'th candidate solution for the physical cell identifications, and the values for the physical cell identifications for the one or more serving cells are popt, which is determined by the GzPCI that makes the equation in the problem true.
A non-transitory computer-readable storage medium comprising a computer program product having computer program code embodied therein for use with a computer, the computer program code comprising:
- determining, at a base station in a wireless network, interference for a plurality of pairs of cells, wherein each pair of cells is between an individual one of one or more serving cells formed by the base station and an individual one of other cells that surround the one or more serving cells;
- and
- allocating, at the base station, values for physical cell identifications for the one or more serving cells based on the interference for the plurality of pairs of cells;
- wherein the allocating values for physical cell identifications for the one or more serving cells further comprises solving the following problem:
- Trace((GzPCI)T(Γneighbourhood+Z)GzPCI)=0,
- where Trace( ) is a trace operation, Γneighbourhood is a matrix of interference consisting of Γtarget(t), which is a first matrix for only a first plurality of pairs of cells, when only the first plurality of pairs of cells is used, and comprising Γtarget(t) and a plurality of Γpartial(t), each of which is a second matrix, when both the first matrix and the second matrices are used,
- Z
- i
- ,
- j
- =
- {
- 1
- cell
-
-
- i
-
-
- and
-
-
- j
-
-
- are
-
-
- neighbours
-
-
- or
-
-
- neighbour
-
- -
-
- of
-
- -
-
- neighbours
- 0
- otherwise
- ,
- GzPCI is a grouping matrix whose element at row i column j is given by
- G
- z
- ,
- i
- ,
- j
- PCI
- =
- {
- 1
- j
- =
- p
- z
- ,
- i
- +
- 1
- 0
- otherwise
- ,
- where pz represent a z'th candidate solution for the physical cell identifications, and the values for the physical cell identifications for the one or more serving cells are popt, which is determined by the GzPCI that makes the equation in the problem true.
Dependencies are inferred from the claim text.