CN100401665C - A method for judging the byte loss of reverse data packet - Google Patents

Abstract

The invention discloses a method for judging the byte loss of a reverse data packet. An implementation of the method is to determine the waiting time of the currently decoded reverse data packet, and judge whether it is received within the waiting time. The reverse byte sent before the byte in the current reverse packet, if it is not received, it is considered to have occurred reverse byte loss. Another implementation of this method is to set the packet buffer queue, including: determine the waiting time of the reverse data packet that is currently decoded successfully, and put the reverse data packet into the packet buffer queue. When the waiting time arrives, the packet In the buffer queue, the above-mentioned successfully decoded reverse data packets and their previous reverse data packets are selected as sorted reverse data packets, and it is judged whether there are any missing bytes in the sorted reverse data packets , if it is, it is considered that a reverse byte loss has occurred. By adopting the technical scheme provided by the invention, it is possible to avoid mistakenly identifying the out-of-sequence reverse data packet as reverse byte loss.

Description

A method for judging the byte loss of reverse data packet

technical field

The invention relates to mobile communication technology, in particular to a method for judging the byte loss of reverse data packets.

Background technique

The new data service (Evolution Data Optimized, EV-DO) of Code Division Multiple Access (CDMA) 2000 system has been developed from the original Rev 0 version to Rev A version. Figure 1 illustrates the effect when the base station as the receiver receives the reverse data packet sent by the mobile terminal as the sender in EV-DO Rev A.

In EV-DO Rev A, on the mobile terminal, each reverse data packet to be sent is divided into 4 sub-packets, the first sub-packet carries all the valid information and some redundant information of the original data packet, and the other The three data packets all carry redundant information to help decoding; at the same time, there are three interleaving numbers of 0, 1, and 2, which are used to send sub-packets belonging to three different reverse data packets . All subpackets of a reverse data packet are sent by the same interleave with the same interleave number. Since the wireless channel between the mobile terminal and the base station changes drastically, on the base station, for each data packet, it is possible to successfully decode the first subpacket received, and it is also possible to decode it successfully after receiving the second and second packets. 3. Only after the fourth subpackage can the decoding be successful, and even the decoding is not successful in the end. If the base station does not decode successfully after receiving the first subpacket, it will send Nak to the mobile terminal through the forward feedback from the base station to the mobile terminal, so that the mobile terminal can send the second subpacket; if the base station receives the first subpacket After the packet is successfully decoded, an Ack will be sent to the mobile terminal through forward feedback, and the mobile terminal will start interleaving and sending a new data packet at the location of the first subpacket, and so on. In Figure 1, the reverse data packet A is sent by the interleaving number 0, and the decoding is successful in the first subpacket A0, the base station sends Ack to the mobile terminal through forward feedback, so that the next time the mobile terminal is in the interleaving number The interleaving of 0 sends the first subpacket D0 of the reverse data packet D; the four subpackets B0, B1, B2, and B3 of the reverse data packet B are all sent by the interleaving number 1. Only four subpackets B3 can be successfully decoded, so after receiving B0, B1 and B2, the base station will send Nak to the mobile terminal through forward feedback, so that the mobile terminal can then send the next subpacket; the reverse data packet C has an interleaving number of 2 The interleaved transmission of the first subpacket C0 is successfully decoded, and the base station sends an Ack to the mobile terminal through forward feedback, so that the next interleaving transmission with the interleaving number 2 is the first subpacket of the reverse data packet E package E0, and so on. By adopting this method of interleaved transmission, the reverse data packet can be terminated in advance, which increases the reverse data rate, but at the same time, the sequence of the reverse data packet may be disordered. For example, in Figure 1, at the sending end, the reverse data packet B is sent before the reverse data packet C; but at the receiving end, since the reverse data packet B is only successfully decoded in the fourth subpacket, and the reverse Packet C is successfully decoded in the first subpacket, so C completes decoding before B.

The decoding of the reverse data packet is completed by the base transceiver station (Base Transceiver Station, BTS), and the BTS transmits the decoded reverse data packet to the base station controller (Base Station Controller, BSC). In the prior art, if the above-mentioned reverse data packet C is decoded earlier than the reverse data packet B, the radio link protocol (Radio Link Protocol, RLP) module on the BSC is processing the word of the reverse data packet. When it is found that the byte contained in the reverse data packet A is followed by the byte contained in the reverse data packet C, it is considered that the byte contained in the reverse data packet B is lost, and the mobile terminal is notified to resend the reverse data packet. To packet B. In fact, the reverse data packet B is only delayed in arrival, which will cause unnecessary retransmission of the reverse data packet and affect the rate of reverse communication.

