The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.

The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.

Date of Patent:
Jul. 14, 2015

Filed:

Mar. 19, 2012
Applicants:

Xiaotao Wang, Shanghai, CN;

Hua Qian, Shanghai, CN;

Jing Xu, Shanghai, CN;

Hao Huang, Shanghai, CN;

Yang Yang, Shanghai, CN;

Fang Wang, Shanghai, CN;

Inventors:

Xiaotao Wang, Shanghai, CN;

Hua Qian, Shanghai, CN;

Jing Xu, Shanghai, CN;

Hao Huang, Shanghai, CN;

Yang Yang, Shanghai, CN;

Fang Wang, Shanghai, CN;

Attorney:
Primary Examiner:
Int. Cl.
CPC ...
H03M 13/03 (2006.01); H03M 13/23 (2006.01); H03M 13/37 (2006.01); H03M 13/41 (2006.01); H03M 13/00 (2006.01); H03M 13/15 (2006.01);
U.S. Cl.
CPC ...
H03M 13/23 (2013.01); H03M 13/3738 (2013.01); H03M 13/413 (2013.01); H03M 13/6505 (2013.01); H03M 13/1505 (2013.01); H03M 13/6525 (2013.01);
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.


Find Patent Forward Citations

Loading…