Low complexity decoding algorithm for tail-biting convolutional codes
US8397148B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Feb 7, 2012 |
| Grant date | Mar 12, 2013 |
| Priority date | — |
| Expiry date | Feb 7, 2032 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L1/0059
- WIPO fieldBasic communication processes
- WIPO sectorElectrical engineering
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.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.