Contents of the invention

In view of this, the main purpose of the present invention is to provide a method for reverse judgment data packet byte loss, to prevent the base station controller from mistakenly thinking that the byte in the reverse data packet is lost under the situation of out-of-order reverse data packet , so as to avoid unnecessary repeated sending of reverse data packets.

In order to achieve the above object, the present invention provides a method for judging the loss of reverse data packet bytes, the first implementation of the method includes:

Step A1, determine the waiting period of the current reverse data packet successfully decoded, and judge whether the reverse byte sent before the byte in the current reverse data packet is missing, and if so, perform step B1;

Step B1, judge whether the reverse byte sent before the byte in the current reverse data packet is received within the waiting time length obtained in step A1, if not received, it is considered that the reverse byte is lost, and the notification The sender resends the lost reverse bytes.

Wherein, the waiting period of determining the reverse data packet that is currently successfully decoded in step A1 includes:

Step A11, the base transceiver station transmits the currently successfully decoded reverse data packet and the interleaving information generated when the current reverse data packet is successfully decoded to the base station controller;

Step A12, the base station controller judges whether the current reverse data packet is terminated ahead of schedule, and if so, executes Step A13; otherwise, it is considered that the waiting time is 0;

Step A13, the base station controller calculates the waiting time of the current reverse data packet according to the interleaving information generated when the current reverse data packet is successfully decoded.

Wherein, the waiting period of determining the reverse data packet that is currently successfully decoded in step A1 includes:

Step A21, the base transceiver station judges whether the current reverse data packet ends ahead of time, if so, executes step A22, otherwise considers that the waiting time is 0;

Step A22, the base transceiver station calculates the waiting time of the current reverse data packet according to the interleaving information generated when the current reverse data packet is successfully decoded;

Step A23, the base transceiver station transmits the successfully decoded reverse data packet and the calculated waiting time to the base station controller.

Wherein, the judgment in step B1 whether the reverse byte sent before the byte in the current reverse data packet is received is completed by the base station controller within the waiting time obtained in step A1.

The second implementation manner of the method is to set a packet cache queue, and the method includes:

Step A2, determine the waiting time of the current successfully decoded reverse data packet, put the current successfully decoded reverse data packet into the packet buffer queue, and then start timing the current successfully decoded reverse data packet;

Step B2, when the waiting time obtained in step A2 arrives, select the reverse data packet successfully decoded in step A2 and the previous reverse data packet in the packet cache queue as the sorted reverse data packet ;

Step C2, judging whether any byte is missing in the sorted reverse data packet, if so, consider that the reverse byte is lost, and notify the sender to resend the lost reverse byte.

Wherein, the reverse data packets that are currently decoded successfully are put into the packet cache queue as described in step A2:

According to the frame sequence number carried by the currently decoded reverse data packet, judge the current successfully decoded reverse data packet and the existing reverse data packet in the packet buffer queue, in the order of sending, and then the current decoded successfully The reverse data packets are put into the packet buffer queue.

Wherein, the waiting period of determining the reverse data packet that is currently decoded successfully in step A2 includes:

Step A31, the base transceiver station transmits the currently successfully decoded reverse data packet and the interleaving information generated when the current reverse data packet is successfully decoded to the base station controller;

Step A32, the base station controller judges whether the current reverse data packet ends ahead of schedule, if so, executes step A33, otherwise considers that the waiting time is 0;

Step A33, the base station controller calculates the waiting time of the current reverse data packet according to the interleaving information generated when the current reverse data packet is successfully decoded.

Wherein, the waiting period of determining the reverse data packet that is currently decoded successfully in step A2 includes:

Step A41, the base transceiver station judges whether the current reverse data packet ends ahead of schedule, if so, executes step A42, otherwise considers that the waiting time is 0;

Step A42, the base transceiver station calculates the waiting time of the current reverse data packet according to the interleaving information generated when the current reverse data packet is successfully decoded.

Wherein, as described in step A2, put the current successfully decoded reverse data packet into the packet buffer queue, and then start timing the current successfully decoded reverse data packet as:

