CN1505416A - System information receiving and reassembling method in the third generation wireless communication system - Google Patents
System information receiving and reassembling method in the third generation wireless communication system Download PDFInfo
- Publication number
- CN1505416A CN1505416A CNA021536120A CN02153612A CN1505416A CN 1505416 A CN1505416 A CN 1505416A CN A021536120 A CNA021536120 A CN A021536120A CN 02153612 A CN02153612 A CN 02153612A CN 1505416 A CN1505416 A CN 1505416A
- Authority
- CN
- China
- Prior art keywords
- time
- reception
- sib
- segmentation
- chained list
- 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.)
- Granted
Links
Images
Abstract
The invention relates to system information receiving and recombining method in the third generate wireless communication system, which is used to compensate that there is only the open space interface data structure between current system information broadcast and the terminal reception, and there has no concrete segment broadcast and reception recombining method. The invention uses current system frame number and MIB information to calculate the first or full segment position, forms the reception position table, maintains the table with different modes: includes adding or deleting some joint, and recalculates SIB segment position, repeat this step until the table is empty.
Description
Technical field
The present invention relates to third generation wireless communication system (3G) technology, the system information that relates to UE-RRC (subscriber equipment-Radio Resource control module) specifically receives recombination method.
Background technology
System information reception technique, that is system broadcast message reception technique.
System message roughly refers to the common information of certain sub-district or whole RNS (RNS), rather than the information of certain specific UE.The system message of Wideband Code Division Multiple Access (WCDMA) (WCDMA) system specifically comprises: NAS (Non-Access Stratum) system message and the UE various timer sum counter message under idle pulley or connection mode; URA ID (UTRAN access net registration district sign); The parameter of cell selecting and sub-district gravity treatment; The parameter of the public physical channel in sub-district; The system uplink disturbed condition; DRAC (Dynamic Resource Allocation for Multimedia control) information; Measuring control information; UE assist location information; GPS navigation information; The information of neighbor cell etc.
The model of system message broadcasting be by wireless access network (UTRAN) by broadcast channel to subscriber equipment (UE) broadcast system message.Wireless access network (UTRAN) sends system information burst or cascade, the recovery of recombinating again after the user does not receive fully.
Because system message has a lot, be divided into System information block (SIB:system informationblock) by characteristic, each SIB comprises the system information of same characteristic, has mainly comprised the timer sum counter that UE needs as SIB1 under idle pulley, and different SIB has different characteristics.
The structure of the similar tree of system message.Root node is main message blocks (MIB:masterinformation block), and main message blocks (MIB) comprises the schedule information of some System information block SIB and 1 to 2 Scheduling Block (SB:scheduling blocks).Each SB can comprise many System information block SIB again.
The method that UE reads broadcast is: read the MIB that has clearly been stipulated receiving position by agreement earlier, analyze information contained in the MIB then, it mainly is the schedule information of each SIB and SB, according to these schedule informations, UE just can determine remove to read (demodulation coding) broadcast channel when.
Each SIB repeats on broadcast channel, does not need UE to go to repeat to read, and after UE runs through needed System information block SIB, has not needed to read broadcast channel in theory again, and just RRC can stop to receive broadcast channel.But, when certain or when all broadcasting SIB and change, UE just must read new broadcast message, promptly after the broadcast of RNC is upgraded, while transmitting system updating message on paging channel, the RRC of subscriber equipment just can start physical layer and carry out broadcast and receive after receiving system update message, reads the SIB that has upgraded.
System information block SIB one has 29 types.System information block SIB is by the system message transmission, and the size of a system message is subjected to the restriction of physical layer transmission channel BCH and FACH transmission block size, that is to say that a SIB may need to be divided into several system messages and transmit.
The RRC of wireless access network (UTRAN) end is responsible for segmentation and cascade, system information before sending earlier through the ASN.1 coding, if the length behind the coding greater than the length of a System information block, UTRAN just carries out segment processing to it; If the length behind the coding is less than the length of a System information block, UTRAN just need link up several System information block levels.
System message after the segmentation has four types, and wherein three kinds of segmentations that are used to transmit SIB or MIB a kind ofly are used to transmit complete SIB or MIB.Each segmentation all is made up of paragraph header and segment data two parts, and paragraph header wherein includes total segments of system message, is used for segment type and segment index that unique appointment belongs to which kind SIB, and segment data wherein is the system message behind the coding.As above information has been arranged, and UE just can assemble the System information block that reduction UTRAN sends (SIB).And tell UE can receive SIB when, by which system frame number SFN, then do by the schedule information that is included among MIB or the SB.
In the 3GPP agreement, recombinate for the system information broadcast of wireless access network (UTRAN) and the reception of subscriber equipment (UE), only stipulate an open air interface data structure, do not provided the concrete segmentation broadcasting of UTRAN end and the reception recombination method of UE end.
Summary of the invention
The objective of the invention is: at the definition of the air broadcast interface of present 3GPP (third generation International Standards Organization) for the system information data structure, the specific implementation method that a kind of 3G system information receives reorganization is proposed, make UE-RRC under broadcast channel Block Error Rate condition with higher, still can finish the reception reorganization of system information fast and stable.
Because a plurality of System information blocks of WCDMA send according to deployment position after the segmentation of transmit leg UTRAN side, so system information block is multiplexing in the segmentation of different SIB in time.
According to above-mentioned principle, UE effectively receives SIB need solve following several problem:
1. high efficiency sends because SIB is a repeatability, and UE just should stop to receive this SIB, until the latest edition that receives next SIB after receiving the latest edition of a certain SIB;
2. rapidity, in order to shorten the SIB time that receives, UE-RRC should be able to all types of SIB of parallel receive, avoid these SIB of serial received;
3. stability is taking place should only to have influence on the SIB of fragment loss under mistake piece or the dropout of data block situation (recipient does not do to confirm to broadcasting, can not guarantee that the recipient necessarily receives success), and should shadow to reception to other SIB.
For achieving the above object, the system information that the invention provides in a kind of third generation wireless communication system receives recombination method, and base is characterised in that and comprises following treatment step:
A. by agreement regulation initializing variable, prepare to receive MIB;
B. receive all the SIB schedule informations among the MIB, calculate the time of reception of the segmentation that each SIB of current time will receive, by size sequence arrangement become one the time of reception sequential chained list;
C. after receiving a BCH transmission block, judge whether its time of reception drops within the window of current time and the SIB segmentation time of reception that next should receive in the sequential chained list time of reception or equate outside the window or with the SIB segmentation time of reception that next should receive;
D. for the BCH transmission block that is within the described window, do to ignore processing, keep the size order of each SIB segmentation time of reception in the sequential chained list time of reception constant;
When the time of reception of E. current reception BCH transmission block equals the time of reception of the SIB segmentation that next should receive, receive this BCH transmission block, the time of reception of this SIB segmentation in the time of reception sequential chained list is left out, with by judging whether this SIB segmentation is last segmentation of this SIB, the butt joint time receiving is carved with the preface chained list and makes amendment;
F. for the BCH transmission block that is in outside the described window, the Xiang Yingyou that finds out the BCH transmission block of losing loses the SIB of segmentation, and restarts receiving course, generates the sequential chained list time of reception that upgrades.
System information of the present invention receives recombination method, by generate the sequential chained list time of reception (CV_SFN_TABLE represents with variable R) and in receiving course to time of reception in the chained list interpolation and the deletion of (also claiming node, system frame number SFN), realize whole reorganization receiving course, realized efficient, fast and stablize three characteristics.
The inventive method has realized the reception of all SIB by a maintenance sequential chained list time of reception; Provided a kind of windowing mechanism, under the situation of delivery 4096, relatively the front and back of different system frame number (or claiming time of reception) in proper order; Ordering to this sequential chained list provides with reference to current time of reception and above-mentioned windowing mechanism.
Maintenance to sequential chained list comprises: under the best circumstances, when the time of reception of the BCH transmission block that receives is exactly in the time of next should receiving the time of reception of SIB, only need to delete first node in the chained list, after promptly receiving this SIB segmentation, to no longer include the segmentation positional information of this SIB in the chained list, algorithm is also no longer handled the corresponding segments of this SIB.After initialization, when this chained list was sky once more, expression received, and can stop to receive.
As newly-increased SIB, the BCH transmission block that perhaps ought receive drops on needs to restart the SIB receiving course outside the window, when perhaps successfully receiving the non-last segmentation of of SIB, can be by its time of reception of algorithm computation (SIB_RCV_SFN represents with variable), and SIB_RCV_SFN added in the chained list.Because chained list is orderly, can improve search efficiency greatly, the time of reception of chained list first node is a minimum value, uses query time hardly with respect to common chained list, just can receive the SIB segmentation that nearest needs receive by simple deletion and interpolation in addition, realize all SIB parallel receives.
When some BCH transmission block is lost, only can influence the reception of losing SIB, restart affected SIB schedule information, can not influence the reception of whole SIB.
Method of the present invention is in conjunction with the System Frame Number (CUR_SFN) of current reception BCH piece, each SIB schedule information that safeguard to need is received by terminal equipment (UE) (contain cycle SIB_REP, segmented index SIB_RCV_IDX, segmentation position SIB_POS[SIB_RCV_IDX]) is obtained the segmentation time of reception (SIB_RCV_SFN) that the nearest needs of SIB separately receive respectively.By sequential chained list the segmentation time of reception (SIB_RCV_SFN) that these need receive is effectively organized then.By it being deleted and adding, realized the reception regrouping process of whole system information.
In whole receiving course, only there is a segmentation position of the concern of needing most in this chained list, to safeguard among each SIB that need receive.Packet loss for PCCPCH channel Block Error Rate when higher, abnormal conditions such as wrong bag do not need to be concerned about too much that subsequent segment is to restarting the influence of a certain SIB receiving course.The inventive method makes the reception of each SIB walk abreast in time, when a SIB takes defeat, only by deletion in time of reception sequential chained list with increase node, just can realize the restarting of receiving course of this SIB, can not have influence on the reception of other SIB.
Description of drawings
Fig. 1 is when receiving a BCH transmission block that drops on outside the receive window, and first kind of sequential chained list structural representation time of reception that restarts behind the receiving course illustrated the situation that restarts front and back respectively by Figure 1A and Figure 1B;
Fig. 2 is when receiving a BCH piece that drops on outside the receive window, and second kind of sequential chained list structural representation time of reception that restarts behind the receiving course illustrated the situation schematic diagram that restarts front and back respectively by Fig. 2 A and Fig. 2 B;
Fig. 3 is that time of reception is positioned at the inside and outside deterministic process schematic block diagram of window in the windowing mechanism of the present invention;
Fig. 4 is the annotation to Fig. 3, and when importing three mutual unequal time of reception S1, S2, S3, S2 drops on three kinds of situations between S1, the S3 window, is illustrated by Fig. 4 A, Fig. 4 B and Fig. 4 C respectively;
Fig. 5 is initialization MIB of the present invention and the processing procedure that receives the MIB schedule information, by Fig. 5 A initial reception MIB list structure is shown, and Fig. 5 B illustrates the MIB schedule information that receives, and Fig. 5 C illustrates the reception list structure that generates according to the MIB schedule information that receives;
Fig. 6 is a scheduling processing procedure schematic diagram of the present invention, by Fig. 6 A the MIB schedule information that receives is shown, and is illustrated according to the MIB schedule information that receives by Fig. 6 B, and receives the sequential chained list structure time of reception that the back generates at SIB2.
Embodiment
Implement the process of technical solution of the present invention from the explanation of following three aspects.
One. at first need variable is carried out initialization process, comprise following 4 aspects:
1. the schedule information of each SIB correspondence of initialization.
For each SIB,, all contain following variable according to 25.331 standard to describe: the position (time of reception) of receiving cycle SIB_REP, the segments SIB_COUNT that comprises and each segmentation, use array SIB_POS[] expression.For there being VALUE to revise the SIB of mechanism, corresponding VALUE_TAG is arranged.In addition, also should have to receive segmented index variable SIB_RCV_IDX, show should receive which segmentation this moment, its initial value is the time of reception of first segmentation that next should receive, SIB_RCV_IDX=0 during initialization; With reception segmentation present place periodic key variable SIB_RCVREP_IDX, show this segmentation is in which cycle in whole system frame number (SFN) scope [0..4094] (getting even number), can calculate by following formula: SIB_RCVREP_IDX=SFN/SIB_REP rounds acquisition after removing.
Receiving cycle SIB_REP=128 for example, current SFN=267, then the Dui Ying present place of reception segmentation periodic key variable SIB_RCVREP_IDX is 2.For example, current SFN=18, then SIB_RCVREP_IDX=0.
2. initialization MIB schedule information.According to the 3GPP air interfaces specify, first segmentation of MIB or a complete segmentation should send in the place of SFN mod 8=0.Fragment Offset SIB_OFFSET=2, showing then should be continuous between the segmentation if any segmentation.By its cycle is 8 to show and mostly be 4 segmentations most (agreement does not stipulate clearly that MIB whether can segmentation, but because receiving cycle is 8, each segmentation takies 2 frames, thereby can not be greater than 4 segmentations.Under the situation that takies 4 segmentations, then the BCH time resource is almost all accounted for by MIB, and other SIB will not have resource to send.Therefore during practical application, MIB is generally a complete segmentation).For any one SIB, initially should begin to receive from first segmentation.Therefore its schedule information initialization of variable is as follows:
Receiving cycle SIB_REP=8;
Segments SIB_COUNT=4; (supposing to have at most 4 segmentations, is a complete segmentation in the follow-up example)
Each segmentation time of reception position (time) SIB_POS[0]=0, SIB_POS[1]=2, SIB_POS[2]=4, SIB_POS[3]=6;
The VALUE_TAG of MIB is changed to illegal value INVALID_VALUE;
Receive segmented index SIB_RCV_IDX and be changed to 0;
Receive segmentation place periodic key SIB_RCVREP_IDX and be changed to illegal value INVALID_VALUE;
The time of reception variable SIB_RCV_SFN that next should receive segmentation is changed to illegal value INVALID_VALUE, shows the indeterminate BCH transmission block that receives on which SFN this moment.
3. the SFN variable PRE_SFN=INVALID_VALUE during previous reception BCH transmission block.The SFN variable CUR_SFN=INVALID_VALUE of current reception BCH piece shows that current time of reception SFN is for unknown.
4. initialization sequential chained list time of reception RCV_SFN_TABLE is empty NULL.This chained list is that the ascending order of the next one of all SIB correspondences that need the receive position SIB_RCV_SFN that receive segmentation is arranged.First node should be time of reception (position) CUR_SFN that the next one should receive the BCH transmission block among the chained list RCV_SFN_TABLE.Can be according to windowing mechanism, will be before this BCH transmission block of (in conjunction with CUR_SFN, and under delivery 4096 meanings) abandon.
Last figure among Fig. 5 A, the MIB schedule information according to the agreement regulation can get receiving cycle SIB_REP=8, side-play amount OFFSET=0.Figure below among Fig. 5 A is to receive list structure in conjunction with the initialization that current time CUR_SFN=4 makes, and MIB does not have segmentation here, has only a M, 0 complete segmentation.
Two. receive mib information, and generate the sequential chained list time of reception according to the mib information that receives.
For example, receive SIB schedule informations all among the MIB, for:
MIB：?????SEG_COUNT＝1，????SIB_REP＝8，??????SIB_POS(0)＝0；
SIB1：????SEG_COUNT＝1，????SIB_REP＝128，????SIB_POS(0)＝2；
SIB2：????SEG_COUNT＝1，????SIB_REP＝128，????SIB_POS(0)＝4；
SIB3：????SEG_COUNT＝1，????SIB_REP＝128，????SIB_POS(0)＝18；
SIB5：SEG_COUNT＝5，SIB_REP＝64，SIB_POS(0)＝30；SIB_POS(1)＝42；SIB_POS(2)＝44；SIB_POS(3)＝46；SIB_POS(4)＝62；
SIB7：SEG_COUNT＝1，SIB_REP＝16，SIB_POS(0)＝6；
SIB11：SEG_COUNT＝5，SIB_REP＝128，SIB_POS(0)＝26；SIB_POS(1)＝34；SIB_POS(2)＝36；SIB_POS(3)＝50；SIB_POS(4)＝52。
According to segmentation number SEG_COUNT, receiving cycle SIB_REP and the segmentation position array SIB_POS () of above-mentioned each SIB, can discharge following SIB sequential tabulation:
| ????0 | ???2 | ????4 | ????6 | ????8 | ????10 | ????12 | ????14 | ||||||||
| ????M | ???s1 | ????s2 | ????s7 | ????M | |||||||||||
| ????16 | ???18 | ????20 | ????22 | ????24 | ????26 | ????28 | ????30 | ||||||||
| ????M | ???s3 | ????s7 | ????M | ????S11.0 | ????s5.0 | ||||||||||
| ????32 | ???34 | ????36 | ????38 | ????40 | ????42 | ????44 | ????46 | ||||||||
| ????M | ???s11.1 | ????s11.2 | ????s7 | ????M | ????s5.1 | ????s5.2 | ????s5.3 | ||||||||
| ????48 | ???50 | ????52 | ????54 | ????56 | ????58 | ????60 | ????62 | ||||||||
| ????M | ???s11.3 | ????s11.4 | ????s7 | ????M | ????s5.4 | ||||||||||
| ????64 | ???66 | ????68 | ????70 | ????72 | ????74 | ????76 | ????78 | ||||||||
| ????M | ????s7 | ????M | |||||||||||||
| ????80 | ???82 | ????84 | ????86 | ????88 | ????90 | ????92 | ????94 | ||||||||
| ????M | ????s7 | ????M | ????s5.1 | ||||||||||||
| ????96 | ???98 | ????100 | ????102 | ????104 | ????106 | ????108 | ????110 | ||||||||
| ????M | ????s7 | ????M | ????s5.1 | ????s5.2 | ????s5.3 | ||||||||||
| ????112 | ???114 | ????116 | ????118 | ????120 | ????122 | ????124 | ????126 | ||||||||
| ????M | ????s7 | ????M | ????s5.4 |
Only relate to even frame totally 128 frames (repeating) in the table at 4096 intercycles, as in the table 0,2,4,6,8 ..., shown in 124,126.M represents MIB.S1, S2, S3, S5, S7, S11 represent SIB1, SIB2, SIB3, SIB5, SIB7, SIB11 respectively.
Wherein the segmentation number of MIB is 1, expression does not have segmentation (not being expressed as M.O for ease of understanding), receiving cycle SIB_REP is 8, thereby in above-mentioned time-scale, on 0,8,16,24,32,40,48,56,64,72,80,88,96,104,112,120 frames, receive MIB (increasing progressively) since 0 by 8.
Wherein, the segmentation number of SIB1, SIB2, SIB3, SIB7 is 1, expression does not have segmentation (not being expressed as s1.0, s2.0, s3.0, s7.0 for ease of understanding), their receiving cycle is respectively 128,128,128 and 16, and their segmentation position array is respectively 2,4,18,6, so in above-mentioned time-scale, s1 receives at the 2nd frame, s2 receives at the 4th frame, and s3 receives at the 18th frame, and s7 receives (increasing progressively since 6 by 18) at the 6th, 22,38,54,70,86,102,118 frames.
Wherein, SIB5, SIB11 segmentation number are 5, and expression respectively has 5 segmentation: s5.0, s5.1, s5.2, s5.3, s5.4 and s11.0, s11.1, s11.2, s11.3, s11.4.The receiving cycle of SIB5 is 64, their segmentation position array is respectively 30,42,44,46,62, so in above-mentioned time-scale, s5.0 receives (increasing progressively since 30 by 64) at the 30th, the 94th frame, s5.1 receives (increasing progressively since 42 by 64) at the 42nd, the 106th frame, s5.2 receives (increasing progressively since 44 by 64) at the 44th, the 108th frame, and s5.3 receives (increasing progressively since 46 by 64) at the 46th, the 110th frame, and s5.4 receives (increasing progressively since 62 by 64) at the 62nd, the 126th frame.
In like manner, the receiving cycle of SIB11 is 128, and their segmentation position array is respectively 26,34,36,50,52, so in above-mentioned time-scale, s11.0 receives at the 26th frame, s11.1 receives at the 34th frame, s11.2 receives at the 36th frame, and s11.3 receives at the 50th frame, and s11.4 receives at the 52nd frame.
Cun sequence table can be simplified to the schedule information shown in Fig. 5 B and handle schematic diagram during above-mentioned SIB.After when SFN=8, receiving MIB shown in the figure, obtained being carried on the schedule information of each system information among the MIB.
According to all SIB schedule informations that receive, according to current time CUR_SFN=8, calculate SIB1, SIB2, SIB3, SIB5, first segmentation that SIB7, SIB11 will receive or the time (position) of a complete segmentation, be respectively: 130,132,18,30,22,26, with these receiving positions by size order (relatively big or small) by 4096 deliverys add in the sequential chained list time of reception (RCV_SFN_TABLE), generation the time of reception sequential chained list shown in Fig. 5 C.As can be seen, first node is the position 18 (RCV_SFN) that next user terminal needs the SIB3 that receives from this ascending order chained list, and minimum increases progressively successively; SIB1 and SIB2 can only receive at next cycle.
Size order in the time of reception sequential chained list be with the current time (being made as S1) be reference, in conjunction with window judgment mechanism definition of the present invention.In conjunction with referring to Fig. 3 and Fig. 4 A, 4B, 4C.Because system frame number SFN is at 4096 deliverys, therefore can not be simply by the size of SFN relatively decide a certain SFN whether be in by within two windows that SFN constituted or outside.For any three mutual in twos unequal System Frame Number S1, S2, S3, S2 whether drop within the window that S1 and S3 constitute or outside can judge by Fig. 3 process.For current time S1, S2 is equivalent to S2 less than S3 and falls among the window of S1 and S3.
Step 31 is imported three mutual in twos unequal SFN:S1, S2, and S3 is reference with S1;
Step 32 judges that whether S2 is greater than S1;
Step 33 as S2 during greater than S1, judges that further S2 is whether less than S3 or judge that whether S3 is less than S1;
Step 34, if S2 is greater than S1, and S2 during less than S1, judges that S2 is within the window that is made of S1 and S3 less than S3 or S3;
Step 35, if S2 is greater than S1, but S2 is not less than S3 or S3 when being not less than S1, judges that S2 is not within the window that is made of S1 and S3, promptly is in outside the window;
Step 36, as S2 during less than S1, further judge S2 whether less than S3 and S3 whether less than S1;
Step 37, if S2 is less than S1, and S2 during less than S1, judges that S2 is within the window that is made of S1 and S3 less than S3 and S3;
Step 38, if S2 is less than S1, and S2 judges that S2 is not within the window that is made of S1 and S3 when being not less than S3 and S3 and being not less than S1, promptly is in outside the window.
Among the present invention, be equivalent between " S2 is positioned at S1 and S3 " " with current time S1 is reference, and S2 is less than S3 ", promptly from time shaft S1, S2, S3 sequence arrangement from left to right.This is the judgment criterion of sequential chained list order, also is the SFN judgment criterion of using when receiving a BCH transmission block.
S2 is shown respectively among Fig. 4 drops on (S1, S3) three kinds of possible cases within the window.Among Fig. 4 A, in same 4096, S1 is less than S2, and S2 is less than the situation of S3 (S1＜S2, and S2＜S3).Among Fig. 4 B, in two 4096, S1 is less than S2, and S3 is less than the situation of S1 (S1＜S2, and S3＜S1).Among Fig. 4 C, in two 4096, S1 is less than S3, and S2 is less than the situation of S3 (S2＜S3＜S1).In addition, be S2 and fail to drop on that (S1 is S3) within the window.
Can adopt following program to carry out windowing mechanism during enforcement and judge, judge promptly whether SFN2 is in (3 SFN are unequal mutually in twos, and all belong to interval [0..4094], (getting even number)) between SFN1 and the SFN3 herein.
IF (SFN1＜SFN2) IF ((SFN2＜SFN3) || (SFN3＜SFN1)) SFN2 is between SFN1, the SFN3;＜!--SIPO＜DP n=" 10 "〉--〉＜dp n=" d10 "/ELSE SFN2 is not between SFN1, the SFN3; IF ({ the IF ((﹠amp of SFN2＜SFN3) of SFN2＜SFN1); Amp; ﹠amp; Amp; (SFN3＜SFN1)) SFN2 is between SFN1, the SFN3; ELSE SFN2 is not between SFN1, the SFN3;
Three. after receiving a BCH transmission block, the time CUR_SFN (S2) that needs to judge current reception BCH transmission block whether the time of reception PRE_SFN of previous BCH transmission block (S1) and expect should the formed window of time of reception RCV_SFN (S3) within outside or equal, be S2 whether be in (S1, S3) among the window outside or equate (S2 equals S3);
If CUR_SFN (S2) is within PRE_SFN (S1) and RCV_SFN (S3) window, then ignore this BCH transmission block, the maintenance sequential chained list time of reception is constant;
If CUR_SFN (S2) equates that with RCV_SFN (S3) (this is the reception condition of wishing, also be best situation), then receive this BCH transmission block, promptly leave out its node (first node in the chained list) the sequential chained list from the time of reception, need verify by segmented index and current periodic key of living in this moment, whether this segmentation that is promptly received is last segmentation of its SIB, and whether decision is docked the time receiving and be carved with preface chained list RCV_SFN_TABLE and handle then.Comprise: when this segmentation that is received is not last segmentation of its SIB, need recomputate the time of reception (position) of this next segmentation of SIB, and order is inserted among the chained list RCV_SFN_TABLE time of reception by size; And work as the segmentation that is received when being last segmentation of this SIB, promptly this SIB has received reorganization and has finished, and then only leaves out its node the sequential chained list RCV_SFN_TABLE from the time of reception to get final product;
If CUR_SFN (S2) is in outside PRE_SFN (S1) and RCV_SFN (S3) window, showing has transmission certainly to lose this moment, should find out the SIB that Xiang Yingyou loses segmentation, restarts its receiving course.Two kinds of different situations are arranged, respectively as shown in Figure 1 and Figure 2.
Among Figure 1A be one the time of reception sequential chained list RCV_SFN_TABLE, the CUR_SFN=200 of chained list, SIB1,0=258; SIB3,0=274; SIB5,1=234; SIB7,0=214; SIB11,2=292, RCV_SFN=214 are minimum values wherein.Receive a BCH transmission block SFN=268 who drops on outside the window, will be from chained list less than 268 node 214,234,258 deletions, restarted the receiving course of SIB7, SIB5 and SIB1, recomputate corresponding SIB7, SIB5, the SIB_RCV_SFN of SIB1, be respectively 278 (s7,0), 296 (s5,0), 386 (s1,0), and by size is inserted in the ascending order chained list, shown in Figure 1B in proper order.That restart is affected SIB, does not influence other SIB, as 274 (s3,0), 292 (s11,2).In Figure 1B chained list, leave out, then calculate the segmentation time of reception 296 (s5 that its next one should receive because of 234 (s5,1), 0) (though the variation of SIB parameter is very slow, but still may change, so the SIB segmentation of different cycles assembles together, may cause decoding error).This moment chained list current time CUR_SFN=268, next first should receive the time PRE_SFN=274 (s3,0) of segmentation.
Among Fig. 2 A, be one with the sequential chained list RCV_SFN_TABLE time of reception identical shown in Figure 1A, CUR_SFN=200 in the chained list, SIB1,0=258; SIB3,0=274; SIB5,1=234; SIB7,0=214; SIB11,2=292, RCV_SFN=214 are minimum values wherein.Receive a BCH transmission block SFN=274 who drops on outside the window, and with SIB3 in the chained list, 0=274 equates, will be from chained list less than 274 node 214,234,258 deletions, restarted the receiving course of SIB7, SIB5 and SIB1, but received SIB3 (promptly leaving out) simultaneously, recomputate corresponding SIB7, SIB5, the SIB_RCV_SFN of SIB1, be respectively 278 (s7,0), 296 (s5,0), 386 (s1,0), and order is inserted in the ascending order chained list by size, at this moment the CUR_SFN=274 of chained list, PRE_SFN=278 (s7,0).In like manner, leave out, then calculate the segmentation time of reception 296 (s5,0) that its next one should receive because of 234 (s5,1).After this process finishes, receive only remaining 4 nodes in the chained list, promptly also need corresponding 4 SIB of reception, each node is corresponding one by one with the segmentation of each SIB that also need receive.
After receiving a BCH transmission block, all need upgrade CUR_SFN and the PRE_SFN in the chained list and recomputate corresponding SIB_RCV_SFN during enforcement.Concrete operations are as follows:
If RCV_SFN=CUR_SFN receives this BCH piece, change step 4 over to and handle;
If CUR_SFN (PRE_SFN, RCV_SFN) between (under 4096 delivery meanings), then show needn't receive this moment, ignore this BCH, directly return and wait for next BCH transmission block;
If CUR_SFN (PRE_SFN, RCV_SFN) outside (under 4096 delivery meanings), show that have fragment loss this moment.Should search the SIB that fragment loss is arranged, and restart the receiving course of this SIB, change step 5 over to and handle;
Step 5 is differentiated each node in the chained list successively, comprising:
For being between PRE_SFN and the CUR_SFN (under delivery 4096 meanings), show that this SIB has fragment loss, delete this node, restart the receiving course of this SIB;
When finding that a certain node equates with CUR_SFN, show that needs receive this BCH transmission block, change step 4 over to and handle;
When finding that a certain node is in outside PRE_SFN and the CUR_SFN (under delivery 4096 meanings), think that this BCH transmission block should not receive, and directly returns.
After receiving the BCH transmission block, in the time of need restarting the receiving course of a certain SIB, operation as follows:
TEMP_OFFSET＝SIB_POS[0]-(CUR_SFN?mod?SIB_REP)；
IF(TEMP_OFFSET＞0)
SIB_RCV_SFN＝CUR_SFN+TEMP_OFFSET；
ELSE
SIB_RCV_SFN＝CUR_SFN+TEMP_OFFSET+SIB_REP；
SIB_RCV_SFN＝SIB_RCV_SFN?mod?4096；
Step 5 is added its SIB_RCV_SFN among the chained list RCV_SFN_TABLE to;
Step 6 is calculated this SIB receiving cycle index SIB_RCVREP_IDX=SIB_RCV_SFN/SIB_REP.
Receive certain SIB arbitrarily-process of individual segmentation (representing) with the i segmentation, comprising:
Step 5 is in conjunction with CUR_SFN, SIB_REP, SIB_POS[i], upgrade its SIB_RCV_SFN, calculate by the method in the step 4 of the aforementioned receiving course that restarts a certain SIB;
Step 6, and its SIB_RCV_SFN added among the chained list RCV_SFN_TABLE;
Step 7 is calculated this SIB receiving cycle index SIB_RCVREP_IDX=SIB_RCV_SFN/SIB_REP.
When receiving MIB or SB, do special processing at schedule information, comprising:
Referring to Fig. 6 A and 6B, after each SIB schedule information receives, as shown in Figure 6A, suppose that SIB2 receives, from chained list, delete SIB2,0=260 recomputates each SIB_RCV_SFN, as the relevant block S1 among Fig. 6 A, 0=2; S3,0=18; S5,1=42; S7,0=6; S11,2, result of calculation is respectively SIB1,0=258; SIB3,0=274; SIB5,1=234; SIB7,0=214; SIB11,2=292 (SIB2 this moment needn't calculate), in the result who sorts by size in the chained list shown in Fig. 6 B, the CUR_SFN=200 of setting.
Method of the present invention according to the current time, in conjunction with the schedule information of SIB, calculates the receiving position of corresponding first segmentation of each SIB (or complete segmentation), and it is added in the ascending order chained list behind the initialization chained list;
After receiving a SIB segmentation, promptly delete first node in the sequential chained list, and again the corresponding receiving position of next segmentation of this SIB is added in this sequential chained list;
A certain SIB receives, and will no longer comprise the segmentation positional information of this SIB correspondence in this chained list, also no longer handles the corresponding segments of this SIB, has stopped the continuation of this SIB is received;
After initialization, if sequential chained list is empty, expression receives, and then stops the receiving course (receive a new MIB up to needs, restart this receiving course) to all SIB;
When transmits data packets is lost, need restart the receiving course of affected SIB, but receiving, not affected SIB do not need to do any change, when being some dropout of data block, only can have influence on corresponding SIB receives, on method, just restart affected SIB schedule information, can not influence the reception of whole SIB;
When increasing a SIB newly or restarting SIB reception or needs next segmentation of reception (successfully receiving non-last segmentation of SIB), can calculate its time of reception (SIB_RCV_SFN represents with variable) by respective algorithms, and SIB_RCV_SFN is added into chained list;
Because time of reception chained list (representing with RCV_SFN_TABLE) is a sequential chained list, has improved search efficiency greatly; Because this chained list first segmentation is minimum value, uses query time hardly with respect to common chained list; In addition, can receive the SIB segmentation that nearest needs receive, realize the parallel receive of all SIB by simple deletion and interpolation.
Claims (11)
1. the system information in the third generation wireless communication system receives recombination method, it is characterized in that comprising following treatment step:
A. by agreement regulation initializing variable, prepare to receive MIB;
B. receive all the SIB schedule informations among the MIB, calculate the time of reception of the segmentation that each SIB of current time will receive, by size sequence arrangement become one the time of reception sequential chained list;
C. after receiving a BCH transmission block, judge whether its time of reception drops within the window of current time and the SIB segmentation time of reception that next should receive in the sequential chained list time of reception or equate outside the window or with the SIB segmentation time of reception that next should receive;
D. for the BCH transmission block that is within the described window, do to ignore processing, keep the size order of each SIB segmentation time of reception in the sequential chained list time of reception constant;
When the time of reception of E. current reception BCH transmission block equals the time of reception of the SIB segmentation that next should receive, receive this BCH transmission block, the time of reception of this SIB segmentation in the time of reception sequential chained list is left out, with by judging whether this SIB segmentation is last segmentation of this SIB, the butt joint time receiving is carved with the preface chained list and makes amendment;
F. for the BCH transmission block that is in outside the described window, the Xiang Yingyou that finds out the BCH transmission block of losing loses the SIB of segmentation, and restarts receiving course, generates the sequential chained list time of reception that upgrades.
2. the system information in the third generation wireless communication system according to claim 1 receives recombination method, it is characterized in that: the initialization in the described steps A, the schedule information variable that comprises each SIB correspondence of initialization, initialization MIB schedule information variable, the time of reception variable of current reception BCH piece and the initialization sequential chained list time of reception.
3. the system information in the third generation wireless communication system according to claim 2 receives recombination method, it is characterized in that: each SIB of described initialization and MIB schedule information variable comprise receiving cycle, segments, segmentation position array at least, receive segmented index, receive segmentation place periodic key; The time of reception variable of current reception BCH piece is unknown; With allow time of reception sequential chained list for empty.
4. system information in the third generation wireless communication system according to claim 1 receives recombination method, it is characterized in that: among the described step B, the time of reception of described segmentation is each SIB first segmentation that will receive or the time of reception of a complete segmentation; Record current time in the sequential chained list the described time of reception, and its first position is the time of the terminal SIB segmentation that next should receive, and value is minimum, increases progressively successively then.
5. the system information in the third generation wireless communication system according to claim 1 receives recombination method, it is characterized in that: the time of reception among the described step B is sequence arrangement by size, be that maximum at System Frame Number adds 1 delivery again and carries out, and be reference with the current time, combined window mechanism is judged.
6. the system information in the third generation wireless communication system according to claim 1 receives recombination method, it is characterized in that: the judgement among the described step C is within the window or outside the window, be that maximum at System Frame Number adds 1 delivery again and carries out, and be reference with the current time, combined window mechanism is judged.
7. receive recombination method according to the system information in claim 5 or the 6 described third generation wireless communication systems, it is characterized in that described is reference with the current time, and combined window mechanism is judged, comprising:
Importing three mutual unequal time of reception S1, S2, S3, is S1 with the current time;
When S1 less than S2, and S2 is less than S3 or S3 during less than S1, perhaps is not less than S2 as S1, and S2, is judged as S2 and is within the window of S1 and S3 during less than S1 less than S3 and S3;
When S1 less than S2, and S2 is when being not less than S3 or S3 and being not less than S1, perhaps is not less than S2 as S1, and S2 is judged as S2 and is in outside the window of S1 and S3 when being not less than S3 and S3 and being not less than S1.
8. the system information in the third generation wireless communication system according to claim 1 receives recombination method, it is characterized in that in the described step e, by judging whether this SIB segmentation is last segmentation of this SIB, butt joint is carved with the preface chained list makes amendment in the time receiving, further comprise:, then only do to leave out the operation of this SIB segmentation time of reception in the sequential chained list time of reception as if last segmentation that this SIB segmentation is this SIB; If last segmentation that this SIB segmentation is not this SIB, then recomputate the time of reception of the next segmentation of this SIB segmentation, and order is inserted in the sequential chained list time of reception by size, and the current time of sequential chained list is revised as the time that receives this BCH transmission block with the time of reception.
9. receive recombination method according to the system information in claim 1 or the 7 described third generation wireless communication systems, it is characterized in that: in the described step e, judge that whether this SIB segmentation is that last segmentation of this SIB is verified by segmented index and current periodic key of living in.
10. the system information in the third generation wireless communication system according to claim 1 receives recombination method, it is characterized in that described step F further comprises:
When each time of reception in the time of reception of this BCH transmission block and the time of reception sequential chained list is unequal, leave out in the sequential chained list time of reception time of reception less than all SIB segmentations of this BCH transmission block time of reception, but recomputate the time of reception of these SIB segmentations of leaving out, and it is the current time with the time of reception of this BCH transmission block, these time of receptions that recomputate are inserted in the sequential chained list time of reception, sequence arrangement generates the sequential chained list time of reception that upgrades by size;
When the time of reception of this BCH transmission block when a certain time of reception in the time of reception sequential chained list equates, receive this BCH transmission block, leave out its time of reception the sequential chained list from the time of reception, but with its time of reception is the current time, recomputate the time of reception of these SIB segmentations of leaving out, these time of receptions that recomputate are inserted in the sequential chained list time of reception, and sequence arrangement generates the sequential chained list time of reception that upgrades by size.
11. the system information in the third generation wireless communication system according to claim 1 receives recombination method, it is characterized in that: after the schedule information of steps A initialization MIB, when the described time of reception, sequential chained list was empty, receive, stop receiving course to all SIB, receive a new MIB up to needs, restart its receiving course.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 02153612 CN1245842C (en) | 2002-11-29 | 2002-11-29 | System information receiving and reassembling method in the third generation wireless communication system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 02153612 CN1245842C (en) | 2002-11-29 | 2002-11-29 | System information receiving and reassembling method in the third generation wireless communication system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1505416A true CN1505416A (en) | 2004-06-16 |
| CN1245842C CN1245842C (en) | 2006-03-15 |
Family
ID=34235221
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 02153612 Expired - Fee Related CN1245842C (en) | 2002-11-29 | 2002-11-29 | System information receiving and reassembling method in the third generation wireless communication system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN1245842C (en) |
Cited By (27)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1327725C (en) * | 2004-08-27 | 2007-07-18 | 华为技术有限公司 | Method for realizing system information 7 in 3G system |
| WO2007098676A1 (en) * | 2006-03-03 | 2007-09-07 | Huawei Technologies Co., Ltd. | A method for reassembling data in wireless communication system and an apparatus thereof |
| WO2009076803A1 (en) * | 2007-12-12 | 2009-06-25 | Zte Corporation | Method for sending, transmitting and scheduling system message in long term evolution system |
| WO2009092303A1 (en) * | 2008-01-08 | 2009-07-30 | Huawei Technologies Co., Ltd. | System information scheduling method, device and terminal |
| WO2009097753A1 (en) * | 2008-02-03 | 2009-08-13 | Huawei Technologies Co., Ltd. | Method, system and terminal for realizing system information schedule |
| WO2010000119A1 (en) * | 2008-07-03 | 2010-01-07 | 中兴通讯股份有限公司 | Transmitting method of system information |
| WO2010017734A1 (en) * | 2008-08-14 | 2010-02-18 | 华为技术有限公司 | Method for acquiring system information, and communication system and mobile terminal thereof |
| CN101822116A (en) * | 2007-08-09 | 2010-09-01 | 诺基亚西门子通信公司 | Mobile communication terminal, communication station, communication network, and communication method |
| CN101114869B (en) * | 2006-07-26 | 2010-10-20 | 大唐移动通信设备有限公司 | System message block scheduling method and device in UMTS system |
| WO2011029271A1 (en) * | 2009-09-11 | 2011-03-17 | 中国移动通信集团公司 | Method, system and device for transmitting system information |
| CN102065502A (en) * | 2011-01-27 | 2011-05-18 | 新邮通信设备有限公司 | System information acquisition method in LTE (Long Term Evolution) system and UE (User Equipment) |
| CN101232737B (en) * | 2008-02-28 | 2011-06-01 | 北京天碁科技有限公司 | Method for terminal to read broadcasting channel and terminal thereof |
| CN101043301B (en) * | 2006-03-22 | 2011-08-10 | 华为技术有限公司 | Data rearrangement and recombination method in wireless communication system and its base station |
| US8112102B2 (en) | 2005-12-19 | 2012-02-07 | Lg Electronics Inc. | Method for reading dynamic system information blocks |
| CN101115281B (en) * | 2006-04-30 | 2012-06-06 | 华为技术有限公司 | System control message transmitting, receiving method and apparatus |
| US8325755B2 (en) | 2007-09-18 | 2012-12-04 | Lg Electronics Inc. | Method for performing random access process in wireless communication system |
| CN102811460A (en) * | 2011-06-03 | 2012-12-05 | 中兴通讯股份有限公司 | Method and system for fragmented scheduling of long-term evolution (LTE) system information (SI) |
| CN101651490B (en) * | 2008-08-11 | 2013-01-16 | 中兴通讯股份有限公司 | Method for scheduling and receiving system message blocks |
| CN102917437A (en) * | 2007-09-18 | 2013-02-06 | Lg电子株式会社 | Method of acquiring system information in wireless communication system |
| CN101572595B (en) * | 2008-04-29 | 2013-02-27 | 中兴通讯股份有限公司 | Dispatching method of system messages |
| CN103702394A (en) * | 2013-12-24 | 2014-04-02 | 华为技术有限公司 | Receiving method for system information of cells, user equipment and communication system |
| US8730010B2 (en) | 2008-03-18 | 2014-05-20 | Lg Electronics Inc. | Method of receiving a disaster warning message using a paging message in mobile communication system |
| CN103874009A (en) * | 2012-12-12 | 2014-06-18 | 中兴通讯股份有限公司 | Positioning infomration indicating method, signal sending device, access point, terminal and system |
| US8879449B2 (en) | 2007-09-18 | 2014-11-04 | Lg Electronics Inc. | Method of acquiring system information in wireless communication system |
| US8886184B2 (en) | 2007-09-18 | 2014-11-11 | Lg Electronics Inc. | Method of performing cell reselection procedure in wireless communication system |
| CN108513322A (en) * | 2018-02-07 | 2018-09-07 | 电信科学技术研究院有限公司 | A kind of method, apparatus and computer storage media of determining candidate cell |
| CN113115275A (en) * | 2016-03-09 | 2021-07-13 | 高通股份有限公司 | Method and apparatus for narrowband broadcast/multicast design |
-
2002
- 2002-11-29 CN CN 02153612 patent/CN1245842C/en not_active Expired - Fee Related
Cited By (38)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1327725C (en) * | 2004-08-27 | 2007-07-18 | 华为技术有限公司 | Method for realizing system information 7 in 3G system |
| US8112102B2 (en) | 2005-12-19 | 2012-02-07 | Lg Electronics Inc. | Method for reading dynamic system information blocks |
| WO2007098676A1 (en) * | 2006-03-03 | 2007-09-07 | Huawei Technologies Co., Ltd. | A method for reassembling data in wireless communication system and an apparatus thereof |
| CN101043301B (en) * | 2006-03-22 | 2011-08-10 | 华为技术有限公司 | Data rearrangement and recombination method in wireless communication system and its base station |
| CN101115281B (en) * | 2006-04-30 | 2012-06-06 | 华为技术有限公司 | System control message transmitting, receiving method and apparatus |
| CN101114869B (en) * | 2006-07-26 | 2010-10-20 | 大唐移动通信设备有限公司 | System message block scheduling method and device in UMTS system |
| CN101822116A (en) * | 2007-08-09 | 2010-09-01 | 诺基亚西门子通信公司 | Mobile communication terminal, communication station, communication network, and communication method |
| US8325755B2 (en) | 2007-09-18 | 2012-12-04 | Lg Electronics Inc. | Method for performing random access process in wireless communication system |
| CN102917437A (en) * | 2007-09-18 | 2013-02-06 | Lg电子株式会社 | Method of acquiring system information in wireless communication system |
| CN102917437B (en) * | 2007-09-18 | 2015-03-04 | Lg电子株式会社 | Method of acquiring system information in wireless communication system |
| US8886184B2 (en) | 2007-09-18 | 2014-11-11 | Lg Electronics Inc. | Method of performing cell reselection procedure in wireless communication system |
| US8879449B2 (en) | 2007-09-18 | 2014-11-04 | Lg Electronics Inc. | Method of acquiring system information in wireless communication system |
| KR101085338B1 (en) | 2007-12-12 | 2011-11-23 | 지티이 코포레이션 | Method for sending, transmitting and scheduling system message in long term evolution system |
| WO2009079819A1 (en) * | 2007-12-12 | 2009-07-02 | Zte Corporation | Method for sending, transmitting and scheduling system message in long term evolution system |
| WO2009076803A1 (en) * | 2007-12-12 | 2009-06-25 | Zte Corporation | Method for sending, transmitting and scheduling system message in long term evolution system |
| WO2009092303A1 (en) * | 2008-01-08 | 2009-07-30 | Huawei Technologies Co., Ltd. | System information scheduling method, device and terminal |
| WO2009097753A1 (en) * | 2008-02-03 | 2009-08-13 | Huawei Technologies Co., Ltd. | Method, system and terminal for realizing system information schedule |
| CN101500189B (en) * | 2008-02-03 | 2011-06-01 | 华为技术有限公司 | Method, system and terminal for implementing information scheduling |
| CN101232737B (en) * | 2008-02-28 | 2011-06-01 | 北京天碁科技有限公司 | Method for terminal to read broadcasting channel and terminal thereof |
| US9060335B2 (en) | 2008-03-18 | 2015-06-16 | Lg Electronics Inc. | Method of receiving a disaster warning message using a paging message in mobile communication system |
| US9930508B2 (en) | 2008-03-18 | 2018-03-27 | Lg Electronics Inc. | Method of receiving and transmitting an earthquake and tsunami warning system (ETWS) message using a paging message in mobile communication system |
| US8730010B2 (en) | 2008-03-18 | 2014-05-20 | Lg Electronics Inc. | Method of receiving a disaster warning message using a paging message in mobile communication system |
| CN101572595B (en) * | 2008-04-29 | 2013-02-27 | 中兴通讯股份有限公司 | Dispatching method of system messages |
| US9014166B2 (en) | 2008-07-03 | 2015-04-21 | Zte Corporation | Method for transmitting system information |
| WO2010000119A1 (en) * | 2008-07-03 | 2010-01-07 | 中兴通讯股份有限公司 | Transmitting method of system information |
| CN101651490B (en) * | 2008-08-11 | 2013-01-16 | 中兴通讯股份有限公司 | Method for scheduling and receiving system message blocks |
| WO2010017734A1 (en) * | 2008-08-14 | 2010-02-18 | 华为技术有限公司 | Method for acquiring system information, and communication system and mobile terminal thereof |
| WO2011029271A1 (en) * | 2009-09-11 | 2011-03-17 | 中国移动通信集团公司 | Method, system and device for transmitting system information |
| CN102065502A (en) * | 2011-01-27 | 2011-05-18 | 新邮通信设备有限公司 | System information acquisition method in LTE (Long Term Evolution) system and UE (User Equipment) |
| CN102065502B (en) * | 2011-01-27 | 2013-09-18 | 新邮通信设备有限公司 | System information acquisition method in LTE (Long Term Evolution) system and UE (User Equipment) |
| CN102811460A (en) * | 2011-06-03 | 2012-12-05 | 中兴通讯股份有限公司 | Method and system for fragmented scheduling of long-term evolution (LTE) system information (SI) |
| CN103874009A (en) * | 2012-12-12 | 2014-06-18 | 中兴通讯股份有限公司 | Positioning infomration indicating method, signal sending device, access point, terminal and system |
| CN103874009B (en) * | 2012-12-12 | 2018-07-24 | 中兴通讯股份有限公司 | Localization message indicating means and sender unit, access point, terminal and system |
| CN103702394A (en) * | 2013-12-24 | 2014-04-02 | 华为技术有限公司 | Receiving method for system information of cells, user equipment and communication system |
| CN103702394B (en) * | 2013-12-24 | 2018-09-21 | 华为技术有限公司 | Method of reseptance, user equipment and the communication system of cell system message |
| CN113115275A (en) * | 2016-03-09 | 2021-07-13 | 高通股份有限公司 | Method and apparatus for narrowband broadcast/multicast design |
| CN113115275B (en) * | 2016-03-09 | 2023-09-12 | 高通股份有限公司 | Method and apparatus for narrowband broadcast/multicast design |
| CN108513322A (en) * | 2018-02-07 | 2018-09-07 | 电信科学技术研究院有限公司 | A kind of method, apparatus and computer storage media of determining candidate cell |
Also Published As
| Publication number | Publication date |
|---|---|
| CN1245842C (en) | 2006-03-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN1245842C (en) | System information receiving and reassembling method in the third generation wireless communication system | |
| CN1315279C (en) | Apparatus and method for retransmitting data packets in mobile ad hoc network environment | |
| CN1145283C (en) | Appts. and method for designating reverse common channel for dedicated communication in mobile communication system | |
| CN1951052A (en) | Apparatus and method for enhanced um rlc data handling | |
| CN1663151A (en) | Multimedia service providing method in a radio mobile communication system | |
| CN1794827A (en) | Receiving method of multimedia brondiasting/group broadcast service control information | |
| CN1692582A (en) | Method of multiplexing logical channels in mobile communication system and apparatus thereof | |
| CN1802013A (en) | Method and apparatus for realizing network service provider discovery | |
| CN1547860A (en) | System and method for collision-free transmission scheduling using neighborhood information and advertised transmission times | |
| CN1411239A (en) | Kanuchi Koichi (JP)" | |
| CN1943145A (en) | Transmission of control information in wireless communication system | |
| CN1607783A (en) | Processing broadcast data in a mobile ac-hoc network | |
| CN1802012A (en) | Method for realizing network service provider selection | |
| JP6206884B2 (en) | Service instruction message reporting method, apparatus, and system | |
| CN1567769A (en) | A system information dynamic scheduling method in WCDMA system | |
| CN1798104A (en) | Wireless communication system for multicast communications | |
| CN1166095C (en) | Combining method for selecting transmission mode of transmission channels in mobile station and corresponding mobile station | |
| CN1438807A (en) | Method for selecting wireless channel distribution in multiple channel broadcasting business | |
| CN108848546B (en) | Receiving method of cell system message, user equipment and communication system | |
| CN1494274A (en) | Method of realizing IP message partition and recombination based on network processor | |
| CN1852261A (en) | Method for maintenance of neighbor entry | |
| CN1192576C (en) | Multicast business realizing method in mobile network | |
| CN1863210A (en) | Apparatus scanning method | |
| CN1612501A (en) | Transmitting data using multi-frames | |
| CN1675884A (en) | Intermittent communication method and intermittent communication apparatus |
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: 20060315 Termination date: 20191129 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |