X hits on this document

PDF document

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

151 views

0 shares

0 downloads

0 comments

64 / 69

55

2 = 2 1 , 2 0 , , 2 ( + 1 )

, 2(+2)



  • 2 , (this is a +1 or -1)

Then update the Bit 2 „s sequence replacing 2 with the

Step 3:

Take the soft decision made in step 2 and multiply it with the first chip. By multiplying the first

chip by the bit that was sent (2), this gives the original value of 1. (See below). This is needed

to determine if the value 1 is positive or negative.

  • 

    2′ 1  =

2 2 1 , 2 0 , , 2 ( + 1 )

, 2(+2)

=

, 0 ,

, ( + 1 ) ( + 2 )

It should be noted that in Bit 2, 1 is the first chip. In proceeding Bits it will be different.

Step 4:

Repeat steps 2 and 3, but use the proceeding Bits (3,4,5…) till Bit N+1.



3 = 3 2 , 3 1 , , 3 ( + 2 )

, 3(+3)

  • 3 (this is +1 or -1)

  • 

    3′ 1  =

  • 3

3 2 , 3 1 , , 3 + 2

, 3(+3)

= 2 ,

, , (+2)

, (+3)

  • ..

Through Bit N+1

Document info
Document views151
Page views151
Page last viewedSun Dec 04 06:37:02 UTC 2016
Pages69
Paragraphs1770
Words13793

Comments