The base transceiver station transmits the successful reverse data packet of decoding and the waiting period calculated in step A42 to the base station controller, and the base station controller puts the current reverse data packet of successful decoding into the packet buffer queue, and then starts to process the current Decoded successful reverse packet timing.

Wherein, as described in step A2, put the current successfully decoded reverse data packet into the packet buffer queue, and then start timing the current successfully decoded reverse data packet as:

The base station transceiver puts the currently successfully decoded reverse data packet into the packet buffer queue, and then starts timing the current successfully decoded reverse data packet;

In the packet cache queue described in step B2, the reverse data packets successfully decoded in step A2 and the previous reverse data packets are selected, and the reverse data packets that are sorted are:

The base transceiver station selects the reverse data packets successfully decoded in step A2 and its previous reverse data packets from the packet buffer queue, and transmits them to the base station controller as sorted reverse data packets.

Wherein, the judgment in step C2 whether there is a byte missing in the sorted reverse data packet is completed by the base station controller.

By adopting the technical scheme provided by the present invention, for out-of-order reverse data packets, the waiting time is first calculated, and only after the waiting time is exceeded, it is considered that the bytes contained in the reverse data packets are lost, thus avoiding erroneous Out-of-order reverse packets are considered reverse byte loss. Further, the waiting time can be used to sort out-of-sequence reverse data packets, thereby speeding up the speed of subsequent processing in the base station controller. The work of calculating the waiting time and sorting can be completed by the base transceiver station, thus reducing the calculation pressure of the base station controller.

Description of drawings

Figure 1 is the sending scheme of the reverse data packet in CDMA2000 EV-DO Rev A;

Fig. 2 is the flow chart of calculating the waiting period provided by the present invention;

Fig. 3 is the flow chart of embodiment 1 of the method for judging reverse data packet byte loss provided by the present invention;

Fig. 4 is a flow chart of Embodiment 2 of the method for judging the byte loss of the reverse data packet provided by the present invention.

Detailed ways

The core idea of the present invention is that, for out-of-order reverse data packets, firstly calculate the waiting time, and judge whether byte loss in the data packet occurs according to the waiting time.

In order to make the purpose, technical solution and advantages of the present invention clearer, the present invention will be further described in detail below in conjunction with the accompanying drawings and specific embodiments.

Please refer to FIG. 2 , which is a flow chart of calculating the waiting time provided by the present invention. For ease of understanding without loss of generality, the calculation process is described by taking the reverse data packet C shown in FIG. 1 as an example. According to FIG. 1 , intuitively, the reverse data packet C does not need to wait for the reverse data packet A, but needs to wait for the reverse data packet B.

In step 201, the reverse data packet where the current subpacket is located is successfully decoded and a callback is generated.

Here, C0 is the current subpacket, and a callback is generated if the decoding is successful, and the waiting time calculation process for the reverse data packet C is started.

Step 202, acquiring the interleaving information of the current subpacket, the first subpacket preceding the current subpacket, and the second subpacket preceding the current subpacket.

For the current subpackage C0, the first subpackage before the current subpackage is subpackage B0, and the second subpackage before the current subpackage is subpackage A0.

The interleaving information includes three data fields: interleaving number, subpackage number and interleaving state.

The interlace number indicates which interlace the subpacket is in, and its value ranges from 0 to 2, because there are 3 interlaces in total. In FIG. 1 , subpacket A0 is located at interleave number 0, subpacket B0 is located at interleave number 1, and subpacket C0 is located at interleave number 2.

The subpacket number indicates which subpacket the subpacket belongs to in the reverse data packet, and its value ranges from 0 to 3, because for the base station as the receiving end, a reverse data packet includes at most 4 subpackets. In FIG. 1, A0, B0, and C0 are all the 0th subpackets of their respective reverse data packets.

Subpackage status indicates the status of the reverse data packet where the subpackage is located, which can be the following four values:

CRCPass, the reverse data packet is successfully decoded, and the reverse data packet is the reverse data packet where the currently decoded sub-packet is located;

CRCFail, the reverse data packet was not decoded successfully;

Invalid, the reverse data packet is successfully decoded, and the reverse data packet is not the reverse data packet where the currently decoded subpacket is located; or the reverse data packet has no data to send; or the fourth subpacket decoding fails, and the reverse data packet The packet is not the reverse data packet where the currently decoded subpacket is located;

