# US 8,751,895 B2 · Semiconductor memory device and decoding method > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 8,751,895 B2 - Document ID: US8751895B2 - Status: Granted - Kind: B2 - Application number: 13/569,492 - Filed: 2012-08-08 - Published: 2013-05-02 - Granted: 2014-06-10 - Earliest claimed: 2011-11-01 - Assignees: Kabushiki Kaisha Toshiba - Applicants: Haruka Obata; Tatsuyuki Ishikawa; Hironori Uchikawa; Kenji Sakurada - Inventors: Haruka Obata; Tatsuyuki Ishikawa; Hironori Uchikawa; Kenji Sakurada - Web page: https://patentgrep.com/patent/US8751895B2 ## CPC - H03M 13/112: {with correction functions for the min-sum rule, e.g. using an offset or a scaling factor} - H03M 13/1128: {Judging correct decoding and iterative stopping criteria other than syndrome check and upper limit for decoding iterations} - H03M 13/6583: {Normalization other than scaling, e.g. by subtraction} - H03M: CODING; DECODING; CODE CONVERSION IN GENERAL (using fluidic means F15C4/00; optical analogue/digital converters G02F7/00; coding, decoding or code conversion, specially adapted for particular applications, see the relevant subclasses, e.g. G01D, G01R, G06F, G06T, G09G, G10L, G11B, G11C, H04B, H04L, H04M, H04N; ciphering or deciphering for cryptography or other purposes involving the need for secrecy G09C) ## Abstract A semiconductor memory device includes a semiconductor memory unit which stores LDPC encoded data, and a decoding unit which decodes the encoded data, wherein the decoding unit performs serial decoding using the posterior likelihood ratio as it is for a column element likelihood ratio when the absolute value of the posterior likelihood ratio is not smaller than a threshold and using the column element likelihood ratio as it is for the posterior likelihood ratio when the absolute value of the column element likelihood ratio is not smaller than the threshold, and if the decoding does not succeed even after a predetermined first cycle count of iterative processing is performed or if the number of syndrome errors becomes smaller than a predetermined first syndrome error count, the decoding unit shrinks the absolute values of at least some of posterior likelihood ratios and resets all prior likelihood ratios to “0.” ## Claims ### Claim 1 A semiconductor memory device comprising: a semiconductor memory unit configured to store encoded data encoded with an LDPC code; and a decoding unit configured to decode the encoded data using a Min-Sum algorithm or a Modified-Min-Sum algorithm, wherein the decoding unit performs serial decoding by repeatedly performing iterative processing which includes row processing and column processing and thereby updating a posterior likelihood ratio for each row of a parity check matrix, and uses the posterior likelihood ratio as it is for a column element likelihood ratio when an absolute value of the posterior likelihood ratio is equal to or larger than a threshold and uses the column element likelihood ratio as it is for the posterior likelihood ratio when an absolute value of the column element likelihood ratio is equal to or larger than the threshold, and if the decoding does not succeed even after a predetermined first cycle count of the iterative processing is performed or if a number of syndrome errors becomes smaller than a predetermined first syndrome error count, the decoding unit shrinks absolute values of at least some of posterior likelihood ratios and resets all prior likelihood ratios to “0.” ### Claim 2 (depends on 1) The semiconductor memory device according to claim 1, wherein the decoding unit calculates the column element likelihood ratio by subtracting a row element likelihood ratio from the posterior likelihood ratio when the absolute value of the posterior likelihood ratio is smaller than the threshold and calculates the posterior likelihood ratio by adding the row element likelihood ratio to the column element likelihood ratio when the absolute value of the column element likelihood ratio is smaller than the threshold. ### Claim 3 (depends on 2) The semiconductor memory device according to claim 2, wherein the decoding unit uses the Modified-Min-Sum algorithm. ### Claim 4 (depends on 3) The semiconductor memory device according to claim 3, wherein the decoding unit shrinks the absolute values of the at least some of the posterior likelihood ratios to 5% to 50% of the threshold. ### Claim 5 (depends on 3) The semiconductor memory device according to claim 3, wherein the decoding unit uses a first Min-Sum coefficient until a predetermined second cycle count of iterative processing is reached, and uses a second Min-Sum coefficient larger than the first Min-Sum coefficient when the second cycle count of iterative processing is exceeded. ### Claim 6 (depends on 5) The semiconductor memory device according to claim 5, wherein the first Min-Sum coefficient is 50% to 90% of the second Min-Sum coefficient. ### Claim 7 A decoding method for decoding encoded data encoded with an LDPC code, using a Min-Sum algorithm or a Modified-Min-Sum algorithm, the decoding method comprising: performing serial decoding by repeatedly performing iterative processing which includes row processing and column processing and thereby updating a posterior likelihood ratio for each row of a parity check matrix; using the posterior likelihood ratio as it is for a column element likelihood ratio when an absolute value of the posterior likelihood ratio is equal to or larger than a threshold and using the column element likelihood ratio as it is for the posterior likelihood ratio when an absolute value of the column element likelihood ratio is equal to or larger than the threshold; and shrinking absolute values of at least some of posterior likelihood ratios and resetting all prior likelihood ratios to “0” if the decoding does not succeed even after a predetermined first cycle count of the iterative processing is performed or if the number of syndrome errors becomes smaller than a predetermined first syndrome error count. ### Claim 8 (depends on 7) The decoding method according to claim 7, wherein when the absolute value of the posterior likelihood ratio is smaller than the threshold, the column element likelihood ratio is calculated by subtracting a row element likelihood ratio from the posterior likelihood ratio and when the absolute value of the column element likelihood ratio is smaller than the threshold, the posterior likelihood ratio is calculated by adding the row element likelihood ratio to the column element likelihood ratio. ### Claim 9 (depends on 8) The decoding method according to claim 8, wherein the Modified-Min-Sum algorithm is used. ### Claim 10 (depends on 9) The decoding method according to claim 9, wherein the absolute values of the at least some of the posterior likelihood ratios are shrunk to 5% to 50% of the threshold. ### Claim 11 (depends on 9) The decoding method according to claim 9, wherein a first Min-Sum coefficient is used until a predetermined second cycle count of iterative processing is reached, and a second Min-Sum coefficient larger than the first Min-Sum coefficient is used when the second cycle count of iterative processing is exceeded. ### Claim 12 (depends on 11) The decoding method according to claim 11, wherein the first Min-Sum coefficient is 50% to 90% of the second Min-Sum coefficient.