Information processing method, communication device, communication system and storage medium

Abstract

The embodiment of the invention provides an information processing method, communication equipment, a communication system and a storage medium. The information processing method is executed by a receiving end and comprises the steps that firstly, the embodiment of the invention provides the information processing method which is executed by the receiving end and comprises the steps that under the condition that a discarding timer is overtime, at least one of the serial number of a first variable and the serial number of a second variable is updated; wherein the first variable is a receiving state variable RXNext, and the second variable is a maximum transmission state variable RXHigh Status.

Description

Technical Field

[0001] This disclosure relates to the field of communication technology, and in particular to an information processing method, communication device, communication system and storage medium. Background Technology

[0002] In the field of communication technology, the Radio Link Control (RLC) layer is responsible for providing reliable services; among them, the Acknowledged Mode (AM) can be used for orderly data reception and / or reliability. Summary of the Invention

[0003] The embodiments disclosed herein aim to address technical issues such as the inability to update the highest transmission status variable (RX_Highest_Status) when the timer times out.

[0004] According to a first aspect of the present disclosure, an information processing method is proposed, executed by a receiving end, the method comprising: updating at least one of the sequence number of a first variable and the sequence number of a second variable when a discard timer times out; wherein the first variable is a receiving status variable (RX_Next) and the second variable is a maximum transmission status variable (RX_Highest_Status).

[0005] According to a second aspect of the present disclosure, an information processing method is proposed, executed by a communication system, the communication system including a sending end and a receiving end; the method includes: when the receiving end expires a discard timer, updating at least one of the sequence number of a first variable and the sequence number of a second variable; wherein the first variable is a receiving state variable and the second variable is the largest transmission state variable.

[0006] According to a third aspect of the present disclosure, a terminal is provided, comprising: a processing module configured to update at least one of the sequence number of a first variable and the sequence number of a second variable when a discard timer times out; wherein the first variable is a receiving state variable and the second variable is a maximum transmission state variable.

[0007] According to a fourth aspect of the embodiments of this disclosure, a communication device is provided for performing an optional implementation as described in the first aspect.

[0008] According to a fifth aspect of the present disclosure, a communication system is provided, comprising: a transmitter and a receiver; wherein the receiver is configured to perform the method described in an optional implementation of the first aspect.

[0009] According to a sixth aspect of the present disclosure, a storage medium is provided that stores instructions which, when executed on a communication device, cause the communication device to perform the method described in the optional implementation of the first aspect.

[0010] According to a seventh aspect of the present disclosure, a program product is provided, including at least one of a program and instructions, wherein the program and instructions, when executed by a communication device, implement the method described in the optional implementation of the first aspect.

[0011] The embodiments disclosed herein can update the maximum transmission state variable, etc., when the discard timer times out. Attached Figure Description

[0012] To more clearly illustrate the technical solutions in the embodiments of this disclosure, the accompanying drawings required for the description of the embodiments are introduced below. The following drawings are only some embodiments of this disclosure and do not impose specific limitations on the protection scope of this disclosure.

[0013] Figure 1A This is a schematic diagram of the architecture of a communication system according to an embodiment of the present disclosure.

[0014] Figure 1B This is a schematic diagram illustrating a data packet reception according to an embodiment of the present disclosure.

[0015] Figure 2 This is an interactive schematic diagram illustrating an information processing method according to an embodiment of the present disclosure.

[0016] Figure 3 This is an interactive schematic diagram illustrating an information processing method according to an embodiment of the present disclosure.

[0017] Figure 4 This is a schematic diagram of the structure of a receiving end according to an embodiment of the present disclosure.

[0018] Figure 5A This is a schematic diagram of the structure of a communication device provided according to an embodiment of the present disclosure.

[0019] Figure 5B This is a schematic diagram of the chip structure provided according to an embodiment of the present disclosure. Detailed Implementation

[0020] This disclosure provides an information processing method, a communication device, a communication system, and a storage medium.

[0021] In a first aspect, embodiments of this disclosure propose an information processing method executed by a receiving end, the method comprising: updating at least one of the sequence number of a first variable and the sequence number of a second variable when a discard timer times out; wherein the first variable is a receiving status variable (RX_Next) and the second variable is the highest transmission status variable (RX_Highest_Status).

[0022] In the above embodiments, by updating RX_Next and / or RX_Highest_Status when the discard timer times out, the problem in the prior art that RX_Highest_Status and / or RX_Next cannot be updated after the discard timer times out is solved. This ensures, on the one hand, that the sending end receives more accurate status feedback, thereby reducing invalid data retransmissions; on the other hand, updating status variables appropriately while discarding expired data packets helps improve the efficiency and reliability of the communication system.

[0023] In conjunction with some embodiments of the first aspect, in some embodiments, updating at least one of the sequence number of the first variable and the sequence number of the second variable includes one of the following: updating at least one of the sequence number of the first variable and the sequence number of the second variable based on the first sequence number; updating the sequence number of the first variable based on the first sequence number; updating the sequence number of the second variable based on the updated sequence number of the first variable; wherein the first sequence number is: the sequence number of the next data packet that has not been completely received after the specified sequence number.

[0024] In the above embodiments, by introducing a first sequence number and updating the values ​​of RX_Next and / or RX_Highest_Status based on it, the position of data packets that have not yet been fully received can be located more accurately, reducing the occurrence of omissions or misjudgments. This improves the accuracy of sequence number updates and makes status reporting more timely and effective, thereby enhancing the response speed of the communication system.

[0025] In conjunction with some embodiments of the first aspect, in some embodiments, updating at least one of the sequence number of the first variable and the sequence number of the second variable based on the first sequence number includes: updating at least one of the sequence number of the first variable and the sequence number of the second variable based on the maximum value of the first sequence number and the second sequence number; wherein the second sequence number is the sequence number of the next data packet that has not been fully received after the current first variable; and if the sequence number of the second variable is less than the first sequence number, updating at least one of the sequence number of the first variable and the sequence number of the second variable based on the first sequence number.

[0026] In the above embodiments, the update strategy is determined by comparing the maximum value of the first sequence number and the second sequence number, which can more flexibly deal with the data loss problem under different reception conditions; thus, the logical consistency of sequence number updates can be guaranteed.

[0027] In conjunction with some embodiments of the first aspect, in some embodiments, updating the sequence number of the second variable based on the updated sequence number of the first variable includes at least one of the following: if the sequence number of the second variable is not in the receiving window, determining that the updated sequence number of the second variable is the updated sequence number of the first variable; if the sequence number of the second variable is not equal to the sum of the sequence number of the first variable and the size of the receiving window, determining that the updated sequence number of the second variable is the updated sequence number of the first variable.

[0028] In conjunction with some embodiments of the first aspect, in some embodiments, the specified serial number is the serial number at which the discard timer starts.

[0029] In the above embodiments, using the sequence number at the start of the discard timer as the designated sequence number can more accurately reflect the time point of the discard action and the corresponding data packet status; this enhances the timing control capability of sequence number updates; and is also beneficial for subsequent status report generation and data management.

[0030] In conjunction with some embodiments of the first aspect, in some embodiments, updating at least one of the sequence number of the first variable and the sequence number of the second variable includes: updating the sequence number of the second variable when a predetermined condition is met, wherein the predetermined condition is met when the updated sequence number of the second variable is greater than the original sequence number of the second variable.

[0031] In the above embodiments, by setting a condition judgment mechanism, the serial number update operation is only performed when specific conditions are met, thus ensuring the rationality and effectiveness of the serial number update.

[0032] In conjunction with some embodiments of the first aspect, in some embodiments, the method further includes: discarding data packets in the buffer whose sequence number is less than a specified sequence number.

[0033] In the above embodiments, by discarding data packets with serial numbers earlier than the specified sequence number, invalid or outdated data can be cleaned up, reducing the occurrence of excessive cache resource consumption; this can optimize storage efficiency and speed up subsequent data processing.