SubPacketFail, the subpacket is invalid and cannot be used for decoding the reverse data packet.

In Figure 1, the subpackage status value of subpackage A0 is Invalid, the subpackage status value of subpackage B0 is CRCFail, and the subpackage status value of subpackage C0 is CRCPass;

It should be noted that the above only gives the meanings related to the calculation waiting time represented by the four values of the sub-packet status.

Step 203 , judging whether the current sub-packet is prematurely terminated, if yes, execute step 204 , otherwise execute step 212 .

The method for judging whether the current sub-packet is terminated early is to check whether the sub-packet number in the interleaving information of the current sub-packet is 3. If it is 3, it means that it is not terminated early, and if it is not 3, it means that it is terminated early.

When the current subpacket is C0, the subpacket number in the interleaving information of the current subpacket is 0, indicating early termination.

Step 204, judge whether the reverse data packet where the current sub-packet is located needs to wait for the reverse data packet where the first sub-packet is located before the current sub-packet, if so, perform step 205, otherwise perform step 206.

The method of judging whether the reverse data packet where the current subpacket is located needs to wait for the reverse data packet of the first subpacket before the current subpacket is, if any of the following three conditions is true, it is considered that the current subpacket is located The reverse data packet does not need to wait for the reverse data packet where the current subpacket is located forward, otherwise the reverse data packet where the current subpacket is located needs to wait for the reverse data packet where the first subpacket is located forward from the current subpacket . These three conditions are:

(1) The sub-packet number in the current sub-packet interleaving information is greater than the sub-packet number in the interleaving information of the first sub-packet before the current sub-packet;

(2) The subpackage status in the interleaving information of the first subpackage before the current subpackage is Invalid;

(3) The subpacket status in the interleaving information of the first subpacket forward of the current subpacket is SubPacketFail, and the subpacket number in the interleaving information of the first subpacket forward of the current subpacket is 3.

When the current subpacket is C0, the first forward subpacket of the current subpacket is B0, and none of the above three conditions are satisfied, so the reverse data packet where the current subpacket C0 is located needs to wait for the first forward subpacket of the current subpacket The reverse data packet where the subpacket B0 is located.

Step 205: Calculate the waiting time for the reverse data packet where the current subpacket is located and the reverse data packet where the first subpacket is located before the current subpacket, and then perform step 207.

The calculation method of the waiting time is: first subtract the interleaving number in the interleaving information of the current subpacket from the interleaving number in the interleaving information of the first subpacket before the current subpacket, add 3, and add the result After dividing by 3, take the remainder; then subtract the subpacket number in the interleaving information of the first subpacket forward from the current subpacket with 3, multiply the difference obtained by 3, and subtract the result obtained in the previous step from the result of the multiplication The remainder is the waiting time for the reverse data packet where the current subpacket is located to wait for the reverse data packet where the first subpacket is located before the current subpacket.

According to the above calculation method, the reverse data packet containing the sub-packet C0 should wait for the reverse data packet containing the sub-packet B0 for a waiting time of 8, and the unit is a sub-packet.

Step 206, set the waiting time for the reverse data packet where the current subpacket is located to wait for the reverse data packet where the first subpacket is located before the current subpacket to be 0.

Step 207, judge whether the reverse data packet where the current subpacket is located needs to wait for the reverse data packet where the second subpacket is located before the current subpacket, if so, execute step 208, otherwise execute step 209.

The method of judging whether the reverse data packet where the current subpacket is located needs to wait for the reverse data packet where the current subpacket is forwarded is that if any of the following three conditions is true, it is considered that the current subpacket is located in the reverse direction The data packet does not need to wait for the reverse data packet where the current subpacket is forward and the second subpacket is located, otherwise it is considered that the reverse data packet where the current subpacket is located needs to wait for the reverse data packet where the current subpacket is forward and the second subpacket is located. These three conditions are:

(1) The sub-packet number in the current sub-packet interleaving information is greater than the sub-packet number in the interleaving information of the second sub-packet before the current sub-packet;

(2) The subpackage status in the interleaving information of the second subpackage ahead of the current subpackage is Invalid;

(3) The subpacket status in the interleaving information of the second forward subpacket from the current subpacket is SubPacketFail, and the subpacket number in the interleaving information of the second subpacket forward from the current subpacket is 3.

