http://rdf.ncbi.nlm.nih.gov/pubchem/patent/WO-2014023472-A1
Outgoing Links
| Predicate | Object |
|---|---|
| assignee | http://rdf.ncbi.nlm.nih.gov/pubchem/patentassignee/MD5_827e8e1075ca4e83754cb41455bae676 |
| classificationCPCInventive | http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/H04L1-0054 http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/H04L1-005 http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/H04L1-0046 |
| classificationIPCInventive | http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/H04L1-00 |
| filingDate | 2013-06-26-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| inventor | http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_6327f03ce5988648a107bbb6a0d2794d |
| publicationDate | 2014-02-13-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| publicationNumber | WO-2014023472-A1 |
| titleOfInvention | Improved blind transport format detection depending on the conditions of reception of the signal |
| abstract | A method for determining a length of a message block of k bits from a length candidate set, comprising steps of: - Selecting (401) a length candidate (N) among the set; - Decoding (402) a received frame to form a decoded sequence that includes a message of a length equal to the length candidate (N), by a Viterbi decoder; - Calculating (402) a Viterbi variable (S(N)) for this candidate (N), - Comparing (403) the Viterbi variable with a threshold (Δ), - Repeating the selecting (401), decoding (402) and calculating (402) steps if said Viterbi variable (S(N)) is greater than the threshold (Δ) and if there exists an unselected length candidate among the set; - If the Viterbi variable is greater than a best value (S best ), updating this best value to the Viterbi variable and updating a best length (N end ) to this candidate; - Wherein the threshold (Δ) is initially set to a value determined according to the conditions of reception of the receiver. |
| priorityDate | 2012-08-09-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| type | http://data.epo.org/linked-data/def/patent/Publication |
Incoming Links
Total number of triples: 23.