Abstract:
Construction of efficient block-encoded M-ary phase-shift-keying (M-PSK) schemes is investigated. An algebraic approach is adopted in which the basic modulation signals a...Show MoreMetadata
First Page of the Article

Abstract:
Construction of efficient block-encoded M-ary phase-shift-keying (M-PSK) schemes is investigated. An algebraic approach is adopted in which the basic modulation signals are associated with the elements of a finite group. Using some of the properties of group partition chains, the algebraic properties of the linear codes are studied. From this analysis, a class of codes called blocked coset codes is obtained. Distance properties of the block coset codes are obtained in terms of the distance properties of the underlying group partition chain. A particular choice of coset representations yields the standard block coset code construction, which is applicable to M-PSK for M of the form 2/sup k/*3/sup l/. The standard block coset code construction is seen to be equivalent to block code constructions previously reported in the literature, and it is modified to account for the fact that the 4-PSK constellation forms a Hamming space. The modification results in substantial improvements in some cases. A table of some examples of 2/sup k/*3/sup l/ PSK block coset codes is included.<>
Published in: IEEE Journal on Selected Areas in Communications ( Volume: 7, Issue: 6, August 1989)
DOI: 10.1109/49.29613
First Page of the Article