When the current sub-packet is C0, the second sub-packet forward of the current sub-packet is A0, and (2) of the above three conditions are satisfied, so the reverse data packet where the current sub-packet C0 is located does not need to wait for the current sub-packet forward The reverse data packet where the second subpacket A0 is located.

Step 208: Calculate the waiting time for the reverse data packet where the current subpacket is located and the reverse data packet where the second subpacket is located before the current subpacket, and then perform step 210.

The calculation method of the waiting time is: first subtract the interleaving number in the interleaving information of the current subpacket from the interleaving number in the interleaving information of the second subpacket before the current subpacket, add 3, and divide the result obtained by the addition Take the remainder after 3; then use 3 to subtract the subpacket number in the interleaving information of the second subpacket forward from the current subpackage, multiply the difference obtained by 3, and subtract the remainder obtained in the previous step from the result of the multiplication, It is the waiting time for the reverse data packet where the current subpacket is located to wait for the reverse data packet where the second subpacket is located before the current subpacket.

In step 209, set the waiting time for the reverse data packet where the current subpacket is located to wait for the reverse data packet where the second subpacket is located before the current subpacket to be 0.

Step 210 , judging whether the two waiting periods for the reverse data packet where the current subpacket is located are both 0, if so, execute step 212 , otherwise execute step 211 .

Step 211: Use the larger one of the two waiting times for the reverse data packet where the current subpacket is located as the waiting time for the reverse data packet where the current subpacket is located.

Because the reverse data packet C where the current subpacket C0 is located needs to wait for the data packet B where the first subpacket B0 is located ahead of the current subpacket, and the waiting time is 8; while the reverse data packet C where the current subpacket C0 is located needs to The waiting time for data packet A containing the second subpacket A0 in the current subpacket is 0, so the waiting time for the reverse data packet containing the current subpacket C0 is 8.

Step 212, the reverse data packet where the current subpacket is located does not need to wait, that is to say, the waiting time of the current subpacket is 0.

Please refer to FIG. 3 . FIG. 3 is a flow chart of Embodiment 1 of the method for judging the byte loss of the reverse data packet provided by the present invention.

Step 301, the BTS decodes the reverse data packet, and transmits the interleaved information to the BSC.

In the mobile communication base station system, decoding the reverse data packet is done by the BTS. As mentioned in the description of the process of calculating the waiting time, after the BTS successfully decodes the reverse data packet where the current subpacket is located, it will get the current subpacket, the first subpacket before the current subpacket, and the current subpacket direction. For the interleaving information of the first second subpacket, the BTS transmits the successfully decoded reverse data packet and the corresponding three interleaving information to the BSC.

In step 302, the BSC calculates the waiting time of the current reverse data packet according to the interleaving information.

Step 302 is the process of steps 201 to 212.

In step 303, the BSC puts the bytes in the current reverse data packet into the reordering buffer.

The rearrangement buffer is used by the prior art RLP protocol to sort the bytes in the reverse data packet. The mobile terminal will assign an RLP sequence number to each byte sent according to the RLP protocol, and the RLP sequence number will increase according to the order in which the bytes are sent; , put it into the rearrangement buffer according to the RLP serial number. Only a segment of bytes that are continuous, exceed a certain length threshold, and enter the rearrangement buffer at the earliest can be sent to the subsequent processing module.

For example, assuming that the length threshold is 20 bytes, the existing bytes in the rearrangement buffer are a total of 6 consecutive bytes with RLP sequence numbers from 30 to 35. Since the length of the consecutive bytes does not exceed the length threshold, they cannot be sent to the subsequent processing module. Now the first reverse packet is received, which includes 11 consecutive bytes with RLP sequence numbers 40 to 50. After being put into the rearrangement buffer according to the RLP serial number, the number of consecutive bytes still does not exceed 20. If a second reverse data packet is received, it includes 4 consecutive bytes with RLP sequence numbers from 36 to 39. After being put into the rearrangement buffer according to the RLP serial number, the RLP serial number of consecutive bytes is from 30 to 40, and the number of consecutive bytes is 21, which exceeds the length threshold, and all 21 bytes are sent to the subsequent processing module.

Step 304, judging whether there is a byte missing before the byte in the current reverse data packet in the rearrangement buffer, if yes, execute step 305, otherwise execute step 308.

The so-called missing byte refers to the situation before receiving the second reverse data packet in the example given in step 303 , the bytes whose RLP serial numbers are 36 to 39 are the missing bytes.

