Novel Algorithm for Blind Estimation of Scramblers in DSSS Systems

Citations

WEB OF SCIENCE

7
Citations

SCOPUS

11

초록

In this paper, we propose a novel algorithm for blind estimation of a linear scrambler, which is a synchronous scrambler or a self-synchronous scrambler, in direct sequence spread spectrum systems and analyze its estimation performance. We first examine the statistics considering the linearity of the scrambled data and the repetition property of the spreading code. Based on this, we then propose an improved estimation algorithm for the feedback polynomial of the linear scrambler constituting a search process and a verification process of feedback polynomial candidates to determine the correct feedback polynomial of the scrambler. To validate the proposed algorithm, we show through computer simulations that the proposed algorithm outperforms the conventional algorithm in terms of estimation performance.

키워드

EstimationCodesSpread spectrum communicationLinearityProbabilityMathematical modelsComputational complexityCommunication forensicssynchronous scramblerself-synchronous scramblerlinear feedback shift registernon-cooperative contextAUTOMATIC MODULATION CLASSIFICATIONPARAMETER-ESTIMATIONSYNCHRONOUS SCRAMBLERSEQUENCE ESTIMATIONLINEAR SCRAMBLERRECONSTRUCTIONIDENTIFICATIONINTERLEAVERSSIGNALSCODES
제목
Novel Algorithm for Blind Estimation of Scramblers in DSSS Systems
저자
Kim, DongyeongYoon, Dongweon
DOI
10.1109/TIFS.2023.3265345
발행일
2023-04
유형
Article
저널명
IEEE Transactions on Information Forensics and Security
18
페이지
2292 ~ 2302