| Summary: | 碩士 === 國立臺灣大學 === 資訊工程學研究所 === 98 === It is well known the minimal LDPC code distance is increases by the code-length. Generally speaking, it is good to use a long code length but there are problems in long code-length hardware design. In my design, I use the density evolution to decide the suitable node degree distribution pair in several code-lengths and make the parity check matrix with as long as possible girth when I generated it. Then, I designed a decoder with an external DDR2 SDRAM. It provides the ability to storage the big matrix and the large number of variable information received in channel. Throwing the re-write external memory, it provides the ability to configure and can decode various LDPC codes. At least, in order to have as less as possible coding gain loss, I use the sum-product to be the decoding algorithm and do smallest coding gain lose in hardware design.
|
|---|
