RU2566500C1 - Method of transmitting information in communication system with noise-like signals - Google Patents

Abstract

FIELD: radio engineering, communication.

SUBSTANCE: method of transmitting information in a communication system with noise-like signals includes dividing each fragment of an array of transmitted data into 3 subarrays during transmission. The first subarray of each fragment is converted into one of predetermined pseudo-random sequences in accordance with a selected coding method; time shift is introduced into said pseudo-random sequence, said time shift being determined by the second subarray of said fragment in accordance with the selected coding method; phase keying is performed based on a law of each of the generated pseudo-random sequences with a time shift. Phase keying is performed over signals of the type sin2πf_nt or sin2πf_nt+π/2 depending on the value of the third subarray, where f_n is carrier frequency, t is a time argument; the noise-like signal sequence is transmitted. Input data of the operation of dividing fragments of arrays of transmitted data into subarrays are the input sequences of the data to be transmitted; operations of converting the first subarray of each fragment into one of predetermined pseudo-random sequences and introducing time shift into each pseudo-random sequence are performed successively over results of the operation of dividing a fragment of an array of transmitted data into subarrays, and the operation of transmitting the noise-like signal sequence is performed over results of the phase keying operation. A combination of n+1 bits of the received fragment is determined during reception.

EFFECT: high rate of transmitting digital information.

2 cl, 1 dwg

Description

The invention relates to the field of transmission of digital information (data) and is intended for use in a digital communication system.

Under the transmission refers to the totality of operations performed at both the transmitting and receiving ends of the communication system. Today, when transmitting digital information, it is most preferable to use noise-like signals (SHPS) (see [1], p. 3). As noted in [1], communication systems with SHPS have advantages over other communication systems both in terms of noise immunity and stealth. As a rule, signals formed as a result of phase manipulation according to the laws of m-sequences are used as SHPS (see [1], section 3.3. P. 49).

One of the common options for encoding information when using m-sequences is the introduction of a cyclic time shift (BC) corresponding to the transmitted symbol in the m-sequence (hereinafter, BC means a cyclic time shift), i.e. converting the transmitted symbol (for example, C _n ) to BC, for example by n · Δf ^-1 (Δf is the width of the operating frequency range) seconds and introducing the specified BC into this m-sequence. The decoding device with this encoding method, in addition to [2], is described, for example, in [3].

The disadvantage of this analogue is as follows. In order for one w-sequence to provide the possibility of transmitting each of all N _c characters of the alphabet, it is necessary that its period N _m be equal to (or exceed) N _c (here the period is expressed in units equal to Δf ^-1 ). The period of any m-sequence in seconds is directly proportional to its duration, i.e. the product N _m · τ of the number of pulses N _m constituting it (terminology according to [1], Section 3.3) by the duration of each of them τ = Δf ^-1 . However, the data transfer rate is inversely proportional to the specified product. The number of bits per one transmitted symbol is log ₂ N _c , and the transmission time of one symbol is inversely proportional to the value of N _c . As a result, as the parameter N _m = N _c increases, the transmission rate provided by the analog decreases as (log ₂ N _c ) / N _c . So, for example, when switching from N _c = 8 to N _c = 32 in the indicated analogue, we have a decrease in the transmission rate by 2.4 times (i.e. (3: 8) / (5:32) = 2.4).

The closest in technical essence to the claimed object is a method of transmitting information in communication systems with ShPS according to the patent of the Russian Federation No. 2277760 [4] (prototype).

