公开(公告)号：US20130109401A1

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

申请号：US13725457

申请日：2012-12-21

Applicant: FUTUREWEI TECHNOLOGIES, INC.

Inventor： Jianglei Ma ,  Mohammadhadi Baligh ,  Aaron Callard

IPC: H04W72/04

CPC classification number: H04W72/0453 ,  H04W16/30 ,  H04W52/283 ,  H04W52/386 ,  H04W72/0426 ,  H04W72/08 ,  H04W92/20

Abstract: In accordance with an embodiment, a method of operating a base station in a wireless system, includes partitioning a frequency band into at least one band of a first type and at least one band of a second type, and coordinating the partitioning with at least one further base station. The at least one band of the first type includes a band on which the base station transmits power proportional to a distance of a user device from the base station, and the at least one band of the second type comprises a band on which base station transmits a data rate inversely proportional to a distance of a user device from the base station.

Abstract translation: 根据实施例，一种在无线系统中操作基站的方法包括将频带划分成第一类型的至少一个频带和至少一个第二类型的频带，并且与至少一个 进一步的基站。 所述第一类型的至少一个频带包括频带，所述基站在所述频带上发送与所述基站的用户设备的距离成比例的功率，并且所述第二类型的所述至少一个频带包括基站发送的频带 数据速率与用户设备与基站的距离成反比。

公开(公告)号：US20160050670A1

公开(公告)日：2016-02-18

申请号：US14461187

申请日：2014-08-15

Applicant: Futurewei Technologies, Inc.

Inventor： Alex Stephenne ,  Gamini Senarath ,  Aaron Callard

IPC: H04W72/04

CPC classification number: H04W72/0486 ,  H04W72/085

Abstract: Embodiments are provided for assessing radio resource requirements using virtual bin virtualization. An embodiment method includes receiving a service request from a user equipment (UE) in a geographical bin. Resource requirements are then obtained, from a lookup table (LUT), for a serving radio node and neighbor radio nodes associated with the geographic bin of the UE. The LUT comprises a plurality of entries that map combinations of path losses of wireless links for the serving radio node and neighbor radio nodes to corresponding combinations of resource requirements. The entries of the path losses further include one or more service specific and network node parameters for the serving radio nodes and neighbor radio nodes, which are also mapped to the resource requirements. The obtained resource requirements are then assessed, including deciding whether to serve the UE according to the resource requirements and to resource availability.

Abstract translation: 提供了使用虚拟虚拟机来评估无线电资源需求的实施例。 一种实施方式包括从地理箱中的用户设备（UE）接收服务请求。 然后从查找表（LUT）获得用于服务无线电节点和与UE的地理箱相关联的相邻无线电节点的资源需求。 LUT包括将服务无线电节点和相邻无线电节点的无线链路的路径损耗的组合映射到资源需求的相应组合的多个条目。 路径损耗的条目还包括用于服务无线电节点和相邻无线电节点的一个或多个服务特定和网络节点参数，其也被映射到资源需求。 然后评估所获得的资源需求，包括根据资源需求决定是否为UE服务，以及资源可用性。

公开(公告)号：US20160037379A1

公开(公告)日：2016-02-04

申请号：US14445889

申请日：2014-07-29

Applicant: FutureWei Technologies, Inc.

Inventor： Kaveh Shafiee ,  Hang Zhang ,  Aaron Callard ,  Alex Stephenne ,  Hamidreza Farmanbar

IPC: H04W28/02

CPC classification number: H04W28/0268 ,  H04L47/805 ,  H04W28/0226 ,  H04W72/048

Abstract: Embodiments are provided for traffic scheduling based on user equipment (UE) in wireless networks. A location prediction-based network scheduler (NS) interfaces with a traffic engineering (TE) function to enable location-prediction-based routing for UE traffic. The NS obtains location prediction information for a UE for a next time window comprising a plurality of next time slots, and obtains available network resource prediction for the next time slots. The NS then determines, for each of the next time slots, a weight value as a priority parameter for forwarding data to the UE, in accordance with the location prediction information and the available network resource prediction. The result for the first time slot is then forwarded from the NS to the TE function, which optimizes, for the first time slot, the weight value with a route and data for forwarding the data to the UE.

