RU2514133C2 - Method for faster search of broadband signals and device for realising said method - Google Patents

Abstract

FIELD: radio engineering, communication.

SUBSTANCE: invention relates to data processing methods and devices in broadband radio communication and radio navigation. The search method involves: parallel accumulation, from the output of dynamically tuned matched filters, of values of a partial periodic cross-correlation function of segments of a received signal with two reference generating lines from which a derived sequence was generated, and determining numbers of cycles of the mutual shift thereof corresponding to delay synchronism; extrapolating the structure of partial periodic cross-correlation functions in form of extrapolation functions of subchannels of two processing channels with two-factor control of extrapolation based on a majority principle; controlling establishment of delay synchronism without determining the current time delay of the received signal and based on the combination of numbers of cycles of synchronism with the generating lines. The dynamically tuned matched filters used in the search channels are acousto-electronic convolvers.

EFFECT: reducing time spent on searching broadband signals based on delay.

2 cl, 13 dwg

Description

The invention relates to methods and devices for processing data in broadband radio communications and radio navigation, where the step of receiving information signals with a spread spectrum (CPC), manipulated by some pseudorandom sequence (SRP), is necessarily preceded by a synchronization step.

There is a known method of searching for CPC by delay, using a priori information on the location and structure of the bandwidth segments to reduce the average search time (V. Zhuravlev. Search and synchronization in broadband systems [Text], V. I. Zhuravlev, M., “Radio and communication ", 1986). The current signal delay is determined by the threshold detection of the value of the cross-correlation function between some short reference sequence and a regularly located segment of a similar structure of the received signal.

The most important disadvantages of this method are, firstly, its applicability only for linear recurrent M-sequences and for which their segment structure has been studied, and secondly, the threshold assessment is carried out against the background of comparison with very large levels of side bursts of the cross-correlation function segment, which is noticeable reduces the likelihood of correct detection of current energy.

Also close to the claimed one is a CPC search method, the essential features of which are the weighted summation of the responses of several digital matched filters tuned to several different elements of the SRP with an a priori known structure, having minimal cross-correlation with respect to each other and unevenly distributed along the length of the received manipulating sequence . In this case, the summation weights are determined by the order of the segments, and the current delay is determined by the fact that the threshold value of the weighted sum of the responses of the matched filters is exceeded (Snytkin II. Delay synchronization during digital processing of extra-long recursive sequences [Text] / II Snytkin, V. I. Burym, A.T. Serobabin, Proceedings of higher educational institutions. Radioelectronics, No. 7, 1990). This method has several disadvantages:

a reduction in the average search time is ensured only under close to ideal interference conditions, when the probability of false detection or omission of the bandwidth segment is very small;

the use of a limited class of SRP, studied in detail from the point of view of the mutual correlation properties of the constituent segments;

significant hardware costs for constructing a block of digital matched filters for searching for long-bandwidth SRP.

A device for synchronizing noise-like signals (A.S. 1003372 USSR, MKI ³ H04L 7/02. Device for synchronizing noise-like signals [Text] / A.S. Vorobyov, A.V. Kuzichkin, V.M. Kurkin, B. I. Prosenkov, V.V. Artyushin, V.M. Tarasov (USSR)), solving the problem of signal search using 2 quadrature processing channels with analog-to-digital and digital-to-analog converters, cyclic storage devices and calculators of correlation functions, which allows us to consider this device is a close analogue to the claimed device both in composition, to and on tasks to be solved.

However, this device increases the signal search speed only by increasing the noise immunity of the stage of detecting the synchronism state, but an accelerated search algorithm is not implemented that optimizes the analysis of the signal uncertainty region by delay, or that takes into account the structural features and patterns of the manipulating SRPs used.

The closest (prototype) to the claimed method is a method for accelerated search for broadband signals according to the patent (Pat. 2297722 Russian Federation, IPC ⁸ H04L 7/08, G06F 17/15. Method for accelerated search for broadband signals and device for its implementation [Text] / Fedoseev V.E., Snytkin I.I., Varfolomeev D.V. - No. 2005114601/09; claimed May 13, 2005; published application November 20, 2006; published patent April 20, 2007).

Similar features of this method with the claimed method are:

the use of a priori information about the ratio of the value of the number of the clock cycle of the current delay of the received signal and the clock cycle of detection of the total values of the mutual correlation between the received and reference sequences;

a search for the delay of signals manipulated by derivatives of non-linear recurring sequences (PNP) is carried out in parallel along 2 channels, in one of which a sequentially repeating component of length l _{1 is} used as a reference, in the other l ₂ ;

as a result, from l ₁ and l _{2 the} PVKF values accumulated in each of the 2 channels, select the maximum value and fix the corresponding numbers of the mutual shift cycles i _max ∈ (0, 1, ..., l ₁ -1) and j _max ∈ (0, 1, ..., l ₂ -1) relative to the initial corresponding l ₀ ; and further on the obtained i _max and j _max determine the values of cyclic shifts from ₁ and ₂ producing components according to the following relations:

$$c_{\mathrm{one}}=\{\begin{array}{l}2\cdot (l_{\mathrm{one}}-i_{\max })e\mathrm{from}l\mathrm{and}{i}_{\max }>l_{\mathrm{one}}/2\hfill \\ (l_{\mathrm{one}}-2\cdot i_{\max })e\mathrm{from}l\mathrm{and}{i}_{\max }<l_{\mathrm{one}}/2\hfill \end{array},{\mathrm{<figure-callout\; id="2"\; label="c"\; filenames="00000071.png,00000073.png"\; state="\{\{state\}\}">c</figure-callout>}}_2=\{\begin{array}{l}2\cdot (l_2-i_{\max })e\mathrm{from}l\mathrm{and}{j}_{\max }>{\mathrm{<figure-callout\; id="2"\; label="l"\; filenames="00000071.png,00000073.png"\; state="\{\{state\}\}">l</figure-callout>}}_2/2\hfill \\ (l_2-2\cdot i_{\max })e\mathrm{from}l\mathrm{and}{j}_{\max }<{\mathrm{<figure-callout\; id="2"\; label="l"\; filenames="00000071.png,00000073.png"\; state="\{\{state\}\}">l</figure-callout>}}_2/2\hfill \end{array}(\mathrm{one})$$

then, through the parallel formation of 2 sequences of repeating generating components of lengths l ₁ and l ₂ generated with cyclic shifts c ₁ and _2, respectively, as well as symbol-by-symbol summation modulo 2 of these 2 sequences, a reference derivative sequence L = l ₁ · l ₂ , the resulting cyclic shift With which at the control stage eliminates the time mismatch of the received and reference derived signals (PNP), and its value C is due to the values from ₁ and ₂ in accordance with the expressions:

$$c_{\mathrm{one}}=l_{\mathrm{one}}-C(\mathrm{mod}{l}_{\mathrm{one}}),{\mathrm{<figure-callout\; id="2"\; label="c"\; filenames="00000071.png,00000073.png"\; state="\{\{state\}\}">c</figure-callout>}}_2=l_2-C(\mathrm{mod}{l}_2).(2)$$

the decision to capture the PNP signal by the delay is made upon exceeding the set threshold by the PVKF value of the received and received reference derivative of the PNP signal, otherwise the search continues.

The closest device (prototype) that implements the search for CPC, manipulated PNP, which, with appropriate changes, can implement the proposed method of accelerated search, is the circuit device (Pat. 2297722 Russian Federation, IPC ⁸ H04L 7/08, G06F 17/15. Accelerated method for searching broadband signals and a device for its implementation [Text] / Fedoseev V.E., Snytkin II, Varfolomeev DV - No. 2005114601/09; application form 13.05.2005; publ. application 20.11.2006; publ. Patent 04.20.2007).

Similar features of this device (prototype) with the claimed device are:

the device comprises: two channels of correlator-type processing, and correlation processing is implemented on the basis of acoustoelectronic convolvers (AEC), a received signal is applied to one input of each channel; reference sequence generator, the first output of this generator of each channel is connected to the corresponding input of the derivative signal generator, the output of which is connected to one of the inputs of the delay synchronism control circuit, the other input of which is the input of the received signal, and the input of the reference sequence generator of each channel is connected to the output of the corresponding calculator shifts with ₁ and c ₂ .

The well-known "prototype method" and a device for its implementation have several disadvantages:

1) the prototype as a whole does not take into account and does not use a priori information about the structure of PVKF PNP, which leads, firstly, to a “blind” energy storage of the side peaks of the PCF and thereby to a significant number of “runs” (an increase in the number p) and ultimately, to increase the search and detection time, including by slowly increasing the signal-to-noise (s / w) ratio at the output of the quick search device (UBP) for making a decision, and secondly, it does not take into account the above information to speed up the search detection and synchronization.

As the studies of the authors showed, PVKF PNP has a deterministic structure, i.e. PVKF is a deterministic function of time, and such that, with a certain approximation, it can be considered an almost discrete function of time. Moreover, the structure of PVKF unambiguously determines the composition of the producing components (simple nonlinear recurrence sequences - NLRP) of length l ₁ and l ₂ and their type (thin internal structure of NLRP). Those. between the species, the durations l ₁ and l _{2 of the} producing components (PK-1 and PK-2) and PVKF PNP there is a determined one-to-one correspondence. Therefore, knowing the composition of the PNP (i.e., the composition of PK-1 and PK-2), it is possible to unambiguously extrapolate (predict) the structure of PVKF and vice versa - according to the structure of PVKF, it is possible to unambiguously extrapolate the composition of PNP. The structure of PVKF PNP as a function of time is understood to mean the periodic time distribution of pronounced and determined by the magnitude (amplitude) and time of occurrence of the private side peaks (bursts) of PVKF, which we denote as R _np1 and R _np2 . Figure 5 and figure 7 presents examples of PVKF some PNP, demonstrating this statement. Therefore, a priori knowing the composition of the received PNP on the receiving side of the CDS, it is possible to unambiguously a priori extrapolate the structure of PVKF, i.e. You can use a priori information about the structure of PVKF to organize the acceleration and increase the reliability of the search, detection and synchronization of memory bandwidth in the CDS;

2) the first summation (accumulation) in the parallel adder of the prototype occurs only after l ₁ and l ₂ cycles after the start of each stage of the run, i.e. information that can be “removed” during these first l ₁ and l ₂ clock cycles is lost;

3) "accumulation" of the maximum peaks of PVKF (R _∑1,2 ) in the prototype is carried out "blindly": the obviously "zero" (or very small) side bursts of PVKF (in all shift cycles except one of l ₁ , l ₂ cycles ) with particular pronounced PVKF maxima R _chp1 and R _chp2 , which leads either to a decrease in the reliability of the search, or to an increase in the search time due to the lower “final” (*) s / w ratio.

Indeed, if we denote:

, а энергию шума на том же выходе - $${Ш}_1^{*}$$

, а соответственно 2-го канала - $${С}_2^{*}$$

и $${Ш}_2^{*}$$

;- the energy of the useful signal at the output of the digital comparator (CC) of the 1st channel as $$C_{\mathrm{one}}^{*}$$

, and the noise energy at the same output is $$W_{\mathrm{one}}^{*}$$

, and accordingly the 2nd channel - $${\mathrm{FROM}}_2^{*}$$

and $${\mathrm{<figure-callout\; id="2"\; label="W"\; filenames="00000071.png,00000073.png"\; state="\{\{state\}\}">W</figure-callout>}}_2^{*}$$

;

- the energy of the partial (maximum) peak PCF obtained during the analysis time (periodically) once in l ₁ and l ₂ cycles in the 1st and 2nd channels, _respectively , as R _pn1 and R _pn2 , and the noise energy for one cycle - "Sh"; at the same time, at the moment of appearance of R _np1 and R _np2 we will have the sum “signal + noise”: (R _np1 + w) and (R _np2 + w), then for the prototype the “final” s / w ratio at the output of the digital comparators of the first and the second channel during one run (number p = 1) of the entire length L of the PNP will have:

$$\approx (l_2/l_1){(C/Ш)}_1$$

, где (С/Ш)₁=R_чп1/Ш,for channel 1: $$C_{\mathrm{one}}^{*}/W_{\mathrm{one}}^{*}=[(R_{hP\mathrm{one}}+W)+(l_{\mathrm{one}}-\mathrm{one})W]{\mathrm{<figure-callout\; id="2"\; label="l"\; filenames="00000071.png,00000073.png"\; state="\{\{state\}\}">l</figure-callout>}}_2/l_{\mathrm{one}}W=(\mathrm{one}+R_{hP\mathrm{one}}/l_{\mathrm{one}}W){\mathrm{<figure-callout\; id="2"\; label="l"\; filenames="00000071.png,00000073.png"\; state="\{\{state\}\}">l</figure-callout>}}_2\approx$$

$$\approx ({\mathrm{<figure-callout\; id="2"\; label="l"\; filenames="00000071.png,00000073.png"\; state="\{\{state\}\}">l</figure-callout>}}_2/l_{\mathrm{one}}){(C/W)}_{\mathrm{one}}$$

where (S / N) ₁ = R _hn1 / N,

