CODES FOR OPTICAL CDMA

By
PRATEEK RAJ GAUTAM
M.TECH (E.C.)
725/09
 INTRODUCTION

• CDMA
• 1D OOC
• 2D OOC
WORKING OF CDMA TRANSMITTER
 transmitter
bk b(t) Code 1 c1(t) m(t)=c1(t)*b(t)

0 -1 1110000 1,1,1,-1,-1,-1,-1 -1,-1,-1,1,1,1,1

1 1 1110000 1,1,1,-1,-1,-1,-1 1,1,1,-1,-1,-1,-1

bk b(t) Code 2 c2(t) m(t)=c2(t)*b(t)

0 -1 1101000 1,1,-1,1,-1,-1,-1 -1,-1,1,-1,1,1,1

1 1 1101001 1,1,-1,1,-1,-1,-1 1,1,-1,1,-1,-1,-1

 WORKING OF CDMA RECIEVER

m(t)
 RECIEVER
m1(t) c1(t) z(t)= v V>0;1
c1(t)*m1(t) V<0;0
-1,-1,-1,1,1,1,1 1,1,1,-1,-1,-1,-1 -1,-1,-1,-1,-1,-1,-1 -7 0

1,1,1,-1,-1,-1,-1 1,1,1,-1,-1,-1,-1 1,1,1,1,1,1,1 7 1

m2(t) c1(t) z(t)=c1(t)*m2(t) v V>2;1

V<-2;0

-1,-1,1,-1,1,1,1 1,1,1,-1,-1,-1,-1 -1,-1,1,1,-1,-1,-1 -1 na

1,1,-1,1,-1,-1,-1 1,1,1,-1,-1,-1,-1 1,1,-1,-1,1,1,1 1 na

 1D Optical Orthogonal Codes
•  

•
 1D Optical Orthogonal Codes
•  

• whenever or
 JOHNSON BOUND for 1D OOC
•  
 NEED FOR 2D OOC
• Example.1:
  design with 1D
8 users, 5 active at a time, 1Gbps speed
• =8
•
• =1

• or
 2D Optical Orthogonal Codes
•  

• Optical Orthogonal Code

•
 2D Optical Orthogonal Codes
•  

•whenever or
 JOHNSON BOUND for 2D OOC
•  
•
DESIGN THE SAME WITH 2D CODES
•   ie.

• Then
(6 x 6,5,1) 2-D OOC
Optical correlator for 2-D OOC
 Advantages & Disadvantages
••  Chip size is highly reduced
• Increase in code family by a factor of
• Lack of efficient code generation
technique for 2D OOC
Simulation result
 References
[1] R. Omrani, P. Elia and P. V. Kumar, "Codes for Optical CDMA," SETA 2006, Lecture Notes in
Computer Science, 2006, Volume 4086, pp. 34-46.2006.
[2] R. Omrani, P. Elia and P. V. Kumar, "New constructions and bounds for 2-D optical orthogonal
codes," Proc. of SETA 2004, Springer-Verlag's Lecture Notes in Computer Science Series, vol. 3486,
pp. 389-395, 2005.
[3] O. Moreno, P. V. Kumar, H. Lu, and R. Omrani, "New construction for optical orthogonal codes,
distinct difference sets and synchronous optical orthogonal codes," in Proc. Int. Symposium on
Information Theory, p. 60, 2003.
[4] O. Moreno, Z. Zhang, P. V. Kumar, and V. A. Zinoviev, "New constructions of optimal cyclically
permutable constant weight codes," IEEE Trans. Information Theory, vol. 41, pp. 448-455, Mar.
1995.
[5] H. Chung and P. V. Kumar, "Optical orthogonal codes - new bounds and an optimal
construction," IEEE Trans. Information Theory, vol. 36, pp. 866-873, July 1990.
[6] O. Moreno, R. Omrani, and P. V. Kumar, "New bounds on the size of optical orthogonal codes,
and constructions," Preprint to be Submitete to The IEEE Transactions on Information Theory.
THANK YOU