Back to results
US 2016/0105199 A1Published application
Fast mapping method for layered min-sum decoding of ldpc codes,
AssigneeTidal Systems, Inc.
InventorsYingquan Wu, Xiaojie Zhang
Life of this patent
Estimating the term…
Abstract
A method is disclosed for performing LDPC decoding, specifically layered min-sum decoding using a Tanner graph including check nodes (CN) and variable nodes (VN). Messages passed between nodes are quantized in a non-uniform manner. Values below a threshold are uniformly quantized whereas values above the threshold are non-uniformly quantized. A corresponding inverse-quantization is also defined.
Claims20
A method comprising:
- receiving, by an electronic device, input data;
- and
- performing, by the electronic device, layered min-sum decoding of the input data to generate decoded output data, the layered min-sum decoding including passing messages between variable nodes (VNs) and check nodes (CNs), wherein the messages are quantized to obtain quantized messages such that messages with values below a first threshold value are quantized according to a uniform quantization and messages with values above or equal to the first threshold are quantized according to a first non-uniform quantization.
An electronic device including circuits configured to:
- receive input data;
- and
- perform layered min-sum decoding of the input data to generate decoded output data, the layered min-sum decoding including passing messages between variable nodes (VNs) and check nodes (CNs), wherein the messages are quantized to obtain quantized messages such that messages with values below a first threshold value are quantized according to a uniform quantization and messages with values above or equal to the first threshold are quantized according to a first non-uniform quantization.
A method comprising:
- receiving, by an electronic device, input data;
- and
- performing, by the electronic device, layered min-sum decoding of the input data to generate decoded output data, the layered min-sum decoding including passing messages between variable nodes (VNs) and check nodes (CNs), wherein each message of at least a portion of the messages are quantized according to I(x) to obtain quantized messages, where I(x) is defined as
- I
-
- (
- x
- )
- =
- {
- x
- ,
- if
-
-
- 0
- ≤
-
- x
-
- <
- 20
- sign
-
- (
- x
- )
- ·
- (
- 15
- +
-
- x
-
- /
- 4
- )
- ,
- if
-
-
- 20
- ≤
-
- x
-
- <
- 32
- sign
-
- (
- x
- )
- ·
- (
- 19
- +
-
- x
-
- /
- 8
- )
- ,
- if
-
-
- 32
- ≤
-
- x
-
- <
- 96
- sign
-
- (
- x
- )
- ·
- 31
- ,
- if
-
-
-
- x
-
- ≥
- 96
-
- .
89 more elements
Dependencies are inferred from the claim text.