X hits on this document

PDF document

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

175 views

0 shares

0 downloads

0 comments

65 / 69

56

Step 5:

Take the sum of all the 1 values from Bits 2 through N+1 and add it to the dot product of Bit 1

with Bit 1‟s despreading code. This gives you the final decision for Bit 1, 1 .

  • 1 =

  • +1

  • 

    ′ 1  + (1, 1′  )

  • =2

Step 6:

Update the spread sequence using the final decision for Bit 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 7:

Receive bit N+2 and repeat by shifting all bits up a spot. The new received bit N+2 gets moved

to the Bit N+1 spot (bit 2 becomes bit 1, bit 3 become bit2, …, bit N+1 becomes bit N). And

then repeat steps 1-6.

Document info
Document views175
Page views175
Page last viewedThu Dec 08 00:36:39 UTC 2016
Pages69
Paragraphs1770
Words13793

Comments