公开(公告)号：HK1148626A1

公开(公告)日：2011-09-09

申请号：HK11102801

申请日：2011-03-21

Applicant: QUALCOMM INC

Inventor： MADAN RITESH ,  DAS ARNAB ,  RANGAN SUNDEEP ,  RAY SIDDHARTH

IPC: H04W20090101

Abstract: Systems and methodologies are described that facilitate dynamically adjusting scheduling priorities in relation to a combination of delay sensitive flows with delay requirements and best effort flows. The systems and methodologies provide optimal and efficient techniques to enable real time adjustment and assignment of bandwidth for a combination of best effort flows and delay sensitive flows. In particular, the bandwidth allocation is adjusted for each data packet such that delay requirements are met and the remaining bandwidth can be assigned to best effort flows.

公开(公告)号：WO2010080912A3

公开(公告)日：2010-10-07

申请号：PCT/US2010020375

申请日：2010-01-07

Applicant: QUALCOMM INC ,  RAY SIDDHARTH ,  SAMPATH ASHWIN

Inventor： RAY SIDDHARTH ,  SAMPATH ASHWIN

IPC: H04W28/06 ,  H04W12/02 ,  H04W80/02

CPC classification number: H04W28/065 ,  H04W12/02 ,  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。

公开(公告)号：WO2010080908A3

公开(公告)日：2010-09-30

申请号：PCT/US2010020369

申请日：2010-01-07

Applicant: QUALCOMM INC ,  RAY SIDDHARTH ,  SAMPATH ASHWIN

Inventor： RAY SIDDHARTH ,  SAMPATH ASHWIN

IPC: H04W28/06 ,  H04W80/02

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。

公开(公告)号：WO2010075453A2

公开(公告)日：2010-07-01

申请号：PCT/US2009069310

申请日：2009-12-22

Applicant: QUALCOMM INC ,  RAY SIDDHARTH ,  SAMPATH ASHWIN ,  BARANY PETER A

Inventor： RAY SIDDHARTH ,  SAMPATH ASHWIN ,  BARANY PETER A

IPC: H04L29/06

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传递给下层。

公开(公告)号：WO2010135713A3

公开(公告)日：2011-01-20

申请号：PCT/US2010035866

申请日：2010-05-21

Applicant: QUALCOMM INC ,  RAY SIDDHARTH ,  MADAN RITESH K ,  SAMPATH ASHWIN ,  RANGAN SUNDEEP ,  DAS ARNAB

Inventor： RAY SIDDHARTH ,  MADAN RITESH K ,  SAMPATH ASHWIN ,  RANGAN SUNDEEP ,  DAS ARNAB

IPC: H04W72/12

CPC classification number: H04W52/367 ,  H04L5/0037 ,  H04L5/0058 ,  H04W52/146 ,  H04W52/346 ,  H04W72/04 ,  H04W72/12

Abstract: Certain aspects of the present disclosure relate to a technique of designing a Media Access Control (MAC) scheduler for uplink communication in high rate wireless data systems, such as Long Term Evolution (LTE) wireless communication systems.

Abstract translation: 本公开的某些方面涉及在诸如长期演进（LTE）无线通信系统的高速率无线数据系统中设计用于上行链路通信的媒体访问控制（MAC）调度器的技术。

公开(公告)号：WO2009061794A2

公开(公告)日：2009-05-14

申请号：PCT/US2008082448

申请日：2008-11-05

Applicant: QUALCOMM INC ,  DAS ARNAB ,  MADAN RITESH ,  RANGAN SUNDEEP ,  SHAKKOTTAI SANJAY ,  RAY SIDDHARTH

Inventor： DAS ARNAB ,  MADAN RITESH ,  RANGAN SUNDEEP ,  SHAKKOTTAI SANJAY ,  RAY SIDDHARTH

IPC: H04L12/56

CPC classification number: H04L47/10 ,  H04L47/14 ,  H04L47/2441 ,  H04L47/283 ,  H04L47/30 ,  H04L47/70 ,  H04L47/762 ,  H04L47/803 ,  H04L47/824 ,  H04W72/12 ,  H04W72/1205 ,  H04W72/1231

Abstract: Systems and methodologies are described that facilitate enhanced resource scheduling for a wireless communication system. As described herein, packets associated with a common flow that arrive within a predetermined time period following a leading packet associated with the flow can be grouped into respective packet bursts. Subsequently, system bandwidth, transmit power, and/or other communication resources can be scheduled based on an analysis of the respective packet bursts. As provided herein, by analyzing respective packet bursts in lieu of individual packets, computational and resource overhead required for resource scheduling can be significantly reduced. In one example described herein, a resource schedule is determined by selecting one or more flows to be assigned bandwidth from among a plurality of flows based on an analysis of packet bursts respectively associated with the flows. Sufficient bandwidth can subsequently be scheduled for the selected flows for transmission of the respectively associated packet bursts.

Abstract translation: 描述了促进无线通信系统的增强的资源调度的系统和方法。 如本文所述，与在与流相关联的前导分组之后的预定时间段内到达的公共流相关联的分组可以被分组为相应的分组突发。 随后，可以基于相应分组突发的分析来调度系统带宽，发射功率和/或其他通信资源。 如本文提供的，通过分析各个分组突发来代替各个分组，可以显着地减少资源调度所需的计算和资源开销。 在本文描述的一个示例中，基于与流分别相关联的分组突发的分析，通过从多个流中选择要分配带宽的一个或多个流来确定资源调度。 随后可以为所选择的流调度足够的带宽以传输分别相关联的分组突发。

公开(公告)号：WO2009061775A2

公开(公告)日：2009-05-14

申请号：PCT/US2008082420

申请日：2008-11-05

Applicant: QUALCOMM INC ,  MADAN RITESH ,  DAS ARNAB ,  RANGAN SUNDEEP ,  RAY SIDDHARTH

Inventor： MADAN RITESH ,  DAS ARNAB ,  RANGAN SUNDEEP ,  RAY SIDDHARTH

IPC: H04W72/04

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: 描述了有助于将调度算法分成能够同时服务于宽带通信网络中的多个不同流的背景和前景方面的系统和方法。 本文提供的系统任意选择预期时间范围，基于系统所观察到的多个流来生成最佳带宽分配目标，并且利用最优带宽目标来在整个预期时间范围内向用户分配流。