公开(公告)号：US20140269332A1

公开(公告)日：2014-09-18

申请号：US14203276

申请日：2014-03-10

Applicant: FutureWei Technologies, Inc.

Inventor： Gamini Senarath ,  Aaron Callard ,  Ho Ting Cheng

IPC: H04L12/801

CPC classification number: H04L45/125 ,  H04L43/0888 ,  H04L43/16 ,  H04L45/24 ,  H04L45/38 ,  H04L47/125 ,  H04W40/14 ,  H04W40/16 ,  Y02D70/00 ,  Y02D70/142 ,  Y02D70/144 ,  Y02D70/34

Abstract: Increased resource utilization efficiency can be improved by modeling path costs during admission and path-selection. Specifically, path costs for candidate paths are modeled based on load characteristics (e.g., current load, load variation, etc.) of links in the candidate paths. Path costs can represent any quantifiable cost or liability associated with transporting a service flow over the corresponding path. For example, path costs can correspond to a probability that at least one link in the path will experience an outage when transporting the service flow, a price charged by a network operator (NTO) for transporting the traffic flow over the candidate path, or a total network cost for transporting the flow over a candidate path. The candidate path having the lowest path cost is selected to transport a service flow.

Abstract translation: 通过在入场和路径选择过程中路径成本建模可以提高资源利用效率。 具体地，候选路径的路径成本基于候选路径中的链路的负载特性（例如，当前负载，负载变化等）来建模。 路径成本可以代表与通过相应路径传输服务流程相关的任何可量化的成本或责任。 例如，路径成本可以对应于在传输服务流时路径中的至少一个链路将经历中断的概率，用于在候选路径上传输业务流的网络运营商（NTO）收取的价格，或 用于在候选路径上传输流的总网络成本。 选择具有最低路径开销的候选路径来传送服务流。

公开(公告)号：US20130188576A1

公开(公告)日：2013-07-25

申请号：US13744660

申请日：2013-01-18

Applicant: FutureWei Technologies, Inc.

Inventor： Zhijun Chao ,  Gamini Senarath ,  Liqing Zhang

IPC: H04W72/04

CPC classification number: H04W72/04 ,  H04L1/0003 ,  H04L1/0009 ,  H04L1/0026 ,  H04L47/00 ,  H04W72/1226 ,  H04W72/1247

Abstract: A method embodiment for transmission scheduling includes implementing, by a first base station (BS), a soft-persistent scheduling scheme. The soft-persistent scheduling scheme includes allocating a first resource block to a first UE and other resource blocks to other UEs for a first transmission time interval (TTI), calculating a first priority of the first UE for the first resource block for a second TTI, wherein calculating the first priority involves including a first bonus in the first priority, and wherein the second TTI is later than the first TTI, calculating other priorities for the other UEs and the other resource blocks for the second TTI, and allocating the first and the other resource blocks to the first and other UEs for the second TTI in accordance with the first priority of the first UE as modified by the first bonus and the other priorities of the other UEs.

Abstract translation: 用于传输调度的方法实施例包括由第一基站（BS）实施软持续调度方案。 软持续调度方案包括在第一传输时间间隔（TTI）下向第一UE分配第一资源块和其他资源块，为第一个资源块计算第一个TTI的第一个UE的第一优先级 其中，计算所述第一优先级涉及在所述第一优先级中包括第一加值，并且其中所述第二TTI晚于所述第一TTI，计算所述其他UE和所述第二TTI的其他资源块的其它优先级，并且分配所述第一和 根据由第一奖励修改的第一UE的第一优先级和其他UE的其他优先级，其他资源块到用于第二TTI的第一和其他UE。

公开(公告)号：US20130130707A1

公开(公告)日：2013-05-23

申请号：US13649038

申请日：2012-10-10

Applicant: FutureWei Technologies, Inc.

Inventor： Vahid Tarokh ,  Gamini Senarath ,  Ho-Ting Cheng ,  Peiying Zhu

IPC: H04W72/04

CPC classification number: H04W72/121 ,  H04W52/34 ,  H04W72/0426 ,  H04W72/0473

Abstract: A method for dynamically determining power and scheduling assignments in a communications network includes selecting, by a controller, a mobile station in each cell to define a mobile station set, determining, by the controller, a power allocation for each of the mobile stations in the mobile station set, calculating, by the controller, a global utility function by evaluating a contribution from each of the mobile stations in the mobile station set in accordance with the power allocation, repeating, by the controller, the selecting, the determining, and the calculating steps a predetermined number of times to generate additional ones of the global utility function, and choosing, by the controller, the mobile station set corresponding to the global utility function having a particular value for a resource block of a frame. The method may also include repeatedly dividing a user set into clusters to obtain a best power allocation.