, где(С/Ш)₂=R_чп2/Ш;for channel 2: $$\begin{array}{l}{\mathrm{<figure-callout\; id="2"\; label="C"\; filenames="00000071.png,00000073.png"\; state="\{\{state\}\}">C</figure-callout>}}_2^{*}/{\mathrm{<figure-callout\; id="2"\; label="W"\; filenames="00000071.png,00000073.png"\; state="\{\{state\}\}">W</figure-callout>}}_2^{*}=[(R_{h\mathrm{<figure-callout\; id="2"\; label="P"\; filenames="00000071.png,00000073.png"\; state="\{\{state\}\}">P</figure-callout>}2}+W)+(l_2-\mathrm{one})W]l_{\mathrm{one}}/l_{2}W=(\mathrm{one}+{\mathrm{<figure-callout\; id="2"\; label="R\; h\; P"\; filenames="00000071.png,00000073.png"\; state="\{\{state\}\}">R\; </figure-callout>}}_{hP}/l_{2}W)l_{\mathrm{one}}\approx \\ \approx (l_{\mathrm{one}}/l_2){(}_C\end{array}$$

where (C / N) ₂ = R _pn2 / N;

and for the number of runs p> 1 we will have:

,for channel 1: $${({\mathrm{FROM}}_{\mathrm{one}}^{*}/W_{\mathrm{one}}^{*})}_p={(C/W)}_{\mathrm{one}}{l}_{2}p$$

,

.for channel 2: $${({\mathrm{FROM}}_2^{*}/{\mathrm{<figure-callout\; id="2"\; label="W"\; filenames="00000071.png,00000073.png"\; state="\{\{state\}\}">W</figure-callout>}}_2^{*})}_p={(C/W)}_2{l}_{\mathrm{one}}p$$

.

в первом и $$({С}_2^{*}/{Ш}_2^{*})$$

втором каналах пропорционально в l₂/l₁ и в l₁/l₂ раз отличается соответственно от отношения (С/Ш)₁ и (С/Ш)₂, которые имеются в момент появления частных пиков R_чп1 и R_чп2. Если длины l₁ и l₂ существенно отличаются друг от друга, то существенно будут отличаться и изменяться друг от друга итоговые отношения $$({С}_1^{*}/{Ш}_1^{*})$$

и $$({С}_2^{*}/{Ш}_2^{*})$$

для 2-х каналов и тем самым, во-вторых, - роль одного из каналов, у которого более большая длина l, в достоверности поиска будет уменьшаться. Таким образом, для увеличения итогового отношения $$({С}_1^{*}/{Ш}_1^{*})$$

и $$({С}_2^{*}/{Ш}_2^{*})$$

в каналах поиска, т.е. для увеличения достоверности принятия решения и необходимо увеличивать число прогонов р. Причем для существенного увеличения этого итогового отношения $$({С}_1^{*}/{Ш}_1^{*})$$

и $$({С}_2^{*}/{Ш}_2^{*})$$

число р должно увеличиваться не «на», а «в» разы. Следовательно, в разы увеличивается и время поиска и обнаружения ПСП. Именно этот факт подтверждают результаты имитационного моделирования, приведенные на фиг.7 описания прототипа (Пат. 2297722 Российская Федерация, МПК⁸ H04L 7/08, G06F 17/15. Способ ускоренного поиска широкополосных сигналов и устройство для его реализации [Текст] / Федосеев В.Е., Сныткин И.И., Варфоломеев Д.В. - №2005114601/09; заявл. 13.05.2005; опубл. заявка 20.11.2006; опубл. патент 20.04.2007), и на фиг 2. описания данного заявляемого способа, которые показывают зависимость математического ожидания средневыборочного накопленного значения M(R_∑1i) ПВКФ от количества периодов р-накопления, т.е. числа р-прогонов ПНП, при 25% искаженных символов принимаемой ПНП;1. As you can see, firstly, with one run (p = 1), ie along the length of one PNP, the final ratio $$({\mathrm{FROM}}_{\mathrm{one}}^{*}/W_{\mathrm{one}}^{*})$$

in the first and $$({\mathrm{FROM}}_2^{*}/{\mathrm{<figure-callout\; id="2"\; label="W"\; filenames="00000071.png,00000073.png"\; state="\{\{state\}\}">W</figure-callout>}}_2^{*})$$

the second channel is proportionally different in l ₂ / l ₁ and in l ₁ / l ₂ times, respectively, different from the ratios (S / N) ₁ and (S / N) ₂ , which are present at the time of the appearance of the private peaks R _h1 and R _hn2 . If the lengths l ₁ and l ₂ significantly differ from each other, then the resulting relations will significantly differ and vary from each other $$({\mathrm{FROM}}_{\mathrm{one}}^{*}/W_{\mathrm{one}}^{*})$$

and $$({\mathrm{FROM}}_2^{*}/{\mathrm{<figure-callout\; id="2"\; label="W"\; filenames="00000071.png,00000073.png"\; state="\{\{state\}\}">W</figure-callout>}}_2^{*})$$

for 2 channels and, therefore, secondly, the role of one of the channels, which has a longer length l, in the reliability of the search will decrease. Thus, to increase the final ratio $$({\mathrm{FROM}}_{\mathrm{one}}^{*}/W_{\mathrm{one}}^{*})$$

and $$({\mathrm{FROM}}_2^{*}/{\mathrm{<figure-callout\; id="2"\; label="W"\; filenames="00000071.png,00000073.png"\; state="\{\{state\}\}">W</figure-callout>}}_2^{*})$$

in search channels, i.e. to increase the reliability of decision making and it is necessary to increase the number of runs p. Moreover, for a significant increase in this final ratio $$({\mathrm{FROM}}_{\mathrm{one}}^{*}/W_{\mathrm{one}}^{*})$$

and $$({\mathrm{FROM}}_2^{*}/{\mathrm{<figure-callout\; id="2"\; label="W"\; filenames="00000071.png,00000073.png"\; state="\{\{state\}\}">W</figure-callout>}}_2^{*})$$

the number p should increase not "by", but "by" times. Consequently, the search and detection time of the memory bandwidth is significantly increased. This fact is confirmed by the results of simulation, shown in Fig.7 description of the prototype (Pat. 2297722 Russian Federation, IPC ⁸ H04L 7/08, G06F 17/15. Method for accelerated search for broadband signals and device for its implementation [Text] / Fedoseev V .E., Snytkin I.I., Varfolomeev D.V. - No. 2005114601/09; filed May 13, 2005; publ. Application November 20, 2006; publ. Patent April 20, 2007), and Fig. 2 describes this applicant methods that show the dependence of the mathematical expectation of the _{average sample} accumulated value M (R _{∑ 1i} ) of PVKF on the number of periods p -accumulation, i.e. the number of p-runs of PNP, at 25% of the distorted characters of the received PNP;

4) the selection of the maximum PVKF value (and comparison) among the incoming PVKF side peaks (and comparison) in the digital prototype comparator occurs only at the final stage of the sweep (in the best case, sweeps of the entire PNP (L or pL, where p is the given number of sweeps, i.e. p _min = 1)) for l ₁ and l ₂ cycles until the end of the sweep. Thus, a priori information about the PVKF structure is lost during the entire sweep phase, which could be used to significantly speed up the search due to the energy storage R _np1 and R _np2 not periodically after l ₁ and l ₂ clock cycles, but those. in every step of the search;

5) the prototype does not take into account and does not indicate that the structure of PVKF, and thus the whole process of accumulation of maximum side peaks of PVKF, depends on the direction of reciprocal movement (“on-the-line” or “on-and-off”) of the supporting generating components and the received EOR in correlation devices-convolvers. Namely, the organization of the correct direction of this movement - “counter-inverse” can lead to acceleration of accumulation and search in general.

The inventive method of accelerated search and the device that implements it solves the problem of quick search for the delay of signals manipulated by PNP (Snytkin. II Theory and practical application of complex signals of nonlinear structure. Part 3. [Text] / II Snytkin - MO, 1989 g.). This class of sequences in comparison with traditionally used linear PSPs (M-sequences and derivatives from them) has significant potential advantages: a large number of lengths for which they exist, high structural secrecy, and special correlation properties that allow successful implementation of both traditional and new effective signal processing algorithms based on them. The use of the properties of the PNP, the fine internal structure of the PNP and its producing components - simple NLRP), as well as the determinism properties (for the external observer of quasi randomness) of the PVKF PNP structure are the basis of the proposed method for delay and ensures the achievement of a set of characteristics that determine the best technical result of the following set of properties:

1. Due to the rule of construction, the code structure of the PNP, as well as the deterministic structure of the PVKF PNP allow implementing the inventive method for quick search, and provides a significant reduction in search time for delayed SRS;

2. 3a due to the use of PNP, the correlation properties of the SRS at large and extra-large lengths are close to optimal;

3. High imitation resistance and structural secrecy of the signals and the most vulnerable to interference stage of the search for CDS in radio links are ensured;

4. The implementation of the method does not require the selection of memory bandwidth based on knowledge of the structure of their various segments, because as reference segments, signal segments are used, the lengths of which are determined by the lengths of the 2 producing components PK-1 and PK-2, and the internal structure changes quasi-uncontrollably with each processing cycle in real time;

5. A device that implements the search method can be constructed using both traditional elements and elements of acoustoelectronic equipment that satisfy the stringent requirements of energy consumption, time and weight and size parameters [6].

Salient features of the claimed method is the following set of actions:

a priori information is used on the structure of PVKF PNP of duration L = l ₁ × l _{2, the} structure of private PVKF _1i , PVKF _2j formed by parallel, simultaneous, in the “counter-inverse” correlation mode for all possible i, j subchannels (i = l ₁ , j = l ₂ ), respectively, of the first (1) and second (2) channels for receiving incoming PNP with various automorphisms (cyclic shifts) of segments (producing components (PK-1 and PK-2) in the form of simple NLRPs of duration l ₁ and l ₂ ) - PK-1 _i and PK-2 _j , i = 1, ..., l ₁ , j = 1, ..., l ₂ ;

simultaneous parallel primary accumulation of the values of the partial PVKF _1i , PVKF _{2i is} carried out, in the subchannels i and j of the search for the 1st and 2nd channels at each correlation step during the analysis time T _an1 = p ₁ l ₁ , T _an2 = p ₂ l ₂ where p ₁ and p ₂ - the number of runs of the producing components PC-1, PC-2, p _1min = p _2min = 1; and summing the accumulated values in each channel at the end of the primary accumulation sub-step, to implement the extrapolation sub-step;

moreover, extrapolation (prediction) of the structure of private PVKF, PVKF in the form of extrapolation to each k _1st , k _2nd clock moments (after a sub-step of primary accumulation) of the private peaks R _np1 , R _np2 in the 1st and 2nd channels, respectively, is _realized at the outputs of certain extrapolated search subchannels with extrapolated numbers N _{ki + 1} and N _{k2 + 1} according to regularity (4), implemented as extrapolation functions of SE ₁ , SE ₂ subchannels of the 1st and 2nd processing channels:

SE ₁ = f (N _k1 ), SE ₂ = f (N _k2 ), N _k1 = 1, ..., l ₁ , N _k2 = 1, ..., l ₂ ,

as functions of the sequence numbers and sub peaks with partial _chp1 R, R _chp2 at its outputs in each k th _1, k ₂ -th cycles:

moreover, 2-factor control of extrapolation is implemented according to the majority principle: according to the factor of extrapolated subchannel numbers and with private peaks R _chp1 , R _chp2 and by the factor of accumulation levels

; $$S_{\mathrm{one}}={\displaystyle \sum _{i=\mathrm{one}}^{l_{\mathrm{one}}}{R}_{hP\mathrm{one,}i}}\mathrm{and}{\mathrm{<figure-callout\; id="2"\; label="S"\; filenames="00000071.png,00000073.png"\; state="\{\{state\}\}">S</figure-callout>}}_2={\displaystyle \sum _{j=\mathrm{one}}^{l_2}{R}_{hP2j}}$$

;

moreover, the accumulation is carried out at the outputs of 2 channels of the identified extrapolated private peaks R _ch1i , R _chp2j , at the extrapolated outputs ix and j-th subchannels of the search for the 1st and 2nd processing channels, respectively, in each kth (k ₁ = k ( modl ₁ ) and k ₂ = k (modl ₂ )) receive clock;

moreover, the control of the establishment of synchronism by delay is realized by the formation of the reference signal of the PNP without directly determining the current time delay of the received PNP, and by combining the numbers of the clock cycles with the producing rulers, using expression (1), in which i _max and j _max are, in essence, extrapolated subchannel numbers i _max = N _k1 , j _max = N _k2, respectively, with private peaks at their outputs and after a positive 2-factor control of extrapolation.

The basis of the implementation of the proposed method and device are: 1) features of the PNP code structure due to their formation rule, 2) features and determinism properties of PVKF PNP as a function of time. We indicate these features.

1. Features of the code structure of the PNP.

1.1. According to [5], second-order PNPs (also called double derivatives of nonlinear recurrent sequences - PNLRP) of the form W ^{2 of} length L are sequences that are formed from 2 producing rulers (PL) - repeating generating components PK-1, PK-2 (simple nonlinear recurrence sequences - NLRP) of lengths l ₁ and l ₂ (l ₁ <l ₂ ) of the form V ^j , j = 1, 2 according to rule (3):

$$\{\begin{array}{l}{\mathrm{<figure-callout\; id="2"\; label="W"\; filenames="00000071.png,00000073.png"\; state="\{\{state\}\}">W</figure-callout>}}^2=\left\{W_i^2:i=0...,L-\mathrm{one}\right\},L=l_{\mathrm{one}}\cdot l_2\hfill \\ {\mathrm{<figure-callout\; id="2"\; label="W\; i"\; filenames="00000071.png,00000073.png"\; state="\{\{state\}\}">W\; </figure-callout>}}_i^{}=V_{i(\mathrm{mod}{l}_{\mathrm{one}})}^{\mathrm{one}}\oplus V_{i(\mathrm{mod}{l}_2)}^2\hfill \end{array}\},(3)$$

, $$V_{i(\mathrm{mod}{l}_2)}^2$$

- двоичные символы (0 или 1) с номером i, взятым по модулям длин l₁ и l₂ периодически повторяющихся ПК-1 и ПК-2 НЛРП.V ¹ and V ² - producing line NLRP; $$V_{i(\mathrm{mod}{l}_{\mathrm{one}})}^{\mathrm{one}}$$

, $$V_{i(\mathrm{mod}{l}_2)}^2$$

- binary characters (0 or 1) with number i taken from modules of lengths l ₁ and l _{2 of} periodically repeating PC-1 and PC-2 NLRP.

1.2. The rule for the formation of double PUP illustrates figure 1.

2 types of NLRP are used as the generating components of the PC: the well-known quadratic residue codes (CCR) with the number of characters l ₁ ∈t, and l ₂ ∈t, where t = 4x + 1 (type K1), t = 4x + 3 ( type K3), as well as characteristic codes (XC) with the number of characters t = 4x (type X0), t = 4x + 2 (type X2), x = 1, 2, 3, ... [7]. Types of PNP are determined by a combination of PC types.

1.3. The producing components - NLRP, as shown in [5], are not subject to disclosure of their structure by the well-known Massey algorithms, since NLRP are not formed by shift registers with linear feedbacks, which determines the basic high characteristics of structural secrecy and imitability of NLRP. And the algorithm (rule (3)) of the formation of the PNP additionally significantly increases, as shown in [5], the stealth and imitation resistant properties of the PNP. In addition, since the PNP and its duration L are multiplicative in nature (they are derived from NLRP), for large and super-long durations L, the PNPs become close to optimal [5] according to the signs of optimality reflected in [1]. Thus, the features of the internal code structure of the PNP provide the best technical result according to the above points 2, 3, 4 in the aggregate.

