Error-correcting code memory
US-2018189133-A1 · Jul 5, 2018 · US
US8977934B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-8977934-B2 |
| Application number | US-201313758483-A |
| Country | US |
| Kind code | B2 |
| Filing date | Feb 4, 2013 |
| Priority date | Feb 4, 2013 |
| Publication date | Mar 10, 2015 |
| Grant date | Mar 10, 2015 |
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 system providing early termination for channel decoding by re-encoding including a decoding unit, an encoding unit connected to the decoding unit, and a checking unit connected to the decoding unit and to the encoding unit. Via the system, decoded message words produced from the decoding unit are sent back to the encoding unit for re-encoding. Re-encoded words are compared to the decoded codewords by the checking unit and, if they are completely the same, the decoding action of the decoding unit is terminated. The system reduces power consumption and offers a simplified structure, improved decoding throughput, and reduced hardware complexity.
Opening claim text (preview).
What is claimed is: 1. A system providing early termination for channel decoding by re-encoding at least comprising: a decoding unit including: a register; a plurality of variable node units receiving incoming codewords and decoding the incoming codewords; a plurality of check nodes units connected to the variable node units and exchanging messages therebetween; and a hard decision connected to the variable node units so as to receive the decoded codewords and to the register so as to forward the decoded codewords and also receiving the incoming codewords, an encoding unit connected to the hard decision, and a checking unit connected to the hard decision, to the variable node units, to the register, and to the encoding unit, wherein decoded message words produced from the variable node units are sent to the register via the hard decision and to the encoding unit via the hard decision for re-encoding; wherein re-encoded words are compared to decoded codewords by the checking unit; and if they are completely the same, then decoding action of the decoding unit is terminated. 2. The system of claim 1 , wherein the checking unit is a logical circuit. 3. The system of claim 1 , further comprising a channel unit that is wireless, wired or other medium for transmission or storage of the incoming codewords. 4. The system of claim 1 , wherein if an error correcting code is a systematic code, then it only necessary to check by the checking unit to see if parity bits after re-encoding are the same with parity bits after decoding; and if yes, then stop decoding. 5. The system of claim 1 , wherein if the comparison result of the re-encoded words and the decoded codewords is not entirely consistent, then a number of inconsistent bits is used to estimate channel signal-to-noise ratio, and the system uses this information for a corresponding action.
Adding special bits or symbols to the coded information, e.g. parity check, casting out 9's or 11's · CPC title
Judging correct decoding and iterative stopping criteria other than syndrome check and upper limit for decoding iterations · CPC title
using iteration stopping criteria · CPC title
using a re-encoding step during the decoding process · CPC title
Judging correct decoding, e.g. iteration stopping criteria · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.