Abstract translation: 一种用于在通信网络中动态地确定功率和调度分配的方法包括由控制器选择每个小区中的移动台来定义移动台组，由控制器确定每个移动站中的功率分配 移动台通过由控制器计算全局效用函数，通过根据功率分配来评估移动站中的每个移动台的贡献，由控制器重复该选择，确定和 计算步骤预定次数以产生全局效用函数的附加值，以及由控制器选择对应于具有对于帧的资源块的特定值的全局效用函数的移动台集合。 该方法还可以包括将用户集合重复划分成簇以获得最佳功率分配。

公开(公告)号：US09369925B2

公开(公告)日：2016-06-14

申请号：US14067542

申请日：2013-10-30

Applicant: FutureWei Technologies, Inc.

Inventor： Akram Bin Sediq ,  Ramy Gohary ,  Halim Yanikomeroglu ,  Gamini Senarath ,  Ho Ting Cheng

IPC: H04W52/00 ,  H04W28/24 ,  H04W52/14

CPC classification number: H04W28/24 ,  H04W52/143

Abstract: Embodiments are provided for scheduling resources considering data rate-efficiency and fairness trade-off. A value of Jain's fairness index (JFI) is determined for transmitting a service to a plurality of users, and accordingly a sum of throughputs is maximized for transmitting the service to the users. Alternatively, a sum of throughputs is determined first and accordingly the JFI is maximized. Maximizing the sum of throughputs or JFI includes selecting a suitable value for a tuning parameter in an efficiency and fairness trade-off relation model. In accordance with the values of sum of throughputs and JFI, a plurality of resources are allocated for transmitting the service to the users. For static or quasi-static channels, the relation model is a convex function with a monotonic trade-off property. For ergodic time varying channels, the tuning parameter is selected by solving the relation model using a gradient-based approach.

Abstract translation: 提供了考虑数据速率效率和公平权衡的调度资源的实施例。 为了将服务发送给多个用户，确定了Jain的公平性指数（JFI）的值，因此将服务的发送量最大化为用户的总和。 或者，首先确定吞吐量的总和，从而使JFI最大化。 最大化吞吐量或JFI的总和包括在效率和公平权衡关系模型中选择适合的调整参数值。 根据吞吐量和JFI的总和的值，分配多个资源用于向用户发送服务。 对于静态或准静态通道，关系模型是具有单调权衡属性的凸函数。 对于遍历时变通道，通过使用基于梯度的方法求解关系模型来选择调谐参数。

公开(公告)号：US20150373687A1

公开(公告)日：2015-12-24

申请号：US14309693

申请日：2014-06-19

Applicant: Futurewei Technologies, Inc.

Inventor： Aaron Callard ,  Gamini Senarath ,  Alex Stephenne

IPC: H04W72/04 ,  H04W36/24 ,  H04L29/08

CPC classification number: H04W36/24 ,  H04L67/34 ,  H04L69/24 ,  H04W24/02 ,  H04W36/32 ,  H04W72/0406 ,  H04W92/10 ,  H04W92/12

Abstract: Spoofed radio control signaling instructions can be used to dynamically adapt management of the radio interface by radio control processors. More specifically, spoofed radio control signaling can be communicated to an accelerator application instantiated on a device-side of a radio control processor. The accelerator application can pre-process the spoofed radio control signaling before forwarding the instructions to a generic radio control processor. In one example, the generic radio control processor has a universal configuration that is capable of being adapted to different telecommunication protocols based on the spoofed radio control signaling. In another example, the spoofed radio control channel signaling is translated into control instructions at the accelerator application, which are forwarded to the generic radio control processor. The control instructions govern processing of downlink data channel transmissions and/or specify parameters of uplink transmissions.

Abstract translation: 无线电控制信令指令可用于通过无线电控制处理器动态地适应无线电接口的管理。 更具体地，欺骗性无线电控制信令可以被传送到在无线控制处理器的设备侧实例化的加速器应用。 加速器应用可以在将指令转发到通用无线电控制处理器之前对伪造的无线电控制信令进行预处理。 在一个示例中，通用无线电控制处理器具有能够根据欺骗的无线电控制信令适应于不同电信协议的通用配置。 在另一示例中，欺骗的无线电控制信道信令被转换为加速器应用处的控制指令，其被转发到通用无线电控制处理器。 控制指令控制下行链路数据信道传输的处理和/或指定上行链路传输的参数。