The prototype includes the following operations: during transmission, splitting the stream (array) of transmitted symbols of the information signal into subarrays, converting k bits of each of the transmitted symbols (fragments of the transmitted message) into one of the predetermined pseudorandom sequences (PSP), forming each of these PSPs with aircraft determined by a combination of the remaining (nk) bits of the corresponding transmitted symbol and in accordance with the selected encoding method, as well as phase manipulation according to the law of each of the forms nnyh SAPs with said sun, resulting in a stream of transmit NLS, and transmit the obtained at such a transformation NLS sequence; at reception, the implementation of optimal reception to the maximum of the correlation of the received signal with each reference SHPS, formed by phase manipulation according to the law of the corresponding ShPS of one of the predetermined bandwidths, determining the bit of each transmitted symbol by the number of that SHPS with which the specified correlation is maximum, determining the value BC for each received symbol based on the indicated correlation, determining by the value of the specified BC (in accordance with the method inverse to the selected coding method) a combination of ( n-k) bit of the transmitted symbol. The phase manipulation operation in the prototype formula is not mentioned, but it is shown in FIG. 5 of its description as a combination of a carrier frequency generation unit 10 and a multiplier 13.

The principle of operation of the prototype is as follows. A fragment of the transmitted message (in terms of the description of the prototype is the message stream) containing n bits is divided into subarrays of k bits and (nk) bits. A subarray of k bits is encoded by forming the corresponding SRP (in particular, the m-sequence; hereinafter, we consider the SRP and the m-sequence as synonyms), and a subarray of (nk) bits by introducing BC into this SRP. The latter (that is, the introduction of the armed forces) is completely analogous to how it is implemented in [2] (Hereinafter, the operation of forming the SRP is understood as the totality of operations for selecting this SRP from K = 2 ^k possible and its actual formation, the latter can be carried out by reading the selected memory bandwidth from memory that stores arrays of time samples of all K possible memory bandwidths). The process of generating a transmitted signal in the prototype is completed by phase manipulation of the carrier frequency signal, and the law of this manipulation corresponds to the generated SRP with the input of the aircraft. As a result, this signal contains n bits of information, k bits of which are encoded by the selected memory bandwidth and (nk) bits are encoded into this aircraft memory bandwidth. With the equal length of the SRP in the prototype and analogue [2], the number of transmitted bits on the interval of the duration of this SRP (ie, under equal conditions) in the prototype is n, and in the analogue specified only (nk). It should be noted that a result similar to the prototype is achieved in a fundamentally equivalent object described in [5].

The prototype has a relatively low data transfer rate, which is its disadvantage.

The aim of the proposed method is to increase the speed of information transfer.

The goal is achieved by the fact that in the method of transmitting information in a communication system with a ShSS, in which the following operations are implemented:

upon transfer

- each fragment of the array of transmitted data is divided into subarrays;

- convert the first subarray of each fragment into one of the predefined SRP in accordance with the selected encoding method;

- a time shift (BC) is introduced into the indicated PSP, determined by the second subarray of the indicated fragment in accordance with the selected coding method;

- implement phase manipulation according to the law of each of the formed PSP with the armed forces;

- transmit the sequence of SHPS,

and the input data of the operation of separating fragments of arrays of transmitted data into subarrays are the input sequences to be transmitted data, the operations of converting the first subarray of each fragment into one of the predetermined SRPs and introducing aircraft into each SRP are carried out sequentially on the results of the operation of separating a fragment of the array of transmitted data into subarrays, and the operation of transferring the NPS sequence is performed on the results of the phase manipulation operation when admission:

- convert the received signals into electrical;

- determine the maximum correlation of each received SHPS with a set of reference signals;

- determine the number v _{0 of} the reference signal, the maximum correlation of the received SHPS with which is the largest of these;

- based on the result of determining the maximum of this correlation with the v ₀ -th reference signal, determine the value of the aircraft in each received SHPS;

- according to the values of the specified values of v ₀ and BC in accordance with the method inverse to the selected encoding method, determine the combination of n bits of the received fragment,

the changes are introduced, consisting in the fact that

upon transfer

- the number of subarrays into which a fragment of the transmitted data array is divided is 3;

- phase manipulation according to the law of each of the formed SRPs with aircraft, is realized as phase manipulation of signals of the form sin2πf _n t or sin (2πf _n t + π / 2), and the choice of one of these signals is determined by the value of the third subarray, where f _n is the carrier frequency , t is the time argument

