Cardinality for optical orthogonal codes with variable length and weight
Independent thesis Advanced level (degree of Magister), 20 points / 30 hpStudent thesis
To let many users beneﬁt from the high speed communication in an optical ﬁber, a way to share the channel is needed. One way to share the channel between the users is the multiple access technique of Code Division Multiple Access, CDMA. This technique is based on coding. By assigning the users diﬀerent codewords, the receiver is able to distinguish the information sent from each user. One family of codes suitable to use in a ﬁber optic network is the constant weight Optical Orthogonal Codes, OOC.
To inﬂuence the users interference tolerability it is possible to assign the users codewords of the same length but with diﬀerent weights. By letting the users have codewords of diﬀerent length it is possible to have diﬀerent data rates in the system. These two versions of optical orthogonal codes, with variable length and weight, are investigated in this thesis for their cardinality. The variable weight and variable length codes were created by combining optical orthogonal codes with diﬀerent parameters.
I have found that for variable length OOC:s of weight 2 it seems to be possible to increase the cardinality of a code, but for codes with higer weights than that, it is better that all users are assigned codewords of the same length. But since an upper bound for the cardinality of these types of codes has not been found, it is not possible to verify if this conclusion is correct. For variable weight OOC:s it is found that it is only possible to increase the cardinality of small, not optimal, codes. For codes including many codewords it is rarely possible to include more codewords without breaking the conditions on cross correlation between the codewords.
Place, publisher, year, edition, pages
Institutionen för systemteknik , 2006. , 40 p.
Optical Orthogonal Code, CDMA, Multilength OOC, Multiweight OOC
IdentifiersURN: urn:nbn:se:liu:diva-7672ISRN: LITH-ISY-EX--06/3846--SEOAI: oai:DiVA.org:liu-7672DiVA: diva2:22661
2006-10-13, Algoritmen, B, 13:00