CN100521591C - Method of controlling aggregate searching dispatching of CDMA communication - Google Patents
Method of controlling aggregate searching dispatching of CDMA communication Download PDFInfo
- Publication number
- CN100521591C CN100521591C CNB031429289A CN03142928A CN100521591C CN 100521591 C CN100521591 C CN 100521591C CN B031429289 A CNB031429289 A CN B031429289A CN 03142928 A CN03142928 A CN 03142928A CN 100521591 C CN100521591 C CN 100521591C
- Authority
- CN
- China
- Prior art keywords
- control channel
- search
- searched
- value
- priority
- 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 - Fee Related
Links
Images
Abstract
Search dispatching is dependent on time for searching control channel in set, the number of control channel in set and the intensity of these channels. Generally, given control channel is received in several time offset. Each offset is related to multiple routes of control channel. One PN offset region (searching window) should be a region for searching each control channel. Energies in the window discovered from all multiple routes are summed to form the energy estimation for the control channel. Network provides size of search window in system parameters. SRCH_WIN_A defines window width of initiative set and candidate set. SRCH_WIN_N defines window width of neighbor set.
Description
Technical field:
The present invention relates to a kind of method that is used for the control set search dispatching of cdma communication, belong to mobile communication and make the field.
Background technology:
In CDMA 1 and CDMA2000 standard, each base station all can ceaselessly send the direct sequence signal of non-data-modulated in control channel.Sort signal is made up of data block stream (CHIP), and its maximum length of each data block is that (cycle of every sequence is 2 to PN (puppet is made an uproar) sequence
15), control channel is discerned at interval with the length of comparing 64 data blocks with 0 skew control (PN) sequence, except the reference phase that coherent demodulation is provided, control signal also can make mobile radio station (terminal) obtain and keep the sequential of forward data link, and carries out the strong and weak differentiation of base station signal to switch in good time.
In the CDMA standard of mentioning in front, soft/direct-cut operation all is to provide the moment of network service to finish in mobile radio station (terminal) and service.In soft handover, mobile radio station (terminal) has just begun when not interrupting with old base station communication and the communicating by letter of new base station.Soft handover can only use under adjacent C DMA frequency range has the situation of identical frequency assignments, and it has the otherness of forward traffic channel and backward current amount channel at the base station boundary.Direct-cut operation usually occurs in the following moment: disjoint base station service area, different Frequency Distribution, different frequency range types, different frame deviations etc.
Control channel is discerned at interval with the length of comparing 64 data blocks with 0 skew control (PN) sequence.Support effectively and reliably to switch for knowing clearly, the control skew is grouped into different set, and each set has all been described and the relevant state of control set search:
1. initiatively set (Active Set): the control skew of Forward CDMA Channel (having received calling channel or forward traffic channel).
2. candidate collection (Candidate Set): still do not belong to the initiatively control signal of set, receive (show relevant forward traffic channel can by smooth demodulation) with certain intensity but be moved station (terminal).
3. neighbours' set (Neighbor Set): might become the control channel skew of handoff candidate.The member of neighbours' set is existed by the base station " neighbor list information ", " expansion neighbor list information " reach " general neighbor list information " the middle appointment.
4. other set (Remaining Set): all in the current system do not belong to initiatively set, other control channel skews in candidate collection and the neighbours' set.
If the control channel skew in a particular neighbor or other set is greater than control channel detecting lower limit T_ADD, then that control channel will be added into candidate collection, and mobile radio station (terminal) can transmit control channel strength measurement message (PSMM) to the base station.If to such an extent as to one is initiatively gathered control channel skew and reduces surpassing and be lower than control channel in the time period that Handoff Drop Timer crosses time value T_TDROP and abandon upper limit T_DROP, mobile radio station (terminal) will send PSMM to the base station. and the base station can be responded with a switch indicating information PSMM message, have only those control channels that are included in this message to continue to remain on, or move into initiatively set.Also do not have expiredly if the switching relevant with a control channel abandons timer, then this channel can be moved into candidate collection; If it is expired that this switching abandons timer, then this channel can move into neighbours' set; If the intensity of a candidate collection control channel is being lower than the T_DROP value above on the time period of T_TDROP length, mobile radio station (terminal) will move to this control channel neighbours' set.
In the time of initial, all control channels of in neighbor list information, enumerating have been comprised in neighbours' set.For the control channel in this set is upgraded, mobile radio station (terminal) can be that control channel keeps an aging counter in each neighbours' set. control channel from initiatively set or candidate collection newly enter neighbours when gathering this counter initial value be 0.Whenever receiving a neighbor list updating message, all neighbours gather the relevant counter of control channel all can add 1.Should will move on to other set from neighbours' set by the correspondence control channel if this Counter Value has surpassed NGHBR_MAX_AGE, and also have another to send the mechanism of PSMM message by mobile radio station (terminal) simultaneously.If candidate collection control channel signals intensity surpasses and initiatively to gather control channel signals intensity and reach " initiatively gather candidate collection reduced parameter T_COMP*0.5dB " then mobile radio station (terminal) will send PSMM message to the base station.
Search dispatching refers to the sequential of carrying out strength test for the control channel in 4 set.In order to maximally utilise the limited hardware resource of mobile radio station (terminal), the control channel search can be distinguished order of priority according to the set member.(as, initiatively the control channel strength test in the set just can be the twice that neighbours gather control channel strength test frequency) and also the control channel in a given set can also further sort by priority.This is operated in has been applied for by name in November, 1996 by people such as Padovani " control signal search technique in the cell mobile communication systems " United States Patent (USP) (NO.5,577,022).This patent describes that mobile radio station (terminal) is in initiatively set, and candidate collection has safeguarded also on the basis of neighbours' set that a priority ratio neighbours set will high PRE-candidate collection.This notion is by name what delivered by people such as Mekkoth on November 28th, 2000 " first search of control channel set in the cdma communication system " patent further developed in (.No.6,154,455).This patent describes that mobile radio station (terminal) is also safeguarded preferential neighbours' set and abandoned set except initiatively set beyond candidate collection and the neighbours' set.High priority is searched for set and is comprised initiatively set, candidate collection, and preferential neighbours gather, and abandon the member of set, and its search priority will be higher than the member of neighbours' set.
Summary of the invention:
The present invention relates to a kind of method of control channel search, this method can produce more excellent set and safeguard.This searching algorithm is constructed based on a kind of mode: initiatively the interval of set search is not more than the maximum of some appointments.After having satisfied this restriction, the search of neighbours' set just can be frequent as much as possible.This is based on the understanding of the following fact: frequent variations is understood in the multipath time migration usually in typical mobile communication environment.In order to safeguard acceptable communication link quality, receiver must be followed the trail of these just in the variation of the control channel of demodulation as far as possible, it is necessary that thereby the demand that makes us becomes: it is frequent as much as possible initiatively to gather control channel search needs, the number of control channel is irrelevant in its frequency and the neighbours' set. further, in order effectively to utilize possible search hardware resource as much as possible, initiatively set, candidate collection and neighbours' set are divided into 2 respectively again, 2 and 3 subclass, the benefit of these technology utilize search hardware resource minimum in the mobile radio station (terminal) to realize the decline of drop rate exactly.
Search dispatching is dynamic, depend on the search time of control channel in the set, the control channel number in the set and the intensity of these channels. given control channel normally receives in several time migrations, and each skew is all relevant with a control channel multipath.Therefore, searching for its scope for each control channel should be a PN deviation range (search window), thereby the energy of finding in all multipaths of this window is formed the energy norm of this control channel by adding up, network provides the size of search window in system parameter message.SRCH_WIN_A has defined the window width of initiatively set and candidate collection, and SRCH_WIN_N has defined the window width that neighbours gather.
The present invention compares with background technology, and the method for control channel search can produce more excellent set and safeguard that this searching algorithm is constructed based on a kind of mode: initiatively the interval of set search is not more than the maximum of some appointments.After having satisfied this restriction, the search of neighbours' set just can be frequent as much as possible.In order effectively to utilize possible search hardware resource as much as possible, initiatively set, candidate collection and neighbours' set are divided into 2 respectively again, 2 and 3 subclass, the benefit of these technology utilize search hardware resource minimum in the mobile radio station (terminal) to realize the decline of drop rate exactly.
Description of drawings:
Fig. 1 is the searcher system schematic.
Fig. 2 is a control channel signals intensity schematic diagram.
Embodiment:
Fig. 1 has described the framework of an example search system.Mcontroller makes search hardware with specified accuracy (being the skew of 1/4 data block in exemplary systems) the certain PN offset window of search, and returns the energy sum of specifying (being 4 in the exemplary systems) several multipaths that energy is the highest of maximum number in the corresponding control channel.
Search dispatching has comprised the combination that initiatively set of explanation, candidate collection, neighbours' set and other set are searched for according to the order of sequence; Searched channel number in each set also has been described simultaneously in a preset time section.The example of a search combination is: AACNNNNR, and being illustrated in the given search loop has 2 initiatively to gather control channel respectively, 1 candidate collection control channel, 4 neighbours gather control channel and 1 other set control channel is searched.This form is taked in search combination usually, but the control channel number of each set depends on as introducing size that search box size and initiatively set, candidate collection and neighbours gather below.Control channel in a given set is searched in the mode of circulation, and how this order sorts by priority relevant with set inside.For instance, if neighbours set has the member of 8 equal priority, then utilizing above-mentioned search to make up all neighbours' control channels can be in two circulation searched one time.
The maintenance of search combination: the window size that search combination and network provide, the control channel set sizes is relevant.Therefore, when receiving the neighbor list messages of system parameters message or any kind, when (various) switching was finished, the search combination all needed to upgrade.
Minimum interval between the active set search of different rounds, being called Active_Search_Interval again is that system's pressure is necessary. we are according to thinking that in the experience in this field 40 milliseconds interval can provide the performance that is close to the best.Yet in exemplary systems, searcher can be tested maximum 32 different hypothesis simultaneously.Search precision was 1/2 data block time, and such hardware operation just can cover the search window of 16 data block times.The more important thing is, thereby hardware need stay for some time a specific hypothesis and enables to obtain the energy norm of enough accuracy.In exemplary systems, this time of staying was 2048 data block times.Therefore, when window was on a grand scale, the restriction on the hardware made that 40 milliseconds time demand have to semi-coast.Exemplary systems is according to initiatively gathering control channel window scale (Win_Size_A, by SRCH_WIN_A decision) and neighbours gather the value that control channel window scale (Win_Size_N is by the SRCH_WIN_N decision) sum and following rule are provided with Active_Search_Ihterval:
| Window scale sum (data block time) | Active_Search_Interval (millisecond) |
| Win_Size_A+Win_Size_N<＝120 | 40 |
| 120<Win_Size_A+Win_Size_N<＝ 160 | 50 |
| 160<Win_Size_A+Win_Size_N | 60 |
Searched control channel number is determined by following rule in each set in a search round:
1) initiatively set: the control channel number in initiatively gathering;
2) candidate collection: the number of control channel in the candidate collection mostly was for 2 (being called Candidate_Search_Number) most.
3) neighbours set: its number depends on has can be searched in the time interval that initiatively set and candidate collection are searched for for how many control channels, and its computing formula is as follows:
Neighbor_Search_Number＝floor((Active_Search_Interval-
Candidate_Search_Time)/Time_Search_Single_Neighbor)
Herein, Candidate_Search_Time=
Candidate_Search_Number＊Time_Search_Single_Candidat
e.
When the result less than 1 the time, establish Neighbor_Search_Number and equal 1 (this has broken the minimum interval that different rounds initiatively gather between the search slightly and has required).
4) other set: when window scale or control set were small, remaining space just was used to search for the control channel in other set in search dispatching:
Remaining_Search_Number＝floor((Active_Search_Interval-
Candidate_Search_Time-
Neighbor_Search_Time)/Time_Search_Single_Remaining).
Herein, Neighbor_Search_Time=
Neighbor_Search_Number＊Time_Search_Single_Neighbor.
When the result less than 0 the time, Remainder_Search_Number is set equals 0.
The Dynamic Maintenance of control channel priority: what searcher resource the search combination determined to have be used to initiatively set, candidate collection, neighbours' set and other set.We manage the searcher resource further, and active set, candidate collection, neighbours' set according to priority are divided into 2,2 and 3 subclass respectively.This division has determined the specific control channel in the given set can by how searched continually.In two-stage priority, priority is that its searched frequency of control channel of 1 will be that priority is the twice of 2 control channel.In three grades of priority, priority is that its searched frequency of control channel of 1 will be that priority is three times of 3 control channel, and priority is that its searched frequency of control channel of 2 will be that priority is the twice of 3 control channel.For instance, suppose neighbours gather have 7 members N (1) ..., N (7), and suppose that these members carry out priority packet by the following stated: high priority subsets has two members { NP1 (1), NP1 (2) }, medium priority has three members { NP2 (1), NP2 (2), NP2 (3) }, low priority has two members { NP3 (1), NP3 (2) }. and we have four neighbours' set at hypothesis in the search combination, all control channels in neighbours' set will be recycled search with following order:
NP1(1)，NP1(2)，NP2(1)，NP2(2)，
NP2(3)，NP1(1)，NP1(2)，NP2(1)，
NP2(2)，NP2(3)，NP1(1)，NP1(2)，
NP3(1)，NP3(2)，...repeat........，
Each row representative is herein taken turns neighbours searched in the search at each and is gathered control channel.
Searcher hardware only surpasses under the sufficiently high situation of some threshold values in the signal strength signal intensity that detects a multipath just can report its existence.In exemplary systems, the threshold value that we set to active set and candidate collection is-19dB that lower threshold value-21dB has then been adopted in neighbours' set and other set.It is to think to detect quickly the transmission signals of base station at a distance that lower threshold value is taked in neighbours' set and other set.
For the priority arrangement of set, we have adopted a kind of algorithm, and it is continuing not detect the priority that can reduce this control channel under the situation of multipath energy lentamente.In case the multipath of this channel is found, its priority will obtain rapidly increasing, and concrete value is decided by concrete Search Results.We observe most of neighbours and gather control channel and detect less than the multipath energy in the times in the overwhelming majority in this field, in amount we do not want too much searching resource is put into continue to detect less than the control of energy channel on.From another point of view, in case found the control channel energy, we will closely monitor this channel.
In order to realize our prioritization idea, we are that the control channel in each initiatively set, candidate collection, the neighbours' set has defined a survival value (Alive value), its span is 0 to 8. to be added into neighbours when gathering when a new control channel, and its survival value is initialized to maximum 8.In the process that set is safeguarded, when this channel was transferred to other set, its survival value did not change.The survival value of control channel every will be according to following Policy Updates after taking turns search:
If do not find multipath, then survival value subtracts 1 (up to minimum value 0).If not, just the intensity addition of relevant multipath with controlled channel strength.According to following Policy Updates:
If intensity less than-18dB and at present survival value less than 2 then to establish survival value be 2.Other situations are calculated min{38+2*Pilot_Strength, the value of 8}.If should be worth, then establish survival value and be this value greater than present survival value.
If do not find energy on basic then survival value subtracts 1, if but found energy and the survival value that calculates according to Fig. 2 piecewise linear curve greater than present survival value, then upgrade survival value to the value that obtains from curve.
According to survival value, sort according to the following rules in set inside:
● initiatively set:
Rank 1: survival value〉1 and initiatively set abandon timer and do not have expired.
Rank 2: every other situation.
● candidate collection:
Rank 1: survival value〉1
Rank 2: every other situation
● neighbours' set:
Rank 1: survival value〉4
Rank 2: survival value〉0
Rank 3: every other situation
The priority of control channel can periodically be upgraded.In exemplary systems, set safeguards after every four-wheel control channel search and carries out, and the control channel prioritization is upgraded then every the wheel and all will be carried out after searching for.
What need understand is: the foregoing description is just illustrative to the present invention, rather than limitation of the present invention, and any innovation and creation that do not exceed connotation of the present invention all fall within the scope of protection of the present invention.
Claims (1)
1, the method for a kind of control of cdma communication set search dispatching is characterized in that: the concrete steps of search dispatching:
The first step: the survival value of each control channel in definition active collection, Candidate Set, the neighbor set:
1, each control channel survival value in collection, Candidate Set, the neighbor set initiatively, its span is 0 to 8, when a new control channel is added into neighbours when gathering, its survival value is initialized to maximum 8;
2, in the process that set is safeguarded, when this control channel was transferred to other set, its survival value did not change;
3, the survival value of control channel every will be according to following Policy Updates after taking turns search:
(1) if do not find multipath, then survival value subtracts 1, up to minimum value 0;
(2) if not, just the intensity addition of relevant multipath with controlled channel strength, according to following Policy Updates:
If a intensity less than-18dB and at present survival value less than 2 then to establish survival value be 2;
B, other situations are calculated min{38+2*Pilot_Strength, and the value of 8} if should be worth greater than present survival value, is then established survival value and is this value;
If c does not find energy then survival value subtracts 1, if but found energy and the survival value that calculates according to piecewise linear curve greater than present survival value, then upgrade survival value to the value that obtains from curve;
Second step: according to survival value, sort according to the following rules in set inside:
1, initiatively collect:
Rank 1: survival value〉1 and Active Set abandon timer and do not have expired;
Rank 2: every other situation;
2, Candidate Set:
Rank 1: survival value〉1;
Rank 2: every other situation;
3, neighbor set:
Rank 1: survival value〉4;
Rank 2: survival value〉0;
Rank 3: every other situation;
The priority of control channel can periodically be upgraded, every take turns the search after all to carry out;
The 3rd step:, determine specific control channel meeting by how searched continually according to the search priority of the pilot tone in active collection, Candidate Set, the neighbor set:
1, in two-stage priority, priority is that its searched frequency of control channel of 1 will be that priority is the twice of 2 control channel;
2, in three grades of priority, priority is that its searched frequency of control channel of 1 will be that priority is three times of 3 control channel, and priority is that its searched frequency of control channel of 2 will be that priority is the twice of 3 control channel;
The 4th step: searcher is in search procedure, judge some pilot tones whether searched to: searcher hardware only surpasses in the signal strength signal intensity that detects a multipath component can report just under the sufficiently high situation of predetermined threshold that it exists, and will take lower threshold value to neighbours' set and other set;
The 5th step: searched control channel number is determined by following rule in each set in a search round:
1, the control channel number in the active set;
2, the number of searched control channel in the Candidate Set mostly is 2 most;
3, the number of searched control channel in the neighbor set: its integer is that a kind of computing (Neighbor_Search_Number) depends on and has how many control channels can be searched in the time interval of Active Set and Candidate Set search, and its computing formula is as follows:
(1) searched control channel number=round numbers in the neighbor set ((initiatively gather scouting interval-candidate collection search time)/single required time of neighbours' control channel of search), herein, searched control channel number * searches for the single required time of candidate's control channel in Candidate Set search time=Candidate Set;
(2) when the result less than 1 the time, get " in the neighbor set searched control channel number " and equal 1;
(3) other set: when window size or control set were small, the remaining time just was used to search for the control channel in other set in the search dispatching:
Searched control channel number=round numbers in a, other set ((initiatively gather scouting interval-candidate collection search time-neighbours gather search time)/search for the single required time of other control channels);
Herein, neighbours gather the search time=neighbours set in searched control channel number * search for the single required time of neighbours' control channel;
B, when the result less than 0 the time, get " searched control channel number in other set " and equal 0;
The 6th step: adopted system to force necessary " Active Set scouting interval " as the minimum interval between the Active Set search of different rounds.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB031429289A CN100521591C (en) | 2003-06-25 | 2003-06-25 | Method of controlling aggregate searching dispatching of CDMA communication |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB031429289A CN100521591C (en) | 2003-06-25 | 2003-06-25 | Method of controlling aggregate searching dispatching of CDMA communication |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1479469A CN1479469A (en) | 2004-03-03 |
| CN100521591C true CN100521591C (en) | 2009-07-29 |
Family
ID=34155727
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB031429289A Expired - Fee Related CN100521591C (en) | 2003-06-25 | 2003-06-25 | Method of controlling aggregate searching dispatching of CDMA communication |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100521591C (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2007019800A1 (en) * | 2005-08-17 | 2007-02-22 | Zte Corporation | Method of configuring and searching high speed shared control channel of multi carrier cell |
| CN100461917C (en) * | 2006-01-10 | 2009-02-11 | 中兴通讯股份有限公司 | Method for searching multiple high-speed shared control channel of multiple carrier cell mobile terminal |
-
2003
- 2003-06-25 CN CNB031429289A patent/CN100521591C/en not_active Expired - Fee Related
Also Published As
| Publication number | Publication date |
|---|---|
| CN1479469A (en) | 2004-03-03 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| KR100495687B1 (en) | Method of and apparatus for merging pilot neigibor lists in a mobile telephone system | |
| JP4250666B2 (en) | Seamless handoff system and method | |
| KR100259907B1 (en) | Mobile station | |
| CN1143582C (en) | Method and system for soft handoff control based on access network capacity | |
| KR100388924B1 (en) | Control method of searching neighboring cells, mobile station, and mobile communication system | |
| KR100398784B1 (en) | Information management method for cell search in mobile communications system, cell search method of mobile station, mobile communications system, mobile station, base station and control station | |
| WO2005107312A1 (en) | System selection in wireless communications networks | |
| US20060084390A1 (en) | Measurement reporting in a telecommunication system | |
| US20020049058A1 (en) | Enhancement of soft handoff in a mobile wireless network through the use of dynamic information feedback from mobile users | |
| EP2911453B1 (en) | Updating UMTS Enhanced dedicated-channel active set | |
| KR20000070599A (en) | Method and apparatus for performing soft hand-off in a wireless communication system | |
| US20070293235A1 (en) | Congestion Control Method For Wireless Communication System and Base Station Control Apparatus | |
| KR100441701B1 (en) | Communication terminal and wireless communication method | |
| KR20010022094A (en) | A method of and apparatus for selecting base stations to communicate with a remote station | |
| KR20030043916A (en) | Handoff adaptation for cdma systems | |
| WO1999043177A1 (en) | Measurement reporting in a telecommunication system | |
| US20150271688A1 (en) | Enhanced dedicated-channel reporting for umts | |
| CN100521591C (en) | Method of controlling aggregate searching dispatching of CDMA communication | |
| US6633556B1 (en) | Mobile communications system and mobile communications method | |
| KR20070036379A (en) | Set maintenance method and apparatus for a mobile terminal in a mobile communication | |
| Leu et al. | Discrete-time analysis of soft handoff in CDMA cellular networks | |
| CN2687965Y (en) | Control aggregate search schedule system for CDMA communication | |
| Dropmann et al. | Architecture of a multi-cell centralized packet access system | |
| JP3570398B2 (en) | Method for adjusting missing section in mobile station, method for controlling handoff speed of wireless communication system, and mobile station | |
| KR100276483B1 (en) | Method for adding and dropping active base station in a soft hand-off for mobile communication system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| 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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20090729 Termination date: 20150625 |
|
| EXPY | Termination of patent right or utility model |