中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

42 records (took 0.03 seconds)

    PACKET BUNDLING AT THE PDCP LAYER
    2.
    发明申请
    PACKET BUNDLING AT THE PDCP LAYER 失效
    在PDCP层的包装

    公开(公告)号：US20100208632A1

    公开(公告)日：2010-08-19

    申请号：US12652636

    申请日：2010-01-05

    Applicant: Siddharth Ray ,  Ashwin Sampath

    Inventor： Siddharth Ray ,  Ashwin Sampath

    IPC: H04B7/00 ,  H04L29/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。

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

    公开(公告)号：US20090116438A1

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

    申请号：US12261297

    申请日：2008-10-30

    Applicant: Ritesh K. Madan ,  Arnab Das ,  Sundeep Rangan ,  Siddharth Ray

    Inventor： Ritesh K. Madan ,  Arnab Das ,  Sundeep Rangan ,  Siddharth Ray

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

    Pre-bundling of RLC SDUs in the RLC layer
    5.
    发明授权
    Pre-bundling of RLC SDUs in the RLC layer 失效
    在RLC层中预先捆绑RLC SDU

    公开(公告)号：US08335205B2

    公开(公告)日：2012-12-18

    申请号：US12643667

    申请日：2009-12-21

    Applicant: Siddharth Ray ,  Ashwin Sampath ,  Arnaud Meylan ,  Parag A. Agashe

    Inventor： Siddharth Ray ,  Ashwin Sampath ,  Arnaud Meylan ,  Parag A. Agashe

    IPC: H04J3/24

    CPC classification number: H04W28/065

    Abstract: Certain aspects of the present disclosure provide a technique for pre-bundling the received service data units (SDU) into an SDU bundle in a first communication layer before receiving a scheduling information from a second communication layer and adjusting the SDU bundle when the scheduling information is received.

    Abstract translation: 本公开的某些方面提供了一种用于在从第二通信层接收调度信息之前将接收到的服务数据单元（SDU）预先捆绑到第一通信层中的SDU包中并且当调​​度信息为 收到了

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

    公开(公告)号：US20110312360A1

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

    申请号：US12819191

    申请日：2010-06-19

    Applicant: Ritesh Kumar Madan ,  Siddharth Ray ,  Niranjan N. Ratnakar ,  Arnab Das

    Inventor： Ritesh Kumar Madan ,  Siddharth Ray ,  Niranjan N. Ratnakar ,  Arnab Das

    IPC: H04B7/00

    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
    8.
    发明授权
    Fiber aided wireless network architecture 失效
    光纤辅助无线网络架构

    公开(公告)号：US07684709B2

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

    申请号：US11540975

    申请日：2006-09-29

    Applicant: Siddharth Ray ,  Muriel Medard ,  Lizhong Zheng

    Inventor： Siddharth Ray ,  Muriel Medard ,  Lizhong Zheng

    IPC: H04B10/00

    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的容量以光纤容量指数地接近架构容量。 还表明，对于给定的光纤容量，存在操作无线带宽和接口数量的最佳方法。 示出了在接口之间划分光纤容量的最佳方法，其确保每个接口被分配速率，使得噪声以前端噪声为主，而不是通过量化失真。 还提出了一种方法，其中，不是基于信道状态动态地改变速率分配，而是可以采用较不复杂的固定速率分配，而性能损失非常小。

    SCHEDULING QOS FLOWS IN BROADBAND WIRELESS COMMUNICATION SYSTEMS
    9.
    发明申请
    SCHEDULING QOS FLOWS IN BROADBAND WIRELESS COMMUNICATION SYSTEMS 有权
    在宽带无线通信系统中调度QOS流

    公开(公告)号：US20090122717A1

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

    申请号：US12264051

    申请日：2008-11-03

    Applicant: Arnab Das ,  Ritesh Madan ,  Sundeep Rangan ,  Sanjay Shakkottai ,  Siddharth Ray

    Inventor： Arnab Das ,  Ritesh Madan ,  Sundeep Rangan ,  Sanjay Shakkottai ,  Siddharth Ray

    IPC: H04L12/26

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

    Automatic Music-Queuing, Karaoke Management and Track Mixing
    10.
    发明申请
    Automatic Music-Queuing, Karaoke Management and Track Mixing 有权

    公开(公告)号：US20250029584A1

    公开(公告)日：2025-01-23

    申请号：US18223512

    申请日：2023-07-18

    Applicant: Siddharth Ray

    Inventor： Siddharth Ray

    IPC: G10H1/36 ,  G06F16/638

    Abstract: A mechanism is described for facilitating automatic music-queuing, karaoke managing, and track mixing. A method, as described herein, includes receiving, at a computing device, a guest elevation request from a guest client device in communication with the computing device including a server computing device serving as a host computer, where the guest elevation request includes prioritizing a request for an audio track or a video clip placed by a user via the guest client device. The method may further include performing analysis of the guest elevation request to determine whether to approve or disapprove the guest elevation request, and elevating the guest client device associated with the guest elevation request if the guest elevation request is approved. The method may further include communicating the approval of the guest elevation request and the elevation of the guest client device to the guest client device over a communication network.

Patent Agency Ranking