Noncoherent iterative decoding of spectrally efficient coded modulations

نویسندگان

  • Gianluigi Ferrari
  • Giulio Colavolpe
  • Riccardo Raheli
چکیده

In this paper, we consider possible solutions for noncoherent decoding of concatenated codes with spectrally efficient modulations. Two main classes of schemes are considered. A first class is obtained by concatenating parallel coding schemes with differential encoding. A second class considers serially concatenated coding structures and possible schemes derived from turbo trellis coded modulation (T-TCM), which do not employ differential encoding. In the first case, at the receiver side we consider separate detection and decoding, while in the second case we consider joint detection and decoding. The major problem connected with such an iterative decoding procedure is that taking into account an augmented channel memo~ leads to an intolerable trellis size, and hence to an impractical decoding complexi~. Reduced-complexity techniques suited to iterative decoding become fundamental, and we consider a recently proposed state-reduction technique. This way, the performance of a coherent receiver is approached, by keeping the number of receiver states fixed.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Noncoherent iterative (turbo) decoding

Recently, noncoherent sequence detection schemes for coded linear and continuous phase modulations have been proposed, which deliver hard decisions by means of a Viterbi algorithm. The current trend in digital transmission systems toward iterative decoding algorithms motivates an extension of these schemes. In this paper, we propose two noncoherent soft-output decoding algorithms. The first sol...

متن کامل

Low-complexity iterative decoding for coded differential transmission

In this paper, a power-efficient low-complexity iterative receiver structure for noncoherent transmission over Rayleigh flat fading channels without channel state information (CSI) is presented. As the main contribution, several novel decision-feedback assisted differential demodulators are derived, which are well suited to implementation. Thereby, the general case of multiple transmit and mult...

متن کامل

Low-complexity LDPC coded BICM-ID with orthogonal modulations

A low-complexity low density parity check (LDPC) coded bit-interleaved coded modulation with iterative decoding (BICM-ID) scheme with orthogonal modulations is proposed. With a novel mapping strategy of coded bits to symbols, the proposed scheme is equivalent to a generalised LDPC code with Hadamard constraints and thus orthogonal demodulation can be merged into the iterative LDPC decoding proc...

متن کامل

Geometrical Interpretation of Iterative “Turbo” Decoding

Abstract: This paper provides a geometrical interpretation of the decoding of bit-interleaved coded modulation (BICM). Compared to our previous work reported in [9], it provides a complete interpretation of the iterative decoding algorithm and identifies some additive projections that are performed. A new convergence result is also provided. Related areas: Coding theory and practice, (Coded mod...

متن کامل

Low-complexity iterative demodulation for noncoherent coded transmission over Ricean-fading channels

| Power and bandwidth eÆcient noncoherent transmission over frequency non-selective Ricean fading channels is studied. We propose a remarkably low-complexity receiver structure which is very well suited to mobile communication scenarios with time-variant and nonstationary transmission channels. Applying bit-interleaved coded modulation with standard convolutional codes, substantial gains of sev...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Annales des Télécommunications

دوره 56  شماره 

صفحات  -

تاریخ انتشار 2001