利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

2 条记录 (耗时 0.011 秒)

    CHANNEL DECODING METHOD AND DECODER
    1.
    发明公开
    CHANNEL DECODING METHOD AND DECODER 有权
    Kanaldecodierung und -decoderfürtail-biting Codes

    公开(公告)号：EP2717477A1

    公开(公告)日：2014-04-09

    申请号：EP12792409.0

    申请日：2012-03-19

    申请人： Shanghai Research Center For Wireless Communications

    发明人： WANG, Xiaotao ,  QIAN, Hua ,  XU, Jing ,  HUANG, Hao ,  YANG, Yang ,  WANG, Fang

    IPC分类号： H03M13/23

    CPC分类号： H03M13/23 ,  H03M13/1505 ,  H03M13/3738 ,  H03M13/413 ,  H03M13/6505 ,  H03M13/6525

    摘要： A channel decoding method and decoder are disclosed. The decoding method is based on a Circular Viterbi Algorithm (CVA), rules out impossible initial states one by one through iterations according the received soft information sequence, and finally finds the global optimal tail-biting path. In the present invention, all impossible iterations are ruled out through multiple iterations, and only the initial state having most likelihood with the received sequence survives. The algorithm is finally convergent to an optimal tail-biting path to be output. In addition, the method also updates a metric of a maximum likelihood tail-biting path (MLTBP) or rules out impossible initial states through the obtained surviving tail-biting path, thereby effectively solving the problem that the algorithm is not convergent due to a circular trap, providing a practical optimal decoding algorithm for a tail-biting convolutional code, reducing the complexity of an existing decoding scheme, and saving the storage space.

    摘要翻译： 公开了一种信道解码方法和解码器。 解码方法基于循环维特比算法（CVA），根据接收到的软信息序列逐个排除不可能的初始状态，最终找到全局最优尾巴路径。 在本发明中，通过多次迭代排除所有不可能的迭代，并且只有具有接收序列的最可能性的初始状态才能存活。 该算法最终收敛到要输出的最佳尾巴路径。 另外，该方法还通过获得的幸存尾巴路径来更新最大似然尾巴路径（MLTBP）的度量或者排除不可能的初始状态，从而有效地解决了算法不会因圆形而收敛的问题 陷阱，为尾巴卷积码提供实用的最佳解码算法，降低了现有解码方案的复杂度，并节省了存储空间。