DSSS 시스템에서 효율적인 스크램블러 제원 추정 기법

초록

This paper proposes an algorithm for estimating the generating polynomial of a scrambler with lower computational complexity. This algorithm shows similar or better estimation performance compared to conventional algorithms in direct sequence spread spectrum (DSSS) systems. Unlike conventional algorithms that shift-and-add the given signal twice, this algorithm divides the signal without shift-and-add between signals, generates subsequences to suppress error propagation, and applies the Berlekamp-Massey algorithm to the subsequences to obtain candidate generating polynomials. Subsequently, the algorithm validates the candidate generating polynomials to determine the correct one. To validate the proposed algorithm, it is compared mathematically with conventional scrambler estimation algorithms, demonstrating that it requires fewer calculations. Furthermore, through computer simulation, it is demonstrated that the proposed algorithm can efficiently estimate the generating polynomial of the scrambler with low computational complexity even at high bit error rates.

키워드