http://rdf.ncbi.nlm.nih.gov/pubchem/patent/CN-107645296-B
Outgoing Links
| Predicate | Object |
|---|---|
| classificationCPCInventive | http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/H03M13-39 http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/H03M13-41 |
| classificationIPCInventive | http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/H03M13-41 http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/H03M13-39 |
| filingDate | 2017-08-11-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| grantDate | 2019-11-12-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| publicationDate | 2019-11-12-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| publicationNumber | CN-107645296-B |
| titleOfInvention | Convolutional code of closing behind maximum likelihood bidirectional priority grade first search algorithm |
| abstract | The present invention relates to data processing fields, it closes behind convolutional code maximum likelihood bidirectional priority grade first search algorithm it discloses one kind, the grade of the bidirectional priority backward first search algorithm for including the following steps: that (A) is guided by the path metric in backward path is applied to assist super code in backward fashion sup Grid T；(B) by forward path Exact path It measures the grade first search algorithm of bidirectional priority forward guided and is applied to convolutional code of closing behind All grids on.The beneficial effects of the present invention are: having the standard deviation that may be significantly smaller in terms of decoding complex degree, it is better than every other decoding algorithm significantly in terms of average decoding complex degree. |
| priorityDate | 2017-08-11-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| type | http://data.epo.org/linked-data/def/patent/Publication |
Incoming Links
| Predicate | Subject |
|---|---|
| isDiscussedBy | http://rdf.ncbi.nlm.nih.gov/pubchem/substance/SID419514609 http://rdf.ncbi.nlm.nih.gov/pubchem/compound/CID7753 |
Total number of triples: 14.