This paper considers the problem of detecting the optimal spreading codes (OSC) in a given code set for a direct sequence-code division multiple access system that employs despreading sequences weighted by adjustable chip waveforms. Due to computational complexity required to detect the OSC in a code set, a simple and efficient strategy is introduced. Analysis and numerical results show that the proposed strategy can successfully distinguish the spreading codes being most suitable references for a given code set in which the candidate spreading codes have equal crosscorrelation properties. (C) 2004 The Franklin Institute. Published by Elsevier Ltd. All fights reserved.
This paper considers the problem of detecting the optimal spreading codes (OSC) in a given
code set for a direct sequence-code division multiple access system that employs despreading
sequences weighted byadjustable chip waveforms. Due to computational complexityrequired
to detect the OSC in a code set, a simple and efficient strategyis introduced. Analysis and
numerical results show that the proposed strategycan successfullydistinguish the spreading
codes being most suitable references for a given code set in which the candidate spreading
codes have equal crosscorrelation properties.