In step 305, the BSC starts the timer after setting the timer to zero.

The role of the timer is that missing bytes can be caused by out-of-order reverse packets, or by reverse packet loss. If it is caused by out-of-order reverse data packets, within the waiting period calculated in step 302, the reverse data packets containing missing bytes should be received. If it has not been received beyond this time, the reverse data packet is lost on the communication path from the mobile terminal to the base station, and the mobile terminal needs to resend the missing byte.

In step 306, the BSC judges whether the timer has reached the waiting time, if yes, executes step 311, otherwise executes step 307.

In step 307, the BSC judges whether it has received the reverse data packet containing missing bytes from the BTS, and if so, executes step 308, otherwise returns to execute step 306.

In step 308, the BSC judges whether the length of a segment of consecutive bytes where the byte in the current reverse data packet in the rearrangement buffer is located exceeds the length threshold, and if so, executes step 309; otherwise, executes step 310.

In step 309, the BSC performs subsequent processing on a segment of consecutive bytes in the rearrangement buffer where the bytes in the current reverse data packet are located.

In step 310, the BSC prepares to process the next reverse data packet.

In step 311, it is considered that the BTS failed to successfully decode the reverse data packet containing the missing byte, and the mobile terminal is required to resend the missing byte.

In the first embodiment, the steps from step 302 to step 311 are all completed by the BSC. In an actual mobile communication base station system, a BSC often has many BTSs, and for the reverse data packet transmitted by each BTS, the BSC must perform the procedures from step 302 to step 311. This takes up a lot of processing power of the BSC. On the other hand, calculating the waiting time by the BSC requires the BTS to send interleaving information while transmitting the current reverse data packet, which will reduce the utilization efficiency of the interface between the BTS and the BSC. For example, the interleaving information of three subpackets is about 3 bytes, while in Voice on Internet Protocol (VoIP), the length of a reverse data packet is only 22 bytes. Transmitting the interleaving information makes BTS and The interface utilization between BSCs is reduced by almost 10%.

As an improvement of the first embodiment, in step 301, the BTS may not transmit the decoded reverse data packet and interleaving information to the BSC, but the BTS itself performs step 302, and then sends the decoded reverse data packet It is sent to the BSC together with the calculated waiting time. In this way, the utilization efficiency of the interface between the BTS and the BSC can be improved. At the same time, it also shares a part of the calculation amount of BSC.

However, the processing of bytes in the reverse data packet can only be performed at the BSC, so that steps 303 to 311 cannot be moved to the BTS. In this way, the calculation load of the BSC is still very large, and the long transmission waiting time still needs to occupy the resources of the interface between the BTS and the BSC.

Embodiment 2 of the present invention can solve this problem. Please refer to FIG. 4 . FIG. 4 is a flow chart of Embodiment 2 of the method for judging the byte loss of the reverse data packet provided by the present invention.

In order to sort the reverse data packets, the BTS maintains a timer for each of the three interleaves, and the initial value of each timer is 0. Each timer also corresponds to a start frame sequence number (Frame SequenceNumber, FSN), indicating the FSN of the reverse data packet where the subpacket that starts the timer is located. FSN is the serial number assigned to each data packet by the mobile terminal when sending the reverse data packet. The FSN and the data packet have a one-to-one correspondence, and the allocation of the FSN is based on the order in which the data packets are sent. The BTS also maintains a reverse data packet buffer queue, referred to as the packet buffer queue, and the reverse data packet FSNs in the packet buffer queue are arranged from small to large.

In step 401, the BTS receives the subpacket.

Step 402 , the BTS judges whether the decoding of the reverse data packet where the current subpacket is located is completed in the current subpacket, and if so, executes step 410 , otherwise executes step 403 .

Step 403, judging whether the timer of the interlace where the current subpacket is located is 0, if yes, execute step 405, otherwise execute step 404.

Step 404, execute step 420.

Step 405, judging whether except the interleaving where the current subpackage is located, whether the other two interleaved timers are all 0, if yes, then perform step 407; if except the interleaving where the current subpacket is located, the other two interleaved timers If any one of them is 0, step 406 is executed.

Step 406, judging whether except the interleaving where the current subpackage is located, whether the other two interleaving timers are all 0, if yes, then perform step 409; If one and only one is 0, step 408 is executed.

