Symbolic computation for DS-CDMA code acquisition using first order logic

Code division multiple access (CDMA) is widely used because of its effectiveness to send multiple signal and confidentiality of career signal. We present a formulation of state-space problem of which solution is directed by redundant reasoning control method for semiheuristic and lightweight DS-CDMA code acquisition. The reasoning of the state-space problem provides us with the way to find a K bit synchronized sequence among K dephased sequences with less calculation cost, compared with serial search and matched filter. In this process, redundancy-restriction method, called weighting strategy, enhances the searching ability of FOL (first order logic) reasoning for the faster and lightweight code acquisition. The combination of weighting strategy and correlator enables us to achieve the peak-detection within K/3 times of calculating inner products and its measurement. Our system is evaluated by the reduced cost of proving state-space problem using weighting strategy and its robustness of using the proposal code acquisition framework. Experiment shows that the proposal method is robust if K/N sequences are grouped with N ranging from 3 to 5.