METHOD FOR DECODING USING REDUCED COMPLEXITY-AND-LATENCY DYNAMIC SCHEDULING SCHEME FOR LOW DENSITY PARITY CHECK CODES AND APPARATUS THEREOF
PURPOSE: A decoding method using a dynamic scheduling method and an apparatus thereof are provided to reduce complexity and waiting time by using a dynamic scheduling method with less complexity and latency for LDPC(Low Density Parity Check Codes). CONSTITUTION: A processing unit(50) compares the al...
Saved in:
Main Authors | , |
---|---|
Format | Patent |
Language | English Korean |
Published |
07.07.2011
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | PURPOSE: A decoding method using a dynamic scheduling method and an apparatus thereof are provided to reduce complexity and waiting time by using a dynamic scheduling method with less complexity and latency for LDPC(Low Density Parity Check Codes). CONSTITUTION: A processing unit(50) compares the alignment reference values of variable check messages and selects a variable check message with the biggest alignment reference value. A variable node update part updates the variable check message which is delivered from a first check node to a second variable node. A check node update part(20) updates the variable check message which is delivered from the second variable node to a second check node. A standard value output unit(40) produces the alignment reference value of the variable check message which is delivered from the second variable node to the second check node. An alignment reference value is the difference of the value before being updated and the value after being updated of a corresponding variable check message. |
---|---|
Bibliography: | Application Number: KR20090133678 |