# US 2018/0026661 A1 · Controller, semiconductor memory system and operating method thereof

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2018/0026661 A1
- Document ID: US20180026661A1
- Status: Published application
- Kind: A1
- Application number: 15/602,255
- Filed: 2017-05-23
- Published: 2018-01-25
- Earliest claimed: 2016-07-21
- Assignees: SK hynix Inc.; Korea Advanced Institute of Science and Technology
- Applicants: SK hynix Inc.; Korea Advanced Institute of Science and Technology
- Inventors: Jeong-Seok HA; Dae-Sung KIM; Su-Hwang JEONG
- Web page: https://patentgrep.com/patent/US20180026661A1

## CPC

- H03M 13/152: {Bose-Chaudhuri-Hocquenghem [BCH] codes}
- G06F 11/1072: {in multilevel memories}
- G11C 29/52: Protection of memory contents; Detection of errors in memory contents
- H03M 13/2906: {using block codes (H03M13/2957 takes precedence)}
- H03M 13/611: {Specific encoding aspects, e.g. encoding by means of decoding}
- H03M 13/616: {Matrix operations, especially for generator matrices or check matrices, e.g. column or row permutations}
- G11C 2029/0411: {Online error correction}
- 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)
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- G11C: STATIC STORES (semiconductor memory devices H10B)

## Abstract

An operating method of a controller includes generating a square message matrix of k×k; and generating an encoded message by encoding the square message matrix row by row through a Bose-Chadhuri-Hocquenghem (BCH) code, wherein the square message matrix includes an upper triangular matrix and a lower triangular matrix, which are symmetrical to each other with reference to zero-padding blocks included in a diagonal direction in the square message matrix, wherein the upper triangular matrix includes “β” numbers of message blocks, each of which has a size of “α+1”, and “(N−β)” numbers of message blocks, each of which has a size of “α”, and wherein “α”, “β” and N have relationships represented by equations 1 and 2: α = ⌊ M N ⌋ [ Equation   1 ] β = M   mod   N [ Equation   2 ] where “M” represents a size of a message input from a host and “N” represents a number of message blocks forming the upper triangular matrix.

## Claims

### Claim 1

An operating method of a controller, the operating method comprising:
generating a square message matrix of k×k; and
generating an encoded message by encoding the square message matrix row by row through a Bose-Chadhuri-Hocquenghem (BCH) code,
wherein the square message matrix includes an upper triangular matrix and a lower triangular matrix, which are symmetrical to each other with reference to zero-padding blocks included in a diagonal direction in the square message matrix,
wherein the upper triangular matrix includes “β” numbers of message blocks, each of which has a size of “α+1”, and “(N−β)” numbers of message blocks, each of which has a size of “α”, and
wherein “α”, “β” and N have relationships represented by equations 1 and 2.
α
=
⌊
M
N
⌋
[
Equation


1
]
β
=
M


mod


N
[
Equation


2
]
where “M” represents a size of a message input from a host and “N” represents a number of message blocks forming the upper triangular matrix.

### Claim 2 (depends on 1)

The operating method of claim 1,
wherein the generating of the encoded message includes selecting the “β” numbers of message blocks from message blocks included in an (i)th diagonal matrix group according to a sequential priority of the message blocks included in the (i)th diagonal matrix group,
wherein the (i)th diagonal matrix group includes a (i+1)th diagonal matrix and a (k+1−i)th diagonal matrix, and
wherein the “i” and “k” have a relationship represented by following equation 3.
1
≤
i
≤
⌊
k
2
⌋
[
Equation


3
]
where “i” and “k” are integers.

### Claim 3 (depends on 2)

The operating method of claim 2,
wherein the message blocks included in the (i)th diagonal matrix group have the sequence such that a message block included in the (i+1)th diagonal matrix has a sequentially higher priority than a message block included in the (k+1−i)th diagonal matrix, and such that a message block of higher row has a sequentially higher priority in a diagonal matrix, and
wherein the generating of the encoded message includes, when the “β” numbers of message blocks are selected from the (i)th diagonal matrix group, selecting (2*(n−1)*i+1)th to ((2n−1)*i)th message blocks prior to ((2n−1)*i+1)th to (2n*i)th message blocks among message blocks included in the (i)th diagonal matrix group, where “n” is an integer greater than one (1).

### Claim 4 (depends on 3)

