会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 3. 发明申请
    • Delayed branch decision in quadrature decomposition with M-searching
    • 通过M搜索在正交分解中延迟分支决策
    • US20080162902A1
    • 2008-07-03
    • US11706821
    • 2007-02-12
    • Wei LiHaifeng WangJorma LillebergMing ChenShixin Cheng
    • Wei LiHaifeng WangJorma LillebergMing ChenShixin Cheng
    • G06F9/00
    • H04L25/03216H04L2025/03426
    • A QRD-M decomposition includes a first and a sequential second stage, at least. In the first stage, M branches are selected from among more than M branches entering the first stage as survive branches from which multiple decompositions are calculated. In the second stage, more than M branches are selected from among those branches entering the second stage as survive branches from which multiple decompositions are calculated. The symbol of the received signal is decided from a branch that is a survive branch of both the first and second stages. The second stage may be within a window that may include additional stages at which the pruning decision down to M survive branches is delayed. One or more windows may be used in a single QRD-M decomposition. In an embodiment, all branches entering the second stage are survive branches. It is shown that the marginal increased computational load increases accuracy.
    • QRD-M分解至少包括第一和第二阶段。 在第一阶段,从分支进入第一阶段的M个分支中选出M个分支作为计算多个分解的生存分支。 在第二阶段,从进入第二阶段的那些分支中选出超过M个分支作为计算多重分解的生存分支。 接收信号的符号由作为第一和第二级的存活分支的分支决定。 第二阶段可能在一个窗口内,可能包括另外一个阶段,在此阶段,由M延续出来的剪枝决定被延迟。 单个QRD-M分解中可以使用一个或多个窗口。 在一个实施例中,进入第二阶段的所有分支都是能够分支的。 显示边际增加的计算负载提高了精度。
    • 4. 发明授权
    • Delayed branch decision in quadrature decomposition with M-searching
    • 通过M搜索在正交分解中延迟分支决策
    • US07844008B2
    • 2010-11-30
    • US11706821
    • 2007-02-12
    • Wei LiHaifeng WangJorma LillebergMing ChenShixin Cheng
    • Wei LiHaifeng WangJorma LillebergMing ChenShixin Cheng
    • H04L5/12H04L23/02
    • H04L25/03216H04L2025/03426
    • A QRD-M decomposition includes a first and a sequential second stage, at least. In the first stage, M branches are selected from among more than M branches entering the first stage as survive branches from which multiple decompositions are calculated. In the second stage, more than M branches are selected from among those branches entering the second stage as survive branches from which multiple decompositions are calculated. The symbol of the received signal is decided from a branch that is a survive branch of both the first and second stages. The second stage may be within a window that may include additional stages at which the pruning decision down to M survive branches is delayed. One or more windows may be used in a single QRD-M decomposition. In an embodiment, all branches entering the second stage are survive branches. It is shown that the marginal increased computational load increases accuracy.
    • QRD-M分解至少包括第一和第二阶段。 在第一阶段,从分支进入第一阶段的M个分支中选出M个分支作为计算多个分解的生存分支。 在第二阶段,从进入第二阶段的那些分支中选出超过M个分支作为计算多重分解的生存分支。 接收信号的符号由作为第一和第二级的存活分支的分支决定。 第二阶段可能在一个窗口内,可能包括另外一个阶段,在此阶段,由M延续出来的剪枝决定被延迟。 单个QRD-M分解中可以使用一个或多个窗口。 在一个实施例中,进入第二阶段的所有分支都是能够分支的。 显示边际增加的计算负载提高了精度。