Step 407, comparing and judging the starting FSNs of the timers of the other two interleavings except the interleaving where the current subpacket is located, and storing the reverse data packets before the reverse data packets corresponding to the starting FSNs with smaller values in the packet cache queue sent to the BSC and go to step 420.

Step 408: Send the reverse data packet before the reverse data packet corresponding to the start FSN of the timer that is not 0 in the packet buffer queue to the BSC, and execute step 420.

Step 409, send all the reverse data packets in the packet buffer queue to the BSC, and execute step 420.

Step 410, clear the timer of the interleave where the current sub-packet is located, and insert the current sub-packet into the packet buffer queue in the order of FSN.

In step 411, the BTS calculates the location of the current subpacket according to the interleaving information of the current subpacket, the first subpacket forward of the current subpacket, and the second subpacket forward of the current subpacket obtained when the reverse data packet is successfully decoded. The reverse data packet needs to wait for the waiting time t1 of the first subpacket forward of the current subpacket, and the waiting time t2 of the second subpacket forward of the current subpacket for the reverse data packet of the current subpacket.

Step 412, judging whether t1 and t2 are both 0, if yes, execute step 414, if any one of t1 and t2 is not 0, execute step 413.

Step 413, judge whether t1 is 0, if yes, t2 must not be 0, go to step 418, otherwise go to step 415.

Step 414 , return to step 405 .

In step 415, it is judged whether the timer of the interlace of the first subpacket before the current subpacket is 0, if yes, go to step 416, otherwise go to step 417.

Step 416, set the value of the timer interleaving where the first subpacket of the current subpackage is located to the value of t1, and set the start FSN of the timer interleaved where the first subpacket is located forward of the current subpacket to the current The FSN of the packet in which the subpacket resides.

Step 417, judge whether t2 is 0, if yes, execute step 420, otherwise execute step 418.

Step 418 , judging whether the timer of the interleaving of the second subpacket before the current subpacket is 0, if yes, go to step 419 , otherwise go to step 420 .

Step 419, the value of the interleaving timer where the second subpacket is located in the current subpacket is set to the value of t2, and the start FSN of the interleaved timer where the second subpacket is located in the current subpacket is set to the current subpacket The FSN of the contained packet.

In step 420, the timer that is not 0 is decremented by 1, and then the processing flow for the current subpacket is ended, and the next subpacket is ready to be processed.

In this way, the reverse data packets transmitted from the BTS to the BSC are arranged according to the transmission order of the transmitting end. Although the BSC still needs to perform steps 303 to 310, since the reverse data packets are all sorted, the BSC does not need to perform any rearrangement buffer processing on the bytes in the reverse data packets transmitted from the BTS, thus reducing The calculation amount of BSC is reduced, and BSC is basically not used for calculation. And since the BTS only needs to transmit the data packet itself to the BSC, the utilization efficiency of the interface between the BTS and the BSC can be further improved. Of course, if based on other considerations, the work of sorting the reverse data packets can also be put into the BSC. In this case, the sending the reverse data packet to the BSC in step 407, step 408 and step 409 should be sending the reverse data packet from the packet buffer queue to the subsequent processing module.

The above descriptions are only preferred embodiments of the present invention, and are not intended to limit the protection scope of the present invention. Any modifications, equivalent replacements, improvements, etc. made within the spirit and principles of the present invention shall be included within the protection scope of the present invention.

Claims (11)

