EP1915880B1 - Method for the assignment of scrambling codes to cells of a CDMA cellular mobile communications network - Google Patents
Method for the assignment of scrambling codes to cells of a CDMA cellular mobile communications network Download PDFInfo
- Publication number
- EP1915880B1 EP1915880B1 EP05766927A EP05766927A EP1915880B1 EP 1915880 B1 EP1915880 B1 EP 1915880B1 EP 05766927 A EP05766927 A EP 05766927A EP 05766927 A EP05766927 A EP 05766927A EP 1915880 B1 EP1915880 B1 EP 1915880B1
- Authority
- EP
- European Patent Office
- Prior art keywords
- cells
- cell
- neighbors
- given cell
- calculating
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Not-in-force
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
- H04W16/02—Resource partitioning among network components, e.g. reuse partitioning
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B1/00—Details of transmission systems, not covered by a single one of groups H04B3/00 - H04B13/00; Details of transmission systems not characterised by the medium used for transmission
- H04B1/69—Spread spectrum techniques
- H04B1/707—Spread spectrum techniques using direct sequence modulation
Definitions
- the present invention generally relates to the field of telecommunications, particularly to mobile communications networks, allowing communications between mobile users. More specifically, the invention relates to cellular mobile communications networks that adopt a Code Division Multiple Access (CDMA) access scheme, such as cellular networks of the third generation.
- CDMA Code Division Multiple Access
- Cellular mobile communications networks have the peculiarity of featuring a plurality of so-called “network cells”, where by the term cell there is intended the set of geographical "points", "pixels", in jargon (practically, small areas of, e.g. , 50m by 50m, or 10m by 10m), which are covered by the radio electromagnetic signal irradiated by a generic common antenna.
- Cellular mobile communications networks thus provide coverage of a determined geographic region by means of the plurality of network cells.
- UMTS Universal Mobile Telecommunications System
- CDMA is a technique of accessing a shared communications medium according to which a same frequency band (a "channel") is assigned simultaneously to all the requesting users; the discrimination among different signals intended for different users is accomplished by exploiting a coding scheme, according to which different codes are assigned to different users, and the signals directed thereto are coded using the respective codes.
- the coding process comprises a so-called “spreading” operation, according to which the bandwidth of the original (uncoded) signal is widened, in particular spread over a larger bandwidth, at the same time reducing the average signal power.
- the spreading is achieved by coding the signal using a code that contains a higher number of symbols than the number of bits to be transmitted; the coded signal thus has a symbol rate (the so-called "chip rate”) higher than the bit rate of the original signal.
- a “scrambling” process is further implemented, by applying a "scrambling code” to the signal after the spreading operation, with the purpose of scrambling the different symbols.
- the scrambling operation does not increase the signal bandwidth (the symbol rate is not changed compared to the chip rate of the spread signal), and can be viewed as the addition of a "color" to the signal, that allows identifying the transmission source.
- the scrambling process allows distinguishing the signals within a given network cell from the signal within a different cell: to this purpose, different scrambling codes are used in different cells, in particular if such cells are neighboring.
- the adoption of the CDMA access scheme has an impact on the "handover" procedures, by which, generally speaking, there is intended the set of procedures that makes it possible to keep active a service provided to a generic mobile user even when the user moves.
- a mobile user may exploit a same radio channel in different cells; thus, the passage of responsibility (handover) of a given mobile user from one network cell to another adjacent thereto (typically, in consequence of the movement of the mobile user through the geographic area) can be handled by keeping the communication with the user active on the same channel.
- a mechanism referred to as “soft-handover” allows the mobile user's terminal to decode signals coming from, and thus to exchange information with, two or more different antennas or, more generally, with different radio base stations.
- the UE can distinguish between signals issued by different radio base stations, i.e. by different cells, by looking at the different signal color.
- A Active Set
- the set of scrambling codes used in downlink is represented by the Gold codes featuring low self-correlation and cross-correlation.
- the standard currently prescribes that the number of usable codes in UMTS networks is limited to a pool of 8,192 different codes.
- the pool of 8,192 usable scrambling codes is subdivided into 512 groups, each group including 16 codes, where one of the sixteen codes takes the role of a so-called "Primary Scrambling Code” (PSC), and the remaining 15 codes of the group are “secondary scrambling codes”.
- PSC Primary Scrambling Code
- a unique PSC (and, consequently, the associated 15 secondary scrambling codes associated to that PSC) has to be assigned to each cell of the area under planning, the PSC being chosen among the available 512 PSCs.
- the pool of 8,192 scrambling codes available for use is further considered as subdivided into 64 code groups of 128 codes each, where, within the generic code group, eight codes among the 128 codes are primary scrambling codes; thus, the pool of 8,192 available scrambling codes includes 64 code groups, each one including eight primary scrambling codes (and associated secondary scrambling codes).
- the primary scrambling code plays a role in the procedure called "cell search", which includes the set of operations that allow the UE synchronize to the network and decode the control channels of the network cell wherein it is located. Specifically, the UE invokes the cell search procedure in either one of two cases:
- the cell search procedure has an impact on the UE performance: depending on the complexity of the operations to be performed, the UE battery charge consumption, as well as the time required by the UE for synchronizing and decoding the control channel (the so-called " Broadcast Control Channel " - BCH) over which the network information travels, vary.
- the cell search procedure impact on the battery charge consumption is higher when the procedure is performed in support of the cell reselection procedure, because such operation is carried out more frequently compared to the initial synchronization of the UE upon turning it on.
- the assignment of scrambling codes in downlink can be effected by means of planning algorithms.
- the scrambling code assignment should satisfy a PSC re-use requirement, according to which unique PSCs, within the set of 512 available PSCs, have to be univocally assigned to neighboring cells belonging to the geographic area being planned: this is essential for a correct implementation of the soft-handover, because the generic UE located in a macrodiversity area should be capable of discriminating between signals irradiated by different antennas ( i.e. , signals by different cells in the so-called "monitored set" of the UE).
- a consideration area is defined for each cell in a set of cells being optimized for a frequency plan.
- a CA for a cell can be defined in terms of a distance between cells, radio attenuation between cells, and/of a handover order for neighboring cells (e.g., all 2nd order of neighbors neighboring cells).
- a frequency or channel reallocation made in a cell may not be detected outside of that particular cell's CA.
- the frequency plan can be optimized by determining all reallocations whereby local allocation-beneficial suggestions are found. For example, if a cell's CA is defined as its 1st order neighbors, these beneficial suggestions can be consistency determinations (e.g., set of rules) that apply to that cell and its contiguous (lst order) neighbors.
- the Applicant has tackled the problem of how to properly define neighborhood and adjacency relationships between cells in a network area under planning, to be used in the PSC assignment, which neighborhood and adjacency relationships are adapted to ensure that the cells of the area under planning that may operate in macrodiversity are assigned unique PSCs.
- the Applicant has found a way to correctly define the set of adjacent cells in order to make an adequate PSC plan, by providing for each cell a set of adjacent cells including: 1) cells that are neighbors up to the third order, wherein two cells are considered neighbors in case the respective coverage areas at least partially overlap; 2) cells suitable to produce, in points of the considered geographic area where the considered cell produces a signal power higher than a predetermined threshold, respective signal powers higher than the same threshold, preferably taking into account the traffic offered by said cells in said points.
- two cells are considered neighbors if their areas of coverage have at least one pixel in common, or if the signal of one cell is perceived on average in the area of the other cell to an extent exceeding a predetermined statistical threshold.
- the present invention thus relates to a method for assigning scrambling codes in a CDMA cellular radio communications network comprising a plurality of network cells covering a geographic area.
- the method of the invention is set forth in claim 1.
- the present invention relates to a data processing system for assigning scrambling codes in a CDMA cellular radio communications network comprising a plurality of network cells covering a geographic area, as set forth in claim 3.
- Figure 1 there is schematically depicted a portion of UMTS network under planning, particularly an UMTS network portion intended to provide cellular mobile communications capability within a given geographic area.
- the UMTS network portion under consideration comprises a plurality of cells C1, C2, C3, C4,..., Cn, each one having a relatively limited area coverage (the area coverage of the generic cell depending on several factors such as, for example, the environment wherein the UMTS network is installed, as will be described in greater detail later on).
- the cells are each one made up of a plurality of pixels, i.e., they are the set of geographic points covered and served by the radio electromagnetic signal irradiated by a respective cell's antenna.
- Node B a network entity
- the Node Bs 105a and 105b in the drawing where, merely by way of example, it is assumed that the cells C1, C2, C3, and C4, are managed by the Node B 105a, and that the cell Cn is managed by the Node B 105b ).
- Radio Network Controller like the RNC 110 shown in the drawing; the RNCs are connected to the core UMTS network 115.
- a generic UE like the UE 125 depicted as located within the cell C1, can receive signals transmitted by the transmitters, and irradiated by the antennas, of different cells, e.g . the cells C1 and C2, and is able to differentiate among them.
- each transmitter implements a spreading and a subsequent scrambling of the signal to be transmitted.
- the signal (data) to be transmitted 205 having a given symbol rate (usually called the bit rate) is first submitted to a spreading process 210, using a spreading code 215, in order to "widen" its spectrum and distribute (and thus lower) its power over the whole' channel bandwidth.
- the spreading code 215 has a higher number of symbols than the signal to be transmitted 205, thus the spread signal 220 has a symbol rate (a chip rate, in jargon) higher than the bit rate of the initial signal 205.
- the spread signal 220 is then submitted to a scrambling process 225, using a scrambling code or scrambling sequence 230.
- the signal scrambling process does not change the chip rate, thus the signal 235 to be transmitted "over-the-air" has a chip rate equal to that of the spread signal.
- the scrambling process is used for making signals transmitted by the transmitters of different cells distinguishable.
- every cell has to use a unique scrambling code, and thus a problem of scrambling code assignment rises.
- the set of scrambling codes used in downlink is represented by the Gold codes featuring low self-correlation and cross-correlation.
- the standard prescribes that the number of usable codes in UMTS networks is 8,192.
- the pool of 8,192 usable scrambling codes (identified globally by 400 in the drawing) is subdivided into 64 groups, like the group GR1 in the drawing, wherein each of said scrambling codes group, as depicted in the drawing, contains 128 different scrambling codes.
- the pool of 8,192 different scrambling codes can be viewed as subdivided into 512 sets of 16 scrambling codes each, where one of the sixteen scrambling codes is a PSC, the remaining 15 being SSC.
- each group of 128 scrambling codes like the group GR1, includes eight sets of 16 scrambling codes, and thus eight PSCs (those depicted as shaded squares), with the associated SSCs.
- the geographic area represented schematically in Figure 1 is assumed to be an area of the UMTS network to be planned. Planning the network area means, among other issues, properly assigning PSCs to the different cells of the area under planning.
- ⁇ j identifies the best server area of the cell C j as far as the CPICH is considered
- Ta m n j generic UE present at the pixel (m,n) belonging to the best server area ⁇ j of the cell C j and connected to the cell C j ; NBR j "NeighBoRhood set" (or NBR set) for the cell C j , i.e.
- the adjacency criterion may be a simple geometrical one, i . e ., two cells are considered adjacent in case their area of coverage have at least one pixel in common, or take into account electromagnetic field propagation aspects, thereby two cells may be considered adjacent if the signal of one cell is perceived on average in the area of the other cell to an extent exceeding a predetermined statistical threshold; in the following of this description, the term "geometrically adjacent" will be used to denote cells that are considered adjacent based on the criterion adopted in the planning phase for constructing the sets NBR sets; ⁇ SH maximum admissible difference in the CPICH power level RSCP m n j and RSCP m n k of two generic cells C j and C k for the cell C k to enter in macrodiversity with the cell C j in the pixel (m,n)
- the PSC to be assigned to the generic cell of the network area under planning should be such that (equation (1)): PSC z ⁇ PSC k ⁇ ⁇ z ⁇ k ⁇ MS m n j ⁇ m n ⁇ ⁇ j
- the PSC to be assigned to the generic cell of the area under planning should differ from the PSC assigned to any other cell in the monitored set MS m n j , and this should be true in any pixel (m,n) in the best server area ⁇ j of each cell C j .
- the generic UE is able to discriminate among signals coming from different cells in any macrodiversity areas.
- the monitored set MS m n j for the generic cell C j is in general not known a priori , particularly it is not known at the time the network area is being planned, because it is built based on more or less proprietary algorithm running in the UEs, which algorithms differ from UE manufacturer to UE manufacturer, and also depends on the position of the UE.
- Equation (2) PSC j ⁇ PSC k ⁇ k ⁇ ADJ j , where the list or set ADJ[j] of "adjoined cells", i.e. of cells that are adjoined to the generic cell C j , is properly built, in the way described hereinbelow.
- the Applicant has found that the set ADJ[j] of adjoined cells for the generic cell C j should in principle include:
- case a) means that the set ADJ[j] of adjoined cells for the generic cell C j includes all the cells listed in the NBR set NBR j for the cell C j , i.e. all the cells that, based on geometrical considerations, are declared to have at least one pixel in common with the cell C j , like the cell Ca in Figure 6A (first-order adjacency).
- Case b) means that the set ADJ[j] of adjoined cells for the generic cell C j further includes all the cells that are listed in the NBR sets of the cells geometrically adjacent to the cell C j ; this is a second-order adjacency condition: two generic cells are defined to be adjacent cells of the second-order if they share at least one adjacent cell, i.e. if there is at least one cell that is adjacent to both the two cells under consideration; it is for example the case of the cell C b in Figure 6A .
- Case c) means that the set ADJ[j] of adjoined cells for the generic cell C j further includes all the cells that are listed in the NBR sets of the cells geometrically adjacent to cells that are in turn geometrically adjacent to the cell C j ; this case introduces a third-order adjacency condition. It is for example the case of the cell Cc in Figure 6B , and of the cells Cc and Ce in Figure 6C .
- Case d) means that the set ADJ[j] of adjoined cells for the generic cell C j further includes all the cells that are listed in the NBR sets of the cells geometrically adjacent to cells that are in turn geometrically adjacent to cells being in turn geometrically adjacent to the cell C j ; this case introduces a fourth-order adjacency condition. It is for example the case of cell C d in Figure 6D .
- equation (2) above ensures that geometrically adjacent cells will be assigned different PSCs.
- equation (2) above ensures that cells included in the NBR sets of cells geometrically adjacent to any cell geometrically adjacent to the generic cell C j will be assigned different PSCs.
- equation (2) By including in the list ADJ[j] of adjoined cells the third-order adjacent cells, equation (2) above ensures that, taken any two geometrically adjacent cells (such as Ca and Cb in Figure 6B ), the union of their respective NBR sets does not contain cells having same PSC; also, equation (2) ensures that, taken three generic cells being geometrically adjacent two by two (such as Ca, Cb and Cd in Figure 6C ), the union of their NBR sets does not include cells having same PSC. It is observed that the inclusion, in the list ADJ[j] of adjoined cells, of the third-order adjacent cells allows overcoming the problem related to the fact that the composition of the monitored set in the areas of soft-handover is not known a priori .
- equation (2) ensures that, considering three cells in soft-handover (such as Ca, Cb and Cc in Figure 6D ), the union of their three NBR sets does not include cells having same PSC even if two cells (such as Ca and Cc in Figure 6D ) out of the three considered cells assumed in soft-handover have not been declared geometrically adjacent ( i . e ., they are not included in the respective NBR sets). This allows taking into account worst-case situations wherein an active set includes cells that, erroneously, were not declared mutually geometrically adjacent.
- the cardinality DIM[ADJ[j]] of the set ADJ[j] built in the way discussed above i.e. the number of cells included in the set ADJ[j] , at least in non-trivial cases, may be so high that it is not possible to assign the PSCs without violating the requirement expressed by equation (1) above; in other words, the number of available PSCs (512, in the current implementation of the standard) may be not sufficient.
- a method for building an optimized set ADJ[j] of adjoined cells for the generic cell C j of the area under planning is set forth.
- the method according to the invention embodiment to be described allows reducing the dimension of the set ADJ[j] , while however ensuring that the use of the set ADJ[j] for the unique assignment of the PSCs guarantees the observance of the condition set forth by equation (1) above, i.e. the soft-handover is correctly managed.
- the method according to the invention embodiment herein discussed is adapted to build, for the generic cell C j of the network area under planning, a list ADJ[j] of adjoined cells, including the union of the list of the first-order adjacent cells for the cell C j , the list of second-order adjacent cells for the cell C j , the list of the third-order adjacent cells for the cell C j , and (instead of including the list of the fourth-order adjacent cells) further including a list of cells which are declared "interferentially adjacent" based on a criterion that takes into account the electromagnetic field distribution aspects.
- the method to be described may be implemented by means of a program executed by a suitable data processing apparatus, such as a general-purpose personal computer or a workstation specifically programmed to execute a program.
- a suitable data processing apparatus such as a general-purpose personal computer or a workstation specifically programmed to execute a program.
- the set of cells C ⁇ C1, C2,..., C n ⁇ (with n denoting a positive integer) to which it is necessary to assign the respective PSCs is intended to have been already created; the number n of cells, and their nature, particularly their area coverage, is assumed to have been defined in advance, according to criteria such as the traffic load to be managed, the traffic geographical distribution, the network accessibility target ( e . g ., indoor, outdoor, "in car",%), the traffic mobility (e.g. , the average speed of the users), the area targets to be served, etc .
- the neighboring lists NBRj are passed to a first-order, a second-order and a third-order adjacency calculator modules 705, 710 and 715, adapted to calculate the lists of first-order, second-order and third-order adjacent cells to the generic cell C j considered.
- a cells lists union calculator module 720 receives the lists calculated by the first-order, the second-order and the third-order adjacency calculator modules 705, 710 and 715, and calculates the union thereof (eliminating repetitions of same cells).
- the cell scanner module 700 also passes the best server area ⁇ j received in input in respect of the generic cell C j to a pixel scanner module 725, adapted to scan the different pixels (m,n) of the best server area ⁇ j . It is observed that the best server area ⁇ j includes, for each pixel (m,n), a list of cells whose irradiated signal is perceived at the pixel (m,n), the cells in said list being ranked according for example to the power level of their CPICH at that pixel (m,n).
- a candidate set builder module 730 determines, for the generic pixel (m,n) of the best server area ⁇ j of the cell C j , the respective candidate set CS m n j , exploiting the maximum admissible difference ⁇ SH in the CPICH power level for determining which cells are to be included in the candidate set, and which not (in particular, by including only those cells having in the generic pixel (m,n) a CPICH power level that differs from the CPICH power level of the cell C j of less than ⁇ SH ).
- a pixel selector module 735 receives the candidate set CS m n j and is adapted to select those pixels of the best server area ⁇ j of the cell C j for which the candidate set includes at least one further cell in addition to the best server cell C j .
- An adjacency coefficients calculator module 737 calculates a plurality of adjacency coefficients, one for each pair of cells in the area under planning, which, as will be described in the following, are indicative of a degree of electromagnetic adjacency of two generic cells.
- An adjacency threshold calculator module 740 is adapted to calculate, for the cell C j under consideration, an adjacency threshold which is used for discriminating whether another cell belonging to the candidate sets CS m n j of the pixels of the best server area ⁇ j of the cell C j is to be included in the list ADJ[j] of adjoined cells for the cell C j .
- An interference set calculator module 745 receives the adjacency threshold and determines the list of cells to be included in the adjoined set ADJ[j] for the cell C j .
- the calculated list is passed to the lists union calculator module 720, which provides in output the list ADJ[j] of the cells adjoined to the cell C j .
- the procedure leads to the construction of a square matrix N(s,t), having a number of rows equal to the number n of cells in the area being planned, and of a vector D(u), with a number of elements equal to the number n of cells in the area under planning.
- N(s,t) square matrix
- D(u) vector
- the meaning of the elements of the matrix N(s,t) and of the components of the vector D(u) will be explained later on.
- the values of the elements of the matrix N(s,t) and of the components of the vector D(u) are reset to zero (block 805 ).
- An iterative procedure is then performed over all the cells of the area under planning, selecting one cell C q at a time (block 810, and decision block 815 ).
- the pixel For the generic pixel (m,n) under processing, it is ascertained whether that pixel belongs to a region of macrodiversity of the best server area ⁇ q ; to this purpose, it is ascertained whether the candidate set CS m n q at that pixel includes more than one cell ( i.e ., at least one further cell in addition to the best server cell C q ) (block 830, exit branch Y ). In the affirmative case, the pixel is put in a list of selected pixels (block 835 ).
- N(s,t) N(b,a) .
- the equivalent traffic T eq (m,n) is the sum of the traffic offered to the pixel (m,n) by all the services, weighted by the respective bit rates.
- the value of the generic q th component D(q) of the vector D(u) provides a measure of the area wherein the generic cell C q is potentially in macrodiversity with at least one other cell (i.e., the area of the candidate set of the cell C q , excluded those pixels wherein the cell C q is alone in the candidate set), weighted by a weight factor corresponding to the sum of all the (equivalent) offered traffic.
- the value of the generic element N(a,b) of the matrix provides a measure of the portion of the candidate set area of the cell C a , wherein both the cell C a and the cell C b are both in the candidate set; weighted by a weight factor which provides a measure of the (equivalent) offered traffic.
- the adjacency coefficient takes values in the range from 0 to 1, because the parameter ⁇ a,b (m,n) is in the range from 0 to 1.
- the cell C a is put in a list INTERF b and the cell C b in a list INTERF a ( 870 ).
- first-order, second-order and third-order adjacent cell lists are calculated in respect of the cell C j by means of modules 705, 710 and 715 of Figure 7 (blocks 885, 887 and 889 ).
- a further loop is entered (blocks 890 and 899 ),in which, for each cell C j , the lists of the first-order, second-order and third-order adjacent cells, and the list INTERFj calculated as discussed above, are combined, thereby obtaining the adjoined set ADJ[j] in respect of the cell C j (block 895 ).
- the combination that allows obtaining the adjoined set ADJ[j] is the following:
- the set C C ⁇ 1 , C ⁇ 2 , ... , C ⁇ n , with n denoting a positive integer is created, where C indicates the set of the n cells C1, C2,..., C n belonging to the network area being planned, and to which it is necessary to assign the respective PSCs (block 905 ).
- the number n of cells, and their nature, particularly their area coverage, is assumed to have been defined in advance, according to criteria such as the traffic load to be managed, the traffic geographical distribution, the network accessibility target (e.g. , indoor, outdoor, "in car",...), the traffic mobility (e.g. , the average speed of the users), the area targets to be served, etc.
- the set ADJ[k] of adjoined cells is calculated, according to the method described in the foregoing (block 910 ).
- the set C of cells in the area under planning is then sorted based on the cardinality of the adjoined sets ADJ[ 1 ], ADJ[ 2 ] ,..., ADJ[ n ] (block 920 ). This means that, in the subsequent steps of the method, the cells having a higher number of neighbors are processed first.
- constraints to be respected in the PSC assignment procedure are set (block 925 ).
- the constraints may be such as to prevent the assignment of same PSCs to neighboring cells (this constraint corresponds to the main, primary scrambling code re-use constraint).
- a range [ min , max ] of usable PSCs is then defined (block 930 ), within the pool of PSCs (possibly, all the 512 scrambling codes).
- a repetitive procedure is then performed: a loop counter i is initialized to "1" (block 935 ), and the first cell in the (sorted) set C is selected for being processed (block 940 ).
- the PSC assignment procedure will try to fulfill the PSC re-use constraint, avoiding to assign a same primary scrambling code to neighboring cells.
- the binary vector TAVi is built in such a way that (block 945 ):
- the vector is scanned, starting from the vector component a min that corresponds to the lower PSC in the usable range [ min,max ], in search of the first encountered binary vector component a k that is equal to "0" (block 950 ).
- the loop counter i is increased by one (block 965 ), and the operation flow jumps back to block 940 (connector J2 ); a new cell Ci is selected and processed in the way described above, unless all the cells of the set C have already been processed (decision block 970 ), in which case the procedure ends.
- a respective PSC (and the associated SSCs) is assigned to each cell in the area under planning, unless the procedure ended for impossibility of assigning the scrambling codes satisfying the re-use requirement.
- the algorithm may assign to these cells a particular code external to the set of codes previously considered.
- NBR A ⁇ B , C ⁇
- NBR B ⁇ A,C,E ⁇
- NBR C ⁇ A,B,F ⁇
- NBR D ⁇ G ⁇
- NBR E ⁇ B,L ⁇
- NBR F ⁇ C,H ⁇
- NBR G ⁇ D ⁇
- NBR H ⁇ F H ⁇
- NBR L ⁇ E R ⁇ . It is observed that the cell D is not adjacent to any one of the cells A, B and C.
- the candidate set of the pixel p1 include the cells A and B
- the candidate set of the pixel p2 includes the cells A, B and C
- the candidate set of the pixel p3 includes the cells A, B, C and D; thus, even if the cell D has not been declared adjacent to the cell A, its signal can be received in the pixel p3.
- the order, from top to bottom, of the cells listed in the candidate set of the generic one of the three pixels considered reflects the (decreasing) order of the power level of the respective CPICH as received in that pixel.
- the following operations are performed for the determination of the set INTERFj in respect of the generic cell C j , and limitedly for simplicity to the three considered pixels p1, p2 and p3.
- T eq (m,n) 1 for every pixel p1, p2 and p3 .
- the three pixels p1 , p2 and p3 are the only pixels, in the best-server area (calculated on the basis of the CPICH power level) of the cell A, having a candidate set including more than one (i.e. , the beset server) cell.
- the calculation gives:
- the sets INTERF A , INTERF B , INTERF C for the three cells A, B and C after the analysis of the pixels belonging to the best server area of the cell A are:
- the sets of the first-order, second-order and third-order adjacent cells are the following:
- the set of cells which are adjacent of the ( N +1) order to a generic cell include the cells which are adj acent of the N order to that cell.
- the generic mobile terminal may receive the signal of the cell D; not including the cell D in the sets ADJ[A], ADJ[B], ADJ[C] , on which basis the PSCs are assigned to the different cells, might cause the cell D to be assigned a same PSC as the cells A, B, C, with a consequent malfunctioning of the system, and possible call drops.
- the present invention provides a method by which it is possible to determine, for the generic cell of a network area under planning, a set of neighborhood relationships with other cells such that using the thus determined set of neighborhood relationships for uniquely assigning PSCs, it is ensured that the soft-handover conditions are properly managed, because cells that will possibly be in macrodiversity with other cells are properly identified, so they can be assigned a unique PSC.
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
Description
- The present invention generally relates to the field of telecommunications, particularly to mobile communications networks, allowing communications between mobile users. More specifically, the invention relates to cellular mobile communications networks that adopt a Code Division Multiple Access (CDMA) access scheme, such as cellular networks of the third generation.
- Cellular mobile communications networks have the peculiarity of featuring a plurality of so-called "network cells", where by the term cell there is intended the set of geographical "points", "pixels", in jargon (practically, small areas of, e.g., 50m by 50m, or 10m by 10m), which are covered by the radio electromagnetic signal irradiated by a generic common antenna. Cellular mobile communications networks thus provide coverage of a determined geographic region by means of the plurality of network cells.
- Among the different types of cellular mobile communications networks, some networks have a radio access front end exploiting the CDMA access scheme to the shared (radio) communication medium. This is for example the case of third-generation cellular mobile communications networks, currently being deployed. One of the third-generation mobile communications standards is the so-called Universal Mobile Telecommunications System (UMTS), which is in particular the standard that has been adopted by operators in Europe.
- CDMA is a technique of accessing a shared communications medium according to which a same frequency band (a "channel") is assigned simultaneously to all the requesting users; the discrimination among different signals intended for different users is accomplished by exploiting a coding scheme, according to which different codes are assigned to different users, and the signals directed thereto are coded using the respective codes.
- The codes assigned to different users and exploited for coding the signals directed thereto need to be "orthogonal".
- The coding process comprises a so-called "spreading" operation, according to which the bandwidth of the original (uncoded) signal is widened, in particular spread over a larger bandwidth, at the same time reducing the average signal power. The spreading is achieved by coding the signal using a code that contains a higher number of symbols than the number of bits to be transmitted; the coded signal thus has a symbol rate (the so-called "chip rate") higher than the bit rate of the original signal.
- A "scrambling" process is further implemented, by applying a "scrambling code" to the signal after the spreading operation, with the purpose of scrambling the different symbols. The scrambling operation does not increase the signal bandwidth (the symbol rate is not changed compared to the chip rate of the spread signal), and can be viewed as the addition of a "color" to the signal, that allows identifying the transmission source. Particularly, in downlink (i.e., from the radio base station to the mobile terminal), the scrambling process allows distinguishing the signals within a given network cell from the signal within a different cell: to this purpose, different scrambling codes are used in different cells, in particular if such cells are neighboring.
- The adoption of the CDMA access scheme has an impact on the "handover" procedures, by which, generally speaking, there is intended the set of procedures that makes it possible to keep active a service provided to a generic mobile user even when the user moves. In particular, in the CDMA access scheme a mobile user may exploit a same radio channel in different cells; thus, the passage of responsibility (handover) of a given mobile user from one network cell to another adjacent thereto (typically, in consequence of the movement of the mobile user through the geographic area) can be handled by keeping the communication with the user active on the same channel. In particular, thanks to the fact that the signals irradiated by different sources (different antennas corresponding to different cells) are distinguishable because of the use of different scrambling codes, a mechanism referred to as "soft-handover" (relying on a particular type of receiver in the User Equipment - UE -, called "Rake") allows the mobile user's terminal to decode signals coming from, and thus to exchange information with, two or more different antennas or, more generally, with different radio base stations. In particular, thanks to the soft-handover mechanism, the UE can distinguish between signals issued by different radio base stations, i.e. by different cells, by looking at the different signal color. These areas with coverage from two or more cells are referred to as "soft-handover areas" or "macrodiversity areas". More generally, the term "macrodiversity" is used to identify the process allowing the UE connection through more than one Base Station/Access Point at the same time for the same connection in progress. The different network cells to which the UE is simultaneously connected form the so-called "Active Set" (AS).
- As known, in the UMTS the set of scrambling codes used in downlink is represented by the Gold codes featuring low self-correlation and cross-correlation. The length of the Gold code for the UMTS system is in principle equal to eighteen bits, for a total of 218 - 1 = 262,143 different codes. However, in order to keep the receiver not too complex, only a fraction of such a vast set of codes is effectively exploited in practical implementations. Specifically, the standard currently prescribes that the number of usable codes in UMTS networks is limited to a pool of 8,192 different codes. The pool of 8,192 usable scrambling codes is subdivided into 512 groups, each group including 16 codes, where one of the sixteen codes takes the role of a so-called "Primary Scrambling Code" (PSC), and the remaining 15 codes of the group are "secondary scrambling codes".
- When planning an UMTS network, or a particular regional area thereof, a unique PSC (and, consequently, the associated 15 secondary scrambling codes associated to that PSC) has to be assigned to each cell of the area under planning, the PSC being chosen among the available 512 PSCs.
- The pool of 8,192 scrambling codes available for use is further considered as subdivided into 64 code groups of 128 codes each, where, within the generic code group, eight codes among the 128 codes are primary scrambling codes; thus, the pool of 8,192 available scrambling codes includes 64 code groups, each one including eight primary scrambling codes (and associated secondary scrambling codes).
- In downlink, the primary scrambling code plays a role in the procedure called "cell search", which includes the set of operations that allow the UE synchronize to the network and decode the control channels of the network cell wherein it is located. Specifically, the UE invokes the cell search procedure in either one of two cases:
- whenever the UE is turned on and has to register to the network for the first time (after a previous de-registration in consequence to a turn off); or
- for purposes of measuring the common channels of the adjacent cells, with the aim of updating the AS of different network cells to which the mobile terminal is connected (a procedure called "cell reselection").
- The cell search procedure has an impact on the UE performance: depending on the complexity of the operations to be performed, the UE battery charge consumption, as well as the time required by the UE for synchronizing and decoding the control channel (the so-called "Broadcast Control Channel" - BCH) over which the network information travels, vary. In particular, the cell search procedure impact on the battery charge consumption is higher when the procedure is performed in support of the cell reselection procedure, because such operation is carried out more frequently compared to the initial synchronization of the UE upon turning it on.
- The assignment of scrambling codes in downlink can be effected by means of planning algorithms. In particular, the scrambling code assignment should satisfy a PSC re-use requirement, according to which unique PSCs, within the set of 512 available PSCs, have to be univocally assigned to neighboring cells belonging to the geographic area being planned: this is essential for a correct implementation of the soft-handover, because the generic UE located in a macrodiversity area should be capable of discriminating between signals irradiated by different antennas (i.e., signals by different cells in the so-called "monitored set" of the UE).
- In the paper by Y.H. Jung and Y. H. Lee, "Scrambling code planning for 3GPP W-CDMA systems", IEEE VTC2001 Spring, Rhodes, Greece, May 2001, an M x M matrix C = [cij ] (where M is the number of network cells) is defined, called "compatibility matrix", wherein the generic matrix element cij is a constant equal to either one or zero, depending on whether or not the distance between the i-th and j-th cells is or not less than a so-called "reuse distance", which is the minimum distance between cells that can have an identical code set. Moreover, a set S of available code indexes S={1, 2, ..., z} is introduced. The scrambling codes are then assigned in the respect of two constraints: first, only one scrambling code set is assigned to a cell; second, the code index separation between the i-th and j-th cells should be greater than or equal to cij .
-
US 2001/0041574 describes a method and system for making multiple frequency reallocation decisions, which can be based on a single set of radio channel measurements. A consideration area (CA) is defined for each cell in a set of cells being optimized for a frequency plan. For example, a CA for a cell can be defined in terms of a distance between cells, radio attenuation between cells, and/of a handover order for neighboring cells (e.g., all 2nd order of neighbors neighboring cells). For the preferred embodiment, a frequency or channel reallocation made in a cell may not be detected outside of that particular cell's CA. As such, the frequency plan can be optimized by determining all reallocations whereby local allocation-beneficial suggestions are found. For example, if a cell's CA is defined as its 1st order neighbors, these beneficial suggestions can be consistency determinations (e.g., set of rules) that apply to that cell and its contiguous (lst order) neighbors. - The Applicant has observed that the approach outlined by Jung and Lee is adapted to assign the PSCs respecting the requirement of equation (1) above if and only if the number of elements cij different from 0, i being fixed and j variable, is at most equal to the maximum number of available PSCs (512).
- Also, the Applicant has observed that a limitation of the approach by Jung is that no indications are provided for the correct definition of the set of cells which are "adjacent" to the generic cell under consideration. An incorrect definition of such set of cells may lead to a PSC plan that is not adequate.
- In view of the outlined state of the art and related problems, drawbacks and limitations, the Applicant has tackled the general problem of PSC assignment to the different cells of a network area under planning.
- In particular, the Applicant has tackled the problem of how to properly define neighborhood and adjacency relationships between cells in a network area under planning, to be used in the PSC assignment, which neighborhood and adjacency relationships are adapted to ensure that the cells of the area under planning that may operate in macrodiversity are assigned unique PSCs. The Applicant has found a way to correctly define the set of adjacent cells in order to make an adequate PSC plan, by providing for each cell a set of adjacent cells including: 1) cells that are neighbors up to the third order, wherein two cells are considered neighbors in case the respective coverage areas at least partially overlap; 2) cells suitable to produce, in points of the considered geographic area where the considered cell produces a signal power higher than a predetermined threshold, respective signal powers higher than the same threshold, preferably taking into account the traffic offered by said cells in said points.
- In particular, two cells are considered neighbors if their areas of coverage have at least one pixel in common, or if the signal of one cell is perceived on average in the area of the other cell to an extent exceeding a predetermined statistical threshold.
- According to a first aspect thereof, the present invention thus relates to a method for assigning scrambling codes in a CDMA cellular radio communications network comprising a plurality of network cells covering a geographic area. The method of the invention is set forth in
claim 1. - According to a second aspect thereof, the present invention relates to a data processing system for assigning scrambling codes in a CDMA cellular radio communications network comprising a plurality of network cells covering a geographic area, as set forth in
claim 3. - Other aspects of the invention relate to a computer program implementing the method when executed by a data processing system, and a computer program product including such a computer program.
- The features and advantages of the present invention will be made apparent by the following detailed description of an embodiment thereof, provided merely by way of non-limitative example, description that will be conducted making reference to the annexed drawings, wherein:
-
Figure 1 pictorially shows a portion of a UMTS network being planned, intended to cover a respective geographic area, with a plurality of network cells to which scrambling codes are to be assigned during the planning process; -
Figure 2 schematically represents a spreading and scrambling operations performed on a signal to be transmitted, according to the UMTS standard; -
Figure 3 schematically shows, in terms of a timing diagram, the result of the operations of spreading and scrambling on a signal to be transmitted; -
Figure 4 pictorially shows a subdivision in groups of the scrambling codes, according to the UMTS standard; -
Figure 5 pictorially shows a best server area of a network cell, and a pixel thereof whereat several cells are in macrodiversity; -
Figures 6A to 6D schematically depict different cases of cells adjacency which need to be taken into account for a correct PSC assignment; -
Figure 7 schematically depicts the main functional components of an adjacency list calculator according to an embodiment of the present invention; -
Figure 8 is a schematic flowchart showing the main actions performed by the adjacency list calculator, in an embodiment of the present invention; -
Figure 9 is a schematic flowchart showing the main steps of an exemplary scrambling codes assignment method, for assigning scrambling codes to the cells of the network area being planned, based on the adjacency list calculated by the adjacency list calculator; and -
Figure 10 schematically shows an example of best server areas of a group of cells of a network. - Referring to the drawings, in
Figure 1 there is schematically depicted a portion of UMTS network under planning, particularly an UMTS network portion intended to provide cellular mobile communications capability within a given geographic area. - The UMTS network portion under consideration, identified globally by
reference numeral 100, comprises a plurality of cells C1, C2, C3, C4,..., Cn, each one having a relatively limited area coverage (the area coverage of the generic cell depending on several factors such as, for example, the environment wherein the UMTS network is installed, as will be described in greater detail later on). The cells are each one made up of a plurality of pixels, i.e., they are the set of geographic points covered and served by the radio electromagnetic signal irradiated by a respective cell's antenna. - Usually, groups of three to six cells (on average) are managed by a network entity called "Node B", such as the
Node Bs Node B 105a, and that the cell Cn is managed by theNode B 105b). - Groups of Node Bs are managed by a Radio Network Controller (RNC), like the
RNC 110 shown in the drawing; the RNCs are connected to thecore UMTS network 115. - A generic UE, like the
UE 125 depicted as located within the cell C1, can receive signals transmitted by the transmitters, and irradiated by the antennas, of different cells, e.g. the cells C1 and C2, and is able to differentiate among them. - This differentiation of signals coming from different transmitters is made possible by the adoption of the CDMA access technique. Making reference to
Figures 2 and 3 , each transmitter (particularly, the transmitter of the generic network cell) implements a spreading and a subsequent scrambling of the signal to be transmitted. The signal (data) to be transmitted 205, having a given symbol rate (usually called the bit rate) is first submitted to a spreadingprocess 210, using a spreadingcode 215, in order to "widen" its spectrum and distribute (and thus lower) its power over the whole' channel bandwidth. The spreadingcode 215 has a higher number of symbols than the signal to be transmitted 205, thus thespread signal 220 has a symbol rate (a chip rate, in jargon) higher than the bit rate of theinitial signal 205. - The
spread signal 220 is then submitted to ascrambling process 225, using a scrambling code or scramblingsequence 230. The signal scrambling process does not change the chip rate, thus thesignal 235 to be transmitted "over-the-air" has a chip rate equal to that of the spread signal. - The scrambling process is used for making signals transmitted by the transmitters of different cells distinguishable.
- To this purpose, every cell has to use a unique scrambling code, and thus a problem of scrambling code assignment rises.
- As mentioned in the foregoing, in the UMTS standard the set of scrambling codes used in downlink is represented by the Gold codes featuring low self-correlation and cross-correlation. The length of the Gold code for the UMTS system is equal to eighteen bits, thus, in principle, a total of 218 - 1 = 262,143 different codes would be available. However, in order to keep the receiver (particularly, the one on-board the UEs) not too complex, only a fraction of such a vast set of codes is effectively exploited. Specifically, the standard prescribes that the number of usable codes in UMTS networks is 8,192.
- Making reference to
Figure 4 , the pool of 8,192 usable scrambling codes (identified globally by 400 in the drawing) is subdivided into 64 groups, like the group GR1 in the drawing, wherein each of said scrambling codes group, as depicted in the drawing, contains 128 different scrambling codes. - Within the 8,192 different scrambling codes, 512 of them are selected and adopted as "Primary Scrambling Codes" (PSCs) PSC, whereas the remaining scrambling codes are "Secondary Scrambling Codes" (SSCs) SSC. This simplifies the procedures of the search of the scrambling code and cell identification by the UE: in fact, some of the channels (for example, the Common Control Physical CHannel - CCPCH - and the Common PIlot CHannel - CPICH) always use the PSC, whereas other physical channels in downlink may either use the PSC or an SSC.
- By defining the 512 PSCs, the pool of 8,192 different scrambling codes can be viewed as subdivided into 512 sets of 16 scrambling codes each, where one of the sixteen scrambling codes is a PSC, the remaining 15 being SSC.
- Therefore, referring again to
Figure 4 , each group of 128 scrambling codes, like the group GR1, includes eight sets of 16 scrambling codes, and thus eight PSCs (those depicted as shaded squares), with the associated SSCs. - The geographic area represented schematically in
Figure 1 is assumed to be an area of the UMTS network to be planned. Planning the network area means, among other issues, properly assigning PSCs to the different cells of the area under planning. - In the following description, a method for assigning the PSCs to the different network cells of the area under planning will be described.
- Firstly, a list of parameters is provided herein below, with corresponding definitions, that will be referred to in the description of the PSC assigning method; at least some of the parameters defined are better understood making reference to
Figure 5 .Symbol Definition j Index specifying the generic cell C j of the area under planning; (m,n) generic pixel of coordinates m, n in the network area under planning; power level of the channel CPICH (Common Pilot CHannel) of the generic cell Cj at the generic pixel (m, n) Ω j set of pixels (m,n) belonging to the area being planned whereat the CPICH power level generic UE present at the pixel (m,n) belonging to the best server area Ωj of the cell Cj and connected to the cell Cj; NBRj "NeighBoRhood set" (or NBR set) for the cell Cj, i.e. the list of cells which are adjacent to the cell Cj (i.e., cells which have at least one pixel in common with the cell Cj); the adjacency criterion may be a simple geometrical one, i.e., two cells are considered adjacent in case their area of coverage have at least one pixel in common, or take into account electromagnetic field propagation aspects, thereby two cells may be considered adjacent if the signal of one cell is perceived on average in the area of the other cell to an extent exceeding a predetermined statistical threshold; in the following of this description, the term "geometrically adjacent" will be used to denote cells that are considered adjacent based on the criterion adopted in the planning phase for constructing the sets NBR sets; Δ SH maximum admissible difference in the CPICH power level Candidate Set (CS), including all the cells Ck for which Figure 5 , theActive Set (AS), including all the cells, belonging to the area under planning, to which the UE Monitored Set (MS), i.e. the list of cells built by the generic UE by combining the NBR sets in respect of the cells included in the AS PSCj PSC assigned to the cell Cj; ADJ[j] list of cells which are adjoined to the generic cell Cj (according to the criteria described in the following) and which have to be assigned mutually different PSCs; in other words, each cell belonging to ADJ[j] must have a PSC different from that of cell Cj. - It is observed that some of the above listed parameters, like the parameter NBRj , are defined on the basis of merely geometrical considerations during the planning of the network area; other parameters, like the parameters
-
-
- If the above condition is satisfied, it is ensured that the generic UE is able to discriminate among signals coming from different cells in any macrodiversity areas.
- Unfortunately, the monitored set
- The Applicant has found that the requirement expressed in equation (1) above can be satisfied if, for the generic cell Cj of the area under planning, the following criterion is satisfied (equation (2)):
- In particular, the Applicant has found that the set ADJ[j] of adjoined cells for the generic cell Cj should in principle include:
- a) all the cells that are geometrically adjacent to the cell Cj; in symbols:
- b) all the cells that are geometrically adjacent to any cell being in turn geometrically adjacent to the cell Cj; in symbols:
- c) all the cells that are geometrically adjacent to any cell being geometrically adjacent to any cell that is turn adjacent to the cell Cj; in symbols:
- d) all the cells that are geometrically adjacent to any cell being geometrically adjacent to any cell that is geometrically adjacent to any cell being in turn geometrically adjacent to the generic cell Cj; in symbols:
- In particular, case a) means that the set ADJ[j] of adjoined cells for the generic cell Cj includes all the cells listed in the NBR set NBRj for the cell Cj, i.e. all the cells that, based on geometrical considerations, are declared to have at least one pixel in common with the cell Cj, like the cell Ca in
Figure 6A (first-order adjacency). - Case b) means that the set ADJ[j] of adjoined cells for the generic cell Cj further includes all the cells that are listed in the NBR sets of the cells geometrically adjacent to the cell Cj; this is a second-order adjacency condition: two generic cells are defined to be adjacent cells of the second-order if they share at least one adjacent cell, i.e. if there is at least one cell that is adjacent to both the two cells under consideration; it is for example the case of the cell Cb in
Figure 6A . - Case c) means that the set ADJ[j] of adjoined cells for the generic cell Cj further includes all the cells that are listed in the NBR sets of the cells geometrically adjacent to cells that are in turn geometrically adjacent to the cell Cj; this case introduces a third-order adjacency condition. It is for example the case of the cell Cc in
Figure 6B , and of the cells Cc and Ce inFigure 6C . - Case d) means that the set ADJ[j] of adjoined cells for the generic cell Cj further includes all the cells that are listed in the NBR sets of the cells geometrically adjacent to cells that are in turn geometrically adjacent to cells being in turn geometrically adjacent to the cell Cj; this case introduces a fourth-order adjacency condition. It is for example the case of cell Cd in
Figure 6D . - By including in the list ADJ[j] of adjoined cells the first-order adjacent cells, equation (2) above ensures that geometrically adjacent cells will be assigned different PSCs.
- Furthermore, by including in the list ADJ[j] of adjoined cells the second-order adjacent cells, equation (2) above ensures that cells included in the NBR sets of cells geometrically adjacent to any cell geometrically adjacent to the generic cell Cj will be assigned different PSCs.
- By including in the list ADJ[j] of adjoined cells the third-order adjacent cells, equation (2) above ensures that, taken any two geometrically adjacent cells (such as Ca and Cb in
Figure 6B ), the union of their respective NBR sets does not contain cells having same PSC; also, equation (2) ensures that, taken three generic cells being geometrically adjacent two by two (such as Ca, Cb and Cd inFigure 6C ), the union of their NBR sets does not include cells having same PSC. It is observed that the inclusion, in the list ADJ[j] of adjoined cells, of the third-order adjacent cells allows overcoming the problem related to the fact that the composition of the monitored set in the areas of soft-handover is not known a priori. - Furthermore, by the inclusion in the list ADJ[j] of adjoined cells the fourth-order adjacent cells, equation (2) ensures that, considering three cells in soft-handover (such as Ca, Cb and Cc in
Figure 6D ), the union of their three NBR sets does not include cells having same PSC even if two cells (such as Ca and Cc inFigure 6D ) out of the three considered cells assumed in soft-handover have not been declared geometrically adjacent (i.e., they are not included in the respective NBR sets). This allows taking into account worst-case situations wherein an active set includes cells that, erroneously, were not declared mutually geometrically adjacent.
The Applicant has observed that the cardinality DIM[ADJ[j]] of the set ADJ[j] built in the way discussed above, i.e. the number of cells included in the set ADJ[j], at least in non-trivial cases, may be so high that it is not possible to assign the PSCs without violating the requirement expressed by equation (1) above; in other words, the number of available PSCs (512, in the current implementation of the standard) may be not sufficient. - In particular, a significant increase in the dimension of the set ADJ[j] is due to the inclusion of the fourth-order adjacent cells (case d), which however is important for taking into account critical, worst-case situations in which two cells, albeit not declared mutually adjacent, are in the practice, i.e. from an electromagnetic field viewpoint, in macrodiversity. Nevertheless, in normal situations, i.e. when the geometrical adjacency of the cells is correctly declared (i.e., the NBR sets are properly defined), the inclusion in the set ADJ[j] of fourth-order adjacent cells imposes an unnecessary limitation as far as the fulfilment of the condition posed by equation (1) above is concerned. This may be especially penalizing in network scenarios wherein the overall number of cells in the area under planning is significantly higher than the maximum number of available PSCs: in such cases, the cardinality of the set ADJ[j] may easily become too high compared to the number of available PSCs.
- According to an embodiment of the present invention, a method for building an optimized set ADJ[j] of adjoined cells for the generic cell Cj of the area under planning is set forth. In particular, the method according to the invention embodiment to be described allows reducing the dimension of the set ADJ[j], while however ensuring that the use of the set ADJ[j] for the unique assignment of the PSCs guarantees the observance of the condition set forth by equation (1) above, i.e. the soft-handover is correctly managed.
- In particular, the method according to the invention embodiment herein discussed is adapted to build, for the generic cell Cj of the network area under planning, a list ADJ[j] of adjoined cells, including the union of the list of the first-order adjacent cells for the cell Cj, the list of second-order adjacent cells for the cell Cj, the list of the third-order adjacent cells for the cell Cj, and (instead of including the list of the fourth-order adjacent cells) further including a list of cells which are declared "interferentially adjacent" based on a criterion that takes into account the electromagnetic field distribution aspects.
- In particular, in an embodiment of the present invention, the method to be described may be implemented by means of a program executed by a suitable data processing apparatus, such as a general-purpose personal computer or a workstation specifically programmed to execute a program.
- Referring to
Figure 7 , the main functional components of the program implementing the method are schematically depicted. - A
cell scanner module 700 scans the cells of the network area being planned, and receives as input, for each j-th cell Cj of a set of cells C = {C1, C2,..., Cn} belonging to the area being planned, the list NBRj of neighboring cells (i.e., of geometrically adjacent cells) and the best server areas Ωj. - It is observed that the set of cells C = {C1, C2,..., Cn} (with n denoting a positive integer) to which it is necessary to assign the respective PSCs is intended to have been already created; the number n of cells, and their nature, particularly their area coverage, is assumed to have been defined in advance, according to criteria such as the traffic load to be managed, the traffic geographical distribution, the network accessibility target (e.g., indoor, outdoor, "in car",...), the traffic mobility (e.g., the average speed of the users), the area targets to be served, etc.
- The neighboring lists NBRj are passed to a first-order, a second-order and a third-order
adjacency calculator modules - A cells lists
union calculator module 720 receives the lists calculated by the first-order, the second-order and the third-orderadjacency calculator modules - The
cell scanner module 700 also passes the best server area Ωj received in input in respect of the generic cell Cj to apixel scanner module 725, adapted to scan the different pixels (m,n) of the best server area Ωj. It is observed that the best server area Ωj includes, for each pixel (m,n), a list of cells whose irradiated signal is perceived at the pixel (m,n), the cells in said list being ranked according for example to the power level of their CPICH at that pixel (m,n). - A candidate set
builder module 730 determines, for the generic pixel (m,n) of the best server area Ωj of the cell Cj, the respective candidate set -
- An adjacency
coefficients calculator module 737 calculates a plurality of adjacency coefficients, one for each pair of cells in the area under planning, which, as will be described in the following, are indicative of a degree of electromagnetic adjacency of two generic cells. - An adjacency
threshold calculator module 740 is adapted to calculate, for the cell Cj under consideration, an adjacency threshold which is used for discriminating whether another cell belonging to the candidate setscalculator module 745 receives the adjacency threshold and determines the list of cells to be included in the adjoined set ADJ[j] for the cell Cj. The calculated list is passed to the listsunion calculator module 720, which provides in output the list ADJ[j] of the cells adjoined to the cell Cj. - An exemplary procedure for determining the lists ADJ[j] of adjoined cells to the cells of the area under planning will be now described with the help of the schematic flowchart of
Figure 8 . - In particular, the procedure leads to the construction of a square matrix N(s,t), having a number of rows equal to the number n of cells in the area being planned, and of a vector D(u), with a number of elements equal to the number n of cells in the area under planning. The meaning of the elements of the matrix N(s,t) and of the components of the vector D(u) will be explained later on.
- Firstly, the values of the elements of the matrix N(s,t) and of the components of the vector D(u) are reset to zero (block 805).
- An iterative procedure is then performed over all the cells of the area under planning, selecting one cell Cq at a time (block 810, and decision block 815).
- For the generic selected cell Cq, another iterative procedure is performed, scanning all the pixels (m,n) of the respective best server area Ωq (block 820, and decision block 825).
- For the generic pixel (m,n) under processing, it is ascertained whether that pixel belongs to a region of macrodiversity of the best server area Ωq; to this purpose, it is ascertained whether the candidate set
- After having created the list of selected pixels, the elements of the matrix N(s,t) and the components of the vector D(u) are calculated by performing, for each pixel in the list, and for each cell Cq belonging to the area under planning, the following calculations:
- In the above formulas, Teq(m,n) denotes an "equivalent" traffic offered to the pixel (m,n), calculated as:
- δ a,b(m,n) identifies instead a weight, ranging from 0 to 1, which is calculated as:
- In other words, the value of the generic q th component D(q) of the vector D(u) provides a measure of the area wherein the generic cell Cq is potentially in macrodiversity with at least one other cell (i.e., the area of the candidate set of the cell Cq, excluded those pixels wherein the cell Cq is alone in the candidate set), weighted by a weight factor corresponding to the sum of all the (equivalent) offered traffic.
- The value of the generic element N(a,b) of the matrix provides a measure of the portion of the candidate set area of the cell Ca, wherein both the cell Ca and the cell Cb are both in the candidate set; weighted by a weight factor which provides a measure of the (equivalent) offered traffic.
- In this way, the matrix N(s,t) and the vector D(u) are built.
- Then, for each cell Cj in the area under planning (block 845,
decision block 847, and connector J1), the associated list ADJ[j] of adjoined cells is calculated in the following way. - Selected the generic cell Cj in the area under planning (block 845), all the pixels (m,n) in the respective best server area Ωj for which DIM[
- The adjacency coefficient takes values in the range from 0 to 1, because the parameter δ a,b(m,n) is in the range from 0 to 1.
- If, and only if, the adjacency coefficient Ca,b exceeds a predetermined adjacency coefficient threshold ADJ-Th, having value in the range from 0 to 1 (
decision block 875, exit branch Y), the cell Ca is put in a list INTERFb and the cell Cb in a list INTERFa (870). - In parallel (or in sequence) to the operations corresponding to
blocks 855 to 875, first-order, second-order and third-order adjacent cell lists are calculated in respect of the cell Cj by means ofmodules Figure 7 (blocks - After the lists INTERFj and the first-order, second-order and third-order adjacent cell lists for all the cells have been calculated, a further loop is entered (
blocks 890 and 899),in which, for each cell Cj, the lists of the first-order, second-order and third-order adjacent cells, and the list INTERFj calculated as discussed above, are combined, thereby obtaining the adjoined set ADJ[j] in respect of the cell Cj (block 895). In particular, the combination that allows obtaining the adjoined set ADJ[j] is the following: - the adjoined set ADJ[j] is firstly initialized to the void set;
- all the cells defined as adjacent (according to the adjacency criterion adopted for building the NBR sets, as discussed above) to the cell Cj (i.e., the cells Ck, ∀ k ∈ NBRj), listed in the first-order adjacent cells list, are added to the set ADJ[j];
- all the cells included in the second-order adjacent cells list (i.e., the cells Ck, ∀ k ∈ NBRi, ∀i ∈ NBRj) are then added to the set ADJ[j];
- all the cells included in the third-order adjacent cells list (i.e., the cells Ck, ∀ k ∈ NBRi, ∀i ∈ NBRw, ∀w ∈ NBRj) are then added to the set ADJ[j];
- finally, all the cells Ck ∀k ∈ NBRi, ∀i ∈ INTERFw, ∀w ∈ NBRj are added to the set ADJ[j].
- Once the sets ADJ[j] for all the different cells Cj in the area under planning have been built, such sets ADJ[j] are exploited for assigning the scrambling codes to the different network cells of the area under planning.
- In the following, an exemplary and non-limitative method according to an embodiment of the present invention is described, adapted to be used in the UMTS network planning process, for assigning the scrambling codes to the different network cells of the area under planning. Reference will be made to the schematic flowchart of
Figure 9 . - Firstly, the set
- For the generic cell Ck of the set C, the set ADJ[k] of adjoined cells is calculated, according to the method described in the foregoing (block 910).
-
-
- The set C of cells in the area under planning is then sorted based on the cardinality of the adjoined sets ADJ[1], ADJ[2],..., ADJ[n] (block 920). This means that, in the subsequent steps of the method, the cells having a higher number of neighbors are processed first.
- Then, constrains to be respected in the PSC assignment procedure are set (block 925). In particular, the constraints may be such as to prevent the assignment of same PSCs to neighboring cells (this constraint corresponds to the main, primary scrambling code re-use constraint).
- A range [min, max] of usable PSCs is then defined (block 930), within the pool of PSCs (possibly, all the 512 scrambling codes).
- A repetitive procedure is then performed: a loop counter i is initialized to "1" (block 935), and the first cell in the (sorted) set C is selected for being processed (block 940).
- The PSC assignment procedure will try to fulfill the PSC re-use constraint, avoiding to assign a same primary scrambling code to neighboring cells.
-
- ak = 1 if there exist a neighboring cell of the selected cell Ci (i.e., a cell belonging to the set ADJ +[i]) to which a PSC belonging to the group GRk of primary scrambling codes including the PSC PSCk has been assigned; whereas
- ak = 0 otherwise.
- After having built the proper binary vector TAVi, the vector is scanned, starting from the vector component amin that corresponds to the lower PSC in the usable range [min,max], in search of the first encountered binary vector component ak that is equal to "0" (block 950).
- When such a component ak = "0" is encountered (exit branch Y of decision block 955), the corresponding PSC PSCk (together with the associated set of 15 secondary scrambling codes) is assigned to the cell Ci (block 960).
- The loop counter i is increased by one (block 965), and the operation flow jumps back to block 940 (connector J2); a new cell Ci is selected and processed in the way described above, unless all the cells of the set C have already been processed (decision block 970), in which case the procedure ends.
- If on the contrary no component ak = "0" is found (exit branch N of decision block 955), it is decreed that the assignment of scrambling code to the cell Ci is impossible because the basic re-use constraint cannot be satisfied (block 995). The procedure then ends.
- At the end of the procedure, a respective PSC (and the associated SSCs) is assigned to each cell in the area under planning, unless the procedure ended for impossibility of assigning the scrambling codes satisfying the re-use requirement.
- In case of impossibility of assigning to one or more cells the scrambling codes satisfying the re-use requirement, the algorithm may assign to these cells a particular code external to the set of codes previously considered.
- That described above is merely an exemplary PSC assignment method that allows allocating PSCs (in downlink) to the network cells; other PSC assignment methods are obviously possible.
- With reference to
Figure 10 , an example is described hereinafter aimed at exemplifying, in a simple case, the operation of the method according to an embodiment of the invention. - In particular, let it be assumed that, in a generic network area, nine cells A, B, C, D, E, F, G, H and L are present; the areas with different type of shadings and delimited by wider lines represent the best server areas in respect of the nine cells A, B, C, D, E, F, G, H and L.
- Let it also be assumed that the criterion adopted to build the neighboring sets of the cells is a purely geometrical one; in this case, considering the first-order adjacent cells, NBRA = {B, C}, NBRB = {A,C,E}, NBRC = {A,B,F}, NBRD = {G}, NBRE = {B,L}, NBRF = {C,H}, NBRG = {D}, NBRH = {F H}, and NBRL = {E R}. It is observed that the cell D is not adjacent to any one of the cells A, B and C.
- Let three pixels p1, p2 and p3 in the best server area of the cell A be considered; let it be assumed that the candidate set of the pixel p1 include the cells A and B, the candidate set of the pixel p2 includes the cells A, B and C, and the candidate set of the pixel p3 includes the cells A, B, C and D; thus, even if the cell D has not been declared adjacent to the cell A, its signal can be received in the pixel p3. In the drawing, the order, from top to bottom, of the cells listed in the candidate set of the generic one of the three pixels considered reflects the (decreasing) order of the power level of the respective CPICH as received in that pixel.
- In this example, according to the method described above, the following operations are performed for the determination of the set INTERFj in respect of the generic cell Cj, and limitedly for simplicity to the three considered pixels p1, p2 and p3.
-
- Let it be assumed, for the sake of simplicity, that Teq(m,n) = 1 for every pixel p1, p2 and p3.
- Let it also be assumed, for the sake of simplicity, that the three pixels p1, p2 and p3 are the only pixels, in the best-server area (calculated on the basis of the CPICH power level) of the cell A, having a candidate set including more than one (i.e., the beset server) cell. The calculation gives:
- Pixel p1:
- Pixel p2:
- Pixel p3:
-
- Assuming that the adjacency coefficient threshold ADJ-Thr is set to 0, the sets INTERFA, INTERFB, INTERFC for the three cells A, B and C after the analysis of the pixels belonging to the best server area of the cell A are:
- INTERFA = {B,C,D}
- INTERFB = {A,C,D}
- INTERFC = {A,B,D}
- The sets of the first-order, second-order and third-order adjacent cells (which only depend on the construction of the neighboring sets NBRj of the various cells) are the following:
- NBR_FIRST_ORDERA = NBRA = {B,C}
- NBR_FIRST_ORDERB = NBRB = {A,C,E}
- NBR_FIRST_ORDERC = NBRC = {A,B,F}
- NBR_SECOND_ORDERA = NBRA* NBRA = {B,C,E,F}
- NBR_SECOND_ORDERB = NBRB* NBRB = {A,C,E,L}
- NBR_SECOND_ORDERC = NBRC* NBRC = {A,B,F,H}
- NBR_THIRD_ORDERA = NBRA* NBRA* NBRA = {B,C,E,F,H,L}
- NBR_THIRDD_ORDERB = NBRB* NBRB* NBRB = {A,C,E,L,F}
- NBR_THIRD_ORDERC = NBRC* NBRC* NBRC = {A,B,F,E,H}
- It can be observed that, in general, the set of cells which are adjacent of the (N+1) order to a generic cell include the cells which are adj acent of the N order to that cell.
- For the three cells A, B and C considered in this example, it is:
- ADJ[A]=NBR_THIRD_ORDERA + NBRA*INTERFA*NBRA = {B,C,E,F,H,L,D}
- ADJ[B]=NBR_THIRD_ORDERB + NBRB*INTERFB*NBRB = {A,C,E,L,F,D}
- ADJ[C]=NBR_THIRD_ORDERA + NBRC*INTERFC*NBRC = {A,B,F,E,H,D}
- Thus, it can be seen that by taking into account, in the construction of the sets ADJ[j], of the "interferentially adjacent" cells, i.e., the' cells belonging to the sets INTERFj built in the way described, the cell D has been included in the sets ADJ[A], ADJ[B], ADJ[C]. This_is very important, because in at least one pixel (the pixel p3) of the best server area of the cells A, the generic mobile terminal may receive the signal of the cell D; not including the cell D in the sets ADJ[A], ADJ[B], ADJ[C] , on which basis the PSCs are assigned to the different cells, might cause the cell D to be assigned a same PSC as the cells A, B, C, with a consequent malfunctioning of the system, and possible call drops.
- The present invention, an embodiment of which has been described in the foregoing, provides a method by which it is possible to determine, for the generic cell of a network area under planning, a set of neighborhood relationships with other cells such that using the thus determined set of neighborhood relationships for uniquely assigning PSCs, it is ensured that the soft-handover conditions are properly managed, because cells that will possibly be in macrodiversity with other cells are properly identified, so they can be assigned a unique PSC.
Claims (5)
- A method for assigning scrambling codes in a CDMA cellular radio communications network comprising a plurality of network cells covering a geographic area, including:determining, for each given cell (Cj) of said plurality of network cells, a respective set of adjacent cells (ADJ[j]), wherein the step of determining includes:wherein two cells are considered neighbors in case the respective coverage areas at least partially overlap;- taking a first set of cells that are neighbors of the given cell;- taking a second set of cells that are neighbors of neighbors of the given cell;- taking a third set of cells that are neighbors of neighbors of neighbors of the given cell,- taking a fourth set of cells selected from a candidate set of cells that includes cells which, in at least one point of the geographic area where the given cell produces a signal power, produce respective signal powers that differ from said signal power produced by the given cell of less than a predetermined threshold; and- combining the first, second, third and fourth set of cells; andassigning to each cell of the set of adjacent cells a scrambling code different from a scrambling code assigned to the given cell,
wherein
said taking a fourth set of cells includes calculating a mutual difference in respective signal powers of each pair of cells belonging to the candidate set of cells,
and
further comprising:- calculating a weight factor (δ) from the calculated mutual difference;- calculating a cumulative weight factor for said each pair of cells by adding the weight factor for all the points of the geographic area in which the cells of said pair belong to the candidate set;- calculating a number of points of the geographic area in which a cardinality of the candidate set is greater than 1;- calculating an adjacency coefficient by normalizing said cumulated weight factor by the calculated number of points;in which the selection of the fourth set of cells from the candidate set is made by:- setting a predetermined adjacency threshold; and- selecting those cells of the candidate set for which the respective adjacency coefficient exceeds that adjacency threshold. - The method according to claim 1, in which said calculating the cumulative weight factor includes taking into account an indication of traffic offered to said all the points of the geographic area in which the cells of said pair belong to the candidate set.
- A data processing system for assigning scrambling codes in a CDMA cellular radio communications network comprising a plurality of network cells covering a geographic area, including means adapted for:determining, for each given cell (Cj) of said plurality of network cells, a respective set of adjacent cells (ADJ[j]), said set of adjacent cells (ADJ[j]) including:wherein two cells are considered neighbors in case the respective coverage areas at least partially overlap; and- a first set of cells that are neighbors of the given cell;- a second set of cells that are neighbors of neighbors of the given cell;- a third set of cells that are neighbors of neighbors of neighbors of the given cell,- a fourth set of cells selected from a candidate set of cells which, in at least one point of the geographic area where the given cell produces a signal power, produce respective signal powers that differ from said signal power produced by the given cell of less than a predetermined threshold,wherein said means is adapted for determining said fourth set of cells by:- calculating a mutual difference in respective signal powers of each pair of cells belonging to the candidate set of cells,- calculating a weight factor (δ) from the calculated mutual difference;- calculating a cumulative weight factor for said each pair of cells by adding the weight factor for all the points of the geographic area in which the cells of said pair belong to the candidate set;- calculating a number of points of the geographic area in which a cardinality of the candidate set is greater than 1;- calculating an adjacency coefficient by normalizing said cumulated weight factor by the calculated number of points;said means is further adapted for selecting the fourth set of cells from the candidate set by:- setting a predelermined adjacency threshold; and- _selecting those cells of the candidate set for which the respective adjacency coefficient exceeds that adjacency threshold;said means is further adapted for assigning to each cell of the set of adjacent cells a scrambling code different from a scrambling code assigned to the given cell.
- A computer program comprising instructions for carrying out all the steps of the method according to any one of the claims 1, 2 when said computer program is executed on a computer system.
- A computer program product comprising a computer readable medium embodying a computer program according to claim 4.
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
PCT/EP2005/008207 WO2007016933A1 (en) | 2005-07-28 | 2005-07-28 | Method for the assignment of scrambling codes to cells of a cdma cellular mobile communications network |
Publications (2)
Publication Number | Publication Date |
---|---|
EP1915880A1 EP1915880A1 (en) | 2008-04-30 |
EP1915880B1 true EP1915880B1 (en) | 2010-03-03 |
Family
ID=36061634
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
EP05766927A Not-in-force EP1915880B1 (en) | 2005-07-28 | 2005-07-28 | Method for the assignment of scrambling codes to cells of a CDMA cellular mobile communications network |
Country Status (6)
Country | Link |
---|---|
US (1) | US8014362B2 (en) |
EP (1) | EP1915880B1 (en) |
AT (1) | ATE460060T1 (en) |
BR (1) | BRPI0520478B1 (en) |
DE (1) | DE602005019796D1 (en) |
WO (1) | WO2007016933A1 (en) |
Families Citing this family (17)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20080101301A1 (en) * | 2006-10-27 | 2008-05-01 | Motorola, Inc. | Handover in a cellular communication system |
GB2458418B (en) | 2006-12-19 | 2011-08-03 | Lg Electronics Inc | Sequence generating method for efficient detection and method for transmitting and receiving signals using the same |
CN101287267B (en) * | 2007-04-10 | 2012-05-23 | 中兴通讯股份有限公司 | Method for distributing codewords among cells |
KR100938756B1 (en) * | 2007-07-06 | 2010-01-26 | 엘지전자 주식회사 | Method for performing cell search procedure in wireless communication system |
US8493919B2 (en) * | 2007-09-21 | 2013-07-23 | Qualcomm Incorporated | Interference mitigation in a wireless communication system |
US8503547B2 (en) * | 2007-10-11 | 2013-08-06 | Qualcomm Incorporated | Scrambling codes for secondary synchronization codes in wireless communication systems |
US8406146B2 (en) * | 2007-12-21 | 2013-03-26 | Telefonaktiebolaget Lm Ericsson (Publ) | Scrambling code allocation in a cellular communication network |
EP2109240B1 (en) * | 2008-04-10 | 2012-07-11 | TELEFONAKTIEBOLAGET LM ERICSSON (publ) | Activation of code multiplexing |
US8654623B2 (en) | 2008-06-25 | 2014-02-18 | Qualcomm Incorporated | Scrambling under an extended physical-layer cell identity space |
WO2012078102A1 (en) * | 2010-12-07 | 2012-06-14 | Telefonaktiebolaget L M Ericsson (Publ) | Arrangement and method of radio base station and radio units |
CN102013936A (en) * | 2010-12-10 | 2011-04-13 | 上海百林通信软件有限公司 | Method for code assignment in code division multiple access (CDMA) network optimization |
US8717887B2 (en) * | 2011-08-08 | 2014-05-06 | Telefonaktiebolaget Lm Ericsson (Publ) | Scrambling code planning device and method for using same in wireless communication network |
US8737375B2 (en) * | 2012-07-25 | 2014-05-27 | At&T Mobility Ii Llc | Code planning for wireless communications |
US8565771B1 (en) | 2012-08-23 | 2013-10-22 | At&T Mobility Ii Llc | Handover relation identification utilizing network events |
US9288716B2 (en) | 2012-11-30 | 2016-03-15 | At&T Mobility Ii Llc | Resource management in a wireless communications network |
US10834608B1 (en) | 2019-07-16 | 2020-11-10 | At&T Intellectual Property I, L.P. | Facilitating model-driven automated cell allocation in fifth generation (5G) or other advanced networks |
US11832294B2 (en) | 2021-12-02 | 2023-11-28 | At&T Intellectual Property I, L.P. | Facilitating assignment of root sequence indexes while minimizing network changes |
Family Cites Families (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6618432B1 (en) * | 1997-12-11 | 2003-09-09 | Verizon Laboratories Inc. | Systems and methods for minimizing interference and optimizing PN planning in CDMA networks |
US6058136A (en) * | 1997-12-11 | 2000-05-02 | Gte Laboratories Incorporated | System and method for PN offset index planning in a digital CDMA cellular network |
US6684075B2 (en) * | 1998-04-16 | 2004-01-27 | Telefonaktiebolaget Lm Ericsson (Publ) | Multiple frequency reallocations in an automated frequency allocation environment |
US6985735B2 (en) * | 2001-09-10 | 2006-01-10 | Koninklijke Kpn N.V. | Method and system for planning and evaluation of CDMA radio networks |
US7280467B2 (en) * | 2003-01-07 | 2007-10-09 | Qualcomm Incorporated | Pilot transmission schemes for wireless multi-carrier communication systems |
-
2005
- 2005-07-28 DE DE602005019796T patent/DE602005019796D1/en active Active
- 2005-07-28 BR BRPI0520478A patent/BRPI0520478B1/en not_active IP Right Cessation
- 2005-07-28 US US11/989,386 patent/US8014362B2/en not_active Expired - Fee Related
- 2005-07-28 WO PCT/EP2005/008207 patent/WO2007016933A1/en active Application Filing
- 2005-07-28 EP EP05766927A patent/EP1915880B1/en not_active Not-in-force
- 2005-07-28 AT AT05766927T patent/ATE460060T1/en not_active IP Right Cessation
Also Published As
Publication number | Publication date |
---|---|
BRPI0520478B1 (en) | 2018-11-06 |
ATE460060T1 (en) | 2010-03-15 |
DE602005019796D1 (en) | 2010-04-15 |
EP1915880A1 (en) | 2008-04-30 |
BRPI0520478A2 (en) | 2009-09-29 |
WO2007016933A1 (en) | 2007-02-15 |
US8014362B2 (en) | 2011-09-06 |
US20090073939A1 (en) | 2009-03-19 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
EP1915880B1 (en) | Method for the assignment of scrambling codes to cells of a CDMA cellular mobile communications network | |
US6487414B1 (en) | System and method for frequency planning in wireless communication networks | |
US5878328A (en) | Method and apparatus for wireless communication system organization | |
US5455821A (en) | Communication system resource allocation method | |
CN1328926C (en) | Method and appts. for orthogonal code management in CDMA systems using smart antenna tech background | |
CN100380992C (en) | Interference reduction in a time division duplex communication system using code division multiple access | |
US6498934B1 (en) | Channel allocation using enhanced pathloss estimates | |
US6411819B1 (en) | Method of modeling a neighbor list for a mobile unit in a CDMA cellular telephone system | |
EP1825704B1 (en) | Method for assigning scrambling codes in a cdma cellular mobile communications network | |
US20060142015A1 (en) | Methods and techniques in channel assignment in a cellular network | |
WO2001045284A1 (en) | Systems and methods for rapidly determining cdma network performance | |
JPH1042338A (en) | Method for deciding organization parameter in radio communication system | |
CN102404752A (en) | Frequency planning method in GSM network | |
CN1312957C (en) | Method and appts. for setting pilot signal transmit powers | |
US6618432B1 (en) | Systems and methods for minimizing interference and optimizing PN planning in CDMA networks | |
EP0964596A2 (en) | Method of assigning frequency using propagation loss | |
US7486636B2 (en) | Method, system and computer program for planning a telecommunications network | |
CN101141775A (en) | Pilot pollution optimization method based on road test data | |
US6490442B1 (en) | Pro-active estimation of interference signal ratio in a radiocommunication cellular network | |
KR100583735B1 (en) | Method for optimizing neighbor list | |
Yang et al. | Downlink soft handover gain in CDMA cellular network with cross-correlated shadowing | |
Jamaa et al. | Manual and automatic design for UMTS networks | |
EP1189468B1 (en) | A method of modelling a neighbor list for a mobile unit in a CDMA cellular telephone system | |
JP2004187294A (en) | Method of creating cell neighbor list in cellular communication system | |
WO2002045450A1 (en) | A method for determining neighboring cells in a communication network |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PUAI | Public reference made under article 153(3) epc to a published international application that has entered the european phase |
Free format text: ORIGINAL CODE: 0009012 |
|
17P | Request for examination filed |
Effective date: 20080212 |
|
AK | Designated contracting states |
Kind code of ref document: A1 Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IS IT LI LT LU LV MC NL PL PT RO SE SI SK TR |
|
17Q | First examination report despatched |
Effective date: 20080505 |
|
GRAP | Despatch of communication of intention to grant a patent |
Free format text: ORIGINAL CODE: EPIDOSNIGR1 |
|
RIC1 | Information provided on ipc code assigned before grant |
Ipc: H04W 16/02 20090101AFI20091026BHEP |
|
RTI1 | Title (correction) |
Free format text: METHOD FOR THE ASSIGNMENT OF SCRAMBLING CODES TO CELLS OF A CDMA CELLULAR MOBILE COMMUNICATIONS NETWORK |
|
GRAS | Grant fee paid |
Free format text: ORIGINAL CODE: EPIDOSNIGR3 |
|
GRAA | (expected) grant |
Free format text: ORIGINAL CODE: 0009210 |
|
AK | Designated contracting states |
Kind code of ref document: B1 Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IS IT LI LT LU LV MC NL PL PT RO SE SI SK TR |
|
REG | Reference to a national code |
Ref country code: GB Ref legal event code: FG4D |
|
REG | Reference to a national code |
Ref country code: CH Ref legal event code: EP |
|
REG | Reference to a national code |
Ref country code: IE Ref legal event code: FG4D |
|
REF | Corresponds to: |
Ref document number: 602005019796 Country of ref document: DE Date of ref document: 20100415 Kind code of ref document: P |
|
REG | Reference to a national code |
Ref country code: NL Ref legal event code: VDEP Effective date: 20100303 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: LT Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20100303 |
|
LTIE | Lt: invalidation of european patent or patent extension |
Effective date: 20100303 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: FI Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20100303 Ref country code: AT Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20100303 Ref country code: PL Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20100303 Ref country code: SI Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20100303 Ref country code: LV Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20100303 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: SE Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20100303 Ref country code: CY Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20100303 Ref country code: RO Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20100303 Ref country code: NL Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20100303 Ref country code: GR Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20100604 Ref country code: BE Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20100303 Ref country code: EE Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20100303 Ref country code: ES Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20100614 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: CZ Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20100303 Ref country code: BG Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20100603 Ref country code: SK Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20100303 Ref country code: IS Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20100703 |
|
PLBE | No opposition filed within time limit |
Free format text: ORIGINAL CODE: 0009261 |
|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: DK Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20100303 Ref country code: PT Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20100705 |
|
26N | No opposition filed |
Effective date: 20101206 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: MC Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20100731 |
|
REG | Reference to a national code |
Ref country code: CH Ref legal event code: PL |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: CH Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20100731 Ref country code: LI Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20100731 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: IE Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20100728 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: LU Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20100728 Ref country code: HU Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20100904 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: TR Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20100303 |
|
REG | Reference to a national code |
Ref country code: FR Ref legal event code: PLFP Year of fee payment: 12 |
|
REG | Reference to a national code |
Ref country code: FR Ref legal event code: PLFP Year of fee payment: 13 |
|
REG | Reference to a national code |
Ref country code: FR Ref legal event code: PLFP Year of fee payment: 14 |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: FR Payment date: 20190725 Year of fee payment: 15 Ref country code: IT Payment date: 20190726 Year of fee payment: 15 Ref country code: DE Payment date: 20190729 Year of fee payment: 15 |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: GB Payment date: 20190729 Year of fee payment: 15 |
|
REG | Reference to a national code |
Ref country code: DE Ref legal event code: R119 Ref document number: 602005019796 Country of ref document: DE |
|
GBPC | Gb: european patent ceased through non-payment of renewal fee |
Effective date: 20200728 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: GB Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20200728 Ref country code: FR Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20200731 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: DE Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20210202 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: IT Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20200728 |