z-logo
open-access-imgOpen Access
Upper bound of probability of receiving error of aperiodic pseudo-random sequence at jamming
Author(s) -
Iscandar Maratovich Azhmukhamedov,
E. Melnikov
Publication year - 2020
Publication title -
vestnik astrahanskogo gosudarstvennogo tehničeskogo universiteta. seriâ: upravlenie, vyčislitelʹnaâ tehnika i informatika
Language(s) - English
Resource type - Journals
eISSN - 2224-9761
pISSN - 2072-9502
DOI - 10.24143/2072-9502-2020-1-64-72
Subject(s) - aperiodic graph , synchronizing , jamming , synchronization (alternating current) , sequence (biology) , computer science , random sequence , upper and lower bounds , channel (broadcasting) , algorithm , broadband , mathematics , telecommunications , distribution (mathematics) , transmission (telecommunications) , combinatorics , physics , mathematical analysis , genetics , biology , thermodynamics
The article discusses the obtained estimate of the upper bounds for the probable receiving error of the synchronizing sequence during sensor phasing of aperiodic pseudo-random sequences (CRR) in broadband communication systems in the channels of low quality with strong disturbances of natural and organized structure. The obtained results allow to design synchronization systems of pseudo-random sequences for the worst case, which guarantees their reliable operation in low-quality channels, and, unlike the well-known methods, the estimation of synchronization of aperiodic pseudo-random sequence sensors doesn’t depend on the error distribution in the communication channel and the period of sequence. The appointed differences simplify the evaluation of synchronization in the operation of broadband communication systems in low-quality channels.

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