The operating method of claim 3,
wherein the generating of the encoded message includes selecting “γ” numbers of message blocks among the “β” numbers of message blocks from a (k/2)th diagonal matrix group when the “k” is even and the “β” satisfies following equation 4, and
wherein the “γ”, “β” and “k” have a relationship represented by following equation 5.
β


mod


k
≤
k
2
[
Equation


4
]
γ
=
β


mod


k
[
Equation


5
]

### Claim 5 (depends on 1)

The operating method of claim 1,
wherein the generating of the encoded message includes generating a parity block for each row of the square message matrix, and
wherein each size of the zero-padding blocks is the same as the parity block.

### Claim 6

A controller comprising:
an error correction code encoding means suitable for generating a square message matrix of k×k, and generating an encoded message by encoding the square message matrix row by row through a Bose-Chadhuri-Hocquenghem (BCH) code,
wherein the square message matrix includes an upper triangular matrix and a lower triangular matrix, which are symmetrical to each other with reference to zero-padding blocks included in a diagonal direction in the square message matrix,
wherein the upper triangular matrix includes “β” numbers of message blocks, each of which has a size of “α+1”, and “(N−β)” numbers of message blocks, each of which has a size of “α”, and
wherein the “α”, “β” and “N” have relationships represented by following equations 1 and 2.
α
=
⌊
M
N
⌋
[
Equation


1
]
β
=
M


mod


N
[
Equation


2
]
where the “M” represents a size of a message input from a host and the “N” represents a number of message blocks forming the upper triangular matrix.

### Claim 7 (depends on 6)

The controller of claim 6,
wherein the error correction code encoding means selects the “β” numbers of message blocks from message blocks included in an (i)th diagonal matrix group according to a sequential priority of the message blocks included in the (i)th diagonal matrix group,
wherein the (i)th diagonal matrix group includes a (i+1)th diagonal matrix and a (k+1−i)th diagonal matrix, and
wherein the “i” and “k” have a relationship represented by following equation 3.
1
≤
i
≤
⌊
k
2
⌋
[
Equation


3
]
where “i” and “k” are integers.

### Claim 8 (depends on 7)

The controller of claim 7,
wherein the message blocks included in the (i)th diagonal matrix group have the sequence such that a message block included in the (i+1)th diagonal matrix has a sequentially higher priority than a message block included in the (k+1−i)th diagonal matrix, and such that a message block of higher row has a sequentially higher priority in a diagonal matrix, and
wherein the error correction code encoding means selects, when the “β” numbers of message blocks are selected from the (i)th diagonal matrix group, (2*(n−1)*i+1)th to ((2n−1)*i)th message blocks prior to ((2n−1)*i+1)th to (2n*i)th message blocks among message blocks included in the (1)th diagonal matrix group, where “n” is an integer greater than one (1).

### Claim 9 (depends on 8)

The controller of claim 8,
wherein the error correction code encoding means selects “γ” numbers of message blocks among the “β” numbers of message blocks from a (k/2)th diagonal matrix group when the “k” is even and the “β” satisfies following equation 4, and
wherein the “γ”, “β” and “k” have a relationship represented by following equation 5.
β


mod


k
≤
k
2
[
Equation


4
]
γ
=
β


mod


k
[
Equation


5
]

### Claim 10 (depends on 6)

The controller of claim 6,
wherein the error correction code encoding means further generates a parity block for each row of the square message matrix, and
wherein each size of the zero-padding blocks has the same as the parity block.

### Claim 11

An operating method of a controller, the operating method comprising:
reading from a memory device an encoded message including a square message matrix of k×k; and
generating a decoded message by decoding the square message matrix row by row through a Bose-Chadhuri-Hocquenghem (BCH) code,
wherein the square message matrix includes an upper triangular matrix and a lower triangular matrix, which are symmetrical to each other with reference to zero-padding blocks included in a diagonal direction in the square message matrix,
wherein the upper triangular matrix includes “β” numbers of message blocks, each of which has a size of “α+1”, and “(N−β)” numbers of message blocks, each of which has a size of “α”, and
wherein “α”, “β” and N have relationships represented by following equations 1 and 2.
α
=
⌊
M
N
⌋
[
Equation


1
]
β
=
M


mod


N
[
Equation


2
]
where “M” represents a size of the encoded message and “N” represents a number of message blocks forming the upper triangular matrix.

### Claim 12 (depends on 11)

