会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 83. 发明授权
    • Soft output decoder for convolutional codes
    • 用于卷积码的软输出解码器
    • US06868132B1
    • 2005-03-15
    • US09502132
    • 2000-02-10
    • Brian K. ClassonVipul A. DesaiJames C. BakerDaniel M. Friend
    • Brian K. ClassonVipul A. DesaiJames C. BakerDaniel M. Friend
    • G06F11/10H03M13/23H03M13/41H03M13/45H04D1/00
    • H03M13/3905H03M13/3723H03M13/3972
    • Decoding signals represented by a trellis of block length N divided into windows of length L includes a step of decoding a backward recursion from a point P that is after the end of a window back to the end of the window. P is chosen at a sufficient distance from the end of the window such that backward recursion determines a known state metric at the end of the window. A next step includes decoding the window using backward recursion from the known state at the end of the window back to the beginning of the window to define a set of known backward recursion state metrics which are stored. A next step includes decoding using forward recursion starting from a known state at the beginning of the window and moving forward. A next step includes calculating a soft output at each stage of the forward recursion using the stored backward recursion state metrics, and branch metrics at each stage, and outputting the soft output for that stage.
    • 将由划分成长度L的窗口的块长度N的网格表示的解码信号包括从窗口结束后的点P返回到窗口结束之后的向后递归解码的步骤。 P选择距离窗口末端足够的距离,以便后向递归确定窗口末端的已知状态度量。 下一步骤包括使用从窗口结束处的已知状态到窗口的开始的反向递归来解码窗口,以定义一组已知的向后递归状态量度。 下一步包括使用从窗口开始处的已知状态开始并向前移动的正向递归的解码。 下一步包括使用存储的反向递归状态度量和每个阶段的分支度量来计算正向递归的每个阶段的软输出,并输出该阶段的软输出。
    • 84. 发明授权
    • Soft output decoder for convolutional codes
    • 用于卷积码的软输出解码器
    • US06856657B1
    • 2005-02-15
    • US09501883
    • 2000-02-10
    • Brian K. ClassonTerry M. SchaffnerVipul A. Desai
    • Brian K. ClassonTerry M. SchaffnerVipul A. Desai
    • G06F11/10H03M13/23H03M13/41H04D1/00
    • H04L1/0059H03M13/3905H03M13/3972H04L1/005
    • Decoding signals represented by a trellis of block length N divided into windows of length L includes a step of decoding a forward recursion from a point P1 that is before the beginning of a window up to the beginning of the window and decoding a backward recursion from a point P2 that is after the end of a window back to the end of the window to define known states at the beginning and end of the window. A next step includes decoding the window using backward recursion from the known state at the end of the window back to the beginning of the window to define a set of backward recursion state metrics. A next step includes decoding using forward recursion starting from a known state at the beginning of the window and moving forward to the end of the window to define a set of forward recursion state metrics. A next step includes calculating a soft output at each stage of the window using the forward and backward recursion state metrics, and branch metrics at each stage, and outputting the soft output for that stage.
    • 将由划分成长度L的窗口的块长度N的网格表示的解码信号包括从窗口开始直到窗口开始之前的点P1解码正向递归的步骤,并从窗口解码向后递归 点P2在窗口结束之后返回到窗口的末尾,以在窗口的开头和结尾定义已知状态。 下一步骤包括使用从窗口结束处的已知状态到窗口开头的反向递归来解码窗口,以定义一组向后递归状态度量。 下一步包括使用从窗口开始处的已知状态开始的前向递归进行解码,并向前移动到窗口的末尾以定义一组向前递归状态度量。 下一步包括使用正向和反向递归状态量度以及每个阶段的分支度量计算窗口每一阶段的软输出,并输出该阶段的软输出。