Abstract:

The parallel combinatory spread spectrum (PC/SS) communication system is designed to have higher date transmission capability than ordinary and soft spread spectrum (SS) communication systems. The PC/SS system must ensure all r selected pseudo-noise (PN) sequences decision correct when receiving, otherwise a string of errors will be received. Existing data sequence mapping algorithms do not have the ability of judgment and error correction. For this problem, the cyclic mapping algorithm is proposed, and the proposed algorithm can effectively reduce the error probability of sequence decision through adding strong cyclic constraint relation in selected r sequences. Theoretical analysis and simulation results show that the error rate performance of the cyclic mapping algorithm 2 orders of magnitude lower than the conventional mapping algorithm under the same conditions, and the reliability of the PC/SS system is improved dramatically.