公开(公告)号：US09288679B2

公开(公告)日：2016-03-15

申请号：US14340322

申请日：2014-07-24

Applicant: Futurewei Technologies, Inc.

Inventor： Yaser Fouad ,  Ramy Gohary ,  Halim Yanikomeroglu ,  Gamini Senarath

IPC: H04B7/15 ,  H04W16/10 ,  H04W88/02 ,  H04W84/04

CPC classification number: H04W16/10 ,  H04B7/15542 ,  H04W16/26 ,  H04W84/047 ,  H04W88/02

Abstract: Iterative sequential selection techniques can be used to efficiently compute RB assignment sequences in relay-assisted networks. Embodiment techniques construct a graphical representation of a cyclic group based on a selected pattern in a set of patterns and a selected cyclic-shift in a plurality of cyclic shifts. Remaining patterns are placed in a unitary group, and an iterative sequential selection technique is used to evaluate the remaining patterns in the unitary group for each of the cyclic shifts over a sequence of iterations, thereby complete the list of RB assignment sequences. At the end of each iteration, a new RB assignment sequence is added based on the pattern, cyclic shift tuple producing the fewest collisions with occupied resource blocks of the graphical representation.

Abstract translation: 迭代顺序选择技术可用于有效地计算中继辅助网络中的RB分配序列。 实施例技术基于一组模式中的所选择的模式和多个循环移位中选择的循环移位构建循环组的图形表示。 剩余模式被放置在单一组中，并且使用迭代顺序选择技术来评估在迭代序列中的每个循环移位的单位组中的剩余模式，从而完成RB分配序列的列表。 在每次迭代结束时，基于模式添加新的RB分配序列，循环移位元组产生与图形表示的占用资源块最少的冲突。

公开(公告)号：US20150031406A1

公开(公告)日：2015-01-29

申请号：US14340322

申请日：2014-07-24

Applicant: FUTUREWEI TECHNOLOGIES, INC.

Inventor： Yaser Fouad ,  Ramy Gohary ,  Halim Yanikomeroglu ,  Gamini Senarath

IPC: H04W16/10 ,  H04B7/14

CPC classification number: H04W16/10 ,  H04B7/15542 ,  H04W16/26 ,  H04W84/047 ,  H04W88/02

Abstract: Iterative sequential selection techniques can be used to efficiently compute RB assignment sequences in relay-assisted networks. Embodiment techniques construct a graphical representation of a cyclic group based on a selected pattern in a set of patterns and a selected cyclic-shift in a plurality of cyclic shifts. Remaining patterns are placed in a unitary group, and an iterative sequential selection technique is used to evaluate the remaining patterns in the unitary group for each of the cyclic shifts over a sequence of iterations, thereby complete the list of RB assignment sequences. At the end of each iteration, a new RB assignment sequence is added based on the pattern, cyclic shift tuple producing the fewest collisions with occupied resource blocks of the graphical representation.

Abstract translation: 迭代顺序选择技术可用于有效地计算中继辅助网络中的RB分配序列。 实施例技术基于一组模式中的所选择的模式和多个循环移位中选择的循环移位构建循环组的图形表示。 剩余模式被放置在单一组中，并且使用迭代顺序选择技术来评估在迭代序列中的每个循环移位的单位组中的剩余模式，从而完成RB分配序列的列表。 在每次迭代结束时，基于模式添加新的RB分配序列，循环移位元组产生与图形表示的占用资源块最少的冲突。

公开(公告)号：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的总和的值，分配多个资源用于向用户发送服务。 对于静态或准静态通道，关系模型是具有单调权衡属性的凸函数。 对于遍历时变通道，通过使用基于梯度的方法求解关系模型来选择调谐参数。

公开(公告)号：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的总和的值，分配多个资源用于向用户发送服务。 对于静态或准静态通道，关系模型是具有单调权衡属性的凸函数。 对于遍历时变通道，通过使用基于梯度的方法求解关系模型来选择调谐参数。