A Novel Voting Model Based on Parity Check Equations for Blind Detection of M-Sequences

Abstract

A novel acquisition scheme of pseudo-noise (PN) codes is proposed for spreading satellite communication systems relying on the proposed multi-voter model of this paper. Based on the proposed model, the acquisition of PN codes can be attributed to a voting and selecting mechanism to pick out the erroneous chips. Although message passing algorithm (MPA) is a feasible algorithm for decoding PN codes, MPA does not get good detection performance due to the limited number of parity check equations in the acquisition scheme. To overcome the negative impact of the limited number of parity check equations, this paper proposes single-voter and multi-voter models, which combine chip and sequence estimation on the basis of the chip-flipping (CF). It is known that the bit-flipping (BF), weighted-bit-flipping (WBF) and other algorithms based on BF are credible for low density parity check (LDPC) codes. Because of the lack of research, these algorithms have not been extended to the detection of PN codes. As the same as BF, the inputs of the proposed CF algorithm are the hard-decision samples. For the proposed CF, there exists an optimal flipping-threshold which is similar to the random weight of the WBF. Owing to the low computation complexity of CF, the unlimited number of parity check equations can be enabled in the voting model. The experimental results show that the detection performance of the proposed method of $N > $ 15 is improved by 2 dB compared with MAP-based method and 4 dB compared with LEAP-based method at the detection probability 99%.

Keywords

• PN codes
• voting model
• detection algorithm
• MPA