LOW COMPLEXITY DECODING ALGORITHM FOR TAIL-BITING CONVOLUTIONAL CODES
    1.
    发明申请
    LOW COMPLEXITY DECODING ALGORITHM FOR TAIL-BITING CONVOLUTIONAL CODES 有权
    用于尾随位移代码的低复杂度解码算法

    公开(公告)号:US20120137198A1

    公开(公告)日:2012-05-31

    申请号:US13368190

    申请日:2012-02-07

    Abstract: A method for decoding tail-biting convolutional codes. The method includes initializing a correction depth, selecting a first starting state from a set of encoding states, and initializing a metric value for the selected starting state as zero and the other states as infinity. The input bit stream is read and a Search Depth Viterbi algorithm (SDVA) is performed to determine path metrics and identify a minimum-metric path. The ending state for the minimum-metric path is determined and the output for this ending state is identified as “previous output.” A second starting state is set to the ending state of the minimum-metric path, and symbols equal to the correction depth from the previous output are read. The SDVA is performed on the second set of read symbols to generate a corrected output. A decoded output is generated by replacing symbols at the beginning of the previous output with the corrected output.

    Abstract translation: 一种用于解码尾巴卷积码的方法。 该方法包括初始化校正深度,从一组编码状态中选择第一起始状态,以及将所选择的起始状态的度量值初始化为零,将其他状态初始化为无穷大。 读取输入比特流,执行搜索深度维特比算法(SDVA)以确定路径度量并识别最小度量路径。 确定最小度量路径的结束状态,并将该结束状态的输出识别为“先前输出”。将第二起始状态设置为最小度量路径的结束状态,等于校正深度的符号 从以前的输出读取。 在第二组读符号上执行SDVA以产生校正输出。 通过使用校正输出替换先前输出开始处的符号来产生解码输出。

Patent Agency Ranking