会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 4. 发明申请
    • METHOD AND APPARATUS FOR DECODING RECURSIVE CONVOLUTIONAL SYMBOLS
    • 解码回归符号的方法和装置
    • WO0161891A8
    • 2001-12-20
    • PCT/US0103355
    • 2001-02-01
    • MOTOROLA INC
    • BROWN TYLERWANG MICHAEL M
    • G06F17/10H03M13/39H03M13/41H03D1/00
    • H03M13/3922H03M13/41H03M13/6502H03M13/6505
    • A decoding method and apparatus performs a forward recursion process on recursive convolutionally generated symbols and performs backward recursion on the symbols wherein a next state for the backward recursion process is based on linearly combining both a plurality of bits defining a current state of a backward recursion process and a hypothesized information bit. In one embodiment, a backward state determinator (200) combines all binary bits in a current state backward recursion register (202) to generate a most significant bit (MSB) (210) of a next state backward recursion register (204). To obtain remaining bits of the next state backward recursion register (204), bits (207a - 207n) in the current state backward recursion register (202) are shifted. The shifted bits then serve as the least significant bits (208a - 208n) in the next state backward recursion register (204). Accordingly, a suitable linear combination and bit shifting approach is used to determine the content of a next state backward recursion register (204).
    • 解码方法和装置对递归卷积生成的符号执行正向递归处理,并对符号执行反向递归,其中用于反向递归处理的下一状态是基于定义反向递归处理的当前状态的多个比特 和假设的信息位。 在一个实施例中,后向状态确定器(200)组合当前状态反向递归寄存器(202)中的所有二进制位以产生下一状态向递归寄存器(204)的最高有效位(MSB)(210)。 为了获得下一状态反向递归寄存器(204)的剩余位,当前状态反向递归寄存器(202)中的位(207a-207n)被移位。 移位的位然后用作下一状态反向递归寄存器(204)中的最低有效位(208a-208n)。 因此,使用适当的线性组合和比特移位方法来确定下一状态反向递归寄存器(204)的内容。