Open AccessAnalysis of an algorithm used for finding Unipolar Orthogonal Codes
Author(s) -
J N Vinutha,
Hitesh Trivedi,
Suraiya Tarannum,
M. N. Harshavardhana
Publication year - 2021
Publication title -
iop conference series. materials science and engineering
Language(s) - English
Resource type - Journals
eISSN - 1757-899X
pISSN - 1757-8981
DOI - 10.1088/1757-899x/1187/1/012021
Subject(s) - algorithm , computer science , linear code , code (set theory) , binary number , interference (communication) , correlation , channel (broadcasting) , mathematics , block code , telecommunications , set (abstract data type) , arithmetic , decoding methods , geometry , programming language
An Auto-Correlation and Cross-Correlation property of an Orthogonal Code enables the transfer of data with less interference. With more Orthogonal Codes, an Optical Fiber Communication channel can support a large number of users efficiently and reliably with high bandwidth. This paper analyses an algorithm used for finding Unipolar Orthogonal Codes using four major parameters (n, w, λa, and λc) where n is the length of a binary string, w is the weight of the string n (number of one’s in the string), λa is the Auto-Correlation, and λc is the Cross-Correlation. These four parameters jointly with the Johnson Bound (J A ) condition are used in the algorithm. The paper illustrates the analysis of a possible number of Orthogonal Code Sets calculated using Orthogonal Codes generated from a software code that is based on the algorithm in consideration. The data analysis is carried out and the findings are summarized.