Abstract translation: 提供了用于基于无线网络中的用户设备（UE）的业务调度的实施例。 基于位置预测的网络调度器（NS）与流量工程（TE）功能接口，以实现针对UE业务的基于位置预测的路由。 NS为包含多个下一个时隙的下一个时间窗口的UE获取位置预测信息，并获得下一个时隙的可用网络资源预测。 然后，NS根据位置预测信息和可用的网络资源预测，为每个下一个时隙确定权重值作为用于将数据转发到UE的优先级参数。 第一时隙的结果然后从NS转发到TE功能，其在第一时隙中利用用于将数据转发到UE的路由和数据来优化权重值。

公开(公告)号：US09072116B2

公开(公告)日：2015-06-30

申请号：US13787599

申请日：2013-03-06

Applicant: FutureWei Technologies, Inc.

Inventor： Hamidreza Farmanbar ,  Aaron Callard

IPC: H04W72/10 ,  H04W72/12

CPC classification number: H04W72/12 ,  H04L1/0003 ,  H04L1/0009

Abstract: The computational complexity of MCS adaptation for linear and non-linear MU-MIMO can be reduced by avoiding QR decomposition during subsequent stages of MCS adaptation. For instance, QR decomposition can be avoided in later stages of MCS adaptation by computing an instant upper right triangular matrix (R1) directly from an earlier upper right triangular matrix (R) and an earlier unitary matrix (U), which were obtained during a previous stage of MCS adaptation. As such, the instant upper right triangular matrix (R1) is obtained without performing QR decomposition on an instant Hermitian matrix (H1H), thereby allowing MCS adaptation to be performed for the new user group with less complexity. Additionally, computational complexity of MCS adaptation for linear MU-MIMO can be further reduced by avoiding matrix inversion during subsequent stages of MCS adaptation.

Abstract translation: 通过在MCS适应的后续阶段避免QR分解，可以减少线性和非线性MU-MIMO的MCS适应的计算复杂度。 例如，可以通过直接从较早的右上角三角矩阵（R）和较早的单位矩阵（U）计算即时右上角三角矩阵（R）和较早的单位矩阵（U）来在MCS适应的后期阶段避免QR分解，这是在 MCS适应的前期阶段。 这样，即时的右上角三角矩阵（R1）就不需要对即时埃米特矩阵（H1H）进行QR分解，从而允许以较不复杂的方式为新的用户组执行MCS适配。 此外，通过在MCS适应的后续阶段避免矩阵反演，可以进一步减少用于线性MU-MIMO的MCS适应的计算复杂度。

公开(公告)号：US20150003471A1

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

申请号：US14459105

申请日：2014-08-13

Applicant: Futurewei Technologies, Inc.

Inventor： Aaron Callard ,  Peiying Zhu ,  Hang Zhang ,  Petar Djukic ,  Vipul Desai ,  Peter Ashwood-Smith

IPC: H04L29/08 ,  H04L29/06

CPC classification number: H04W28/06 ,  H04L41/147 ,  H04L47/14 ,  H04L47/323 ,  H04L67/02 ,  H04L67/2819 ,  H04L69/04 ,  H04L69/168 ,  H04L69/18 ,  H04L69/321 ,  H04L69/322 ,  H04W24/00 ,  H04W28/0289

Abstract: Methods and devices for reducing traffic over a wireless link through the compression or suppression of high layer packets carrying predictable background data prior to transportation over a wireless link. The methods include intercepting application layer protocol packets carrying the predictable background data. In embodiments where the background data is periodic in nature, the high layer packets may be compressed into low-layer signaling indicators for communication over a low-layer control channel (e.g., an on off keying (OOK) channel). Alternatively, the high layer packets may be suppressed entirely (not transported over the wireless link) when a receiver side daemon is configured to autonomously replicate the periodic background nature according to a projected interval. In other embodiments, compression techniques may be used to reduce overhead attributable to non-periodic background data that is predictable in context.

Abstract translation: 用于通过在通过无线链路传输之前通过压缩或抑制携带可预测背景数据的高层分组来减少无线链路上的业务的方法和设备。 这些方法包括拦截携带可预测背景数据的应用层协议报文。 在背景数据本质上是周期性的实施例中，高层分组可以被压缩成低层信令指示符，用于通过低层控制信道（例如，断开键控（OOK）信道）进行通信。 或者，当接收器侧守护进程被配置为根据投影的间隔自动复制周期性背景特性时，可以完全抑制高层分组（不通过无线链路传输）。 在其他实施例中，可以使用压缩技术来减少归因于上下文中可预测的非周期性背景数据的开销。

公开(公告)号：US20140362688A1

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

申请号：US14069948

申请日：2013-11-01

Applicant: FutureWei Technologies, Inc.