upon admission

- when performing the operation of determining the maximum correlation of the received SHPS with the reference signals, phase-manipulated according to the law of each SRP with zero aircraft (such SRP - K = 2 ^k pieces) signals of the form sin2πf _n t and sin (2πf _n t + π / 2);

- perform the operation of generating a set of bits of each received fragment of the data array, taking into account the result of determining the combination of n bits of the received fragment by supplementing this combination with the (n + 1) -th bit, which is assigned a value of 1 or 0, determined by the number of the reference signal v ₀ corresponding to the largest of the correlation maxima.

A flowchart illustrating the combination of operations of the proposed encoding method is shown in FIG. 1, where the following operations are indicated:

- 1 - division of a fragment of the transmitted data array into data subarrays;

- 2 - the formation of the SRP on the 1st subarray of data;

- 3 - introduction to the SSP of the aircraft for the 2nd subarray of data;

- 4 - phase manipulation;

- 5 - transmission of PShS;

- 6 - conversion of received signals into electrical ones;

- 7.1 ... 7.2Κ - determination of the maximum correlation of the received ShPS with the 1st, ... 2Kth reference signal, respectively;

- 8 - determination of the reference signal number v ₀ corresponding to the largest of the correlation maxima;

- 9 - determination of the aircraft at the maximum correlation of the received SHPS with v ₀ -m reference signal;

- 10 - formation of a set of bits of each received fragment of the data array.

For the convenience of comparing the data transfer rate provided during the implementation of the prototype and the claimed object in it, we consider that each used memory bandwidth (for example, m-sequence) contains information about (nk) bits, while its duration is Ν _m · τ, where N _m = 2 ^{nk) and the number of used memory bandwidth is M = 2 ^k .

Operation 1 of dividing a fragment of an array of data to be transferred into data subarrays is implemented as follows. For example, a buffer memory containing n + 1 bits of a fragment of the input array to be transmitted is stored. Next, this fragment is read for subsequent operations, and the buffer memory is loaded with n + 1 bits of the next fragment of the transmitted data array. Reading, for example, the first k bits from the specified buffer memory is carried out by transferring them to the input of operation 2 (formation of memory bandwidth by the 1st data subarray), and reading of the next nk bits by transferring them to the input of operation 3 (introduction to the memory bandwidth of BC 2 -m subarray of data), i.e. the first k bits of the fragment are the 1st data subarray, and the next n-k bits are the 2nd data subarray. In this part, the content of operation 1 completely coincides with the content of the corresponding operation of the prototype. In contrast to the corresponding operation of the prototype in the claimed method, each fragment contains n + 1 bits (there were n bits in the prototype), while the (n + 1) th bit is the third subarray of data (consisting of this one bit) transmitted during its reading at the input of operation 4 (phase shift keying).

This is a one-time operation 1. When the following fragments of an array of data to be transmitted containing (n + 1) bits are received at the input of the claimed object (that is, implementing the claimed method of the device), the described operations are repeated.

The specified control reading the bits of the transmitted information (like all other operations of the proposed method except operations 5 and partially 6) is performed by hardware and software.

According to the results of each single execution of operation 1, a sequential time single implementation of all other operations of the claimed object is realized. A single execution of operation 1 is carried out for a period of time Ν _m τ.

Operation 2 of the formation of the SRP on the 1st subarray of data (hereinafter, for concreteness, we consider the m-sequences as the SRP; as noted above, we consider these two terms synonyms) is fundamentally similar to the operation of the formation of the SRP in the prototype; it provides for the formation of an m-sequence corresponding to a combination of bits of the 1st subarray. The indicated correspondence is established, for example, as follows. Each of the m-sequences existing for a given value of N _m (see [1], Section 3.3.) Is associated with its number (ξ) from the 1st to the Kth (K = 2 ^k ). During operation 2, the m-sequence is formed, the number of which is equal to the binary code of the 1st subarray in the current fragment of the transmitted data array. This formation is carried out, for example, in accordance with the rule illustrated, for example, in [1, the block diagram in Fig. 3.17, p. 54]. Moreover, the parameters of each m-sequence at its required period are set in accordance with [1, Table 3.6, p. 55, 56].