[0034] In conjunction with some embodiments of the first aspect, in some embodiments, the method further includes one of the following: when the sequence number of the second variable is greater than the sum of the sequence number of the first variable and a predetermined value, determining that the sequence number of the restarted discard timer is the updated sequence number of the second variable; when the sequence number of the second variable is equal to the sum of the sequence number of the first variable and a predetermined value, and the data unit corresponding to the first variable has missing data packets, determining that the sequence number of the restarted discard timer is the updated sequence number of the second variable.

[0035] In the above embodiments, by dynamically adjusting the trigger sequence number of the discard timer, the discarding mechanism becomes more flexible and targeted, and the level of intelligence of the discarding mechanism is improved.

[0036] Secondly, this disclosure provides an information processing method executed by a communication system, which includes a sending end and a receiving end; the method includes: when the receiving end times out a discard timer, updating at least one of the sequence number of a first variable and the sequence number of a second variable; wherein the first variable is a receiving state variable and the second variable is the largest transmission state variable.

[0037] Thirdly, embodiments of this disclosure provide a terminal, including: a processing module configured to update at least one of the sequence number of a first variable and the sequence number of a second variable when a discard timer times out; wherein the first variable is a receiving state variable and the second variable is a maximum transmission state variable.

[0038] Fourthly, embodiments of this disclosure provide a communication device for performing an optional implementation as described in the first aspect.

[0039] Fifthly, embodiments of this disclosure provide a communication system, including: a transmitter and a receiver; wherein the receiver is configured to perform the method described in the optional implementation of the first aspect.

[0040] In a sixth aspect, embodiments of this disclosure provide a storage medium storing instructions that, when executed on a communication device, cause the communication device to perform the method described in the optional implementation of the first aspect.

[0041] In a seventh aspect, embodiments of this disclosure provide a program product including at least one of a program and instructions, wherein the program and instructions, when executed by a communication device, implement the method described in the optional implementation of the first aspect.

[0042] Eighthly, embodiments of this disclosure provide a computer program that, when run on a computer, causes the computer to perform the information processing method as described in the first aspect, the second aspect, or an optional implementation of the first and second aspects.

[0043] In a ninth aspect, embodiments of this disclosure provide a chip or chip system including processing circuitry configured to perform the methods described according to the first aspect, the second aspect, or alternative implementations of the first and second aspects.

[0044] It is understood that the aforementioned communication devices (such as terminals, network devices, transmitters, receivers, etc.), communication systems, storage media, and program products are all used to execute the methods provided in the embodiments of this disclosure. Therefore, the beneficial effects that can be achieved can be referred to the beneficial effects in the corresponding methods, and will not be repeated here.

[0045] This disclosure provides an information processing method, a communication device, a communication system, and a storage medium. In some embodiments, the terms "information processing method" and "information processing method" may be used interchangeably.

[0046] It is understood that the aforementioned communication devices (such as terminals, network devices, transmitters, receivers, etc.), communication systems, storage media, and program products are all used to execute the methods provided in the embodiments of this disclosure. Therefore, the beneficial effects that can be achieved can be referred to the beneficial effects in the corresponding methods, and will not be repeated here.

[0047] This disclosure provides an information processing method, a communication device, a communication system, and a storage medium. In some embodiments, the terms "information processing method" and "information processing method" may be used interchangeably.

[0048] This disclosure is not exhaustive, but merely illustrative of some embodiments, and is not intended to limit the scope of protection of this disclosure. Unless otherwise specified, each step in a particular embodiment can be implemented as an independent embodiment, and the steps can be arbitrarily combined. For example, a solution after removing some steps in a particular embodiment can also be implemented as an independent embodiment, and the order of the steps in a particular embodiment can be arbitrarily interchanged. Furthermore, the optional implementation methods in a particular embodiment can be arbitrarily combined; moreover, the embodiments can be arbitrarily combined, for example, some or all steps of different embodiments can be arbitrarily combined, and a particular embodiment can be arbitrarily combined with the optional implementation methods of other embodiments. In all embodiments of this disclosure, unless otherwise specified or logically conflicting, the terminology and / or descriptions between the embodiments are consistent and can be mutually utilized. Technical features in different embodiments can be combined to form new embodiments based on their inherent logical relationships.

[0049] The terminology used in the embodiments of this disclosure is for the purpose of describing particular embodiments only and is not intended to limit the scope of this disclosure.

[0050] In this embodiment of the disclosure, unless otherwise stated, elements expressed in the singular form, such as "a," "an," "the," "the," "the," "the," "the," "the," "this," etc., can mean "one and only one," or "one or more," "at least one," etc. For example, when using articles such as "a," "an," "the," etc. in translation, the noun following the article can be understood as either a singular expression or a plural expression.

[0051] In the embodiments disclosed herein, "multiple" refers to two or more.

[0052] In some embodiments, the terms “at least one of A or B, at least one of A and B”, “one or more”, “a plurality of”, “multiple”, etc., may be used interchangeably.

[0053] In some embodiments, the notation "at least one of A and B", "A and / or B", "A in one case, B in another", "in response to one case A, in response to another case B", etc., may include the following technical solutions depending on the situation: in some embodiments, A (execute A regardless of whether there is a branch B); in some embodiments, B (execute B regardless of whether there is a branch A); in some embodiments, execution is selected from A and B (A and B are selectively executed); in some embodiments, both A and B are executed. The same applies when there are more branches such as A, B, C, etc.

[0054] In some embodiments, the notation "A or B" may include the following technical solutions depending on the situation: in some embodiments, A (execute A regardless of whether a branch B exists); in some embodiments, B (execute B regardless of whether a branch A exists); in some embodiments, execution is selected from A and B (A and B are selectively executed). The same applies when there are more branches such as A, B, and C.

[0055] The prefixes "first," "second," etc., used in the embodiments of this disclosure are merely for distinguishing different descriptive objects and do not impose restrictions on the position, order, priority, quantity, or content of the descriptive objects. The description of the descriptive objects is found in the claims or the context of the embodiments, and the use of prefixes should not constitute unnecessary restrictions. For example, if the descriptive object is a "field," the ordinal numbers preceding "field" in "first field" and "second field" do not restrict the position or order of the "fields." "First" and "second" do not restrict whether the "fields" they modify are in the same message, nor do they restrict the order of "first field" and "second field." Similarly, if the descriptive object is a "level," the ordinal numbers preceding "level" in "first level" and "second level" do not restrict the priority between "levels." Furthermore, the number of descriptive objects is not limited by ordinal numbers and can be one or more. For example, in "first device," the number of "devices" can be one or more. Furthermore, the objects modified by different prefixes can be the same or different. For example, if the object being described is "device", then "first device" and "second device" can be the same device or different devices, and their types can be the same or different. Similarly, if the object being described is "information", then "first information" and "second information" can be the same information or different information, and their content can be the same or different.

[0056] In some embodiments, “including A,” “containing A,” “for indicating A,” and “carrying A” can be interpreted as directly carrying A or indirectly indicating A.

[0057] In some embodiments, terms such as "time / frequency" and "time-frequency domain" refer to the time domain and / or frequency domain.

[0058] In some embodiments, terms such as “in response to…”, “in response to determining…”, “in the case of…”, “when…”, “when…”, “if…”, etc. can be used interchangeably. These descriptions all refer to the device making a corresponding action under certain objective circumstances. They do not necessarily limit the time, nor do they require the device to make a judgment action when implementing it, nor do they mean that there must be other limitations.

[0059] In some embodiments, the terms “greater than,” “greater than or equal to,” “not less than,” “more than,” “more than or equal to,” “not less than,” “higher than,” “higher than or equal to,” “not lower than,” and “above” can be used interchangeably, as can the terms “less than,” “less than or equal to,” “not greater than,” “less than,” “less than or equal to,” “not more than,” “lower than,” “lower than or equal to,” “not higher than,” and “below”.

[0060] In some embodiments, devices, etc., may be interpreted as physical or virtual, and their names are not limited to those described in the embodiments. Terms such as “device,” “equipment,” “circuit,” “network element,” “network function,” “network device,” “function,” “node,” “unit,” “section,” “system,” “network,” “chip,” “chip system,” “entity,” and “subject” are interchangeable.

