Decoding method, memory storage device and memory control circuit unit
US-2015358036-A1 · Dec 10, 2015 · US
US9667273B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-9667273-B2 |
| Application number | US-201514656477-A |
| Country | US |
| Kind code | B2 |
| Filing date | Mar 12, 2015 |
| Priority date | Mar 12, 2014 |
| Publication date | May 30, 2017 |
| Grant date | May 30, 2017 |
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.
Various embodiments of the present disclosure adjusts the size (nm) of a message input to a corresponding check node in case the unsatisfied check equation increases as the iteration count increases. Another embodiment of the present disclosure relates to a method for selecting a message and grasps the data distribution characteristics of the message vector values converted using the signal to noise ratio (SNR) and modulation and coding scheme (MCS) parameters of the receiver to select the message value with a value smaller than the threshold value in each message vector.
Opening claim text (preview).
What is claimed is: 1. A method for correcting an error in a mobile communication system using a non-binary low density parity check (LDPC) code, the method comprising: receiving a signal transmitted from a transmitter; and performing iterative decoding on the received signal, wherein performing the iterative decoding includes: counting a number of increases in unsatisfied check nodes as a function of an increase in an iterative decoding count; and increasing a size of messages input to the unsatisfied check nodes if the number of the increases of the unsatisfied check nodes is equal to a predetermined number, and wherein the size of the messages input to the unsatisfied check nodes is increased based on a maximum count of the iterative decoding and a number of the unsatisfied check nodes. 2. The method of claim 1 , wherein a time of adjusting the size of the messages input is determined if the predetermined number is two or three. 3. The method of claim 1 , wherein a time of adjusting the size of the messages input is determined if the number of the increases of the unsatisfied check nodes is one and the maximum decoding iteration count is less than 30. 4. The method of claim 1 , wherein a time of adjusting the size of the messages input is determined considering a remaining iteration count value at a time of applying an adjustment of a number of messages. 5. The method of claim 1 , wherein a time of adjusting the size of the messages input is determined as a function of at least one of the maximum decoding iteration count and a code rate. 6. The method of claim 1 , wherein the messages input are selected based on an offset value and a minimum threshold value, wherein the offset value, and the minimum threshold value are selected based on channel state information on the received signal, and a message vector value and a symbol are selected based on the offset value and the minimum threshold value. 7. The method of claim 1 , wherein the performing the iterative decoding further includes: adjusting a scaling of a message output as a function of the size of the message input to the unsatisfied check node. 8. The method of claim 1 , wherein the size of the messages input to the unsatisfied check nodes is adjusted to be increased proportionally to the number of the unsatisfied check nodes. 9. The method of claim 1 , wherein the size of the messages input to the unsatisfied check nodes is adjusted to be increased inversely proportionally to the maximum count of the iterative decoding. 10. An apparatus for correcting an error in a mobile communication system using a non-binary low density parity check (LDPC) code, the apparatus comprising: a counter configured to count a number of increases of unsatisfied checks nodes as a function of an increase in an iterative decoding count; and a controller configured to increase a size of messages input to the unsatisfied check nodes if the number of the increases of the unsatisfied check nodes is equal to a predetermined number, wherein the size of the messages input to the unsatisfied check nodes is increased based on a maximum of the iterative decoding count and a number of the unsatisfied check nodes. 11. The apparatus of claim 10 , wherein a time of adjusting the size of the messages is determined if the predetermined number is two or three. 12. The apparatus of claim 10 , wherein a time of adjusting the size of the messages is determined if the number of the increases of the unsatisfied check nodes is one and the maximum decoding iteration count is less than 30. 13. The apparatus of claim 10 , wherein a time of adjusting the size of the messages is determined considering a remaining iteration count value at a time of applying an adjustment of a number of messages. 14. The apparatus of claim 10 , wherein a time of adjusting the size of the messages is determined as a function of at least one of the maximum decoding iteration count and a code rate. 15. The apparatus of claim 10 , wherein the messages input are selected based on an offset value and a minimum threshold value, wherein the offset value and the minimum threshold value are selected based on channel state information on a received signal, and a message vector value and a symbol are selected based on the offset value and the minimum threshold value. 16. The apparatus of claim 10 , wherein the controller is configured to adjust a scaling of a message output as a function of the size of the message input to the unsatisfied check node. 17. The apparatus of claim 10 , wherein the size of the messages input to the unsatisfied check nodes is adjusted to be increased proportionally to the number of the unsatisfied check nodes. 18. The apparatus of claim 10 , wherein the size of the messages input to the unsatisfied check nodes is adjusted to be increased inversely proportionally to the maximum of the iterative decoding count.
Scaling by multiplication or division · CPC title
Parity-check or generator matrices with non-binary elements, e.g. for non-binary LDPC codes · CPC title
Adaptive decoding and hybrid decoding, e.g. decoding methods or techniques providing more than one decoding algorithm for one code · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.