Method and apparatus for low density parity check channel coding in wireless communication system
US-2019349006-A1 · Nov 14, 2019 · US
US10879927B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-10879927-B2 |
| Application number | US-201815978678-A |
| Country | US |
| Kind code | B2 |
| Filing date | May 14, 2018 |
| Priority date | May 17, 2017 |
| Publication date | Dec 29, 2020 |
| Grant date | Dec 29, 2020 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
A decoding method, an encoding method, a decoder and an encoder are disclosed. In an embodiment the decoding method includes receiving, at a receiver of a receiving side, signals from a transmitting side, the signals including a code word and decoding, at a decoder of the receiving side, the code word using a low density parity check (LDPC) code in which each n adjacent rows, n>1, in an extension part of a base parity check matrix (PCM) are orthogonal except for punctured information columns.
Opening claim text (preview).
What is claimed is: 1. A decoding method comprising: receiving, by a receiving device, a code word from a transmitting device; and decoding, by the receiving device, the code word using a low density parity check (LDPC) code in which each n adjacent rows in an extension part of a base parity check matrix (PCM), associated with the LDPC code, are orthogonal except for punctured information columns, n being an integer greater than one, wherein each two adjacent rows core matrix of the base PCM are orthogonal except for the punctured information columns and dual diagonal parity check columns, and wherein each m rows in the punctured information columns in the extension part of the base PCM have fewer than two conflicts, m being an integer greater than one. 2. The method of claim 1 , wherein m=2. 3. The method of claim 1 , wherein shifts of each two conflict cells in the punctured information columns of a labeled PCM in the extension part are equal. 4. The method of claim 1 , wherein two last adjacent rows in a core matrix of the base PCM, except for punctured information columns, have shifts equal to zero. 5. The method of claim 1 , wherein n=4. 6. The method of claim 1 , wherein a core matrix of the base PCM is a 6×16 matrix with the following structure: ( 1 1 0 0 1 0 1 1 0 0 1 1 0 0 0 0 1 0 1 1 0 1 1 0 0 1 0 1 1 0 0 0 1 0 1 1 1 0 0 1 0 0 1 0 1 1 0 0 1 1 0 0 0 1 0 0 1 1 0 0 0 1 1 0 1 1 0 0 1 1 0 0 1 1 0 0 0 0 1 1 1 0 1 1 0 0 1 1 1 0
Matrix operations, especially for generator matrices or check matrices, e.g. column or row permutations · CPC title
Support of multiple code parameters, e.g. generalized Reed-Solomon decoder for a variety of generator polynomials or Galois fields · CPC title
Quasi-cyclic LDPC [QC-LDPC] codes, i.e. the parity-check matrix being composed of permutation or circulant sub-matrices · CPC title
Soft-decision decoding, e.g. by means of message passing or belief propagation algorithms · CPC title
Heuristic code construction methods, i.e. code construction or code search based on using trial-and-error · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.