2.0. Features and properties of determinism of PVKF PNP.

The inventive search method is based on the properties of PVKF PNP, established both in [5] and in subsequent studies of the authors, including as a result of machine simulation of these properties, which are as follows:

2.1. When organizing traditional methods of receiving a search, detecting the bandwidth, it analyzes the periodic function of the PVKF when the incoming bandwidth is compared on the receiving side in the correlator (matched filter) with its full copy. When implementing these methods in relation to the applied EOR, we are talking about PVKF EOR. PVKF of two different types of PNP with production lines made up of repeating KKV and KK of the same type and length has up to three fixed levels depending on the considered PSP. Their values are shown in the table in figure 3 and figure 5.

2.2. Among these fixed levels, there are always two pronounced partial lateral peaks R _np1 and R _np2 , which, firstly, are an order of magnitude higher than the third (peak), and secondly, the ratio of the peak values R _np1 / R _{np2 is} proportional to the ratio l ₁ / l ₂ : R _pn1 / R _pp2 ≈l ₁ / l ₂ . Thus, in the analysis of twofold EORs, the third very small peak can always be neglected, and thirdly, the amount of R _np1 and R _np2 in the composition of PVKF for one period of L NNP is respectively l ₂ and l ₁ , so the sum of the energy bursts in relative measurement is: (l ₂ R _np1 + l ₁ R _nn2sh ) ≈1, which, as can be seen, corresponds in relative measurement to the magnitude of the main correlation peak of the PNP R _op ≈1 in the case of complete coincidence of the input and reference PNP.

2.3. The analysis of PVKF PNP as a function of time unambiguously shows (including the example of Fig. 5) that PVKF has a strict deterministic structure, namely: each particular peaks R _cn1 and R _{cn2 are} repeated in time strictly periodically with periods respectively l ₁ and l ₂ : T _pn1 = l ₁ , T _pn2 = l _2, i.e. the periodic cyclicity of the appearance of R _PP1 and R _PP2 strictly repeats the periodic cycle of the beginning (and end) of the generation of the generating components PK-1, PK-2 (NLRP-1 and NLRP-2) of corresponding durations l ₁ and l ₂ in the composition of the producing rulers PL-1 , PL-2 during the generation (formation) of PNP (Fig. 1, rule (3)). Thus, there is a one-to-one correspondence between the composition of two-time PNP (i.e., specific values of l ₁ and l ₂ and the form of PK-1 and PK-2) and the structure of PVKF. Therefore, knowing the composition of double-term PNP, it is possible to predict (extrapolate) the structure of PVKF of this PNP, which is important a priori information that can be used in organizing the search and detection of PNP.

2.4. As the studies of the authors showed, in the case of the use of the PNP, it is possible to obtain the same structure of the PVKF PNP without the necessary correlation on the receiving side with the entire copy of the PNP, and it is enough to correlate the incoming (received) PNP with copies of the generating components through the 2nd correlation channels. In this case, we are dealing with private PVKF (PVKF-1 and PVKF-2), which, when superimposed on a common time axis, completely reflect and repeat the structure of PVKF of the whole PNP (which, by the way, fully confirms the validity of the classical temporal methods for the analysis of radio engineering systems using the above principle). Figure 5, a, b, c shows, respectively, PVKF PNP with L = 77 and private PVKF-1, PVKF-2 with generating components that illustrate this statement.

2.5. The presence in the structure of private PVKF-1, PVKF-2 pronounced R _np1 and R _np2 , periodically repeating at the whole stage of the analysis of the length L of the incoming PNP, can be used to implement the search for detection and synchronization of PNP by delay with an accuracy of units of length l ₁ and l ₂ , and not accurate to the length L in the case of using the PVKF of the entire PNP, which, obviously, implies an acceleration of the search and synchronization process, since (l ₁ and l ₂ ) << L. As can be seen from the table of figure 3, to implement the method of searching for CPC by delay, based on the establishment of a time-synchronous state with each PC by the pronounced values of PVKF-1, PVKF-2 with it, it is advisable to use PNP from a PC of type K3 and K1. This is due to the presence of a pronounced cross-correlation of the PNP with both submarines of these types. From the rule of constructing the PNP (Fig. 1) it can be seen that by combining the numbers of the PNP clocks separately with each of the 2 submarines defined on the same signal processing period, the current delay of the entire PNP can be set, i.e. the number of the current measure of the mutual shift of the received and reference sequences.

2.6. Considering the above, it is then obvious that, by performing the search and synchronization procedure, the delay is not of the PNP, but the delay of the producing components, i.e. by correlating the received PNP with the cyclic shift of the copies of the producing components on the receiving side (which in itself is much simpler than the same with the cyclic shift of the copy of the whole PNP), i.e. by forming private PVKF-1 and PVKF-2 with cyclic shifts of the producing components, we model the receipt of PVKF of the incoming PNP with cyclic shifts of its copies. And since the periodicity of cyclic shifts of copies of the producing components is a multiple of l ₁ and l ₂ respectively in the 1st and 2nd reception and correlation channels, it is obvious:

1) that the implementation of the search, detection and synchronization process for the delay will be much faster when the delay (cyclic shift) is not the whole copy of the PNP, but with delays (cyclic shift) of the producing components; 2) the private peaks of PVKF-1, PVKF-2 will always appear with any shifts of the producing components and much more often (during the period of the whole PNP, as mentioned above, the number of partial peaks R _cn1 and R _cn2 will be l ₁ and l ₂ times, respectively) ; than the main peak of PVKF PNP appearing once possible with exact synchronization; 3) these partial peaks R _np1 and R _np2 can be accumulated to increase the s / _n ratio to decide on the detection and synchronization of PNP.

2.7. The authors found that the partial peaks of PVKF-1, PVKF-2 with different cyclic shifts of the producing components differ from each other in that the partial PVKF-1 and PVFK-2, while keeping the levels of _RRP1 and _RRN2 identical, have cyclically shifted periodic sequences the moments of occurrence (t _pn1 , t _pn2 ) of the private peaks R _pn1 and R _pn2 . Those. the structure as a whole of private PVKF-1, PVKF-2 changes cyclically: either according to the sequence of t _{PP1 of the} appearance of R _PP1 (in the case of cyclic shifts of the generating component PK-1 with l ₁ ), or by the sequence of t _{PP2 of the} appearance of R _PP1 (in the case of cyclic shifts the generating component PK-2 with l ₂ ), or in both sequences t _pn1 , t _{pn2 the} appearance of R _pn1 and R _pn2 (in the case of cyclic shifts of both generating components of PK-1, PK-2 with l ₁ , l ₂ ). Therefore, there are three possible types of structural changes in PVKF-1 and PVKF-2.

Thus, in these cases we can talk (by analogy with the concepts of “automorphism” used in relation to automorphic transformations — cyclic shifts — NLRP in [5]) about automorphic changes in the structure of partial PVKF-1, PVKF-2 of three types, and there is a unique the correspondence between the magnitude of the cyclic shift (automorphism) of the generating component and the magnitude of the automorphism of the partial PVKF. Consequently, by the magnitude of the automorphism of the producing component (or components), it is possible to predict (extrapolate) the size and type of partial PVKF-1, PVKF-2, i.e. extrapolate the “thin” structure of private PVKF-1, PVKF-2.

2.8. There is another important property associated with the analysis of the combination of private PVKF-1 and PVKF-2. If we simultaneously obtain private PVKF-1 (or PVKF-2) with all possible automorphisms (cyclic shifts) of one producing component, for example, duration l ₁ , i.e. to receive at the same time automorphic private PVKF-1 _i , i = 1 ... l ₁ , for individual i-th correlation subchannels, it can be observed: 1) that at each correlation clock a particular peak R _ch1 will be observed from a particular correlation subchannel; 2) if the correlation subchannel is numbered according to the magnitude of the cyclic shift of the producing component, then it can be observed that the sequence of subchannel numbers, at the output of which R _ch1 appears at each subsequent correlation _step , will have a deterministic cyclically repeating structure of numbers with a repetition period of l ₁ cycles; 3) with a simultaneous cyclic mutual shift (which corresponds to the delay search procedure) between the received incoming PNP and all automorphisms (cyclic shifts) of the generating component, the indicated sequence of subchannel numbers will also cyclically shift.

Thus, regardless of the mutual cyclic shift l _0i between the incoming PNP and the ith automorphisms of the producing component (correlation subchannels), the process of forming private PVKF-1 _i , the internal structure of the sequence of numbers of correlation subchannels, at the output of which are sequentially in each the correlation clock appears a particular peak R _h1 , will be constant, but cyclically shifted depending on the specific value of the mutual shift l _0i . This fact determines the possibility of deterministic prediction (extrapolation), from the output of which correlation subchannel in the next correlation cycle, we should expect a private peak R _hn1 . The regularity of the sequence of numbers of subchannels can always be unambiguously established, including in the analytical form of an arithmetic equation that relates: the number of the measure k, in which R _чп1 appeared; the number of the subchannel N _k, at the output of which R _ch1 appeared in the kth step; the number of the subchannel N _{k + 1} , the output of which appears at the next (k + 1) -th beat private peak R _ch1 ; and l ₁ . This pattern will be characteristic of the 1st correlation channel working with PC-1 of duration l ₁ . A similar regularity in meaning will be characteristic, naturally, of the 2nd correlation channel working with PC-2 of duration l ₂ . Moreover, such unambiguous regular relationships will strictly correspond to the composition of the PNP, i.e. from which producing components the PNP is obtained. Thus, for each of the 2 channels of reception and correlation there will be its own dependence:

$$\begin{array}{l}dl\mathrm{I\; am}{\text{Channel 1 N}}_{\text{k1}+\text{one}}=f_{\mathrm{one}}(k_{\mathrm{one}},N_{k\mathrm{one}},l_{\mathrm{one}}),\\ dl\mathrm{I\; am}{\text{2nd channel N}}_{\text{k2}+\text{one}}=f_2({\mathrm{<figure-callout\; id="2"\; label="k"\; filenames="00000071.png,00000073.png"\; state="\{\{state\}\}">k</figure-callout>}}_2,{\mathrm{<figure-callout\; id="2"\; label="N\; k"\; filenames="00000071.png,00000073.png"\; state="\{\{state\}\}">N\; </figure-callout>}}_k,l_2).\text{(four)}\end{array}$$

Obtaining such dependencies is the subject of a separate study and analysis that is not of particular importance for this proposed method. Figure 6 shows a simplified visual numerical model illustrating the provisions set forth in this paragraph 2.8. In this FIG. 6: 1) the numbers in the horizontal ruler reflect the cyclically repeating elements of the incoming EOR corresponding to the position of the elements of one producing component of length l ₁ = 7 during the formation of the EOR; 2) the numbers in the vertical columns reflect the elements of a copy of the same producing component of length l ₁ = 7 on the receiving side as a part of various correlation subchannels (the number of subchannels is l ₁ = 7, which corresponds to 7 possible automorphisms of PC-1 with l ₁ = 7); 3) mutual sequential cyclic shifts of the incoming PNP and automorphisms of PC-1 correlation subchannels in the subchannel correlators are shown; 4) the right in the extreme vertical column shows the numbers of subchannels in which at each subsequent clock cycle a maximum of R _chn = 7 (R _chn1 ) _appears , which corresponds to the complete coincidence of the symbols of the generating component of the incoming EOR and the correlation subchannel; 5) it can be seen that the sequence of numbers of subchannels in which R _ch1 = 7 appears successively in each clock cycle will have the structure

$$\mathrm{FROM}{E}_{\mathrm{one}}=1642753=f_{\mathrm{one}}(N_{k\mathrm{one}}),\mathrm{FROM}{\mathrm{<figure-callout\; id="2"\; label="E"\; filenames="00000071.png,00000073.png"\; state="\{\{state\}\}">E</figure-callout>}}_2=f_2(N_{k2}),(5)$$

where N _k1 = 1, ..., l ₁ , and N _k2 = 1, ..., l ₂ .

This structure of the FE ₁ (5) does not change, but cyclically shifts depending on the random moment-tact l _{0 of the} mutual shift between the incoming PNP and the PC-1 automorphisms at the same time that the process of correlation reception started on the receiving side. A similar regularity of the sequence of numbers of subchannels of SE ₂ will be for another receiving channel that correlates incoming PNP with PC-2 of duration l ₂ . We will call such regularities SE ₁ , SE ₂ extrapolation functions of subchannels in channels 1 and 2, respectively. As functions of a sequence of numbers of subchannels N _k1 , N _k2 with partial peaks R _cn1 , R _cn2 at their outputs in each k ₁ st, k ₂ - th measures.

It should also be pointed out that these regularities are illustrated and occur for the case if the correlation reception in both channels will be carried out precisely when the convolver type (as will be indicated below) is received in the correlators of the received PNP and automorphic copies of the producing PC-components 1, PC-2, i.e. when the sequences of digits (elements) of the generating component of the incoming EOR and copies of the components of the receiving side enter inversely (back to count) towards each other in the convolver. For other types of correlators (for example, discrete matched filters), there will be another model, including a numerical one - “on-the-go”, which in the case of using convolvers does not generate these above patterns. Thus, for convolver-type sub-correlators, the fact of a counter-inverse model of correlation reception is very important.

The authors obtained numerous machine simulation models of the positions set forth in clause 2.8., And Fig. 7 shows, as examples, the results of this simulation for PNP with L = l ₁ × l ₂ = 221, l ₁ = 13, l ₂ = 17 , where it can be seen that there really is a strictly determined sequence of FE ₁ numbers of correlation subchannels, at the output of which, at each subsequent beat, particular peaks R _{hn1 appear} .

The inventive method, unlike the prototype, just uses the properties of the PNP itself and its PVKF (including private PVKF-1 and PVKF-2), which are described in the above properties (in paragraphs 2.2-2.8). That is, the claimed method aims to realize the possibilities that reveal these properties to achieve a technical result (according to paragraph 2 of the technical result): a significant reduction in the time of searching for CPC by delay. Namely:

