X hits on this document

PDF document

DigitalCommons@University of Nebraska - Lincoln - page 63 / 69

180 views

0 shares

0 downloads

0 comments

63 / 69

54

Appendix A Iterative Detector Run Through

Overview of the detector looks like this:

10 1 =   , 11 , , 1−, 1(+1)

21 20 2 =   ,   , , 2(+1)

2(+2)

31 32 3 =   ,   , , 3(+2)

, 3(+3)

  • 

    = −1

, −2

, , 1 , 0

  • 

    +1 =

  • +1,

  • +1−1 , ,

  • +12,

  • +11)

Step 1:

Decode Bit 1 using the despreading code, this step is the same as you do in regular SESS or any

other spreading system. Take the dot product of the spreading code with the spreading sequence.

Then as in DSSS system, the sum of the received data times the spreading code. (Notice the soft

decision made on 1, indicated by the 1, a final decision isn‟t made till the last step)

Decode

1 = 1 0 , 1 1

, , 1−

, 1(+1)

e1, this is a +1 or -1

Step 2:

Using the soft decision made in Step1, update the spread sequence used in the 2nd

sent Bit, in this

case Bit 2. Then, Decode Bit 2 using the updated sequence:

Document info
Document views180
Page views180
Page last viewedThu Dec 08 12:49:06 UTC 2016
Pages69
Paragraphs1770
Words13793

Comments