Progressive reuse partitioning for improved interference resection in wireless packet networks
    1.
    发明申请
    Progressive reuse partitioning for improved interference resection in wireless packet networks 审中-公开
    逐行重用分区,用于改善无线分组网络中的干扰切除

    公开(公告)号:US20060223540A1

    公开(公告)日:2006-10-05

    申请号:US11094933

    申请日:2005-03-31

    CPC classification number: H04W16/02 H04W16/12

    Abstract: A method for radio resource allocation based on planned priority ordering to realize the maximum carrier to interference ratio (C/I) in a cellular system that employs frequency reuse. Reuse of co-channel resources is progressively increased as traffic load increases based on the available spectrum. By using this method, interference rejection at light loading can approach that obtainable by using a low reuse factor. When applied to a wireless packet network, this method allows each resource to carry highest throughput according to the traffic demand and available bandwidth, while making more resources available to carry additional traffic when system loading is increased.

    Abstract translation: 一种基于计划优先级排序的无线资源分配方法,用于实现使用频率重用的蜂窝系统中的最大载波干扰比(C / I)。 随着可用频谱的流量负载增加,同频道资源的再利用逐渐增加。 通过使用这种方法,轻负载时的干扰抑制可以通过使用低再利用因子获得。 当应用于无线分组网络时,该方法允许每个资源根据业务需求和可用带宽携带最高吞吐量,同时在增加系统负载时,提供更多的资源来携带额外的流量。

    Method for near optimal joint channel estimation and data detection for COFDM systems

    公开(公告)号:US20060029168A1

    公开(公告)日:2006-02-09

    申请号:US11240228

    申请日:2005-09-30

    CPC classification number: H04L25/0204 H04L27/2647

    Abstract: Joint channel estimation and maximum likelihood decoding method for Coded Orthogonal Frequency Division Multiplexing (COFDM) systems are presented. Using this method in conjunction with convolutional coding, robust and nearly optimal coherent detection can be achieved in rapid dispersive fading channels. Significant performance gain in packet data throughput is realized in a system with aggressive frequency reuse. A method for estimating channel characteristics in a multicarrier transmission system comprising the steps of receiving a multicarrier signal, applying Fast Fourier transformations to the multicarrier signal, estimating channel characteristics of a multicarrier channel over which the multicarrier signal was transmitted using a combination of iterative processing and iterative backward processing, and decoding the transformed multicarrier signal is presented.

    Link adaptation in wireless networks for throughput maximization under retransmissions
    4.
    发明申请
    Link adaptation in wireless networks for throughput maximization under retransmissions 有权
    无线网络中的链路适配,用于传输下的吞吐量最大化

    公开(公告)号:US20050054296A1

    公开(公告)日:2005-03-10

    申请号:US10970883

    申请日:2004-10-22

    CPC classification number: H04L1/0009 H04L1/0003 H04L1/0021

    Abstract: The present invention implements a method and system for dynamically adapting the modulation and coding scheme for radio links in a wireless communications network based on a retransmission environment model in order to maximize throughput and most efficiently allocate bandwidth resources. The present invention encompasses a refined calculus and methodology for deriving the link adaptation thresholds in a retransmission environment using a complex model and analysis of the retransmission environment. The present invention holds particular application for wireless data communications as opposed to real time data services because it is based on a retransmission model applicable primarily for data services. A critical component of this new link adaptation system is a “no transmission” cutoff mode that is selected for SIR below a base threshold value. This new mode prevents system instability and misallocation of bandwidth in a wireless communication system.

    Abstract translation: 本发明实现了一种方法和系统,用于基于重传环境模型动态地适应无线通信网络中的无线电链路的调制和编码方案,以便最大化吞吐量并且最有效地分配带宽资源。 本发明涉及一种用于使用复杂模型和重传环境的分析在重传环境中导出链路自适应阈值的精细微积分和方法。 本发明与实时数据业务相比,具有无线数据通信的特殊应用,因为它基于主要适用于数据业务的重传模型。 该新的链路自适应系统的关键部件是针对低于基本阈值的SIR选择的“无传输”截止模式。 这种新模式可防止无线通信系统中的系统不稳定和带宽分配不均匀。

Patent Agency Ranking