Reduced-Complexity Iterative Decoding of Serially Concatenated CPM(Fundamental Theories for Communications)

スポンサーリンク

概要

• 論文の詳細を見る

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

• 社団法人電子情報通信学会の論文
• 2007-01-01

著者

• Huh Heon

  Samsung Electronics Co. Kor

• Krogmeier James

  School Of Electrical & Computer Engineering At Purdue University

• HUH Heon

  Telecommunication R & D Center, Samsung Electronics Co., Ltd.

関連論文

• Non-coherent Receivers for Orthogonal Space-Time CPM
• On Training-Symbol Design and Efficient Synchronization in OFDM Systems(Transmission Systems and Transmission Equipment for Communications)
• Reduced-Complexity Iterative Decoding of Serially Concatenated CPM(Fundamental Theories for Communications)

スポンサーリンク