Comparison of prime code, extended prime code and quadratic congruence code using a normalized throughput metric

In this paper the performance of prime code, extended prime code and quadratic congruence code for optical CDMA networks is analyzed with respect to a normalized throughput metric. The code analysis is carried out for a synchronous, random access, packet broadcast network including only multiple access interference. This metric is based on the network throughput normalized with respect to the size of the code, and has the qualities that are desired in a figure of merit for optical CDMA networks. Optical orthogonal codes are compared using the normalized throughput metric. The optimum codes that maximize the throughput are obtained for different traffic conditions. It is observed that extended prime code outperforms the original prime code in probability of bit error but when compared using this normalized throughput metric prime codes perform better than extended prime code and quadratic congruence code over a wide range of offered loads.