1. Field of the Invention
The present invention relates to a main purpose of this invention is to provide a method of early termination for channel decoding by re-encoding, which achieves saved power consumption, simplified structure, improved decoding throughput and less hardware complexity.
2. Description of Related Art
A conventional method of early termination needs an additional hardware for calculating syndromes for decoded words. If the syndromes are zero, then go the pre-due stop. Taking a low-density parity check code as example, the decoded codeword multiplies with a parity check matrix. If the product is zero which means the decoded codeword is legal, then go the pre-due stop. The decoded codeword (result) is then output.
However, in the case of the systematic (6, 62)—regular (9300, 8405) low-density parity check code, the matrix multiplication of the decoded word and the parity-check matrix needs 55800 2-input AND operations and 900 62-input Exclusive-OR operations and thus should be complex. Furthermore, the currently error correcting code chip usually has an encoder and a decoder which do not work together.
For this reason, the inventors has studied and proceeded in-depth discussion, and actively seek approaches for many years engaged in the research and experiences of related industries and manufacturing. After long-term research and efforts in development, the inventors has finally successfully developed this invention ‘method of early termination for channel decoding by re-encoding’ which overcomes the shortages in the prior art.
A main purpose of this invention is to provide a method of early termination for channel decoding, which achieves saved power consumption, simplified structure, improved decoding throughput and less hardware complexity.
In order to achieve the above and other objectives, the method of early termination for channel decoding by re-encoding according to the invention at least includes a decoding unit, an encoding unit connected to the decoding unit, and a checking unit connected to the decoding unit and the encoding unit; by means of the configuration of the above units, message words obtained from the decoding unit are sent back to the encoding unit for re-encoding; the re-encoded words are compared to the decoded codewords by the checking unit; and if they are completely the same, then terminate the decoding action of the decoding unit.
In one embodiment of the invention, the checking unit is a logical circuit.
In one embodiment of the invention, the channel unit can be wireless, wired or other medium for transmission or storage.
In one embodiment of the invention, if the error correcting code is a systematic code, then it only necessary to check by the checking unit to see if parity bits (parity word) obtained after re-encoding are the same with parity bits (parity word) obtained after decoding; and if yes, then stop decoding.
In one embodiment of the invention, if the comparison result is not entirely consistent, then the number of inconsistent bits can be used to estimate the channel signal-to-noise ratio, and the decoder (system) can use this information for the corresponding action.
In one embodiment of the invention, since incorrect codewords are seldom received in channel with high signal-to-noise ratio, there is no need to decode received codewords with no error. The channel value are sent to hard decision which is existing hardware in the decoder and decoding unit. The hard decision of the received codeword can be directly fed to the encoding unit for determination of early termination. If the comparison result for codewords is consistent, there is no need to decode, increasing the decoding throughput at high signal-to-noise ratio.
The aforementioned illustrations and following detailed descriptions are exemplary for the purpose of further explaining the scope of the present invention. Other objectives and advantages related to the present invention will be illustrated in the subsequent descriptions and appended tables.
The checking unit 3 can be a logic circuit.
When this invention is applied to decoding of the low-density parity check code, messages are exchanged through a plurality of variable node units 11 and check node units 12, and then decoded codewords are sent to a hard decision 13 to obtain the message codewords. The message words are sent back to the encoding unit 2 for re-encoding, and compared with the decoded codewords in the checking unit 3. If they are completely the same, then terminate the decoding and sent stored decoded messages from register 14.
If the error correcting code is a systematic code, it is only necessary to compare the re-encoded parity bits (parity word) with the decoded parity bits (parity word) to check if they are completely the same because the re-encoded codewords include original message words. This implementation only needs 895 2-input Exclusive-OR operations. In the prior art, the early termination requires that the parity check matrix of systematic (6, 62)-regular (9300, 8405) low-density parity check codes multiplies by the decoded codeword. Such a binary parity-check matrix is of 900×9300 and has 55800 elements which respectively have the value of 1. Therefore, this matrix multiplication needs 5800 2-input AND operations and 900 62-input Exclusive-OR operations. However, the hardware consumption according to the invention can be easily done by simple logical control at an encoding terminal and a decoding terminal, with significantly reduced complexity. If the comparison result is not entirely consistent, then it can use the number of inconsistent bits between the re-encoded parity word and decoded parity word to estimate the channel signal-to-noise ratio. The decoder (system) can use this information for the corresponding action. From
To increase decoding throughput at high signal-to-noise ratio, the channel value are sent to hard decision unit 13 and decoding unit 1. In the case of high signal-to-noise ratio in which incorrect codewords are seldom received, there is no need to decode received codewords with no error. Therefore the hard decision of the received codewords can be directly fed to the encoding unit for determination of early termination. It is assumed that the results of comparison for the codewords are correct and there is no need to decode, multiple operations of inter steps of decoding can be saved, and instead the re-encoding of the message words can be executed directly by the encoding unit. Thereby higher decoding throughput can be obtained.
Referring to
In summary, the method of early termination for channel decoding by re-encoding according to the invention effectively improves the various shortages in the prior art, and can achieve saved power consumption, simplified structure, improved decoding throughput and less hardware complexity. This makes the invention more progressive and more practical in use which complies with the patent law.
The descriptions illustrated supra set forth simply the preferred embodiments of the present invention; however, the characteristics of the present invention are by no means restricted thereto. All changes, alternations, or modifications conveniently considered by those skilled in the art are deemed to be encompassed within the scope of the present invention delineated by the following claims.
Number | Name | Date | Kind |
---|---|---|---|
5265122 | Rasky et al. | Nov 1993 | A |
5949796 | Kumar | Sep 1999 | A |
6246698 | Kumar | Jun 2001 | B1 |
6567481 | Molnar | May 2003 | B1 |
6697441 | Bottomley et al. | Feb 2004 | B1 |
6785341 | Walton et al. | Aug 2004 | B2 |
6865708 | Wang | Mar 2005 | B2 |
6885711 | Shiu et al. | Apr 2005 | B2 |
6967598 | Mills | Nov 2005 | B2 |
7046694 | Kumar | May 2006 | B2 |
7260762 | Desai et al. | Aug 2007 | B2 |
7500167 | Widdup | Mar 2009 | B2 |
7602839 | Kolze et al. | Oct 2009 | B2 |
7607053 | Moelker | Oct 2009 | B2 |
7895495 | Boer et al. | Feb 2011 | B2 |
7904020 | Dankberg et al. | Mar 2011 | B2 |
7966545 | Cho et al. | Jun 2011 | B2 |
8335949 | Chugg et al. | Dec 2012 | B2 |
8392804 | Kim et al. | Mar 2013 | B2 |
8630335 | Mizrahi et al. | Jan 2014 | B2 |
8739004 | Olcay et al. | May 2014 | B2 |
20010050926 | Kumar | Dec 2001 | A1 |
20030023920 | Jeong et al. | Jan 2003 | A1 |
20080232440 | Yousef et al. | Sep 2008 | A1 |
20100332939 | Shimanuki | Dec 2010 | A1 |
Number | Date | Country | |
---|---|---|---|
20140223253 A1 | Aug 2014 | US |