Background and Introduction to PN Codes
By Dr. Ernest Simo


16.0 Let's test our knowledge of Correlation by participating in a Correlation Workshop.

Correlation Workshop

Let C2 (t) = 1 0 0 1 0 1 1, be the Sequence or Code generated by a 3-stage Linear Shift Register:
  • Comment on the code Length and its Balance property
  • Compute the various time-shifted versions C2 (t)
  • Compute and plot the Autocorrelation function of C2 (t)
  • Draw some conclusions about PN Codes and their autocorrelation properties

Let C1 (t) be: 0 1 1 1 0 0 1 and Let C2 (t) be: 1 1 0 1 0 0 1
  • Compute the various time-shifted versions C2 (t-t i ) of C2 (t)
  • Compute and plot the Cross-correlation function [C1 (t) · C2 (t- t i )]
  • Compare with cross-correlation C2 (t) · C1 (t- t i )

Generate your own maximum-length PN codes using a 4-stage Linear Shift Register and repeat above exercises





© 2001 DR. ERNEST SIMO - SPACE2000
BACK CONTENTS INDEX GLOSSARY NEXT BACK CONTENTS INDEX GLOSSARY NEXT





CDMA Forums
Seminars
Interactive
CDMA Stores
Site Map
Home