Packet bundling at the PDCP layer
    11.
    发明授权
    Packet bundling at the PDCP layer 失效
    分组捆绑在PDCP层

    公开(公告)号:US08711881B2

    公开(公告)日:2014-04-29

    申请号:US12652636

    申请日:2010-01-05

    CPC classification number: H04W28/065 H04W80/02

    Abstract: Certain aspects of the present disclosure provide a technique for bundling the received service data units (SDU) in a first communication layer to generate a protocol data unit (PDU) to pass to a second communication layer. For example, one or more packet data convergence protocol (PDCP) SDUs may be concatenated to generate a PDCP PDU and be sent to a radio link control (RLC) layer in the transmitter side. Similarly, one or more PDCP SDUs may be extracted from a PDCP PDU in the receiver side.

    Abstract translation: 本公开的某些方面提供了用于在第一通信层中捆绑所接收的服务数据单元(SDU)以产生要传递到第二通信层的协议数据单元(PDU)的技术。 例如,一个或多个分组数据会聚协议(PDCP)SDU可以被级联以产生PDCP PDU并被发送到发射机侧的无线电链路控制(RLC)层。 类似地,可以从接收机侧的PDCP PDU提取一个或多个PDCP SDU。

    Unbundling packets received in wireless communications
    12.
    发明授权
    Unbundling packets received in wireless communications 失效
    在无线通信中收到的分组数据包

    公开(公告)号:US08644338B2

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

    申请号:US12652665

    申请日:2010-01-05

    CPC classification number: H04L47/10 H04L47/14 H04L47/24 H04W28/065

    Abstract: Systems and methodologies are described that facilitate unbundling and processing partial packet data units (PDU). PDUs can be transmitted at a communication layer and can include partial PDUs of a disparate communication layer. Complete SDUs can be determined in the partial PDU and provided to an upper communication layer. In addition, however, the partial PDU can comprise a partial SDU. Upon receiving a remaining or additional portion of the partial PDU, a remaining or additional portion of the partial SDU can be combined with the partial SDU to create a complete SDU (or a larger portion thereof). Where a complete SDU is created, it can be provided to an upper communication layer. Alternatively, the partial PDU can be combined with the remaining portion of the partial PDU to generate a complete or larger PDU, from which the previously incomplete SDU can be retrieved and provided to an upper communication layer.

    Abstract translation: 描述了便于拆分和处理部分分组数据单元(PDU)的系统和方法。 PDU可以在通信层发送,并且可以包括不同通信层的部分PDU。 完整的SDU可以在部分PDU中确定并提供给上层通信层。 然而,此外,部分PDU可以包括部分SDU。 在接收到部分PDU的剩余部分或附加部分时,部分SDU的剩余部分或附加部分可以与部分SDU组合以创建完整的SDU(或其较大部分)。 在创建完整的SDU的地方,可以将其提供给上层通信层。 或者,部分PDU可以与部分PDU的剩余部分组合以生成完整或更大的PDU,从该PDU可以检索先前不完整的SDU并将其提供给上层通信层。

    METHODS AND APPARATUS FOR CONTENTION-BASED UPLINK ACCESS IN WIRELESS COMMUNICATION SYSTEMS
    14.
    发明申请
    METHODS AND APPARATUS FOR CONTENTION-BASED UPLINK ACCESS IN WIRELESS COMMUNICATION SYSTEMS 有权
    无线通信系统中基于内容上行接入的方法与装置

    公开(公告)号:US20120014269A1

    公开(公告)日:2012-01-19

    申请号:US12987946

    申请日:2011-01-10

    CPC classification number: H04W74/006 H04W74/008

    Abstract: Methods and apparatus for contention-based access in a wireless communication system are disclosed. A base station may determine a contention-based resource allocation comprising a subset of available system resources. Information related to the contention-based resources may be sent to a user device. In addition, state information may be provided to the UE. The UE may generate and send a contention-based uplink transmission consistent with the allocated resources and state information.

    Abstract translation: 公开了一种在无线通信系统中基于竞争的接入的方法和装置。 基站可以确定包括可用系统资源的子集的基于竞争的资源分配。 与基于竞争的资源相关的信息可以被发送到用户设备。 此外,可以向UE提供状态信息。 UE可以生成并发送与分配的资源和状态信息一致的基于争用的上行链路传输。

    PACKET BUNDLING AT THE PDCP LAYER WITH CIPHERING ON THE PDCP SDU
    15.
    发明申请
    PACKET BUNDLING AT THE PDCP LAYER WITH CIPHERING ON THE PDCP SDU 审中-公开
    在PDCP SDU上的PDCP层上的分组包装

    公开(公告)号:US20100202613A1

    公开(公告)日:2010-08-12

    申请号:US12652656

    申请日:2010-01-05

    CPC classification number: H04W28/065 H04W12/0013 H04W80/02 H04W84/042

    Abstract: Certain aspects of the present disclosure propose techniques for bundling and ciphering service data units (SDU) in the packet data convergence protocol (PDCP) layer. The proposed techniques increase the data rate of the communication system. At the transmitter side, the PDCP layer may bundle SDUs and cipher each SDU individually before submitting them to a lower layer. At the receiver-side, the PDCP layer may unbundle and decipher the SDUs before submitting them to higher layers.

    Abstract translation: 本公开的某些方面提出了在分组数据融合协议(PDCP)层中捆绑和加密服务数据单元(SDU)的技术。 所提出的技术提高了通信系统的数据速率。 在发送端,PDCP层可以捆绑SDU,并将每个SDU分别加密,然后再提交给下层。 在接收方,PDCP层可以在将SDU提交给更高层之前解包和解密SDU。

    METHOD AND APPARATUS FOR BUNDLING AND CIPHERING DATA
    16.
    发明申请
    METHOD AND APPARATUS FOR BUNDLING AND CIPHERING DATA 失效
    用于整理和编写数据的方法和装置

    公开(公告)号:US20100158044A1

    公开(公告)日:2010-06-24

    申请号:US12643713

    申请日:2009-12-21

    CPC classification number: H04W28/065 H04L63/0428 H04W12/02 H04W80/02

    Abstract: Techniques for bundling and ciphering data prior to transmission are described. In an exemplary design, a transmitting entity receives a plurality of service data units (SDUs) from an upper layer, assigns sequential sequence numbers to the SDUs, and bundles the SDUs into a single protocol data unit (PDU). In one design, the transmitting entity generates a single count value based on a sequence number of a designated SDU (e.g., the first SDU) in the PDU and ciphers all SDUs based on the single count value. In another design, the transmitting entity ciphers each segment of at least two SDUs in the PDU based on a count value for that segment. The transmitting entity generates a header with at least one sequence number and possibly length and/or other information for the SDUs. The transmitting entity forms the PDU with the header and the SDUs and passes the PDU to a lower layer.

    Abstract translation: 描述在传输之前捆绑和加密数据的技术。 在示例性设计中,发送实体从上层接收多个服务数据单元(SDU),向SDU分配顺序序列号,并将SDU捆绑成单个协议数据单元(PDU)。 在一种设计中,发送实体基于PDU中的指定SDU(例如,第一SDU)的序列号生成单个计数值,并且基于单个计数值对所有SDU进行加密。 在另一种设计中,发送实体基于该段的计数值对PDU中的至少两个SDU的每个段进行加密。 发送实体生成具有SDU的至少一个序列号和可能的长度和/或其他信息的报头。 发送实体与报头和SDU形成PDU,并将PDU传递给下层。

    DIVISION OF THE SCHEDULING ALGORITHM INTO BACKGROUND AND FOREGROUND ALGORITHMS
    18.
    发明申请
    DIVISION OF THE SCHEDULING ALGORITHM INTO BACKGROUND AND FOREGROUND ALGORITHMS 有权
    将调度算法分解为背景和前缀算法

    公开(公告)号:US20090116438A1

    公开(公告)日:2009-05-07

    申请号:US12261297

    申请日:2008-10-30

    CPC classification number: H04L47/823 H04L47/70 H04W16/22 H04W72/04 H04W72/12

    Abstract: Systems and methodologies are described that facilitate dividing scheduling algorithms into background and foreground aspects capable of simultaneously servicing a multiplicity of disparate flows in wideband communications networks. The systems provided herein arbitrarily select prospective time horizons, generate optimal bandwidth allocation targets based on a plurality of flows observed by the system, and utilizes the optimal bandwidth targets to assign flows to users over the entirety of the prospective time horizon.

    Abstract translation: 描述了有助于将调度算法分解成能够同时服务于宽带通信网络中的多个不同流的背景和前景方面的系统和方法。 本文提供的系统任意选择预期时间间隔,基于系统观察到的多个流生成最优带宽分配目标,并利用最优带宽目标在整个预期时间范围内为用户分配流量。

    DOWNLINK SCHEDULING IN FRACTIONAL FREQUENCY REUSE (FFR) SYSTEMS
    19.
    发明申请
    DOWNLINK SCHEDULING IN FRACTIONAL FREQUENCY REUSE (FFR) SYSTEMS 有权
    在频率重复(FFR)系统中的下行调度

    公开(公告)号:US20110312360A1

    公开(公告)日:2011-12-22

    申请号:US12819191

    申请日:2010-06-19

    CPC classification number: H04L5/02 H04L5/0058 H04L5/0078

    Abstract: An apparatus and method are disclosed for determining the optimal bandwidth fractions for all the users in each frequency band in a wireless communication system to maximize the net sum of user utilities. User utilities are functions of average rates of users, where different averaging rules can be used for different users. The standard approach of computing an optimal scheduler strategy involves the solution of a convex optimization problem that has a complexity on the order of O(N3) for N flows. This approach is not feasible for online implementation having a large number of flows. The method of the present work employs an efficient computational algorithm that obtains the optimal bandwidth fractions in O(N) time. This feature makes the method suitable for implementation in wideband cellular systems like LTE (Long Term Evolution) and UMB (Ultra Mobile Broadband).

    Abstract translation: 公开了一种用于确定无线通信系统中每个频带中所有用户的最佳带宽分数的装置和方法,以最大化用户实用程序的净和。 用户实用程序是用户的平均速率的函数,其中不同的平均规则可以用于不同的用户。 计算最优调度器策略的标准方法涉及对于N个流具有O(N3)级的复杂度的凸优化问题的解。 这种方法对于具有大量流量的在线实现是不可行的。 本工作的方法采用了一种在O(N)时间内获得最佳带宽分数的有效计算算法。 该特征使得该方法适用于诸如LTE(长期演进)和UMB(超移动宽带)的宽带蜂窝系统中的实现。

    Fiber aided wireless network architecture
    20.
    发明授权
    Fiber aided wireless network architecture 失效
    光纤辅助无线网络架构

    公开(公告)号:US07684709B2

    公开(公告)日:2010-03-23

    申请号:US11540975

    申请日:2006-09-29

    CPC classification number: H04B10/25754

    Abstract: A FAWNA that allows high-speed mobile connectivity by leveraging the speed of optical networks. Specifically, SIMO FAWNA, which comprises a SIMO wireless channel interfaced with a fiber channel through wireless-to-optical interfaces. Received wireless signal at each interface are sampled and quantized prior to transmission. The capacity of the FAWNA approaches the capacity of the architecture exponentially with fiber capacity. It is also shown that for a given fiber capacity, there is an optimal method of operating wireless bandwidth and number of interfaces. An optimal method to divide the fiber capacity among the interfaces is shown, which ensures that each interface is allocated a rate so that noise is dominated by front end noise rather than by quantization distortion. A method is also presented in which, rather than dynamically changing rate allocation based on channel state, a less complex, fixed rate allocation may be adopted with very small loss in performance.

    Abstract translation: FAWNA通过利用光网络的速度来实现高速移动连接。 具体来说,SIMO FAWNA包括通过无线到光学接口与光纤通道接口的SIMO无线信道。 在每个接口处的接收到的无线信号在传输之前被采样和量化。 FAWNA的容量以光纤容量指数地接近架构容量。 还表明,对于给定的光纤容量,存在操作无线带宽和接口数量的最佳方法。 示出了在接口之间划分光纤容量的最佳方法,其确保每个接口被分配速率,使得噪声以前端噪声为主,而不是通过量化失真。 还提出了一种方法,其中,不是基于信道状态动态地改变速率分配,而是可以采用较不复杂的固定速率分配,而性能损失非常小。

Patent Agency Ranking