RU2182403C1 - Asynchronous addressed communication method - Google Patents

Abstract

FIELD: multichannel addressed communication systems using single frequency band, easy access to communication channel, and code separation of subscribers. SUBSTANCE: method is characterized in that type of output useful signal approaches δ- function along time axis and coincides in shape with autocorrelation function of composite input signal and output responses to other system's signals coincide with mutual correlation functions of these signals, are orthogonal and either have no side lobes, or their quantity is minimal due to appropriate processing of set of composite signals being used each of them composed of basic and additional sequences encoded by respective L-codes. Each transmitting station independently functions to convert analog message into sequence of alternating-sign bits, to shape basic and additional L-code based code sequences within bit function time around N samples shaped, to assign respective subcarrier to each sample; each sample is subjected to interdigital modulation obeying first or second frequency variation law; modes shaped in first and second frequency bands are radiated, all radiated modes are received, filtered out, and standardized; each sample is compressed, basic and additional L-code based code sequences are compressed, results of compression basic and additional L-code based code sequence are summed up, alternating-sign pulse sequence is shaped, and analog message transmitted is recovered. EFFECT: enhanced noise immunity of system, enlarged number of simultaneously operating subscribers without mutual interference. 3 dwg, 4 tbl

Description

 The proposed method relates to the field of radio communication and can be used in multi-channel asynchronous addressable radio communication systems, all stations of which operate in the same occupied band, using free access to the communication channel and code division of subscribers.

 There is a method of asynchronous address communication of N subscribers in one frequency band, which is an analogue in which each analog message of each subscriber is independently converted into a sequence of alternating pulses (available in the claimed object), the corresponding time coding (available in the claimed object) is carried out, modulated carrier vibration generated by the code combination (available in the claimed object), emit each vibration in the same frequency band for all subscribers (available in the application the received object), receive active subscribers all emitted code sequences (available in the claimed object), select the received code combinations (available in the claimed object), decode the corresponding code combination (available in the claimed object), convert the resulting sequence of alternating pulses into an analog message (there is in the claimed object) and which is described in the book of Livshits A.R., Bilenko A.P. Multichannel asynchronous information transfer systems. M .: Communication, 1974, p. 7-11, Fig. B.7 and Fig. B.8.

 However, this method has the disadvantage that since code groups consisting of the same pulses but having different time intervals are transmitted and received between them, it is possible that such code combinations occur in which false alarms of decoding devices occur. These intra-system interference with an increase in the number of active subscribers above a certain level sharply increase and suppress the work of all active subscribers. Therefore, this method has low noise immunity.

 The higher noise immunity has the method of asynchronous address communication of N subscribers, which is an analogue in which, independently of each other, each analog message of each subscriber is converted into a sequence of alternating pulses (available in the claimed object), the corresponding time coding (available in the claimed object) is performed, filled each pulse of the code combination with its subcarrier frequency (available in the claimed object) modulates the carrier oscillation of the generated frequency-time with the given code combination (available in the claimed object), the generated oscillation is emitted in the same frequency band for all subscribers (available in the claimed object), all active radiated oscillations (available in the claimed object) are received by active subscribers, the received code combinations are selected (available in the claimed object) decode the corresponding code combination (available in the claimed object), convert the resulting sequence of alternating pulses into an analog message (available in the claimed object) and which dignity in the books Livshits A.V., Bilenko A.P. Multichannel asynchronous information transfer systems. M .: Communication, 1974. p. 9-11, fig. AT 10; Cherdyntsev V.A. Radio engineering systems. Minsk: Higher School, 1988. p. 319-322, fig. 14.11, fig. 14.12, fig. 14.13.

However, this method has the disadvantage that when it is used, the number of active subscribers N _{a is} limited to a small amount relative to the total number of served subscribers N, due to the fact that the level of intra-system interference increases sharply if the number of actively working subscribers exceeds a certain critical number and a sharp deterioration in the quality of communication throughout the system.