Operation 3 of the introduction to the SSP aircraft for the 2nd subarray of data is performed as follows. For example, during transmission (more precisely, in preparation for transmission) of a piece of data, the 2nd subarray of which is an (nk) -bit binary character code C _μ , during operation 3, an AE of μτ seconds is introduced into the SRP. The introduction of a (cyclic) aircraft in the m-sequence is as follows. Let the initial m-sequence (i.e., a sequence with zero BC) be defined on a time interval of 0 ... N _m · τ, with N _m = 2 ^nk . Then, when a (cyclic) AC is introduced into it by μ · τ seconds, all its time samples located in the interval 0 ... (N _m -1-m _s ) · τ are shifted to the time interval μ · τ ... (N _m -1) · Τ (i.e., they correct the time argument by adding m _s · τ to it), and its time samples, which are in the interval (N _m -μ) · τ ... (N _m -1) · τ, are transferred to the time interval is 0 ... (μ-1) · τ (that is, the time argument is adjusted for them by subtracting from it the quantities (N _m -μ) · τ). This operation is performed completely similar to the corresponding operation of the prototype.

Operation 4 of the phase manipulation basically coincides with the similar operation of the prototype (the combination of blocks 10, 13 and 14 in FIG. 3 of the description of the prototype) with the only difference that in the prototype it is performed with a fixed phase-manipulated signal of the form sin2πf _n t; in the claimed method, this operation is implemented by manipulating the phase of the signal, the initial phase of which is determined by the third subarray of transmitted data. This manipulation is implemented by multiplying the SRP with the BC introduced into it by the function sin (2πf _n t + π / 2) with the value of the bit of the 3rd data subarray equal to “0”, and by the function sin2πf _н t with the value of the bit of the 3rd subarray data equal to "1" (the reverse coding option is possible, which involves the use of the sin2πf _н t function for phase manipulation with the value of the specified bit equal to "0" and the sin function (2πf _н t + π / 2) with the value of the specified bit equal to " 1 ", - this option is equivalent to the one described above). Before the specified multiplication, the array of the SRP samples from the aircraft is modified as follows: all its time samples equal to 0 or 1 are assigned the value -1 or +1, respectively (i.e., in fact, samples equal to 1 do not change with this modification).

Step 5 of the transmission of the NPS is implemented by converting the electrical signals generated as a result of the operation 4, for example (in the case of a sound underwater or sonar system) into acoustic vibrations of the aquatic environment. In this case, it is realized by a sonar emitter [6].

Operation 6 converting the received signals into electrical signals in the considered example of a sound supply system involves the conversion of acoustic vibrations of the aqueous medium into electrical signals. In this case, it is realized by a hydrophone or, in a more complicated case, an antenna array containing a set of hydrophones, a set of delay lines and an adder (see [6], Fig. 1.5b, 1.6 and 1.7). The results of the formation of electrical signals for further processing are digitized; digitization function is implied.

