LDPC Assisted Blind Frame Synchronization: Efficient Measurement Mechanism and Low-Complexity Algorithm

In this paper, low-density parity-check (LDPC) assisted blind frame synchronization (BFS) is studied to balance a tradeoff between the frame synchronization error rate performance and computational complexity. Specifically, we develop an efficient measurement mechanism related to the parity-check matrix to choose suitable LDPC codes for BFS. Furthermore, a low-complexity multi-stage search (MSS)-BFS algorithm is proposed, where the number of candidate positions gradually decreases as the growth of iteration number. Finally, simulation results show that the proposed measurement mechanism is reliable to choose LDPC codes for BFS, and the MSS-BFS algorithm can achieve comparable performance to conventional algorithm with eminently reduced iterations.