[0061] In some embodiments, "network" can be interpreted as devices included in a network (e.g., access network devices, core network devices, etc.).

[0062] In some embodiments, the terms "access network device (AN device)," "radio access network device (RAN device)," "base station (BS)," "radio base station," "fixed station," "node," "access point," "transmission point (TP)," "reception point (RP)," "transmission / reception point (TRP)," "panel," "antenna panel," "antenna array," "cell," "macro cell," "small cell," "femto cell," "pico cell," "sector," "cell group," "serving cell," "carrier," "component carrier," and "bandwidth part (BWP)" can be used interchangeably.

[0063] In some embodiments, the terms "terminal", "terminal device", "user equipment (UE)", "user terminal", "mobile station (MS)", "mobile terminal (MT)", subscriber station, mobile unit, subscriber unit, wireless unit, remote unit, mobile device, wireless device, wireless communication device, remote device, mobile subscriberstation, access terminal, mobile terminal, wireless terminal, remote terminal, handset, user agent, mobile client, and client can be used interchangeably.

[0064] In some embodiments, access network devices, core network devices, or network devices can be replaced by terminals. For example, embodiments of this disclosure can also be applied to structures where communication between access network devices, core network devices, or network devices and terminals is replaced by communication between multiple terminals (e.g., device-to-device (D2D), vehicle-to-everything (V2X), etc.). In this case, the structure can also be configured such that the terminal has all or part of the functions of the access network device. Furthermore, terms such as "uplink" and "downlink" can be replaced with terms corresponding to communication between terminals (e.g., "sidelink"). For example, uplink channel, downlink channel, etc., can be replaced with sidelink channel, and uplink link, downlink, etc., can be replaced with sidelink link.

[0065] In some embodiments, the terminal may be replaced by an access network device, a core network device, or a network device. In this case, the access network device, core network device, or network device may also be configured to have all or some of the functions of the terminal.

[0066] In some embodiments, the acquisition of data, information, etc., may comply with the laws and regulations of the country where the location is situated.

[0067] In some embodiments, data, information, etc., may be obtained with the user's consent.

[0068] Furthermore, each element, each row, or each column in the table of this disclosure can be implemented as an independent embodiment, and any combination of any element, any row, or any column can also be implemented as an independent embodiment.

[0069] Figure 1A This is a schematic diagram illustrating the architecture of a communication system 100 according to an embodiment of this disclosure. Figure 1A As shown, the communication system 100 includes: terminal 101 and network device 102.

[0070] In some embodiments, network device 102 may include at least one of an access network device and a core network device.

[0071] In some embodiments, terminal 101 includes, for example, at least one of the following: mobile phone, wearable device, Internet of Things device, car with communication function, smart car, tablet computer, computer with wireless transceiver function, virtual reality (VR) terminal device, augmented reality (AR) terminal device, wireless terminal device in industrial control, wireless terminal device in self-driving, wireless terminal device in remote medical surgery, wireless terminal device in smart grid, wireless terminal device in transportation safety, wireless terminal device in smart city, and wireless terminal device in smart home, but is not limited thereto.

[0072] In some embodiments, the access network device is, for example, a node or device that connects a terminal to a wireless network. The access network device may include at least one of the following in a 5G communication system: evolved Node B (eNB), next-generation eNB (ng-eNB), next-generation Node B (gNB), node B (NB), home node B (HNB), home evolved node B (HeNB), radio backhaul device, radio network controller (RNC), base station controller (BSC), base transceiver station (BTS), base band unit (BBU), mobile switching center, base station in a 6G communication system, open RAN, cloud RAN, base station in other communication systems, and access node in a Wi-Fi system, but is not limited thereto.

[0073] In some embodiments, the technical solutions of this disclosure can be applied to the Open RAN architecture. In this case, the interfaces between or within access network devices involved in the embodiments of this disclosure can be transformed into internal interfaces of Open RAN. The processes and information interactions between these internal interfaces can be implemented by software or programs.

[0074] In some embodiments, the access network device may be composed of a central unit (CU) and a distributed unit (DU). The CU may also be called a control unit. The CU-DU structure can separate the protocol layer of the access network device. Some of the protocol layer functions are centrally controlled by the CU, while the remaining part or all of the protocol layer functions are distributed in the DU and centrally controlled by the CU. However, this is not the only possibility.

[0075] In some embodiments, the core network equipment may be a single device, multiple devices, or a group of devices. The device may be virtual or physical. The core network includes, for example, at least one of the following: Evolved Packet Core (EPC), 5G Core Network (5GCN), Next Generation Core (NGC), and 6G Core Network (6GCN).

[0076] It is understood that the communication system described in this disclosure is for the purpose of more clearly illustrating the technical solutions of this disclosure, and does not constitute a limitation on the technical solutions provided in this disclosure. As those skilled in the art will know, with the evolution of system architecture and the emergence of new business scenarios, the technical solutions provided in this disclosure are also applicable to similar technical problems.

[0077] The following embodiments of this disclosure can be applied to Figure 1A The communication system 100 shown, or a part thereof, but not limited to it. Figure 1A The entities shown are illustrative; a communication system may include... Figure 1A All or part of the main body, or may include Figure 1A Other entities besides the main body, the number and form of each entity are arbitrary, each entity can be physical or virtual, the connection relationship between the entities is illustrative, the entities can be unconnected or connected, and the connection can be in any way, it can be a direct connection or an indirect connection, it can be a wired connection or a wireless connection.

[0078] The embodiments disclosed herein can be applied to Long Term Evolution (LTE), LTE-Advanced (LTE-A), LTE-Beyond (LTE-B), SUPER 3G, IMT-Advanced, 4th generation mobile communication system (4G), 5th generation mobile communication system (5G), 5G New Radio (NR), Future Radio Access (FRA), New-Radio Access Technology (RAT), New Radio (NR), New Radio Access (NX), Futuregeneration Radio Access (FX), Global System for Mobile Communications (GSM), CDMA2000, Ultra Mobile Broadband (UMB), IEEE 802.11 (Wi-Fi), IEEE 802.16 (WiMAX), and IEEE 802.20, Ultra-Wideband (UWB), Bluetooth (a registered trademark), Public Land Mobile Network (PLMN) networks, Device-to-Device (D2D) systems, Machine-to-Machine (M2M) systems, Internet of Things (IoT) systems, Vehicle-to-Everything (V2X) systems, systems utilizing other communication methods, and next-generation systems built upon them, etc. Furthermore, multiple systems can be combined (e.g., a combination of LTE or LTE-A with 5G).

[0079] In some embodiments, the AMF mode can provide reliable service in the Acknowledged Mode (AM) of Radio Link Control (RLC).

[0080] The AM receiver has the following state variables (these state variables are stored in the Rx of the AM entity):

[0081] (1) RX_Next — Receive status variable. This status variable stores the value of the sequence number (SN) following the last fully received RLC SDU in the sequence and is used as the lower edge of the receive window. It is initially set to 0 and is updated whenever the AM RLC entity receives an RLC SDU with SN = RX_Next.

[0082] (2) RX_Next_Status_Trigger — The status variable for the t-Reassembly timer. This status variable stores the value of the sequence number following the RLC SDU sequence number that triggered the t-Reassembly timer. The t-Reassembly timer can be replaced by a reordering timer.

[0083] (3) RX_Highest_Status — Maximum status transfer status variable. This status variable holds the highest possible value of SN when a status PDU needs to be constructed. This value can be indicated by "ACK_SN". It is initially set to 0.

[0084] (4) RX_Next_Highest — Highest received status variable. This status variable stores the value of the next highest received RLC SDU SN after the highest received RLC SDU SN. It is initially set to 0.

[0085] The above content can be described as follows:

[0086] a)RX_Next-Receive state variable.

[0087] This state variable holds the value of the SN following the last in-sequence completely received RLC SDU, and it serves as the lower edge of thereceiving window. It is initially set to 0, and is updated whenever the AM RLCentity receives an RLC SDU with SN=RX_Next.

[0088] b)RX_Next_Status_Trigger-t-Reassembly state variable.

