On algorithms searching for quasi-optimal subfamilies of GMW sequences suitable for CDMA applications

This paper studies several algorithms for constructing quasi-optimal GMW subfamilies in terms of minimized bit error rate under co-channel interference. The results show that performance of resultant sub-families is very sensitive to the algorithms applied and sub-family sizes. A new criterion based on combinational (even plus odd) maximum cross-correlation is introduced for code selection and the resultant highest-peak-deleting and most-peak-deleting algorithms are effective to construct the GMW quasi-optimal sub-families.