Binary Component Codes Construction of Multilevel Block Modulation Codes with a Large Minimum Euclidean Distance

Hidehiko TANABE  Mohammad Abdus SALAM  Masayasu MITAMURA  Hiroyuki UMEDA  

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E81-A   No.7   pp.1521-1528
Publication Date: 1998/07/25
Online ISSN: 
Print ISSN: 0916-8508
Type of Manuscript: PAPER
Category: Information Theory and Coding Theory
multilevel code,  Euclidean distance,  coset decomposition,  cyclic code,  

Full Text: PDF(717.3KB)>>
Buy this Article

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 ZM 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.