z-logo
open-access-imgOpen Access
Digital blind despreading method for intermediate frequency short‐code DSSS signal
Author(s) -
Qiu Zhaoyang,
Peng Hua,
Li Tianyun
Publication year - 2020
Publication title -
iet communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.355
H-Index - 62
eISSN - 1751-8636
pISSN - 1751-8628
DOI - 10.1049/iet-com.2019.0351
Subject(s) - direct sequence spread spectrum , computer science , spread spectrum , signal (programming language) , code (set theory) , speech recognition , algorithm , telecommunications , code division multiple access , programming language , set (abstract data type)
Direct sequence spread spectrum (DSSS) signals are widely used in various military and civilian communication systems owing to its useful properties, such as lower working signal‐to‐noise ratio, strong anti‐jamming capability, and robustness to multi‐path fading. In past few years, the estimation for spreading sequence in non‐cooperative context has attracted lots of attention. Several methods are developed to realise a recovery of the sequence. Eigenvalue decomposition (EVD) is a classical method to obtain an effective estimation by extracting the main eigenvectors. The only obstacle to apply EVD method into practical systems is high complexity of computation when spreading sequence is long. Alternative algorithms such as neural network and clustering method have lower complexity, but an evident loss in performance. In this work, the authors propose to generalise the EVD algorithm to intermediate frequency (IF) short‐code DSSS with an unknown carrier offset. The blind despreading process is designed to complete correlation demodulation. As a result, the computational afford is largely decreased due to the operation on IF real signal. To evaluate the performance, they derive the Crammer‐Rao bound for spreading code estimation and compare the performance of several methods. Simulation demonstrates the superiority of the proposed method in estimation accuracy and runtime.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here