Binary component codes construction of multilevel block modulation codes with a large minimum Euclidean distance

作     者：Tanabe, H Salam, MA Mitamura, M Umeda, H 

作者机构：Fukui Univ Fac Engn Fukui 9100017 Japan 

出 版 物：《IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES》 (电子信息通信学会汇刊：电子学、通信及计算机科学基础)

年 卷 期：1998年第E81A卷第7期

页      面：1521-1528页

核心收录：

学科分类：0808[工学-电气工程] 0809[工学-电子科学与技术（可授工学、理学学位）] 08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

主　　题：multilevel code Euclidean distance coset decomposition cyclic code 

摘      要：In multilevel block modulation codes for QPSK and 8-PSK modulation, a construction of binary component codes is given. These codes have a good minimum Euclidean distance by using different forms of the dependency properties of the binary component codes. Interdependency among component codes is formed by using the binary component subcodes which are derived by the coset decomposition of the binary component codes. The algebraic structures of the codes are investigated to find out how interdependency among component codes gives a good minimum Euclidean distance. First, it is shown that cyclic codes over Z(M) For M-PSK (M = 4, 8), where the coding scheme is given by Piret, can be constructed by forming specific interdependency among binary component codes for proposed multilevel coding method. Furthermore, it is shown that better minimum Euclidean distance than above can be obtained by modifying the composition of interdependency among binary component codes. These proposed multilevel codes have algebraic structure of additive group and cyclic property over GF(M). Finally, error performances are compared with those of some code s reference modulation scheme for transmitting the same number of information bits.