Channel decoding method and decoder for tail-biting codes
US9083385B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Mar 19, 2012 |
| Grant date | Jul 14, 2015 |
| Priority date | — |
| Expiry date | Mar 27, 2032 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH03M13/6525
- WIPO fieldBasic communication processes
- WIPO sectorElectrical engineering
Abstract
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.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.