Construction and Characterization of Optical Orthogonal Codes (n,w,1) for Fast Frequency Hopping-Optical Code Division Multiple Access
Article Sidebar
Main Article Content
Abstract
This paper investigates a new combinatorial construction approach based on cyclic difference packings for the construction of an optical orthogonal code that is suitable as a time spreading sequence for fast frequency hopping optical code division multiple access (OCDM) systems. The proposed construction provides a solution to the electrical decoding delay problem when compared to its optical counterpart, as well as other optimization issues. The criteria for optimizing the performance of such an OCDMA system are provided, namely: the flexibility and simplicity in constructing the optimal code for any length and weight, a reduction in the encoding/decoding complexity that complies with changes in the fast frequency hopping system, and the provision of system transfer transparency, a decoding rule that exploits the embedded asymmetric error correcting capability of the code. Our neighbor difference approach refers to the partition of different solutions into sub-classes, given in the correlation matrix form. It takes into account both direct and recursive combinatorial code construction methods, and the resulting characteristics are evaluated accordingly. A performance analysis based on the OCDMA channel is given, and a comparison with other difference family solutions is performed.
Article Details
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
This journal provides immediate open access to its content on the principle that making research freely available to the public supports a greater global exchange of knowledge.
- Creative Commons Copyright License
The journal allows readers to download and share all published articles as long as they properly cite such articles; however, they cannot change them or use them commercially. This is classified as CC BY-NC-ND for the creative commons license.
- Retention of Copyright and Publishing Rights
The journal allows the authors of the published articles to hold copyrights and publishing rights without restrictions.
References
R. J. McEliece and E. R. Rodemich, “The Constantin-Rao construction for binary asymmetric error-correcting codes,” Information and Control, vol. 44, no. 2, pp. 187–196, Feb. 1980.
J.-G. Zhang, “Performance improvement of fibre-optic code-division multiple-access systems by using error-correction codes,” IEE Proceedings - Communications, vol. 144, no. 5, pp. 316–321, Oct. 1997.
K. Kamakura and I. Sasase, “A new modulation scheme using asymmetric error-correcting codes embedded in optical orthogonal codes for optical CDMA,” Journal of Lightwave Technology, vol. 19, no. 12, pp. 1839–1850, Dec. 2001.
R. M. Wilson, “Cyclotomy and difference families in elementary abelian groups,” Journal of Number Theory, vol. 4, no. 1, pp. 17–47, Feb. 1972.
S. Johnson, “A new upper bound for error-correcting codes,” IEEE Transactions on Information Theory, vol. 8, no. 3, pp. 203–207, Apr. 1962.
R. Omrani and P. V. Kumar, “Codes for optical CDMA,” in Sequences and Their Applications – SETA 2006, Lecture Notes in Computer Science, vol. 4086, G. Gong, T. Helleseth, H.-Y. Song, and K. Yang, Eds. Berlin, Germany: Springer, 2006, pp. 34–46.
Y. Yang and X. Lin, Code and Cryptography. Beijing, China: Renmin Youdian Press (in Chinese), 1992.
G. Ge and J. Yin, “Constructions for optimal (v, 4, 1) optical orthogonal codes,” IEEE Transactions on Information Theory, vol. 47, no. 7, pp. 2998–3004, Nov. 2001.
R. Fuji-Hara, Y. Miao, and J. Yin, “Optimal (9v, 4, 1) optical orthogonal codes,” SIAM Journal on Discrete Mathematics, vol. 14, no. 2, pp. 256–266, Feb. 2001.
S. Martirosyan and A. J. H. Vinck, “A construction for optical orthogonal codes with correlation 1,” IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, vol. E85-A, no. 1, pp. 269–272, Jan. 2002.
R. C. S. Chauhan, “Design of unipolar (optical) orthogonal codes and their maximal clique sets,” Ph.D. dissertation, Faculty of Engineering and Technology, Uttar Pradesh Technical University, Lucknow, India, 2015.
H. Chung and P. V. Kumar, “Optical orthogonal codes-new bounds and an optimal construction,” IEEE Transactions on Information Theory, vol. 36, no. 4, pp. 866–873, Jul. 1990.
I. B. Djordjevic and B. Vasic, “Novel combinatorial constructions of optical orthogonal codes for incoherent optical cdma systems,” Journal of Lightwave Technology, vol. 21, no. 9, pp. 1869–1875, Sep. 2003.
E. F. Brickell and V. K. Wei, “Optical orthogonal codes and cyclic block designs,” Congressus Numerantium, vol. 58, pp. 175–192, 1987.
F. R. K. Chung, J. A. Salehi, and V. K. Wei, “Optical orthogonal codes: design, analysis and applications,” IEEE Transactions on Information Theory, vol. 35, no. 3, pp. 595–604, May 1989.
J. Yin, “Some combinatorial constructions for optical orthogonal codes,” Discrete Mathematics, vol. 185, pp. 201–219, Apr. 1998.
R. Fuji-Hara and Y. Miao, “Optical orthogonal codes: their bounds and new optimal constructions,” IEEE Transactions on Information Theory, vol. 46, no. 7, pp. 2396–2406, Nov. 2000.
M. Buratti, “Cyclic designs with block size 4 and related optimal optical orthogonal codes,” Designs, Codes and Cryptography, vol. 26, no. 1-3, pp. 111–125, Jun. 2002.
Y. Chang and Y. Miao, “Constructions for optimal optical orthogonal codes,” Discrete Mathematics, vol. 261, pp. 127–139, 2003.
M. J. Colbourn and R. A. Mathon, “On cyclic Steiner 2-designs,” Annals of Discrete Mathematics, vol. 7, pp. 215–253, 1980.
C. R. Rao, “Finite geometries and certain derived results in theory of numbers,” Proceedings of the Indian National Science Academy, vol. 11, pp. 136–149, 1945.
M. J. Colbourn and C. J. Colbourn, “On cyclic block designs,” Mathematical Reports of the Academy of Science, vol. 2, pp. 95–98, 1980.
M. J. Colbourn and C. J. Colbourn, “Recursive constructions for cyclic block designs,” Journal of Statistical Planning and Inference, vol. 10, no. 1, pp. 97–103, Jul. 1984.
M. Jimbo and S. Kuriki, “On a composition of cyclic 2-designs,” Discrete Mathematics, vol. 46, no. 3, pp. 249–255, Dec. 1983.
M. Jimbo, “Recursive constructions for cyclic BIB designs and their generalizations,” Discrete Mathematics, vol. 116, no. 1-3, pp. 79–95, Jun. 1993.
R. C. Bose and K. A. Bush, “Orthogonal arrays of strength two and three,” The Annals of Mathematical Statistics, vol. 23, no. 4, pp. 508–524, Dec. 1952.
R. C. S. Chandran, R. Asthana, and Y. N. Singh, “Uni-polar orthogonal codes: design, analysis and applications,” in International Conference on High Performance Computing, Goa, India, 2010.
T. Klove, “Error correcting codes for the asymmetric channel,” Report, Department of Informatics, University of Bergen, Norway, 1995.
W. Kim and C. Freiman, “Single error-correcting codes for asymmetric binary channels,” IRE Transactions on Information Theory, vol. 5, no. 2, pp. 62–66, Jun. 1959.
H. Fathallah, L. A. Rusch, and S. LaRochelle, “Optical frequency-hop multiple access communications system,” in 1998 IEEE International Conference on Communications (ICC '98), vol. 3. Atlanta, GA, USA, 1998, pp. 1269–1273.
F. J. MacWilliams and N. J. A. Sloane, Eds., The Theory of Error-Correcting Codes. Amsterdam, The Netherlands: North-Holland Pub., 1977.
H. Yin and D. J. Richardson, Optical Code Division Multiple Access Communication Networks: Theory and Applications. Berlin, Germany: Springer, 2009.