会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 4. 发明授权
    • Method and system for rate prediction in coordinated multi-point transmission
    • 协调多点传输速率预测方法与系统
    • US08594688B2
    • 2013-11-26
    • US12962581
    • 2010-12-07
    • Alan BarbieriAlexei Yurievitch Gorokhov
    • Alan BarbieriAlexei Yurievitch Gorokhov
    • H04B7/24
    • H04B7/0626H04B7/024H04B17/26H04B17/336H04B17/345H04B17/382H04L5/0032H04L5/0035
    • A downlink cooperative multi-point (CoMP) framework of a wireless communication system reduces inter-node interference and increases channel gain by scheduling a user equipment (UE) based on improved interference estimates and gain estimates. The UE computes a gain scaling factor (μ) based on theoretical gain and actual gain for each available scheduling scenario and transmits the gain scaling factors to an anchor node of the UE's radio reporting set (RRS). The anchor node computes an internal scaling factor (ν) based on the received gain scaling factors (μ) to estimate an actual gain for the scheduling scenarios. The UE also periodically transmits quantized interference estimates to the anchor node. The anchor node predicts a rate for the scheduling scenarios and schedules the UE based on the internal scaling factor (ν), the gain scaling factors (μ), and the interference estimates.
    • 无线通信系统的下行链路协作多点(CoMP)框架通过基于改进的干扰估计和增益估计调度用户设备(UE)来减少节点间干扰并增加信道增益。 UE基于每个可用调度场景的理论增益和实际增益来计算增益比例因子(mu),并将增益缩放因子发送到UE的无线电报告集(RRS)的锚节点。 锚节点基于接收的增益比例因子(μ)计算内部缩放因子(nu),以估计调度场景的实际增益。 UE还周期性地向锚节点发送量化的干扰估计。 锚节点根据内部缩放因子(nu),增益比例因子(mu)和干扰估计来预测调度方案的速率并调度UE。
    • 5. 发明申请
    • METHOD AND SYSTEM FOR RATE PREDICTION IN COORDINATED MULTI-POINT TRANSMISSION
    • 用于协调多点传输的速率预测的方法和系统
    • US20110306350A1
    • 2011-12-15
    • US12962581
    • 2010-12-07
    • Alan BarbieriAlexei Yurievitch Gorokhov
    • Alan BarbieriAlexei Yurievitch Gorokhov
    • H04W52/02H04W72/04
    • H04B7/0626H04B7/024H04B17/26H04B17/336H04B17/345H04B17/382H04L5/0032H04L5/0035
    • A downlink cooperative multi-point (CoMP) framework of a wireless communication system reduces inter-node interference and increases channel gain by scheduling a user equipment (UE) based on improved interference estimates and gain estimates. The UE computes a gain scaling factor (μ) based on theoretical gain and actual gain for each available scheduling scenario and transmits the gain scaling factors to an anchor node of the UE's radio reporting set (RRS). The anchor node computes an internal scaling factor (ν) based on the received gain scaling factors (μ) to estimate an actual gain for the scheduling scenarios. The UE also periodically transmits quantized interference estimates to the anchor node. The anchor node predicts a rate for the scheduling scenarios and schedules the UE based on the internal scaling factor (ν), the gain scaling factors (μ), and the interference estimates.
    • 无线通信系统的下行链路协作多点(CoMP)框架通过基于改进的干扰估计和增益估计调度用户设备(UE)来减少节点间干扰并增加信道增益。 UE基于每个可用调度场景的理论增益和实际增益来计算增益缩放因子(μ),并将增益缩放因子发送到UE的无线电报告集(RRS)的锚节点。 锚节点基于接收到的增益缩放因子(μ)计算内部缩放因子(&ngr),以估计调度场景的实际增益。 UE还周期性地向锚节点发送量化的干扰估计。 锚节点根据内部缩放因子(&ngr),增益比例因子(μ)和干扰估计来预测调度方案的速率并调度UE。
    • 6. 发明申请
    • LIST ELIMINATION FOR DISTRIBUTED DOWNLINK COORDINATED MULTI-POINT (CoMP) FRAMEWORK
    • 分布式下行协调多点(CoMP)框架的列表消除
    • US20100144334A1
    • 2010-06-10
    • US12633692
    • 2009-12-08
    • Alexei Y. GorokhovAlan BarbieriSiddhartha MallikMohammad J. Borran
    • Alexei Y. GorokhovAlan BarbieriSiddhartha MallikMohammad J. Borran
    • H04W28/00
    • H04L5/0091H04L5/0035H04W28/06H04W48/18H04W92/20
    • Providing for record filtering in distributed dynamic clustering algorithms for coordinated multipoint (CoMP) wireless communication is described herein. By way of example, strategy selection records distributed as part of a belief propagation network are pruned at recipient nodes, thereby reducing processing overhead for dynamic clustering. As a result, cooperative policies can be determined with greater efficiency, and with greater relevance to local clusters of cooperating base stations. In some aspects, record pruning can comprise identifying and discarding redundant or incompatible sets of policy decisions. In at least one aspect, a number of evaluated records can be capped based on relevance, while preserving deployment-wide applicability of the belief propagation network. Accordingly, dynamic distributed CoMP decisions are optimized on a deployment-wide scale that more efficiently converges to maximum utility solutions.
    • 本文描述了用于协调多点(CoMP)无线通信的分布式动态聚类算法中的记录过滤。 作为示例,作为信任传播网络的一部分分发的策略选择记录在接收节点处被修剪,从而减少动态聚类的处理开销。 因此,可以更有效率地确定合作政策,并与当地的合作基站集群更为相关。 在某些方面,记录修剪可以包括识别和丢弃冗余或不兼容的策略决策集合。 在至少一个方面,可以基于相关性来限制许多评估记录,同时保留信任传播网络的部署范围适用性。 因此,动态分布式CoMP决策在部署范围内进行优化,从而更有效地收敛到最大的实用解决方案。
    • 7. 发明授权
    • List elimination for distributed downlink coordinated multi-point (CoMP) framework
    • 分布式下行链路协调多点(CoMP)框架的列表消除
    • US08675511B2
    • 2014-03-18
    • US12633692
    • 2009-12-08
    • Alexei Y. GorokhovAlan BarbieriSiddhartha MallikMohammad J. Borran
    • Alexei Y. GorokhovAlan BarbieriSiddhartha MallikMohammad J. Borran
    • H04L12/26
    • H04L5/0091H04L5/0035H04W28/06H04W48/18H04W92/20
    • Providing for record filtering in distributed dynamic clustering algorithms for coordinated multipoint (CoMP) wireless communication is described herein. By way of example, strategy selection records distributed as part of a belief propagation network are pruned at recipient nodes, thereby reducing processing overhead for dynamic clustering. As a result, cooperative policies can be determined with greater efficiency, and with greater relevance to local clusters of cooperating base stations. In some aspects, record pruning can comprise identifying and discarding redundant or incompatible sets of policy decisions. In at least one aspect, a number of evaluated records can be capped based on relevance, while preserving deployment-wide applicability of the belief propagation network. Accordingly, dynamic distributed CoMP decisions are optimized on a deployment-wide scale that more efficiently converges to maximum utility solutions.
    • 本文描述了用于协调多点(CoMP)无线通信的分布式动态聚类算法中的记录过滤。 作为示例,作为信任传播网络的一部分分发的策略选择记录在接收节点处被修剪,从而减少动态聚类的处理开销。 因此,可以更有效率地确定合作政策,并与当地的合作基站集群更为相关。 在某些方面,记录修剪可以包括识别和丢弃冗余或不兼容的策略决策集合。 在至少一个方面,可以基于相关性来限制许多评估记录,同时保留信任传播网络的部署范围适用性。 因此,动态分布式CoMP决策在部署范围内进行优化,从而更有效地收敛到最大的实用解决方案。
    • 8. 发明授权
    • Distributed downlink coordinated multi-point (CoMP) framework
    • 分布式下行协调多点(CoMP)框架
    • US08498647B2
    • 2013-07-30
    • US12547395
    • 2009-08-25
    • Alexei Y. GorokhovSiddhartha MallikNaga BhushanAlan Barbieri
    • Alexei Y. GorokhovSiddhartha MallikNaga BhushanAlan Barbieri
    • H04W40/00
    • H04W24/02H04B7/024H04B17/382
    • Systems and methodologies are described that facilitate dynamically forming clusters in a wireless communication environment. A set of non-overlapping clusters can be formed dynamically over time and in a distributed manner. Each of the clusters can include a set of base stations and a set of mobile devices. The clusters can be yielded based upon a set of local strategies selected by base stations across the network converged upon through message passing. For example, each base station can select a particular local strategy as a function of time based upon network-wide utility estimates respectively conditioned upon implementation of the particular local strategy and disparate possible local strategies that can cover the corresponding base station. Moreover, operation within each of the clusters can be coordinated.
    • 描述了促进在无线通信环境中动态形成集群的系统和方法。 一组不重叠的簇可以随着时间和分布式动态地形成。 每个群集可以包括一组基站和一组移动设备。 可以基于通过基站通过消息传递收敛的网络选择的一组局部策略来产生群集。 例如,基于分别基于特定局部策略的实施和可覆盖相应基站的不同的可能的局部策略的网络范围的效用估计,每个基站可以选择作为时间的函数的特定局部策略。 此外,可以协调每个群集内的操作。
    • 9. 发明授权
    • Method and apparatus for cooperation strategy selection in a wireless communication system
    • 无线通信系统中合作策略选择的方法和装置
    • US08432821B2
    • 2013-04-30
    • US12568269
    • 2009-09-28
    • Alexei Y. GorokhovSiddhartha MallikAlan BarbieriJilei Hou
    • Alexei Y. GorokhovSiddhartha MallikAlan BarbieriJilei Hou
    • G06F11/00H04J1/16H04L1/00H04L12/26
    • H04W24/02H04L5/0023H04L5/0035H04L5/006H04L5/0073H04L5/0091
    • Systems and methodologies are described that facilitate cooperation strategy selection for a network multiple-in-multiple-out (N-MIMO) communication system. As described herein, one or more nodes in a communication system capable of N-MIMO communication can calculate marginal utilities, projected per-user rates, and/or other parameters corresponding to respective associated users. Based on these calculations, respective network nodes can perform user scheduling and selection, cell scheduling and selection, selection of a cooperation strategy (e.g., coordinated silencing, joint transmission, coordinated beamforming, etc.), and/or other operations to provide cooperative communication for respective users. As further described herein, projected rate calculation for a given user can be adjusted based on processing or channel implementation loss associated with the user, interference nulling capability of the user, or other factors. As additionally described herein, these and/or other parameters can be fed back by respective users to a serving network node and/or mandated via system performance requirements.
    • 描述了促进网络多输入多输出(N-MIMO)通信系统的协作策略选择的系统和方法。 如这里所描述的,能够进行N-MIMO通信的通信系统中的一个或多个节点可以计算边际效用,预计的每用户速率和/或对应于各个相关用户的其他参数。 基于这些计算,各个网络节点可以执行用户调度和选择,小区调度和选择,合作策略的选择(例如,协调消隐,联合传输,协调波束形成等)和/或提供协作通信的其他操作 为各个用户。 如本文进一步描述的,可以基于与用户相关联的处理或信道实现损失,用户的干扰归零能力或其他因素来调整给定用户的预计速率计算。 如本文另外描述的,这些和/或其他参数可以由相应的用户反馈到服务网络节点和/或通过系统性能要求强制。
    • 10. 发明申请
    • METHOD AND APPARATUS FOR COOPERATION STRATEGY SELECTION IN A WIRELESS COMMUNICATION SYSTEM
    • 无线通信系统中合作策略选择的方法与装置
    • US20100085917A1
    • 2010-04-08
    • US12568269
    • 2009-09-28
    • Alexei Y. GorokhovSiddhartha MallikAlan BarbieriJilei Hou
    • Alexei Y. GorokhovSiddhartha MallikAlan BarbieriJilei Hou
    • H04W40/00H04L27/28
    • H04W24/02H04L5/0023H04L5/0035H04L5/006H04L5/0073H04L5/0091
    • Systems and methodologies are described that facilitate cooperation strategy selection for a network multiple-in-multiple-out (N-MIMO) communication system. As described herein, one or more nodes in a communication system capable of N-MIMO communication can calculate marginal utilities, projected per-user rates, and/or other parameters corresponding to respective associated users. Based on these calculations, respective network nodes can perform user scheduling and selection, cell scheduling and selection, selection of a cooperation strategy (e.g., coordinated silencing, joint transmission, coordinated beamforming, etc.), and/or other operations to provide cooperative communication for respective users. As further described herein, projected rate calculation for a given user can be adjusted based on processing or channel implementation loss associated with the user, interference nulling capability of the user, or other factors. As additionally described herein, these and/or other parameters can be fed back by respective users to a serving network node and/or mandated via system performance requirements.
    • 描述了促进网络多输入多输出(N-MIMO)通信系统的协作策略选择的系统和方法。 如这里所描述的,能够进行N-MIMO通信的通信系统中的一个或多个节点可以计算边际效用,预计的每用户速率和/或对应于各个相关用户的其他参数。 基于这些计算,各个网络节点可以执行用户调度和选择,小区调度和选择,合作策略的选择(例如,协调消隐,联合传输,协调波束形成等)和/或提供协作通信的其他操作 为各个用户。 如本文进一步描述的,可以基于与用户相关联的处理或信道实现损失,用户的干扰归零能力或其他因素来调整给定用户的预计速率计算。 如本文另外描述的,这些和/或其他参数可以由相应的用户反馈到服务网络节点和/或通过系统性能要求强制。