http://rdf.ncbi.nlm.nih.gov/pubchem/patent/US-11368169-B2
Outgoing Links
Predicate | Object |
---|---|
assignee | http://rdf.ncbi.nlm.nih.gov/pubchem/patentassignee/MD5_68b3a80d931fe09c045a00d4c1ae0c3b |
classificationCPCInventive | http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/H03M13-6516 http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/H03M13-616 http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/H03M13-116 |
classificationIPCInventive | http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/H03M13-11 http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/H03M13-00 |
filingDate | 2017-05-24-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
grantDate | 2022-06-21-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
inventor | http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_3691d715739812583815b700f50cb7dd http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_149c765fc6618168fd3ea8a4b8e75aaa http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_3748a525f97ac672b960877b0902eed6 |
publicationDate | 2022-06-21-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
publicationNumber | US-11368169-B2 |
titleOfInvention | Processing method and device for quasi-cyclic low density parity check coding |
abstract | Provided are a processing method and device for quasi-cyclic low density parity check (LDPC) coding. The processing method for LDPC coding includes: determining, according to a data feature of an information bit sequence to be encoded, a processing strategy for the quasi-cyclic LDPC coding according to a data feature of an information bit sequence to be encoded; and performing, according to the processing strategy and based on a base matrix and a lifting size, the quasi-cyclic LDPC coding and rate matching output on the information bit sequence according to the processing strategy, a base matrix and a lifting value. This technical solution is able to improve adaptability and flexibility of the quasi-cyclic LDPC coding. |
priorityDate | 2017-03-24-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: 22.