[0089] This state variable holds the value of the SN following the SN of theRLC SDU which triggered t-Reassembly.

[0090] c)RX_Highest_Status-Maximum STATUS transmit state variable.

[0091] This state variable holds the highest possible value of the SN whichcan be indicated by "ACK_SN" when aSTATUS PDU needs to be constructed. It is initially set to 0.

[0092] d)RX_Next_Highest-Highest received state variable.

[0093] This state variable holds the value of the SN following the SN of theRLC SDU with the highest SN among received RLC SDUs.It is initially set to 0.

[0094] In some embodiments, the receiver variables can be described as follows:

[0095] (1) RX_Next: The lower edge of the receiver, meaning that all previous data packets have been received completely. Because AM mode determines the upper boundary through the lower boundary, the RLC SDU with SN = RX_Next + AM_Window_Size - 1 is the highest SN of the packet that can be received.

[0096] (2)RX_Next_Highest: The highest SN received packet.

[0097] (3)RX_Highest_Status: This means that the status report is clear. Only data packets with a status report below this value can send a status report to the sender.

[0098] (4)RX_Next_Status_Trigger: The SN associated with the reordering timer.

[0099] In some embodiments, at the receiving end, if a data packet is received, the following decision is made: packets outside the window will be discarded or duplicate packets will be discarded, otherwise they will be placed in a buffer; if all segments of x need to be received, they will be submitted to the Packet Data Convergence Protocol (PDCP) layer; x may cause RX_Highest_Status, RX_Next (lower edge right shift) updates.

[0100] Optionally, such as Figure 1B As shown, if packets 1 and 2 are received, the bottom edge of the window is 3, meaning RX-Next = 3 and RX_Highest_Status = 3. This indicates that the status of packets up to 3 has been determined. Then, packets 4 and 5 arrive, and the highest received packet number (SN) is RX_Next_Highest = 6. A waiting timer (i.e., t-Reassembly) is started, and RX_Next_Status_Trigger is 6. The system then waits for any incomplete packets between 3 and 6. After packets 7 and 8 are received, RX_Highest_Status is updated to 9.

[0101] Optionally, a new mechanism is introduced whereby AM packets can also be discarded after a certain waiting period. For example, in the above... Figure 1B In the process, a discard timer (t-RxDiscard) can be started. After the discard timer expires, RX-next (i.e., ...) will be moved. Figure 1B These waiting packets will be skipped, for example, skipping 3). It's possible that Rx-next moves significantly, for example, if it moves to position 6 or 9 in the diagram, skipping 3. In this case, RX_Highest_Status, the packet whose status report is clear, should also be updated. However, the current mechanism does not perform this operation, so it needs to be considered.

[0102] Optionally, after a lost timer times out, the RX_Highest_Status data packet (i.e., the data packet whose status report is clear) should also be updated. However, this operation is not currently implemented in the mechanism and therefore needs to be considered.

[0103] In some embodiments, both the receiving end and the transmitting end can be, but are not limited to, a terminal, a base station, a core network device, etc. The terminal can be a UE, or the UE can be a terminal.

[0104] like Figure 2This is an interactive schematic diagram illustrating an information processing method according to an embodiment of the present disclosure. For example... Figure 2 As shown, this disclosure relates to an information processing method for a communication system 100, the method comprising:

[0105] In step S2101, the receiving end updates at least one of the sequence numbers of the first variable and the second variable. Optionally, the receiving end can be a terminal or a network device; the network device can be a base station or core network device, etc.

[0106] In some embodiments, if the discard timer times out, the receiving end updates at least one of the sequence numbers of the first variable and the second variable.

[0107] Optionally, the first variable can be a received state variable; for example, the first variable can be RX_Next.

[0108] Optionally, the value of the first variable (or sequence number) can be the RLC sequence number of the last RLC service data unit received in sequence and completely received by the RLC entity plus 1.

[0109] Optionally, the second variable is the highest transmission status variable; for example, the second variable could be RX_Highest_Status.

[0110] Optionally, the value of the second variable (or sequence number) can be the highest RLC sequence number that the RLC entity can indicate via ACK_SN when building the Status PDU.

[0111] Optionally, the names of the first and second variables are not restricted.

[0112] Optionally, the receiving entity (e.g., an AM RLC receiving entity) updates at least one of the sequence numbers of the first variable and the second variable in the event of a discard timer timeout.

[0113] Optionally, the second variable (e.g., the maximum transmission state variable) is updated to the sequence number of the next data packet that has not been fully received after the specified sequence number. The data packets involved in this disclosure can be any data packet, such as a Service Data Unit (SDU) or Protocol Data Unit (PDU), or any data packet that can be transmitted in RLC or PDCP.

[0114] In some embodiments, when the discard timer times out, the receiving end updates at least one of the sequence number of the first variable and the sequence number of the second variable based on the first sequence number; wherein the first sequence number is the sequence number of the next data packet that has not been completely received after the specified sequence number.

[0115] In some embodiments, when the discard timer times out, the receiving end updates the sequence number of the first variable based on the first sequence number; and updates the sequence number of the second variable based on the updated sequence number of the first variable; wherein the first sequence number is the sequence number of the next data packet that has not been completely received after the specified sequence number.

[0116] Optionally, the first sequence number can be any sequence number following the current second variable, or the first sequence number can be any sequence number greater than the current second variable.

[0117] Optionally, the specified sequence number can be any sequence number following the current second variable, or the specified sequence number can be any sequence number greater than the current second variable.

[0118] Optionally, the specified serial number can be the serial number where the discard timer was started. For example, such as... Figure 1B As shown, if the discard timer is started in packet 3, then the specified sequence number can be 3.

[0119] Optionally, if the discard timer times out, the receiver updates the sequence number of the first variable to the first sequence number. For example, SN >= RX_Next_Discard_Trigger is used to update the RX_Next next to the SN of the first RLC SDU (if not all bytes have been received yet).

[0120] Optionally, if the discard timer times out, the receiver updates the sequence number of the second variable to the first sequence number. For example, RX_Highest_Status is updated to the SN of the first RLC SDU, where SN >= RX_Next_Discard_Trigger has not yet received all bytes.

[0121] Optionally, if the discard timer times out, the receiving end updates the sequence number of the first variable to the first sequence number; and updates the sequence number of the second variable to the updated sequence number of the first variable. For example, RX_Next is updated to the first SN that has not yet received all bytes of the RLC SDU after using SN>=RX_Next_Discard_Trigger, and then RX_Highet_Status is updated to the same position using RX_Next.

[0122] Optionally, if the discard timer times out, the receiving end updates at least one of the sequence numbers of the first variable and the second variable based on the maximum value of the first sequence number and the second sequence number; wherein the second sequence number is the sequence number of the next data packet that has not been completely received after the current first variable.

[0123] For example, when a t-RxDiscard expires, the AM RLC entity updates RX_Highest_Status to the SN of the first RLC SDU that has not yet received all of its bytes, provided that SN >= RX_Next_Discard_Trigger and SN >= the current RX_Highest_Status; and / or updates RX_Next next to the SN of the first RLC SDU, where SN >= RX_Next_Discard_Trigger has not yet received all of its bytes.

[0124] Optionally, if the discard timer times out and the sequence number of the second variable is less than the first sequence number, the receiving end updates at least one of the sequence numbers of the first variable and the second variable based on the first sequence number.

[0125] For example, when a t-RxDiscard expires, the AM RLC entity updates RX_Highest_Status to the SN of the first RLC SDU that has not yet received all bytes, provided that SN >= RX_Next_Discard_Trigger; and / or updates RX_Next next to the SN of the first RLC SDU, where SN >= RX_Next_Discard_Trigger has not yet received all bytes.

[0126] Optionally, if the discard timer times out, the receiving end updates the sequence number of the first variable based on the first sequence number; if the sequence number of the second variable is not in the receiving window, and / or if the sequence number of the second variable is not equal to the sum of the sequence number of the first variable and the size of the receiving window, the receiving end determines that the updated sequence number of the second variable is the updated sequence number of the first variable.