A known method of pulsed radar system phase-shifted signals, which is an analogue, which consists in the fact that they form a sequence of phase-shifted signals (available in the claimed object), emit (available in the claimed object), receive them (available in the claimed object), and each discret of the emitted phase-shifted signal with a dimension of code N (available in the claimed object), each of the sequence of phase-shifted signals, consisting of 2N signals, is subjected to an intra-discrete total modulation (available in the claimed object), the law of change of which is determined by the code sign of the phase-shifted signal, the laws of variation of the frequency of the in-discrete frequency modulation are orthogonal or quasi-orthogonal to each other (available in the claimed object), the range of variation of these frequencies is the same for all discretes (available in the claimed object) , and all signals of the sequence have the same carrier frequency (available in the claimed object), and upon reception, each discrete with its own law of in-discrete frequency modulation and a phase-manipulated signal with a dimension of code N, is processed in a system of matched filters, each of which is consistent with the law of changing the frequency of the corresponding discrete (present in the claimed object) phase-manipulated signal, the envelopes of the discrete (present in the claimed object) are identified at the output of the matched filter, which corresponds to the sign discrete code (available in the claimed object) of the corresponding phase-shifted signal, and the sequence of envelopes whose signs correspond to the corresponding code of the corresponding phase-manipulated signal, subjected to filtering in the corresponding matched filter (available in the claimed object) of the phase-manipulated signal, the signals received at the outputs of all compression filters of the phase-manipulated signals are appropriately delayed and synchronously summed (present in the claimed object) over a time interval, the duration of which is determined by the period repetition of the processed sequence consisting of 2N phase-shifted signals with in-disc modulation, with consisting of two groups of N phase-shifted signals in each group (present in the claimed object), and each phase-shift signal from a group of N phase-shift signals corresponds to an inverse phase-shift signal of another group consisting of N phase-shift signals, and phase-shift signals in each group consisting of N phase-shifted signals, orthogonal to each other, and which is described in patent RF 2107926, IPC ₆ G 01 S 13/10, publ. in 1998, BI 9, p. 377 (Lityuk L.V. Method of pulsed radar system of phase-shifted signals).

 However, this method has the disadvantage that the signals used are emitted, received and processed by the same station, which does not allow their use in multichannel radio communication systems.

 The closest in technical essence and functional purpose is the asynchronous address communication method, which has higher noise immunity and is a prototype in which each of the N analog messages is independently converted from each other into a sequence of alternating pulses (available in the claimed object), the corresponding time coding is performed ( available in the claimed object), fill each pulse of the code combination with its subcarrier frequency (available in the claimed object), modulate for an hour each one subcarrier within each pulse of the code combination (present in the claimed object), the generated oscillation is emitted in the same frequency band for all subscribers (present in the claimed object), all active oscillations (present in the claimed object) are received by active subscribers, the received oscillations are filtered out (available in the claimed object), decode the corresponding code combination (available in the claimed object), carry out a coordinated filtering of each received decoded pulse (available in by the claimed object), the resulting compressed sequence of alternating pulses is converted into an analog message (available in the claimed object), and L-codes can be used as one of the types of modulating sequences of the first order, and which is described in the USSR copyright certificate 698143, M.cl. H 04 J 3/00, publ. at 15.11.79, BI 42 (Dolgov V.I., Glazin E.F., Tolubko E.V., Kryachko A.A. Asynchronous-address communication system).

 However, the method indicated in the prototype has the disadvantage that the autocorrelation function (ACF) of the compressed complex signal has side lobes (BL), and the correlation functions (VKF) of the signals used are not orthogonal or quasi-orthogonal, which leads to the appearance of BL. The presence of these BLs is one of the reasons for the appearance of noise of non-orthogonality, the value of which increases sharply when the number of simultaneous subscribers reaches a certain critical value, and consequently, a sharp decrease in the noise immunity of the entire asynchronous-address communication system.

 The challenge facing the inventor was to completely eliminate BL in the ACF and to completely eliminate the BL in the ACF of the signals used.

 The technical result of the proposed method is that increasing the noise immunity of the asynchronous-address communication system and increasing the number of simultaneously working subscribers without mutual interference with each other is achieved by appropriate processing of the applied system of complex signals, each of which consists of the main and additional sequences encoded by the corresponding L-codes, the form of the output useful signal approaches the δ-function along the time axis and coincides in shape with the ACF of the input complex s drove, and the output responses to other signals of the system coincide with the VKF of these signals with each other, are orthogonal and either do not have at all, or have a minimum number of BL.

 The technical result is achieved by the fact that in the method of asynchronous address communication of N subscribers, each analog message of each subscriber is independently converted into a sequence of alternating pulses, formed during the duration of each alternating pulse of N discrete, fill each disc with its subcarrier frequency in accordance with assigned to each subscriber the first main code sequence based on the L-code or the first additional code sequence based on the L-code, each the first discrete sequence of the first main code sequence based on the L-code is modulated in frequency according to the first law of frequency variation inside the discrete, each discrete of the first additional code sequence based on the L-code is modulated in frequency according to the second law of frequency variation inside the discrete, orthogonal or quasi-orthogonal to the first him along the occupied frequency band, the generated oscillations in the first frequency band emit, active subscribers accept all the emitted oscillations in the first frequency band, filter Accepted oscillations, carry out a coordinated filtering of frequency-modulated samples according to the first or second laws of frequency change inside the samples, decode the corresponding or the first main code sequence based on the L code, or the first additional code sequence based on the L code, carry out the matched filtering of either the first the main code sequence based on the L-code, or the first additional code sequence based on the L-code, allocate the envelope and the sign of the result compression tats or the first main code sequence based on the L-code, or the first additional code sequence based on the L-code, form a sequence of alternating pulses and convert them into an analog message, each of the N generated discrete additionally simultaneously filling with its subcarrier frequency in accordance with assigned to each of N subscribers by a second additional code sequence based on an L-code, or a second main code sequence based on an L-code, to Each discret of the second additional code sequence based on the L-code is modulated in frequency according to the first law of changing the frequency inside the discrete, each discretion of the second main code sequence based on the L-code is modulated in frequency according to the second law of changing the frequency inside the discrete, the generated oscillations are emitted in the second band frequencies equal in magnitude to the first frequency band, all active oscillations in the second frequency band are accepted by active subscribers, the received oscillations are filtered out, carried out with harmonized filtering of frequency-modulated samples according to the first or second laws of frequency variation within the samples, decode the corresponding or second additional code sequence based on the L code or the second main code sequence based on the L code and sum or compression results of the second additional code sequence based on L code with the compression results of the first main code sequence based on the L-code or the compression results of the second main code sequence on based on the L code with the compression results of the first additional code sequence based on the L code.

 The invention meets the criteria of novelty, inventive step and industrial applicability.

 Consider the proposed method of asynchronous address communication using the E-matrix as an example, the properties and symbolic forms of which are described in the book by V. Lityuk. Calculation methods and design of digital multiprocessor devices for processing radio signals: a Training manual. Part 4. Taganrog: Publishing house of TRTU, 1998, pp. 19-21.

Положим, что L-матрицу получим из Е-матрицы (1) путем соответствующих замен вида k=-j и i=-l в четных столбцах, и попарной перестановке элементов в ее третьем и четвертом столбцах.As a primitive, consider the E-matrix of the form (expression (18) of the cited book)