Inventor： Hang Zhang ,  Gamini Senarath ,  Aaron Callard ,  Hamidreza Farmanbar ,  Ngoc-Dung Dao ,  Alex Stephenne ,  Petar Djukic ,  Xu Li ,  Kaveh Shafiee ,  Philippe Leroux

IPC: H04W72/04 ,  H04W28/02

CPC classification number: H04W72/0486 ,  H04L41/0816 ,  H04L41/0896 ,  H04L41/12 ,  H04L41/147 ,  H04L41/5067 ,  H04W24/02 ,  H04W28/0284 ,  H04W28/0289 ,  H04W28/08 ,  H04W28/18 ,  H04W84/105 ,  H04W92/04

Abstract: A system and method for agile wireless access network is provided. A method embodiment for agile radio access network management includes determining, by a network controller, capabilities and neighborhood relations of radio nodes in the radio access network. The network controller then configures a backhaul network infrastructure for the radio access network in accordance with the capabilities and the neighborhood relations of the radio nodes.

Abstract translation: 提供了一种用于敏捷无线接入网络的系统和方法。 用于敏捷无线电接入网络管理的方法实施例包括由网络控制器确定无线电接入网络中的无线电节点的能力和邻域关系。 网络控制器然后根据无线电节点的能力和邻居关系配置无线电接入网络的回程网络基础设施。

公开(公告)号：US20140254495A1

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

申请号：US13787599

申请日：2013-03-06

Applicant: FUTUREWEI TECHNOLOGIES, INC.

Inventor： Hamidreza Farmanbar ,  Aaron Callard

IPC: H04W72/12

CPC classification number: H04W72/12 ,  H04L1/0003 ,  H04L1/0009

Abstract: The computational complexity of MCS adaptation for linear and non-linear MU-MIMO can be reduced by avoiding QR decomposition during subsequent stages of MCS adaptation. For instance, QR decomposition can be avoided in later stages of MCS adaptation by computing an instant upper right triangular matrix (R1) directly from an earlier upper right triangular matrix (R) and an earlier unitary matrix (U), which were obtained during a previous stage of MCS adaptation. As such, the instant upper right triangular matrix (R1) is obtained without performing QR decomposition on an instant Hermitian matrix (H1H), thereby allowing MCS adaptation to be performed for the new user group with less complexity. Additionally, computational complexity of MCS adaptation for linear MU-MIMO can be further reduced by avoiding matrix inversion during subsequent stages of MCS adaptation.

Abstract translation: 通过在MCS适应的后续阶段避免QR分解，可以减少线性和非线性MU-MIMO的MCS适应的计算复杂度。 例如，可以通过直接从较早的右上角三角矩阵（R）和较早的单位矩阵（U）计算即时右上角三角矩阵（R）和较早的单位矩阵（U）来在MCS适应的后期阶段避免QR分解，这是在 MCS适应的前期阶段。 这样，即时的右上角三角矩阵（R1）就不需要对即时埃米特矩阵（H1H）进行QR分解，从而允许以较不复杂的方式为新的用户组执行MCS适配。 此外，通过在MCS适应的后续阶段避免矩阵反演，可以进一步减少用于线性MU-MIMO的MCS适应的计算复杂度。

公开(公告)号：US20130176846A1

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

申请号：US13734439

申请日：2013-01-04

Applicant: FutureWei Technologies, Inc.

Inventor： Aaron Callard ,  Alex Stephenne ,  Petar Djukic

IPC: H04W28/02

CPC classification number: H04W28/0215 ,  H04L67/06 ,  H04L67/325

Abstract: An embodiment user equipment has a list of predictive data that a user may request, and programming to receive prefetched data based on the list of predictive data at a reduced cost, wherein the reduced cost is lower than a network cost of downloading the data, and to store the prefetched data within the UE for future consumption. An embodiment base station has a list of predictive data a UE may request, a high priority queue for data requested by the UE, and a low priority queue with predictive data corresponding to the list of predictive data. The base station further includes programing to send the requested data and to send the predictive data.

Abstract translation: 实施例用户设备具有用户可以请求的预测数据的列表，并且以降低的成本基于预测数据的列表来编程接收预取数据，其中降低的成本低于下载数据的网络成本，以及 以将预取的数据存储在UE内用于将来消费。 实施例基站具有UE可以请求的预测数据的列表，用于UE请求的数据的高优先级队列，以及具有与预测数据列表相对应的预测数据的低优先级队列。 基站还包括编程以发送所请求的数据并发送预测数据。