Skip to content
naulon
Not checkedNot checked for notices yet.

Intelligent Covert Satellite Communication for Military Robot Swarm

Chaofan Chen, Shuai Wang, Li Li and 3 more

IEEE Access · 2020

doi:10.1109/access.2019.2963320 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

Military robot swarm becomes more and more important for contemporary military application. In order to satisfy sophisticated application scenarios, novel communication architecture for military robot swarm has to be conceived. In this paper, we propose a multi-carrier intelligent covert satellite communication (MCICSC) architecture based on electromagnetic environment sensing technology, in where the ability of dynamically adapting the system configuration to the holistic requirements of covertness, performance, and complexity can be considerably improved. Additionally, in order to solve the carrier synchronization problem in very low signal noise ratio (SNR) for each data stream of MCICSC, polar code (PC) is incorporated into the proposed MCICSC system. With the aid of the proposed polar code-aided multi-stream parallel feedback (PAMSPF) carrier synchronization scheme, the MCICSC system is capable of realizing high-precise carrier synchronization even in very low SNR region. Moreover, in order to further decrease the complexity of our MCICSC system, we also propose a polar code-based diversity combining (PBDC) scheme, which is capable of efficiently combing all the data streams without the aid of channel state information (CSI) estimation. Numerical simulations demonstrate that for MCICSC system the performance of the PAMSPF carrier synchronization and PBDC combining schemes can get extremely close to that of an ideally synchronized system. Complexity analysis of the proposed algorithms is given as well.

Abstract licence: CC BY-NC-ND

References47

    40 more references, whose wording the paper’s licence keeps private.

    All 47 references

    Reads

    Read by people on this page

    None yet.

    Checked or read by AI through naulon

    None yet.

    A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

    Are you an author?

    Is this your paper?

    Claim it to add your note and be paid when agents cite it. Free.