Each v-th (with v = 1 ... 2K) from the operations 7.1 ... 7.2K of determining the maximum correlation of the received SHPS is realized, in particular, by calculating the cyclic correlation function between the input signal and the v-th reference signal or, equivalently, the cyclic convolution between the input signal and the vth reference signal read in reverse time (i.e., if this signal I has the form S (t) with values of the time argument t in the range 0 ... Ν _m · τ, then the same signal read in the opposite time, has the form S (N _m · τ-t)). The reference signal used in calculating the convolution during each of the operations 7.v with v = 1, 3.5 ... 2K-1 (i.e., with odd v) coincides in shape with the phase-manipulated signal generated during phase manipulation of the sin2πf function _n t m-sequence with zero aircraft whose number ξ is defined as ξ = 0.5 · v + 0.5. The reference signal used in calculating the convolution during each of the operations 7.v for v == 2, 4 ... 2K (i.e., for even v) coincides in shape with the phase-manipulated signal generated during phase manipulation of the sin function (2πf _n t + π / 2) an m-sequence with zero BC whose number ξ is defined as ξ = 0.5 · v (In the reverse coding version specified in the description of operation 4, the correspondence of the odd and even indices v with phase-manipulated functions is reversed).

The set of operations 7.1 ... 7.2K in terms of the calculation of cyclic convolution can be represented as follows. The convolution can actually be calculated in two quadrature channels (this is almost always the case). Moreover, the support functions used in two quadrature channels differ from each other only in that one of them is phase shifted relative to the other by π / 2. Each pair of operations 7.1 and 7.2, 7.3 and 7.4 ..., and so on to a pair of operations 7.2K-1 and 7.2K, exactly corresponds to the operation of calculating convolution in two quadrature channels. Moreover, the described set of operations can be represented as K operations of convolution calculation in two quadrature channels. Moreover, the results of each of these convolutions are arrays of N _m complex numbers uncorrelated among themselves, i.e. as a result of performing the set of K operations described, a set of 2K arrays of uncorrelated real numbers is formed that completely coincide with the results described above for performing 2K operations 7.1 ... 7.2K (in terms of the execution of convolution calculation operations). Thus, the embodiment of K two-channel (i.e., with two quadrature processing channels each) operations for determining the maximum correlation of the received BSS with the reference signals 7.1 ... 7.K instead of 2K single-channel 7.1 ... 7.2K is not only equivalent to that shown in FIG. 1 and described in the claims, but also completely coinciding with it in a mathematical description.

When performing each of the operations 7.1 ... 7.2K, the above operation of calculating the cyclic convolution is supplemented by the operation of finding the maximum of this convolution and determining the value of the time index (convolution time argument) n _max at which this maximum takes place.

The operation of computing the cyclic convolution is described, for example, in [7, Section 2.23, where the term “circular convolution” is used instead of the term “cyclic convolution”]. It provides for the calculation of discrete Fourier transform (DFT) operations from the support function and from the temporal implementation of the processed signal, vector multiplication of arrays obtained by performing the indicated DFT operations, and the inverse DFT operation from the array of the results of this multiplication. Each convolution contains 2 ^nk samples generated with a sampling period of at least τ. In the framework of the present description, the simplest situation is considered in which the convolution sampling period is τ.

The operation of finding the maximum of each convolution obtained is based on comparing all its time samples, for example, as follows: the entire array of 2 ^nk samples is divided into two subarrays at the first iteration, containing 2 ^nk samples located in the convolution in odd and even time positions , and compares the samples of the same name from each subarray (i.e., the first sample from the first subarray with the first from the second subarray, etc.) while holding the maximum of each pair of samples; as a result, an array of 2 ^nk-1 results is formed, while the arguments (indices) of time, to which the held samples correspond, are also stored; then the specified procedure at the second iteration is repeated over an array of 2 ^nk-1 samples obtained as a result of the first iteration, etc. As a result of performing nk of such iterations, the maximum level sample U _{max v was} obtained (in each v-th convolution realized during operations 7.1 ... 7.2Κ) and the time index n _{max v} corresponding to this sample is obtained.

It is also possible to find the maximum of each convolution obtained, which involves comparing the first and second samples with preserving the maximum of them and the corresponding time argument, then comparing this saved sample with the third sample and also storing the maximum of them and the corresponding time argument, etc. . with the formation in the end of the reference, which is the maximum in the convolution, as well as the corresponding time argument.

