Turbo Codes and Turbo-Coded Modulation Turbo Codes and Turbo-Coded - - PowerPoint PPT Presentation

turbo codes and turbo coded modulation turbo codes and
SMART_READER_LITE
LIVE PREVIEW

Turbo Codes and Turbo-Coded Modulation Turbo Codes and Turbo-Coded - - PowerPoint PPT Presentation

Turbo Codes and Turbo-Coded Modulation Turbo Codes and Turbo-Coded Modulation in CDMA Mobile Radio Systems for in CDMA Mobile Radio Systems for Short Frame Transmission Short Frame Transmission Volker Khn, University of Bremen, Germany


slide-1
SLIDE 1

Volker Kühn: Turbo Codes and Turbo-Coded Modulation in CDMA Mobile Radio ...

1

University

  • f Bremen

Turbo Codes and Turbo-Coded Modulation in CDMA Mobile Radio Systems for Short Frame Transmission Turbo Codes and Turbo-Coded Modulation in CDMA Mobile Radio Systems for Short Frame Transmission

Introduction Short description of turbo codes Turbo-coded modulation CDMA simulation model and simulation results Conclusions

Volker Kühn, University of Bremen, Germany

slide-2
SLIDE 2

Volker Kühn: Turbo Codes and Turbo-Coded Modulation in CDMA Mobile Radio ...

2

University

  • f Bremen

Introduction Introduction

Turbo codes reach near Shannon limit performance Amazing results obtained with extremely large interleavers causing tremendous transmission delays Question 1: Are turbo codes with small interleavers still superior to convolutional codes at a comparable decoding effort? Wideband CDMA as multiplex technique for third generation mobile radio systems (Europe: UMTS) Question 2: Trade-off between Direct-Sequence spreading, channel coding and modulation Embedding turbo codes and turbo-coded modulation in a DS-CDMA system

slide-3
SLIDE 3

Volker Kühn: Turbo Codes and Turbo-Coded Modulation in CDMA Mobile Radio ...

3

University

  • f Bremen

Turbo Codes:

Structure of Encoder and Decoder

Turbo Codes:

Structure of Encoder and Decoder

Encoder

Parallel concatenation of constituent

codes

Encoders connected through an

interleaver

Conventional block interleaver with

N = 400 bits

Optimization possible, but only small

gains expected due to short interleaver

Decoder

D1 and D2 arranged serially Inner decoder D1 and outer decoder D2 Decoding by Max-Log-MAP algorithm Best compromise between robustness,

performance and decoding effort

slide-4
SLIDE 4

Volker Kühn: Turbo Codes and Turbo-Coded Modulation in CDMA Mobile Radio ...

4

University

  • f Bremen

Turbo Codes:

Constituent Codes

Turbo Codes:

Constituent Codes

Recursive, systematic convolutional codes Parameter to be optimized: effective distance Maximize weight of redundancy bits c1 and c2 for input weight w = 2 Recursive generator polynomial has to be prime Other polynomials should maximize Hamming weight of redundancy bits for w = 2 sequences Purpose:

Comparison with convolutional codes

(constraint length Lc = 9)

Approximately same decoding effort

d z

eff =

+ ⋅ 2 2

min

Rc g P Rc = 1 2 238 358 1 1

         

Rc = 1 4 238 358 258 1 1 1 1 1 1

                   

Rc = 2 3 238 358 1 1

                   

Codes used in simulations

slide-5
SLIDE 5

Volker Kühn: Turbo Codes and Turbo-Coded Modulation in CDMA Mobile Radio ...

5

University

  • f Bremen

Turbo-Coded Modulation:

Transmitter

Turbo-Coded Modulation:

Transmitter

Demultiplexer collects n unpunctured code words c(k) 2n redundancy bits are punctured to m-n bits m bits are mapped to one of 2m possible symbols (Gray coding) Different error probabilities for bits uj Assign bits processed by inner decoder to most reliable uj Example: 8-PSK modulation: m = 3 Code rate Rc = 2/3:

n = 2 info bits / symbol m-n = 1 parity bit / symbol

2 information bits assigned to most reliable bits u1 and u2

slide-6
SLIDE 6

Volker Kühn: Turbo Codes and Turbo-Coded Modulation in CDMA Mobile Radio ...

6

University

  • f Bremen

Turbo-Coded Modulation:

Receiver

Turbo-Coded Modulation:

Receiver

Coherent detection and soft output demodulation of received symbol x(l) Reliability information for each bit uj of a symbol by optimal MAP algorithm:

{ } { } { }

( )

[ ]

( )

( )

[ ]

( )

