Design and Analysis of 2D Extended Reed–Solomon Code for OCDMA

  • Manisha BhartiEmail author
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 1164)


In this paper, an attempt has been done to design and analyze two-dimensional codes lying on modified extended Reed–Solomon technique. These optical codes possess partition property for optical code division multiple access (OCDMA) applications which require code obscurity, as well as this property, provides a trade-off between code cardinality and code performance. This paper includes a comparative analysis of these codes and multilevel prime codes. Results show that performance of these optical codes is superior to MPC in Multiple Access Interference affected environment. This optical code outperforms MPC due to larger code weight and larger number of available wavelength. This 2-D optical code allows choosing between code cardinality and code performance. E-RS based optical codes are robust to multiple access interference affected operating systems hence are suitable for applications where simultaneous multiple active user access is required.


Optical code division multiple access Reed–solomon codes 


  1. 1.
    J.A. Salehi, Code division multiple-access techniques in optical fiber networks—part I: fundamental principles. IEEE Trans. Commun. 37(8), 824–833 (1989)CrossRefGoogle Scholar
  2. 2.
    G.-C. Yang, W.C. Kwong, Prime Codes With Applications to CDMA Optical and Wireless Networks (Artech House, 2002)Google Scholar
  3. 3.
    P.R. Prucnal (ed.), Optical Code Division Multiple Access: Fundamental and Applications (Taylor & Francis, 2006)Google Scholar
  4. 4.
    W.C. Kwong, G.-C. Yang, Optical Coding Theory with Prime (CRC Press, 2013)Google Scholar
  5. 5.
    F.R.K. Chung, J.A. Salehi, V.K. Wei, Optical orthogonal code: design, analysis, and applications. IEEE Trans. Inf. Theory 35(3), 595–604 (2009)MathSciNetCrossRefGoogle Scholar
  6. 6.
    G.-C. Yang, T. Fuja, Optical orthogonal codes with unequal auto-and cross-correlation constraints. IEEE Trans. Inf. Theory 41(1), 96–106 (1995)CrossRefGoogle Scholar
  7. 7.
    L. Tancevsk, I. Andonovic, Hybrid wavelength hopping/time spreading schemes for use in massive optical networks with increased security. J. Lightw. Technol. 14(12), 2636–2647 (1996)Google Scholar
  8. 8.
    E.L. Titlebaum, L.H. Sibul, Time-frequency hop signals—part II: coding based upon quadratic congruences. IEEE Trans. Aerosp. Electron. Syst. 17(4), 494–500 (2015)CrossRefGoogle Scholar
  9. 9.
    S.V. Maric, E.L. Titlebaum, Frequency hop multiple access codes based upon the theory of cubic congruences. IEEE Trans. Aerosp. Electron. Syst. 26(6), 1035–1039 (1990)MathSciNetCrossRefGoogle Scholar
  10. 10.
    R.M.H. Yim, L.R. Chen, J. Bajcsy, Design and performance of 2-D codes for wavelength-time optical CDMA. IEEE Photon. Technol. Lett. 14(5), 714–716 (2002)CrossRefGoogle Scholar
  11. 11.
    W.C. Kwong, G.-C. Yang, V. Baby, C.-S. Bres, P.R. Prucnal, Multiple-wavelength optical orthogonal codes under prime-sequence permutations for optical CDMA. IEEE Trans. Commun. 53(1), 117–123 (2005)Google Scholar
  12. 12.
    C.-Y. Chang, G.-C. Yang, W.C. Kwong, Wavelength-time codes with maximum cross-correlation function of two for multicode-keying optical CDMA. J. Lightw. Technol. 24(3), 1093–1100 (2006)CrossRefGoogle Scholar
  13. 13.
    J.-H. Tien, G.-C. Yang, C.-Y. Chang, W.C. Kwong, Design and analysis of 2-D codes with the maximum cross-correlation value of two for optical CDMA. J. Lightw. Technol. 26(22), 3632–3639 (2008)CrossRefGoogle Scholar
  14. 14.
    C.-H. Hsieh, G.-C. Yang, C.-Y. Chang, W.C. Kwong, Multilevel prime codes for optical CDMA systems. J. Opt. Commun. Netw. 1(7), 600–607 (2009)CrossRefGoogle Scholar
  15. 15.
    C.-C. Sun, G.-C. Yang, C.-P. Tu, C.-Y. Chang, W.C. Kwong, Extended multilevel prime codes for optical CDMA. IEEE Trans. Commun. 58(5), 1344–1350 (2010)CrossRefGoogle Scholar
  16. 16.
    V.C. Rocha Jr., Maximum distance separable multilevel codes. IEEE Trans. Inf. Theory 30(3), 547–548 (2006)MathSciNetCrossRefGoogle Scholar
  17. 17.
    S. Lin, D.J. Costello, Error control coding: fundamentals and Applications, 2nd edn (Pearson Education, 2017)Google Scholar
  18. 18.
    L. Gyorfi, J.L. Massey, Constructions of binary constant-weight cyclic codes and cyclically permutable codes. IEEE Trans. Inf. Theory 38(3), 940–949 (2016)Google Scholar

Copyright information

© The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2021

Authors and Affiliations

  1. 1.Department of ECENational Institute of TechnologyDelhiIndia

Personalised recommendations