1. The implementation of parallel simultaneous correlation reception-search of incoming PNP for all possible reception subchannels in each of the two reception channels, that is, the implementation of the formation of private PVKF-1, PVKF-2 for l ₁ and l ₂ subchannels, respectively, in the 1st and 2nd m channels, i.e. the formation of private PVKF-1 _i , i = 1 ... l ₁ , and PVKF-2 _j , j = 1 ... l ₂ , incoming PNP with automorphic transformations of the 2 producing components PK-1, PK-2 in the “counter-iversed” mode in sub-correlators of convolver type channels.

2. Extrapolation (prediction) of the structure of the private PVKF-1 _i and PVKF-2 _j in the form of extrapolation at each clock moment of the private peaks R _h1 and R _hn2 at the outputs of certain extrapolated correlation subchannels.

3. Two-factor control of extrapolation according to the majority principle: according to the factor of the extrapolated numbers of subchannels with partial peaks R _h1 and R _h2 and by the factor of the accumulation level S ₁ = ∑ _{R hn1, i} , S ₂ = ∑R _{hn2, j} .

4. The accumulation of detected (extrapolated) private correlation peaks R _cn1i , R _cn2j in both reception channels at each k-th (k ₁ = k (modl ₁ ), k ₂ = k (modl ₂ )) reception timing using extrapolation of numbers N _{k1 + 1} , N _{k2 + 1} subchannels with private peaks R _ch1 and R _ch2 at the outputs of 2 channels in each subsequent (k ₁ +1) -e and (k ₂ +1) -e clock cycles based on patterns (4 ) and functions (5) extrapolation FE ₁ and FE ₂ to significantly accelerate the improvement of the final ratio (**) s / N at the outputs 2-receiving channels in the interests of deciding the detection and synchronization with the task th reliability. Namely, in the proposed method, during the possible one “search run” during the length L of the PNP at the output of the central digital comparators (1 and 2 channels) we will have the final ratios (**) s / w in 2 channels;

и $${С}_2^{*}/{Ш}_2^{*}$$

):for the proposed method and device, the final signal-to-noise ratio (**) at the output of the central digital comparators (1 and 2 channels) for the same time of one “accumulation run” (as for the prototype, as was shown above in relation to $${\mathrm{FROM}}_{\mathrm{one}}^{*}/W_{\mathrm{one}}^{*}$$

and $${\mathrm{FROM}}_2^{*}/{\mathrm{<figure-callout\; id="2"\; label="W"\; filenames="00000071.png,00000073.png"\; state="\{\{state\}\}">W</figure-callout>}}_2^{*}$$

):

, $$C_{\mathrm{one}}^{**}/W_{\mathrm{one}}^{**}=(R_{hP\mathrm{one}}+W)l_{\mathrm{one}}{\mathrm{<figure-callout\; id="2"\; label="l"\; filenames="00000071.png,00000073.png"\; state="\{\{state\}\}">l</figure-callout>}}_2/l_{\mathrm{one}}W$$

,

. $${\mathrm{<figure-callout\; id="2"\; label="C"\; filenames="00000071.png,00000073.png"\; state="\{\{state\}\}">C</figure-callout>}}_2^{**}/{\mathrm{<figure-callout\; id="2"\; label="W"\; filenames="00000071.png,00000073.png"\; state="\{\{state\}\}">W</figure-callout>}}_2^{**}=(R_{h\mathrm{<figure-callout\; id="2"\; label="P"\; filenames="00000071.png,00000073.png"\; state="\{\{state\}\}">P</figure-callout>}2}+W)l_2{l}_{\mathrm{one}}/l_{2}W$$

.

Thus, the gain in signal-to-noise ratio in the proposed method-device will be equal to:

, $$(C_{\mathrm{one}}^{**}/W_{\mathrm{one}}^{**})/({\mathrm{FROM}}_{\mathrm{one}}^{*}/W_{\mathrm{one}}^{*})=(R_{hP\mathrm{one}}+W)l_{\mathrm{one}}/[(R_{hP\mathrm{one}}+W)+(l_{\mathrm{one}}-\mathrm{one})W]\approx l_{\mathrm{one}}$$

,

$$({\mathrm{<figure-callout\; id="2"\; label="C"\; filenames="00000071.png,00000073.png"\; state="\{\{state\}\}">C</figure-callout>}}_2^{**}/{\mathrm{<figure-callout\; id="2"\; label="W"\; filenames="00000071.png,00000073.png"\; state="\{\{state\}\}">W</figure-callout>}}_2^{**})/({\mathrm{<figure-callout\; id="2"\; label="C"\; filenames="00000071.png,00000073.png"\; state="\{\{state\}\}">C</figure-callout>}}_2^{*}/{\mathrm{<figure-callout\; id="2"\; label="W"\; filenames="00000071.png,00000073.png"\; state="\{\{state\}\}">W</figure-callout>}}_2^{*})\approx {\mathrm{<figure-callout\; id="2"\; label="l"\; filenames="00000071.png,00000073.png"\; state="\{\{state\}\}">l</figure-callout>}}_2$$

Thus, for one “accumulation run” (period L PNLRP), the gain in signal-to-noise ratio at the outputs of the central digital comparators of channels 1 and 2 in the proposed method-device will be approximately (respectively in the first and second channels) in l ₁ and l ₂ times This gain can be transformed into a gain in time of search, detection and synchronization by the same number of times while maintaining the identity of the requirements for the final signal-to-noise ratios of the proposed method device and prototype, because the accumulation of the required final s / w ratio will occur in l ₁ and l ₂ times faster in channels 1 and 2, respectively. Thus, the time for the necessary energy storage S ₁ = ∑R _{чп1, i} , S ₂ = ∑R _{чп2, j} in the proposed method and is reduced by l ₁ and l ₂ times, respectively, which is taken into account as 1 and 2 channels for making a decision on detection of PNP, and in the algorithm of the proposed method device. In particular, in this regard, a noticeable reduction (by l ₁ and l ₂ times) of the time of “primary accumulation” of the energy of private peaks R _{ch1 is envisaged,} and thereby the decision is made to synchronize with the PNP for no more than the length L of one PNP, those. during one run of the incoming EOR.

The inventive method of accelerated search, detection and synchronization of PNP (SRS) is characterized in the algorithm shown in Fig.8 of the following set of sequential actions (steps and sub-steps).

Stage of search and discovery.

The search starts from the moment of a random mutual parallel shift l ₀₁ , l ₀₂ between the incoming PNP and the automorphisms (cyclic shifts) of the generating components PK-1, PK-2. Naturally, there is no accumulation of PVKF ₁ , PVKF ₂ , and therefore the sum R _∑1ik1 = R _∑2jk2 = 0, where 1, 2 are the first and second reception channels on PC-1, PC-2; i, j are automorphisms of PC-1 and PC-2, respectively, i = 0, ..., (l ₁ -1), j = 0, ..., (l ₂ -1); k ₁ = 1, ..., l ₁ , k ₂ = 1, ..., l ₂ - cycles of cyclic parallel shifts of automorphisms PK-1, PK-2, at the initial moment k ₁ = k ₂ = 0 (block 1).

и $${\displaystyle \sum _{j=1}^{l_2}{R}_{{\displaystyle \sum 2j{a}_2}}}=S_2$$

(блоки 9, 12),- и 2), если эти суммы превышают заданные пороги S₁≥S_п1 и S₂≥S_п2 (блоки 10, 11), то дается команда на выбор экстремумов Э₁ и Э₂ среди соответственно $$R_{{\displaystyle \sum 1i{a}_1}}$$

и $$R_{{\displaystyle \sum 2j{a}_2}}$$

из определенных подканалов ПК-1_i ПК-2_j: $${Э}_1={(R_{{\displaystyle \sum 1i{a}_1}})}_{\max }$$

, $${Э}_2={(R_{{\displaystyle \sum 2j{a}_2}})}_{\max }$$

(блоки 13, 15),- 3) и команда на выбор номеров подканалов N_k1(Э₁), Nk₂(Э₂), в которых эти экстремумы выявлены (блоки 14, 16). Если же указанное выше условие не будет выполнено, т.е. если S₁<S_п1 и (или) S₂<S_п2, то дается команда на увеличение чисел прогонов p₁ и (или) p₂, и первичное накопление будет продолжено при новых значениях p₁ и (или) p₂ (блок 2).Sub-step of primary accumulation. The first beat k ₁ = k ₂ = 1 (block 2) begins the initial filling of l ₁ and l _{2 of the} sub-correlators of all subchannels in both channels: before the beat k ₁ = l _{1, the} incoming PNP with one input and automorphisms PK-1 _i to the second inputs of ix sub-correlators; up to the beat k ₂ = l _{2i, the} incoming PNP from one input and the PC-2 _j automorphisms to the second inputs of the j -th correlators enter the _sub- correlators of the second channel in the “counter-inverse” mode; the values of PVKF-1 _i = PVKF-2 _j = 0 for k ₁ = 1, ..., l ₁ -1 and k ₂ = 1, ..., l ₂ -1. Starting from the “zeroed” modulo l ₁ , l ₂ clock cycles k ₁ = l ₁ = 0 (mod l ₁ ) and k ₂ = l ₂ = 0 (mod l ₂ ), the mutual shift in the first and second channels all sub- _{correlators of} both channels of the incoming PNP and automorphisms PK-1 _i and PK-2 _j (which have already filled the correlators by this time) and the formation of the values of the partial PVKF _1ik1 , PVKF _2jk2 . Thus, the sub-stage of the primary accumulation of the values of automorphic partial PVKF-1 _i , PVKF-2 _j in each i-th j-th subchannels begins so that with each subsequent beat k ₁ = k ₁ +1 and k ₂ = k ₂ +1, in a certain i-th and j-th subchannel of the first and second channels, respectively, partial peaks R _ch1i and R _{chp2j may appear} , and the minimum values (accurate to noise energy) PVKF _1ik1 , PVKF _2jk2 will appear in other clock cycles in the same subchannels . With each _step , the obtained values of PVKF _1ik1 , PVKF _2jk2 in each subchannel are stored with assignment by them of the numbers of the corresponding measures k ₁ and k ₂ . This procedure continues to beats k ₁ = l ₁ -1 and k ₂ = l ₂ -1. With the next measure, the values of k ₁ and k ₂ are reset (blocks 7, 8), and the values of PVKF _1ik1 , PVKF _2jk2 obtained at the time of these cycles are added to the values already stored in memory for previously zero cycles k ₁ and k ₂ . The accumulation of values of PVKF _1ik1 , PVKF _2jk2 (blocks 2, 5, 6) on each k ₁ and k ₂ measure, next with periods l ₁ and l ₂ relative to each of l ₁ values k ₁ and l ₂ values of k ₂ , is performed until conditions: a ₁ = T _an1 = p ₁ l ₁ (for the 1st channel), and ₂ = T _an2 = p ₂ l ₂ (for the 2nd channel), where T _an1 , T _an2 - time (in the number of ticks ) analysis and accumulation, p ₁ and p ₂ - the number of accumulation periods for the 1st and 2nd channel, respectively (blocks 3, 4). When this condition is fulfilled, the following is carried out: 1) the accumulated for T _an1 in the PK-1 _i subchannels and for T _an2 in the PK-2 subchannels _{j of the} partial “subchannel” amounts of PVKF _i1k1 , PVKF _2jk2 : $${\displaystyle \sum _{i=\mathrm{one}}^{l_{\mathrm{one}}}{R}_{{\displaystyle \sum \mathrm{one}i{a}_{\mathrm{one}}}}}=S_{\mathrm{one}}$$

and $${\displaystyle \sum _{j=\mathrm{one}}^{l_2}{R}_{{\displaystyle \sum 2j{a}_2}}}=S_2$$

(Blocks 9, 12), - and 2) if these amounts exceed predetermined thresholds S ₁ and S ≥S _{n1 n2} ≥S ₂ (blocks 10, 11), the command is given the choice of extrema E ₁ and E ₂ respectively include $$R_{{\displaystyle \sum \mathrm{one}i{a}_{\mathrm{one}}}}$$

and $$R_{{\displaystyle \sum 2j{a}_2}}$$

from certain subchannels PK-1 _i PK-2 _j : $$E_{\mathrm{one}}={(R_{{\displaystyle \sum \mathrm{one}i{a}_{\mathrm{one}}}})}_{\max }$$

, $${\mathrm{<figure-callout\; id="2"\; label="E"\; filenames="00000071.png,00000073.png"\; state="\{\{state\}\}">E</figure-callout>}}_2={(R_{{\displaystyle \sum 2j{a}_2}})}_{\max }$$

(blocks 13, 15), - 3) and the team to select the numbers of subchannels N _k1 (Э ₁ ), Nk ₂ (Э ₂ ), in which these extremes are identified (blocks 14, 16). If the above condition is not met, i.e. if S ₁ <S _p1 and (or) S ₂ <S _p2 , then a command is given to increase the number of runs p ₁ and (or) p ₂ , and the primary accumulation will continue with new values of p ₁ and (or) p ₂ (block 2).

At this sub-stage of primary accumulation ends (blocks 1 ... 16).

, $${\displaystyle \sum _{l_2}\text{'}\text{'}1\text{'}\text{'},\text{'}\text{'}0\text{'}\text{'}\ge {П}_{h2}}$$

