Multiple timers for effective reordering

    公开(公告)号:US11387945B1

    公开(公告)日:2022-07-12

    申请号:US17216911

    申请日:2021-03-30

    Abstract: Methods, systems, and devices for wireless communications are described. In a wireless communications system, a user equipment (UE) may receive a set of packets having a sequential order. The UE may initiate a first packet data convergence protocol (PDCP) reordering timer based on a first time stamp corresponding to unsuccessful decoding of a first packet in the sequential order. The UE may then initiate, prior to the expiration of the first PDCP reordering timer, a second PDCP reordering timer. The second PDCP reordering timer may be based on a second time stamp corresponding to unsuccessful decoding of a second packet in the sequential order. In some cases, the UE may initiate the second PDCP reordering timer after expiration of the first PDCP reordering timer, but may decrease the duration of the second PDCP reordering timer.

    METHODS AND APPARATUS FOR SYNCHRONIZING A USER EQUIPMENT WITH AN HFN OFFSET
    13.
    发明申请
    METHODS AND APPARATUS FOR SYNCHRONIZING A USER EQUIPMENT WITH AN HFN OFFSET 有权
    用于与HFN偏差同步用户设备的方法和装置

    公开(公告)号:US20160142936A1

    公开(公告)日:2016-05-19

    申请号:US14547325

    申请日:2014-11-19

    Abstract: Methods, systems, and devices are described for wireless communication at a user equipment (UE). In some examples, the UE may identify an initialization and refresh (IR) packet at the radio link control (RLC) layer based the size of the IR packet, where the IR packet comprises a larger ciphered PDU size than a compressed RoHC packet. Accordingly, once the UE identifies the received packet as an IR packet, the UE may attempt to decipher the IR packet using one or more HFN offset values. In one example, the UE may determine whether the IR packet is deciphered correctly based on cyclic redundancy check (CRC) value of the deciphered IR packet. As a result, the present disclosure allows the UE to re-synchronize with the transmitting device by at least one of incrementing or decrementing an HFN value at the receiving device.

    Abstract translation: 描述了用于用户设备(UE)的无线通信的方法,系统和设备。 在一些示例中,UE可以基于IR分组的大小来识别在无线电链路控制(RLC)层处的初始化和刷新(IR)分组,其中IR分组包括比压缩的RoHC分组更大的加密的PDU大小。 因此,一旦UE将接收的分组识别为IR分组,则UE可以尝试使用一个或多个HFN偏移值来解密IR分组。 在一个示例中,UE可以基于解密的IR分组的循环冗余校验(CRC)值来确定IR分组是否被正确解密。 结果,本公开允许UE通过在接收设备处递增或递减HFN值中的至少一个来与发送设备重新同步。

    SYSTEM MEMORY FLOW MANAGEMENT
    16.
    发明申请

    公开(公告)号:US20210153159A1

    公开(公告)日:2021-05-20

    申请号:US17095344

    申请日:2020-11-11

    Abstract: Methods, systems, and devices for wireless communications are described. A communication device, otherwise known as a user equipment (UE) may transmit a data transmission to a receiver. In some examples, the data transmission may be a radio link control (RLC) protocol data unit (PDU) transmission. The UE may store the data transmission in a retransmission buffer, and transmit a feedback request to the receiver in a subsequent data transmission based on a system memory utilization threshold for the retransmission buffer being satisfied due to storage of the data transmission.

    Robust header compression (RoHC) techniques for a dynamically changing extension bit

    公开(公告)号:US10299162B2

    公开(公告)日:2019-05-21

    申请号:US15407045

    申请日:2017-01-16

    Abstract: Methods, systems, and devices for wireless communication are described. Different robust header compression (RoHC) schemes may be used when a change in a header extension flag between packets of a communication session is determined. For example, a transmitting device may determine a value of a header extension flag in a packet has changed with respect to header extension flags in preceding packets. Upon detecting the change in the header extension flag, the device may compress the header using different RoHC schemes. For instance, the device may compress the header by reverting to an initialization and refresh (IR) state. Additionally or alternatively, the device may compress the header using a compression profile that refrains from compressing a certain portion of the header. In some cases, the RoHC scheme used for compressing the header may be based on how frequently the value of the extension flag changes between packets.

    TIMESTAMP REPAIR MECHANISM IN CASE OF DECOMPRESSION FAILURE

    公开(公告)号:US20170091014A1

    公开(公告)日:2017-03-30

    申请号:US14864685

    申请日:2015-09-24

    Abstract: Methods, systems, and devices may implement a header repair mechanism to deal with a loss of successive compressed headers (e.g., due to radio interface). The present methods and apparatus exploit the fact that once a correct timestamp (TS) from a previous decompression success (called “last successfully decomp_TS”) is known, another (e.g., a subsequent) TS should be in the form: last successfully decomp_TS+n*min_TS_STRIDE, where n is a positive integer if the estimated sequence number (SN) is higher than the last successfully decompressed SN, and a negative integer if the estimated SN is lower than the last successfully decompressed SN, and min_TS_STRIDE is the expected minimum TS increment, which is known and directly related to the medium sample rate and frame rate, for example.

    Transmission of previously compressed packets to avoid throughput drop

    公开(公告)号:US12219386B2

    公开(公告)日:2025-02-04

    申请号:US17372183

    申请日:2021-07-09

    Abstract: A second wireless device may transmit, to a first wireless device, a feedback message indicative of a transition from a first compression state to a second compression state. The first wireless device may transition, based on a state change indication corresponding to the feedback message, from the first compression state to the second compression state. The first wireless device may transmit, to the second wireless device based on the transition from the first compression state to the second compression state, one or more first data packets that are previously compressed based on the first compression state or one or more second data packets that are uncompressed or recompressed based on the second compression state. The one or more second data packets being associated with the one or more first data packets.

Patent Agency Ranking