Blind frame synchronization of Reed-Solomon codes based on errors number estimation

摘要

A blind frame synchronization method of Reed-Solomon codes is present. The synchronization positions are captured by pre-estimating the errors number in every sliding window. We propose the approach of estimating the synchronization position by capturing the sliding window that contains the lowest errors. The proposed algorithm considers both hard decision and soft decision situations. In the hard decision situation, we estimate the error symbols numbers by calculating the hard syndrome matrix for different orders over GF(2~m). And for the soft decision situation, we do it by adapting the binary parity check matrix according to the bit-reliability and applying belief propagation (BP) iterative algorithm. We also study the properties of the proposed method and compare it with previous ones. The computer simulation results show that the algorithm we present in this paper has excellent performance, especially in low signal-to-noise ratio cases.