For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
Reduced-Complexity Iterative Decoding of Serially Concatenated CPM
Heon HUH James V. KROGMEIER
IEICE TRANSACTIONS on Communications
Publication Date: 2007/01/01
Online ISSN: 1745-1345
Print ISSN: 0916-8516
Type of Manuscript: LETTER
Category: Fundamental Theories for Communications
continuous phase modulation, Laurent decomposition, complexity reduction, symbol-by-symbol detection, iterative decoding,
Full Text: PDF(184KB)>>
This letter develops an efficient CPM demodulator which provides soft outputs for use in coded CPM. The proposed algorithm offers reduced-complexity soft output detection in which the number of matched filters and trellis states is appreciably reduced. The complexity reduction is achieved by approximating the CPM signal using the Laurent representation. A simulation study of iterative decoding of serially concatenated CPM with an outer code was performed. The performance degradation of the proposed algorithm relative to optimal full complexity generation of soft outputs was found to be small.