CDMA CODE GENERATING METHOD AND CODE SELECTING METHOD

Abstract: The present invention relates to a code generating method for combining an orthogonal code for CDMA having a specific spreading factor and its polarity inverted spreading code to generate another spreading code having a larger spreading factor than that of the spreading code. And the present invention relates to a code selecting method for combining an orthogonal code for CDMA having a specific spreading factor and its polarity inverted spreading code to generate another spreading code having a larger spreading factor than that of the spreading code, then to assign the generated orthogonal code for a user in order of users having an orthogonal code of small spreading factor.

Description: The present invention relates to a method for generating spreading codes used in a CDMA (Code Division Multiple Access) communication system and a base station for generating such spreading codes. In a CDMA system, information signals are spread using inherent spreading codes assigned for all users, which identify each one of them. That enables signals of a plurality of users to be multiplied in the same frequency band, which results in a large efficient use of a frequency. In a CDMA system, if spreading codes absolutely orthogonalize, no interference occurs between signals of each user. That allows the number of users corresponding to the number of orthogonal codes to be accommodated under the ideal propagation condition, which ensures no quality deterioration in communications And, in a CDMA system, in the case of multiplying spreading signals using spreading codes having different spreading factors, it is possible to multiply user signals having different rates in the same frequency band because the division of signals is possible when different spreading codes are used. Especially, using Walsh codes as a spreading code makes such communication possible because Walsh codes having different spreading factors are orthogonalized to each other. FIG.1 illustrates a case of transmitting information signals from user #1 to user #7 using spreading codes having different spreading factors. User #1, #2 and #3 use a spreading code of spreading factor 8, user #4 and user #5 use a spreading code of spreading factor 16, and user #6 and user #7 use spreading code of factor 32. Each number from 1 to 7 in FIG.1 respectively illustrates transmission signals of each of user #1 to user #7. As illustrated in FIG.1, when a spreading factor of a spreading code is divided by two, i.e. spreading factor 16 becomes 8, the time for one symbol becomes shorter. That doubles the symbol rate, which results in twice the information capacity. However with respect to other users, it is impossible to transmit signals using a spreading code of spreading factor 8 and its two-combined spreading code of spreading factor 16. Because of it, the total information capacity that can be transmitted is not improved in the whole by halfing spreading factor of a spreading code . FIG.2 illustrates examples of a Walsh code. In this example, a length of spreading code is 16, which means the presence of 16 codes orthogonalized to each other. These codes are referred to W1 to W16. For instance, when 0000 is used as a spreading code of spreading factor 4, this spreading code does not orthogonalizes with W4, W8, W12 and W16. It means that a user in using this spreading factor 4 consumes four codes of spreading factor 16 for four users. On the other hand, the transmission information capacity becomes 4 times that of the case of using a spreading code of spreading factor 16, which provides no change to the total amount of transmission information in the system. Namely, the total transmission information capacity (spreading factor × transmission.information capacity) is constant when Walsh codes are used even by combining any spreading factors. However, since the time dependence of Walsh code is large, its performance deteriorates drastically by delayed waves. To prevent it, a method to use Walsh codes with long codes is tried, however in this case a problem in acquiring synchronization is still remained. On the other hand, the time dependence of orthogonal Gold code well known as an orthogonal code is smaller than that of Walsh code. Accordingly, the deterioration rate in its performance caused by delayed waves is smaller than that of Walsh code. However, in orthogonal Gold codes, while those of the same spreading factor orthogonalize, those of different spreading factors necessarily orthogonalize. Because of it, interference between user signals occurs, which results in deterioration in quality and decreases of transmission capacity. And, in the case of using codes having large time dependence, interference between codes caused by delayed waves becomes large, which may bring deterioration in quality. The more the transmission power is increased to compensate it, the more interference to other users is increased. That results in deterioration in quality and increases of transmission capacity in the whole system. EP-A-814 581 forms prior art under Art 54(3) EPC and relates to a CDMA communication method. The present invention is carried out taking into account the problems described above and has an object to provide a method and a base station for generating spreading codes, even in the case of different spreading factor, and having low time dependence. This object is achieved by a method having the steps of claim 1 as well- as by a base station as defined by claim 3. FIG.1 is a diagram illustrating transmission signals in the case where users having a plurality of spreading codes of different spreading factors co-exist; FIG.2 illustrate examples of Walsh code of spreading factor 16; FIG.3 is a block diagram illustrating a system executing a method of the present invention; FIG.4 is a block diagram illustrating spreading code instructing section at a base station in the system illustrated in FIG.3; FIG.5 is a diagram to explain a generating method of spreading codes in the present invention; FIG.6 is a flow chart for assigning a code in the present invention; and FIG.7(a) to FIG.7(b-1) are diagrams illustrating a correlation method used in code selection in the present invention. The present invention is explained in detail with reference to attached drawings in the following. In the present invention, an orthogonal code having large spreading factor is generated by combining an orthogonal code of small spreading factor and its inverted pattern. That allows to generate orthogonal codes orthogonalizing between each others without decreasing the total transmission information capacity even in the case of using codes of different spreading factors. And in the present invention, the time dependence value of the generated orthogonal codes are calculated to select an orthogonal code of low time dependence value. That allows to select an orthogonal code of low time dependence value to obtain a code having large resistance against delayed wave. And, by assigning an orthogonal code having low time dependence value selected in the above method for a user using a spreading code having a lower spreading factor which is weak against a delayed wave, it makes possible to improve transmission quality and increase the transmission amount in the whole system. Next, the embodiment of the present invention is explained. (Embodiment 1) In the embodiment 1, a method for generating spreading codes (orthogonal codes) orthgonalizing between each others even in the case of using codes of different factors in a CDMA system is explained. FIG.3 is a schematic block diagram illustrating the CDMA used in implementing the code generating method and code selecting method of the present invention. In the system, a transmitting side comprises spreading section 1 for code spreading transmission data, spreading code instructing section 2 for obtaining a spreading code used in spreading the transmission data at spreading section 1, long code spreading section 3 for scrambling the spread data.further with a long code, modulating section 4 for modulating the data spread with a long code and transmitting antenna 5 for transmitting the modulated signals. And in the system, a receiving side comprises receiving antenna 6 for receiving transmitted signals, detecting section 7 for detecting received signals, long code despreading section 8 for releasing the scramble of the detected data with a long code, despreading section 9 for despreading the despread data further with a spreading code and spreading code instructing section 10 for providing a spreading code used in despreading into despreading section 9. In communication between a base station and a mobile station, a spreading code instructing section at a base station comprises, as illustrated in FIG.4, code memory 11 for storing a plurality of spreading codes, user administering section 12 for administering spreading codes used in communication with a base station separately for each user, code generating section 13 for combining spreading codes of small spreading factors to generate a spreading code of large spreading factor, correlation value calculating section 14 for executing auto-correlation of generated spreading codes taking into account time shifts to calculate auto-correlation values, code selecting section 15 for selecting on the basis of the correlation value, code arranging section 16 for changing a user used spreading code and arrange it, and code assigning section 17 for assigning a spreading code generated or selected for a user. Next, operations in the CDMA system having the constitution described above are explained. First, transmission data is spread at spreading section 1 with a spreading code instructed by spreading code instructing section 2. Further, the spread transmission data is scrambled with a long code (LC) at long code spreading section 3. Then, the spread data in this way is provided into modulating section 4 to be modulated by modulation method such as BPSK (Binary Phase Shift Keying) and others. The modulated signals are radiated from transmitting antenna 5. The transmitted signals are received at receiving antenna 6. The received signals are detected at detecting section 7, released scramble at long code despreading section 8 and further despread with a spreading code instructed by code instructing section 10 to obtain reception data. Next, operations of spreading code instructing section 2 and 10 are explained. The case where spreading code instructing section 2 is at a base station and spreading code instructing section 10 is at a mobile station, is explained. And orthogonal code of spreading factor 8 would be used as a base orthogonal code. In the case of spreading factor 8, eight orthogonal codes orthogonalizing between each others exist, and these eight codes are referred as spreading code from (8.1) to (8.8). These spreading codes from (8.1) to (8.8) are stored in code memory 11 at spreading code instructing section 2. And user administering section 12 administrates about which user uses which code. Code generating section 13 combines spreading codes from (8.1) to (8.8) stored in code memory 11 and their polarity inverted spreading codes to generate spreading code of larger spreading factor, for instance spreading factor 16 and 32. At this time, obtained spreading codes are referred to the using spreading codes in user administering section 12, then in the case where spreading codes in using are contained in the combination, those can not be used. The spreading codes generated in this way orthogonalize with all spreading codes of spreading factor 8. A method to generate the spreading codes described above is as follows. A spreading code obtained by repeating spreading code (8.1) twice is referred to spreading code (16.1). A spreading code obtained by connecting spreading code (8.1) and its inverted spreading code (8.1) is referred to spreading code (16.2). These spreading codes (16.1) and (16.2) have the correlation with spreading code (8.1) and orthogonaloze with from (8.2) to (8.8). And the correlation value of the former 8 bits of spreading codes (16.1) and (16.2) is 1, and the correlation value of the latter 8 bits of them is -1. It brings that the correlation value of 16 bits of them is 0, which means they are orthogonalized. The above generating method allows to generate spreading codes (16.1) and (16.2). However, since spreading codes (16.1) and (16.2) are generated using spreading code (8.1), in the case where a user having a spreading code of spreading factor 8 uses (8.1), a user having a spreading code of spreading factor 16 can not use this spreading code. In the same way as described above, spreading codes from (16.3) to (16.16) are generated using spreading codes from (8.2) to (8.8) and their polarity inverted spreading codes. And, spreading codes having spreading factor 32 are generated using spreading codes from (16.1) to (16.16) in the same way as described above. In this case, since spreading codes from (32.1) to (32.4) are generated using spreading code (8.1) of spreading factor 8, they can not be used in the case where a user having a spreading code of spreading factor 8 uses (8.1). On the other hand, spreading code instructing section 10 at a mobile station maintains a spreading code transmitted from a base station and outputs this spreading code to despreading section 9. Next, a method for assigning spreading codes generated as described above for users is explained. Spreading codes generated at code generating section 13 are transmitted into code assigning section 17 to assign for users. For instance, in the case where users from A to G use spreading codes of spreading factor 8, 16, 16, 16, 32, 32, 32 respectively, code (8.1) is assigned for user A using a spreading code of the smallest spreading factor (8). A spreading code of the second smallest spreading factor 16 is assigned for user B using. In this case, since user A already uses spreading code (8.1), a spreading code generated using spreading code (8.1) is not available as a spreading code for user B. Accordingly, spreading code (8.2)+(8.2) is available for user B. And for user C. spreading code (8.2)+(8.2) is available to assign. For user D, since a spreading code generated from (8.1) and (8.2) is already used, spreading code (8.3)+(8.3) is assigned. As described above, in the case of assigning spreading codes for users, spreading codes are assigned for user in order of users having a spreading code of smaller spreading factor. In the case where spreading codes used in spreading codes of large spreading factor are used irregularly, for instance, in the case where spreading codes (32.1), (32.5), (32.9), (32.13), (32.17), (32.21), (32.25) and (32.29) are used, these spreading codes are arranged to (32.1) to (32.8) that can be generated from spreading code (8.1). And the arranged spreading codes are assigned for users in order of users having a spreading code of smaller spreading factor described above. Namely, spreading codes are arranged at code arranging section 16 on the basis of information from user administering section 12. Next, code assigning section 17 assigns a spreading code for a user on the basis of information from code arranging section 16. The assignment of the spreading codes are executed according to the flow chart illustrated in FIG.6. First, when a call occurs (S1), it is examined whether a spreading code of desirable spreading factor is available, i.e. all of spreading codes of desirable spreading factor are not used (S2). When all of spreading codes of desirable spreading factor are used, codes are arranged at code arranging section 16 (S3). Further it is examined again whether a spreading code of desirable spreading factor is available, i.e. all of spreading codes of desirable spreading factor are used (S4). When all of spreading codes of desirable spreading factor are used, the call is refused (S5). On the other hand, without any relation to whether spreading codes are arranged or not, when a spreading code of desirable spreading factor is available, an available spreading code is assigned for a user (S6). The time dependence of the code generated as described above and assigned for users is smaller then that of Walsh codes. And it is ensured to orthogonaloze between any spreading codes of spreading factor 2". That allows to transmit information in any combination of user signals with spreading codes of different spreading factors within the total transmission information capacity. (Embodiment 2) In the embodiment 2, a method to select a spreading code having low time dependence from the spreading codes generated according to the method of embodiment 1 is explained. Accordingly, the generation method, to generate a spreading code having larger spreading factor by combining spreading codes having a specific spreading factor, is the same as that of embodiment 1. In this way, a spreading code generated at code generating section 13 illustrated in FIG.4 is transmitted into correlation value calculating section 14 to obtain the auto-correlation value, a spreading code is selected at code selecting section 15 on the basis of the correlation value, then the selected spreading code is assigned for a user at code assigning section 17. Concretely, as illustrated in FIG.7, the auto-correlation value of a spreading code is calculated taking into account the time difference. For instance, in the case where the time difference τ is 0, auto correlation result 101 is obtained by calculating an accumulation of bits at the same position of a spreading code as illustrated in FIG.7(a). And, in the case of where the time difference τ is 2, the auto-correlation value is calculated by corresponding from the first bit to the eighth bit in