公开(公告)号：US20140162627A1

公开(公告)日：2014-06-12

申请号：US14104908

申请日：2013-12-12

Applicant: FutureWei Technologies, Inc.

Inventor： Vahid Tarokh ,  Peiying Zhu ,  Gamini Senarath

IPC: H04W24/08

CPC classification number: H04W24/08 ,  H04L25/02 ,  H04L25/0204 ,  H04L25/0228

Abstract: A method for estimating communications channels includes determining, by a first device, channel significance information from a transmitting device, the channel significance information including information about communications channels carrying signals that are potentially significant interferers to the first device operating within range of the transmitting device, and estimating, by the first device, channel parameters of the communications channels identified as potentially significant interferers in accordance with the channel significance information. The method also includes transmitting, by the first device, the estimated channel parameters to one of the transmitting device and a controlling device.

Abstract translation: 一种用于估计通信信道的方法包括：由第一设备确定来自发射设备的信道有效信息，所述信道有效信息包括关于通信信道的信息，所述信息携带对于在所述发射设备的范围内操作的所述第一设备是潜在的重要干扰源的信号， 以及根据所述信道重要性信息，由所述第一设备估计被识别为潜在重要干扰源的所述通信信道的信道参数。 该方法还包括由第一设备将估计的信道参数发送到发送设备和控制设备之一。

公开(公告)号：US20140146748A1

公开(公告)日：2014-05-29

申请号：US14090322

申请日：2013-11-26

Applicant: FutureWei Technologies, Inc.

Inventor： Vahid Tarokh ,  Peiying Zhu ,  Gamini Senarath

IPC: H04B7/02 ,  H04W16/18

CPC classification number: H04W16/18 ,  H04J11/0023 ,  H04J11/0053 ,  H04L5/0035 ,  H04L5/0048 ,  H04L25/0226 ,  H04L27/2613 ,  H04W16/02

Abstract: A method for pilot sequence design in a communications system includes selecting an initial cell in the communications system, and grouping other cells in the communications system relative to the initial cell into one of a neighbor group and a non-neighbor group in accordance with a neighborness measure of each of the other cells to the initial cell. The method also includes designing pilot sequences that are substantially orthogonal to one another for the initial cell and the other cells in the neighbor group, and providing information about the pilot sequences to the initial cell and the other cells in the communications system.

Abstract translation: 一种通信系统中的导频序列设计方法包括：选择通信系统中的初始小区，根据邻居，将通信系统中相对于初始小区的其他小区分组为邻居组和非邻组 测量每个其他细胞到初始细胞。 该方法还包括为初始小区和邻居组中的其他小区彼此基本上正交的导频序列，以及向通信系统中的初始小区和其他小区提供关于导频序列的信息。

公开(公告)号：US20140120974A1

公开(公告)日：2014-05-01

申请号：US14067542

申请日：2013-10-30

Applicant: FutureWei Technologies, Inc.

Inventor： Akram Bin Sediq ,  Ramy Gohary ,  Halim Yanikomeroglu ,  Gamini Senarath ,  Ho Ting Cheng

IPC: H04W72/04

CPC classification number: H04W28/24 ,  H04W52/143

Abstract: Embodiments are provided for scheduling resources considering data rate-efficiency and fairness trade-off. A value of Jain's fairness index (JFI) is determined for transmitting a service to a plurality of users, and accordingly a sum of throughputs is maximized for transmitting the service to the users. Alternatively, a sum of throughputs is determined first and accordingly the JFI is maximized. Maximizing the sum of throughputs or JFI includes selecting a suitable value for a tuning parameter in an efficiency and fairness trade-off relation model. In accordance with the values of sum of throughputs and JFI, a plurality of resources are allocated for transmitting the service to the users. For static or quasi-static channels, the relation model is a convex function with a monotonic trade-off property. For ergodic time varying channels, the tuning parameter is selected by solving the relation model using a gradient-based approach.

Abstract translation: 提供了考虑数据速率效率和公平权衡的调度资源的实施例。 为了将服务发送给多个用户，确定了Jain的公平性指数（JFI）的值，因此将服务的发送量最大化为用户的总和。 或者，首先确定吞吐量的总和，从而使JFI最大化。 最大化吞吐量或JFI的总和包括在效率和公平权衡关系模型中选择适合的调整参数值。 根据吞吐量和JFI的总和的值，分配多个资源用于向用户发送服务。 对于静态或准静态通道，关系模型是具有单调权衡属性的凸函数。 对于遍历时变通道，通过使用基于梯度的方法求解关系模型来选择调谐参数。