, (по заложенному мажоритарному правилу: П_h1=M₁l₁, П_h2=М₂l₂, - где M₁, М₂ - коэффициенты мажоритарности для 1-го и 2-го каналов (блоки 25, 26), то с выхода канальных накопителей поступает сигнал («наш₁»)₁, («наш₁»)₂ на соответствующие канальные ключи. Если указанные неравенства не выполняются, то экстраполяция продолжается (блоки 17, 19…26) без выдачи этих сигналов до такта, при котором эти неравенства будут выполнены.Extrapolation sub-step. Based on the detected k ₁ , k ₂ N _k1 (Э ₁ ), N _k2 (Э ₂ ) subchannels in the form of signals at the corresponding inputs of the cross-blocks of the 1st and 2nd channels, these signals are delayed by one clock cycle through the cross -connections that correspond to extrapolation functions of SE ₁ , SE ₂ according to dependences (4) and (5) fall on such outputs of cross blocks that correspond to the numbers N _{k1 + 1} , N _{k2 + 1 of the} subchannels, which should be observed in the next (k ₁ +1) -th, (k ₂ +1) -th steps are the following (close to the extrema of E ₁ , E ₂ by value) partial peaks R _hn1 , R _hn2 (block 17). The extrapolated numbers N _{k1 + 1} , N _{k2 + 1} subchannels appear in the form of signals at the corresponding first inputs of the channel verification devices in the next (k ₁ +1) th, (k ₂ +1) th clock. In the k _1- st, k- _2- nd clock cycles, the energy E ₁ , E _{2 are} stored in channel parallel adders (block 18). In the next (k ₁ +1) th, (k ₂ +1) th clock: the second inputs of the verification devices receive the numbers N _{k1 + 1} , N _{k2 + 1} subchannels with the maximum the peaks are R _pn1 , R _pn2 (block 19), and in channel parallel adders, these values of R _pn1 , R _{pn2 are} added to the previously stored values of E ₁ , E ₂ (block 20), respectively. In the subsequent measures of the (k ₁ +2) -th, (k ₂ +2) -th steps and in other subsequent measures, these summation operations ∑R _hn1i , ∑R _hn2j continue, i.e. the energy values R _pn1i and R _pn2j are summarized respectively and stored for subsequent accumulation with other R _pn1i and R _pn2j in subsequent clock cycles. In the (k ₁ +1) th, (k ₂ +1) th clocks of the verification device, the numbers N _{k1 + 1} , N _{k2 + 1 of the} subchannels that came in the first (extrapolated to k ₁ and k ₂ measures) and the second (identified in the (k ₁ +1) -th, (k ₂ +1) -th steps) inputs, and if these numbers coincide, i.e.: (N _{k1 + 1} ) ₁ = (N _{k1 +1} ) ₂ and (N _{k2 + 1} ) ₁ = (N _{k2 + 1} ) ₂ (blocks 21, 22), then the signal “1” comes from the output of the verification devices to the inputs of the channel drives, and if they do not match, then the signal “ 0 ". Arithmetic accumulators accumulate (summarize) signals “1” and “0” during respectively h ₁ = l ₁ , h ₂ = l ₂ clock cycles of extrapolation of subchannel numbers (blocks 23, 24). If these amounts exceed the thresholds P _h1 and P _h2 for this number of ticks: $${\displaystyle \sum _{l_{\mathrm{one}}}\text{'}\text{'}\text{'}\text{'}\mathrm{one}\text{'}\text{'}\text{'}\text{'},\text{'}\text{'}\text{'}\text{'}0\text{'}\text{'}\text{'}\text{'}\ge P_{h\mathrm{one}}}$$

, $${\displaystyle \sum _{l_2}\text{'}\text{'}\text{'}\text{'}\mathrm{one}\text{'}\text{'}\text{'}\text{'},\text{'}\text{'}\text{'}\text{'}0\text{'}\text{'}\text{'}\text{'}<figure-callout\; id="2"\; label="\ge \; P\; h"\; filenames="00000071.png,00000073.png"\; state="\{\{state\}\}">\ge \; </figure-callout>P_h{2}_{}}$$

, (according to the laid-down majority rule: P _h1 = M ₁ l ₁ , P _h2 = M ₂ l ₂ , - where M ₁ , M ₂ are the majority coefficients for the 1st and 2nd channels (blocks 25, 26), then the output of channel drives receives a signal (“our ₁ ”) ₁ , (“our ₁ ”) ₂ to the corresponding channel keys. If these inequalities are not satisfied, extrapolation continues (blocks 17, 19 ... 26) without issuing these signals to the beat, at which these inequalities will be satisfied.

This controls extrapolation based on the extrapolation factor of subchannel numbers.

, $${\displaystyle \sum _{l_2}{R}_{чп2j}}$$

в каналах (блок 20), и если накопленные эти энергии пиков превысят за это число тактов заданные пороги П₁, П₂ (блоки 27, 28): $${\displaystyle \sum _{l_1}{R}_{чп1i}}\ge {П}_1$$

, $${\displaystyle \sum _{l_2}{R}_{чп2j}}\ge {П}_2$$

, то на выходах канальных накопителей появляются сигналы («наш₂»)₁, («наш₂»)₂. Если же эти условия (блоков 27, 28) не выполнятся, то накопление энергий $${\displaystyle \sum _{l_1}{R}_{чп1i}}$$

, $${\displaystyle \sum _{l_2}{R}_{чп2j}}$$

будет продолжено (блок 18) до такта, при котором эти условия будут выполнены.For the same number of clock cycles h ₁ = l ₁ , h ₂ = l _{2 the} energy is stored $${\displaystyle \sum _{l_{\mathrm{one}}}{R}_{hP\mathrm{one}i}}$$

, $${\displaystyle \sum _{l_2}{R}_{hP2j}}$$

in the channels (block 20), and if the accumulated these peak energies exceed the set thresholds P ₁ , P ₂ (blocks 27, 28) for this number of clock cycles: $${\displaystyle \sum _{l_{\mathrm{one}}}{R}_{hP\mathrm{one}i}}\ge P_{\mathrm{one}}$$

, $${\displaystyle \sum _{l_2}{R}_{hP2j}}\ge {\mathrm{<figure-callout\; id="2"\; label="P"\; filenames="00000071.png,00000073.png"\; state="\{\{state\}\}">P</figure-callout>}}_2$$

, then at the outputs of the channel drives appear signals ("our ₂ ") ₁ , ("our ₂ ") ₂ . If these conditions (blocks 27, 28) are not satisfied, then the accumulation of energies $${\displaystyle \sum _{l_{\mathrm{one}}}{R}_{hP\mathrm{one}i}}$$

, $${\displaystyle \sum _{l_2}{R}_{hP2j}}$$

will continue (block 18) until the beat at which these conditions are met.

, $${\displaystyle \sum _{l_2}{R}_{чп2j}}$$

.This is how extrapolation control is implemented by the factor of accumulation level $${\displaystyle \sum _{l_{\mathrm{one}}}{R}_{hP\mathrm{one}i}}$$

, $${\displaystyle \sum _{l_2}{R}_{hP2j}}$$

.

This concludes the extrapolation sub-stage and, in general, the search and discovery phase.

Phase synchronization.

Signals (“our ₁ ”) ₁ , (“our ₁ ”) ₂ , (“our ₂ ”) ₁ , (“our ₂ ”) _2, regardless of the times at which each of them appeared, are stored as potential signals on their tires, i.e. at the inputs of the corresponding shapers (keys) of signals “our ₁ ”, “our ₂ ”, which appear at the outputs of these shapers (keys) with the simultaneous presence of signals (“our ₁ ”) ₁ , (“our ₁ ”) ₂ at the inputs of one shaper and (“our ₂ ”) ₁ , (“our ₂ ”) ₂ at the inputs of another shaper (blocks 29, 30). The signals "our ₁ ", "our ₂ " are fed to the first inputs of the keys 12 (the number of which is l ₁ and l ₂ for the 1st and 2nd channels, respectively), opening them. Through a specific public key 12, the second input of which receives at this time a signal from a specific output of the central digital comparators of the 1st and 2nd channels, corresponding to the number of the subchannel N _k1 , N _k2 with a private peak R _ch1 and R _ch2 at its output, a signal is supplied to a specific input of the shift calculators from ₁ and ₂ (block 31, 32). These subchannel numbers correspond to the values of i _max , j _max clock shifts of the producing components PK-1, PK-2 (N _k1 = i _max N _k2 = j _max ), which are used to calculate the necessary clock shifts c ₁ and c ₂ according to (1) producing components PK-1, PK-2 and thereby establishing the necessary total clock shift C according to (2), thereby eliminating the time mismatch between the received and reference PNP. The values of ₁ and c ₂ select the corresponding (i = c ₁ ) -e and (j = c ₂ ) -e automorphisms of the producing components PK-1, PK-2, which are supplied to the driver (generator) of the reference PNP. Thus, the reference PNP is formed with a delay C, thereby ensuring synchronism with the incoming PNP in the control circuit. The reference PNP is fed to the second input of the control circuit, and the input PNP is fed to the first input of this control circuit, where they are correlated and checked against the threshold R of _the main peak of the PVKF PNP. The decision to capture the signal PNP (SRS) for the delay is taken to exceed R _{then the} main peak PVKF PNP. Otherwise, the search continues with the new period of the accepted CDS.

To implement the proposed method, the known device [8] with the above similar characteristics was introduced: in each processing channel, the reference sequence generator is made in the form of a generator of all possible automorphisms l ₁ and l ₂ (cyclic shifts) issued in parallel to the group of second l ₁ and l ₂ outputs, respectively, and issued on the first output of one of the automorphisms of the reference sequence of the producing repeating component of length l ₁ and l _2, respectively, as well as the following are introduced: a block of digital sub-correlators (BCPC), which содержит contains, respectively, for each channel, l ₁ and l ₂ sub-correlators, each of which contains: a series-connected acoustoelectronic convolver (AEC), one input of which is the first input of the sub-correlator and connected to the first input of the processing channel, and the second input is the second input of the sub-correlator and connected with one of the second outputs of the reference sequence generator; an amplifier and an analog-to-digital converter (ADC), the output of which is a parallel output bus and is the output of the sub-correlator and the corresponding output of the BCCP, the outputs of which are a parallel output bus, are connected to the corresponding inputs of the accumulation and extrapolation circuit (SES), which contains respectively one and the other channel processing for l ₁ and l ₂ subchannels search, respective inputs of which are SNE inputs and outputs connected to respective first inputs tsentralnog a digital comparator (TSTSK) having a first input connected to the output of the first switch, al ₁ and l ₂ outputs (respectively for one and other channels) are respectively connected to the inputs of a digital adder and a first input key unit key (BK) containing respectively l ₁ l and ₂ key, the second inputs of which are connected to the output of the first key, and outputs key BK are connected to respective inputs of the calculator shifts respectively c ₁ and c _2, the output of which is the output of the PSR and treatment channel and is connected to the input of the corresponding gene Ator reference sequence, and the output of the digital adder is connected to one input of the first switch, the other input of which is connected to the output-adder accumulator having an input coupled to the output verification unit constituting unit (a set of) two-input AND gates, the first l ₁ (u l ₂ ) whose inputs are connected to the corresponding outputs of the CCC and the inputs of the subchannel number selection block (BCH), which is a cross-block and a delay unit per cycle connected in series, l ₁ (and l ₂ ) of the outputs of which are connected to the second l ₁ (and l ₂ ) inputs of the verification unit; moreover, each search subchannel (PKP) of the accumulation and extrapolation (SNE) circuit contains a digital parallel adder, the first inputs of which are connected to the corresponding bus of the BCPC parallel outputs, and the second inputs are connected respectively to the outputs of the corresponding coincidence elements, the first inputs of which are clock, the second inputs are connected respectively, with the outputs of random access memory (RAM), the inputs of which are connected to the outputs of the digital parallel adder and the corresponding first inputs of the second a beam, the second input of which is connected to the output of the first counter, the input of which is clock, and the input of the second counter, the output of which is connected to one input of the AND circuit, the output of which is connected to the control panel output, and the second input is connected to the output of the digital comparator, the inputs of which are connected to the outputs of the second key.

The scheme of the proposed search device CPC that implements the proposed method is presented in figure 10 a, b. The search is carried out by two processing channels that are simultaneously identical in structure to the first and second producing components (PC-1, PC-2), as well as the synchronism control circuit 3 for delay and the derivative signal generator 4 (GPS) common to these channels. Each processing channel contains respectively: a block of digital sub-correlators (BTsPK) 16 (BTsPK ₁ ) and 1 (BTsPK ₂ ); reference sequence generator (GOP) 5 (GOP ₁ ) and 2 (GOP ₂ ); accumulation and extrapolation (CHE) scheme 17 (CHE ₁ ) and 18 (CHE ₂ ). Each BTsPK (BTsPK ₁ , BTsPK ₂ ) contain sub-correlators (RCC) 6 (for the 1st channel of sub-correlators l ₁ (6 ₁ , ..., 6 _l1 ), for the 2nd channel - l ₂ (6 ₁ , ..., 6 _l2 )), while each sub-correlator contains an acoustoelectronic convolver (AEC) 6-1, an amplifier (US) 6-2, an analog-to-digital converter (ADC) 6-3. Each SNE (SNE ₁ , SNE ₂ ) contains: search subchannels (PKP) 7 (for the 1st channel of the search subchannels l ₁ (7 ₁ , ..., 7 _l1 ), for the 2nd channel - l ₂ (7 ₁ , ... , 7 _l2 )); central digital comparator (CCC) 8; key 9; a subchannel number selection unit (BCH) 10, comprising a cross-block 10-1 and a block of delay lines (BLZ) 10-2; storage adder (NS) 11; a key block (BC) 12, containing l ₁ and l ₂ keys, respectively, for the 1st and 2nd channels; verification device (UP) 13; digital adder (CA) 14; delay calculator 15 c ₁ and c _2, respectively, for the 1st and 2nd channels. Each search subchannel (PKP) contains: a parallel adder (PS) 19, random access memory (RAM) (consisting of memory elements 21), each line of which has such a number of elements 21 that allows you to digitally store the maximum level of PVKF, and each column contains N memory elements, moreover, for the 1st channel, N = l ₁ , and for the 2nd channel, N = l ₂ ; counter 20; key 22; digital comparator (CC) 23; scheme "And"24; counter 25; match patterns 26.

The result of each processing channel is the determination of the values of c ₁ and ₂ cyclic shifts of the producing components PC-1 and PC-2, i.e. definition of those automorphisms (cyclic shifts) for GOP; (5) and GOP% (2), which will be issued at their first outputs in the GPS (4) at the synchronization control stage to ensure that the generator 4 generates a reference derivative signal with the resulting central offset C eliminating the delay mismatch.

A description of the operation of the device is feasible taking into account the algorithm of its operation described above, as well as the fact that the operation of each channel is essentially the same.

1. Sub-stage of primary accumulation.

In each channel to one input of each AEC 6-1 podkorrelyatora 6 receives the received signal S in the form _Rin (repeated in time in the general case) CDS manipulated EOR (CPC-PFP) and the other inputs of the respective AEC 6-1 receives in counter -inverse mode from the second corresponding (ix and j-x) outputs of the generators 2 and 5, the reference signals S _support1 and S _supportjl2 , which are signals manipulated by generating lines (repeating cyclically) of the ith and jth automorphisms of the generating components, respectively, PC 1 and PC-2. With each clock cycle, from each i-th and j-th AEC 6-1 of the 1st and 2nd channels, respectively, the voltage is proportional to the energy of the convolution of segments of lengths l ₁ and l ₂ moving towards each other support lines S _support1 and S _supportjl2 and S _in . The output signals of the AEC are amplified by amplifiers 6-2 and are converted to an ADC 6-3 with a sampling frequency equal to the frequency of the SRP, so that from the outputs of the ADC 6-3 we get the digitized values of the partial PVKF-1 _i and PVKF-2 _j . The first values of these private PVKF (clock cycles k ₁ = k ₂ = 1) through parallel adders (PS) 19 are unchanged (since at this moment nothing has yet arrived from the outputs of RAM 21 to the other inputs of the PS) are written in the first bits (elements memory 21) of RAM registers 21. The total number of registers (the number of memory elements in the line) RAM should correspond to the number of bits of the maximum accumulated value of PVKF. The number of N digits in the registers is equal to the number of shifts for which private PVKF will accumulate, i.e. for the 1st channel N = l ₁ , and for the 2nd channel N = l ₂ .

For the first l ₁ and l ₂ clock cycles, respectively, for the 1st and 2nd channels, the AEC of the sub-correlators is initially filled with its automorphisms PK-1 and PC-2 from the corresponding second outputs of the generators, respectively, 5 and 2. And starting from clock cycles k ₁ = l ₁ = 0 (mod l ₁ ) and k ₂ = l ₂ = 0 (mod l ₂ ) respectively for the 1st and 2nd channels, a primary accumulation sub-stage is carried out.

With each clock cycle (k ₁ , k ₂ ), the RAM register 21 cells through the PS 19 are simultaneously filled with new PVKF digital values so that after l ₁ clock cycles and l ₂ clock cycles in the 1st and 2nd channels, respectively, cells 1 ... N of RAM 21 of all search sub-channels of the control panel _i , the panel _j will be filled with l ₁ , l _2, respectively, with the values of the automorphic quotients PVKF-1 _i , PVKF-2 _j . In the next clock cycle (k ₁ , k ₂ ), the values of automorphic partial PVKF obtained from the outputs of the BCPC 16 are summed up in PS 19 with the values of these PVKF located in the last N-th line of RAM memory cells, due to the elements 26 opening by the clock pulse , and this sum of the PVKF values enters the first line of RAM 21. In subsequent cycles, similar summation of the values of the automorphic partial PVKF takes place and these sums move along the RAM lines until the analysis time for the 1st and 2nd channels _ends , respectively, T _an1 , T _an2 .

So, in the first line of RAM 21 of each control panel 7, the first maximum R _pn1 (and R _pn2 ) may appear through l ₁ (and l ₂ ) initial clocks, i.e. at the moment k ₁ = l ₁ = 0 (mod l ₁ ) (and k ₂ = l ₂ = 0 (mod l ₂ )), and only after another l ₁ (and l ₂ ) clocks the possible primary maximum will add up with the second ( according to the account) with a similar maximum through elements 26 in PS 19. Counter 20 is full for l ₁ (and l ₂ ) clock cycles before the analysis time _ends T _an1 = p ₁ · l ₁ , T _an2 = p ₂ · l ₂ ; respectively in the 1st and 2nd channel. The key 22 is opened for l ₁ (and l ₂ ) clocks before the analysis time T _an1 and (T _an2 ) by the overflow signal from the counter 20 passes and passes to the input of the digital channel of the CC 23 in each i-th (and j-th) control panel 7 the first value of the accumulated private subchannel sum of PVKF _1ik1 , PVKF _2jk2, respectively, R _∑1ia1 , R _∑2ja2 . The same overflow signal from counter 20 starts the counter 25 of the number of subsequent l ₁ (and l ₂ ) clock cycles.

, $$R_{{\displaystyle \sum 2j(a2=T_{ан2})}}$$

на соответствующий первый параллельный i-й (i=1,…, l₁) и j-й (j=1,…, l₂) вход центрального цифрового компаратора 8. Таким образом, со всех ЦК 23 всех ПКП 7 на выходы центрального цифрового компаратора ЦЦК 8 в соответствующий концу времени анализа Т_ан1 поступают частные суммы R_∑1i,Tан1. ЦЦК 8 осуществляет: 1) суммирование значений, накопленных за Т_ан1 и Т_ан2 в каждом подканале ПКП 7 обоих каналов частных «подканальных» сумм $${\displaystyle \sum _{i=1}^{l1}{R}_{{\displaystyle \sum 1i,Тан1}}=S_1}$$

, $${\displaystyle \sum _{j=1}^{l2}{R}_{{\displaystyle \sum 2j,Тан2}}=S_2}$$

, и если это значение S₁≥S_п1, S₂≥S_п2, то 2) ЦЦК 8 выбирает «максимум максиморум» - экстремум Э₁=(R_∑1ia1)_max, Э₂=(R_∑2ja2)_max из определенных ПКП 7 обоих каналов и выдает по соответствующему номеру этого ПКП 7, своему выходу на соответствующий вход БВНП 10 сигнал, который отражает номер N_k1 (и N_k2) ПКП 7, в котором зафиксирован экстремум Э₁ (и Э₂). Если S₁<S_п1 (и S₂<S_п2), то процесс первичного накопления продолжается при другом числе p₁ (и p₂), пока не выполнится данное условие. На этом заканчивается подэтап первичного накопления. Этот подэтап при сохранении заданного уровня отношения сигнал-шум для принятия решения, как и для прототипа, будет уменьшен во времени в l₁ раз (для 1-го канала) и в l₂ раз (для 2-го канала).This first value (R _∑1ia1 ) ₁ (and (R _∑2ja2 ) ₁ ) in the Central Committee 23 is stored as a reference value, with which the next second, accumulated private “subchannel” sum (R _∑1ia1 ) ₂ (and (R _∑2ja2 ) ₂ ). The first and second values of these amounts are compared in the Central Committee 23 and as a reference, the larger of these values is selected. So, in subsequent ticks, each CK 23 selects the highest _individual subchannel sum R _∑1ia1 for l ₁ clock cycles in channel 1 in the i-th control panel 7 and the sum R _{∑ 2ja2} in the j-th control panel 7 in channel 2. This selection ends when the counter 25 overflows through l ₁ (and l ₂ ) clock cycles. Counter overflow signal 25 opens coincidence circuit 24, which passes the last (maximum) reference value from the output of the i-th (and j-th) CC 23 in the parallel code to the output of the control panel 7 $$R_{{\displaystyle \sum \mathrm{one}i(a\mathrm{one}=T_{\mathrm{but}n\mathrm{one}})}}$$