The operating method of claim 11,
wherein the generating of the decoded message includes selecting the “β” numbers of message blocks from message blocks included in an (i)th diagonal matrix group according to a sequential priority of the message blocks included in the (i)th diagonal matrix group,
wherein the (i)th diagonal matrix group includes a (i+1)th diagonal matrix and a (k+1−i)th diagonal matrix, and
wherein the “i” and “k” have a relationship represented by following equation 3.
1
≤
i
≤
⌊
k
2
⌋
[
Equation


3
]
where “i” and “k” are integers.

### Claim 13 (depends on 12)

The operating method of claim 12,
wherein the message blocks included in the (i)th diagonal matrix group have the sequence such that a message block included in the (i+1)th diagonal matrix has a sequentially higher priority than a message block included in the (k+1−i)th diagonal matrix, and such that a message block of higher row has a sequentially higher priority in a diagonal matrix, and
wherein the generating of the encoded message includes, when the “β” numbers of message blocks are selected from the (i)th diagonal matrix group, selecting (2*(n−1)*i+1)th to ((2n−1)*i)th message blocks prior to ((2n−1)*i+1)th to (2n*i)th message blocks among message blocks included in the (i)th diagonal matrix group, where “n” is an integer greater than one (1).

### Claim 14 (depends on 13)

The operating method of claim 13,
wherein the generating of the decoded message includes selecting “γ” numbers of message blocks among the “β” numbers of message blocks from a (k/2)th diagonal matrix group when the “k” is even and the “β” satisfies following equation 4, and
wherein the “γ”, “β” and “k” have a relationship represented by following equation 5.
β


mod


k
≤
k
2
[
Equation


4
]
γ
=
β


mod


k
[
Equation


5
]

### Claim 15 (depends on 11)

The operating method of claim 11, wherein each size of the zero-padding blocks is the same as a parity block for each row of the square message matrix.

### Claim 16

A controller comprising:
an error correction code decoding means suitable for reading from a memory device an encoded message including a square message matrix of k×k, and generating a decoded message by decoding the square message matrix row by row through a Bose-Chadhuri-Hocquenghem (BCH) code,
wherein the square message matrix includes an upper triangular matrix and a lower triangular matrix, which are symmetrical to each other with reference to zero-padding blocks included in a diagonal direction in the square message matrix,
wherein the upper triangular matrix includes “β” numbers of message blocks, each of which has a size of “α+1”, and “(N−β)” numbers of message blocks, each of which has a size of “α”, and
wherein the “α”, “β” and “N” have relationships represented by following equations 1 and 2.
α
=
⌊
M
N
⌋
[
Equation


1
]
β
=
M


mod


N
[
Equation


2
]
where the “M” represents a size of the encoded message and the “N” represents a number of message blocks forming the upper triangular matrix.

### Claim 17 (depends on 16)

The controller of claim 16,
wherein the error correction code decoding means selects the “β” numbers of message blocks from message blocks included in an (i)th diagonal matrix group according to a sequential priority of the message blocks included in the (i)th diagonal matrix group,
wherein the (i) diagonal matrix group includes a (i+1)th diagonal matrix and a (k+1−i)th diagonal matrix, and
wherein the “i” and “k” have a relationship represented by following equation 3.
1
≤
i
≤
⌊
k
2
⌋
[
Equation


3
]
where “i” and “k” are integers.

### Claim 18 (depends on 17)

The controller of claim 17,
wherein the message blocks included in the (i)th diagonal matrix group have the sequence such that a message block included in the (i+1)th diagonal matrix has a sequentially higher priority than a message block included in the (k+1−i)th diagonal matrix, and such that a message block of higher row has a sequentially higher priority in a diagonal matrix, and
wherein the error correction code decoding means selects, when the “β” numbers of message blocks are selected from the (i)th diagonal matrix group, (2*(n−1)*i+1)th to ((2n−1)*i)th message blocks prior to ((2n−1)*i+1)th to (2n*1)th message blocks among message blocks included in the (i)th diagonal matrix group, where “n” is an Integer greater than one (1).

### Claim 19 (depends on 18)

The controller of claim 18,
wherein the error correction code decoding means selects “γ” numbers of message blocks among the “β” numbers of message blocks from a (k/2)th diagonal matrix group when the “k” Is even and the “β” satisfies following equation 4, and
wherein the “γ”, “β” and “k” have a relationship represented by following equation 5.
β


mod


k
≤
k
2
[
Equation


4
]
γ
=
β


mod


k
[
Equation


5
]

### Claim 20 (depends on 16)

The controller of claim 16, wherein each size of the zero-padding blocks is the same as a parity block for each row of the square message matrix.