We assume that we obtain the L-matrix from the E-matrix (1) by appropriate substitutions of the form k = -j and i = -l in even columns, and pairwise permutation of the elements in its third and fourth columns.

При переходе от матрицы порядка N к матрице порядка 2N будем пользоваться соотношением вида

где знаки <-- и --> над L $\genfrac{}{}{0ex}{}{\text{2ac4bd}}{\text{N}}$ - матрицами обозначают инверсию элементов в этих матрицах, расположенных соответственно в левой ее половине и правой ее половинах по вертикали соответственно. В дальнейшем опустим индексы вверху L_N-матрицы.Then we get an L ₄ -matrix of the form

When passing from a matrix of order N to a matrix of order 2N, we use a relation of the form

where the signs <- and -> over L $\genfrac{}{}{0ex}{}{\text{2ac4bd}}{\text{N}}$ - matrices denote the inversion of the elements in these matrices located respectively in its left half and its right halves vertically, respectively. In the future, we omit the indices at the top of the L _N -matrix.

и L₁₆-матрица соответственно будет иметь вид

Будем также полагать, что выполняются следующие правила перемножения при вычислении автокорреляционных (АКФ) и взаимокорреляционных (ВКФ) функций рассматриваемых кодовых последовательностей
(±1)•(±1)=±1; (±j)•(±j)=±1; (±i)•(±i)=±1; (±k)•(±k)=±1,
(±1)•(±j)=0, (±1)•(±k)=0, ((±1)•(±i)=0, (±j)•(±k)=0,
(±j)•(±i)=0, (±i)•(±k)=0. (6)
Указанные системы кодовых последовательностей, описываемые выражениями (2)-(5), характеризуются тем свойством, что они состоят из наборов основных и дополнительных последовательностей. Местоположение основных и дополнительных кодовых последовательностей на основе L-кодов в L_N-матрице, обладающими необходимыми свойствами, определяются из следующих условий:
- все первые элементы всех ее строк должны иметь одинаковые знаки;
- кодовые последовательности, являющиеся основными и дополнительными друг для друга и описываемые строками L_n-матрицы, должны располагаться в верхней (первые) и нижней (вторые) ее половинах под номерами от 1 до 0,5N и от 0,5N+1 до N соответственно или наоборот;
- первой основной или второй дополнительной кодовой последовательности на основе L-кода, находящейся на строке под номером 1 L_N-матрицы, соответствует первая дополнительная или вторая основная последовательность, находящаяся на строке 0,5N+1 той же матрицы; первой основной или второй дополнительной кодовой последовательности на основе L-кода, находящейся на строке под номером 2 L_N-матрицы, соответствует первая дополнительная или вторая основная последовательность, находящаяся на строке 0,5N+2 той же матрицы и т.д. до первой основной или второй дополнительной кодовой последовательности на основе L-кода, находящейся на строке под номером 0,5N L_N-матрицы, которой соответствует первая дополнительная или вторая основная последовательность, находящаяся на строке N той же матрицы;
- количество перемен знаков у элементов нечетных и четных столбцов, попарно следующих друг за другом, одинаково;
- сумма перемен знаков у элементов в каждой группе из четырех столбцов, следующих друг за другом, начиная с первого, равна величине N-2.Following this rule, the L ₈ -matrix, taking into account (2) and (3), will take the form

and L ₁₆ -matrix will accordingly have the form

We will also assume that the following multiplication rules are satisfied when calculating the autocorrelation (ACF) and intercorrelation (VKF) functions of the considered code sequences
(± 1) • (± 1) = ± 1; (± j) • (± j) = ± 1; (± i) • (± i) = ± 1; (± k) • (± k) = ± 1,
(± 1) • (± j) = 0, (± 1) • (± k) = 0, ((± 1) • (± i) = 0, (± j) • (± k) = 0,
(± j) • (± i) = 0, (± i) • (± k) = 0. (6)
The indicated systems of code sequences described by expressions (2) - (5) are characterized by the property that they consist of sets of basic and additional sequences. The location of the main and additional code sequences based on L-codes in the L _N -matrix with the necessary properties is determined from the following conditions:
- all first elements of all its lines must have the same signs;
- code sequences that are basic and complementary to each other and described by the lines of the L _n -matrix should be located in the upper (first) and lower (second) halves of it under the numbers from 1 to 0.5N and from 0.5N + 1 to N respectively or vice versa;
- the first main or second additional code sequence based on the L-code located on the row under the number 1 L _N- matrix corresponds to the first additional or second main sequence located on the row 0,5N + 1 of the same matrix; the first main or second additional code sequence based on the L-code located on the row under the number 2 L _N- matrix corresponds to the first additional or second main sequence located on the row 0,5 N + 2 of the same matrix, etc. to the first main or second additional code sequence based on the L-code located on the row under the number 0,5N L _N -matrix, which corresponds to the first additional or second main sequence located on row N of the same matrix;
- the number of sign changes in the elements of odd and even columns, pairwise following each other, is the same;
- the sum of the sign changes of the elements in each group of four columns following each other, starting from the first, is equal to the value of N-2.

The analysis shows that the L _N matrices described by expressions (2) - (5) possess these properties.

 In the future, we will assume that the main and additional code sequences based on the L code determined in this way occupy different frequency bands.

где n=0, ±1, ±2,..., ±(N-1) - номера отсчетов во времени, нормированные относительно частоты дискретизации.By definition, the sum of ACFs of the main and additional code sequences obtained from the indicated rows of L _N -matrices, and hereinafter referred to as total ACFs, are described by the expression

where n = 0, ± 1, ± 2, ..., ± (N-1) are the numbers of samples in time, normalized with respect to the sampling frequency.

The sum of the VKF of the main and additional sequences, called the total VKF and written in the form of K _In (n), has the following properties:
- due to the orthogonality of the code sequences described by L _N -matrices, the functions K _B (n) = 0 at points n = 0;
- the functions K _B (n) = 0 at the points n = 0, ± 1, ± 2, ..., ± (N-1) for code sequences arranged in pairs on the odd and even rows of the L _N -matrix;
- nonzero side lobes (BL) of the total VKF K _B (n) are symmetrically located at points n = ± 4, ± 8, 12, ... adjacent to n = 0, their values at these points are equal in magnitude, do not exceed or equal to N and their values are a multiple of four;
- zero BL values are always located only at positions not multiple to four relative to the point n = 0;
- the number of BLs whose values are zero from each edge of the total VKF K _B (n) is not less than 0.5N + 3;
- the total number of non-zero BL for the whole set of total VKF K _B (n) equal to (N-1) N of the total number of positions N (2N ² -3N-l) can vary up to N ² ;
- the total number of total VKF K _B (n) for which all BLs are equal to zero at least 0.75N-1.

In the table. 1 shows the values of all total ACF K _A (n) and all combinations of total ACF K _B (n), L ₈ matrix described by expression (4). Here, designations of the form (x • y) + (z • w) given in Table 1 and the following tables indicate that the sum of the convolutions of the line with the number x with the line with the number y and the line with the number z with the line under the number w is described L-matrices that are calculated taking into account condition (6).

The analysis of table 1 shows that:
- there are eight identical units with one total ACF and seven total VKF;
- analysis of one block completely determines the properties of the total ACF and total VKF of the remaining blocks;
- the total number of total VKF with all BL equal to zero is 100% of the total number of total VKF;
Therefore, to analyze the properties of the signal system, it suffices to consider the interaction of one pair of the main and additional sequences based on L-codes with all other pairs of the considered L-matrix.

In the table. Figure 2 shows the values of the total ACF K _A (n) and total VKF K _in (n) for the primary and secondary code sequences based on L codes described by the first and ninth rows of the L ₁₆ matrix (4), respectively, as the sum of the results of convolution of these rows with all the other rows of this matrix.

Note that the discrete notations used in Table 2 are simple signals. From table 2 it is also seen that:
- 86.7% of total VKF have zero BL level at all positions;
- 13.3% have two BL of level N modulo;
- of the total number of BL total ACF equal to 465, equal to zero 461, which is more than 99.1%;
- the number of positions equal to zero until the first BL total ACF on each of both sides is 0.5N + 3;
- the maximum BL values of the total VKF modulo equal to N, are equal to each other and all BL values are multiples of four.

Similar results can be obtained for code sequences described by L _N -matrices of other sizes.

In particular, for the L ₃₂ matrix we have (codes and a table with ACF and VKF are not given):
- the total ACF has one peak of 2N and all BLs are equal to zero;
- total VKF have all BL equal to zero at 1425 positions out of 1449 of their total number, which is more than 98.3%;
- the number of positions equal to zero until the first BL total ACF on each of both sides is 0.5N + 3;
- the maximum BL values for total VKF are N and their number is 0.42% of the total number of positions, and the rest are 0.5N and their number is 0.81% of the total number of positions;
- the location of BL in the total VKF is symmetrical with respect to the central position equal to zero;
- BL values are a multiple of four.

 It is also seen that to obtain the considered results, signals should be used that can be attributed to complex second-order signals, as shown in the book by L.E. Varakin. Complex signal systems. M .: Sov. Radio, 1978, pp. 29 and pp. 271-280.

 From the table. 1 and Table 2, it can be seen that the number of BLs in the rows located in their lower halves (for Table 1, in the lower half, let us suppose the first block of eight rows), is greater than the number of BLs in the rows located in the upper halves.

 In the case when the orthogonal laws of in-discrete modulation are used, the results summarized in Table 2 are converted to the form presented in Table 3.

 It can be seen that the introduction of intra-discrete modulation according to orthogonal laws and the use of such discretes in the considered code sequences allows us to reduce the number of BLs in the total WKF described in Table 3.

In that case, if the first and second laws of in-discrete modulation used are “quasi-orthogonal”, then in this case the values of total ACF K _A (n) and total VKF K _B (n) for the case under consideration will take the form shown in Table 4.

 In the table. 4, the quantity ε ≪ 1 means that in this cell there is a quantity determined by the level of the response that appears during the passage of the discrete, say, with the first law of in-disc modulation through a matched filter with the second law of in-disc modulation, or vice versa.

From table 4 it is seen that the introduction of "quasi-orthogonal" in-discrete frequency modulation leads to the appearance of BL at the same positions that are described in table. 2, however, the level of those BLs that are located in the lower half of Table 2 will be ε ^-1 times lower.

Thus, it can be seen that the introduction of additional sequences allows one to obtain the total ACF K _A (n) as a digital δ-function, and the set of total ACF K _B (n) has orthogonality with respect to the total ACF K _A (n) and a relatively small number of BLs, not equal to zero (<1.7% for the L ₃₂ matrix), and the level of a part of these BLs in the total VKF K _B (n) can be reduced to a predetermined level (in the limit to zero when applying the orthogonal laws of in-disc modulation). Note that similar results can be obtained for L-matrices of other sizes.

 In contrast to the asynchronous address communication method described in A.S. 698143, the proposed method improves the noise immunity of the entire communication system by introducing the corresponding primary and secondary code sequences based on L-codes and the use of orthogonal or quasi-orthogonal laws of in-disc modulation.

 The analysis of the proposed method of asynchronous address communication and its comparison with analogues and prototype described in A.S. 698143, allows us to conclude that the proposed method meets the criteria of "novelty", "inventive step" and "industrial applicability".

 In FIG. 1 shows a structural diagram of one of the transmitting devices, identical to others, implementing the method.

 Figure 2 shows the structural diagram of one of the receiving devices, identical to others, implementing the method.

In FIG. Figure 3 shows an example of a time-frequency diagram of the simultaneous arrangement of signals from two stations described by 1 and 9 rows and 9 and 1 rows of the L ₁₆ matrix from expression (5), and which have
the total ACF of the type K _A (n) = (1 • 1) + (9 • 9) and the total ACF of the type K _B (n) = (9 • 9) + (1 • 1), which are described in Table 2-table .4.

 In FIG. 1 shows a device that implements the transmitter of the proposed method, which contains a message generator (HS) 1, the output of which is connected to the first input of the delta modulator (DM) 2, the control second input of which is connected to the first output of the control unit (BU) 3, the second output BU 3 is connected through a clock generator (GTI) 4 and a frequency divider (DC) 5 to N and a third input DM 2, the output of which is connected to the input of the bit sign extraction unit (BVZB) 6, the first output of which is connected to the combined first inputs of AND circuits 7, second exit BVZB 6 is connected to the combined first inputs of circuits And 8, the second inputs of circuits And 7 and 8 are paired and connected to the corresponding outputs of the address decoder (ДшА) 9, which is connected via the control input to the third output of BU 3, and by signal inputs with outputs a counter (MF) 10 with N states connected via a control input to the fourth output of the control unit 2, and an input MF 10 with N states is connected to the output of the GTI 4 and to the input of a frequency-modulated signal (GMS) 11, the control input of which is connected to the fifth the output of the installation of the law II BU 2, the output of the GPS 11 is connected to the first inputs of the mixer (Cm) 12 and the mixer (Cm) 13, the outputs of circuits And 7 and circuits And 8 are connected respectively to the multiplexer (MS) 14 and the multiplexer (MS) 15 of the main code sequence based on The L-code of the positive and negative sign of the information bit and to the multiplexer (MS) 16 and the multiplexer (MS) 17 of an additional code sequence based on the L-code of the positive and negative sign of the information bit, the control inputs MS 14 - MS 17 are connected respectively to the sixth, seventh eighth and ninth in control outputs BU 2, the outputs of the same name MS 14 and MS 15 are connected through the corresponding circuit OR 18 to the control inputs of the keys (C) 19, the outputs of the same name MS 16 and MS 17 are connected through the corresponding circuit OR 20 to the control inputs of the keys (C) 21, signal the outputs of Cl 19 and Cl 21 are connected to the outputs of the subcarrier frequency generator (GPNCH) 22, the control input of which is connected to the tenth output of the control unit 2, the outputs of all Cl 19 are connected to the inputs of the adder (Σ) 23, the output of which is connected to the second input See 12, outputs all CL 21 connected to the inputs of the adder (Σ) 24, in turn is connected to a second input See 13, 12 and outputs See See 13 are connected to the inputs of the adder (Σ) 25, whose output is connected to the input of the power amplifier (PA) 26, the PA output 26 is connected to an antenna (A) 27.

 In FIG. 2 shows a device that implements the receiving device of the proposed method, which contains a receiving antenna (APR) 28, the output of which is connected through the linear path of the receiver (LTP) 29 to the input of the block for the formation of quadrature components (BOX) 30, the quadrature outputs of which are connected to the inputs of the analog digital converters (ADC) 31 quadrature components, the outputs of the ADC unit 31 quadrature components are connected to the inputs of digital frequency-selective filters (CSCF) 32-47, each of which is configured to the corresponding often that and they all have the same bandwidth, the outputs of all the CSCF 32-47 are connected to the corresponding inputs of the normalization units (BN) 48-63, the outputs of which are connected to the inputs of the digital matched filter filters (CSFD) 64-79, configured to compress the received sample with by intra-discrete modulation, the outputs of the CSFD 64-79 are connected to the inputs of the corresponding envelope extraction units (BVO) 80-95, the outputs of which are connected to the inputs of the corresponding code sequence generation units (BFKP) 96-111, the outputs of the BFKP 96, 97, 98 99 and 104, 105, 106.107 connected with the corresponding positive inputs of the adders (Σ) 112-119, and the outputs of the BFKP 100, 101, 102, 103, and 108, 109, 110, 111 are connected to the corresponding negative inputs of Σ112-Σ119, the outputs of Σ112-Σ119 are connected to the inputs of the matched sequence filters (TFP) 120-127, the outputs of which are connected to the inputs of the adder (Σ) 128, the output Σ128 is connected to the input of the sign extraction unit (BVZ) 129 and the input of the module capture unit (BVM) 130, the output of the BVM 130 is connected to the signal input of the threshold device ( PU) 131, the output of which is connected to the allowing input of the sign-forming unit pulses (BFZpI) 132, the other input of which is connected to the output of the BVZ 129, the output of the BFZpI 132 is connected to the input of the delta demodulator (DD) 133, the output of which is connected to the input of the receiver of the message (BPS) 134, and BOX 30 is connected to the control input with the eleventh output of the reception control unit (BUP) 135, the ADC unit 31 is connected to the twelfth output of the BUP 87, the control inputs of the DSCD 64-79 are connected to the corresponding numbers of the outputs from the thirteenth to the twenty-eighth BUP 135, respectively, the control inputs of the SFP 120-127 are connected to the corresponding but measures of outputs from the twenty-ninth to thirty-sixth BUP 135, the thirty-seventh output of the BUP 135 is connected to all synchronizing inputs of the corresponding blocks (these inputs are not shown in the structural diagram), the thirty-eighth output of the BUP 135 is the installation output and connected to the installation inputs of the corresponding blocks (on block diagram of these inputs are not shown).

Figure 3 shows the time-frequency matrix of the signals of the first main and second additional sequences having an increasing law of in-disc modulation, which are described by L-codes corresponding to the first and ninth rows of the L ₁₆ matrix (5), which corresponds to the transmission of the symbol "+1" the first station, and the second main and first additional code sequences based on the L-code, having a falling law of in-disc modulation, described respectively by the ninth and first rows of the L ₁₆ matrix (5), which corresponds to It can transmit the +1 symbol to the second station simultaneously with the first station.

 The devices depicted in figures 1 and 2 and implementing the proposed method of asynchronous address communication, operate as follows. Suppose that by time t <0, BU 3 sets a code in DSA 9 that corresponds to the code of the called station, sets MF 10 to zero, sends the appropriate command to the GMS 11 to set the corresponding frequency modulation law, controls MS 13 - MS 16 for bringing them into the required operating mode, starts the HPHF 21, prepares the GTI 4 for launch and provides a control signal to DM 2, according to which at the time t = 0 the operation of the entire device shown in Fig. 1 begins.

Starting at time t = 0, an analog message is sent to the DM 2 from the output of the GS 1. At the same time, a signal is received from the first output of the control unit 2, according to which the work of the DM 2 starts, and from its second output the GTI 4 starts. From the output of the GTI 4 clock pulses with a frequency f _τ = 1 / τ exceeding the conversion frequency F = 1 / T of an analog message by N times, where Τ = Nτ is the sampling period of the analog message, τ is the duration of the sample, they arrive at MF 10 with N states and at PM 5. From the output of the PM 5, the generated synchronization pulses of duration T = Nτ are supplied to DM 2 and nhroniziruyut its operation so that the output from the analog 2 DM messages generated sequence of alternating pulses of unit amplitude, i.e. a sequence of alternating information bits of duration T each. The signs of these pulses, through the BVZB 6, control the circuits AND 7 and AND 8 so that the outputs of the DS 9 are connected either through the circuits And 7 to the inputs MS 13 and MS 15, or through the circuits And 8 to the inputs MS 14 and MS 16. Assume for the sake of definiteness, the And 7 circuits connect the outputs of ДшА 9 to MS 13 and MS 15 when the sign of the information bit is positive, and the And 8 circuits connect the outputs of ДшА 9 to MS 14 and MS 16 when the sign of the information bit is negative.

 Let a positive information bit appear at the output of DM 2, the duration of which T, as indicated earlier, is N times the repetition period of τ clock pulses, i.e. T = Nτ. In each discrete time interval t = nτ, n = 0,1,2, ..., (N-1), determined by the period of the GTI clock pulses 4 τ during the duration of each information bit of duration T, regardless of its sign, N every 11 times in a GPS, a signal with a given law of in-disc modulation, the duration of each of which is equal to τ. These signals with frequency modulation are fed to the first input. See N 12 times for each time interval of T.

 At the same time, in the same discrete time intervals t = nτ, the clock pulses arrive at the counting input MF 10 and transfer it from state to state N times during the duration T of the information bit. At the same time, the volume of Sch 10 is such that at the moment of the appearance of the next information bit Sch 10 is reset.

The information arriving at each discrete time moment t = nτ from the outputs of MF 10 to DSA 9 is decrypted and through the And 7 circuits goes to MS 13 and MS 15, at one of the outputs of which at each discrete time instant a potential appears that passes through the corresponding OR circuit 18 to the inputs of Cl 19 and, accordingly, through the corresponding circuit OR 20 to the control inputs of Cl 21. We assume that Cl 19 control the moments of connection to the inputs Σ23 of the subcarrier frequencies from the outputs of the HPLF 22 of the main sequence, and Cl 21 simultaneously control the moments of connection to the inputs Σ24 subcarrier frequencies from the outputs of the LPC 22, corresponding to the values of the L-code additional sequence. We also assume, for definiteness, that these signals are located along the frequency axis as shown in FIG. 3, i.e. the first frequency band corresponds to the main code sequence based on the L code, and, similarly, the second occupied frequency band corresponds to the additional sequence based on the L code. We also assume that the states of the L-code of the main sequence correspond to subcarriers located along the frequency axis as follows:
F ₁ ->l; F ₂ ->j; F ₃ ->i; F ₄ -> k, F ₅ -> (- 1); F ₆ -> (- j); F ₇ -> (- i); F ₈ -> (- k), in the first band of occupied frequencies, and, similarly, the L-code states of the additional sequence correspond to subcarriers located along the frequency axis as follows
F ₉ ->1; F ₁₀ ->j; F ₁₁ ->i; F ₁₂ -> k F ₁₃ -> (- l); F ₁₄ -> (- j); F ₁₅ -> (- i); F ₁₆ -> (- k) in the second band of occupied frequencies.

 In accordance with the state of Sch 10 at each discrete time instant nτ (n = 0, l, 2, ..., Nl) during the duration τ through Cl 19 and Cl 21 to the inputs Σ23 and Σ24 are connected the corresponding outputs of the LPC 22 and thereby form the time-frequency matrix of the signal, which is tuned to the receiving station in the form, for example, as shown in Fig.3.

 These segments of oscillations of duration τ from the outputs Σ23 and Σ24 go respectively to the second inputs of Sm 12 and Sm 13, the first inputs of which during each time interval of duration τ receive a frequency-modulated oscillation with GMS 11.

 As a result, at the output of Cm 12 and Cm 13, signals are formed that are radio pulses with in-discrete frequency modulation, the frequency filling of which is determined by the values of the subcarriers, and the temporal position corresponds to the states of Mn 10.

 The received signals are summed up in Σ25. The peculiarity of the signal at the output of Σ25 is that in each discrete time interval τ it consists of two partial signals with in-discrete frequency modulation each, and the frequency filling of each of them depends on the L-code parameter of the main and additional sequences at these discrete time instants.

 From the output Σ25, the signal generated in this way is amplified in the PA 26 to the required value and is radiated through A 27 into space.

 Let, starting from time t = 0, a message is received by a receiving station that is accordingly tuned to receive a message. To do this, we assume that the corresponding nodes until time t = 0 are set to zero by signals from the MCU 135 from the thirty-eighth output. Also, until time t = 0, from the outputs of the BUP 135 from the thirteenth to the twenty-eighth, control signals are sent to configure the CSFD 64-79 so that their impulse characteristics correspond to either the first or second laws of in-disc modulation, depending on which The transmitting station is tuned into the receiving station. At the same time, until time t = 0, from the outputs of the BUP 135 from the twenty-ninth to the thirty-sixth, control signals are sent to configure the TFP 120-127 so that their impulse characteristics are described by the values (± 1), (± j), (± i ) and (± k) of the primary and secondary code sequences based on the L-codes of the station for receiving information from which they are configured.

 Suppose that at time t = 0, the signal from the station arrives at APR 28, the signal parameters of which are set to TsSFD 64-79 and TFP 120-127. This signal comes from the output of the APR 28 to the input of the LTP 29, from the output of which, amplified to the required level, it goes to the BOX 30. The other input of the BOX 30 receives control signals from the eleventh output of the BUP 135, the parameters of which are determined by the conditions associated with the need for education quadrature components of the received signal. These quadrature components are fed to the inputs of the ADC 31, the control input of which receives signals from the twelfth output of the BUP 135, the parameters of which are determined by the conditions of the Kotelnikov theorem.

From the output of the ADC unit 31, the samples of the quadrature components of the input implementation, converted to digital form, are fed to the inputs of the CSCF 32-47, where they undergo frequency-selective filtering. The filters CSCF 32-47 have the same bandwidth equal to the frequency band of the in-discrete frequency modulation of the samples, and the center frequencies of which correspond to the frequencies of the converted subcarriers F ₁ , ..., F ₁₆ .

 From the outputs of the CSCF 32-47, the filtered quadrature components, the information of which is contained in the frequency changes, are subjected to the corresponding normalization in BN 48-63 blocks in order to eliminate stray amplitude modulation.

 Filtered and normalized quadrature components arrive at the corresponding DSPs 64-79, where there is a coordinated filtering of those individual discretes, the harmonized filters of which are tuned to the law of in-disc modulation.

 The compressed signals received at the outputs of the CSFD 64-79 are fed to the BVO 80-95, where the amplitudes of the compressed signals are allocated, the positions of which on the time axis depend on the moments of the appearance of the corresponding discrete L-code at the input of the receiving station.

 The code samples from the outputs of the BVO 80-95 are supplied to BFKP 96-111, at the outputs of which pulses of unit amplitude, positive, suppose, polarity and a given duration (in the limit of equal sampling duration) appear and whose position on the time axis is determined by the maximum amplitude of the compressed discrete.

 These pulses are fed to the positive inputs Σ112 ... Σ119 from the outputs of the BFKP 96-99 and 104-107, respectively, and to the negative inputs of Σ112 ... Σ119 they come from the outputs of the BFKP 100-103 and 108-111, respectively.

 Thus, at the output of Σ112, we suppose that a sequence corresponding to the values (± 1) is formed, at the output of Σ113 a sequence corresponding to (± j) is formed at the output of Σ114, a sequence is formed that corresponds to the values (± i), and at the output of Σ115, the sequence corresponding to (± k) the first primary or second additional code sequence based on the L-code. Similarly, in this case, the output corresponding to the values (± 1) will be generated at the output of Σ116, the sequence corresponding to the values of (± j) will be generated at the output of Σ117, and the sequence corresponding to the values of (± i) will be generated at the output of Σ118, and at the output Σ119 a sequence will be formed corresponding to the values (± k) of the first additional or second main code sequence based on the L-code.

 Formed in this way, three-level pulse sequences (-1,0,1) from the outputs Σ112 ... Σ119 are supplied to the corresponding TFP 120-127, configured accordingly. Here they are simultaneously compressed, and the processing results are fed to the inputs Σ128, where they are synchronously added so that the ACF of the received signal is formed, as shown in Table. 1 - table 4. Depending on the sign of the transmitted bit at the output Σ128, the received signal will have a similar sign.

 Since, in addition to the useful signal, when a station is operating as part of an asynchronous-address communication system, there are signals of many stations at its receiving end, at the same time, at the output of Σ128 there will be signals that can be described by corresponding VKF, in which BL located on the same distance from the center, have the same amplitude values in absolute value. At the same time, ACFs do not have useful BL signals.

 To improve the quality of decoding, the signals from the output of Σ128 are supplied to the BVZ 129 and BVM 130 blocks. In the BVZ 129 block, the sign of the compressed signal is fixed at each moment of time, and its module is calculated in the BVM130 block.

 From the output of the BVM 130, the signal is supplied to the control unit 131, which can be performed according to the scheme described in the book by A. Ovodenko Robust location devices. L .: Publishing house of Leningrad State University, 1981. p. 30, Fig. 2.9. Such a threshold device is robust to a change in the level of interference, which can also include mutual interference of operating stations.

 If the threshold level, which depends on the level of mutual interference, is exceeded by the level of the useful signal, a resolving potential appears at the output of PU 131 and the sign of the useful signal is fed to the BFZPI 132.

 Depending on the sign of the useful signal, a corresponding pulse is generated at the output of the BFZPI 132, normalized by amplitude and duration, and which arrives at DD 133. From the output of DD 133, the received demodulated message arrives at BPS 134, i.e. to the recipient of the information.

 Throughout the operation of the receiving station, from the thirty-seventh output of the BUP 135, clock pulses (SI) that synchronize the operation of the entire device are fed to the corresponding inputs of the corresponding blocks.

 Note that the BU 3 and the BUP 135 can be combined.

 A technical and economic comparison of the proposed method with the prototype showed that the proposed method has higher noise immunity compared to the known due to the fact that at a significant number of positions where BL is located in the compressed signal, their value is zero. This, with an increase in the number of simultaneously operating stations, does not lead to a significant increase in the level of intra-system interference. It is also seen that the use of orthogonal or quasi-orthogonal laws of in-disc modulation also allows you to increase the number of simultaneously working stations in asynchronous mode without increasing the level of intra-system interference.

Designation List
GS 1 - message generator 14
DM 2 - delta modulator 2;
BU 3 - control unit 3;
GTI 4 - generator of clock pulses 4;
DC 5 - frequency divider 5;
BVZB 6 - block marking the sign of bit 6;
And 7, And 8 - schemes And 7 And And 8;
ДшА 9 - address decoder 9;
MF 10 - counter 10 with N states;
GCHMS 11 - generator of a frequency-modulated signal 11;
Cm 12, Cm 13 - mixers 12 and 13;
MS 14, MS 15, MS 16, MS 17 - multiplexers 14, 15, 16, 17;
OR 18, OR 20 - schemes OR 18 and OR 20;
Cl 19, Cl 21 - keys 19 and 21;
GPNCh 22 - subcarrier frequency generator 22;
Σ23, Σ24, Σ25 - adders 23, 24 and 25;
UM 26 - power amplifier 26;
A 27 - transmitting antenna 27;
APR 28 - receiving antenna 28;
LTP 29 - the linear path of the receiver 29;
BOX 30 - block for the formation of quadrature components 30;
ADC 31 - block of analog-to-digital converters 31;
TsChSF 32-47 - digital frequency-selective filters 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46 and 47;
BN 48-63 - normalization blocks 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62 and 63;
CSFD 64-79 - digital matched filters of discrete 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78 and 79;
BVO 80-95 - blocks of the selection of the envelope 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94 and 95;
BFKP 96-111 - blocks for the formation of code sequences 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110 and 111;
Σ112 - Σ119 - adders 112, 113, 114, 115, 116, 117, 118 and 119;
SFP 120-127 - matched filters of sequences 120, 121, 122, 123, 124, 125, 126 and 127;
Σ128 - adder 128;
BVZ 129 - block mark selection 129;
BVM 130 - block allocation module 130;
PU 131 - threshold device 131;
BFZpI 132 - block forming alternating pulses 132;
DD 133 - delta demodulator 133;
BPS 134 - message recipient unit 134;
BUP 135 - reception control unit 135.

Claims (1)

 The method of asynchronous address communication of N subscribers, which consists in the fact that each analog message of each subscriber is independently converted into a sequence of alternating pulses, formed during the duration of each alternating pulse of N discrete, fill each disc with its subcarrier frequency in accordance with the first assigned to each subscriber the main code sequence based on the L-code or the first additional code sequence based on the L-code, each discrete first an explicit code sequence based on the L-code is modulated in frequency according to the first law of changing the frequency inside the discrete, each disc of the first additional code sequence based on the L-code is modulated in frequency according to the second law of changing the frequency inside the discrete, orthogonal or quasi-orthogonal to the first and equal to it in band occupied frequencies, emit generated vibrations in the first frequency band, receive active subscribers all emitted vibrations in the first frequency band, filter the received count fucking, carry out a coordinated filtering of frequency-modulated discs according to the first or second laws of changing the frequency inside the discrete, decode the corresponding or first main code sequence based on the L-code, or the first additional code sequence based on the L-code, carry out the matched filtering or the first main code sequences based on the L-code, or the first additional code sequence based on the L-code, highlight the envelope and sign of the results of the agreed filtering either the first main code sequence based on the L-code, or the first additional code sequence based on the L-code, form a sequence of alternating pulses and convert them into an analog message, characterized in that each of the N generated samples is additionally simultaneously filled with its subcarrier frequency in in accordance with the second additional code sequence based on the L-code assigned to each of N subscribers, or the second main code sequence based on newer of the L-code, each discret of the second additional code sequence based on the L-code is modulated in frequency according to the first law of changing the frequency inside the discrete, each disc of the second main code sequence based on the L-code is modulated in frequency according to the second law of changing the frequency inside the discrete, emit the generated oscillations in the second frequency band, which is equal in magnitude to the first frequency band, are accepted by active subscribers as all the emitted oscillations in the second frequency band, the received oscillations are filtered out, implement a consistent filtering of frequency-modulated samples according to the first or second laws of frequency variation within the samples, decode the corresponding or second additional code sequence based on the L code or the second main code sequence based on the L code and summarize or the results of the matched filtering of the second additional code sequence on based on the L-code with the results of consistent filtering of the first main code sequence based on the L-code or the results of asovannoy filtration second base code sequence based on the L-code with the results of the matched filtering the first additional code sequence based on the L-code.

Images