, $$R_{{\displaystyle \sum 2j(a2=T_{\mathrm{but}n2})}}$$

to the corresponding first parallel i-th (i = 1, ..., l ₁ ) and j-th (j = 1, ..., l ₂ ) inputs of the central digital comparator 8. Thus, from all CC 23 of all control panels 7 to the outputs of the central digital comparator CCC 8 at the corresponding end of the analysis time T _en1 receives the partial amounts R _{∑1i, Tan1} . CCC 8 carries out: 1) summation of the values accumulated for T _an1 and T _an2 in each subchannel of the control panel 7 of both channels of private “subchannel” amounts $${\displaystyle \sum _{i=\mathrm{one}}^{l\mathrm{one}}{R}_{{\displaystyle \sum \mathrm{one}i,T\mathrm{but}n\mathrm{one}}}=S_{\mathrm{one}}}$$

, $${\displaystyle \sum _{j=\mathrm{one}}^{l2}{R}_{{\displaystyle \sum 2j,T\mathrm{but}\mathrm{<figure-callout\; id="2"\; label="n"\; filenames="00000071.png,00000073.png"\; state="\{\{state\}\}">n</figure-callout>}2}}={\mathrm{<figure-callout\; id="2"\; label="S"\; filenames="00000071.png,00000073.png"\; state="\{\{state\}\}">S</figure-callout>}}_2}$$

, and if this value is S ₁ ≥S _n1 , S ₂ ≥S _n2 , then 2) CCM 8 selects the “maximum maximum” - the extremum = ₁ = (R _ia1ia1 ) _max , _{2 2} = (R _∑2ja2 ) _max from certain The control panel 7 of both channels and generates a signal that corresponds to the number N _k1 (and N _k2 ) of the control panel 7, in which the extremum of E ₁ (and E ₂ ) is detected, by the corresponding number of this control panel 7, to its output to the corresponding input of BVNP 10 If S ₁ <S _p1 (and S ₂ <S _p2 ), then the process of primary accumulation continues with a different number p ₁ (and p ₂ ) until this condition is satisfied. This concludes the primary accumulation sub-stage. This sub-step, while maintaining a given level of signal-to-noise ratio for decision making, as for the prototype, will be reduced in time by l ₁ times (for channel 1) and l ₂ times (for channel 2).

2. Sub-stage of extrapolation. BVNP 10 based on the received number N _k (N _k1 for channel 1 N _k2 for channel 2), control panel 7 transmits this signal with a delay of one clock cycle in the delay block in the form of a signal at its specific input (N _k ) 10-2 through a cross-connection (cross-block 10-1), which implements the corresponding dependencies N _{k1 + 1} = f ₁ (N _k1 , l ₁ , k ₁ ) and N _{k2 + 1} = l ₂ (N _k2 , l ₂ , k ₂ ), to its own output N _{k + 1} , which corresponds to the number N _{k + 1} / PKP, in which the next (close to the extremum in value) maximum of the private peak should be observed in the next (k + 1) -th beat PVKF R _PP1 and (R _PP2 ).

The number N _{k + 1} calculated in this way in BVNP 10, i.e. the predicted (extrapolated) number N _{k + 1} in the form of a signal from one of the outputs of the BVNP 10, corresponding to N _{k + 1} , is supplied to one of the first inputs of the verification device UP 13 and stored until the next clock step k + 1. At the moment of the k-th, (k + 1) -th and other clock cycles after them, from the corresponding N _k , N _{k + 1} and other outputs of CCC 8, a parallel code is received on the CC 14 that carries information in the digital code on the energy of the partial maximum bursts R _{pn1 of the} side peaks of PVKF at the outputs of N _k , N _{k + 1-} m and other control panels 7. These energy values are summed and stored for subsequent accumulation with other bursts in subsequent cycles. At the same (k + 1) th clock moment, from the corresponding N _{k + 1-} th output of CCC 8, a signal arrives at the selected N _{k + 1-} th control panel with the maximum peak of PVKF at one of the second inputs of UP 13.

UP 13 compares the control panel numbers corresponding to the number N _{k + 1} , which came from one of the first inputs and one of the second inputs of UP 13. If these numbers coincide, then the symbol “1” comes from the output of the UP 13 to the input of the accumulator-accumulator NS 11, and if the numbers do not match, then - the symbol "0". NS 11 arithmetically accumulates the symbols “1” and “0”, summarizes them (as potential signals) for a certain number of clock cycles h = l ₁ , and if this sum exceeds a predetermined threshold П _h for this number of clock cycles (according to the established majority principle: П _h = 2l _1/3 or P _h = 3l _1/5 or P _h = 7l _1/11 and so on, i.e. P _h = (M * l _1), M - majoritarianism coefficient), then output HC 11 receives the signal "our ₁ " to the first input of the key 9.

During the same number of clock cycles h = l _{1, the} CA 14 accumulates the energy of the amplitudes of the bursts of the partial maximum lateral peaks R _{pn1 of the} PVKF from each PKP 7 in which this maximum was detected. And if with the sum ∑R _chpi , the set threshold (GP) in the CA 14 after the expiration of the h-cycles will be exceeded (∑R _chpi > GP), then the signal “our ₂ ” is received from the output of the CA 14 to the 2nd input of the key 9. Key 9 is unlocked when both of its inputs from the outputs of the unitary enterprise and the central office received the signals “our ₁ ” ₁ and “our ₁ ” _2, respectively. Thus, the output signal of key 9 receives the signal “our ₁ ” (in the second channel, the signal “our ₂ ”) (signal “that the prediction is correct”) to the 2nd input of CCC 8 for locking it in the next clock cycle, and then to the first inputs keys 12.

, в котором в этот момент будет максимальный боковой всплеск R_чп1, и определяет i_max=N_k1 (для 1-го канала) и j_max=N_k2 (для 2-го канала), значение которых используется при вычислении c₁ и с₂, согласно соотношению (1), производящих компонент ПК-1, ПК-2 и тем самым установления необходимого общего тактового сдвига С согласно соотношению (2). А ЦЦК 8, как и было сказано выше, запирается в момент h+1=l₁+1 и прекращает выдачу выбранных номеров N_k.3. The synchronization phase. Under the action of the signal "our ₁ " and "our ₂ " keys 12 go into the open state. And through a certain key 12, to the second input of which a signal from a certain output of CCC 8 arrives at this time, a signal passes to a certain input of the calculator c ₁ 15 corresponding to N _k with a maximum R _pn1 , i.e. the value of N _k per cycle (h = l ₁ ), which will determine the value of the cyclic shift from ₁ for PC-1 relative to the received PNLRP, because sub channel number _k $$P\mathrm{TO}{P}_{i=N_k}$$

, in which at this moment there will be a maximum lateral burst R _pn1, and determines i _max = N _k1 (for the 1st channel) and j _max = N _k2 (for the 2nd channel), the value of which is used in the calculation of c ₁ and s ₂ , according to the relation (1) producing the components PK-1, PK-2 and thereby establishing the necessary total clock shift C according to relation (2). And CCC 8, as mentioned above, is locked at the moment h + 1 = l ₁ +1 and stops issuing the selected numbers N _k .

Next, the obtained value of c ₁ goes to the generator 5 GOP-1, which gives on its first output to GPS 4 an automorphism of the generating component PK-1, corresponding to a shift from ₁ .

Similarly, the search, detection and synchronization process takes place in the search channel for PC-2, but instead of c ₁ , c _{2 is} calculated, which is fed to the GOP-2 generator 2 to form PC-2 with a cyclic shift c ₂ .

The symbols of the generated PC-1 and PC-2 (automorphisms PC-1 and PC-2 corresponding to numbers ₁ and _{2 of} cyclic shifts) are summed modulo 2 in GPS-4 and thereby provide a reference PNLRP with the resulting shift C eliminating the mismatch in the delay between the received and reference signals when checking the fact of synchronism in the control circuit 3. So the synchronization stage ends.

