Almost-Optimum Signature Matrices in Binary-Input Synchronous Overloaded CDMA
The everlasting bandwidth limitations in wireless communication networks has directed the researchers' thrust toward analyzing the prospect of overloaded Code Division Multiple Access (CDMA). In this paper, the authors have proposed a Genetic Algorithm in search of optimum signature matrices for binary-input synchronous CDMA. The main measure of optimality considered in this paper, is the per-user channel capacity of the overall multiple access system. The resulting matrices differ from the renowned Welch Bound Equality (WBE) codes, regarding the fact that the attention is specifically aimed at binary, rather than Gaussian, input distributions.