Extension of Exactly Orthogonal Code for Chaos CDMA

摘要

Exactly orthogonal codes are used for synchronous multiplexing in many mobile communication sys tems. Recently, a new exactly orthogonal code based on primitive roots of finite field (referred to as 'primitive root code' in the paper) is introduced but it has a limitation of code length being a prime number. This paper extends the primitive root code to circumvent the limitation of code length. It introduces a procedure to produce a new code from two primitive root codes and shows that the produced code also has exact orthogonality.