Detection Efficiency of Signal with Unknown Non-Power Parameter Using Algorithms Based on the Compressive Sensing Theory


Cite item

Full Text

Open Access Open Access
Restricted Access Access granted
Restricted Access Subscription Access

Abstract

The problem of detecting quasi-deterministic signals against the background of noise during the digital processing has been considered. In this case, at the specified detection efficiency, the minimum criterion of required arithmetic operations was used as a synthesis criterion for such algorithms. To this end, such algorithms were synthesized based on concepts of the compressive sensing theory. The computer simulation was used to check the efficiency of developed algorithms making it possible to determine the manner in which the total probability of detection errors depends on the signal-to-noise ratio and the compression ratio (ratio of the number of elements in the sufficient statistic vectors before and after “compression”). The detection efficiency losses of proposed algorithms were determined in comparison with the classical optimal algorithm in accordance with the maximum likelihood method at different values of signal-to-noise ratio and compression ratio. At the same time, the paper indicates the gain in the number of used arithmetic operations of proposed algorithms as compared to the classical one. The presented results allow us to make a sound choice of detection algorithm depending on the available hardware resources and admissible degradation of the detection efficiency.

About the authors

D. Yu. Golovanov

Voronezh State University

Author for correspondence.
Email: golovanov@amm.vsu.ru
Russian Federation, Voronezh

V. I. Parfenov

Voronezh State University

Email: golovanov@amm.vsu.ru
Russian Federation, Voronezh


Copyright (c) 2018 Allerton Press, Inc.

This website uses cookies

You consent to our cookies if you continue to use our website.

About Cookies