Figure 1 shows a model of the rule of formation of the PNP.

при тех же условия (фиг.2, б).Figure 2 shows the dependences: the average sample accumulated value R _∑1ia1 , private automorphic PVKF _1i PNP with L = 143 = l ₁ · l ₂ , (l ₁ = 11, l ₂ = 13) with automorphisms i PC l ₁ for all possible the values i = 0, ..., l ₁ on the periods of the run of the oil recovery, equal to p = 1, ..., 15, i.e. for p ₁ = 13, ... 39 runs of PC-1 with l ₁ (figure 2, a) and the average sample value of the sum $$S_{\mathrm{one}}={\displaystyle \sum _{i=\mathrm{one}}^{l_{\mathrm{one}}}{R}_{{\displaystyle \sum \mathrm{one}ia\mathrm{one}}}}$$

under the same conditions (Fig.2, b).

Figure 3 shows a table of values of PVKF PNP of various types with producing rulers.

Figure 4 shows graphs of the dependence of the general PVKF PNP type K3K3 with its copies for some lengths L = l ₁ · l ₂ .

Figure 5 shows the dependency graphs: private PVKF PNP type K3K3 of length L = 77 with producing rulers made up of KKV l ₁ = 7, l ₂ = 11 (figure 5, a); private PVKF PNP type K1K1 of length L = 221 with producing rulers composed of CCV l ₁ = 13, l ₂ = 17 (Fig. 5, b); private PVKF PNP type K1K3 of length L = 323 with producing rulers composed of CCV l ₁ = 17, l ₂ = 19 (Fig. 5, c); private PVKF PNP type K3K1 of length L = 143 with producing rulers composed of CCL l ₁ = 11, l ₂ = 13 (Fig. 5, d).

Figure 6 shows a numerical model of obtaining simultaneously parallel to the automorphic partial PVKF incoming PNP (with L = l ₁ · l ₂ = 7 · 11 = 77) with automorphisms (cyclic shifts) of the generating component (PC) with l ₁ = 7.

Figure 7 shows a computer model of private automorphic PVKF PNP with its automorphisms (cyclic shifts) of the PC with l ₂ = 17 for the length of the PNP L = l ₁ · l ₂ = 221, l ₁ = 13.

On Fig depicts an algorithm for accelerated search and operation of the search device.

Figure 9 shows the correlation order of the segments of the incoming PNP and the reference signal (PC) on two adjacent processing clocks.

Figure 10 a), b) shows a diagram of a search device CPC, manipulated PNP.

Figure 11 shows the dependences of the equivalent linear complexity l _{S of} different types of PNP (K3K1, K3K3, K1K3, K1K1) and known linear PSP (Gold, Kasami, M-sequence) on their length L.

Figure 12 shows the dependences of the probabilities of successful delay synchronization on the degree of distortion of the received signal (in percent of the total number of SRP symbols) for the PNP lengths L = 77 and various L * = L · K, K = 5, 10, 100, 1000 at using the prototype method with 32 runs of PNP lengths (dashed lines) and when using the proposed method with one and three runs of PNP lengths.

The possibility of realizing the advantages of the proposed method on the basis of the proposed device is confirmed by the following technical indicators and their digital values:

1) the results of simulation modeling of the accumulation of PVKF segments of the received SRS-PNP with updated (with each clock bandwidth) segments of the supporting production line. The process of inter-correlation in the AEC of the segments of the received and reference signals at two adjacent processing clocks is illustrated in Fig. 9 (θ ₁ and θ ₂ are the integration time of the AEC, τ _e is the duration of the elementary PNP symbol).

, $$R_{{\displaystyle \sum 2j{a}_2=Tа{н}_{1/2}}}$$

и канальных сумм S₁ и S₂, что подтверждается приведенными на фиг.2 зависимостями, которые демонстрируют, что уже при числе прогонов всей ПНП не более 3-х имеется выраженный рост и R_∑1i, R_∑2j и главное - ярко выраженный рост S₁ и S₂ над уровнем помех. Это подтверждается и выражениями: значения накопленных частных ПВКФ в каждом подканале поиска 1-го и 2-го каналов соответственно2) the possibility of reliable selection at the sub-stage of the primary accumulation of accumulated private sub-channel amounts $$R_{{\displaystyle \sum \mathrm{one}i{a}_{\mathrm{one}}=T\mathrm{but}{n}_{\mathrm{one}}}}$$

, $$R_{{\displaystyle \sum 2j{a}_2=T\mathrm{but}{n}_{\mathrm{one}/2}}}$$

and channel sums S ₁ and S ₂ , which is confirmed by the dependences shown in Fig. 2, which demonstrate that even with the number of runs of the entire EOR not more than 3, there is a pronounced increase and R _{∑ 1i} , R _{∑ 2j} and, most importantly, pronounced growth S ₁ and S ₂ above the interference level. This is also confirmed by the expressions: the values of the accumulated private PVKF in each search subchannel of the 1st and 2nd channels, respectively

, $$R_{{\displaystyle \sum \mathrm{one}ia\mathrm{one}=T\mathrm{but}n\mathrm{one}}}=\frac{\mathrm{one}}{l_{\mathrm{one}}}\cdot {\displaystyle \sum _{k_{\mathrm{one}}=0}^{l_{\mathrm{one}}\cdot p_{\mathrm{one}}/l_{\mathrm{one}}-\mathrm{one}}R(c_{[l_{\mathrm{one}}\cdot p_{\mathrm{one}}-(k_{\mathrm{one}}\cdot l_{\mathrm{one}}+\mathrm{one})\mathrm{mod}{l}_{\mathrm{one}}]},c{\mathrm{one}}_{(k_{\mathrm{one}}\cdot l_{\mathrm{one}}+\mathrm{one})})}$$

,

, $$R_{{\displaystyle \sum 2ja2=T\mathrm{but}\mathrm{<figure-callout\; id="2"\; label="n"\; filenames="00000071.png,00000073.png"\; state="\{\{state\}\}">n</figure-callout>}2}}=\frac{\mathrm{one}}{{\mathrm{<figure-callout\; id="2"\; label="l"\; filenames="00000071.png,00000073.png"\; state="\{\{state\}\}">l</figure-callout>}}_2}\cdot {\displaystyle \sum _{{\mathrm{<figure-callout\; id="2"\; label="k"\; filenames="00000071.png,00000073.png"\; state="\{\{state\}\}">k</figure-callout>}}_2=0}^{{\mathrm{<figure-callout\; id="2"\; label="l"\; filenames="00000071.png,00000073.png"\; state="\{\{state\}\}">l</figure-callout>}}_2\cdot {\mathrm{<figure-callout\; id="2"\; label="p"\; filenames="00000071.png,00000073.png"\; state="\{\{state\}\}">p</figure-callout>}}_2/l_2-\mathrm{one}}R(c_{[{\mathrm{<figure-callout\; id="2"\; label="l"\; filenames="00000071.png,00000073.png"\; state="\{\{state\}\}">l</figure-callout>}}_2\cdot p_2-({\mathrm{<figure-callout\; id="2"\; label="k"\; filenames="00000071.png,00000073.png"\; state="\{\{state\}\}">k</figure-callout>}}_2\cdot {\mathrm{<figure-callout\; id="2"\; label="l"\; filenames="00000071.png,00000073.png"\; state="\{\{state\}\}">l</figure-callout>}}_2+\mathrm{one})\mathrm{mod}{l}_2]},c{2}_{({\mathrm{<figure-callout\; id="2"\; label="k"\; filenames="00000071.png,00000073.png"\; state="\{\{state\}\}">k</figure-callout>}}_2\cdot {\mathrm{<figure-callout\; id="2"\; label="l"\; filenames="00000071.png,00000073.png"\; state="\{\{state\}\}">l</figure-callout>}}_2+\mathrm{one})})}$$

,

where [·], (+) - number of clock cycles of the segment relative to the initial random shifting, R (with _[], c1 _(·)) and R (with _[], c2 _(·)) - relative values PVKF between the segments c _[·] Of length l ₁ and l _{2 of the} received CPC-PNP and segments c1 _[·] , c2 _{[·] of} the same lengths of the supporting generating lines of automorphisms PK-1, PK-2,

- the values of the sums S ₁ and S _{2 of the} accumulated private subchannel amounts PVKF _1ik1 , PVKF _2jk2 :

; $$S_2={\displaystyle \sum _{j=1}^{l_2}{R}_{{\displaystyle \sum 2ja2=T_{ан2}}}}$$

; $$S_{\mathrm{one}}={\displaystyle \sum _{i=\mathrm{one}}^{l_{\mathrm{one}}}{R}_{{\displaystyle \sum \mathrm{one}ia\mathrm{one}=T_{\mathrm{but}n\mathrm{one}}}}}$$

; $${\mathrm{<figure-callout\; id="2"\; label="S"\; filenames="00000071.png,00000073.png"\; state="\{\{state\}\}">S</figure-callout>}}_2={\displaystyle \sum _{j=\mathrm{one}}^{l_2}{R}_{{\displaystyle \sum 2ja2=T_{\mathrm{but}\mathrm{<figure-callout\; id="2"\; label="n"\; filenames="00000071.png,00000073.png"\; state="\{\{state\}\}">n</figure-callout>}2}}}}$$

;

и $$P_{{\displaystyle \sum 2{Э}_2}}$$

правильного выбора экстремумов Э₁=(R_∑1ia1)_max, Э₂=(R_∑2ja2)_max из l₁ и l₂ значений определяется для каждого подканала поиска 1-го и 2-го каналов:- probabilities $$P_{{\displaystyle \sum \mathrm{one}{E}_{\mathrm{one}}}}$$

and $$P_{{\displaystyle \sum 2{\mathrm{<figure-callout\; id="2"\; label="E"\; filenames="00000071.png,00000073.png"\; state="\{\{state\}\}">E</figure-callout>}}_2}}$$

the correct choice of extrema _{1 1} = (R _{∑ 1ia1} ) _max , _{2 2} = (R _{∑ 2ja2} ) _max of l ₁ and l ₂ values is determined for each search subchannel of the 1st and 2nd channels:

, $$P_{{\displaystyle \sum \mathrm{one}{E}_{\mathrm{one}}}}={\displaystyle \underset{0}{\overset{\infty }{\int }}f(R_{{\displaystyle \sum 10}})\left[{\displaystyle \prod _{i=\mathrm{one}}^{l_{\mathrm{one}}}{\displaystyle \underset{-\infty }{\overset{R{\displaystyle \sum 10}}{\int }}f(R_{{\displaystyle \sum \mathrm{one}i}})\cdot d{R}_{{\displaystyle \sum \mathrm{one}i}}}}\right]}{d}_{R_{{\displaystyle \sum 10}}}$$

,

, $$P_{{\displaystyle \sum 2{\mathrm{<figure-callout\; id="2"\; label="E"\; filenames="00000071.png,00000073.png"\; state="\{\{state\}\}">E</figure-callout>}}_2}}={\displaystyle \underset{0}{\overset{\infty }{\int }}f(R_{{\displaystyle \sum \mathrm{twenty}}})\left[{\displaystyle \prod _{j=\mathrm{one}}^{{\mathrm{<figure-callout\; id="2"\; label="l"\; filenames="00000071.png,00000073.png"\; state="\{\{state\}\}">l</figure-callout>}}_2}{\displaystyle \underset{-\infty }{\overset{R{\displaystyle \sum \mathrm{twenty}}}{\int }}f(R_{{\displaystyle \sum 2j}})\cdot d{R}_{{\displaystyle \sum 2j}}}}\right]}{d}_{R_{{\displaystyle \sum \mathrm{twenty}}}}$$

,

where f (R _∑10 ), f (R _∑20 ) are the densities of the normal distribution

the probabilities of the values of private PVKF _1i accumulated in the search channels of the first and second channels in synchronism beats with the corresponding PC-1, PC-2; the function f (R _{∑ 1i} ), f (R _{∑ 2j} ) is the density of the normal probability distribution of the PVKF values accumulated in the search subchannels of the 1st and 2nd channels in shift cycles that do not correspond to the synchronism of the PNP segments with the reference PC-1, PC- 2;

3) the possibility of reliable extrapolation of the numbers of subchannels with maximum R _pn1 and R _pn2 :

by the control factor of extrapolation of subchannel numbers:

a) the probability of the correct extrapolation of one subchannel to one i-th and j-th clock of the first and second channels:

, $$P_{N_{2j}}=P_{{\displaystyle \sum 2{Э}_2}}{(1-P_{{\displaystyle \sum 2{Э}_2}})}^{{}_{l_2-1}}$$

; $$P_{N_{\mathrm{one}i}}=P_{{\displaystyle \sum \mathrm{one}{E}_{\mathrm{one}}}}{(\mathrm{one}-P_{{\displaystyle \sum \mathrm{one}{E}_{\mathrm{one}}}})}^{{}_{l_{\mathrm{one}}-\mathrm{one}}}$$

, $$P_{N_{2j}}=P_{{\displaystyle \sum 2E_2}}{(\mathrm{one}-P_{{\displaystyle \sum 2E_2}})}^{{}_{l_2-\mathrm{one}}}$$

;

b) the probability of correct extrapolation of subchannel numbers when using the majority control principle:

, $$P_{N2}=({\displaystyle \sum _{j=1}^{{П}_{h2}}{P}_{N_{2j}}})({\displaystyle \sum _{j=1}^{l_2-{П}_{h2}}(1-P_{N_{2j}})})$$

; $$P_{N\mathrm{one}}=({\displaystyle \sum _{i=\mathrm{one}}^{P_{h\mathrm{one}}}{P}_{N_{\mathrm{one}i}}})({\displaystyle \sum _{i=\mathrm{one}}^{l_{\mathrm{one}}-P_{h\mathrm{one}}}(\mathrm{one}-P_{N_{\mathrm{one}i}})})$$

, $${\mathrm{<figure-callout\; id="2"\; label="P\; N"\; filenames="00000071.png,00000073.png"\; state="\{\{state\}\}">P\; </figure-callout>}}_N=({\displaystyle \sum _{j=\mathrm{one}}^{P_{h2}}{P}_{N_{2j}}})({\displaystyle \sum _{j=\mathrm{one}}^{l_2-P_{h2}}(\mathrm{one}-P_{N_{2j}})})$$

;

by factor of accumulation level control:

a) the probability of correct extrapolation:

