Iterative Decoding for Long Block Codes Constructed by Reed-Muller Codes

碩士 === 國立臺灣大學 === 電機工程學系 === 86 === In this thesis, we propose a long block code which is constructed by using coset leaders to connect Reed-Muller Codes. With our construction, the code rate can be increased without decreasi...

Full description

Bibliographic Details
Main Authors: HAN, KUO-CHANG, 韓國璋
Other Authors: MAO-CHAO LIN
Format: Others
Language:en_US
Published: 1998
Online Access:http://ndltd.ncl.edu.tw/handle/22117587902059879629
Description
Summary:碩士 === 國立臺灣大學 === 電機工程學系 === 86 === In this thesis, we propose a long block code which is constructed by using coset leaders to connect Reed-Muller Codes. With our construction, the code rate can be increased without decreasing minimum distance and destorying the benign trellis property, lower number of state, of the original Reed-Muller Code. The constructed codes are divided into three groups corresponding to the number of states-- 4, 8, and 16. When applied to construt turbo code, the prolong block codes are prevailing over Hamming codes and more appropriate than convolutional codes for code rate higher than 0.6. At last, we apply the binary turbo code to a BCMIM for 8PSK which can achieve a code rate of 2 information bits per symbol. For this new scheme where a 3-level partition is applied to the 8PSK set, the binary turbo code is applied to the first two levels and a Reed- Muller code to the third level.