[0127] Optionally, the sequence number of the second variable is not equal to the sum of the sequence number of the first variable and the size of the receiving window, which may include: the sequence number of the second variable is less than the sum of the sequence number of the first variable and the size of the receiving window.

[0128] For example, when t-RxDiscard expires, the AM RLC entity updates RX_Next to the SN of the first RLC SDU that has not yet received all bytes, where SN >= RX_Next_Discard_Trigger has not yet received all bytes; and if RX_Highest_Status is not within the receiving window, and / or RX_Highest_Status is not equal to RX_Next + AM_Window_Size, RX_Highest_Status is updated to RX_Next.

[0129] In some embodiments, when the discard timer times out, the receiving end updates the sequence number of the second variable if a predetermined condition is met, wherein the predetermined condition is met if the updated sequence number of the second variable is greater than the original sequence number of the second variable.

[0130] Optionally, if the receiver discards a timer that has expired, the sequence number of the first variable is updated if predetermined conditions are met.

[0131] Optionally, if the receiving end determines that the predetermined conditions are not met, it will not perform the operation of updating the sequence number of the second variable.

[0132] Optionally, the next data packet that is not fully received after the second variable (e.g., the largest transmission status variable) is updated to a specified value must meet a predetermined condition: the value of the second variable after the update must be greater than the value before the update.

[0133] In some embodiments, “get,” “obtain,” “receive,” “transmit,” “send and / or receive” can be used interchangeably and can be interpreted as receiving from other entities, obtaining from protocols, obtaining from higher layers, obtaining through self-processing, or autonomously implementing, among other meanings.

[0134] In some embodiments, terms such as “send,” “transmit,” “report,” “distribute,” “transfer,” “bidirectional transmission,” “send and / or receive” can be used interchangeably.

[0135] In some embodiments, the names of information, etc., are not limited to the names described in the embodiments. Terms such as "information", "message", "signal", "signaling", "report", "configuration", "indication", "instruction", "command", "channel", "parameter", "domain", "field", "symbol", "bit", and "data" can be used interchangeably.

[0136] In some embodiments, terms such as "certain", "preset", "specified", "default", "set", "indicated", "a certain", "any", and "first" can be used interchangeably. "Certain A", "preset A", "specified A", "default A", "set A", "indicated A", "a certain A", "any A", and "first A" can be interpreted as A pre-defined in a protocol or the like, or as A obtained through setting, configuration, or instruction, or as specific A, specified A, a certain A, any A, or first A, but are not limited thereto.

[0137] In some embodiments, the determination or judgment can be made by a value represented by 1 bit (0 or 1), or by a true or false value (boolean), or by a comparison of numerical values ​​(e.g., a comparison with a predetermined value), but is not limited thereto.

[0138] In step S2102, the receiving end discards data packets in the buffer whose sequence number is less than a specified sequence number. Here, the data packet can be any data packet, such as a Service Data Unit (SDU) or Protocol Data Unit (PDU), or any data packet that can be transmitted in RLC or PDCP, etc.

[0139] Optionally, the receiving end discards data packets in the buffer whose sequence number is less than the sequence number at which the discard timer started.

[0140] Optionally, the receiving end discards the data packet corresponding to the third sequence number in the buffer, where the third sequence number is less than the specified sequence number or the sequence number at which the timer started is discarded.

[0141] For example, such as Figure 1BAs shown, if the discard timer is started at 6, then the data packets corresponding to 3, 4, or 5 can be discarded.

[0142] Optionally, step S2102 may be performed before, after, or simultaneously with step S2101.

[0143] Step S2103: The receiving end determines the sequence number of the restarted discard timer.

[0144] In some embodiments, when the discard timer times out, the receiving end determines the sequence number to restart the discard timer based on the relationship between the sequence number of the second variable and the sum of the sequence number of the first variable and a predetermined value.

[0145] Optionally, if the discard timer times out and the sequence number of the second variable is greater than the sum of the sequence number of the first variable and the predetermined value, the receiving end determines that the sequence number of the restarted discard timer is the updated sequence number of the second variable.

[0146] For example, when the t-RxDiscard expires, the AM RLC entity determines that RX_Next_Highest > RX_Next+1; starts the t-RxDiscard; and sets RX_Next_Discard_Trigger to RX_Next_Highest.

[0147] Optionally, if the discard timer expires at the receiving end, and if the sequence number of the second variable is equal to the sum of the sequence number of the first variable and the predetermined value, and there are missing data packets in the data unit corresponding to the first variable, the receiving end determines that the sequence number of the restarted discard timer is the updated sequence number of the second variable.

[0148] For example, when t-RxDiscard expires, the AM RLC entity determines that RX_Next_Highest = RX_Next + 1, and if there is at least one missing byte segment of the SDU associated with SN = RX_Next before the last byte of all receive segments of that SDU, t-RxDiscard is initiated; and RX_Next_Discard_Trigger is set to RX_Next_Highest.

[0149] The information processing method involved in the embodiments of this disclosure may include at least one of steps S2101 to S2103. For example, step S2101 may be implemented as a standalone embodiment; step S2102 may be implemented as a standalone embodiment; step S2103 may be implemented as a standalone embodiment; a combination of steps S2101 and S2102 may be implemented as a standalone embodiment; a combination of steps S2101 and S2103 may be implemented as a standalone embodiment; a combination of steps S2101 to S2103 may be implemented as a standalone embodiment.

[0150] In some embodiments, steps S2102 and S2103 may be optional, and one or more of these steps may be omitted or substituted in different embodiments.

[0151] In some embodiments, the steps and their optional implementations in other embodiments described before or after this embodiment, as well as other related parts in the specification, can be referred to, and will not be repeated here.

[0152] Figure 3 This is an interactive schematic diagram illustrating an information processing method according to an embodiment of the present disclosure. For example... Figure 3 As shown, this disclosure relates to an information processing method for a communication system 100, the method comprising one of the following steps:

[0153] In step S3101, if the discard timer times out, the receiving end updates at least one of the sequence numbers of the first variable and the second variable. Optionally, the first variable is the receive status variable (RX_Next), and the second variable is the highest transmission status variable (RX_Highest_Status).

[0154] For optional implementations of step S3101, please refer to [link / reference]. Figure 2 Optional implementation methods in step S2101, and Figure 2 Other related parts in the embodiments involved will not be described in detail here.

[0155] In some embodiments, updating at least one of the sequence number of the first variable and the sequence number of the second variable includes one of the following: updating at least one of the sequence number of the first variable and the sequence number of the second variable based on the first sequence number; updating the sequence number of the first variable based on the first sequence number; updating the sequence number of the second variable based on the updated sequence number of the first variable; wherein the first sequence number is: the sequence number of the next data packet that has not been fully received after the specified sequence number.

[0156] In some embodiments, updating at least one of the sequence number of the first variable and the sequence number of the second variable based on the first sequence number includes: updating at least one of the sequence number of the first variable and the sequence number of the second variable based on the maximum value of the first sequence number and the second sequence number; wherein the second sequence number is the sequence number of the next data packet that has not been fully received after the current first variable; and if the sequence number of the second variable is less than the first sequence number, updating at least one of the sequence number of the first variable and the sequence number of the second variable based on the first sequence number.

[0157] In some embodiments, updating the sequence number of the second variable based on the updated sequence number of the first variable includes at least one of the following: if the sequence number of the second variable is not in the receiving window, determining that the updated sequence number of the second variable is the updated sequence number of the first variable; if the sequence number of the second variable is not equal to the sum of the sequence number of the first variable and the size of the receiving window, determining that the updated sequence number of the second variable is the updated sequence number of the first variable.

[0158] In some embodiments, the specified serial number is the serial number at which the discard timer starts.

[0159] In some embodiments, updating at least one of the sequence number of the first variable and the sequence number of the second variable includes: updating the sequence number of the second variable when a predetermined condition is met, wherein the predetermined condition is met when the updated sequence number of the second variable is greater than the original sequence number of the second variable.

[0160] In some embodiments, the method further includes: discarding data packets in the buffer whose sequence number is less than a specified sequence number.

