Iterative decoding of serially concatenated CPM in fading channels with noisy channel state information

  • Authors:
  • Dhammika Bokolamulla;Teng Joon Lim;Tor Aulin

  • Affiliations:
  • ST-Ericsson, Bristol, United Kingdom;Department of ECE, University of Toronto, Toronto, Ontario, Canada;Department of Computer Science and Engineering, Chalmers University of Technology, Gothenburg, Sweden

  • Venue:
  • IEEE Transactions on Communications
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

We use the sum-product algorithm (SPA) to propose a reduced-complexity detector for serially concatenated continuous phase modulated (SCCPM) signals with noisy channel state information (CSI) at the receiver. Two channel effects - phase noise (PN) and flat fading - are tackled using the statistical model and associated factor graph (FG) of the problem. Although optimal performance is not assured due to the loopy nature of the FG, as well as simplifying assumptions made in the algorithm development, simulations show that very significant performance gains are possible, and the gap between systems with noiseless and noisy CSI can be reduced to about 1 dB using the proposed methods. The increase in complexity compared to the conventional decoder, which treats CSI estimates as if they were equal to their true values, is small.