All 2K determination results maxima U _{max v} and 2K corresponding time index n _{s v} are transmitted to the inputs of realizing operation 8 (i.e., unit 8 implements the operation actually has 2K inputs FIG 1 only two are shown conventionally from. them - the first and 2Kth).

The operation 8 of determining the number of the reference signal v ₀ corresponding to the largest of the correlation maxima is implemented in exactly the same way as during operations 7.1 ... 7.2K the time argument was found corresponding to the maximum of each convolution obtained (in this case, the number of the reference signal v plays the role of the time argument). The resulting number v ₀ from the block that implements step 8 is input to the block that performs step 10 of forming the set of bits of each received fragment of the data array. In addition, the block that implements operation 8 translates an array of time samples of the results of calculation of convolution (correlation) from the output of the v _0th of the blocks performing operations 7.1 ... 7.2K to the input of the aircraft determination unit 9 with the maximum correlation of the received BPS with v ₀ th reference signal. This translation can be carried out in the simplest (from the point of view of minimizing the number of connections shown in Fig. 1) embodiment of the transfer to the block performing operation 8 of the results of the calculation of convolution (correlation) from the outputs of all blocks performing operations 7.1 ... 7.2K, followed by by selecting from them in this block and transmitting for further determination of aircraft (operation 9) the results of the operation 7.v ₀ .

Operation 9 determine the aircraft at the maximum correlation of the received ShPS with v ₀ -th reference signal provides for the calculation of the desired aircraft as

BC = n _{max v0} · τ,

where n _{max v0} is the value of n _{max v} at v = v ₀ .

The operation 10 of forming a set of bits of each received fragment of the data array is implemented as follows. The input of the block performing this operation receives the reference signal number v ₀ (one of the results of operation 8) and the value of BC (result of operation 9). The first k received fragments coincide with the binary code of the 1st subarray (see the description of operation 2 above), which, in turn, is given by the number of the corresponding m-sequence ξ, defined as ξ = [0.5 · v ₀ ] (square brackets mean the operation of rounding the numbers in parentheses to the whole). The next nk bits of the received fragment are determined by the value of BC; the rule for converting this BC value to the specified nk bits is the reverse of the rule for converting nk bits to BC used in the implementation of operation 3. Operation 10 in terms of the above two functions, which result in the formation of n bits of the received message fragment, coincides with the similar prototype operation. The last (n + 1) -th bit of the received fragment is defined as “0” or “1” with v ₀ even or odd, respectively, therefore this bit is formed based on the parity analysis of the parameter v ₀ . The result of operation 10 is the formation of an (n + 1) -bit binary code in which all bits are located in the above order (see the words in this paragraph shown in italics).

It is possible to implement the description of the inventive method of the inventive concept also in the following embodiments. First, instead of the phase-controlled oscillation sin (2πf _n t + π / 2), it is possible to use the oscillations sin (2πf _n t + π) or sin (2πf _n t + 3π / 2). At the same time, while maintaining the value of the achieved positive effect, nothing will change in the claimed object, except for recording the indicated fluctuation during operations 4 and 7.1 ... 7.2K.

Secondly, all four oscillations can be used as a phase-controlled oscillation, namely sin2πf _n t, sin (2πf _n t + π / 2), sin (2πf _n t + π) and sin2πf _n t + 3π / 2) . In this case, the third data array arriving at the control input of the block performing operation 4 contains 2 bits of information, and, for example, the operations of determining the maximum correlation of the received BSS with the reference signals are implemented in an embodiment using correlators with two quadrature channels (this embodiment of this operation described above), and subsequent operations are implemented based on the analysis of the initial phase of each received PSH. In this embodiment of the method, for the transmission time interval of one message fragment, n + 2 bits of information are transmitted.