[0161] In some embodiments, the method further includes one of the following: if the sequence number of the second variable is greater than the sum of the sequence number of the first variable and a predetermined value, determining that the sequence number of the restarted discard timer is the updated sequence number of the second variable; if the sequence number of the second variable is equal to the sum of the sequence number of the first variable and a predetermined value, and the data unit corresponding to the first variable has missing data packets, determining that the sequence number of the restarted discard timer is the updated sequence number of the second variable.

[0162] In some embodiments, the steps and their optional implementations in other embodiments described before or after this embodiment, as well as other related parts in the specification, can be referred to, and will not be repeated here.

[0163] This disclosure protects a method for updating the largest transport state variable.

[0164] In some embodiments, the highest transmission status variable (RX_Highest_Status is updated at t-RxDiscard expiry) is updated after the discard timer (t-RxDiscard) times out. Optionally, the above method is applicable to receiver entities, such as RLC entities or RLC AM receiver entities (RLC AM RX entities).

[0165] In some embodiments, the largest transmission state variable is updated to the next packet that was not fully received after the specified sequence number (SN).

[0166] Optionally, RX_Highest_Status is updated to the SN of the first RLC SDU, where SN >= RX_Next_Discard_Trigger has not yet received all bytes (e.g., RX_Highest_Status is updated to the SN of the first RLC SDU with SN >= RX_Next_Discard_Trigger for which not all bytes have been received).

[0167] Optionally, RX_Next is updated to the SN of the first RLC SDU that has not yet received all bytes after using SN>=RX_Next_Discard_Trigger, and then RX_Highet_Status is updated to the SN of RX_Next using RX_Next (e.g., update RX_Next to the SN of the first RLC SDU with SN>=RX_Next_Discard_Trigger for which not all bytes have been received, then RX_Highet_Status is updated to the SN of RX_Next).

[0168] In some embodiments, execution is only performed if a predefined condition is met after the highest transmission status variable has been updated to a specified value (e.g., a specified sequence number) and the next data packet that is not fully received is updated; otherwise, execution is not required. Optionally, the predefined condition may be that the updated value (e.g., sequence number) of RX_Highest_Status is greater than the value (e.g., sequence number) before the update.

[0169] Here, the positions where RX_Highest_Status and RX_Next are moved can be compared. If the latter moves faster than RX_Highest_Status, then RX_Highest_Status needs to be updated because at this time, the movement brought by RX-Next has made the status of more data packets more certain. Therefore, RX_Highest_Status can be moved forward to indicate that the status of more data packets has been determined. However, if the latter moves slower than RX_Highest_Status, there is no need to update it if the latter moves faster than RX_Highest_Status. Therefore, the update of RX_Highest_Status requires a precondition. In some embodiments, the following embodiments are provided:

[0170] Embodiment 1: Operations for the discard timer to expire.

[0171] When t-RxDiscard expires, the receiver of the AM RLC entity shall:

[0172] - Discard the AMD PDUs in the receive buffer using SN < RX_Next_Discard_Trigger (if any);

[0173] - Update RX_Highest_Status to the SN of the first RLC SDU for which not all bytes have been received, where this SN satisfies the conditions: SN >= RX_Next_Discard_Trigger and SN >= the current RX_Highest_Status;

[0174] - Update RX_Next next to the SN of the first RLC SDU for which not all bytes have been received where SN >= RX_Next_Discard_Trigger;

[0175] - If RX_Next_Highest > RX_Next + 1; or

[0176] - If RX_Next_Highest = RX_Next + 1, and there is at least one missing byte segment of the SDU associated with SN = RX_Next before the last byte of all received segments of this SDU:

[0177] - Start t-RxDiscard;

[0178] - Set RX_Next_Discard_Trigger to RX_Next_Highest.

[0179] The above content can be described as follows:

[0180] Option1:

[0181] 当t-RxDiscard超时时,AM RLC实体的接收方应:

[0182] -丢弃接收缓冲区中SN < RX_Next_Discard_Trigger的AMD PDU(如有);

[0183] -将RX_Highest_Status更新为第一个RLC SDU的SN,该SDU的SN >= RX_Next_Discard_Trigger且SN >= 当前RX_Highest_Status,且并非所有字节都已接收;

[0184] -将RX_Next更新为第一个RLC SDU的SN,该SDU的SN >= RX_Next_Discard_Trigger且并非所有字节都已接收;

[0185] -如果RX_Next_Highest > RX_Next + 1;或者

[0186] -如果RX_Next_Highest = RX_Next + 1且在该SDU的所有接收段的最后一个字节之前,与SN = RX_Next相关联的SDU存在至少一个缺失字节段:

[0187] -启动t-RxDiscard;

[0188] -将RX_Next_Discard_Trigger设置为RX_Next_Highest。

[0189] Example 2: Operations when the discard timer expires.

[0190] When the t-RxDiscard expires, the receiver of the AM RLC entity shall:

[0191] - Discard the AMD PDUs in the receive buffer with SN < RX_Next_Discard_Trigger;

[0192] - If RX_Highest_Status is lower than the SN of the first RLC SDU for which not all bytes have been received, and SN >= RX_Next_Discard_Trigge:

[0193] - Update RX_Highest_Status to the SN of the first RLC SDU for which not all bytes have been received, where SN >= RX_Next_Discard_Trigger;

[0194] - Update RX_Next next to the SN of the first RLC SDU for which not all bytes have been received, where SN >= RX_Next_Discard_Trigger;

[0195] - If RX_Next_Highest > RX_Next + 1; or

[0196] - If RX_Next_Highest = RX_Next + 1, and there is at least one missing byte segment for the SDU associated with SN = RX_Next before the last byte of all received segments of this SDU:

[0197] - Start t-RxDiscard;

[0198] - Set RX_Next_Discard_Trigger to RX_Next_Highest.

[0199] The above can be described as follows:

[0200] Option2:

[0201] When t-RxDiscard expires, the receiving side of an AM RLC entity shall:

[0202] - Discard the AMD PDU(s) in the reception buffer with SN < RX_Next_Discard_Trigger, if any;

[0203] - 如果RX_Highest_Status低于第一个RLC SDU的SN,该SDU的SN >= RX_Next_Discard_Trigger且并非所有字节都已被接收:

[0204] - 将RX_Highest_Status更新为第一个RLC SDU的SN,该SDU的SN >= RX_Next_Discard_Trigger且并非所有字节都已被接收;

[0205] - 将RX_Next更新为第一个RLC SDU的SN,该SDU的SN >= RX_Next_Discard_Trigger且并非所有字节都已被接收;

[0206] - 如果RX_Next_Highest > RX_Next + 1;或者

[0207] - 如果RX_Next_Highest = RX_Next + 1且在该SDU的所有接收段的最后一个字节之前,存在与SN = RX_Next相关联的SDU的至少一个缺失字节段:

[0208] - 启动t-RxDiscard;

[0209] - 将RX_Next_Discard_Trigger设置为RX_Next_Highest。

[0210] Example 3. Operations when the discard timer expires.

[0211] When t-RxDiscard expires, the receiver of the AM RLC entity shall:

[0212] - Discard the AMD PDUs in the receive buffer with SN < RX_Next_Discard_Trigger (if any);

[0213] - Update RX_Next to the SN of the first RLC SDU that has not yet received all bytes, where SN >= RX_Next_Discard_Trigger;

[0214] -If RX_Next_Highest > RX_Next+1; or

[0215] - If RX_Next_Highest = RX_Next + 1, and there is at least one missing byte segment of the SDU associated with SN = RX_Next before the last byte of all receive segments of this SDU:

[0216] - Launch t-RxDiscard;

[0217] - Set RX_Next_Discard_Trigger to RX_Next_Highest.

[0218] - If RX_Highest_Status is not within the receive window, and RX_Highest_Status is not equal to RX_Next + AM_Window_Size, or if RX_Highest_Status is not within the receive window:

[0219] - Update RX_Highest_Status to RX_Next.

[0220] The above content can be described as follows:

[0221] Option 3:

[0222] When t-RxDiscard expires, the receiving side of an AM RLC entityshall:

