CS522 F2004 Homework#5:  CDMA and SECC

Goal: Assignment Date: 11/1/2004
Due Day:11/10/2004
Description:
  1. CDMA. Chapter 2.51. Page 181. Prove if S.T=0, then S.T=0 where T is the complement chip sequence of T.
  2. CDMA. Chapter 2.53. Page 181. A CDMA receiver gets the following chips: (-1 +1 -3 +1 -1 -3 +1 +1). Assume the chip sequences defined in Figure. 2-45 (b), which stations transmited, and which bits did each one send?
  3. SECC encoding.
    Page 244. Chapter 3 problem 10.
    An 8-bit byte with binary value 10101111 is to be encoded using an even-parity Hamming code. What is the binary value after encoding?
  4. SECC decoding.
    Page 244. Chapter 3 problem 11. I added one additional question to be answered in terms of the data bits to be delivered.
    A 12-bit Hamming code whose hexadecimal value is OxE4F arrives at a receiver.
    1. What was the original codeword sent by the sender in hexadecimal? Assume that not more than I bit is in error.
    2. What are the data bits that should be delivered to the upper layer of the receiver.