1. A method for judging reverse packet byte loss, characterized in that the method comprises: Step A1, determine the waiting time of the current successfully decoded reverse data packet, and judge whether the reverse byte sent before the byte in the current reverse data packet is missing, and if so, execute step B1; Step B1, judge whether the reverse byte sent before the byte in the current reverse data packet is received within the waiting time length obtained in step A1, if not received, it is considered that the reverse byte is lost, and the notification The sender resends the lost reverse bytes. 2. the method for judging reverse data packet byte loss according to claim 1, is characterized in that, the described in step A1 determines that the waiting period of the reverse data packet of current decoding success comprises: Step A11, the base transceiver station transmits the currently successfully decoded reverse data packet and the interleaving information generated when the current reverse data packet is successfully decoded to the base station controller; Step A12, the base station controller judges whether the current reverse data packet is terminated ahead of schedule, and if so, executes Step A13; otherwise, it is considered that the waiting time is 0; Step A13, the base station controller calculates the waiting time of the current reverse data packet according to the interleaving information generated when the current reverse data packet is successfully decoded. 3. the method for judging reverse data packet byte loss according to claim 1, is characterized in that, the waiting period of determining the reverse data packet of current decoding success described in step A1 comprises: Step A21, the base transceiver station judges whether the current reverse data packet ends ahead of time, if so, executes step A22, otherwise considers that the waiting time is 0; Step A22, the base transceiver station calculates the waiting time of the current reverse data packet according to the interleaving information generated when the current reverse data packet is successfully decoded; Step A23, the base transceiver station transmits the successfully decoded reverse data packet and the calculated waiting time to the base station controller. 4. according to the method for judging the reverse data packet byte loss described in any one of claims 1 to 3, it is characterized in that, within the waiting period obtained in step A1, the described step B1 judges whether it is received within the current The reverse byte sent before the byte in the reverse packet is done by the base station controller. 5. a method for judging the loss of reverse packet bytes is characterized in that, the packet cache queue is set, and the method comprises: Step A2, determine the waiting time of the current successfully decoded reverse data packet, put the current successfully decoded reverse data packet into the packet buffer queue, and then start timing the current successfully decoded reverse data packet; Step B2, when the waiting time obtained in step A2 arrives, select the reverse data packet successfully decoded in step A2 and the previous reverse data packet in the packet cache queue as the sorted reverse data packet ; Step C2, judging whether any byte is missing in the sorted reverse data packet, if so, consider that the reverse byte is lost, and notify the sender to resend the lost reverse byte. 6. the method for judging the reverse data packet byte loss according to claim 5, is characterized in that, step A2. the described reverse data packet that current decoding is successful is put into the packet cache queue as: According to the frame sequence number carried by the currently decoded reverse data packet, judge the current successfully decoded reverse data packet and the existing reverse data packet in the packet buffer queue, in the order of sending, and then the current decoded successfully The reverse data packets are put into the packet buffer queue. 7. the method for judging reverse data packet byte loss according to claim 5, is characterized in that, the waiting period of determining the reverse data packet of current decoding success described in step A2 comprises: Step A31, the base transceiver station transmits the currently successfully decoded reverse data packet and the interleaving information generated when the current reverse data packet is successfully decoded to the base station controller; Step A32, the base station controller judges whether the current reverse data packet ends ahead of schedule, if so, executes step A33, otherwise considers that the waiting time is 0; Step A33, the base station controller calculates the waiting time of the current reverse data packet according to the interleaving information generated when the current reverse data packet is successfully decoded. 8. the method for judging reverse data packet byte loss according to claim 5, is characterized in that, the waiting period of determining the reverse data packet of current decoding success described in step A2 comprises: Step A41, the base transceiver station judges whether the current reverse data packet ends ahead of schedule, if so, executes step A42, otherwise considers that the waiting time is 0; Step A42, the base transceiver station calculates the waiting time of the current reverse data packet according to the interleaving information generated when the current reverse data packet is successfully decoded. 9. the method for judging reverse data packet byte loss according to claim 8, is characterized in that, the reverse data packet that current decoding success is described in step A2 is put into packet cache formation, then begins to be current decoding success The reverse packet timing is: The base transceiver station transmits the successful reverse data packet of decoding and the waiting period calculated in step A42 to the base station controller, and the base station controller puts the current reverse data packet of successful decoding into the packet buffer queue, and then starts to process the current Decoded successful reverse packet timing. 10. the method for judging reverse data packet byte loss according to claim 8, is characterized in that, the reverse data packet that current decoding success is described in step A2 is put into packet cache formation, then begins to be the current decoding success The reverse packet timing is: The base station transceiver puts the currently successfully decoded reverse data packet into the packet buffer queue, and then starts timing the current successfully decoded reverse data packet; In the packet cache queue described in step B2, the reverse data packets successfully decoded in step A2 and the previous reverse data packets are selected, and the reverse data packets that are sorted are: The base transceiver station selects the reverse data packets successfully decoded in step A2 and its previous reverse data packets from the packet buffer queue, and transmits them to the base station controller as sorted reverse data packets. 11. according to the method for judging reverse data packet byte loss described in any one of claim 5 to 10, it is characterized in that, step C2 described judgment whether there is byte missing in the reverse data packet of ordering is arranged by The base station controller is complete.

Images