[0223] -discard the AMD PDU(s) in the reception buffer with SN <RX_Next_Discard_Trigger,if any;

[0224] -update RX_Next to the SN of the first RLC SDU with SN>=RX_Next_Discard_Trigger for which not all bytes have been received;

[0225] - if RX_Next_Highest > RX_Next + 1; or

[0226] - if RX_Next_Highest = RX_Next + 1 and there is at least one missing byte segment of the SDU associated with SN = RX_Next before the last byte of all received segments of this SDU:

[0227] - start t - RxDiscard;

[0228] - set RX_Next_Discard_Trigger to RX_Next_Highest.

[0229] - if RX_Highest_Status falls outside of the receiving window and RX_Highest_Status is not equal to RX_Next + AM_Window_Size:

[0230] - update RX_Highest_Status to RX_Next.

[0231] Example 4. Operations when the discard timer expires.

[0232] When t - RxDiscard expires, the receiver of the AM RLC entity shall:

[0233] - Discard AMD PDUs in the receive buffer using the SN < RX_Next_Discard_Trigger trigger (if any);

[0234] - Update RX_Next to the SN of the first RLC SDU for which not all bytes have been received, where SN >= RX_Next_Discard_Trigger; - if RX_Next_Highest > RX_Next + 1; or

[0235] - if RX_Next_Highest = RX_Next + 1 and there is at least one missing byte segment of the SDU associated with SN = RX_Next before the last byte of all received segments of this SDU:

[0236] - Start t - RxDiscard;

[0237] - Set RX_Next_Discard_Trigger to RX_Next_Highest.

[0238] - If RX_Highest_Status exceeds the receive window:

[0239] - Update RX_Highest_Status to RX_Next.

[0240] The above can be described as follows:

[0241] Option 4:

[0242] When t-RxDiscard expires, the receiving side of an AM RLC entity shall:

[0243] - discard the AMD PDU(s) in the reception buffer with SN < RX_Next_Discard_Trigger, if any;

[0244] - update RX_Next to the SN of the first RLC SDU with SN >= RX_Next_Discard_Trigger for which not all bytes have been received;

[0245] - if RX_Next_Highest > RX_Next + 1; or

[0246] - if RX_Next_Highest = RX_Next + 1 and there is at least one missing byte segment of the SDU associated with SN = RX_Next before the last byte of all received segments of this SDU:

[0247] - start t-RxDiscard;

[0248] - set RX_Next_Discard_Trigger to RX_Next_Highest.

[0249] -if RX_Highest_Status falls outside of the receiving window:

[0250] -update RX_Highest_Status to RX_Next.

[0251] In some embodiments, the steps and their optional implementations in other embodiments described before or after this embodiment, as well as other related parts in the specification, can be referred to, and will not be repeated here.

[0252] This disclosure also proposes an apparatus (also referred to as a communication device, etc.) for implementing any of the above methods. For example, an apparatus is proposed that includes units or modules for implementing the steps performed by the terminal in any of the above methods. Furthermore, another apparatus is proposed that includes units or modules for implementing the steps performed by a network device (e.g., an access network device, a core network functional node, or a core network device) in any of the above methods.

[0253] It should be understood that the division of units or modules in the above device is only a logical functional division. In actual implementation, they can be fully or partially integrated into a single physical entity, or they can be physically separated. Furthermore, the units or modules in the device can be implemented by a processor calling software: for example, the device includes a processor connected to a memory containing instructions. The processor calls the instructions stored in the memory to implement any of the above methods or to implement the functions of the units or modules in the above device. The processor can be, for example, a general-purpose processor, such as a Central Processing Unit (CPU) or a microprocessor, and the memory can be internal or external to the device. Alternatively, the units or modules in the device can be implemented in the form of hardware circuits. The functionality of some or all of the units or modules can be achieved through the design of these hardware circuits, which can be understood as one or more processors. For example, in one implementation, the hardware circuit is an Application-Specific Integrated Circuit (ASIC), and the functionality of some or all of the units or modules is achieved through the design of the logical relationships between the components within the circuit. In another implementation, the hardware circuit can be implemented using a Programmable Logic Device (PLD), such as a Field Programmable Gate Array (FPGA), which can include a large number of logic gates. The connection relationships between the logic gates are configured through configuration files, thereby achieving the functionality of some or all of the units or modules. All units or modules of the above device can be implemented entirely through processor-called software, entirely through hardware circuits, or partially through processor-called software with the remaining parts implemented through hardware circuits.

[0254] In this embodiment, the processor is a circuit with signal processing capabilities. In one implementation, the processor can be a circuit with instruction read and execute capabilities, such as a Central Processing Unit (CPU), a microprocessor, a graphics processing unit (GPU) (which can be understood as a microprocessor), or a digital signal processor (DSP). In another implementation, the processor can implement certain functions through the logical relationships of hardware circuits. The logical relationships of the aforementioned hardware circuits are fixed or reconfigurable. For example, the processor is a hardware circuit implemented using an application-specific integrated circuit (ASIC) or a programmable logic device (PLD), such as an FPGA. In a reconfigurable hardware circuit, the process of the processor loading a configuration document and configuring the hardware circuit can be understood as the process of the processor loading instructions to implement the functions of some or all of the above units or modules. Furthermore, it can also be a hardware circuit designed for artificial intelligence, which can be understood as an ASIC, such as a Neural Network Processing Unit (NPU), a Tensor Processing Unit (TPU), or a Deep Learning Processing Unit (DPU).

[0255] Figure 4 This is a schematic diagram of the structure of the receiver 4100 provided in an embodiment of this disclosure. Figure 4 As shown, the receiving end 4100 includes at least one of a sending module 4101 and a processing module 4102. In some embodiments, the sending module 4101 is used to receive data packets. Optionally, the sending module 4101 is used to perform at least one of the receiving and / or sending steps performed by the receiving end 4100 in any of the above methods, which will not be described in detail here. In some embodiments, the processing module 4102 is used to update at least one of the sequence numbers of the first variable and the second variable. Optionally, the processing module 4102 is used to perform at least one of the processing steps performed by the receiving end 4100 in any of the above methods (e.g., steps S2101 and / or steps S2102 and / or steps S2103, etc., but not limited thereto), which will not be described in detail here.

[0256] In some embodiments, the transceiver module may include a transmitting module and / or a receiving module, which may be separate or integrated. Optionally, the transceiver module may be interchangeable with a transceiver.

[0257] In some embodiments, the processing module may be a single module or may include multiple sub-modules. Optionally, the multiple sub-modules may each perform all or part of the steps required by the processing module.

[0258] In some embodiments, the processing module can be replaced by the processor, and the transceiver module can be replaced by the transceiver.

[0259] Figure 5A This is a schematic diagram of the structure of the communication device 5100 proposed in this embodiment. The communication device 5100 can be a network device (e.g., an access network device (e.g., a base station), a core network device), a terminal (e.g., a user equipment), a chip, chip system, or processor that supports the network device in implementing any of the above methods, or a chip, chip system, or processor that supports the terminal in implementing any of the above methods. The communication device 5100 can be used to implement the methods described in the above method embodiments; for details, please refer to the descriptions in the above method embodiments.

[0260] like Figure 5A As shown, the communication device 5100 is used to execute any of the above methods. In some embodiments, the communication device 5100 includes one or more processors 5101. The processor 5101 may be a general-purpose processor or a special-purpose processor, such as a baseband processor or a central processing unit. The baseband processor may be used to process communication protocols and communication data, and the central processing unit may be used to control communication devices (e.g., base stations, baseband chips, terminal devices, terminal device chips, DUs or CUs, etc.), execute programs, and process program data. Optionally, the communication device 5100 is used to execute any of the above methods. Optionally, one or more processors 5101 are used to invoke instructions to cause the communication device 5100 to execute any of the above methods.

