METHOD FOR RESOURCE ALLOCATION IN A RADIO SYSTEM

Abstract: The present invention relates to a method for resource allocation in a radio system comprising base stations with respective coverage areas and mobile units. The interaction between the stations in the system is defined with the aid of measured and/or calculated field strengths from all base stations on relevant traffic routes in the geographic area of the radio system, preferably in the form of an exclusion matrix. An allocating matrix is formed by compressing the exclusion matrix by means of an allocating algorithm. The algorithm utilizes figures of merit which are on the one hand calculated by mathematical/logical means to form possible combinations of stations and utilizes on the other hand a random technique for selecting one of these combinations. The algorithm is iterated a number of times and different allocations are obtained thanks to the random technique. The best one of the allocations from any point of view is selected.

Description: TITLE OF THE INVENTION: METHOD FOR RESOURCE ALLOCATION IN A RADIO SYSTEM FIELD OF THE INVENTION The present invention relates to a method for resource allocation in a radio system. Radio systems can be one-way with communication in only one direction, for example paging system, or two-way, for example mobile radio system. In the application, a mobile radio system is preferably dealt with, but it is understood that the invention is equally well applicable to one-way systems. It is important in a mobile radio system that accessible frequency resources are used in such a manner that the system capacity is optimized with the condition that the customers experience an acceptable quality. In a micro- cell system in a densely populated area it is desirable that the channel allocation can be tailored to the current traffic distribution. Such planning is a very demanding task and there are great gains to be made if the system operator has full control over the inherent interferences in the system. Improved quality and traffic handling in a given frequency band is also equivalent to an increased frequency economy. The following preconditions are given: a dis¬ tribution of the traffic requirement over, for example, Stockholm, system parameters which define which C/I (carrier to interference) interference characteristic is required for good reception and how much interference the receiver tolerates in adjoining channels, and a frequency band of the system with a limited number of channels. It is the object to distribute the channels to the different base stations in the given frequency range so that the quality of the connection experienced by the customers meets given minimum requirements. STATE OF THE ART The literature on the subject supplies informa¬ tion on how the problem is solved in principle. The method is as follows: a systematic description is given of all restrictions which apply to channel allocation in the form of a so-called exclusion matrix. An exclusion matrix produces a description in symbolic form of how different base stations, alternatively mobiles in dif¬ ferent coverage areas, can be shared with respect to co- channel and adjacent-channel conditions. Allocating algorithms are then used for finding exactly which channels the different base stations must have for the minimum requirement for connection quality to be met. The exclusion matrix in turn enables an alloca¬ ting program to be driven and channel allocations are obtained for a situation with very well known and desired interference characteristics which ensure a good connec- tion quality. Much is written in the literature about algo¬ rithms for frequency allocation (channel allocation) for telecommunication systems of different types. For example, William K. Hale mentions the following procedure which, simplified, consists of the following steps: 1. To define the current situation with a number of transmitters and their coverage area. 2. To number these transmitters. 3. To define in matrix form the relevant interaction between each transmitter and the coverage area of the other transmitters. 4. To carry out algebraic operations on rows in the matrix according to a predetermined scheme. In the same paper, this scheme constitutes the allocating algorithm. 5. The algorithm results in a changed matrix from which a channel allocation can be read out. This procedure is deterministic which means that each time the algorithm is run through exactly the same allocation is obtained for one and the same constellation of transmitters. In an article by Andreas Gamst "A resource allocation technique for FDMA systems" published in Alta Frequenza, Vol. LVII-N.2 February-March 1988, a technique for resource allocation in a mobile radio system is described. The channel requirement and exclu¬ sion matrix is obtained by means of a data program (GRAND) which utilizes topographic data, predictions for wave propagation and a statistical model for station hand-over. For a cellular system, the lower limit for the requirement of the number of frequency channels is calculated. A heuristic allocating algorithm which provides a frequency allocation plan is iterated and the number of frequencies calculated for each frequency plan. The allocating algorithm includes a random control and the number of frequencies therefore does not become the same with each iteration. If the number of frequencies in a frequency plan is less than or equal to the calculated lower limit for the frequency requirement, an acceptable frequency plan has been found and the iterations are concluded. BRIEF SUMMARY OF THE INVENTION The present invention offers a new and improved allocating algorithm which on. the one hand utilizes figures of merit calculated in a mathematical/logical way for forming possible combinations of stations and on the other hand utilizes a random technique for the selection of one of these combinations. The invention is specified in greater detail in the subsequent patent claims. BRIEF DESCRIPTION OF THE DRAWINGS The invention will now be described in greater detail with reference to the attached drawings, wherein Figure 1 illustrates how a mobile station is exposed to interference from an adjoining base station, Figure 2 illustrates how a base is exposed to interference from a mobile station in the adjoining area. Figures 3a and 3b are examples of cross-inter¬ ference matrices. Figures 4a and 4b illustrate the exclusion matrices associated with the cross-interference matrices in Figures 3a and 3b, the matrix in Figure 4b being a symmetrized downlinking matrix. Figure 5 illustrates an uplinking matrix. Figure 6 illustrates an exclusion matrix belonging to the matrices in Figures 4b and 5, Figure 7 is a list of base stations with unallo¬ cated channels. Figure 8 is an example of an exclusion matrix, Figure 9 is an example of an allocating matrix. Figure 10 is the allocating matrix according to Figure 9 in table form. Figure 11 is a table of random indication of compatible rows with the allocating algorithm according to the invention. Figure 12 is yet another example of an allocating matrix with a further degree of interference, and Figures 13-15 are examples of plots of different interference situations. DETAILED DESCRIPTION OF PREFERRED EMBODIMENTS OF THE INVENTION It is the object of the invention to effect resource allocation in a radio system. The prerequisites are that there are a number of base stations each with its own coverage area and a frequency band for the system with a limited number of channels. There is also a requirement for the type of C/I interference charac¬ teristic which is needed for good reception and how much interference the receiver tolerates in adjoining channels. The field strengths are measured along the relevant routes in the respective coverage areas. From the measured values the cross-interference matrices are calculated which indicate the interference characteristic between transmitters by means of numeric values. From the cross-interference matrices is calculated an exclusion matrix which indicates in symbolic form the interference characteristics between transmitters, and especially base stations. The channel allocation is carried out with the aid of the exclusion matrix. Using a specially calibrated receiver equipment, the received power from all base stations is measured on the relevant traffic routes in the geographic area which is covered by the mobile radio system. For these measure¬ ments, the measured field strengths provide mean values over sections of 20 m (approximately 30 wavelengths) and each section is tied to a coordinate designation. The field strength values are represented in the measured material of the received signal power in dBm. The measurements are not as comprehensive as they could be since, in the same process, field strengths can be regis¬ tered for up to 12 base stations at a time. It is quite possible to make all necessary measurements for a cell including coverage and interference range in one night. This type of measurement has already been successfully performed in the Stockholm area. The measurements provide knowledge about what potential power a receiver in a mobile set will receive from different cells whilst the mobile is located in the geographic area. It is also easy to calculate the poten¬ tially received power at an arbitrary base station originating from mobile stations within the coverage area. Consequently the interference situation both for mobile stations and base stations is known. Thus the exclusion matrix provides a systematic description in symbolic form of how different base stations or alternatively mobile stations in different coverage areas can be shared with respect to co-channel and adjacent-channel conditions. The appearance of the matrix is based on which limit values are set for interference and coverage. It is important to understand that an exclusion matrix cer¬ tainly contains information on how the channels can be arranged, but in spite of this is not a quantity which is based on frequency but only describes the relations between field strengths in the space. Since the interferences can be described on the one hand with reference to the base station receivers and on the other hand with reference to the receiver of the mobile units there is both an uplinking matrix and a downlinking matrix. (Naturally only the downlinking matrix is used in paging systems.) If it were so in practice that different channel allocations could be used for uplinking and downlinking, each of these matrices could be directly used separately for constructing these allocations after symmetrization. However, it is intended to use the same allocation in both directions which implies that the allocating algorithms are applied to the union of these matrices. The downlinking situation is shown in Figure 1. Assuming that all the base stations together with the corresponding service areas are numbered from 1 to N. Figure 1 shows two stations i and j with the associated service areas. A mobile station M in the i-th coverage area receives a desired power Pi from its own base station and an unwanted interference power Pj from base station number j. There is a small difference between the term "service area" and "coverage area". Coverage area here means all measured paths which, with respect to a given base station, have a sufficiently high received power to allow satisfactory reception. In the service area there can be points which have not been measured to have good reception. The minimum allowable C/I (carrier to inter¬ ference) noise ratio for acceptable co-channel quality is LP1 and the minimum allowable C/I for acceptable quality for interference in the first adjacent channel is LP2 and so forth. For adjacent channel (k-l):a, C/I must be greater than LPk, k ≤ M. The noise figure p is defined as the fraction of the coverage area for which it holds true that Pi/pj < LPk k ~ 1, 2, ... M M constitutes the number of necessary co-channel and adjacent-channel limit values. The element Pij in a general N-th order cross-interference matrix is given by the relation Pii (LPk) = P The diagonal elements are set to zero, that is to say Pij (LPk) = 0 for all i and k. This cross-interference matrix P refers to the downlinking situation and describes which degree of interference the mobile stations are subject to with respect to the transmitting base stations. Figure 2 illustrates the uplinking situation. The figure shows two base stations i and j with associated service areas. In this case the base station i is exposed to interference Qj from a mobile station Mj in the coverage area of base station j. The base station i receives a wanted power Qi from a mobile station Mi in its coverage area. The coverage areas are defined in the same way as before or possibly adjusted for any imbalance in the power budgets for uplinking and downlinking. When the mobile station Mj is assumed to pass through the entire coverage area of base j, an inter¬ ference power is generated in the base station i. The interference power at the base station i which falls below y% of the coverage area in j is designated by Qjy. Suitable values of y can be 50 or 90. The minimum allow¬ able C/I noise ratio for an acceptable co-channel quality is designated by LQ1 and the minimum C/I for an accep- table quality for the first adjacent channel is desig¬ nated by LQ2 and so forth. For the adjacent channel (k- l):a, C/I must be greater than LQk, k ≤ M in the same way as before. The noise figure q is defined as the fraction of the coverage area of base i for which it holds true that Qi/Qjy < LQk A general N-th order exclusion matrix is defined by the relation Qij (LQk) = q The diagonal elements are set to zero in the same way as before, that is to say Qii (LQk) = 0 for all i and k. In this way, a cross-interference matrix for each k = 1, 2 ... M is shown. This cross-interference matrix Q relates to the uplinking situation and describes which degree of interference the receivers in the base stations are subject to with respect to transmitting mobile stations. Alternatively, the uplinking matrix can be calculated in the following way. When the mobile station Mj in Figure 2 passes through the entire coverage area of base j, a noise power is generated in base i. The noise power varies with the instantaneous position of the interfering mobile station and its different noise power results can be characterized statistically by means of a distribution function. a) The distribution function is calculated with a starting point from measured field strength values. The interference values are generated by performing a ran¬ domization according to the said distribution which can be implemented, for example, by allowing all interference results to be represented in table form and uniformly pointing out all numerical values in the table. Assuming that a mobile station Mi passes through the coverage area i and in doing so experiences the cove¬ rage field strength Qi and a randomized interference field strength Qj at a given point in the coverage area. The noise figure q (q being the element Qij (Lgk) in the cross-interference matrix for uplinking) is defined as the fraction of the coverage area of base i for which it holds true that Qi/Qj < LQk. Due to the fact that the interference field strength Qj is randomized, the ratio Qi/Qj is made a stochastic variable. The consequence is that q is also a stochastic variable which assumes new values each time the calculation is carried out. It is found in practice that the q values calculated in this way are assembled well around their mean value and that an individual result can be considered as representative. If it is not considered satisfactory, there is always the possibility of estimating the mean value of q by simulating the effect of the interfering mobile station several times in the way described above. b) The distribution function is approximated by means of a logarithmically normal distribution. It is well known in the literature that interference field strengths originating from mobile stations situated at _ _ the same distance from the base have an almost logarithmically normal distribution. This applies also with good approximation to interference field strengths at a base from mobile stations in an adjoining coverage area. The log-normal distribution is completely deter¬ mined by the mean value and spread, which parameters can be easily calculated from the given measured interference field strengths. Compared with case a), it is thus not the distribution function which is calculated but only the mean value and spread for the true distribution of interference values. The true distribution is further approximated with a logarithmically normal distribution. The median for the true logarithmated interference field strengths can be very well used as mean value in the log- normal distribution. The simulated interference powers are generated with the aid of a generator for normally distributed numerical values and with knowledge of the mean value and spread as above. The elements Qij (LQk) in the cross-interference matrix are calculated analogously to what has been said in a) above. The power values Q in the base stations from the transmitting mobile stations are directly relateable to the power values P from the transmitting base stations due to the fact that the transmission losses between base and mobile station do not depend on the transmitting direction. Since the P-value is only obtained by measu¬ ring wave propagation data, this also applies to Q values. To calculate the frequency compatibility, each coverage area must be studied with respect to all the other coverage areas. This must be done for all the threshold values corresponding to co-channel interference or adjacent-channel interference. It implies that all elements in all relevant cross-interference matrices must be calculated. Whilst processing measurement data, it is generally unavoidable to calculate all elements in the downlinking and uplinking matrices for the cross-inter¬ ferences with respect to at least the co-channel case and the case of noise in the first adjacent channel, that is to say two cross-interference matrices must be calculated for downlinking and two for uplinking. To make an allocation program which operates with cross-interference matrices as starting point works well but it is easier to edit and make changes in the matrices, which is necessary if the matrices are to be used in practice, if they have a simpler form with not so fully detailed information. This is the reason for going over to a simplified representation which is here called exclusion matrix. In the matrix a distinction is made between at least three different degrees of interference which are usually designated, X or A in ascending degrees of difficulty. The symbol "." designates an interference which is negligible. The diagonal has elements which are usually designated by 0 and which indicate which base station the row or column in the matrix relates to, for example 0 in row number j means that all interferences relate to the coverage area of base station number j. From the cross-interferences for downlinking with the elements Pij (LPk), for example, the corresponding exclusion matrix can be formed in the following way: Assuming that the limit values for the same co- channel and the first adjacent channel are the only relevant ones, which implies that there are two cross- interference matrices Pij (LP1) and Pij (LP2). If the exclusion matrix is designated uij and the limit value of the degree of interference is px in both cases, the matrix elements uij are obtained in the following way uij - "0"; i = j uij «= "A"; Pij (LP2) > px uij - "X"; Pij (LP1) > px uij « "."; Pij (LP1) < px The matrix elements vij in the uplinking matrix are formed in corresponding manner by using the cross- interference matrices Qij (LQ2) and Qij (LQ1) and cor¬ responding limit values for the degree of interference py- Figure 3a shows an example of a cross-inter¬ ference matrix Pij (LP2) and Figure 3b shows a cross- interference matrix Pij (LP1) . It holds true that Pij (LP2) < Pij (LP1); for the rest, there is no connection between the matrices, neither are the matrices symmetric. By using the above methods, an exclusion matrix can be calculated from the cross-interference matrices in Figures 3a and 3b for px = 0.05. The exclusion matrix is shown in Figure 4a. The symbols ".", "X" and "A" cor- respond to interferences of increasing degree of dif¬ ficulty. An interference corresponding to "." can be accepted as a co-channel interference. The symbol "0" indicates the coverage area to which the interferences in the same column relate. The matrix according to Figure 4a can be interpreted as follows. A mobile station with coverage from base station 1 cannot share a channel for reception with a mobile station in coverage areas 2 and 4. However, it can share a channel with a mobile station in coverage area 3. It cannot use an adjacent channel to a channel used by a mobile station in coverage area 4. On the other hand, a mobile station with coverage from base station 2 can share a channel for reception with a mobile station in coverage area 1. A mobile station in coverage area 2 is thus hot exposed to interferences from base station 1 but a mobile station in coverage area 1 is exposed to interferences from base station 2. Naturally, this implies in practice that the base stations 1 and 2 cannot use the same transmitting frequency. The con¬ sequence is that only symmetrical exclusion matrices have any practical value. The exclusion matrix is therefore symmetrized by allowing matrix elements which represent the stronger degree of disturbance to be applicable. If the matrix in Figure 4a is symmetrized, the matrix in Figure 4b is obtained which in this case represents the downlinking matrix. An example of an uplinking matrix is given in Figure 5. According to this matrix, the base station 1 cannot share a channel with base stations 2, 3 and 4 nor can it have an adjacent channel to base station 4 in receiving mode. Base station 2 is exposed to negligible interference from mobile stations in the coverage areas of base station 3 and 4 and can therefore share a channel with these base stations, and so forth. As mentioned earlier, it is desirable to make the same channel allocations in the uplinking and downlinking directions. To produce a matrix which can be used for forming the same allocation in both directions, the union of matrices U and V is defined. The union of two matrices is defined as the matrix with the union of corresponding elements in each matrix. The symbol for the union of two matrix elements is the symbol for the element which represents the stronger interference. Figure 6 shows the union of the matrices in Figures 4b and 5. On allocation of the channels, the exclusion matrix thus combined by combining its rows is used. If a certain control is required to the effect that small, individually permissible noise contributions do not add up too much during the process of allocation, for example, a further two levels "Y" and "Z" can be intro¬ duced in the following way. For the downlinking matrix, the matrix element is set as follows: uij = "0"; i = j uij = "A"; Pij (LP2) > px uij = "X"; Pij (LP1) > px uij = "Y", px/2 < Pij (LP1) ≤ px uij = "Z"; px/4 < Pij (LP1) ≤ px/2 uij » "."; Pij (LP1) < px/4 where px = limit value for the degree of inter¬ ference in the same way as before. The exclusion matrix for the uplinking situation can be formed correspondingly in certain cases. As mentioned before, the allocation is carried out by combining the rows in the exclusion matrix which is thus compressed. When the matrix cannot be compressed any further, a channel is allocated to each row in the matrix obtained. There are many known variants of the algebraic _ . _ procedure itself. These variants include different principles concerning which row should be used as a starting point in the matrix, which alternative should be selected from a large number of largely equivalent values in a given situation, different types of weighting in the calculation of the figure of merit controlling the procedure and so forth. There is no all-embracing theory on how to manage, but the procedures are heuristic and have been tested with computer simulations on random com- figurations of transmitters. These algorithms are certainly tested on random transmitter locations but the procedures themselves are deterministic, which means that each time the algorithm is run, exactly the same alloca¬ tion is obtained for the same constellation of transmit- ters. According to the invention, randomly controlled algorithms are used. In cases where a number of alterna¬ tive actions happen to be almost equivalent, which is determined by calculating heuristic figures of merit, a randomization is carried out for selecting the continued course of the procedure. The Applicant has implemented an allocation procedure specified by Hale on computer and it has been possible to make certain comparisons for mobile radio applications in Stockholm. It is thought that the ran¬ domly controlled allocation procedure can provide slightly less spectrum-effective allocations on average than the allocation obtained by means of the determin¬ istic procedure. However, this is balanced by the fact that from the great number of allocations obtained by means of the randomly controlled procedure, single allocations can be obtained which are extremely good. A number of different allocations which solve the same problem provide the operator with more information than a single allocation which solves the current problem. Furthermore, certain secondary conditions which are difficult to formulate mathematically can be satisfied by a suitable selection of the required allocation from a number of allocations. EXAMPLE The invention is illustrated below by means of an example. 48 stations are placed out beforehand in the Stockholm area. The necessary field strengths have been measured or calculated so that the exclusion matrix can be formed as above. To simplify the discussion, it is assumed that no channels are preallocated, that is to say the allocation is carried out without boundary condi¬ tions. 1. Starting from a number of base stations, see Figure 7, an exclusion matrix is formed, see Figure 8. The exclusion matrix is symmetrized. 2. All rows in the matrix are allocated a figure of merit. The figure of merit is defined most simply with the aid of the concept of scalar product. For one row, the figure of merit is obtained by considering the row as a vector where the symbols ".", "X", "0" and "A" have different integral-number weight and thereafter form the scalar product of the vector with themselves. Let the weights be zero for "." and "0" and a suitable integral- number value, for example 1, for "X" and "A". In certain connections, "A", can be allowed to have a higher inte¬ gral-number weight, for example 2 or 3. If the integral- number weights are equal to 1, the figure of merit represents the sum of the number "X" and "A". The figure of merit for a pair of vectors gene¬ rally represents the scalar product between corresponding integral-number vectors. If the weights of "X" and "A" are equal to 1, the figure of merit represents the number of common "X" and "A". A high value of the figure of merit indicates in this case a geographic closeness and this can be interpreted so that a good value of the figure of merit tends to concentrate compatible base stations in the area. This is a different way of saying that short repetition intervals are aimed for, which, in turn is a prerequisite for good frequency economy. The exclusion matrix is not necessarily to be symmetrized for the allocating algorithms to function. The figures of merit become slightly different which entails that the algorithms have different priorities in the random value. An advantage with a symmetrical matrix is that, on average, it needs fewer operations to carry out the allocations. 3. Selection of a first row in the matrix. This can be carried out by calculating the figure of merit for all rows and sorting the rows by decreasing figure of merit. Random selection of the row which represents the starting row from, for example, the 10 best rows. 4. When the starting row is determined, the rest of the rows are calculated which are compatible with the starting row. Sorting of these rows by figure of merit relative to the starting row by decreasing figure of merit. Random selection of the row which will be "added" to the starting row (the union is formed) from a fixed number of the best rows. After each addition, a new amount of compatible candidates is calculated and the procedure is repeated until there are no longer any compatible rows to be added. 5. Selection of a new starting row from the "free" number of rows in the same way as in 3. This row now represents the next channel in the allocation procedure. The rows which are compatible with this row are now calculated in the same way as in item 4. 6. The procedure according to item 5 is repeated again until no rows remain in the free set. A so-called allocation matrix has now been created according to Figure 9. The upper part of the figure shows the nine compressed rows which remain of the exclusion matrix according to Figure 8. Each row corresponds to a poten¬ tial channel and the sign 0 marks a station which is located in the channel. The lower part of Figure 9 contains the same information but, instead, for each 0 the column number is given. Thus, station numbers 4, 19, 21 and so forth are found in channel 1. In Figure 10 the stations are listed in numerical order in a table like Figure 7. The above procedure is exemplified in the con¬ cluding table in Figure 11 which is a table of a random selection of compatible rows. For this special case, all rows in the exclusion matrix have been allocated the same figure of merit even though the number "X" differs between different rows. The pair of numbers in the table shows on the one hand the row number and on the other hand the figure of merit in a selection of corresponding rows. The very first part-table has at the top the pair of numbers representing all conceivable 48 rows and all have the same figure of merit defined as zero in this particular case. It is therefore immaterial which start¬ ing row is used and in this case row number 46 has been randomly selected. In the next part-table, all rows are shown which are compatible with row no. 46 and the figures of merit of these rows. These figures of merit are calculated as scalar products as above. The figure of merit 4 in (21 4) thus represents the number of common "X" in rows 46 and 21. Among the five rows which have the highest figure of merit row 21 is randomly selected, which is thus added to row 46. In continuation, rows 32, 4, 23, 47, 41, 42, 19 and 44 are also added. These compatible rows represent the same number of base sta¬ tions with associated coverage areas and all these base stations can use the same channel 1 for transmitting and receiving (channel 1 is located both in the uplinking band and the downlinking band) . When all rows corresponding to channel 1 are added, a new starting row is randomly selected in this special case from the free set, by means of which channel 45 is obtained. The above procedure is repeated and randomiza¬ tions cause the rows 45, S , 14, 3, 48, 17, 25, 29 and 38 to be arranged together to form a single row which corresponds to channel 2. When a new starting row has been selected 9 times, no rows are left in the free set and no further rows exists which is compatible with row 10. The alloca¬ tion procedure is thereby concluded. With channel allocation in the microcell system in, for example, Stockholm, channel allocations in a surrounding area of Stockholm must be taken into con¬ sideration, that is to say the allocation is made "towards a certain boundary. The boundary can also include arbi¬ trary base stations in Stockholm which for one or other reason must stay fixed with respect to channel. This condition is only controlled by means of the algebraic allocation procedure by combining all rows in the ex¬ clusion matrix which correspond to one and the same channel. With the continued allocation, the row opera- tions act as allocation restriction with the given channel spacing. According to the invention, a control of the total degree of interference is made possible. According to what was said before, an allocating algorithm involves the purely algebraic execution of a number of row opera¬ tions in a cross-interference matrix or symmetrized exclusion matrix. Small matrix element values in cross- interference matrices are with good approximation addi¬ tive when rows are combined. This is due to the fact that the interference contributions from different transmit¬ ters in the same coverage area are independent of one another if the coverage area exposed to the interference does not constitute a significant part of the whole coverage. If the information from the cross-reference matrices for uplinks and downlinks is accessible with the allocation procedure, the resultant incident interference relating to the interference characteristics in different coverage areas can be sufficiently controlled during the allocation process by adding corresponding elements in the cross-interference matrices. If during this process a limit value is exceeded, this is a further restriction on the combining of rows in the exclusion matrix. An example of a very simple implementation of this principle is the introduction of levels "Y" and "Z" into the exclusion matrix as above. If it is noticed that the traffic demand of a base station increases until it doubles, measures can be taken against this by copying the item for this base station in the exclusion matrix one more time with the aid of a text editor. A specially developed handling program is used for renumbering all items with respect to the additional item introduced, after which the allocat¬ ing algorithm is repeated with the new item. An interference degree B can also be included in the exclusion matrix which implies that the interference is not negligible in the second adjacent channel. Naturally, this implies a further restriction on the combining of rows. The symbol B will not be found in the same column in less than or equal to two rows from the symbol 0 in a current row. Figure 12 shows an example of the final allocating matrix. There must therefore be two rows between the symbols 0 and B in the same column, see, for example, rows 3 and 6. A further aid to the resource allocation is a plotting program which creates plots of the interference situation. This is because the elements in an exclusion matrix belong to one of the following three classes: 1. Obvious non-exclusions, for example between cells at a very long distance from one another. It is suffi¬ cient to calculate that the coverage areas do not overlap one another, that is to say a trivial calculation. 2. Obvious exclusions between, for example, cells which are grouped together, that is to say cells which share the same mast or antenna. Collective groupings are easily found by comparing the coordinates of the sta¬ tions. 3. Uncertain pairs of cells where it is difficult to decide whether there is an exclusion or not. The number of uncertain pairs is a much lower number than the number of all cell pairs. When designing an exclusion matrix, only the elements in the cross-interference matrices which relate to uncertain cell pairs must be calculated, strictly speaking. This is suitably done with the algorithms which have been specified earlier in combination with the plotting program which produces plots of downlinks and uplinks for current cell pairs. For the uplink, the Monte-Carlo methods specified in a) and b) are to be preferred. The plotting program calculates the degree of interference (the value of the corresponding elements in the cross-interference matrix) and provides a visual image of the interference situation which provides for extremely accurate planning of the cell and its inter¬ action with other cells. The planning can now be carried out not only by taking into account the noise figure but also with respect to the total interference pattern and keeping in mind system-related aspects such as, for example, hand-over boundaries. It is possible to vary base station powers in power classes for mobile stations and also to regulate the coverage individually for each cell. This can be done simultaneously both for uplinking and downlinking. In addition, it is no longer necessary to be bound to a fixed limit value for the noise figure, but the cells can be planned individually with respect to the unique interference pattern. For example, if the interferences do not create any problem with normal traffic loading, these inter- ferences can be considered in these cases as belonging to the coverage area of another cell. The method is exacting work but provides a result of the highest quality. Figures 13-15 show plots of the service area of the base station in Vallingby with respect to interfer- ences from the coverage area around the base station at Odenplan. The downlinking situation is illustrated in Figure 13 where the limit value for coverage is -93 dBm. The coverage is represented by plotted line segments, the interferences from Odenplan being designated by 0. The degree of interference, that is to say the element in the cross-interference matrix, is calculated as 0.8%. Figure 14 shows a plot for a corresponding situation in the uplink. It is thus a picture of how the mobile stations in the coverage area of the base station at Odenplan interfere with the base station in Vallingby. The degree of interference is here approximately ten times higher than in the downlink. Figure 15 shows a plot of the uplink situation when the limit value for coverage is raised to -88 dBm. The coverage area has been slightly reduced but the interference situation has become acceptable with a degree of interference of approximately 4%. According to the embodiment of the invention described here, measured field strength values have been use to construct the exclusion matrix. However, the invention does not exclude the use of calculated field strength values if these are accessible. The invention is only limited by the patent claims below.

