[go: up one dir, main page]

CN1142648C - Bandspread distributing method in wideband CDMA system - Google Patents

Bandspread distributing method in wideband CDMA system Download PDF

Info

Publication number
CN1142648C
CN1142648C CNB011056568A CN01105656A CN1142648C CN 1142648 C CN1142648 C CN 1142648C CN B011056568 A CNB011056568 A CN B011056568A CN 01105656 A CN01105656 A CN 01105656A CN 1142648 C CN1142648 C CN 1142648C
Authority
CN
China
Prior art keywords
spreading code
code set
spreading
available
spread spectrum
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.)
Expired - Lifetime
Application number
CNB011056568A
Other languages
Chinese (zh)
Other versions
CN1374772A (en
Inventor
李引新
陆武
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Datang Mobile Communications Equipment Co Ltd
Original Assignee
Datang Mobile Communications Equipment Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Datang Mobile Communications Equipment Co Ltd filed Critical Datang Mobile Communications Equipment Co Ltd
Priority to CNB011056568A priority Critical patent/CN1142648C/en
Publication of CN1374772A publication Critical patent/CN1374772A/en
Application granted granted Critical
Publication of CN1142648C publication Critical patent/CN1142648C/en
Anticipated expiration legal-status Critical
Expired - Lifetime legal-status Critical Current

Links

Images

Landscapes

  • Mobile Radio Communication Systems (AREA)

Abstract

The present invention relates to a spread spectrum code allocation method in a wideband code division multiple access system. Initialization is carried out, and spread spectrum codes in available spread spectrum code sets are combined; under the condition of not disassembling the spread spectrum codes in the available spread spectrum code sets, initial separation spread spectrum code sets which are not less than required wireless resources; under the condition of capability of disassembling spread spectrum codes in the initial separation spread spectrum code sets, redundant code resources in the initial separation spread spectrum code sets are replaced into the spread spectrum code sets. The method changes the allocation of the spread spectrum codes from exhaustion to conditional search, the execution time of the method is greatly reduced, and the spread spectrum codes conforming to the allocation criterion of the spread spectrum codes can also be obtained.

Description

The distribution method of spreading code in a kind of broadband CDMA system
Technical field
The present invention relates to the method for allocation of radio resources in a kind of mobile communication system, specifically, what relate to is the method for distributing spreading code in a kind of Wideband Code Division Multiple Access (WCDMA) (CDMA) system.
Background technology
Spread spectrum communication is used widely in broadband CDMA system, transmission during information the used signal bandwidth minimum bandwidth more required than this information of transmission much wide; Widening frequency band is to finish with the sign indicating number that is independent of the transmission data, and receiving terminal comes despreading and restore data with synchronous sign indicating number.The Radio Resource of broadband CDMA system is made up of frequency (or time slot) and spreading code (or being called channel code).Under the identical situation of frequency or time slot, all spreading codes that in fact Radio Resource that sub-district can be used can use corresponding to this sub-district.Therefore for a resource request that is lower than maximum rate, how to distribute spreading code most important for effectively utilizing Radio Resource.
The criterion that should follow when only spreading code being selected in the present related specifications has some descriptions, and concerning spreading code, the spreading code that is used for broadband CDMA system is called ovsf code, i.e. orthogonal variable frequency extension factor code.Each spreading code C Ch, SF, k, representing that wherein SF is meant the spreading factor of sign indicating number, k be yard number 0≤k≤SF-1.It is the spreading code of SF that each of code tree grade has defined length, is the spreading code of SF corresponding to spreading factor.The basic norm of choosing spreading code comprises three, that is:
Criterion 1: availability.Availability is defined as the ratio of available bandwidth and whole bandwidth.The sign indicating number that as far as possible keeps less spreading factor can have higher chance that higher availability is provided.For example, for the base station, C 4,0(C 8,0, C 8,2) can support the data rate of 960kbps, and can only support to have only C under the situation of reception of a channel code at travelling carriage 4,0Sign indicating number can be supported the data rate of 960kbps, if be left the former in the therefore available spreading code set, will provide an availability preferably.
Criterion 2: complexity.In general, employed spreading code number is many more, and the complexity of system is just high more.Satisfy at the same time under the condition of criterion 1, select spreading code with this criterion.
Criterion 3: capabilities limits.The spreading code number that distributes can not surpass the receiving ability of mobile phone, i.e. the maximum code channel numbers that can receive of mobile phone.
Except above description, do not have a complete algorithm of choosing spreading code, therefore will obtain meeting the spreading code of choosing criterion can only be by exhaustive way.This choosing method inefficiency that seems implements and also has certain degree of difficulty.
Summary of the invention
The purpose of invention of the present invention is: the distribution method of spreading code is reduced a screening process clocklike, after the relevant parameters such as receiving ability of the Radio Resource of given available all spreading codes, requirement and subscriber equipment, just can obtain the spreading code (group) that compliant requires rapidly, thereby improve the efficient of choosing spreading code greatly.
The present invention is achieved in that a kind of distribution method that is used for the broadband CDMA system spreading code of rule screening spreading code, it is characterized in that described method comprises following step:
A) determine that spreading code in the whole system distributes required initiation parameter, the Radio Resource R and the supported code channel number MaxCh of subscriber equipment maximum of the requirement that wherein said initiation parameter comprises available spreading code set C at least, represent with the integral multiple of minimum Radio Resource;
B) spreading code in described available spreading code set C the spreading code among the described available spreading code set C merged, till can't be merged into the littler spreading code of spreading factor;
C) carry out selecting the first time, select the described first time and be included under the situation of not taking the spreading code among the available spreading code set C apart, select and be not less than the described primary election spreading code set S that requires Radio Resource R;
D) carry out selecting the second time, select the described second time and be included under the situation of taking the spreading code among the primary election spreading code set S in the described step c) apart, unnecessary sign indicating number resource among the primary election spreading code set S is put back to available spreading code set C, sign indicating number resource in spreading code set S is issued to minimum in the situation of the Radio Resource R that is not less than requirement, and the sign indicating number resource number among the spreading code set S is not more than the maximum supported code channel number MaxCh of subscriber equipment.
Description of drawings
Fig. 1 is for merging spreading code and the schematic diagram of taking spreading code apart among the present invention;
The flow chart of Fig. 2 for once selecting in example of optimal allocation spreading code of the present invention;
The flow chart that Fig. 3 selects for secondary in example of optimal allocation spreading code of the present invention.
Below in conjunction with accompanying drawing, by detailed description of the present invention, characteristic of the present invention, advantage and purpose will be apparent.
Embodiment
With reference to Fig. 1, the so-called notion that merges is from orthogonal variable frequency extension factor code (OVSF), and it is two reciprocal processes that the spreading code merging is taken apart with spreading code, as shown in the figure, and C 1,0Can split into C 2,0And C 2,1Two spreading codes, C 2,0Can split into C again 4,0And C 4,1Two spreading codes, other and the like.So to { C 4,0, C 4,2, C 64,32, C 64,33, C 128,32Set just can merge into { C 4,0, C 4,2, C 32,16, C 128,32.
Next referring to Fig. 2, Fig. 3.We with the set that C represents present available spreading code, represent the set of primary election spreading code at this with S.Put it briefly, the present invention is that the screening with spreading code is divided into two steps, and in a first step, the spreading code set that obtains must be available spreading code, but through optimizing, not in full conformity with choosing criterion; The spreading code set that obtains in second step then is through the spreading code set after optimizing, and belongs to and meets the optimal selection result who chooses criterion.Generally speaking, this method is converted into search with good conditionsi with the distribution of spreading code by exhaustive, the time of implementation of having simplified algorithm greatly, and can draw the spreading code that meets the spreading code allocation criteria equally.
Fig. 2 has provided the flow chart of once selecting in example of optimal allocation spreading code.Select the spreading code set of the Radio Resource that meets the requirements under the situation of the spreading code in not breaking set C.Concrete steps are as follows:
This flow process begins at piece 101 places, provides the Radio Resource R that comprises available spreading code set C, requirement and the initiation parameter of the maximum supported code channel number MaxCh of subscriber equipment.At first step, piece 102 places are the frequency spreading code division dispensing intermediate variable SF of spreading factor maximum among the available spreading code set C TarIn step 103, whether SF is arranged among the pair set C TarJudge that if having, just selecting spreading factor from set C is SF TarA spreading code, put into S set; Otherwise, just with SF TarReduce half, return piece 104.Then enter piece 105, SF is SF among the taking-up set C TarSign indicating number take out and to put into S set, in piece 105, if the resource in the S set less than R, enters piece 107, judge, if the sign indicating number number in the S set has equaled MaxCh, from S set, remove the spreading code of a spreading factor maximum, put back to set C, return piece 102, if the sign indicating number number is not equal to MaxCh, directly return piece 102.Resource in the if block 105 in the S set is not less than R, then finishes first step, begins second step.
With reference to figure 3, in second step, at first in piece 109, judge whether the number of resources of spreading code in the S set equates with the resource that requires, if equate, represent eligiblely, directly enter piece 121 output results, end.If unequal, piece 110 is with the frequency spreading code division dispensing intermediate variable SF of spreading factor minimum in the S set Tar, then piece 111 is SF with spreading factor in the S set TarSpreading code and greater than SF TarMinimal frequency spreading factor distribute to PointC and EndSF respectively, execution block 112 then, judge whether to remove a spreading factor SF TarSpreading code after number of resources is still greater than the spread spectrum code resources number that requires in the S set, if satisfy this condition, piece 113 is SF with spreading factor in the S set TarSpreading code put back among the set C, otherwise, in piece 114, further judge, if SF TarTake back and EndSF apart relatively, if more than or equal to intermediate variable EndSF, piece 115, assignment once more, SF TarIn amplify in SF TarMinimal frequency spreading factor, return piece 111 then, judgement in the if block 114 is set up, and then enters piece 117, judges whether to break that to remove a spreading factor behind the PonitC be SF TarSpreading code after still keep number of resources in the S set more than or equal to the number of resources that requires, if be false, return piece 114, if set up, enter piece 119, removing a spreading factor from PointC is SF TarSpreading code put back among the set C, then piece 120 checks whether the spreading code in the S set was all searched for, if all do not search for, returned piece 111, in case all searched for, piece 121 output results stop this sub-distribution.
According to an example flow diagram of this optimal allocation method, existing concrete two examples of lifting describe invention.Here suppose that spreading factor is 256 to the maximum, the least unit that promptly means spread spectrum code resources is that a spreading factor is 256 spreading code.
Example 1: available spread spectrum code resources is { C at present 256,0, C 64,1, C 32,2, C 4,1, the spread spectrum code resources of requirement is 45 (i.e. 45 spreading factors can provide for 256 spreading code resource), and travelling carriage can receive 4 spreading codes at most simultaneously, passes through first step of this method so, and the spreading code that needs still is { C 256,0, C 64,1, C 32,2, C 4,1, after second step, the spreading code that needs is { C 256,0, C 64,1, C 32,2, C 8,3, this is in the optimal result under precondition.Remaining available spreading code is { C 8,2.
Example 2: the available spread spectrum code resources and the spread spectrum code resources of requirement are all with example 1, but travelling carriage can receive 3 spreading codes at most simultaneously, pass through first step of this method so, and the spreading code that needs still is { C 64,1, C 32,2, C 4,1, after second step, the spreading code that needs is { C 16,5, C 8,3, this is in the optimal result under precondition.Remaining available spreading code is { C 256,0, C 64,1, C 32,2, C 16,4.

Claims (9)

1, a kind of distribution method that is used for the broadband CDMA system spreading code of rule screening spreading code is characterized in that described method comprises following step:
A) determine that spreading code in the whole system distributes required initiation parameter, the Radio Resource R and the supported code channel number MaxCh of subscriber equipment maximum of the requirement that wherein said initiation parameter comprises available spreading code set C at least, represent with the integral multiple of minimum Radio Resource;
B) spreading code in described available spreading code set C the spreading code among the described available spreading code set C merged, till can't be merged into the littler spreading code of spreading factor;
C) carry out selecting the first time, select the described first time and be included under the situation of not taking the spreading code among the available spreading code set C apart, select and be not less than the described primary election spreading code set S that requires Radio Resource R;
D) carry out selecting the second time, select the described second time and be included under the situation of taking the spreading code among the primary election spreading code set S in the described step c) apart, unnecessary sign indicating number resource among the primary election spreading code set S is put back to available spreading code set C, sign indicating number resource in spreading code set S is issued to minimum in the situation of the Radio Resource R that is not less than requirement, and the sign indicating number resource number among the spreading code set S is not more than the maximum supported code channel number MaxCh of subscriber equipment.
2. the distribution method of spreading code is characterized in that in the broadband CDMA system according to claim 1, selects in the process carrying out selecting the described first time with the described second time, and primary election spreading code set S also is subjected to following condition restriction, and described condition comprises:
A) the spreading code number among the primary election spreading code set S can not be greater than the maximum supported code channel number MaxCh of subscriber equipment;
B) spreading code is arranged in order according to the size of spreading factor among the primary election spreading code set S.
3. the distribution method of spreading code is characterized in that in the broadband CDMA system according to claim 2, and in selecting the described first time, primary election spreading code set S selects according to the order that spreading factor increases.
4. the distribution method of spreading code in the broadband CDMA system according to claim 2, it is characterized in that, in selecting the described second time, the process of unnecessary sign indicating number resource among the primary election spreading code set S being put back to available spreading code set C is to select according to the order that spreading factor reduces.
5. the distribution method of spreading code in the broadband CDMA system according to claim 3, it is characterized in that, in selecting the described first time, adopt the formation of first-in first-out to store the spreading code set of selecting, be no more than the subscriber equipment maximum with the spreading code set number that guarantees to select and support code channel number MaxCh.
6. the distribution method of spreading code in the broadband CDMA system according to claim 4, it is characterized in that the process of unnecessary sign indicating number resource among the primary election spreading code set S being put back to available spreading code set C is under the situation of not taking spreading code apart spreading code to be put back to.
7. the distribution method of spreading code is characterized in that in the broadband CDMA system according to claim 4, and unnecessary sign indicating number resource among the primary election spreading code set S is put back to available spreading code, and to gather the process of C be to put back to a wherein spreading code after spreading code is broken.
8. the distribution method of spreading code is characterized in that in the broadband CDMA system according to claim 4, stores available spreading code set S in order.
9. the distribution method of spreading code is characterized in that in the broadband CDMA system according to claim 8, and described sequential storage comprises list structure.
CNB011056568A 2001-03-14 2001-03-14 Bandspread distributing method in wideband CDMA system Expired - Lifetime CN1142648C (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CNB011056568A CN1142648C (en) 2001-03-14 2001-03-14 Bandspread distributing method in wideband CDMA system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CNB011056568A CN1142648C (en) 2001-03-14 2001-03-14 Bandspread distributing method in wideband CDMA system

Publications (2)

Publication Number Publication Date
CN1374772A CN1374772A (en) 2002-10-16
CN1142648C true CN1142648C (en) 2004-03-17

Family

ID=4654730

Family Applications (1)

Application Number Title Priority Date Filing Date
CNB011056568A Expired - Lifetime CN1142648C (en) 2001-03-14 2001-03-14 Bandspread distributing method in wideband CDMA system

Country Status (1)

Country Link
CN (1) CN1142648C (en)

Families Citing this family (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1627676B (en) * 2003-12-10 2010-04-14 华为技术有限公司 Method for channel code mapping of downlink shared channel in wideband code division multiple access system
CN100558024C (en) * 2004-03-04 2009-11-04 智邦科技股份有限公司 Communication method of multirate multicarrier multicode division system
CN1753345B (en) * 2004-09-24 2010-08-11 上海贝尔阿尔卡特股份有限公司 Primary distribution method of orthogonal variable spread spectrum factor code and related wireless network controller
CN1815934B (en) * 2005-02-06 2011-06-15 北京邮电大学 Code resource distribution method of reducing CDMA mobile telecommunication system interference
US8149792B2 (en) * 2006-11-15 2012-04-03 Telefonaktiebolaget L M Ericsson (Publ) Allocation of spreading codes for telecommunications channels
CN101662309B (en) * 2009-09-24 2013-11-06 中兴通讯股份有限公司 Generation method of spreading code and device thereof
CN103107854B (en) * 2011-11-14 2015-11-25 中磊电子(苏州)有限公司 The distribution method of the orthogonal variable frequency extension factor code of down link and base station system
WO2018119942A1 (en) * 2016-12-29 2018-07-05 深圳天珑无线科技有限公司 Channel access method and apparatus

Also Published As

Publication number Publication date
CN1374772A (en) 2002-10-16

Similar Documents

Publication Publication Date Title
US9036597B2 (en) Wireless communication system
RU2129761C1 (en) Method for frequency allocation between base stations of mobile communication network
US6333936B1 (en) Method and apparatus for allocating processing resources
DE60015521T2 (en) Cell search apparatus and method in a CDMA mobile communication system
DE69326301T2 (en) TRANSMISSION METHOD FOR TDMA-CELLULAR MOBILE RADIO ARRANGEMENT THROUGH FREQUENCY JUMP
AU723015B2 (en) Method for allocating walsh codes by group in a CDMA cellular system
DE60124588T2 (en) HYBRID RIBBON TECHNOLOGY TO EXTEND THE CHANNEL CAPACITY
CN1142648C (en) Bandspread distributing method in wideband CDMA system
CA2390718C (en) Method, apparatus and computer program for code allocation for variable data rates in a cdma system
CN1122433C (en) Mobile Assisted Handoff in Radio Communication Systems
US5697078A (en) Wideband channel sniffer for monitoring channel use in a wireless communication system
CN1138924A (en) Method and appts. for a radio communication system
US5751772A (en) Method for locating a channel in a communication system
US6385188B1 (en) Method for sharing channels between base station sectors and frequency assignments in code division multiple access system
DE60104171T2 (en) CDMA receiver and CDMA reception method
EP1010266A1 (en) A method for assigning spreading codes
US20090219944A1 (en) Methods and devices for allocating frequency ranges
WO2002069665B1 (en) Cdma multi-carrier traffic management to provide capacity on demand
CN100365954C (en) Cell scramble distributing method for time division-synchronous code division multiple access system
KR20020039192A (en) Channel code assignment method for uplink synchronous system in mobile communication network
JP4128880B2 (en) Radio control apparatus and spreading code selection method
KR100346195B1 (en) Method for allocating hadamard code in code division multiple access system
CN1241364C (en) Communication environment monitoring method
CN1929352B (en) Distribution method for descending chain circuit OVSF code in SCDMA system
CN1489402A (en) Base station control time-gap and business frequency allocation method for PHS system

Legal Events

Date Code Title Description
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
PC01 Cancellation of the registration of the contract for pledge of patent right

Date of registration: 20070510

Pledge (preservation): Pledge

PE01 Entry into force of the registration of the contract for pledge of patent right

Effective date of registration: 20070510

Pledge (preservation): Pledge

PC01 Cancellation of the registration of the contract for pledge of patent right

Date of cancellation: 20100413

Granted publication date: 20040317

Pledgee: CHINA DEVELOPMENT BANK

Pledgor: DATANG MOBILE COMMUNICATIONS EQUIPMENT Co.,Ltd.|SHANGHAI DATANG MOBILE COMMUNICATIONS EQUIPMENT Co.,Ltd.|CHINA ACADEMY OF TELECOMMUNICATIONS TECHNOLOGY

Registration number: 2007110000354

CX01 Expiry of patent term
CX01 Expiry of patent term

Granted publication date: 20040317