会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明申请
    • TURBO INTERLEAVER FOR HIGH DATA RATES
    • WO2008057906A3
    • 2009-01-15
    • PCT/US2007083284
    • 2007-11-01
    • QUALCOMM INCWEI YONGBINSUN JINGMALLADI DURGA PRASAD
    • WEI YONGBINSUN JINGMALLADI DURGA PRASAD
    • H03M13/27
    • H03M13/2775H03M13/296H03M13/6561
    • Techniques for supporting high decoding throughput are described. A transmitter may encode a code block of data bits with a Turbo encoder. A receiver may perform decoding for the code block with a Turbo decoder having multiple soft-input soft-output (SISO) decoders. A contention-free Turbo interleaver may be used if the code block size is larger than a threshold size. A regular Turbo interleaver may be used if the code block size is equal to or smaller than the threshold size. The contention-free Turbo interleaver reorders the data bits in the code block such that information from the multiple SISO decoders, after interleaving or deinterleaving, can be written in parallel to multiple storage units in each write cycle without encountering memory access contention. The regular Turbo interleaver can reorder the data bits in the code block in any manner without regard to contention-free memory access.
    • 描述了用于支持高解码吞吐量的技术。 发射机可以使用Turbo编码器对数据位的码块进行编码。 接收机可以使用具有多个软输入软输出(SISO)解码器的Turbo解码器来对码块执行解码。 如果码块大小大于阈值大小,则可以使用无竞争的Turbo交织器。 如果码块大小等于或小于阈值大小,则可以使用常规Turbo交织器。 无竞争的Turbo交织器重新排序代码块中的数据位,使得来自多个SISO解码器的信息在交织或解交织之后可以在每个写周期中并行写入多个存储单元,而不会遇到存储器访问争用。 正常的Turbo交织器可以以任何方式重新排序代码块中的数据位,而不考虑无竞争的存储器访问。
    • 4. 发明申请
    • JAMMING GRAPH AND ITS APPLICATION IN NETWORK RESOURCE ASSIGNMENT
    • JAMMING GRAPH及其在网络资源分配中的应用
    • WO2010005683A3
    • 2010-03-04
    • PCT/US2009047230
    • 2009-06-12
    • QUALCOMM INCSUN JINGKHANDEKAR AAMOD DJI TINGFANG
    • SUN JINGKHANDEKAR AAMOD DJI TINGFANG
    • H04W16/06
    • H04W16/10H04L5/0007H04L5/0032H04L5/0071H04W16/06H04W72/0406
    • A wireless communication network uses backhaul negotiation based upon static and dynamic resource assignment on jamming graphs. Static reuse factor design methods including fractional frequency reuse (FFR) are addressed. The jamming graph is used to summarize the interfering relationship between transmitters (nodes in the jamming graph). Negotiation-based algorithm is used to arrive at a static resource assignment so that a large reuse factor can be achieved while jamming scenario can be avoided. As a result of such algorithm, each transmitter is assigned some resources, over which traffic transmission can be done instantaneously to reduce the packet delay for short packets. Based on the result of static resource negotiation algorithm, a dynamic resource algorithm can be run, such that the resources assigned to different nodes can be share in a bursty traffic scenario to further reduce packet delay for larger packet size cases, while jamming be also avoided.
    • 无线通信网络使用基于干扰图上的静态和动态资源分配的回程协商。 包括分数频率复用(FFR)在内的静态重用因子设计方法得到了解决。 干扰图用于总结发射机(干扰图中的节点)之间的干扰关系。 使用基于谈判的算法来获得静态资源分配,从而可以避免干扰情况下实现大的重用因子。 作为这种算法的结果,每个发射机被分配一些资源,可以通过该资源瞬时完成业务传输以减少短分组的分组延迟。 基于静态资源协商算法的结果,可以运行动态资源算法,使得分配给不同节点的资源可以在突发流量场景中共享,以进一步减小较大分组大小情况下的分组延迟,同时也避免干扰 。