[0261] In some embodiments, the communication device 5100 further includes one or more transceivers 5102. When the communication device 5100 includes one or more transceivers 5102, the transceiver 5102 performs at least one of the communication steps such as sending and / or receiving in the above method, and the processor 5101 performs at least one of other steps (e.g., steps S2101 and / or steps S2102 and / or steps S2103, etc., but not limited thereto). In optional embodiments, the transceiver may include a receiver and / or a transmitter, which may be separate or integrated together. Optionally, the terms transceiver, transceiver unit, transceiver, transceiver circuit, interface circuit, interface, etc., can be used interchangeably; the terms transmitter, transmitting unit, transmitter, transmitting circuit, etc., can be used interchangeably; and the terms receiver, receiving unit, receiver, receiving circuit, etc., can be used interchangeably.

[0262] In some embodiments, the communication device 5100 further includes one or more memories 5103 for storing data and / or instructions. Optionally, one or more processors 5101 are used to invoke instructions stored in the memory 5103 to cause the communication device 5100 to perform any of the above methods. Optionally, all or part of the memory 5103 may also be located outside the communication device 5100. In an optional embodiment, the communication device 5100 may include one or more interface circuits 5104. Optionally, the interface circuit 5104 is connected to the memory 5103 and can be used to receive data and / or instructions from the memory 5103 or other devices, and can be used to send data and / or instructions to the memory 5103 or other devices. For example, the interface circuit 5104 can read data and / or instructions stored in the memory 5103 and send the data and / or instructions to the processor 5101.

[0263] The communication device 5100 described in the above embodiments may be a network device or a terminal, but the scope of the communication device 5100 described in this disclosure is not limited thereto, and the structure of the communication device 5100 may vary. Figure 5A The limitations. The communication device may be a standalone device or part of a larger device. For example, the communication device may be: (1) a standalone integrated circuit IC, or chip, or chip system or subsystem; (2) a collection of one or more ICs, optionally including storage components for storing data, programs and / or instructions; (3) an ASIC, such as a modem; (4) a module that can be embedded in other devices; (5) a receiver, terminal device, smart terminal device, cellular phone, wireless device, handheld device, mobile unit, vehicle device, network device, cloud device, artificial intelligence device, etc.; (6) others, etc.

[0264] Figure 5BThis is a schematic diagram of the structure of chip 5200 according to an embodiment of this disclosure. For cases where the communication device 5100 can be a chip or a chip system, please refer to... Figure 5B The diagram shown is a schematic representation of the structure of chip 5200, but it is not limited to this.

[0265] Chip 5200 includes one or more processors 5201. Chip 5200 is used to perform any of the methods described above.

[0266] In some embodiments, chip 5200 further includes one or more interface circuits 5202. Optionally, terms such as interface circuit, interface, and transceiver pin can be used interchangeably. In some embodiments, chip 5200 further includes one or more memories 5203 for storing data and / or instructions. Optionally, all or part of the memories 5203 may be located outside of chip 5200. Optionally, the interface circuit 5202 is connected to the memories 5203, and the interface circuit 5202 can be used to receive data and / or instructions from the memories 5203 or other devices, and the interface circuit 5202 can be used to send data and / or instructions to the memories 5203 or other devices. For example, the interface circuit 5202 can read data and / or instructions stored in the memories 5203 and send the data and / or instructions to the processor 5201.

[0267] In some embodiments, the interface circuit 5202 performs at least one of the communication steps such as sending and / or receiving in the above-described method. For example, the interface circuit 5202 performing the communication steps such as sending and / or receiving in the above-described method means that the interface circuit 5202 performs data and / or instruction interaction between the processor 5201, the chip 5200, the memory 5203, or the transceiver device. In some embodiments, the processor 5201 performs at least one of other steps (e.g., steps S2101 and / or steps S2102 and / or steps S2103, but not limited thereto).

[0268] The modules and / or devices described in the various embodiments, such as virtual devices, physical devices, and chips, can be combined or separated arbitrarily as needed. Optionally, some or all steps can also be performed collaboratively by multiple modules and / or devices, which is not limited here.

[0269] This disclosure also proposes a storage medium storing instructions that, when executed on a communication device, cause the communication device to perform any of the above methods. Optionally, the storage medium is an electronic storage medium. Optionally, the storage medium is a computer-readable storage medium, but not limited thereto; it may also be a storage medium readable by other devices. Optionally, the storage medium may be a non-transitory storage medium, but not limited thereto; it may also be a temporary storage medium.

[0270] This disclosure also proposes a program product, including a program and / or instructions, which, when executed by a communication device, cause the communication device to perform any of the above methods. Optionally, the program product is a computer program product. Optionally, the program product is stored on the storage medium.

[0271] This disclosure also proposes a computer program that, when run on a computer, causes the computer to perform any of the above methods.

Claims

1. An information processing method, characterized in that, Executed by the receiving end, including: If the discard timer times out, update at least one of the sequence numbers of the first variable and the second variable; Wherein, the first variable is the receive status variable RX_Next, and the second variable is the maximum transmission status variable RX_Highest_Status.

2. The method according to claim 1, characterized in that, The sequence number of the first variable and the sequence number of the second variable are updated, and at least one of them is included in the following: Based on the first sequence number, update at least one of the sequence number of the first variable and the sequence number of the second variable; Based on the first sequence number, update the sequence number of the first variable; based on the updated sequence number of the first variable, update the sequence number of the second variable. Wherein, the first sequence number is: the sequence number of the next data packet that has not been fully received after the specified sequence number.

3. The method according to claim 2, characterized in that, The step of updating at least one of the sequence numbers of the first variable and the second variable based on the first sequence number includes: Based on the maximum value of the first sequence number and the second sequence number, update at least one of the sequence number of the first variable and the sequence number of the second variable; wherein, the second sequence number is the sequence number of the next data packet that has not been fully received after the current first variable; If the sequence number of the second variable is less than the first sequence number, at least one of the sequence numbers of the first variable and the second variable is updated based on the first sequence number.

4. The method according to claim 2, characterized in that, Updating the sequence number of the second variable based on the updated sequence number of the first variable includes at least one of the following: If the sequence number of the second variable is not in the receiving window, the updated sequence number of the second variable is determined to be the updated sequence number of the first variable; If the sequence number of the second variable is not equal to the sum of the sequence number of the first variable and the size of the receiving window, the updated sequence number of the second variable is determined to be the updated sequence number of the first variable.

5. The method according to any one of claims 2 to 4, characterized in that, The specified serial number is the serial number where the discard timer is started.

6. The method according to any one of claims 1 to 5, characterized in that, The updating of at least one of the sequence numbers of the first variable and the second variable includes: Under certain conditions, the sequence number of the second variable is updated, wherein the certain conditions are met as follows: the updated sequence number of the second variable is greater than the original sequence number of the second variable.

7. The method according to any one of claims 1 to 6, characterized in that, The method further includes: Discard data packets in the buffer whose sequence number is less than the specified sequence number.

8. The method according to any one of claims 1 to 7, characterized in that, The method also includes one of the following: If the sequence number of the second variable is greater than the sum of the sequence number of the first variable and the predetermined value, the sequence number of the restarted discard timer is determined to be the updated sequence number of the second variable. If the sequence number of the second variable is equal to the sum of the sequence number of the first variable and the predetermined value, and the data unit corresponding to the first variable has missing data packets, then the sequence number of the restarted discard timer is determined to be the updated sequence number of the second variable.

9. An information processing method, characterized in that, Performed by a communication system, the communication system including a transmitter and a receiver, the method includes: If the discard timer times out, the receiving end updates at least one of the sequence numbers of the first variable and the second variable. Wherein, the first variable is the receive status variable RX_Next, and the second variable is the maximum transmission status variable RX_Highest_Status.

10. A communication device, characterized in that, The communication device is used to perform the information processing method according to any one of claims 1 to 8.

11. A communication system, characterized in that, It includes: a sending end and a receiving end; wherein the receiving end is configured to implement the information processing method according to any one of claims 1 to 8.

12. A storage medium storing instructions, characterized in that, When the instruction is executed on the communication device, the communication device performs the information processing method as described in any one of claims 1 to 8.

13. A computer program product, comprising at least one of a program and instructions, characterized in that, When at least one of the programs or instructions is executed by a communication device, the information processing method according to any one of claims 1 to 8 is implemented.

Images