会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 17. 发明申请
    • BUNDLING OF ACK INFORMATION IN A WIRELESS COMMUNICATION SYSTEM
    • 无线通信系统中的ACK信息聚合
    • WO2009137646A3
    • 2009-12-30
    • PCT/US2009043087
    • 2009-05-07
    • QUALCOMM INCSARKAR SANDIP
    • SARKAR SANDIP
    • H04L1/16H04L1/18
    • H04L1/1621H04L1/16H04L1/18
    • Techniques for bundling acknowledgement (ACK) information in a wireless communication system are described. In one design, a user equipment (UE) may receive multiple codewords in at least one downlink subframe. The UE may decode the multiple codewords and determine an ACK or a negative acknowledgement (NACK) for each codeword based on decoding result. The UE may bundle the ACKs and NACKs for the multiple codewords to obtain bundled ACK information. In one design, the UE may generate (i) a bundled ACK if ACKs are obtained for all codewords or (ii) a bundled NACK if a NACK is obtained for any codeword. The UE may send the bundled ACK information as feedback for the multiple codewords. The UE may receive retransmissions of the multiple codewords if a bundled NACK is sent and may receive new codewords if a bundled ACK is sent.
    • 描述了用于在无线通信系统中捆绑确认(ACK)信息的技术。 在一个设计中,用户设备(UE)可以在至少一个下行链路子帧中接收多个码字。 UE可以解码多个码字并基于解码结果为每个码字确定ACK或否定确认(NACK)。 UE可以捆绑多个码字的ACK和NACK以获得捆绑的ACK信息。 在一种设计中,如果针对所有码字获得ACK,则(i)如果针对任何码字获得NACK,则UE可以生成(i)捆绑的ACK或者(ii)捆绑的NACK。 UE可以发送捆绑的ACK信息作为针对多个码字的反馈。 如果发送了捆绑的NACK,则UE可以接收多个码字的重传,并且如果发送了捆绑的ACK,则可以接收新的码字。
    • 18. 发明申请
    • METHODS AND SYSTEMS FOR PDCCH BLIND DECODING IN MOBILE COMMUNICATIONS
    • 用于移动通信中的PDCCH盲解码的方法和系统
    • WO2009058905A3
    • 2009-11-26
    • PCT/US2008081641
    • 2008-10-29
    • QUALCOMM INCMALLADI DURGA PRASADMONTOJO JUANSARKAR SANDIP
    • MALLADI DURGA PRASADMONTOJO JUANSARKAR SANDIP
    • H04L1/00
    • H04L1/0038H04W72/042
    • Various methods and systems for efficiently performing the blind decoding of downlink signals are described. Several forms of arranging possible CCE combinations are examined and investigated. Based on PDCCH size estimation/information, CCE concatenations that are most likely (of limited sets) can be arrived at. Tree-based concatenations are also devised using largest CCE ordering to align smaller CCE sizes to similar boundaries. By such ordering, the search space for all possible CCE ordering and sizes can be reduced to an efficient tree. Set mapping between possible CCE/REs are also described using a first set to secondary and tertiary sets. Various other o'rdering and sorting schemes are also detailed that enable a blind decode of a PDCCH channel to be efficiently performed.
    • 描述了用于有效执行下行链路信号的盲解码的各种方法和系统。 对可能的CCE组合进行排列的几种形式进行了检查和调查。 基于PDCCH大小估计/信息,可以得出最有可能(有限集合)的CCE级联。 还设计了基于树的级联,使用最大的CCE排序来将较小的CCE大小对准到类似的边界。 通过这样的排序,所有可能的CCE排序和大小的搜索空间可以减少到一个有效的树。 也可以使用第一组到第二组和第三组来描述可能的CCE / RE之间的映射。 还详细描述了能够有效执行PDCCH信道的盲解码的各种其它的输入和排序方案。