A third embodiment of the transmission method is also possible, which instead of the phase shift keying used in the above-described variants (based on the information of the third data subassembly) of the transmitted BSS relative phase shift keying (OFM) or phase difference keying [8, Section 1.2.]. In this case, for example, with binary OFM, when the bit value of the third half-array of the current data fragment is “0”, the carrier wave is subjected to phase manipulation with the same initial phase (ie sin2πf _n t or sin (2πf _n t + π / 2)), which occurred during the transmission of the previous piece of data. If the bit value of the third half-array of the current data fragment is “1”, the carrier wave undergoes phase manipulation with the initial phase, alternative to that which occurred during the transmission of the previous data fragment (that is, if the vibration phase sin2πf was manipulated during the transmission of the previous fragment _n t or sin2πf _n t + π / 2), then during the transfer of the current phase is manipulated, respectively, oscillations sin2πf _n t or sin (2πf _n t + π / 2)).

These development options of the proposed method are equivalent to the option given in the claims of the claimed invention.

The above description of all operations of the method relates to a single execution of each of them. When a block that implements step 1 arrives at the input multiple times, fragments of the transmitted message (a data stream that is divided into fragments during operation 1), all of these operations will be performed repeatedly and sequentially in time as each of them increases in the flowchart shown in FIG. one.

The inventive object is designed for use in a synchronous communication system. In such a system, at the receiving end, the moments of the beginning of the arrival of each information signal are known. In this case, it is fundamentally possible, for example, the option of the transmitter and receiver in a single time system. In this case, the operation of devices that implement, at the transmitting end of the communication system, the functions of generating the NPCs to be transmitted is synchronized by the input bit stream of the symbol bits to be transmitted. As for the synchronization of the operation of devices that implement signal processing operations at the receiving end, the propagation time of the signal from the transmitter to the receiver is known, and the equipment that implements the reception operations includes a timer that generates a synchronization signal that controls the execution of all operations that are implemented during reception (except for the operation 6 conversion of received signals into electrical) at the time of the start of the arrival of the next fragment of the transmitted stream. At the time of formation of this signal, filling with the received signal of the first fragment of the buffer memory of the blocks implementing the operations 7.1 and 7.2 begins. Further, after a time interval (from the moment of formation of the indicated conditionally first synchronization signal) equal to N _m · τ, the next synchronization signal is generated; at the same time, filling in the second fragment of the buffer memory of the blocks implementing the operations 7.1 and 7.2 with the received signal begins, and the operations that calculate the cyclic convolution are performed on the signals stored in the first fragments of the buffer memory, then the other operations 8 ... 10 are sequentially performed. Further, after a time interval (from the moment of formation of the conditionally specified first synchronization signal) equal to 2 · _m · τ, a conditionally third synchronization signal is formed; at the same time, filling with the received signal of the first feather fragment of the buffer memory of the blocks implementing the operations 7.1 and 7.2 begins, and the signals stored in the second fragments of the buffer memory carry out the operations of calculating the cyclic convolution, then sequentially other operations 8 ... 10, etc.

These synchronization operations are not included in the composition of the claimed object, since the vast majority of digital (discrete) communication systems are synchronous, and the features of the claimed object are not associated with any specific features of the totality of these operations.

Operations 1 ... 4, 6 (in the part not shown as part of the claimed object, but the implied function of digitizing signals) and 7 ... 10 are implemented by programmable digital signal processing.

The principle of operation of the claimed object substantially coincides with the principle of operation of the prototype, with the only difference being that if in the prototype the amount of information transmitted for each m-sequence was n bits, then in the claimed object the amount of information transmitted for the same time is ( n + 1) bit. In this case, the effect of increasing the data transfer rate by (n + 1) / n times is achieved.

Literature

1. Varakin L.E. Communication systems with noise-like signals. M .: Radio and communication. 1985.338 s., Ill.

2. Nikolaev R.P., Popov A.R. A method of transmitting information in a communication system with noise-like signals. RF patent No. 2286017.

3. Krantz V.Z., Sechin V.V. Using information symbols to synchronize a communication system with complex signals // Hydroacoustics. Vol. No. 15, 2012. S. 36-41.