Claims: PATENT CLAIMS 1. The method for resource allocation in a radio system comprising a number of base stations with associated coverage areas and mobile stations, the potential interaction between functions in the system being defined and the stations being combined by an allocating algo¬ rithm, wherein several possible combinations of stations are formed by calculating a figure of merit and one of these combinations is selected by a random method. 2. The method as claimed in claim 1, wherein the interaction in the system is defined in matrix form, the allocating algorithm including mathematical/logical operations on the matrix which is thereby compres¬ sed, and the allocating process continues until the matrix cannot be compressed any further, the compressed matrix representing a possible channel allocation. 3. The method as claimed in claim 2, wherein a number of channel allocations are carried out which are different due to the random tech¬ nique, in which respect the best one from any point of view is select¬ ed. 4. The method as claimed in any one of the preceding claims, where¬ in the figure of merit is formed as the scalar product between vectors in the matrix. 5. The method as claimed in claim 4, wherein the interaction in the system is represented by a crossinterference matrix with elements in the form of numerical values. 6. The method as claimed in claim 4, wherein the interaction in the system is represented by an exclusion matrix with elements in symbol form (., X, A and possible B). 7. The method as claimed in claim 4, wherein the interaction in the system is represented by both an exclusion matrix in symbol form and a cross-interference matrix in numerical form, the rows in the cross-int¬ erference matrix being added by combining corresponding rows in the exclusion matrix, this addition constituting a further condition in the said combining for controlling the total degree of incident interfer¬ ence. SUBSTITUTE SH? 8. The method as claimed in claim 6 or 7, wherein the elements in the exclusion matrix can be allocated the following symbols/values: a first symbol ( .) which has the meaning that the interference (interac¬ tion) is negligible with respect to the base station's compatibility with another base station; a second symbol (X) which has the meaning that the co-channel interference (interaction) is not negligible; a third symbol (A) which has the meaning that the adjacent-channel inter¬ ference (interaction) is not negligible and possibly a fourth symbol (B) which has the meaning that the interference (interaction) is not negligible in the second adjacent channel; and a fifth symbol (0) which indicates which base station the interference relates to, the first to the fouth symbols representing an increasing degree of interference. 9. The method as claimed in claim 8, wherein the rows in the exclu¬ sion matrix represent potential channels, those rows which have the first symbol (.) or the fifth symbol (0), repectively, at corresponding places can be combined, while at the same time rows not relatively adjoining the new combined row at corresponding places have the fifth symbol (0) in combination with the third symbol (A) and possibly rows which are not relatively next-adjoining at corresponding places either have the fifth symbol (0) in combination with the fourth symbol (B), and the rows are combined by forming the union of corresponding ele¬ ments, in which respect the symbol for the union of two elements is the symbol for the element which represents the stronger interference and the union of the first symbol (.) and the fifth symbol (0) is defined to be the fifth symbol (0). 10. The method as claimed in claim 9, wherein the elements in the exclusion matrix can be allocated further symbols/values: a sixth symbol (Z) which corresponds to a low co-channel inter¬ ference; a seventh symbol (Y) which corresponds to a slightly higher co-channel interference, in which respect the union of two elements with the sixth symbol (Z), for example, is equal to the seventh symbol (Y) and the union of two elements with the seventh symbol (Y), for example, is equal to the second symbol (X). SUBSTITUTE SHEET

Inventors: GUNMAR KRISTER, TEGTH ULF, GUNMAR, KRISTER, TEGTH, ULF
Applicants: TELEVERKET
Application year: 1990
Main classification: H04B7
IPC codes: H04W16