; $$P_{УН2}=({\displaystyle \sum _{j=1}^{{П}_2/R_{чп2}}{P}_{N_{2j}}})({\displaystyle \sum _{j=1}^{l_2-{П}_2/R_{чп2}}(1-P_{N_{2j}})})$$

; $$P_{\mathrm{At}N\mathrm{one}}=({\displaystyle \sum _{i=\mathrm{one}}^{P_{\mathrm{one}}/R_{hP\mathrm{one}}}{P}_{N_{\mathrm{one}i}}})({\displaystyle \sum _{i=\mathrm{one}}^{l_{\mathrm{one}}-P_{\mathrm{one}}/R_{hP\mathrm{one}}}(\mathrm{one}-P_{N_{\mathrm{one}i}})})$$

; $$P_{\mathrm{At}\mathrm{<figure-callout\; id="2"\; label="N"\; filenames="00000071.png,00000073.png"\; state="\{\{state\}\}">N</figure-callout>}2}=({\displaystyle \sum _{j=\mathrm{one}}^{{\mathrm{<figure-callout\; id="2"\; label="P"\; filenames="00000071.png,00000073.png"\; state="\{\{state\}\}">P</figure-callout>}}_2/R_{hP2}}{P}_{N_{2j}}})({\displaystyle \sum _{j=\mathrm{one}}^{l_2-{\mathrm{<figure-callout\; id="2"\; label="P"\; filenames="00000071.png,00000073.png"\; state="\{\{state\}\}">P</figure-callout>}}_2/R_{hP2}}(\mathrm{one}-P_{N_{2j}})})$$

;

b) the probability of correct extrapolation of the extrapolation sub-step:

P _E1 = P _H1 · P _UN1 , P _E2 = P _H2 · P _UN2 .

The overall probability of correct synchronization is defined as:

P _OS = P _E1 · P _E2 .

The possibility of providing the proposed method and device for the fast search for SRS for a small number of periods of accumulation of the received signal with a high probability of delay synchronization is confirmed by simulation results (for PNP lengths L = 77 and L * = L · 5 = 385) and shown in FIG. 12 dependences of the probability of successful synchronization of ROS on the degree of distortion of the received signal (as a percentage of the total number of characters of the SRP). A comparison (with equal bases (L) of CPC) of the value of the achieved relative search time, expressed in the number of periods of analysis of the CPC, with a similar indicator for known methods (including the prototype), indicates the advantage of the proposed method in the search time of the CPC for a delay of about 20 -30 times before convolver search [2] using known memory bandwidths, 100 times or more before multi-stage search [2], 100 times or more before sequential cyclic search [2] and 10 or more times before prototype [8].

The implementation of the high imitation resistance of the signals used is confirmed by the dependences of the equivalent linear complexity of different types of PNP (K3K1, K3K3, K1K3, K1K1) and known linear PSP (Gold, Kasami, M-sequence) on their length shown in Fig. 11. The advantage in equivalent linear complexity is from about 5 times or more for the length of the bandwidth L≈2 · 10 ³ and increases with increasing length of the bandwidth. The construction of the claimed device that implements the claimed method of searching for a signal is possible within the signal processor on a modern high-speed element base with a high degree of integration. At high clock frequencies of the PSP f _PSP exceeding the ADC's speed capabilities, the conversion functions can be distributed among several (m) ADCs so that each of them provides a conversion with a sampling frequency f _PSP / _m . Digital comparators can be implemented using microchips such as full adders. The RAM based on the shift registers has sufficient speed and does not require special distribution and switching devices. The NLRP reference sequence generators are implemented both on the basis of theoretical and technical methods described in [5, 9] and on direct, patented technical solutions according to A.s .: SU 1401475 A1, SU 1457650 A1, SU 1537022 A1, SU 1470095 A1 , - and the patent of the Russian Federation RU 2024053 C1 [10].

The verification device (13) is a combination of two-input elements And, and the accumulator-adder (11) can be built on the basis of two counters (counter "1" and a clock counter) and comparing (by threshold) device. The remaining elements of the device are known simple elements of discrete technology.

The inventive search device CPC, manipulated by PNP, can be used both independently and to reduce the search time when adding traditional devices that use to detect the fact of synchronism in delay the level of correlation along the entire length of the reference and received signals and implementing the well-known cyclic multi-stage or other search methods. The applicability of this method and search device is primarily associated with the use of CPC, manipulated PNP based on CCV codes. This ensures a high stealth delay synchronization stage, as well as the possibility of operational adaptation of the radio line to the information and interference conditions due to the change with a small discreteness of the length value.

Information sources

1. Varakin L.E. Communication systems with noise-like signals [Text], - M. "Radio and communication", 1985. - 384 p.

2. Zhuravlev V.I. Search and synchronization in broadband systems [Text], V.I. Zhuravlev, M., "Radio and communications", 1986

3. Snytkin I.I. Delay synchronization during digital processing of extra-long recursive sequences [Text] / II Snytkin, VI Burym, AG Serobabin, Izvestia Vysshikh Uchebnykh Zavedenii. Radio Electronics, No. 7, 1990

4. A.S. 1003372 USSR, MKI ³ H04L 7/02. A device for synchronizing noise-like signals [Text] / A.S. Vorobyov, A.V. Kuzichkin, V.M. Kurkin, B.I. Prosenkov, V.V. Artyushin, V. M. Tarasov (USSR)

5. Snytkin I.I. Theory and practical application of complex signals of nonlinear structure. Part 3. [Text] / II Snytkin - Moscow Region, 1989

6. Dolgov V.I. The use of acoustoelectronic convolvers for signal processing in communication technology [Text] / V.I. Dolgov - Foreign electronics No. 8, 1990

7. Sverdlik M.B. Optimal discrete signals [Text], “Sov. radio ", M., 1975

8. Pat. 2297722 Russian Federation, IPC ⁸ H04L 7/08, G06F 17/15. A method for accelerated search for broadband signals and a device for its implementation [Text] / Fedoseev V.E., Snytkin II, Varfolomeev DV - No. 2005114601/09; declared 05/13/2005; publ. application November 20, 2006; publ. patent on April 20, 2007.

9. Snytkin I.I. Theory and practical application of complex signals of nonlinear structure. Part 4. [Text] / II Snytkin - Moscow Region, 1989

10. Pat. 2024053 Russian Federation, IPC ⁸ G06F 15/20. Device for the formation of dictionaries of nonlinear recurrence sequences [Text] / Snytkin II - publ. 11/30/94.

Claims (2)

1. The method of accelerated search for broadband signals, based on the following set of actions:
- the use of a priori information on the ratio of the value of the number of the tact of the current delay of the received signal and the tact of detection of the total values of the cross-correlation between the received and reference sequences;
- search by the delay of signals manipulated by derivatives of non-linear sequences (PNP) is carried out in parallel along 2 channels, in one of which a sequentially repeating component of length l _{1 is} used as a reference, in the other - l ₂ ;
- as a result, from l ₁ and l _{2 the} values of the periodic cross-correlation function (PVKF) accumulated in each of the 2 channels, select the maximum and fix the corresponding numbers of the mutual shift measures i _max ∈ (0,1, ..., l ₁ -1) and j _max ∈ (0,1, ..., l ₂ -1) relative to the initial corresponding l ₀ , and then using the obtained i _max and j _max determine the values of cyclic shifts c ₁ and c _{2 of the} generating components according to the following relations:

- then, through the parallel formation of 2 sequences of repeating generating components of lengths l ₁ and l ₂ generated with cyclic shifts c ₁ and c _2, respectively, as well as symbol-by-symbol summation modulo 2 of these 2 sequences, a reference derivative sequence L = l is formed ₁ × l ₂ , the resulting cyclic shift C of which at the control stage eliminates the time mismatch of the received and reference derived signals (PNP), and its value C is due to the values of c ₁ and c ₂ in accordance with the expressions:
c ₁ = l ₁ -C (mod l ₁ ), c ₂ = l ₂ -C (mod l ₂ ),
- the decision to capture the PNP signal by the delay is made upon exceeding the set threshold by the PVKF value of the received and received reference derivative of the PNP signal, otherwise the search is continued, characterized in that:
- a priori information is used on the structure of the PVKF PNP of duration L = l ₁ × l _{2 the} structure of the private PVKF _1i , PVKF _2j formed by parallel, simultaneous, in the “counter-inverse” mode of correlation for all possible i, j subchannels (i = l ₁ , j = l ₂ ), respectively, the first (1) and second (2) - channels for receiving incoming PNP with various automorphisms (cyclic shifts) of segments (producing components (PK-1 and PK-2) in the form of simple nonlinear recurrence sequences (NLRP) of duration l ₁ and l ₂ ) - PC-1 _i and PC-2 _j , i = 1, ..., l ₁ , j = 1, ..., l ₂ ;
- simultaneous parallel primary accumulation of the values of the partial PVKF _1i , PVKF _2j is carried out, in the subchannels i and j of the search for the 1st and 2nd channels at each correlation cycle during the analysis time T _an1 = p ₁ l ₁ , T _an2 = p ₂ l ₂ , where p ₁ and p ₂ are the number of runs of the producing components PK-1, PK-2, p _1min = p _2min = L and the summation of the accumulated values in each channel at the end of the primary accumulation sub-step, for the implementation of the extrapolation sub-step;
- moreover, the extrapolation (prediction) of the structure of private PVKF, PVKF in the form of extrapolation to each k ₁ st, k ₂ clock moments (after a sub-step of primary accumulation) of the private peaks R _chp1 , R _chp2 in the 1st and 2nd channels, respectively at the outputs of certain extrapolated search subchannels with extrapolated numbers N _{k1 + 1} and N _{k2 + 1} , set according to the extrapolation functions of SE ₁ , SE ₂ subchannels of the 1st and 2nd processing channels:
SE ₁ = f (N _k1 ), SE ₂ = f (N _k2 ), N _k1 = 1, ..., l ₁ , N _k2 = 1, ..., l ₂ ,
as functions of the sequence numbers and sub peaks with partial _chp1 R, R _chp2 at its outputs in each k th _1, k ₂ -th cycles:
- moreover, 2-factor control of extrapolation is implemented according to the majority principle: according to the factor of the extrapolated subchannel numbers and with private peaks R _cn1 , R _cn2 and according to the factor of accumulation levels

and

- moreover, the accumulation is carried out at the outputs of 2 channels of the identified extrapolated private peaks R _np1i , R _np2j , at the extrapolated outputs of the i-th and j-th subchannels of the search for the 1st and 2nd processing channels, respectively, in each k-th (k ₁ = k (mod l ₁ ) and k ₂ = k (mod l ₂ )) reception clock;
- moreover, the control of the establishment of synchronism by delay is realized by the formation of the reference signal of the PNP without directly determining the current time delay of the received PNP, and by such a combination of numbers of clock cycles of synchronization with the production bars, in which i _max and j _max are essentially extrapolated subchannel numbers i _max = N _k1 , j _max = N _k2, respectively, with private peaks at their outputs and after positive 2-factor control of extrapolation. 2. A broadband signal search device, comprising:
- the device contains: two channels of processing a correlator type, moreover, the correlation processing is implemented on the basis of acoustoelectronic convolvers (AEC), a received signal is applied to one input of each channel; reference sequence generator, the first output of this generator of each channel is connected to the corresponding input of the derivative signal generator, the output of which is connected to one of the inputs of the delay synchronism control circuit, the other input of which is the input of the received signal, and the input of the reference sequence generator of each channel is connected to the output of the corresponding a shift calculator c ₁ and c ₂ , characterized in that in each processing channel, the reference sequence generator is made in the form of a generator of all possible automorphisms l ₁ and l ₂ (cyclic shifts), issued in parallel by the group of second l ₁ and l ₂ outputs, respectively, and issued by the first output of one of the automorphisms of the reference sequence generating a repeating component of length l ₁ and l _2, respectively, and also introduced: a block of digital sub-correlators (BTsPK), which contains respectively for each channel l ₁ and l ₂ sub-correlators, each of which contains: a series-connected acoustoelectronic convolver (AEC), one input of which is the first input m of the sub-correlator and connected to the first input of the processing channel, and the second input is the second input of the sub-correlator and connected to one of the second outputs of the reference sequence generator; an amplifier and an analog-to-digital converter (ADC), the output of which is a parallel output bus and is the output of the sub-correlator and the corresponding output of the BCCP, the outputs of which are a parallel output bus, are connected to the corresponding inputs of the accumulation and extrapolation (SEC) circuit, which contains one and the other channel processing for l ₁ and l ₂ subchannels search, respective inputs of which are SNE inputs and outputs connected to respective first inputs tsentralnog a digital comparator (TSTSK) having a first input connected to the output of the first switch, and l ₁ and l ₂ outputs (respectively for one and other channels) are respectively connected to the inputs of a digital adder and a first input key unit key (BK) containing respectively l ₁ and l ₂ keys, the second inputs of which are connected to the output of the first key, and the outputs of the BC keys are connected to the corresponding inputs of the shift calculator, c ₁ and c ₂ , respectively, the output of which is the output of the SNE and the processing channel and connected to the input of the corresponding generator torus of the reference sequence, and the output of the digital adder is connected to one input of the first key, the other input of which is connected to the output of the accumulator-adder, the input of which is connected to the output of the verification unit, which is a block (set) of two-input elements And, the first l ₁ (and l ₂ ) whose inputs are connected to the corresponding outputs of the CCC and the inputs of the subchannel number selection block (BCH), which is a cross-block and a delay unit per cycle connected in series, l ₁ (and l ₂ ) of the outputs of which are connected to the second l ₁ (and l ₂ ) at odes checking unit; moreover, each search subchannel (PKP) of the accumulation and extrapolation (SNE) circuit contains a digital parallel adder, the first inputs of which are connected to the corresponding bus of the BCPC parallel outputs, and the second inputs are connected respectively to the outputs of the corresponding coincidence elements, the first inputs of which are clock, the second inputs are connected respectively, with the outputs of random access memory (RAM), the inputs of which are connected to the outputs of the digital parallel adder and the corresponding first inputs of the second a beam, the second input of which is connected to the output of the first counter, the input of which is clock, and the input of the second counter, the output of which is connected to one input of the AND circuit, the output of which is connected to the control panel output, and the second input is connected to the output of the digital comparator, the inputs of which are connected to the outputs of the second key.

Images