L u P u P u x s 2 x s 2

j j j i 2 N 2 s u i 2 N 2 s u

i j i j

= = = = − − − −

∈ = ∈ =

∑ ∑

ln 1 x 0 x ln exp exp

1

σ σ

S S

slide-7
SLIDE 7

Volker Kühn: Turbo Codes and Turbo-Coded Modulation in CDMA Mobile Radio ...

7

University

  • f Bremen

Soft-Output Demodulation:

Pragmatic approach

Soft-Output Demodulation:

Pragmatic approach

Soft-output values show large symmetry Pragmatic approach:

{ }

{ } { } ( ) { } { }

( )

L u 2a x j 2a x j a a x x j

j

≈ − ⋅ = − ⋅ = − ⋅ − =     

1 1 2 1

Im for 1 Re for 2 Im Re for 3

Re{x} Im{x} L{u1} Re{x} Im{x} L{u2} Im{x} Re{x} L{u3}

slide-8
SLIDE 8

Volker Kühn: Turbo Codes and Turbo-Coded Modulation in CDMA Mobile Radio ...

8

University

  • f Bremen

CDMA Simulation Model:

Downlink with pilot signal

CDMA Simulation Model:

Downlink with pilot signal

slide-9
SLIDE 9

Volker Kühn: Turbo Codes and Turbo-Coded Modulation in CDMA Mobile Radio ...

9

University

  • f Bremen

Simulation Results:

Comparison with convolutional codes

Simulation Results:

Comparison with convolutional codes

Approximately same bit error rates for convolutional codes with rates Rc = 1/2 and Rc = 1/4 Turbo code with Rc = 1/4 has same performance as CC’s Turbo code with Rc = 1/2 loses 0.5 dB Turbo-coded 8-PSK loses approximately 1 dB Turbo codes do not outperform CC’s in case of short interleavers and same decoding costs Only small differences between Rc = 1/2 and Rc = 1/4 9 3 6 10

  • 5

10

  • 4

10

  • 3

10

  • 2

10

  • 1

10 Eb / N0

TC, Rc = 1/4 TC, Rc = 2/3 CC, Rc = 1/4 CC, Rc = 1/2 TC, Rc = 1/2

BER

slide-10
SLIDE 10

Volker Kühn: Turbo Codes and Turbo-Coded Modulation in CDMA Mobile Radio ...

10

University

  • f Bremen

Simulation Results:

Influence of channel estimation

Simulation Results:

Influence of channel estimation

Conventional channel estimation via pilot signal

Only small differences between

Rc = 1/2 and Rc = 1/4

Loss of 4 dB in comparison to

perfectly known channel

Improved channel estimation by averaging 10 estimated channel coefficients

Gain of 3 dB over conventional

estimation

Gain of 1 dB for Rc = 1/4 over

Rc = 1/2

Accurate channel estimation necessary in order to exploit potential of powerful codes

9 3 6

10

  • 5

10

  • 4

10

  • 3

10

  • 2

10

  • 1

10 Eb / N0 BER

perfectly known averaged non-averaged Rc = 1/4 Rc = 1/2

slide-11
SLIDE 11

Volker Kühn: Turbo Codes and Turbo-Coded Modulation in CDMA Mobile Radio ...

11

University

  • f Bremen

Simulation Results:

10 additional users

Simulation Results:

10 additional users

Loss of 1 dB due to additional users for Rc = 1/2 and Rc = 1/4 Gap between Rc = 1/2 and Rc = 1/4 slightly decreases due to better interference suppression for longer DS-spreading Code with Rc = 1/4 still superior to Rc = 1/2 Performance of turbo-coded 8-PSK decreases dramatically Coded modulation scheme as used in this work is not suitable for CDMA systems

3 6 12 Eb / N0 10

  • 5

10

  • 4

10

  • 3

10

  • 2

10

  • 1

10

Rc = 1/4 Rc = 1/2 Rc = 2/3

9

BER

  • add. users

no add. users

slide-12
SLIDE 12

Volker Kühn: Turbo Codes and Turbo-Coded Modulation in CDMA Mobile Radio ...

12

University

  • f Bremen

Conclusions Conclusions

Turbo codes are no longer superior to convolutional codes for short interleavers and same decoding costs Accurate channel estimation necessary in order to exploit high coding gains Pilot signal aided estimation with averaging gains 3 dB over conventional estimation Low rate coding with low DS-spreading is better than high rate coding and high DS-spreading for coherent demodulation Turbo-coded modulation is not suitable for an implementation in DS- CDMA systems Performance improvement for turbo-coded modulation due to multiphase spreading sequences may be possible