Estimation of the features of application of the M-sequences subset with the possibility of joint processing

Abstract

The object of consideration is asynchronous address systems using code division of subscribers. The subject of the analysis is noise immunity of quasi-orthogonal signal ensembles based on a subset of M-sequences, allowing joint processing of code sequences. The purpose of the analysis is to determine the noise immunity characteristics of system using M-sequences subset that have the stated properties of joint processing. The solution is based on the principles and mathematical models developed by authors: the principle of the fast conversions in Galois fields, algebraic model of representation and structure of fast delay acquisition devices for a subclass of the sequences as well as on the simulation of the corresponding devices. This article is devoted to the study of the correlation properties of signal ensembles possessing the property of joint fast processing, as well as to the finding of the noise immunity characteristics of the corresponding signal receiving and processing devices. It is shown that the considered subset of code sequences, allowing joint fast processing, can be used in various scenarios, including in the scenarios of "distinguish-measure"objects, simultaneously using different code features from the ensemble under consideration. In this case, the considered devices are resistant to changes in the signal structure within the established ensemble. The proposed variants of the search scheme perform reception and primary processing of code sequences in real time, which favorably distinguishes them from known schemes that perform fast transformations by other methods. The results of the work will be useful to specialists involved in the design of asynchronous-address systems using complex signals based on code sequences with a large base.