4. Ozerov I.A., Ozerov S.I. A method of transmitting information in communication systems with noise-like signals and a software product. RF patent No. 2277760.

5. Kwon Η.Μ., Birdsal T.G. Digital Waveform Codings For Ocean Acoustic Telemetry. IEEE Journal of Oceanic Engineering, vol. 16, No. 1, January 1991. P. 56-65.

6. Smaryshev M.D., Dobrovolsky Yu.Yu. Hydroacoustic antennas. Directory. L .: Shipbuilding. 1984.

7. Rabiner L., Gould B. Theory and application of digital signal processing. M .: World. 1978.

8. Okunev Yu.B. Digital transmission of information by phase-modulated signals. M .: Radio and communication. 1991.296 s .; silt.

Claims (2)

1. The method of transmitting information in a communication system with noise-like signals (SHPS), which consists in the fact that the transmission
- each fragment of the array of transmitted data is divided into subarrays;
- convert the first subarray of each fragment into one of the predefined pseudo-random sequences (PSP) in accordance with the selected coding method;
- a time shift (BC) is introduced into the indicated PSP, determined by the second subarray of the indicated fragment in accordance with the selected coding method;
- implement phase manipulation according to the law of each of the formed PSP with the armed forces;
- transmit the sequence of SHPS,
and the input data of the operation of separating fragments of arrays of transmitted data into subarrays are the input sequences to be transmitted data, the operations of converting the first subarray of each fragment into one of the predetermined SRPs and introducing aircraft into each SRP are carried out sequentially on the results of the operation of separating a fragment of the array of transmitted data into subarrays, and the operation of transmitting the NPS sequence is performed on the results of the phase manipulation operation
upon admission:
- convert the received signals into electrical;
- determine the maximum correlation of each received SHPS with a set of reference signals;
- determine the number ν _{0 of} that reference signal, the maximum correlation of the received SHPS with which is the largest of these;
- based on the result of determining the maximum of this correlation with the ν ₀ -th reference signal, determine the value of the aircraft in each received SHPS;
- according to the values of the specified values ν ₀ and BC in accordance with the method inverse to the selected encoding method, determine the combination of n bits of the received fragment,
characterized in that
upon transfer
- the number of subarrays into which a fragment of the transmitted data array is divided is 3;
- phase manipulation according to the law of each of the formed SRPs with aircraft, is realized as phase manipulation of signals of the form sinπf _н t or sin (2πf _н t + π / 2), where f _н is the carrier frequency, t is the time argument, and the choice of one of these signals is determined by the value of the third subarray,
upon admission
- when performing the operation of determining the maximum correlation of the received BSS with the reference signals, phase-manipulated signals of the form sin2πf _n t and sin (2πf _n t + π / 2) are used as phase-manipulated according to the law of each SRP (such SRP - K = 2 ^k pieces);
- perform the operation of generating a set of bits of each received fragment of the data array, taking into account the result of determining the combination of n bits of the received fragment by supplementing this combination with the (n + 1) -th bit, which is assigned a value of 1 or 0, determined by the number ν _{0 of the} reference signal ν ₀ , corresponding to the largest of the correlation maxima. 2. The method of transmitting information in communication systems with a NPS according to claim 1, characterized in that when numbering the reference signals used in the operation to determine the maximum correlation of the received NPS with the reference signals, even (odd) values of their numbers ν correspond to phase-shifted signals of the form sin (2πf _н t + π / 2) (respectively sin2πf _н t), the choice for phase manipulation from signals of the form sin2πf _н t or sin (2πf _н t + π / 2) during transmission is carried out with the value of the third subarray equal to 1 or 0, respectively , and when performing the formation operation the set of bits of each received fragment of the data array, the (n + 1) -th bit is assigned the value 1 or 0 with the odd or even value of the number ν _0, respectively.