Claims: A code generating and assigning method in a CDMA communication system, comprising the steps of generating a set of selected spreading codes to be assigned to users in the communication system, using a first plurality of spreading codes, each having the same spreading factor and consisting of spreading codes and its corresponding polarity inverted spreading codes, a second plurality of spreading codes, each having a larger spreading factor than the spreading factor of the first plurality of the spreading codes by combining the spreading codes of the first plurality in pairs, each pair consisting of a spreading code and its corresponding polarity inverted spreading code; selecting at least one of the first plurality of spreading codes for inclusion in the set of selected spreading codes; selecting those of the second plurality of spreading codes which consist of non-selected spreading codes of the first plurality of spreading codes for inclusion in the set of selected spreading codes; and assigning the set of selected spreading codes to users in an order such that codes having a smaller spreading factor are assigned before assigning codes having a larger spreading factor. The code generating and assigning method according to claim 1, further comprising the step of determining whether a spreading code having a desirable spreading factor is available to be assigned to users in the communication system. A base station apparatus in a CDMA communication system, comprising code generating means (13) for generating a set of selected spreading codes to be assigned to users in the communication system, using a first plurality of spreading codes, each having the same spreading factor and consisting of spreading codes and its corresponding polarity inverted spreading codes, second plurality of spreading codes, each having a larger spreading factor than the spreading factor of the first plurality of the spreading codes by combining the spreading codes of the first plurality in pairs, each pair consisting of a spreading code and its corresponding polarity inverted spreading code; selecting means (15) for selecting at least one of the first plurality of spreading codes for inclusion in the set of selected spreading codes and those of the second plurality of spreading codes which consist of non-selected spreading codes of the first plurality of spreading codes for inclusion in the set of selected spreading codes; and assigning means (17) for assigning the selected spreading codes to users in an order such that codes having a smaller spreading factor are assigned before assigning codes having a larger spreading factor. The base station apparatus according to claim 3 further comprising code administrating means (12) for administrating available spreading codes to be assigned to users in the communication system.

Inventors: KATO OSAMU, NAGASE TAKU, UESUGI MITSURU, KATO, OSAMU, NAGASE, TAKU, UESUGI, MITSURU, UESUGI, Mitsuru, 33 Goshitsu 13 Goto, Kamoi-so
Applicants: MATSUSHITA ELECTRIC IND CO LTD, MATSUSHITA ELECTRIC INDUSTRIAL CO., LTD
Application year: 1997
Main classification: H04J13
IPC codes: H04J11, H04J13