会员体验
专利管家（专利管理）
工作空间（专利管理）
风险监控（情报监控）
数据分析（专利分析）
侵权分析（诉讼无效）
联系我们
交流群
官方交流：
QQ群： 891211   
微信请扫码    >>>
现在联系顾问~
下载
著录项
PDF全文
热词
    • 3. 发明申请
      WO2010015989A2 METHOD AND ARRANGEMENT FOR GENERATING SOFT BIT INFORMATION IN A RECEIVER OF A MULTIPLE ANTENNA SYSTEM 审中-公开
    • METHOD AND ARRANGEMENT FOR GENERATING SOFT BIT INFORMATION IN A RECEIVER OF A MULTIPLE ANTENNA SYSTEM
    • 在多个天线系统的接收器中产生软信息信息的方法和装置
    • WO2010015989A2
    • 2010-02-11
    • PCT/IB2009/053361
    • 2009-08-03
    • NXP B.V. , ECKERT, Sebastian
    • ECKERT, Sebastian
    • H04L25/06
    • H04L25/03242 , H04L25/067
    • The invention which relates to a method and to an arrangement for generating soft bit information in a receiver of a multiple antenna system is based on the object of reducing the calculation complexity for generating the soft bit information. In terms of the method, the object is achieved by virtue of the fact that the iterative deepening search for the mth antenna is carried out in two substeps, in which case, in the first substep, when the last element of s is not assigned to the mth antenna, s is rotated in such a manner that m is associated with the last element of s, that the channel matrix H is likewise rotated and QR decomposition of the channel matrix H is carried out, that, in the second substep, the iterative deepening search is carried out using a search radius in the form of a vector r 2 max = [r 2 max (Q m 1 )> r 2 max (Q m 1 ),...r 2 max (Q m Nmbits ), r 2 max (Q m Nmbits ), in which N m bits denotes the number of bit positions in the mth antenna, that the comparison [r 2 max (...), r 2 max (...)≥ d 2 is carried out for a search radius vector r 2 max and the search radius is adapted by setting the vector element r 2 max (•••) of the search radius vector r 2 max to the value of the Euclidean distance corresponding to the condition satisfied, that the iterative deepening search is carried out as long as the codition d 2 ≤ min {r 2 maxϵ } + maxLLR is true, whereas max LLR describes the maximal amplitude of the desired softbits p m k , or the comparisons with all of the transmission symbols s(m) of all N Tx antennas have been carried out, that the soft bit information p m k for the antenna m is output, and that the substeps of the method are run through again until all of the soft bit information p m k has been determined for all N Tx antennas.
    • 关于在多天线系统的接收机中生成软比特信息的方法和装置的本发明是基于降低用于生成软比特信息的计算复杂度的目的。 在该方法方面，该目的是通过以下事实实现的：对第m个天线的迭代深化搜索以两个子步进行，在这种情况下，在第一子步骤中，当s的最后一个元素未分配给 第m个天线s以这样的方式旋转，即m与s的最后一个元素相关联，信道矩阵H同样旋转，并且执行信道矩阵H的QR分解，在第二子步骤中， 使用矢量r2 max = [r2 max（Qm 1）> r2 max（Qm 1），... r2 max（Qm Nmbits），r2 max（Qm Nmbits）的形式的搜索半径进行迭代加深搜索， ，其中Nm位表示第m个天线中的位位置数，对搜索半径向量r2 max和搜索执行比较[r2 max（...），r2 max（...）= d2 通过将搜索半径向量r2 max的向量元素r2 max（）设置为对应于条件s的欧氏距离的值来适应半径 只要编码d2 = min {r2 max？} + maxLLR为真，则迭代深化搜索被执行，而最大LLR描述所需软件的最大幅度pm k，或与所有传输的比较 已经执行了所有NT×天线的符号s（m），输出天线m的软比特信息pm k，并且该方法的子步骤再次运行，直到所有软比特信息pm k已经被 确定所有NTx天线。
    • 基本信息 添加关注 加入工作空间 PDF全文 PDF下载 全文下载 相似专利 双屏查看 权利要求书 说明书全文 Global Dossier Espacenet 法律信息 同族专利 专利引用
    • 5. 发明申请
      WO2011080326A1 BRANCH PROCESSING OF SEARCH TREE IN A SPHERE DECODER 审中-公开
    • BRANCH PROCESSING OF SEARCH TREE IN A SPHERE DECODER
    • 分支处理在球形解码器中搜索树
    • WO2011080326A1
    • 2011-07-07
    • PCT/EP2010/070946
    • 2010-12-30
    • ST-Ericsson SA , PAKER, Özgün , ECKERT, Sebastian , MOUY, Sebastien
    • PAKER, Özgün , ECKERT, Sebastian , MOUY, Sebastien
    • H04L25/03
    • H04L25/03242
    • Sphere decoding of signals for MIMO detection involves a first distance processor (10, 430) arranged to determine a distance between symbols of a received symbol vector and possible transmit symbols, in a search sequence according to a search tree. A line from root to leaf of the search tree represents a possible transmit symbol vector and the sequence of processing root level symbols can be ordered with respect to increasing distance without explicit sorting of the root level symbols based on distance calculations. A next symbol in the sequence is determined, based on a symbol currently being processed by the first distance processor, and a second distance processor (20, 440) determines the distance in respect of the next symbol in the search sequence for the same possible transmit symbol vector, in parallel with the determining of the distance in respect of the current symbol by the first distance processor. By looking ahead to the next symbol in the sequence and determining its distance in parallel, without waiting to see if the sequence jumps away from that next symbol, the processing can be speeded up or use less resources such as silicon area on an integrated circuit.
    • 用于MIMO检测的信号的球体解码涉及被布置为根据搜索树在搜索序列中确定接收到的符号向量的符号与可能的发送符号之间的距离的第一距离处理器（10,430）。 搜索树的根到叶的一行表示可能的发送符号向量，并且可以根据增加的距离对处理根级符号的序列进行排序，而不会基于距离计算对根级别符号进行显式排序。 基于当前由第一距离处理器处理的符号确定序列中的下一个符号，并且第二距离处理器（20,440）确定针对相同可能传输的搜索序列中下一个符号的距离 符号向量，与第一距离处理器相对于当前符号的距离的确定并行。 通过展望序列中的下一个符号并且并行确定其距离，而不用等待看到序列是否从该下一个符号跳开，可以加速处理或者使用更少的资源，例如集成电路上的硅区域。
    • 基本信息 添加关注 加入工作空间 PDF全文 PDF下载 全文下载 相似专利 双屏查看 权利要求书 说明书全文 Global Dossier Espacenet 法律信息 同族专利 专利引用
    • 6. 发明申请
      WO2008062329A2 METHOD AND ARRANGEMENT FOR GENERATING SOFT BIT INFORMATION IN A RECEIVER OF A MULTIPLE ANTENNA SYSTEM 审中-公开
    • METHOD AND ARRANGEMENT FOR GENERATING SOFT BIT INFORMATION IN A RECEIVER OF A MULTIPLE ANTENNA SYSTEM
    • 在多个天线系统的接收器中产生软信息信息的方法和装置
    • WO2008062329A2
    • 2008-05-29
    • PCT/IB2007/054002
    • 2007-10-02
    • NXP B.V. , ECKERT, Sebastian
    • ECKERT, Sebastian
    • H04L25/06
    • H04L25/03242
    • The invention which relates to a method and to an arrangement for generating soft bit information in a receiver of a multiple antenna system is based on the object of reducing the calculation complexity for generating the soft bit information. In terms of the method, the object is achieved by virtue of the fact that the iterative deepening search for the Mh antenna is carried out in two substeps, in which case, in the first substep, when the last element of s is not assigned to the m th antenna, s is rotated in such a manner that m is associated with the last element of s, that the channel matrix H is likewise rotated and QR decomposition of the channel matrix H is carried out, that, in the second substep, the iterative deepening search is carried out using a search radius in the form of a vector (Formula (I)); in which (Formula (II)) denotes the number of bit positions in the m th antenna, that the comparison (Formula (III))≥ d 2 is carried out for a search radius vector (Formula (IV)) and the search radius is adapted by setting the vector element (Formula (IV)) (•••) of the search vector (Formula (IV)) to the value of the Euclidean distance corresponding to the condition satisfied, that the iterative deepening search is carried out as long as at least one search radius (Formula (IV)) (•••) from the radius vector (Formula (IV)) satisfies the condition (Formula (III))≥ d 2 or the comparisons with all of the transmission symbols s(m) of all N Tx antennas have been carried out, that the soft bit information (Formula (V)) for the antenna m i s output, and that the substeps of the method are run through again until all of the soft bit information (Formula (V)) has been determined for all N Tx antennas.
    • 关于在多天线系统的接收机中生成软比特信息的方法和装置的本发明是基于降低用于生成软比特信息的计算复杂度的目的。 在该方法方面，该目的是通过以下事实来实现的：对于Mh天线的迭代加深搜索以两个子步进行，在这种情况下，在第一子步骤中，当s的最后一个元素未分配给 第m个天线s以这样的方式旋转，即m与s的最后一个元素相关联，信道矩阵H同样旋转，并且执行信道矩阵H的QR分解，在第二子步骤中， 使用向量（式（I））形式的搜索半径来进行迭代深化搜索; 其中（式（II））表示第m个天线中的比特位置的数量，比较（公式（III））= d <
    • 基本信息 添加关注 加入工作空间 PDF全文 PDF下载 全文下载 相似专利 双屏查看 权利要求书 说明书全文 Global Dossier Espacenet 法律信息 同族专利 专利引用
每页展示10个专利
每页展示10个专利
每页展示20个专利
每页展示50个专利
每页展示100个专利

IPRDB

最新中国发明专利 最新美国发明专利 技术领域 专利库 专利分类库 国际专利分类库

热门服务

会员版试用 API 数据接口 找代理 知嘟嘟专利交易 排行榜 大学排行榜 专利百科

关于我们

平台介绍 战略合作 网站地图

友情链接

知嘟嘟专利交易 国家知识产权局 中国商标网

联系方式


©2019-2023 上海吉码数字技术有限公司 版权所有，并保留所有权利 沪ICP备20016256号-6 沪公网安备31011702005475号