scispace - formally typeset
Search or ask a question

Showing papers by "Raymond Knopp published in 1994"


Journal ArticleDOI
TL;DR: It is shown that this reduced-complexity, suboptimal decoding strategy performs nearly as well as maximum-likelihood decoding.
Abstract: This work considers coded M-ary phase-shift keying (MPSK) schemes with noncoherent detection. A class of block codes called module-phase codes is described. The algebraic framework used for describing these codes relies on elements from module theory which are discussed along with a method for constructing such codes for noncoherent detection. It is shown that differential encoding may be viewed as a specific code from a particular class of module-phase codes. Two classes of codes that achieve significant coding gain with respect to coherent detection of uncoded MPSK are presented. In the first class of module-phase codes, the coding gain is achieved at the expense of bandwidth expansion. In the second class, however, the coding gain is achieved at the expense of signal constellation expansion without expanding bandwidth. Finally, an integrated demodulation/decoding technique based on a modification of information set decoding is presented. It Is shown that this reduced-complexity, suboptimal decoding strategy performs nearly as well as maximum-likelihood decoding. >

55 citations


Proceedings ArticleDOI
18 Sep 1994
TL;DR: It is shown that significant performance improvements can be obtained over differentially-coherent detection with the use of little or no symbol interleaving and the performance of a reduced-complexity/sub-optimal decoding strategy with the aid of computer simulations is addressed.
Abstract: The work considers coded MPSK systems with non-coherent detection over correlated Rayleigh fading channels. The authors extend the results of Knopp and Lieb (1994), in which a block coded-modulation technique for non-coherent detection on AWGN channels was developed, by considering the performance of this technique in a fading environment. The performance of the maximum-likelihood decoder is studied for various fade rates using union bounding techniques and the exact expression for the pairwise error event probability. It is shown that significant performance improvements can be obtained over differentially-coherent detection with the use of little or no symbol interleaving. Finally, the author address the performance of a reduced-complexity/sub-optimal decoding strategy with the aid of computer simulations.

1 citations