CN100568758C - Multi-path searching method for multiple mobile station - Google Patents
Multi-path searching method for multiple mobile station Download PDFInfo
- Publication number
- CN100568758C CN100568758C CNB2005100985625A CN200510098562A CN100568758C CN 100568758 C CN100568758 C CN 100568758C CN B2005100985625 A CNB2005100985625 A CN B2005100985625A CN 200510098562 A CN200510098562 A CN 200510098562A CN 100568758 C CN100568758 C CN 100568758C
- Authority
- CN
- China
- Prior art keywords
- time
- coh
- search
- travelling carriage
- cycle
- 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
The invention discloses the multi-path searching method for multiple mobile station in a kind of moving communicating field, comprise the steps: step 1, relevant, the noncoherent accumulation length of customization; Step 2, customized searches cycle; Step 3, start-up time of each travelling carriage is set; Step 4, loop cycle are carried out Multipath searching.Adopt the method for the invention, can choose different integration periods different travelling carriages, and the search cycle do not influence the setting of integration lengths, can improve the flexibility that integration lengths is provided with greatly, thereby improve search performance.
Description
Technical field
The invention belongs to field of mobile communication, relate in particular to the realization of many travelling carriages Multipath searching in the broadband CDMA system.
Background technology
In the mobile communication technology in modern times, Wideband CDMA Technology more and more is subjected to using widely, and for base station (NodeB), the Multipath searching technology is the important step that its reception is achieved.General Multipath searching is handled operating procedure (as shown in Figure 1) as described below:
1) 101 read the antenna data operation: the function of this operating procedure is to read the needed data of this associative operation from the antenna buffer memory, and the data that read are written in the associative operation data storage;
2) 102 local scrambler sequence generating runs: the function of this operating procedure is the conjugate sequence that generates corresponding scrambler in the antenna data, and this conjugate sequence added expand to handle--add that to expand the spreading code (OVSF) chosen identical with spreading code in the antenna data, be written in the scrambler memory of associative operation generating scrambler sequence well;
3) 103 associative operations: the function of this operating procedure is that the local scrambler sequence of the generation of data that step 101 is read back and step 102 multiplies each other;
4) 104 de-spreading operations: the function of this operating procedure is the result of step 103 to be carried out addition by the spreading factor size handle;
5) 105 coherent accumulations operation: the function of this operating procedure is that pilot tone (pilot) data division among the result of step 104 is gone the symbol addition, and the coherent accumulation result is written among the coherent accumulation storage RAM;
6) 106 noncoherent accumulations operation: the function of this operating procedure is that the result of each time 105 is asked addition behind the mould, the result after the addition is written to noncoherent accumulation stores among the RAM;
7) 107 output functions as a result: the function of this operating procedure is that the final result of noncoherent accumulation is written among the output RAM, so that carry out follow-up other processing.
In practice, a base station usually communicates with a plurality of travelling carriages (UE), and this just need carry out Multipath searching to all UE that insert.By the principle of radio communication as can be known, the physical characteristic of wireless channel changes not quite within a certain period of time, does not change no better than, therefore all the time the multipath of same UE is searched for regard to unnecessary, can be interrupted periodically and search for.That is to say, in one section special time, a certain UE is carried out Multipath searching, and just can not carry out Multipath searching in the period to this UE at ensuing another section, this section free time just can be used for other UE is carried out Multipath searching, promptly is to utilize time-multiplexed notion to come the UE of all accesses is carried out Multipath searching.
In the prior art, be to be time division multiplexinges (as shown in Figure 2) such as object carries out with UE, for example, suppose that base station and 4 UE communicate, then the search cycle is divided into four sections, each UE utilizes a section in the cycle to search for, 201 time periods search UE
0, 202 time periods search UE
1, 203 time periods search UE
2, 204 time periods search UE
3Therefore, the time period that these 4 UE are carried out Multipath searching equates, time-division multiplexing method such as can be called.In 201,202,203,204 separately time periods four/one-period, UE is searched for processing by Multipath searching treatment step recited above.When next cycle arrives by the time, in the identical time period four/one-period, carry out new once search again.
In general, integration lengths (coherent accumulation length and noncoherent accumulation length are long-pending) is shorter, and performance is just not ideal.In the prior art, often only after finishing, could search for the integration of certain UE other UE, time-multiplexed method such as this makes that the flexibility that integration lengths is provided with is relatively poor, because it is oversize that the integration lengths of certain UE obtains, make the whole search cycle elongated, when next cycle arrives by the time, the multipath characteristics of possible UE correspondence changes already, if integration lengths is established too shortly, though the search cycle has shortened, but the data volume that can utilize in each search is less, makes that the Search Results performance may be not ideal.
Summary of the invention
To the objective of the invention is the unfavorable shortcoming of the performance of bringing owing to the search cycle is dumb that exists in the prior art in order overcoming, to propose the multi-path searching method for multiple mobile station that a kind of search cycle is more flexible, search performance is better.
In order to realize the foregoing invention purpose, the present invention proposes a kind of multi-path searching method for multiple mobile station, comprising:
Step 1, relevant, the noncoherent accumulation length of customization;
Step 2, customized searches cycle, the described search cycle is to be defined in certain time period travelling carriage is carried out Multipath searching, this time period is called search time with respect to this travelling carriage, this travelling carriage is not carried out Multipath searching in the other time period, this time period is called non-search time with respect to this travelling carriage, and the described search cycle is the coherent accumulation length of travelling carriage;
Step 3, start-up time of each travelling carriage is set, specifically comprises:
(1) starts many travelling carriages, initialization system t0 start-up time, current system time tcurrent;
(2) started a common I travelling carriage, the search cycle of travelling carriage is T, the 0th, 1 ..., the coherent accumulation length of an I-1 travelling carriage be respectively coh0, coh1 ..., cohI-1,
If (tcurrent-t0) %T is more than or equal to (coh0+coh1+...+cohI-1), then be tcurrent+T-((tcurrent-t0) %T)+(coh0+coh1+...+cohI-1) start-up time of I travelling carriage,
If (tcurrent-t0) %T is less than (coh0+coh1+...+cohI-1), then be tcurrent+ ((coh0+coh1+...+cohI-1)-((tcurrent-t0) %T)) start-up time of I travelling carriage.
The search cycle of all travelling carriages is identical, this search cycle be search time and non-search time and;
Described search time and non-search time unit is-symbol, time slot or frame.
Adopt multi-path searching method for multiple mobile station provided by the invention, can choose different integration periods to different UE, and the search cycle do not influence the setting of integration lengths, can improve the flexibility that integration lengths is provided with greatly, thereby can improve search performance greatly.The present invention makes many UE with the search that hockets of coherent accumulation length, because coherent accumulation length is generally all very short, makes search reach similar degree of concurrence.In addition, because the length of noncoherent accumulation is not subjected to the restriction of search cycle, can improve search performance greatly.
Description of drawings
Fig. 1 is existing general Multipath searching operational flowchart;
Fig. 2 is the Multipath searching schematic diagram that waits time-division multiplexing method;
Fig. 3 is a multi-path searching method for multiple mobile station flow chart of the present invention;
Fig. 4 is many UE parallel search method search cycle, relevant, incoherent configuration schematic diagram.
Embodiment
Below in conjunction with embodiment the method for the invention is described further.
In the method for the invention, comprised the customization of three major criterions, one is relevant noncoherent accumulation length customization, one is the search cycle customization, also has one to be setting start-up time of each UE.Wherein, customization principle relevant, the customization of noncoherent accumulation length is: utilize the result that will make search relevant, noncoherent accumulation length of customization to satisfy false footpath probability restriction under the different communication scene of 3GPP regulation, the different signal interference ratio situation, the unit of coherent accumulation length is " symbol ", the noncoherent accumulation long measure is " inferior ", promptly be to how many " inferior " coherent accumulations as a result energy value carry out noncoherent accumulation.
And the method for customizing of search cycle is: " search cycle " is exactly to be defined in certain time period certain UE is carried out Multipath searching (this time period is called search time with respect to this UE), this UE is not carried out Multipath searching (this time period is called non-search time with respect to this UE) in the other time period, search time and non-search time are based on UE comparatively speaking, the search time of certain UE with respect to other UE with regard to right and wrong search times.Search time and non-search time unit can is-symbols (symbol), also can be time slots (slot), can also be frame (frame).The search cycle customization is exactly that concerning a certain UE, search time, length was exactly the length of its coherent accumulation, but not just equaled sum search time of other UE search time, if UE to the different UE design search cycles separately
0, UE
1..., UE
NCoherent accumulation length be respectively Coh
0, Coh
1..., Coh
N, then be Coh Dui Ying search time (active)
0, Coh
1..., Coh
N, be Coh corresponding non-search time (inactive)
1+ Coh
2+ ...+Coh
N, Coh
0+ Coh
2+ ...+Coh
N, Coh
0+ Coh
1+ Coh
3+ ...+Coh
N..., Coh
0+ ...+Coh
N-2+ Coh
N, the cycle of all UE is identical, also is active
0+ inactive
0=active
1+ inactive
1=...=active
N+ inactive
N
For being provided with start-up time of each UE, the concrete grammar that the time is provided with is: the start-up time of each UE and search cycle are relevant with the UE coherent accumulation length that has started, suppose to start 0,1 ..., common I the UE of I-1, the system start-up time is t
0(chronomere is consistent with the coherent accumulation long measure), current system time are t
CurrentIf, (t
Current-t
0) % (active+inactive) is more than or equal to (coh
0+ coh
1+ ...+coh
I-1), then be tcurrent+ (active+inactive)-((tcurrent-t0) % (active+inactive))+(coh the start-up time of UEI
0+ coh
1+ ...+coh
I-1), if (t
Current-t
0) % (active+inactive) is less than (coh
0+ coh
1+ ...+coh
I-1), UE then
IStart-up time be t
Current+ ((coh
0+ coh
1+ ...+coh
I-1)-((t
Current-t
0) % (active+inactive)));
In 304 described steps, carry out the loop cycle Multipath searching by the general Multipath searching operating procedure described in " background technology ".
Come the specific embodiment of the present invention is described below in conjunction with an example.In this example, suppose to search for altogether 3 UE, be respectively UE
0, UE
1, UE
2:
Relevant, the customization of noncoherent accumulation length specifically are customized to:
The coherent accumulation length C oh0 of customization UE0 is that the coherent accumulation length C oh1 of 2slots, UE1 is that the coherent accumulation length C oh2 of 1slot, UE2 is 1slot, and the noncoherent accumulation length of UE0, UE1, UE2 is respectively 2,3,1;
2) " search cycle " customization specifically is customized to:
The active0=Coh0 of UE0, inactive0=Coh1+Coh2, the active1=Coh1 of UE1, inactive1=Coh0+Coh2, the active2=Coh2 of UE2, inactive2=Coh0+Coh1;
3) be provided with the start-up time of each UE, specifically be set to:
If system start-up time t0=0, current time tcurrent=0, at first start UE0, then be tcurrent-((tcurrent-t0) % (active0+inactive0))=0 start-up time of UE0, then start UE1, be tcurrent+Coh0-((tcurrent-t0) % (active1+inactive1))=Coh0=2 the start-up time of UE1, start UE2 at last, be tcurrent+Coh0+Coh1-((tcurrent-t0) % (active2+inactive2))=Coh0+Coh1=3 the start-up time of UE2;
4) carry out the loop cycle Multipath searching by the general Multipath searching operating procedure described in " background technology ", the order of search is: slot#0～1 (UE0)-slot#2 (UE1)-slot#3 (UE2)-slot#4～5 (UE0)-slot#6 (UE1)-slot#7 (UE2) ... (" slot#0～1 (UE0) " is illustrated in the 0th, 1 time slot UE0 is carried out Multipath searching).The scouting interval circulation of UE0: slot#0～1, slot#4～5, slot#8～9......; The scouting interval circulation of UE1: slot#2, slot#6, slot#10......; The scouting interval circulation of UE2: slot#3, slot#7, slot#11......;
By this example as can be seen, UE0, UE1, UE2 short period class replace search, because alternate cycle is shorter, can be similar to and regard 3 UE as and carrying out parallel search, the search cycle is only relevant with coherent accumulation length, and it is irrelevant with noncoherent accumulation length, 3 UE choose different integration periods, and integration period and search cycle are irrelevant, compare with former technical scheme, improve the flexibility that integration lengths is provided with greatly, thereby can improve search performance greatly.
Claims (2)
1, a kind of multi-path searching method for multiple mobile station is characterized in that comprising:
Step 1: customization is relevant, noncoherent accumulation length;
Step 2: customized searches cycle, the described search cycle is to be defined in certain time period travelling carriage is carried out Multipath searching, this time period is called search time with respect to this travelling carriage, this travelling carriage is not carried out Multipath searching in the other time period, this time period is called non-search time with respect to this travelling carriage, the described search cycle be a plurality of travelling carriages coherent accumulation length and;
Step 3: be set the start-up time of each travelling carriage, specifically comprise:
(1) starts many travelling carriages, initialization system t start-up time
0, current system time t
Current
(2) started a common I travelling carriage, the search cycle of travelling carriage is T, the 0th, 1 ..., the coherent accumulation length of an I-1 travelling carriage is respectively coh
0, coh
1..., coh
I-1,
If (t
Current-t
0) %T is more than or equal to (coh
0+ coh
1+ ...+coh
I-1), then be t the start-up time of I travelling carriage
Current+ T-((t
Current-t
0) %T)+(coh
0+ coh
1+ ...+coh
I-1),
If (t
Current-t
0) %T is less than (coh
0+ coh
1+ ...+coh
I-1), then be t the start-up time of I travelling carriage
Current+ ((coh
0+ coh
1+ ...+coh
I-1)-((t
Current-t
0) %T)).
2, multi-path searching method for multiple mobile station as claimed in claim 1 is characterized in that, the search cycle of all travelling carriages is identical, this search cycle be search time and non-search time and;
Described search time and non-search time unit is-symbol, time slot or frame.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2005100985625A CN100568758C (en) | 2005-09-02 | 2005-09-02 | Multi-path searching method for multiple mobile station |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2005100985625A CN100568758C (en) | 2005-09-02 | 2005-09-02 | Multi-path searching method for multiple mobile station |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1925343A CN1925343A (en) | 2007-03-07 |
| CN100568758C true CN100568758C (en) | 2009-12-09 |
Family
ID=37817843
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2005100985625A Expired - Fee Related CN100568758C (en) | 2005-09-02 | 2005-09-02 | Multi-path searching method for multiple mobile station |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100568758C (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101937437B (en) * | 2009-06-30 | 2011-11-16 | 华为技术有限公司 | Search method, device and system |
-
2005
- 2005-09-02 CN CNB2005100985625A patent/CN100568758C/en not_active Expired - Fee Related
Also Published As
| Publication number | Publication date |
|---|---|
| CN1925343A (en) | 2007-03-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN1238984C (en) | Cell searching apparatus and method for supporting multi search function in mobile communication system | |
| JP4282901B2 (en) | Method and apparatus for transmitting information regarding synchronization status of base station | |
| KR100732382B1 (en) | Apparatus and method of obtaining a preamble in an orthogonal frequency division multiple access mobile terminal | |
| US9198149B2 (en) | Two-step searcher for cell discovery | |
| US7512173B2 (en) | Low I/O bandwidth method and system for implementing detection and identification of scrambling codes | |
| KR20100044913A (en) | Communications in an asynchronous wireless network | |
| CN105075354A (en) | Synchronization signal design for wireless devices in a long range extension mode | |
| CN101578810A (en) | Method for generating downlink frame, and method for searching cell | |
| US7197645B2 (en) | Low I/O bandwidth method and system for implementing detection and identification of scrambling codes | |
| CN1655640A (en) | Apparatus and method for estimating initial frequency offset in an asynchronous mobile communication system | |
| KR100360729B1 (en) | Radio receiving device and diffusion code identification method | |
| CN100568758C (en) | Multi-path searching method for multiple mobile station | |
| CN103313276B (en) | The method and apparatus of cell blind Detecting | |
| CN101310455B (en) | Monolithic Rake receiver and receiving method | |
| JP2001346239A (en) | Mobile wireless communication equipment and cell search method | |
| KR100855917B1 (en) | Method and apparatus for efficient use of communication resources in a communication system | |
| CN101958727B (en) | Relative method and device for downlink pilot time slot search | |
| CN1458756B (en) | Data buffer storage method and device for broadband code division multiple access multipath diversity receiver | |
| CN101714890B (en) | Method and device for improving searching accuracy of SYNC code by two-frame data | |
| JP3443060B2 (en) | Synchronization acquisition device and synchronization acquisition method | |
| JP2000174662A (en) | Synchronization acquisition method and system for mobile station in asynchronous system between ds-cdma base stations | |
| JP2000138615A (en) | Method for capturing synchronization and device therefor | |
| CN101997567A (en) | Method and device for identifying base station identify code | |
| KR100544021B1 (en) | Method For Initial Synchronous Acquisition In The DS-CDMA System | |
| KR19990074141A (en) | How to allocate PN offset and capture PN code in CDMA mobile communication network |
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 | ||
| C41 | Transfer of patent application or patent right or utility model | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20151126 Address after: Dameisha Yantian District of Shenzhen City, Guangdong province 518085 Building No. 1 Patentee after: SANECHIPS TECHNOLOGY Co.,Ltd. Address before: 518057 Nanshan District high tech Industrial Park, Guangdong, South Road, science and technology, ZTE building, legal department Patentee before: ZTE Corp. |
|
| EE01 | Entry into force of recordation of patent licensing contract |
Application publication date: 20070307 Assignee: Xi'an Chris Semiconductor Technology Co.,Ltd. Assignor: SANECHIPS TECHNOLOGY Co.,Ltd. Contract record no.: 2019440020036 Denomination of invention: Multi-path searching method for multiple mobile station Granted publication date: 20091209 License type: Common License Record date: 20190619 |
|
| EE01 | Entry into force of recordation of patent licensing contract | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20091209 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |