EP2747328A1 - Method for jamming communications in an open-loop controlled network - Google Patents

Abstract

The method involves establishing a local jamming situation at the level of each of friendly reception platforms, and measuring jamming signals received by the platforms and originating from jammers. Fratricidal jamming levels are estimated based on the measurement of the jamming signals. One of configuration parameters such as a frequency plan, and/or temporal positionings of the transmissions, antenna diagrams and/or orientations, radio access schemes and modulation/coding schemes is determined for each of transmission platforms, so as to be utilized in transmission and/or reception.

Description

The invention relates to a scrambling method with optimization of the efficiency and limitation by open loop control of the fratricidal effects on telecommunications stations associated with a communications network to be preserved.

The method according to the invention applies, for example, to scrambling certain selected communication links between entities external to the network to preserve while maintaining the communications links in the communications network.

The joint use by the same force of communications and jammer networks (or jammer networks) in a theater of operations in the broad sense, and particularly in ground convoys, in aircraft squadrons and in squadrons. ships, is often very penalized by the absence of precise control of the effects induced by the jammer (s) on the signal station (s) of the force network (s).

The technical problem to be solved for the transmission networks and the interferers used together is to limit the fratricidal effects of the jammers on the transmission stations, while guaranteeing an effectiveness at least of the interference on the targets or the sectors of interest of the theater .

A first optimization method described in the applicant's patent application FR 03578 relies on the establishment of centralized closed-loop control. This process responds to the problem by resorting to a jammer master station, which can not be suitable for all technical and operational situations. There is currently a need for a method to solve the open loop technical problem, implementing decentralized decisions at the level of each transmitting and receiving station.

Definitions:

• Brouilleur : système d'émission capable d'émettre un signal destiné à empêcher le fonctionnement de tout ou partie des équipements utilisant le spectre électromagnétique (postes de transmission, radar ou systèmes de navigation présents sur le théâtre d'opération). Un brouilleur est désigné dans la suite de la description par les lettres Br, le signal de brouillage par b, le vecteur signal de brouillage par B.
• Réseau de brouilleurs : ensemble coordonné de système d'émissions adaptés à émettre des signaux destinés à empêcher le fonctionnement de tout ou partie des équipements utilisant le spectre électromagnétique présents sur le théâtre d'opération.
• Poste de transmission « ami » ou « poste ami » : poste de transmission défini comme faisant partie du système de communications à préserver et devant être protégé des effets du brouillage.
• Réseau de transmission « ami » ou « réseau ami » : ensemble interconnectable de postes de transmission « amis ».
• Emission amie : émission provenant d'un poste ami ou d'un brouilleur ami.
• Equipement « cible » : équipement défini comme devant être affecté par le brouillage.
• Brouilleur communicant : brouilleur doté d'un poste de transmission « ami ».
• Réseau de Brouilleurs communicants : réseau de brouilleurs dotés de postes de transmission « amis », constituant un sous-réseau de transmissions amies.
• Brouillage d'un équipement cible : Emission d'un signal ou de plusieurs signaux, depuis un brouilleur ou depuis un réseau de brouilleurs, de façon à ce que l'équipement cible se voit empêché de mettre en oeuvre ou de maintenir son service.
• Brouillage d'une zone géographique : Emission d'un signal ou de plusieurs signaux, depuis un brouilleur ou depuis un réseau de brouilleurs, de façon à ce que tout équipement cible présent sur la zone géographique se voit empêché de mettre en oeuvre ou de maintenir son service.
• Détection d'un signal : capacité à décider de la présence d'une émission amie ou provenant d'une entité externe et à intercepter le signal. Cette détection est effectuée dans la bande et la durée d'analyse d'un ou plusieurs intercepteurs, module d'analyse ou fonction de détection ou « sensing » qui peuvent être, par exemple, hébergés par les postes de transmissions amis ou en connexion directe avec les postes amis.
• Détection d'un émetteur : capacité à décider de la présence d'un émetteur sur le théâtre par détection du ou des signaux qu'il émet.
• Localisation d'un émetteur : capacité à décider du lieu d'un émetteur sur le théâtre par détection du signal ou des signaux qu'il émet.
• SISO : entrée simple sortie simple : se dit d'un système d'émissions à une voie émettrice Tx, une voie réceptrice Rx.
• SIMO : entrée simple sortie multiple : se dit d'un système d'émissions à une voie Tx, N voies Rx.
• MISO : Multiple Input, Single Output : se dit d'un système d'émissions à M voies Tx, une voie Rx.
• MIMO : Multiple Input, Multiple Output : se dit d'un système d'émissions à M voies Tx, N voies Rx.
• CIR : Channel Impulse Response : se dit de la réponse impulsionelle du canal de transmission, considéré comme un filtre à réponse finie.

Le terme matrice désigne une matrice de canal.

• Scrambler: A transmission system capable of transmitting a signal intended to prevent the operation of all or part of the equipment using the electromagnetic spectrum (transmission stations, radar or navigation systems present in the theater of operation). A scrambler is designated in the following description by the letters Br, the scrambling signal by b, the interference signal vector by B.
• Interference network : A coordinated set of emissions systems adapted to emit signals intended to prevent the operation of all or part of the equipment using the electromagnetic spectrum present in the theater of operation.
• "Friend" or "friendly station" transmission station: transmission station defined as part of the communications system to be preserved and to be protected from the effects of interference.
• "Friend" or "Friend Network" transmission network : interconnectable set of "friend" transmission stations.
• Friend broadcast : broadcast from a friendly post or a friend jammer.
• "Target" equipment: Equipment defined as to be affected by interference.
• Communicating jammer: jammer with a "friend" transmission station.
• Network of communicating jammers: network of jammers with "friendly" transmitting stations, constituting a subnet of friendly transmissions.
• Interference of a target equipment: Issuance of a signal or several signals, from a scrambler or from a jammer network, so that the target equipment is prevented from implementing or maintaining its service.
• Scrambling a geographical area : Transmitting a signal or several signals, from a jammer or from a jammer network, so that any target equipment present in the geographical area is seen prevented from implementing or maintaining his service.
• Signal Detection : Ability to decide whether to have a friendly broadcast or from an external entity and to intercept the signal. This detection is performed in the band and the analysis time of one or more interceptors, analysis module or detection or "sensing" function that can be, for example, hosted by the friendly transmission stations or in direct connection with friends posts.
• Detection of a transmitter : ability to decide the presence of a transmitter in the theater by detecting the signal or signals it emits.
• Location of a transmitter : ability to decide the location of a transmitter in the theater by detecting the signal or signals it emits.
• SISO : simple single-output input: refers to an emission system to a Tx transmitter channel, an Rx receiver channel.
• SIMO: single input multiple output: is a single-channel transmission system Tx, N Rx channels.
• MISO : Multiple Input, Single Output: refers to a transmission system with M Tx channels, an Rx channel.
• MIMO : Multiple Input, Multiple Output: refers to a transmission system with M channels Tx, N channels Rx.
• CIR : Channel Impulse Response: refers to the impulse response of the transmission channel, considered as a finite-response filter.

The term matrix designates a channel matrix.

The field of jamming has been the subject of many works and inventions. However, the fratricidal effects are still badly treated in the developments known to date. In general, the constraints associated with the implementation of methods and systems known to the Applicant have the effect of drastically limiting the scope and the number of simultaneous friendly radio communications, or even to prevent the use of friendly radio communications.

The object of the present invention concerns, in particular, a method that will effectively limit fratricidal effects with sufficient flexibility and scope, to simultaneously allow scrambling of targets or areas to scramble and the operation of communications between posts friendly in an operational context.

• les brouilleurs suivent des plans de fréquence, motifs temporels et formes d'ondes connus des émetteurs/récepteurs amis, ou aisément reconnaissables à l'analyse in situ parmi un ensemble connu à l'avance,
• les émetteurs amis mettent en oeuvre des séquences de signaux détaillées dans la suite de la description,
• les récepteurs amis puissent réaliser les mesures sur les signaux de brouillage et les signaux amis pour élaborer une situation de brouillage locale et une situation de réception locale, et pour décider de la meilleure stratégie d'émission/réception pour les liens de communication en cours ou en cours d'établissement.

The invention can be implemented on friendly stations employing multiple waveforms provided that:

• the jammers follow frequency plans, time patterns and waveforms known from the friendly transmitters / receivers, or easily recognizable by in situ analysis among a set known in advance,
• the friendly transmitters implement signal sequences detailed in the rest of the description,
• the friendly receivers can perform the measurements on the interference signals and the friendly signals to develop a local jamming situation and a local reception situation, and to decide on the best transmission / reception strategy for the current communication links or in the process of establishment.

• E₀ : Etablir une situation de réception locale : au niveau de chacune des N plateformes de réception amies mesurer, E₁, les signaux de communication Su amis reçus par lesdites plateformes en provenance des M émetteurs amis, à partir desdites mesures, pour chacune des N plates-formes de réception amies, estimer, E₂, les M niveaux utiles reçus et les M canaux de propagation utiles, N*M estimées,
• E₃: Etablir une situation de brouillage locale : au niveau de chacune des N plateformes amies de réception mesurer, E₄, les signaux de brouillage reçus par lesdites plateformes de réception amies en provenance des J brouilleurs, à partir des mesures des signaux de brouillage, pour chacune des N plates-formes de réception amies, estimer, E₅, les J niveaux de brouillage fratricides reçus et les J canaux de brouillage fratricides, N*J estimées en tout,
• connaissant a priori les formes d'ondes des signaux de brouillage et les paramétrages associés, à partir des états de la situations locale de brouillage établie par chacune des N plateformes réceptrices sur les J signaux provenant des J brouilleurs, à partir de la situation locale de réception établie par chacune des N plateformes réceptrices sur les signaux de communication utiles Su, déterminer pour chacune des M plateformes émettrices amies et pour chacune des N plateformes réceptrices amies, au moins un des paramètres de configuration suivants : un plan de fréquence, et/ou des positionnements temporels des émissions, des diagrammes et/ou orientations d'antenne, des schémas d'accès radio et des schémas de modulation/codage des signaux émis et reçus, le ou les paramètres étant adaptés à minimiser ou éliminer les effets fratricides sur les N plateformes amis de réception,
• utiliser lesdits paramètres de configuration en émission et/ou réception pour les M plateformes d'émission amies et les N plateformes de réception amies.

The invention relates to a method for adaptively and decentrally minimizing the fratricidal effects induced by the scrambling of ZB zones or predefined positions in a communications network comprising friendly transmitters, jammers and receivers, said network comprising N_pl platforms, a number M ≤ N_pl of said platforms, said friendly transmission platforms being equipped with antennas and transmission systems of useful transmission signals dynamically configurable, a number N ≤ N_pl of said platforms, also known as friends, being equipped with antennas and dynamically configurable systems for receiving useful transmission signals, a number J ≤ N_pl of said platforms being equipped with jamming systems and antennas having known characteristics of the transmitting and receiving platforms, said jamming systems and antennas being adapted to prevent transmissions between entities external to said network of friendly platforms, said platforms constituting a network, characterized in that it comprises at least the following steps:

• E ₀ : Establish a local reception situation: at each of the N friendly reception platforms measure, E ₁ , the communication signals Su friends received by said platforms from the M friendly transmitters, from said measurements, for each of N receiving platforms, estimate, E ₂ , the M useful levels received and the M useful propagation channels, N * M estimated,
• E ₃ : Establish a local interference situation: at each of the N receiving host platforms measure, E ₄ , the interference signals received by said receiving platforms from the jamming Js, from the measurements of the jamming signals for each of the N friendly receiving platforms, estimate, E ₅ , the J received fribricidal interference levels and the J fribricidal jamming channels, N * J estimated in all,
• knowing a priori the waveforms of the interference signals and the associated settings, from the states of the local jamming situation established by each of the N receiving platforms on the J signals from the interfering Js, from the local situation of reception by each of the N receiving platforms on the useful communication signals Su, determining for each of the M friendly sending platforms and for each of the N friendly receiving platforms, at least one of the following configuration parameters: a frequency plan, and / or temporal positioning of the transmissions, diagrams and / or orientations of the antenna, radio access schemes and modulation / coding schemes of the transmitted and received signals, the parameter or parameters being adapted to minimize or eliminate the fratricidal effects on the N receiving friend platforms,
• using said configuration parameters in transmission and / or reception for the M friendly transmission platforms and the N friendly receiving platforms.

After having defined a first set of configuration parameters of the M friendly platforms and the N friendly platforms, the method will repeat the steps E ₀ to E ₅ over time in order to maintain and optimize the configuration parameters of the platforms.

The method uses, for example, the measurement of the propagation channels from the J jamming platforms, to recognize in situ a predefined and known scrambling strategy in order to jointly optimize the transmission and quality of useful transmissions at the platform level. friendly transmitters and receivers by adapting transmission power levels and / or frequency plans and / or time positioning of emissions and / or space-time coding schemes and / or access protocols to the radio resource employed by the transmitters and the receivers friends.

The method may use scrambling signals which, in a manner known to friendly receivers, encode the information useful to the friendly transmitters and receivers to inform them of the scrambling strategy employed, the characteristics of the interference waveforms and associated parameters, transmission power, type of diagram and orientation of the antennas, position, altitude, to facilitate the joint optimization of the transmissions and the processing in reception of useful transmissions at the level of the friendly transmitting and receiving platforms, said coded information being reconstructed by analyzing the interference signals received by the decoded or decoded receivers in the interference signals received by the friendly receivers.

According to an alternative embodiment, the method uses, for example, programmable friendly transmitters and receivers adapted to dynamically take into account transmission instructions, on the power and / or on time parameters, the waveform, the spatio-temporal coding, phase amplitude weighting of antenna elements.

The method can be used in transmission networks using the MIMO, MISO, SIMO or SISO protocols with or without feedback from the friend receivers to the friendly transmitters.

The method can also be used in a radio network comprising receivers adapted to measure transmission channel values on the wanted transmitters and on the jammers.

According to another variant, the method may be used in a radio network comprising one or more reception stations comprising antenna elements coupled to an interceptor adapted to carry out transmission channel measurements on the useful transmitters and on the jammers.

The process is decentralized decision and own to each link transmitter friend friend receiver. It exploits in particular the environmental measurement capabilities at work in modern modems (SISO, MISO, SIMO and MIMO depending on the case). It also exploits the knowledge, a priori by the receiving transceivers friends, frequency plans, patterns and waveforms scrambling, which makes them easily recognizable by the posts friendly with a minimum analysis, held at the same time as the EIF measurements and the informed equalization processes specific to modern modems. Moreover, the frequency patterns, time patterns and coding modulation schemes specific to the friendly links can also be predefined in advance with a reduced set of parameters, and adapted to the current situation in the radio situation, according to the frequency channel occupancy, time patterns, and interference waveforms. The analysis requirements in the friendly transmitters / receivers are then reduced and the decision-making on the adaptation of the friendly communication signals is then simplified.

• La figure 1, un exemple d'architecture du système selon l'invention,
• La figure 2, un exemple formel de modèle de canal de propagation généralisé au cas MIMO, avec définitions et notations des grandeurs géométriques et physiques afférentes,
• Les figures 3A, 3B, une illustration des notions de graphe et de macrographe réseau, utilisées pour décrire les liens entre postes amis (Tx, Rx), les interactions entre brouilleurs Br et entités externes à brouiller,
• La figure 4, un produit logique entre graphe réseau et matrice canal, définissant une matrice de canal généralisée qui tient compte à la fois des liens ou interactions entre les acteurs, émetteurs récepteurs, brouilleurs, zones ou points à brouiller, et des canaux de propagation entre ces acteurs.

Other features and advantages of the present invention will appear better on reading the description given by way of illustration and in no way limiting attached to the figures which represent:

• The figure 1 , an example of architecture of the system according to the invention,
• The figure 2 , a formal example of a propagation channel model generalized to the MIMO case, with definitions and notations of the related geometric and physical magnitudes,
• The Figures 3A , 3B , an illustration of the notions of graph and network macrograph, used to describe the links between friendly stations (Tx, Rx), the interactions between scramblers Br and external entities to scramble,
• The figure 4 , a logical product between network graph and channel matrix, defining a generalized channel matrix that takes into account both the links or interactions between the actors, transceivers, jammers, zones or points to be scrambled, and propagation channels between these actors .

The following example is given as an illustration and in no way limiting for a communication system comprising N_pl transmission platforms that have MIMO, MISO, SIMO or SISO communication stations.

The figure 1 schematizes an example of network architecture in which the method according to the invention can be implemented.

One or more receiving stations Rx ₁ , Rx ₂ ,..., Rx _N are in point-to-point or point-to-multipoint connection via radio communication, for example with M = N_pl - 1 ≤ N_pl platforms or transmitter / receiver stations 10, that is, stations equipped with a transmitting part Tx and a receiving part Rx. The M friendly platforms are equipped with 10th antennas and 11 dynamically configurable systems for transmitting useful transmission signals.

The network comprises a number N ≤ N_pl said platforms, also called friends, being equipped with 12r antennas and systems 13 dynamically configurable reception of useful transmission signals.

Among these N_pl platforms, a number J ≤ N_pl platforms "interferer" B _r1 , ... B _rJ have system 14 and an interference antenna 15b, omnidirectional type, directive type or network type. The emission characteristics of the systems and antennas are known from the friendly platforms. The transmission characteristics are chosen in particular to prevent transmissions between entities external to said network of friendly platforms, said platforms constituting a cross-platform network.

The friendly platforms (jammers or without jammer) thus define an inter-platform communications network which appears, if we consider all antenna elements, as a macro-network. On the figure 1 there is also shown an area to scramble ZB in which can be found radio equipment external to the network of friendly positions. Each receiving station Rx ₁ to Rx _N receives M transmitting stations T _x1 ... T _xM , useful communication signals friends. A station performs Nsr received signal level measurements and channel impulse responses. Each station also receives jammers B _r1 , ... B _rJ , interference signals Sb on which it is informed (ie it knows a priori the main characteristics) and can also conduct level measurements. of received interference signal Nbr and channel impulse responses.

Each station is equipped with a device adapted to manage, at any moment, the communication links with the other stations, the device being, for example, a decentralized decision-making and local control organ 20 and specific to each transmitter / receiver link friend.

The decision elements correspond, for example, to the MAC access layer of a terminal or a master station. A station comprises a processing device receiving the information on the signal friend, signal scrambling, the values of the associated channels and which is adapted to deduce therefrom the values of the transmission / reception parameters which make it possible not to disturb the links between friends.

1. I : lien commun classique incluant l'ensemble des mesures effectuées sur les liens de communications ou en anglo-saxon « reporting » (mesures effectués par les postes amis ou par des intercepteurs amis au profit des postes amis sur les séquences de signaux émis par les émetteurs amis Tx, ) retransmis le cas échéant par voie retour vers les postes Tx amis,
2. II : lien comprenant le compte-rendu ou « reporting » des mesures sur signal brouilleur, i .e. l'ensemble des mesures effectuées sur les signaux brouilleurs (mesures effectués par les récepteurs amis ou par des intercepteurs au profit des postes récepteurs amis sur les séquences de signaux émis par les brouilleurs Br, informations retransmises le cas échéant par voie retour vers les postes Tx amis),
3. III : lien de commande des brouilleurs à partir des informations collectées par les récepteurs ou intercepteurs sur la plate forme du brouilleur (ou en liaison avec celle-ci) et de l'organe de décision local propres aux liens Tx amis Rx amis, et
4. IV : émission des signaux de brouillage vers la zone visée ZB et/ou vers les entités externes Ci au réseau amis.

Communication links are represented on the figure 1 as follows :

1. I: classical common link including all the measurements made on the communication links or in English "reporting" (measurements made by the friendly posts or by friendly interceptors for the benefit of the friendly posts on the sequences of signals emitted by the transmitters Tx friends,) retransmitted as appropriate by way back to the Tx friends posts,
2. II: link including reporting or "reporting" of interfering signal measurements, i .e. all the measurements taken on the interfering signals (measurements made by the friendly receivers or by interceptors in favor of the receiving receivers on the signal sequences sent by the scramblers Br, information retransmitted, if necessary by way back to the Tx stations friends),
3. III: control link of the jammers from the information collected by the receivers or interceptors on the platform of the jammer (or in connection with it) and the local decision-making body own links Tx friends Rx friends, and
4. IV: transmission of interference signals to the target area ZB and / or external entities Ci to the network friends.

• les enregistrements/mesures des signaux de communication reçus par des intercepteurs, modules d'analyses et fonction d'appréhension de l'environnement (ou « sensing » en anglais) dédiés qui sont par exemple co-localisés ou intégrés avec au moins l'un des postes amis,
• les enregistrements/mesures des signaux de brouillage interférant avec les postes amis, par des intercepteurs, modules d'analyses et fonction de sensing dédiés qui sont par exemple co-localisés ou intégrés avec au moins l'un des postes amis,
• une description formelle des interactions entre postes émetteurs amis Tx, postes récepteurs amis Rx, brouilleurs Br et entités externes à brouiller Ci, par des graphes et macro-graphes qui seront précisés dans la suite,
• sur un modèle général de propagation du canal de transmission, généralisé à la prise en compte des interactions effectives entre postes émetteurs et récepteurs amis (Tx Rx) (généralement intégrés ensemble au sein d'un poste de transmission ami), brouilleurs Br et entités externes Ci, au travers d'une notion de matrice canal généralisée précisée dans la suite,
• sur la mise en forme puis sur la résolution partielle d'un problème d'optimisation sous contraintes, précisé dans la suite,
• des brouilleurs programmables et dynamiquement configurables en terme de forme d'onde (enveloppe, modulation, amplitude, phase, etc.), pour lesquels sont connus les plans de fréquence (choix des bandes sous bandes et porteuses du signal de brouillage), les motifs temporels d'émission (récurrence des émissions selon le temps et la fréquence),
• de formes d'onde de brouillage, qui sont multiples et le cas échéant complexes, mais connues des récepteurs amis,
• des séquences de signaux numériques Sb émis par les brouilleurs, choisis et adaptés pour permettre des mesures précises en réception sur lesdits signaux de brouillages reçus par les postes ou stations du réseau,
• des séquences de signaux numériques Su émis par les émetteurs amis, choisis pour permettre des mesures précises en réception sur lesdits signaux amis reçus pas les postes ou stations du réseau,
• une élaboration de la situation de brouillage locale au niveau d'un poste, d'après les mesures de puissance de brouillage reçues sur les postes et des canaux de transmission associés ; l'élaboration est effectuée par les postes amis, aidée par la connaissance a priori par les récepteurs amis des plans de fréquence, motifs temporels et formes d'ondes de brouillage possibles,
• une élaboration de la situation de réception locale au niveau d'une station, d'après les mesures précises de puissance utile reçue provenant des émetteurs amis et des canaux de transmission associées ; l'élaboration est effectuée par les postes amis, aidée par la connaissance a priori par les récepteurs amis des plans de fréquence, motifs temporels et formes d'ondes amies possibles,
• de plans de fréquence, motifs et récurrences d'émission, schémas de codage et de modulation spatio-temporels paramétrables des signaux numériques émis par les émetteurs amis, choisis et destinés à leur permettre d'adapter dynamiquement les liens de transmission à la situation de brouillage, à la fois par traitement d'antenne (conformations et orientations optimales des diagrammes d'antenne en émission et en réception) et par traitement temps fréquence (égalisation, modulation et codages et débits adaptatifs, etc.),
• des organes de décisions décentralisés, voire internes aux postes amis, permettant l'élaboration de consignes et des paramétrages adaptatifs en émission réception qui optimisent les liens entre postes amis, lesdites décisions étant basées sur l'élaboration des situations de brouillage locales et sur l'élaboration des situations de réception locales précitées.

The method implemented by the invention is based in particular on:

• the recordings / measurements of the communication signals received by dedicated interceptors, analysis modules and environmental awareness function (or "sensing" in English) which are for example co-located or integrated with at least one friendly posts,
• the recordings / measurements of the interference signals interfering with the friendly stations, by interceptors, analysis modules and dedicated sensing function which are for example co-located or integrated with at least one of the friendly stations,
• a formal description of the interactions between Tx-friendly sending stations, Rx-receiving sets, Br jammers and external entities to be scrambled by Ci, by graphs and macro-graphs which will be specified in the following,
• on a general model of propagation of the transmission channel, generalized to the taking into account of the effective interactions between transmitting stations and friendly receivers (Tx Rx) (generally integrated together within a friend transmission station), scramblers Br and external entities Ci, through a notion of generalized channel matrix specified in the following,
• on the formatting then on the partial resolution of a problem of optimization under constraints, specified in the continuation,
• programmable and dynamically configurable jammers in terms of waveform (envelope, modulation, amplitude, phase, etc.), for which the frequency planes (choice of subband bands and carriers of the jamming signal) are known, the patterns emission time (recurrence of emissions by time and frequency),
• interference waveforms, which are multiple and, where appropriate, complex, but known from the friendly receivers,
• sequences of digital signals Sb emitted by the jammers, chosen and adapted to allow precise measurements on reception of said interference signals received by the stations or stations of the network,
• digital signal sequences Su emitted by the friendly transmitters, chosen to allow precise measurements on reception of said received signals received by the stations or stations of the network,
• a development of the local interference situation at a station, based on the interference power measurements received on the stations and the associated transmission channels; the development is carried out by the friends posts, aided by the knowledge a priori by the receivers friends of the plans of frequency, temporal reasons and forms possible interference waves,
• a development of the local reception situation at a station, based on the precise measurements of the useful power received from the friendly transmitters and the associated transmission channels; the development is carried out by the friendly posts, aided by the knowledge a priori by the receivers friends of the frequency plans, temporal patterns and possible waveforms possible,
• transmission frequency planes, patterns and recurrences, parameterizable coding and space-time modulation schemes for the digital signals emitted by the selected transmitters, and adapted to allow them to dynamically adapt the transmission links to the interference situation , both by antenna processing (optimal conformations and orientations of transmit and receive antenna patterns) and by time-frequency processing (equalization, modulation and adaptive codings and rates, etc.),
• decentralized decision-making bodies, even internal to the friendly posts, allowing the development of instructions and adaptive settings in transmission reception optimizing the links between friendly posts, said decisions being based on the development of local jamming situations and on the elaboration of the aforementioned local reception situations.

In the remainder of the description, the channels are determined to consist of all the radio propagations between each of the transmitters (jammer or communication transmitter friend) and each of the communication receivers ami or each of the targets or areas to scramble Ci ( the zones to be scrambled being discretized in the form of lists of points to be scrambled).

The channel matrix is the matrix of the combinations of radio propagation channels between transmitters and receivers (Tx Rx channel matrix), between the jammers and the receivers (Br Rx channel matrix) or between the jammers and each of the points at scramble (Br channel matrix, This). These matrices are considered in a first global approach between the platforms (and not between the antenna elements present on each platform) and the value a _{m, n} of an element of the channel matrix thus describes physically and globally the Hertzian channel. between platform m and platform n. In the case where a friendly receiver comes into play, the matrix is filled from the measurements made on the useful signals and on the interfering signals. In the case where a zone or point to scramble Ci comes into play, the matrix is filled from a propagation model between a scrambler Br and the target C _i . All these matrices are then considered in a second approach between each antennal emission element (each platform may be provided with several transmitting antennas, for example jamming antenna and transmission antenna, themselves constituted by antenna element arrays. ) and each antennal receiving element (each platform can be provided with several receiving antennas, themselves made of networks of antenna elements). For each of the approaches, the first level of description of this matrix is binary a _{m, n} = 1 if the platform (respectively the antenna) n, receives a signal from the platform (respectively the antenna) m, a finer level in the second approach in particular, corresponds to considering a _{m, n} as the impulse response of the channel m, n, (if necessary matrix) which completely characterizes a multiple linear input multiple output channel or MIMO, multiple single output input or MISO , multiple output single input or SIMO, or single simple output or SISO input. This impulse response can be estimated from the measurements made by the friendly Rx receivers on the signal and interfering sequences, by propagation models considered between transmitters or jammers and receivers, and from the propagation models considered between scramblers or interferers. transmitters and target or area to be scrambled.

The knowledge of the positions of the stations is useful for optimizing the operation of the communication network and used for jamming optimization. Accurate timing or timing of measurements is also useful for better overall optimization.

The precise knowledge of the signal sequences contained in the scrambling signals Sb and in the useful communication signals Su is used for the measurement of the signal reception levels and the measurement of the corresponding propagation channels by the friendly Rx receivers, and contributes to overall optimization of the process.

Graph representations have the advantage of offering a synthetic representation of all the interactions between the actors. For example, it is possible to represent the platforms or the antennas by putting an arc between two platforms or antennas if the signal emitted by one is received by the other, and thus if the channel could be measured.

Example given for the implementation of the process according to the invention

MIMO, MISO, SIMO, SISO "useful" communication stations are available on platforms in N_Pl number, of which J platforms include jammers.

"Transmitter and receiver networks for useful transmissions"

So we have N_pl communication platforms. Each of these platforms is MIMO, MISO, SIMO or SISO. We denote M ₁ , M ₂ ..., M _{N_pl} , the number of antenna elements in emission of each of these platforms. We denote N ₁ , N ₂ ... _, N _{N_pl} , the number of antennal elements in reception of each of these N platforms.

The network consisting of Σ _{M_pl} = Σ _{m = 1} ... _{N_pl} M _m antennas transmitting elements Tx or Br and Σ _{N_pl} = L _{n = 1} ... _{N_} p _l N _n antenna elements Rx appears as a macro-network, a priori strongly lacunary. The set of communication platforms constitutes a network represented by the network graph of size N_pl as defined above and noted G ₀ . When we consider the set of antennal elements, we prefer a representation by the macro-graph of size Σ _{M_pl} + Σ _{N_pl} as defined above and noted Go '.

The channel matrix of this macro network consisting of N_pl platforms and Σ _{M_pl + N_pl} antennal elements can be written formally, as will be explained below or as can be seen on the Figures 3A , 3B , 4 , for which a generic notation is used, in the generalized form H ₀ '(Tx, Rx) = G ₀ ' α [H ₀ ^(A) (Tx, Rx), H ₀ ^(R) (Rx, Tx)]. It is determined by the topology of the network (which determines G ₀ and G ₀ ') and the channel matrices H ₀ ^(A) and H ₀ ^(R) specific to each link Tx _m → Rx _n.

In the method implemented, called "open loop" according to the invention, the transmitters, receivers and communication nodes of the network friend manage at each moment t (sampling t _k , k = 1, 2, ...), the communication links and the related settings (protocols, data rates, coding schemes and modulation, if applicable, the weighting of the antenna networks in transmission / reception, use of relays, etc.), by adapting to the radio environment and possible interference residues, being explicitly controlled by a decision-making body and local control, decentralized and specific to each link Tx-Rx friend. The signals and interference levels themselves are not controlled from the friendly transmitters or receivers, but are set according to independent performance criteria specific to the geometry and targets to be scrambled. The radio situation and the level of interference due to interference are measured by the friendly receiver on each link. The frequency plan, the spatio-temporal time parameterization of the radio access, the modulation and coding schemes, and the reception processing in the friendly stations are defined by the local decentralized control at the level of each station to optimize the link useful and to minimize the residual fratricidal effects related to interference, by making use of the available techniques known to those skilled in the art on the friendly positions, if necessary, for example: transposition of useful communications on empty carriers and / or little interference in the frequency plan, "temporal positioning" or "slottage" in English of the communication over time intervals that are little scrambled or left empty by jamming forms that are themselves "slurred" or impulsive), faded channel formation, interference reduction techniques and joint separation and demodulation techniques for friendly receivers having antenna arrays and / or exploiting orthogonal codings in the transmitted useful signals, rate reduction and / or increase of the transmission power correction of the encodings used (at the cost of the spectral efficiency, the complexity of the reception processing, the consumption if necessary), etc.

où

• N est le nombre exact de plates formes réceptrices comportant une antenne de réception (N ≤ N_pl),
• M est le nombre exact de plates formes émettrices comportant une antenne d'émission destinée aux transmissions de signaux utiles (M ≤ N_pl),
• H₀' est la matrice généralisée de canal « émetteurs vers récepteurs»,
• X_n(t) n = 1,..., N est le vecteur des signaux utiles reçus sur le réseau des éléments d'antennes de la plate-forme réceptrice d'indice n, ,
• S_m(t) n = 1,...,M est le vecteur des signaux émis sur le réseau des éléments d'antennes de la plate-forme émettrice d'indice m, de bande B,

The set of antennas antennas Tx transmitters ₁ , ..., Tx _M (M ≤ N_pl) and receivers Rx ₁ , ..., Rx _N (N ≤ N_pl) is formalized as a macro-network G ₀ ' (defined by a matrix of size (Σ _{M_pl} + Σ _{N_pl} ) ² ) whose links are completely described as on the figure 4 by a generalized channel matrix which determines the full generalized channel H ₀ '(Tx, Rx, τ). These matrices are determined by the topology of the network macro graph G 'by the channel matrices specific to each link Tx _m -> Rx _n The formal construction of these matrices is given to the figure 4 , examples of Figures 3A and 3B , and some figure 2 illustrate the consideration of the propagation channel to construct the channel matrices specific to each link Tx _m -> Rx _n For the path Tx _m -> Rx _n , the formal expression of the useful signals coming from the transmitting platforms received at the level of receiving platforms are then at each moment t: $$\mathrm{X}\left(\mathrm{t}\right)=\left({\mathrm{<figure-callout\; id="0"\; label="H"\; filenames="imgf0003.png,imgf0004.png"\; state="\{\{state\}\}">H</figure-callout>}}_{\mathrm{0}}\mathrm{\text{'}}*\mathrm{S}\right)\left(\mathrm{t}\right)\mathrm{i}\mathrm{.}\mathrm{e}\mathrm{.}\left[\begin{array}{c}{\mathrm{X}}_{\mathrm{1}}\left(\mathrm{t}\right)\\ \\ {\mathrm{X}}_{\mathrm{NOT}}\left(\mathrm{t}\right)\end{array}\right]=\left[\left(\begin{array}{ccc}{{{\mathrm{H}}_{\mathrm{0}}}^{\mathrm{\text{'}}}}_{\mathrm{11}}& & {{{\mathrm{H}}_{\mathrm{0}}}^{\mathrm{\text{'}}}}_{\mathrm{1}\mathrm{M}}\\ & & \\ {{{\mathrm{H}}_{\mathrm{0}}}^{\mathrm{\text{'}}}}_{\mathrm{NOT}\mathrm{1}}& & {{{\mathrm{H}}_{\mathrm{0}}}^{\mathrm{\text{'}}}}_{\mathrm{NM}}\end{array}\right)*\left(\begin{array}{c}{\mathrm{S}}_{\mathrm{1}}\\ \\ {\mathrm{S}}_{\mathrm{M}}\end{array}\right)\right]\left(\mathrm{t}\right)$$

or

• N is the exact number of receiving platforms with a receiving antenna (N ≤ N_pl),
• M is the exact number of transmitting platforms including a transmitting antenna for transmissions of useful signals (M ≤ N_pl),
• H ₀ 'is the generalized matrix of "transmitters to receivers" channel,
• X _n (t) n = 1, ..., N is the vector of the useful signals received on the network of the antenna elements of the receiving platform of index n,,
• S _m (t) n = 1, ..., M is the vector of the signals transmitted on the network of the antenna elements of the transmitting platform of index m, of band B,

On the figure 2 is also represented an example of geometry of the propagation in an axis X (East), Y (North).
The link between the index element m of the network of transmitting platforms and the index element n of the network of receiving platforms is characterized by:
S _m (t) supra,
X _nm (t), the vector contribution of the signal Sm received on the element n of the antennal network in reception,
X _n (t) above, total signal vector received on the sensor n of the network,
L _mn the number of paths of the propagation channel,
l the index of the I-th multipath,
α ^{(m, n)} l the attenuation of the path l with respect to the average losses,
γ ^{(m, n} ) l, the mean arrival direction of the path l,
τ ( ^m , ⁿ ) l, the average delay of the path L, the delays are contained in an interval [O, T ^{(m, n)} ] depending on the urban, mountainous channel, etc.
N ^{(m, n)} , is the number of subpaths associated with the path l assumed to be indistinguishable for the B-band signal and therefore distributed in a time interval T ^{(m, n)} << 1 / B
n _l is the index of the sub-path,
φ ^{(m, n)} _{nl, l} is the subsampling phase of indices l and n _l ,
α ^{(m, n)} _{nl, l} is the relative level of the subscript subpath l and ⁿ
θ ^{(m, n)} _{nl, l} is the direction of arrival of the sub-path of indices l and ni
U _s (θ ^{(m, n)} _{nl, l} ) is the directional vector corresponding to the sub-path of indices l and n _l for the signal source s.

The temporal distribution of the paths determines its type of fading (flat or selective depending on whether T ^{(m, n)} ≤≥ 1 / B) and its temporal coherence. The temporal distribution of sub-paths determines its fading type (flat or selective, depending on whether T ^{(m, n)} _l ≤≥ 1 / B) and its temporal coherence. The amplitude distribution of the paths (respectively under paths) determines its statistical type (Rayleigh or Rice).

The angular distribution of the paths (respectively under paths) determines its angular coherence (omni-directional diffusion, diffusion cone).

"Parameters and powers of the signals useful according to the processing in reception":

Data _m represents the useful signal to be transmitted from the transmitter Tx _m to the receiver Rx _n . S _m represents the signal or a signal vector at the output of the friendly transmitter Tx _m , by the linear transformation S _m = Coding _m .Data _m which models in a general way a spatio-temporal coding scheme in transmission as used in SISO, SIMO, MISO or MIMO transmissions, the Coding _m operator representing the spatio-temporal coding applied by the transmitter Tx _m to the input data signal Data _m at the input of said transmitter. The set of possible values for coding schemes, Coding _m , is denoted Dom_Codage.

In any case, the spatio-temporal operator Encoding _m can be defined in a vector space of linear operators operating from a finite dimensional vector space (the space of the sampled useful signals of finite spatial dimension taken over a finite time horizon and) in a finite-dimensional image vector space (the space of spatiotemporally encoded sampled signals, also of finite spatial dimension and finite time horizon), and Dom_Codage can be taken as the unit sphere of said vector space.
The power of the signal S _m is denoted π _Sm .
It is possible to express π _Sm in the form π _Sm = .S _m ^H .S _m ,.
X _{m, n} = H ₀ ' _{m, n} . S _m represents the signal or the input signal vector of a receiver Rx _n after being propagated in the filter H _{m, n} .
The power of the signal X _mn is denoted π _Xmn .
It is possible to express π _Xmn in the form π _Xmn = X _mn ^H .X _mn .
T _n represents the set of processing and filtering applied to the input signal X _n to produce the output signal of treatment represented formally by Y _mn = T _n (X _{m, n} ); T _n generally models a spatio-temporal decoding scheme in reception as used in SISO, SIMO, MISO or MIMO transmissions.
The set of possible values for the reception processing T _n is denoted Dom_T.

In any case, the spatio-temporal operator T _n can be defined in a vector space of linear operators operating from a vector space of finite dimension (the space of the sampled signals at the reception antenna input taken on a horizon finite time) in a finite dimensional image vector space (the spatially decoded sampled sampled space), and Dom_T can be taken as the unit sphere of said vector space.
The signal strength Y _mn is noted π _Ymn
If T _n is purely linear, it is possible to express π _Ymn according to the Codagem coding applied, as a function of the channel H ₀ ' _{m, n} , and as a function of the processing applied in reception T _n in the form $$\begin{array}{c}{\mathrm{\pi }}_{\mathrm{ymn}}\left({\mathrm{Coding}}_{\mathrm{m}};{\mathrm{<figure-callout\; id="0"\; label="H"\; filenames="imgf0003.png,imgf0004.png"\; state="\{\{state\}\}">H</figure-callout>}}_{\mathrm{0}}{\mathrm{\text{'}}}_{\mathrm{m},\mathrm{not}};{\mathrm{T}}_{\mathrm{not}}\right)={{\mathrm{Y}}_{\mathrm{mn}}}^{\mathrm{H}}\mathrm{.}{\mathrm{Y}}_{\mathrm{mn}}\\ ={\left({\mathrm{T}}_{\mathrm{not}}\mathrm{.}{\mathrm{<figure-callout\; id="0"\; label="H"\; filenames="imgf0003.png,imgf0004.png"\; state="\{\{state\}\}">H</figure-callout>}}_{\mathrm{0}}{\mathrm{\text{'}}}_{\mathrm{m},\mathrm{not}}\mathrm{.}{\mathrm{Coding}}_{\mathrm{m}}\mathrm{.}{\mathrm{Data}}_{\mathrm{m}}\right)}^{\mathrm{H}}\mathrm{.}{\mathrm{T}}_{\mathrm{not}}\mathrm{.}{\mathrm{<figure-callout\; id="0"\; label="H"\; filenames="imgf0003.png,imgf0004.png"\; state="\{\{state\}\}">H</figure-callout>}}_{\mathrm{0}}{\mathrm{\text{'}}}_{\mathrm{m},\mathrm{not}}\mathrm{.}{\mathrm{Coding}}_{\mathrm{m}}\mathrm{.}{\mathrm{Data}}_{\mathrm{m}}\\ ={{\mathrm{X}}_{\mathrm{mn}}}^{\mathrm{H}}\mathrm{.}{{\mathrm{T}}_{\mathrm{not}}}^{\mathrm{H}}\mathrm{.}{\mathrm{T}}_{\mathrm{not}}\mathrm{.}{\mathrm{X}}_{\mathrm{mn}}\mathrm{.}\\ ={{\mathrm{Data}}_{\mathrm{m}}}^{\mathrm{H}}\mathrm{.}{{\mathrm{Coding}}_{\mathrm{m}}}^{\mathrm{H}}\mathrm{.}{\mathrm{<figure-callout\; id="0"\; label="H"\; filenames="imgf0003.png,imgf0004.png"\; state="\{\{state\}\}">H</figure-callout>}}_{\mathrm{0}}{\mathrm{\text{'}}}_{\mathrm{m},\mathrm{not}}\mathrm{.}{{\mathrm{T}}_{\mathrm{not}}}^{\mathrm{H}}\mathrm{.}{\mathrm{T}}_{\mathrm{not}}\mathrm{.}{\mathrm{<figure-callout\; id="0"\; label="H"\; filenames="imgf0003.png,imgf0004.png"\; state="\{\{state\}\}">H</figure-callout>}}_{\mathrm{0}}{\mathrm{\text{'}}}_{\mathrm{m},\mathrm{not}}\mathrm{.}{\mathrm{Coding}}_{\mathrm{m}}\mathrm{.}{\mathrm{Data}}_{\mathrm{m}}\hfill \end{array}$$

In this expression, only data transmitted Data _m and the channel H ₀ ' _{m, n are} beyond the control of the local control unit, which can control against Cadage _n , and T _n in the domains of the possible values Dom_Codage and Dom_T to optimize the useful link Tx _m Rx _n .

At each of the N friendly reception platforms, the method will establish, E ₀ , a local reception situation by measuring, E ₁ , the communication signals Su friends received by said platforms from the M transmitters friends then, from of those measures, estimating, E ₂ , for each of the N receiving reception platforms the M useful levels received and the M useful propagation channels (N * M estimated in all).

The useful signals and the procedures for measuring and equalizing these signals in the receivers, in particular on synchronization sequences or on pilot sequences, make it possible to estimate the MxN useful communication channels.

"Network of jammers and receivers"

Jplatforms among the N_pl are provided with "jammers" adapted to scramble the communications of the external elements to the friendly network, we note Br ₁ , ..., Br _J. The set of jammers Br ₁ , ..., Br _J and receivers and Rx ₁ , ..., Rx _N constitutes a "scrambling" network represented by an interference graph denoted GJ and subjected to a propagation channel generalized HJ '= GJ'& H _J (Br, Rx) defined according to the process described in figure 4 , considering the number of transmitting platforms J, the number of receiving platforms N and the associated J x N elementary channel matrices.

• une consigne de niveau de puissance C_PIRE_j,
• une forme d'onde de brouillage B_j, connue et mesurée in situ par les récepteurs amis
• une ou plusieurs durées de brouillage Tb_j avec les récurrences Rb_i et une avance ou un retard τ_j en émission du signal B_j par rapport à une horloge commune, ces caractéristiques étant connues apriori et/ou reconnaissables in situ par les récepteurs amis lors de leurs processus de mesure,
• un ou plusieurs intervalles de fréquence notés Fb_j de brouillage correspondant aux intervalles de brouillage, connus a priori et/ou reconnaissables in situ par les récepteurs amis lors de leurs processus de mesure,
• des pondérations en amplitude A_j et en phase ϕ_j,
• le cas échéant une orientation d'antenne ψ_j qui peut être assimilée dans la suite comme une pondération spatiale induite par la directivité d'antenne.

Each of the interferers Br _j , of index j, has an equivalent power level radiated in transmission (EIRP) defined by an interval [0, PIREMAX _j ], fixed, and known from the receivers for the implementation of the invention, with:

• a power level setpoint C_PIRE _j ,
• a scrambling waveform B _j , known and measured in situ by the receivers
• one or more scrambling times Tb _j with the recurrences Rb _i and an advance or a delay τ _j in transmission of the signal B _j with respect to a common clock, these characteristics being known a priori and / or recognizable in situ by the receivers their measurement processes,
• one or more frequency intervals noted Fb _j scrambling corresponding to the scrambling intervals, known a priori and / or recognizable in situ by the friendly receivers during their measurement process,
• weights in amplitude A _j and phase φ _j ,
• where appropriate an antenna orientation ψ _j which can be assimilated in the following as a spatial weighting induced by the antenna directivity.

Advanced jammers may also be used to encode or tag in their interference waveform the EIRP power levels, scrambling waveforms, scrambling signal durations, recurrences with which these scrambling signals occur , the delays, the frequencies, and the weights A _i φ _i ψ _{i that} they apply to inform the friendly receivers.

• un macro-graphe « brouillage fratricide réseau » noté G_J' intégrant les émissions des seuls brouilleurs et la matrice de canal généralisée associée H_J' (figures 2, 3A, 3B).

According to the foregoing, all the antennal networks of the jammers Br ₁ ,..., Br _J and antennal reception networks of the reception platforms Rx ₁ ,..., Rx _N are formalized by two interference macroarrays. defined by:

• a macro-graph "network fratricidal interference" noted G _J 'integrating the emissions of the only jammers and the associated generalized channel matrix H _J ' ( figures 2 , 3A , 3B ).

où

• N est le nombre exact de plates formes réceptrices comportant une antenne de réception (N ≤ N_pl),
• J est le nombre exact de plates formes comportant une antenne de brouillage (J≤ N_pl),
• H_J'⁽⁾ est la matrice généralisée de canal « brouilleurs vers récepteurs »,
• J_n(t) n = 1,...,N est le vecteur des signaux brouilleurs reçus sur le réseau des éléments d'antennes de la plate-forme réceptrice d'indice n,
• B_j(t) j = 1,...,J est le vecteur des signaux de brouillage émis sur le réseau des éléments d'antennes de la plate-forme d'indice j.

The formal expression J (t) of the interfering signals received on a receiving network is then the following at any time t: $$\mathrm{J}\left(\mathrm{t}\right)=\left({\mathrm{H}}_{\mathrm{J}}{\mathrm{\text{'}}}^{\left(\mathrm{AT}\right)}*\mathrm{B}\right)\left(\mathrm{t}\right)\mathrm{i}\mathrm{.}\mathrm{e}\mathrm{.}\left[\begin{array}{c}{\mathrm{J}}_{\mathrm{1}}\left(\mathrm{t}\right)\\ \\ {\mathrm{J}}_{\mathrm{NOT}}\left(\mathrm{t}\right)\end{array}\right]=\left[\left(\begin{array}{ccc}{{\mathrm{H}}_{\mathrm{J}}}_{\mathrm{11}}^{\mathrm{\text{'}}}& & {{\mathrm{<figure-callout\; id="1"\; label="H\; J"\; filenames="imgf0002.png,imgf0003.png"\; state="\{\{state\}\}">H\; </figure-callout>}}_{\mathrm{J}}}_{\mathrm{1}\mathrm{J}}^{\mathrm{\text{'}}}\\ & & \\ {{\mathrm{H}}_{\mathrm{J}}}_{\mathrm{NOT}\mathrm{1}}^{\mathrm{\text{'}}}& & {{\mathrm{H}}_{\mathrm{J}}}_{\mathrm{NJ}}^{\mathrm{\text{'}}}\end{array}\right)*\left(\begin{array}{c}{\mathrm{B}}_{\mathrm{1}}\\ \\ {\mathrm{B}}_{\mathrm{J}}\end{array}\right)\right]\left(\mathrm{t}\right)$$

or

• N is the exact number of receiving platforms with a receiving antenna (N ≤ N_pl),
• J is the exact number of platforms with a scrambling antenna (J≤ N_pl),
• H _J ' ⁽⁾ is the generalized "scrambler to receiver" channel matrix,
• J _n (t) n = 1, ..., N is the vector of the interfering signals received on the network of the antenna elements of the receiving platform of index n,
• B _j (t) j = 1, ..., J is the vector of the jamming signals transmitted on the network of antenna elements of the index platform j.

"Parameters and powers of interfering signals according to reception processing":

B _j represents the interfering signal at the output of jammer Br _J.
J _j = H _J ' _{, n} .B _j represents the interfering signal for a transmission from the scrambler Br _J to the receiver Rx _n
The power of the signal J _jn at the processing input is denoted by π _Jjn
It is possible to express π _Jjn in the form π _Jjn = X _mn ^H .X _mn ..
After passing through the reception processing T _n specific to the receiver Tx _n , the input jamming signal J _jn is transformed into an interfering signal at the output J ' _jn = T _n (J _jn ).
The signal strength is noted π _J'jn . It is possible to express π _Ymn as a function of the applied treatment T _n in the form $$\begin{array}{c}{\mathrm{\pi }}_{\mathrm{J\text{'}jn}}\left({\mathrm{T}}_{\mathrm{not}};{\mathrm{H}}_{\mathrm{J}}{\mathrm{\text{'}}}_{\mathrm{j},\mathrm{not}}\right)={{\mathrm{J\text{'}}}_{\mathrm{jn}}}^{\mathrm{H}}\mathrm{.}{\mathrm{J\text{'}}}_{\mathrm{jn}}\mathrm{.}={\left({\mathrm{T}}_{\mathrm{not}}\mathrm{.}{\mathrm{H}}_{\mathrm{J}}{\mathrm{\text{'}}}_{\mathrm{j},\mathrm{not}}\mathrm{.}{\mathrm{B}}_{\mathrm{j}}\right)}^{\mathrm{H}}\mathrm{.}\left({\mathrm{T}}_{\mathrm{not}}\mathrm{.}{\mathrm{H}}_{\mathrm{J}}{\mathrm{\text{'}}}_{\mathrm{j},\mathrm{not}}\mathrm{.}{\mathrm{B}}_{\mathrm{j}}\right)\\ ={{\mathrm{J}}_{\mathrm{jn}}}^{\mathrm{H}}\mathrm{.}{{\mathrm{T}}_{\mathrm{not}}}^{\mathrm{H}}\mathrm{.}{\mathrm{T}}_{\mathrm{not}}\mathrm{.}{\mathrm{J}}_{\mathrm{jn}}\mathrm{.}={{\mathrm{B}}_{\mathrm{j}}}^{\mathrm{H}}\mathrm{.}{\mathrm{H}}_{\mathrm{J}}{{\mathrm{\text{'}}}_{\mathrm{j},\mathrm{not}}}^{\mathrm{H}}\mathrm{.}{{\mathrm{T}}_{\mathrm{not}}}^{\mathrm{H}}\mathrm{.}{\mathrm{T}}_{\mathrm{not}}\mathrm{.}{\mathrm{H}}_{\mathrm{J}}{\mathrm{\text{'}}}_{\mathrm{j},\mathrm{not}}\mathrm{.}{\mathrm{B}}_{\mathrm{j}})\end{array}$$

In this expression, the channel H _{J 'j, n} and the interference signal B _j beyond the control of the local control member, which may for control against T _n in the domain of possible values Dom_T to minimize the level of interference at the output and optimize the useful link Tx _m Rx _n . The domain Dom_T of the possible values for T _n depends on the nature of the spatio-temporal treatment applied.

"Target Zone or Target Receiver"

• dans le domaine temporel : la zone Ci peut correspondre à des slots temporels à brouiller indexés sur une trame pseudo-périodique connue et/ou contrôlée par la station maître des brouilleurs,
• dans le domaine fréquentiel : la zone Ci peut correspondre à des sous-bandes de brouillage à brouiller soit de manière continue, soit de manière périodique (avec indexation sur une trame pseudo-périodique) connue et/ou contrôlée par le ou les brouilleurs,
• dans le domaine spatial : la zone Ci peut correspondre à la position d'une cible identifiée, à une zone géographique autour de cette position, à une focalisation vers cette position. Ceci permet de considérer une matrice de canal H_BC des brouilleurs vers les zones cibles (qui se réduit dans le cas d'une seule zone de brouillage à un vecteur ligne 1 xJ), dont les valeurs par défaut peuvent être déterminées en fonction d'un modèle géométrique ou d'un modèle empirique d'atténuation moyenne isotrope dépendant de la distance ou de tout autre modèle paramétrique ou empirique (la zone cible n'informe pas a priori les brouilleurs de l'efficacité du brouillage... le réseau de brouilleur ne peut donc initier sa stratégie de brouillage que d'après un modèle, et seulement ensuite contrôler le cas échéant l'efficacité du brouillage - avec une technique connue sous l'acronyme anglo-saxon look-through par exemple).

The J platforms Br ₁ ... Br _J are intended to scramble one or more targets or areas characterized by a list of positions Ci ₁ ... Ci _P to scramble. These positions are primarily geographical points, but can by extension be defined "broadly" in the time / frequency / space domains:

• in the time domain: the zone Ci can correspond to time slots to scramble indexed on a pseudo-periodic frame known and / or controlled by the jammer master station,
• in the frequency domain: the zone Ci may correspond to interference subbands to be scrambled either continuously or periodically (with indexing on a pseudo-periodic frame) known and / or controlled by the interferer (s),
• in the space domain: the area Ci can correspond to the position of an identified target, to a geographical area around this position, to a focus towards this position. This makes it possible to consider a channel matrix H _BC from the scramblers to the target zones (which is reduced in the case of a single scrambling zone to a line vector 1 × j), whose default values can be determined as a function of a geometric model or an empirical model of isotropic mean attenuation depending on the distance or any other parametric or empirical model (the target zone does not inform a priori the scramblers of the efficiency of the interference ... the network of The jammer can therefore initiate its scrambling strategy only according to a model, and only then control if necessary the effectiveness of the scrambling - with a technique known as the Anglo-Saxon look-through for example).

Since the interference signal is fixed and generated, analysis or sensing modules in the associated receivers or their associated interceptors produce measurement results on the interfering signals by exploiting their information a priori of the waveforms and the model. or "pattern" of scrambling to accelerate and make their measurement procedure more reliable, so as to optimize their own links by adapting their spectral and temporal resource allocation plans and their modulation coding scheme. Decision-making is local and decentralized level of each useful link, without retroactivity on the settings applied by the jammers, which leads to a simplified management of the jammer network.

At each of the N receiving host platforms, E ₃ , a local interference situation is established by measuring, E ₄ , the interference signals received by said receiving platforms from the J interferers, from the measurements of the signals. scrambling for each of the N platforms friends reception, it is estimated, E _5, J fratricide interference levels received and J interference channels fratricide, N * J estimated in all.

The interference signals also incorporating known sequences, procedures for measuring and equalizing these signals apply in the same way to these signals in the interceptors, analysis modules or sensing function associated with the friendly receivers.

The results of the measurements are exploited by the Rx receivers of the friends posts, possibly communicated to the transmittersTx friends, if the links have return channels, to optimize the useful links Tx friends / Rx friends.

The jammer network and the settings that are applied to the scrambling signals remain independent of the optimization guidelines specific to the useful links.

Knowing, a priori, the waveforms of the scrambling signals and the associated parameterizations, from the states of local jamming situations established by each receiving platform on the J signals from the J jammers, from the states of situations receiving platforms established by each receiving platform on the useful communication signals, the method calculates, for each of the M friendly transmitting platforms and each of the N receiving platforms frequency plans, timing positions for the transmissions, diagrams and / or antenna orientations, radio access schemes and modulation / coding schemes of transmitted and received signals eliminating or any at least minimizing the fratricidal effects on the N receiving host platforms, then applying these first frequency planes, these time positioning, these antenna diagrams and / or orientations, these radio access schemes and these modulation / coding schemes on the M-friendly sending platforms and the N receiving host platforms, in order to initiate the reduction of the fratricidal effects of the jamming.

According to one embodiment, the receiving receiving platforms continuously or recurrently evaluate the local scrambling status states and the local states of receive situations to continue the calculation of the frequency plans and the application of these frequency planes, time positioning of the transmissions, diagrams and / or orientations of the antenna, radio access schemes and modulation / coding schemes of the signals transmitted and received, so as to maintain and optimize, by iteration from frame to frame , the throughput of the transmission service, the power and quality of the transmissions and the reception on the friendly platforms by maintaining or reducing the risk of acceptable fratricidal interference for the quality of the useful transmissions.

1. 1/ Le procédé selon l'invention peut être mis en oeuvre pour des paramètres et modes de brouillage suivant :
   • sectoriel
   • puissance min/max/moyenne
   • pattern spatio-temporel.
2. 2/ Dans une variante du procédé, des consignes peuvent également être élaborées et diffusés aux émetteurs amis.
3. 3/ Le procédé peut aussi être utilisé pour des schémas Spatio Temporels mis en oeuvre dans les postes émetteurs amis parmi les suivant:
   • la redondance spatiale simple entre voies Tx et redondance temporelle entre les messages
   • le schéma ST robuste en Rx aux interférences externes (i.e. non Multi-Trajet)
   • l'utilisation de l'une des antennes Tx pour le signal de brouillage sur chaque Tx MIMO ou MISO et des autres antennes Tx pour la communication
   • la formation de "voies spatiale" de brouillage avec un sous-réseau en émission (lacunaire)) de Tx MISO ou MIMO "hybrides" com/brouilleurs.
4. 4/ Le procédé peut aussi être utilisé avec des postes récepteurs amis équipés de filtres Spatio Temporels choisi parmi la liste suivante, donnée à titre illustratif et nullement limitatif :
   • Annulation Brouilleur
   • SIMO par Formation de Voie (FV) ou par Filtrage Adapté Spatial (FAS)
   • Filtre adapté spatio-temporel « optimal » en présence interférence(s) externe(s)
   • Filtre réjecteur exploitant l'a-priori forme d'onde brouilleur connue
   • Filtre réjecteur exploitant l'a-priori direction brouilleur connue (avec ou sans goniométrie préalable du brouilleur)
   • etc.

Different variants of implementation of the invention can be broken down according to the nature of the jammers used and the degree of information of the friendly posts on these jammers, and finally according to the processing capacity embedded in the friendly posts.

1. 1 / The method according to the invention can be implemented for the following parameters and modes of scrambling:
   • sectorial
   • min / max / average power
   • spatio-temporal pattern.
2. 2 / In a variant of the method, instructions can also be developed and broadcast to the friendly transmitters.
3. 3 / The method can also be used for Spatio temporal schemes implemented in the transmitter stations friends among the following:
   • simple spatial redundancy between Tx channels and time redundancy between messages
   • Robust ST scheme in Rx to external interference (ie no multi-path)
   • the use of one of the Tx antennas for the scrambling signal on each Tx MIMO or MISO and other Tx antennas for communication
   • the formation of "space channels" of interference with a sub-network in emission (lacunary)) of Tx MISO or MIMO "hybrids" com / jammers.
4. 4 / The method can also be used with friendly receivers equipped with Spatio Temporal filters selected from the following list, given for illustrative and not limiting:
   • Scrambler cancellation
   • SIMO by Channel Formation (FV) or Adapted Spatial Filtering (FAS)
   • Adapted Spatio-temporal filter "optimal" in the presence of external interference (s)
   • Rejector filter exploiting the a priori known jammer waveform
   • Rejector filter exploiting the a priori known jammer direction (with or without prior direction finding of the jammer)
   • etc.

• des critères portant sur la minimisation du niveau de signal fratricide moyen ou fratricide+interférent moyen les récepteurs Rx_n en sortie de traitement T_n sur le récepteur Rx_n,
• des critères portant sur la maximisation du rapport entre la puissance de signal utile en sortie de traitement et la puissance de signal de brouillage résiduel en sortie de traitement sur le récepteur Rx_n.

The process of optimizing the useful links involves certain criteria related to the reduction of the fratricidal interference and / or to the maximization of the ratio between the power of the useful signal and the power of the fratricidal jamming on each receiver Rx _n , which can be write from the above in several forms, such as the following, showing convex functionalities:

• criteria relating to the minimization of the mean fratricidal signal level or fratricide + interfering mean the Rx _n receptors processing output T _n on the receiver Rx _n ,
• criteria relating to the maximization of the ratio between the useful signal power at the output of the processing and the residual interference signal power at the output of the processing on the receiver Rx _n .

sachant que $$\begin{array}{ll}{\mathrm{\pi }}_{\mathrm{Jʹjn}}\left({\mathrm{T}}_{\mathrm{n}};{\mathrm{H}}_{\mathrm{J}}{\mathrm{ʹ}}_{\mathrm{j},\mathrm{n}}\right)& =\mathrm{tr}\left[{\mathrm{Jʹ}}_{\mathrm{jn}}\mathrm{.}{{\mathrm{Jʹ}}_{\mathrm{jn}}}^{\mathrm{H}}\right]\\ & =\mathrm{tr}\left[{\mathrm{T}}_{\mathrm{n}}\mathrm{.}{\mathrm{J}}_{\mathrm{jn}}\mathrm{.}{{\mathrm{J}}_{\mathrm{jn}}}^{\mathrm{H}}\mathrm{.}{{\mathrm{T}}_{\mathrm{n}}}^{\mathrm{H}}\right]\\ & =\mathrm{tr}\left[\left({\mathrm{T}}_{\mathrm{n}}\mathrm{.}{\mathrm{H}}_{\mathrm{J}}{\mathrm{ʹ}}_{\mathrm{j},\mathrm{n}}\mathrm{.}{\mathrm{B}}_{\mathrm{j}}\right)\mathrm{.}{\left({\mathrm{T}}_{\mathrm{n}}\mathrm{.}{\mathrm{H}}_{\mathrm{J}}{\mathrm{ʹ}}_{\mathrm{j},\mathrm{n}}\mathrm{.}{\mathrm{B}}_{\mathrm{j}}\right)}^{\mathrm{H}}\right]\mathrm{.}\end{array}$$

et sachant que les paramètres H_J'_j,n et B_j ne sont pas contrôlés pour l'optimisation du critère mais connus par analyse et mesure et information a priori.
Critère de type Min JR : pour chaque récepteur ami Rx_n, ce critère vise à chercher un niveau de brouillage minimum sur les signaux en sortie de traitement. Pour chaque récepteur ami Rx_n, le paramètre optimisé est uniquement l'opérateur traitement en réception de Rx_n dans son domaine de valeur.
Pour tout n = 1,...,N ; il s'agit donc de chercher le traitement en réception T_n qui minimise la somme des contributions fratricides résiduelles des brouilleurs $${\mathrm{JR}}_{\mathrm{n}}={\displaystyle \sum _{j=1}^J}{\pi }_{\mathit{Jʹj},n}\left(T_n{H}_{\mathit{Jʹj},n}\right)$$

sachant que : $$\begin{array}{ll}{\mathrm{\pi }}_{\mathrm{Jʹjn}}\left({\mathrm{T}}_{\mathrm{n}};{\mathrm{H}}_{\mathrm{J}}{\mathrm{ʹ}}_{\mathrm{j},\mathrm{n}}\right)& =\mathrm{tr}\left[{\mathrm{Jʹ}}_{\mathrm{jn}}\mathrm{.}{{\mathrm{Jʹ}}_{\mathrm{jn}}}^{\mathrm{H}}\right]\\ & =\mathrm{tr}\left[{\mathrm{T}}_{\mathrm{n}}\mathrm{.}{\mathrm{J}}_{\mathrm{jn}}\mathrm{.}{{\mathrm{J}}_{\mathrm{jn}}}^{\mathrm{H}}\mathrm{.}{{\mathrm{T}}_{\mathrm{n}}}^{\mathrm{H}}\right]\\ & =\mathrm{tr}\left[\left({\mathrm{T}}_{\mathrm{n}}\mathrm{.}{\mathrm{H}}_{\mathrm{J}}{\mathrm{ʹ}}_{\mathrm{j},\mathrm{n}}\mathrm{.}{\mathrm{B}}_{\mathrm{j}}\right)\mathrm{.}{\left({\mathrm{T}}_{\mathrm{n}}\mathrm{.}{\mathrm{H}}_{\mathrm{J}}{\mathrm{ʹ}}_{\mathrm{j},\mathrm{n}}\mathrm{.}{\mathrm{B}}_{\mathrm{j}}\right)}^{\mathrm{H}}\right]\end{array}$$

sachant que les paramètres H_J'_j,n et B_j ne sont pas contrôlés pour l'optimisation du critère mais seulement connus par mesure, analyse et information a priori,
Ceci s'écrit formellement pour chaque récepteur Rx_n : $$\forall n=1\dots N,T_n=\underset{t_n\in \mathit{Dom\_T}}{\mathit{Arg}\min }\left\{{\mathit{JR}}_n\right\}=\underset{t_n\in \mathit{Dom\_T}}{\mathit{Arg}\min }\left\{{\displaystyle \sum _{j=1}^J}{\pi }_{\mathit{Jʹj},n}\left(H_{\mathit{Jʹj},n}{t}_n\right)\right\}$$

Réaliser ce critère revient à résoudre pour tout n= 1,..., N ; un problème d'optimisation du critère ${\displaystyle \sum _{j=1}^J}{\pi }_{\mathit{Jʹj},n}\left(H_{\mathit{Jʹj},n}{t}_n\right)$

quadratique sur la variable t_n, sous la contrainte t_n ∈ Dom_T.
Critère de type Seuil min SJR :
Pour chaque lien émetteur ami Tx_m - récepteur ami Rx_n, ce critère vise à garantir un rapport de puissance entre le signal utile en sortie de traitement et le signal de brouillage en sortie de traitement qui dépasse un seuil donné ΔSJR_n correspondant à une qualité de réception a priori. Pour chaque lien émetteur amis Tx_m, récepteur ami Rx_n, les paramètres recherchés sont ici

• la matrice de codage des données utiles à l'émission de Tx_m, soit le paramètre Codage_m ∈ Dom_Codage.
• l'opérateur traitement en réception de Rx_n, soit T_n ∈ Dom_T.

Pour tout lien ami Tx_m, Rx_n m= 1,...,M ; n= 1,...,N ; il s'agit donc de chercher des paramètres Codage_m et T_n dans les domaines respectifs Dom_Codage et Dom_T qui vérifient le critère de seuillage suivant sur le rapport signal utile à bouilleurs : $${\mathit{SJR}}_{m,n}=\frac{{\pi }_{\mathit{Ym},n}\left({\mathit{Codage}}_m{\mathrm{<figure-callout\; id="0"\; label="H"\; filenames="imgf0003.png,imgf0004.png"\; state="\{\{state\}\}">H</figure-callout>}}_{0ʹm,n}{T}_n\right)}{{\displaystyle \sum _{j=1}^J}{\pi }_{\mathit{Jʹj},n}\left(H_{\mathit{Jʹj},n}{T}_n\right)}\ge \mathrm{\Delta }{\mathit{SJR}}_n$$

sachant que π_Ymn(Codage_m,H0'_m,n,T_n) = tr[Y_mn.Y_mn ^H] = tr[T_n.X_mn.X_mn ^H.T_n ^H]
= tr[T_n.H0'_m,n.Codage_m.Data_m.(T_n. H0'_m,n. Codage_m.Data_m)^H], sachant que le paramètre de canal H₀'_m,n n'est pas contrôlé pour l'optimisation du critère mais connu par analyse et mesure et information a priori,
sachant que les données utiles Data_m ne sont ni connues ni contrôlées.
sachant que $$\begin{array}{ll}{\mathrm{\pi }}_{\mathrm{Jʹjn}}\left({\mathrm{T}}_{\mathrm{n}};{\mathrm{H}}_{\mathrm{J}}{\mathrm{ʹ}}_{\mathrm{j},\mathrm{n}}\right)& =\mathrm{tr}\left[{\mathrm{Jʹ}}_{\mathrm{jn}}\mathrm{.}{{\mathrm{Jʹ}}_{\mathrm{jn}}}^{\mathrm{H}}\right]=\mathrm{tr}\left[{\mathrm{T}}_{\mathrm{n}}\mathrm{.}{\mathrm{J}}_{\mathrm{jn}}\mathrm{.}{{\mathrm{J}}_{\mathrm{jn}}}^{\mathrm{H}}\mathrm{.}{{\mathrm{T}}_{\mathrm{n}}}^{\mathrm{H}}\right]\\ & =\mathrm{tr}\left[\left({\mathrm{T}}_{\mathrm{n}}\mathrm{.}{\mathrm{H}}_{\mathrm{J}}{\mathrm{ʹ}}_{\mathrm{j},\mathrm{n}}\mathrm{.}{\mathrm{B}}_{\mathrm{j}}\right)\mathrm{.}{\left({\mathrm{T}}_{\mathrm{n}}\mathrm{.}{\mathrm{H}}_{\mathrm{J}}{\mathrm{ʹ}}_{\mathrm{j},\mathrm{n}}\mathrm{.}{\mathrm{B}}_{\mathrm{j}}\right)}^{\mathrm{H}}\right]\end{array}$$

sachant que les paramètres H_J'_j,n et B_j ne sont pas contrôlés pour l'optimisation du critère mais seulement connus par mesure, analyse et information a priori.
Critère de type Max SJR :
Pour chaque lien émetteur ami Tx_m - récepteur ami Rx_n, ce critère vise à garantir un rapport de puissance maximal entre le signal utile en sortie de traitement et le signal de brouillage en sortie de traitement correspondant à une qualité de réception a priori optimale pour l'ambiance radioélectrique environnant la transmission Tx_n <-> Rx_m. Pour chaque lien émetteur amis Tx_m, récepteur ami Rx_n, les paramètres recherchés sont ici

• la matrice de codage des données utiles à l'émission de Tx_m, soit le paramètre Codage_m ∈ Dom_Codage.
• l'opérateur traitement en réception de Rx_n, soit T_n ∈ Dom_T.

Pour tout lien ami Tx_m, Rx_n m= 1,...,M ; n= 1,...,N ; il s'agit donc de chercher des paramètres Codage_m et T_n qui maximisent le rapport entre le puissance du signal utile en sortie de traitement la somme des contributions de brouillage fratricides résiduelles, soit qui maximisent le critère $${\mathrm{SJR}}_{\mathrm{m},\mathrm{n}}=\frac{{\pi }_{\mathit{Ym},n}\left({\mathit{Codage}}_m{\mathrm{<figure-callout\; id="0"\; label="H"\; filenames="imgf0003.png,imgf0004.png"\; state="\{\{state\}\}">H</figure-callout>}}_{0ʹm,n}{T}_n\right)}{{\displaystyle \sum _{j=1}^J}{\pi }_{\mathit{Jʹj},n}\left(H_{\mathit{Jʹj},n}{T}_n\right)}$$

sachant que π_Ymn(Codage_m,H₀'_m,n,T_n) = tr[Y_mn.Y_mn ^H] = tr[T_n.X_mn.Xmn^H.Tn^H]
= tr[T_n.H₀'_m,n.Codage_m.Data_m.(T_n.H₀'_m,n. Codage_m.Data_m)^H], sachant que le paramètre de canal H₀'_m,n n'est pas contrôlé pour l'optimisation du critère mais connu par analyse et mesure et information a priori,
sachant que les données utiles Data_m ne sont ni connues ni contrôlées,
sachant que $$\begin{array}{ll}{\mathrm{\pi }}_{\mathrm{Jʹjn}}\left({\mathrm{T}}_{\mathrm{n}};{\mathrm{H}}_{\mathrm{J}}{\mathrm{ʹ}}_{\mathrm{j},\mathrm{n}}\right)& =\mathrm{tr}\left[{\mathrm{Jʹ}}_{\mathrm{jn}}\mathrm{.}{{\mathrm{Jʹ}}_{\mathrm{jn}}}^{\mathrm{H}}\right]=\mathrm{tr}\left[{\mathrm{T}}_{\mathrm{n}}\mathrm{.}{\mathrm{J}}_{\mathrm{jn}}\mathrm{.}{{\mathrm{J}}_{\mathrm{jn}}}^{\mathrm{H}}\mathrm{.}{{\mathrm{T}}_{\mathrm{n}}}^{\mathrm{H}}\right]\\ & =\mathrm{tr}\left[\left({\mathrm{T}}_{\mathrm{n}}\mathrm{.}{\mathrm{H}}_{\mathrm{J}}{\mathrm{ʹ}}_{\mathrm{j},\mathrm{n}}\mathrm{.}{\mathrm{B}}_{\mathrm{j}}\right)\mathrm{.}{\left({\mathrm{T}}_{\mathrm{n}}\mathrm{.}{\mathrm{H}}_{\mathrm{J}}{\mathrm{ʹ}}_{\mathrm{j},\mathrm{n}}\mathrm{.}{\mathrm{B}}_{\mathrm{j}}\right)}^{\mathrm{H}}\right]\end{array}$$

sachant que les paramètres H_J'_j,n et B_j ne sont pas contrôlés pour l'optimisation du critère mais seulement connus par mesure, analyse et information a priori.
Ceci s'écrit formellement $$\forall m=\mathrm{1..}M;n=1\dots N,T_n=\mathit{ArgMax}\left\{{\mathit{SJR}}_{m,n}\right\}=\underset{\underset{\mathit{cod\_m}\in \mathit{Dom\_Codages}}{t_n\in \mathit{Dom\_T}}}{\mathit{ArgMax}}\left\{\frac{{\pi }_{\mathit{Ym},n}\left({\mathit{cod}}_m{\mathrm{<figure-callout\; id="0"\; label="H"\; filenames="imgf0003.png,imgf0004.png"\; state="\{\{state\}\}">H</figure-callout>}}_{0\mathit{ʹ}\mathit{m},n}{t}_n\right)}{{\displaystyle \sum _{j=1}^J}{\pi }_{\mathit{Jʹj},n}\left(H_{\mathit{Jʹj},n}{t}_n\right)}\right\}$$

réaliser ce critère revient à résoudre pour tout m= 1,...,N et n= 1,...,N un problème d'optimisation du critère (quadratique sur la variable codage cod_m) ${\mathrm{SJR}}_{\mathrm{m},\mathrm{n}}=\frac{{\pi }_{\mathit{Ym},n}\left({\mathit{cod}}_m{\mathrm{<figure-callout\; id="0"\; label="H"\; filenames="imgf0003.png,imgf0004.png"\; state="\{\{state\}\}">H</figure-callout>}}_{0ʹm,n}{t}_n\right)}{{\displaystyle \sum _{j=1}^J}{\pi }_{\mathit{Jʹj},n}\left(H_{\mathit{Jʹj},n}{t}_n\right)}$

pour les variables cod_m et t_n, et sous les
contraintes cod_m ∈ Dom_Codage et t_n ∈ Dom_T.Four criteria which can be applied, from the least complex to the most complex to implement, are given below by way of nonlimiting illustration.
Criterion of the type Maximum threshold JR: for each receiver Rx _n , this criterion guarantees a level of interference on the output signals of treatment that does not exceed a given interference threshold ΔBr _n . For each receiver Rx _n , the desired parameter is only the processing operator receiving Rx _n in its value domain.
For all n = 1, ..., N, it is thus necessary to look for a parameter T _n in the domain Dom_T which verifies the following criterion of thresholding on the sum of the residual fratricidal contributions of the jammers: $${\mathit{JR}}_{\mathrm{not}}={\displaystyle \underset{j=1}{\overset{J}{\Sigma }}}{\pi }_{\mathit{Not\; a\; word},\mathrm{not}}\left(H_{\mathit{Not\; a\; word},\mathrm{not}}{T}_{\mathrm{not}}\right)\le \mathrm{\Delta }{\mathit{Br}}_{\mathrm{not}}$$

knowing that $$\begin{array}{ll}{\mathrm{\pi }}_{\mathrm{J\text{'}jn}}\left({\mathrm{T}}_{\mathrm{not}};{\mathrm{H}}_{\mathrm{J}}{\mathrm{\text{'}}}_{\mathrm{j},\mathrm{not}}\right)& =\mathrm{tr}\left[{\mathrm{J\text{'}}}_{\mathrm{jn}}\mathrm{.}{{\mathrm{J\text{'}}}_{\mathrm{jn}}}^{\mathrm{H}}\right]\\ & =\mathrm{tr}\left[{\mathrm{T}}_{\mathrm{not}}\mathrm{.}{\mathrm{J}}_{\mathrm{jn}}\mathrm{.}{{\mathrm{J}}_{\mathrm{jn}}}^{\mathrm{H}}\mathrm{.}{{\mathrm{T}}_{\mathrm{not}}}^{\mathrm{H}}\right]\\ & =\mathrm{tr}\left[\left({\mathrm{T}}_{\mathrm{not}}\mathrm{.}{\mathrm{H}}_{\mathrm{J}}{\mathrm{\text{'}}}_{\mathrm{j},\mathrm{not}}\mathrm{.}{\mathrm{B}}_{\mathrm{j}}\right)\mathrm{.}{\left({\mathrm{T}}_{\mathrm{not}}\mathrm{.}{\mathrm{H}}_{\mathrm{J}}{\mathrm{\text{'}}}_{\mathrm{j},\mathrm{not}}\mathrm{.}{\mathrm{B}}_{\mathrm{j}}\right)}^{\mathrm{H}}\right]\mathrm{.}\end{array}$$

and knowing that the parameters H _J ' _{j, n} and B _j are not controlled for the optimization of the criterion but known by analysis and measurement and information a priori.
Min JR type criterion: for each Rx _n friendly receiver, this criterion aims to find a minimum level of interference on the output signals of processing. For each receiver Rx _n , the optimized parameter is only the processing operator receiving Rx _n in its value domain.
For all n = 1, ..., N; it is therefore a question of seeking the reception processing T _n which minimizes the sum of the residual fratricidal contributions of the jammers $${\mathrm{JR}}_{\mathrm{not}}={\displaystyle \underset{j=1}{\overset{J}{\Sigma }}}{\pi }_{\mathit{Not\; a\; word},\mathrm{not}}\left(T_{\mathrm{not}}{H}_{\mathit{Not\; a\; word},\mathrm{not}}\right)$$

knowing that : $$\begin{array}{ll}{\mathrm{\pi }}_{\mathrm{J\text{'}jn}}\left({\mathrm{T}}_{\mathrm{not}};{\mathrm{H}}_{\mathrm{J}}{\mathrm{\text{'}}}_{\mathrm{j},\mathrm{not}}\right)& =\mathrm{tr}\left[{\mathrm{J\text{'}}}_{\mathrm{jn}}\mathrm{.}{{\mathrm{J\text{'}}}_{\mathrm{jn}}}^{\mathrm{H}}\right]\\ & =\mathrm{tr}\left[{\mathrm{T}}_{\mathrm{not}}\mathrm{.}{\mathrm{J}}_{\mathrm{jn}}\mathrm{.}{{\mathrm{J}}_{\mathrm{jn}}}^{\mathrm{H}}\mathrm{.}{{\mathrm{T}}_{\mathrm{not}}}^{\mathrm{H}}\right]\\ & =\mathrm{tr}\left[\left({\mathrm{T}}_{\mathrm{not}}\mathrm{.}{\mathrm{H}}_{\mathrm{J}}{\mathrm{\text{'}}}_{\mathrm{j},\mathrm{not}}\mathrm{.}{\mathrm{B}}_{\mathrm{j}}\right)\mathrm{.}{\left({\mathrm{T}}_{\mathrm{not}}\mathrm{.}{\mathrm{H}}_{\mathrm{J}}{\mathrm{\text{'}}}_{\mathrm{j},\mathrm{not}}\mathrm{.}{\mathrm{B}}_{\mathrm{j}}\right)}^{\mathrm{H}}\right]\end{array}$$

knowing that the parameters H _J ' _{j, n} and B _j are not controlled for the optimization of the criterion but only known by measurement, analysis and information a priori,
This is formally written for each receiver Rx _n : $$\forall \mathrm{not}=1...\mathrm{NOT},T_{\mathrm{not}}=\underset{t_{\mathrm{not}}\in \mathit{Dom\_T}}{\mathit{Arg}\min }\left\{{\mathit{JR}}_{\mathrm{not}}\right\}=\underset{t_{\mathrm{not}}\in \mathit{Dom\_T}}{\mathit{Arg}\min }\left\{{\displaystyle \underset{j=1}{\overset{J}{\Sigma }}}{\pi }_{\mathit{Not\; a\; word},\mathrm{not}}\left(H_{\mathit{Not\; a\; word},\mathrm{not}}{t}_{\mathrm{not}}\right)\right\}$$

To realize this criterion is to solve for all n = 1, ..., N; a problem of optimization of the criterion ${\displaystyle \underset{j=1}{\overset{J}{\Sigma }}}{\pi }_{\mathit{Not\; a\; word},\mathrm{not}}\left(H_{\mathit{Not\; a\; word},\mathrm{not}}{t}_{\mathrm{not}}\right)$

quadratic on the variable t _n , under the constraint t _n ∈ Dom_T.
Threshold criterion min SJR:
For each peer transmission link Tx _m - receiver Rx _n , this criterion aims to guarantee a power ratio between the useful signal at the output of processing and the interference signal at the output of processing which exceeds a given threshold ΔSJR _n corresponding to a quality prior reception. For each friend Tx _m issuer link, friend receiver Rx _n , the desired parameters are here

• the coding matrix of the data useful for the transmission of Tx _m , ie the Coding parameter _m ∈ Dom_Coding.
• the receiving processing operator of Rx _n , ie T _n ∈ Dom_T.

For every friend Tx _m , Rx _n m = 1, ..., M; n = 1, ..., N; it is therefore a question of looking for encoding parameters _m and T _n in the respective domains Dom_Codage and Dom_T which satisfy the following thresholding criterion on the ratio useful signal to boilers: $${\mathit{SJR}}_{m,\mathrm{not}}=\frac{{\pi }_{\mathit{Ym},\mathrm{not}}\left({\mathit{Coding}}_m{\mathrm{<figure-callout\; id="0"\; label="H"\; filenames="imgf0003.png,imgf0004.png"\; state="\{\{state\}\}">H</figure-callout>}}_{0\text{'}m,\mathrm{not}}{T}_{\mathrm{not}}\right)}{{\displaystyle \underset{j=1}{\overset{J}{\Sigma }}}{\pi }_{\mathit{Not\; a\; word},\mathrm{not}}\left(H_{\mathit{Not\; a\; word},\mathrm{not}}{T}_{\mathrm{not}}\right)}\ge \mathrm{\Delta }{\mathit{SJR}}_{\mathrm{not}}$$

knowing that π _Ymn (Coding _m , H0 ' _{m, n} , T _n ) = tr [Y _mn .Y _mn ^H ] = tr [T _n .X _mn .X _mn ^H .T _n ^H ]
= tr [T _n .H0 ' _{m, n} .Code _m .Data _m . (T _n . H0' _{m, n} . Coding _m .Data _m ) ^H ], knowing that the channel parameter H ₀ ' _{m, n} n is not controlled for the optimization of the criterion but known by analysis and measurement and information a priori,
knowing that the data _m useful data are neither known nor controlled.
knowing that $$\begin{array}{ll}{\mathrm{\pi }}_{\mathrm{J\text{'}jn}}\left({\mathrm{T}}_{\mathrm{not}};{\mathrm{H}}_{\mathrm{J}}{\mathrm{\text{'}}}_{\mathrm{j},\mathrm{not}}\right)& =\mathrm{tr}\left[{\mathrm{J\text{'}}}_{\mathrm{jn}}\mathrm{.}{{\mathrm{J\text{'}}}_{\mathrm{jn}}}^{\mathrm{H}}\right]=\mathrm{tr}\left[{\mathrm{T}}_{\mathrm{not}}\mathrm{.}{\mathrm{J}}_{\mathrm{jn}}\mathrm{.}{{\mathrm{J}}_{\mathrm{jn}}}^{\mathrm{H}}\mathrm{.}{{\mathrm{T}}_{\mathrm{not}}}^{\mathrm{H}}\right]\\ & =\mathrm{tr}\left[\left({\mathrm{T}}_{\mathrm{not}}\mathrm{.}{\mathrm{H}}_{\mathrm{J}}{\mathrm{\text{'}}}_{\mathrm{j},\mathrm{not}}\mathrm{.}{\mathrm{B}}_{\mathrm{j}}\right)\mathrm{.}{\left({\mathrm{T}}_{\mathrm{not}}\mathrm{.}{\mathrm{H}}_{\mathrm{J}}{\mathrm{\text{'}}}_{\mathrm{j},\mathrm{not}}\mathrm{.}{\mathrm{B}}_{\mathrm{j}}\right)}^{\mathrm{H}}\right]\end{array}$$

knowing that the parameters H _J ' _{j, n} and B _j are not controlled for the optimization of the criterion but only known by measurement, analysis and information a priori.
Max SJR type criterion:
For each peer-to-peer sending link Tx _m - receiver Rx _n , this criterion aims to guarantee a maximum power ratio between the useful signal at the output of processing and the interference signal at the output of processing corresponding to a quality of reception which is a priori optimal for the radio environment surrounding the transmission Tx _n <-> Rx _m . For each friend Tx _m issuer link, friend receiver Rx _n , the desired parameters are here

• the coding matrix of the data useful for the transmission of Tx _m , ie the Coding parameter _m ∈ Dom_Coding.
• the receiving processing operator of Rx _n , ie T _n ∈ Dom_T.

For every friend Tx _m , Rx _n m = 1, ..., M; n = 1, ..., N; it is thus necessary to look for parameters Coding _m and T _n which maximize the ratio between the power of the useful signal at the output of treatment the sum of the contributions of scrambling residual fratricidal, that which maximizes the criterion $${\mathrm{SJR}}_{\mathrm{m},\mathrm{not}}=\frac{{\pi }_{\mathit{Ym},\mathrm{not}}\left({\mathit{Coding}}_m{\mathrm{<figure-callout\; id="0"\; label="H"\; filenames="imgf0003.png,imgf0004.png"\; state="\{\{state\}\}">H</figure-callout>}}_{0\text{'}m,\mathrm{not}}{T}_{\mathrm{not}}\right)}{{\displaystyle \underset{j=1}{\overset{J}{\Sigma }}}{\pi }_{\mathit{Not\; a\; word},\mathrm{not}}\left(H_{\mathit{Not\; a\; word},\mathrm{not}}{T}_{\mathrm{not}}\right)}$$

knowing that π _Ymn (Coding _m , H ₀ ' _{m, n} , T _n ) = tr [Y _mn .Y _mn ^H ] = tr [T _n .X _mn .Xmn ^H .Tn ^H ]
= tr [T _n .H ₀ ' _{m, n} .Coding _m .Data _m . (T _n .H ₀ ' _{m, n} . Coding _m .Data _m ) ^H ], knowing that the channel parameter H ₀ ' _{m, n} is not controlled for the optimization of the criterion but known by analysis and measurement and information a priori,
knowing that the Data _m data are neither known nor controlled,
knowing that $$\begin{array}{ll}{\mathrm{\pi }}_{\mathrm{J\text{'}jn}}\left({\mathrm{T}}_{\mathrm{not}};{\mathrm{H}}_{\mathrm{J}}{\mathrm{\text{'}}}_{\mathrm{j},\mathrm{not}}\right)& =\mathrm{tr}\left[{\mathrm{J\text{'}}}_{\mathrm{jn}}\mathrm{.}{{\mathrm{J\text{'}}}_{\mathrm{jn}}}^{\mathrm{H}}\right]=\mathrm{tr}\left[{\mathrm{T}}_{\mathrm{not}}\mathrm{.}{\mathrm{J}}_{\mathrm{jn}}\mathrm{.}{{\mathrm{J}}_{\mathrm{jn}}}^{\mathrm{H}}\mathrm{.}{{\mathrm{T}}_{\mathrm{not}}}^{\mathrm{H}}\right]\\ & =\mathrm{tr}\left[\left({\mathrm{T}}_{\mathrm{not}}\mathrm{.}{\mathrm{H}}_{\mathrm{J}}{\mathrm{\text{'}}}_{\mathrm{j},\mathrm{not}}\mathrm{.}{\mathrm{B}}_{\mathrm{j}}\right)\mathrm{.}{\left({\mathrm{T}}_{\mathrm{not}}\mathrm{.}{\mathrm{H}}_{\mathrm{J}}{\mathrm{\text{'}}}_{\mathrm{j},\mathrm{not}}\mathrm{.}{\mathrm{B}}_{\mathrm{j}}\right)}^{\mathrm{H}}\right]\end{array}$$

knowing that the parameters H _J ' _{j, n} and B _j are not controlled for the optimization of the criterion but only known by measurement, analysis and information a priori.
This is formally written $$\forall m=\mathrm{1\; ..}M;\mathrm{not}=1...\mathrm{NOT},T_{\mathrm{not}}=\mathit{argmax}\left\{{\mathit{SJR}}_{m,\mathrm{not}}\right\}=\underset{\underset{\mathit{cod\_m}\in \mathit{Dom\_Codages}}{t_{\mathrm{not}}\in \mathit{Dom\_T}}}{\mathit{argmax}}\left\{\frac{{\pi }_{\mathit{Ym},\mathrm{not}}\left({\mathit{cod}}_m{\mathrm{<figure-callout\; id="0"\; label="H"\; filenames="imgf0003.png,imgf0004.png"\; state="\{\{state\}\}">H</figure-callout>}}_{0\mathit{\text{'}}\mathit{m},\mathrm{not}}{t}_{\mathrm{not}}\right)}{{\displaystyle \underset{j=1}{\overset{J}{\Sigma }}}{\pi }_{\mathit{Not\; a\; word},\mathrm{not}}\left(H_{\mathit{Not\; a\; word},\mathrm{not}}{t}_{\mathrm{not}}\right)}\right\}$$

to realize this criterion amounts to solving for all m = 1, ..., N and n = 1, ..., N a problem of optimization of the criterion (quadratic on the coding variable cod _m ) ${\mathrm{SJR}}_{\mathrm{m},\mathrm{not}}=\frac{{\pi }_{\mathit{Ym},\mathrm{not}}\left({\mathit{cod}}_m{\mathrm{<figure-callout\; id="0"\; label="H"\; filenames="imgf0003.png,imgf0004.png"\; state="\{\{state\}\}">H</figure-callout>}}_{0\text{'}m,\mathrm{not}}{t}_{\mathrm{not}}\right)}{{\displaystyle \underset{j=1}{\overset{J}{\Sigma }}}{\pi }_{\mathit{Not\; a\; word},\mathrm{not}}\left(H_{\mathit{Not\; a\; word},\mathrm{not}}{t}_{\mathrm{not}}\right)}$

for the variables cod _m and t _n , and under the
constraints cod _m ∈ Dom_Coding and t _n ∈ Dom_T.

Example 1: Co-operative Damming Scramble

This particular example of implementation of the invention is applicable to the optimization of tactical barrier jamming in the presence of communication stations with frequency evasion, process which was the subject of the Applicant's patent under the number EP 1303069 .

It is shown below how the general method of the invention described above is declined for this particular application.

The dam jammer or the dam jammer network has the ability to interrupt transmissions on certain time slots and certain frequency channels, following certain pseudo random laws. This capacity is a priori known friendly posts, and the main possible settings that correspond to it, especially frequency plans and pseudo-random laws corresponding to slots unoccupied by jamming signals.

P tactical positions present on the theater are scrambled noted Cip, p = 1, ..., P. These positions are known positions or not. The services they use and the corresponding operating points are assumed to be known to jammers as well as their characteristics (thresholds for interference / denial of the various services, operating margins, etc.). The jammers adapt the settings of their damming waveform.

N frequency hopping transmitters and receivers seek to preserve their communication links, denoted by R _n n = 1, ..., N. These transmitters / receivers are of approximately known positions and under the control of local communication nodes called NLCs (in a simplified implementation of the invention, the NLCs can be for example the transmitters friends of each useful link, in a more elaborate implementation, the NLCs can be local infrastructure components, relays, "master" transmission stations dedicated to command, etc.)

• ○ évaluer les risques d'interférences induites par les signaux de brouillage sur les récepteurs qu'il contrôle (ou sur ceux qui sont à préserver).
• ○ rechercher les slots temporels et les canaux fréquentiels inoccupés par les signaux de brouillage.
• ○ piloter en conséquence les émissions des postes sous son contrôle de manière à faire coïncider leurs émissions avec les canaux fréquentiels et avec les slots temporels non-occupés par les signaux de brouillage.

The positions of the jammers, the positions of the transmitters and receivers friends under his control and the panel of usable waveforms and associated settings are known to each NLC local controller node. For example, the frequency hopping laws, and if applicable, the slot and power transmission channels as well as the waveforms used may be chosen by the NCL, or even controlled by means of a synchronization signal transmitted to the stations it controls (slave stations). In addition, NCLs have analysis module sensing functions or associated interception capabilities that allow them to drive dies at once on transmitters / receivers whose positions they know, on the useful signals they control. I am aware of the transmissions and on the processing in reception of the slave stations, but also on the interfering signals which they do not control but of which they know the main possible characteristics which they can find by measurement in situ. Each NLC can therefore according to its measurements and its information a priori on the forms of jamming wave and on the stations under its control:

• ○ evaluate the risks of interference caused by interference signals on the receivers it controls (or on those to be preserved).
• ○ search for time slots and frequency channels unoccupied by interference signals.
• ○ to control the emissions of the stations under his control accordingly so as to match their emissions with the frequency channels and with the time slots not occupied by the jamming signals.

• de piloter les émissions EVF des communications utiles, sur les créneaux temporels ou slots temps/fréquence laissés vide par les brouilleurs,
• de contrôler au cours du temps la position des émetteurs récepteurs des liens utiles pour garantir (en gérant certaines marges de puissance et certains intervalles temporels de garde) la non-collision des signaux utiles avec les signaux brouilleurs malgré les temps de propagation différents desdits signaux,
• dans le cas de postes mobiles à vitesse rapide, de contrôler au cours du temps le Doppler des émetteurs récepteurs des liens utiles pour garantir (en gérant certaines marges de puissance et certains intervalles fréquentiels de garde) la non-collision des bandes des signaux utiles avec celles des signaux brouilleurs malgré les vitesses relatives différentes des émetteurs desdits signaux.

The process of applying the method according to the invention can be indexed frame by frame. The k-th frame will be noted t _k . It is then for a local controller node NLC at each frame:

• to control the EVF emissions of useful communications, on the time slots or time / frequency slots left empty by the jammers,
• to control, over time, the position of the transceivers of the links that are useful for guaranteeing (by managing certain power margins and guard time intervals) the non-collision of the useful signals with the interfering signals despite the different propagation times of said signals,
• in the case of high-speed mobile stations, to control over time the Doppler of the transceivers of the links useful to guarantee (by managing certain power margins and certain guard intervals) the non-collision of the bands of the useful signals with those of interfering signals despite the different relative speeds of the transmitters of said signals.

In many cases the propagation times of the ground-ground communication signals over a few tens of kilometers at the most are negligible compared to the useful bearing times. Similarly Doppler shifts corresponding to slow platforms are negligible in front of the bands of useful emissions. The physical problem is simplified and is reduced to the determination of the start times of emissions and channels corresponding to these emissions by the local node of communications (NLC). In more complex cases of long distance propagation from mobile platforms (communication on aircraft and on satellite traveling for example), the NLC must moreover take into account the propagation times and relative Doppler).

Direct deterministic resolution of the optimization problem

If the local communication node NLC is ideal, knows or knows how to restore by its measurement, the slots and the frequency channels left free by the jammer (s) on the current and future frames and if it knows exactly the "slave" stations under risk of jamming and finally if he knows exactly how to place the slots of his "slave" positions on the slots left free by the jammer (s) without overflowing on the adjacent frequencies nor on the adjacent slots, the previous optimization problem is simplified in the form of a resource allocation problem. There is indeed no fratricidal impact of the scrambling on the useful links when the NLC can impose the following instruction to the slave stations at risk of jamming: for each frame t _k , spread for the links under interference emissions and receptions useful signals on the slots left free by the jammer, to allocate slots and free channels for transmitters and receivers slaves according to a priority management strategy, according to a latency management strategy or according to a random competitive strategy of the ALOHA type, or according to any strategy conventionally used in radio access technologies.

Note that in this implementation of the invention, the precise knowledge of the positions of the slave stations and jammers by the local communication node provides material for further optimization while remaining very simple: for example the knowledge of the positions directivités and orientation of the jamming antennas and the knowledge of the position of the slave stations allows the NLC to restore by simple models (link budget) the risk of jamming of its slave stations, and to select a priori only the slave stations which are actually under threat of interference in the aforementioned resource allocation strategy. The measurements made by the NLC and reassembled, if necessary, by the slave stations to the NLC via the return links of the friendly links serve only to reinforce the allocation strategy by confirming the absence of fratricidal interference or their low levels on the slots. allocated.

If this variant is pushed to the extreme, it is even possible to consider the implementation of the invention in an even more simplified framework with a NLC not performing any measurement and simply informed a priori channels and time slots left free from jamming; said information comes for example from a known law of the scrambler and the NLC decided in advance, or said information being coded in the scrambling signal itself and decoded by the NLC in its analysis of the jamming signal, or said information being obtained by decoding information transmitted in a tagging signal or trigger associated with the jammer.

Cases of multiple jammers with faults + taking into account estimated interference budgets by using information a priori measurements and propagation models

• Temps de descente et de montée du signal de brouillage induisant une durée de disponibilité du slot inférieure à la durée slot, ce qui réduit d'autant la durée transmission exploitables dans les slots de brouillage laissés vides,
• Débordement spectral du signal de brouillage sur une partie des canaux laissés vides, en raison d'un filtrage insuffisant du spectre des signaux de brouillage, ce qui réduit d'autant la bande de transmission utile dans les canaux laissés vides de brouillage
• Bilans de liaison entre les brouilleurs Br_j et les récepteurs utiles R_n modélisés par des coefficient de perte L_j,n induisant un niveau en entrée L_j,nP_j (P_j : puissance isotrope rayonnée équivalente à l'émission par le brouilleur d'indice j). Ces niveaux d'entrées peuvent être estimés par les récepteurs amis (au moins le NLC, voire les récepteurs esclaves le cas échéant) d'après la connaissance a priori (ou d'après la récupération par analyse des signaux de brouillage) de la PIRE émise, d'après la connaissance des positions et caractéristiques angulaires respectives des émetteurs amis des récepteurs amis et des brouilleurs, et d'après un modèle de propagation simplifié (suffisamment représentatif des phénomènes d'atténuation dans les bandes de fréquence concernées pour la topologie de terrain concerné et pour les distances entrant en jeu). Ces informations, lorsqu'elles sont relatives aux brouilleurs, proviennent par exemple de stratégies connues à l'avance des récepteurs amis (au moins connues du NLC) dont la mise en oeuvre est aisément reconnaissable à l'analyse des signaux de brouillage ; ou bien ces informations étant codées dans le signal de brouillage lui-même et décodées par le NLC dans son analyse du signal de brouillage ; ou bien ces informations étant codées dans un signal de taggage associé au brouilleur, par exemple selon le procédé décrit dans la demande de brevet FR 1203071 du demandeur.
• Seuil ΔJR_n de fonctionnement relatif au récepteur ami Rx_n (selon leur service de transmission), traduisant une condition de la forme [Σ_j L_j,nP_j] < ΔJR_n, condition devant être vérifiée par la puissance cumulée des nuisances [Σ_j L_j,nP_j] induites par l'ensemble des brouillages fratricides, nuisances évaluées d'après les estimation de puissance P_j propres à l'émission de chaque brouilleur et d'après le bilan de liaison L_j,n estimés pour chaque lien brouilleur Br_j - récepteur Rx_n. La condition précitée traduit de manière (ici simplifiée mais suffisante et efficace dans de nombreux cas de mise en oeuvre de l'invention) la capacité de réception du lien utile Tx_m Rx_n dans des conditions de bruit + brouillage acceptables. Elle peut être évaluée a priori assez simplement à partir de la connaissance a priori des schémas de brouillage ou de leur reconnaissance in situ par analyse, et par un modèle de bilan de liaison. Elle peut être confortée in situ par mesure de Rx_n sur les signaux de brouillage.

The above examples and variants of implementation of the invention extend directly to the taking into account of the imperfections of one or more jammers, powers and directivités in emission of said jammers, directivités in reception of the receivers , attenuations and filters of propagation of the jammers to the friendly receivers, as well as operating thresholds of the friendly receivers:

• Falling and rising time of the jamming signal inducing a slot availability time less than the slot time, thereby reducing the usable transmission time in the jamming slots left empty,
• Spectral overflow of the scrambling signal on part of the channels left empty, due to insufficient filtering of the spectrum of the interference signals, thus reducing the useful transmission band in the channels left empty of interference
• Link budgets between the interferers Br _j and the useful receivers R _n modeled by loss coefficients L _{j, n} inducing an input level L _{j, n} P _j (P _j : Isotropic radiated power equivalent to the emission by the jammer of index j). These input levels can be estimated by the friendly receivers (at least the NLC, or even the slave receivers if any) according to the prior knowledge (or from the recovery by analysis of the interference signals) of the EIRP emitted, based on the knowledge of the respective angular positions and characteristics of the friendly transmitters and the interferers, and on a simplified propagation model (sufficiently representative of the attenuation phenomena in the frequency bands concerned for the topology of terrain concerned and for the distances involved). This information, when it relates to jammers, comes from, for example, known strategies in advance of the friendly receivers (at least known to the NLC) whose implementation is easily recognizable by the analysis of the jamming signals; or this information being coded in the scrambling signal itself and decoded by the NLC in its analysis of the scrambling signal; or this information being encoded in a tagging signal associated with the jammer, for example according to the method described in the patent application FR 1203071 the applicant.
• Threshold ΔJR _n of operation relative to the receiver Rx _n receiver (according to their transmission service), reflecting a condition of the form [Σ _j L _{j, n} P _j ] <ΔJR _n , condition to be verified by the cumulative power nuisance [ Σ _{j Lj, n} P _j ] induced by all the fratricidal interference, nuisances evaluated according to the power estimate P _j specific to the emission of each jammer and according to the estimated link _budget L _{j, n} for each interfering link Br _j - receiver Rx _n . The aforesaid condition translates (in this case simplified but sufficient and effective in many cases of implementation of the invention) the reception capacity of the useful link Tx _m Rx _n under acceptable noise + interference conditions. It can be evaluated a priori fairly simply from the prior knowledge of the interference schemes or their in situ recognition by analysis, and by a link budget model. It can be comforted in situ by measuring Rx _n on the jamming signals.

• Seuil ΔSJR_m,n de fonctionnement relatif aux liens utiles entre émetteur ami Tx_m récepteur ami Rx_n (selon leur service de transmission), traduisant une condition de la forme π_Ym,n / [Σ_j L_j,nP_j] > ΔSJR_n, condition devant être vérifiée par le rapport entre la puissance utile reçue π_Ym,n mesurée et la puissance cumulée des nuisances [Σ_j L_j,nP_j] induites par l'ensemble des brouillages fratricides, nuisances évaluées d'après les estimation de puissance P_j propres à l'émission de chaque brouilleur et d'après un modèle de bilan de liaison L_j,n estimés pour chaque lien brouilleur Br_j - récepteur Rx_n. La condition précitée traduit de manière (ici simplifiée mais suffisante et efficace dans de nombreux cas de mise en oeuvre de l'invention) la capacité d'établissement et/ou du maintien du lien utile Tx_m Rx_n dans des conditions acceptables. Elle peut être évaluée assez simplement à partir de la connaissance a priori des schémas de brouillage ou de leur reconnaissance in situ par analyse, par un modèle de bilan de liaison (le cas échéant conforté par mesure analyse in situ de Rx_n sur les signaux brouilleurs), et à partir des mesures de niveau reçu sur le signal utile.

The optimization problem is then solved in a very simplified way by a resource re-allocation strategy, here conditional on the ΔJR _n thresholding: the fratricidal effects on the friendly stations remain limited and insignificant since the NLC can impose the setpoint. next to the slave stations at risk of interference (ie for which we would have [Σ _j L _{j, n} P _j ]> ΔSJR _n in the absence of re-allocation and in the presence of interference signals corresponding to the received power ratings P ₁ ... P _J ): for each frame t _k , re-allocate the links under risk of jamming the transmissions and receptions of the useful signals on the slots left free by the jammer, to allocate the slots and free channels to the transmitters and slave receivers at risk of jamming a priority management strategy, according to a latency management strategy or a random competitive strategy of the ALOHA type, or according to any strategy conventionally used in radio access techniques.

• Threshold ΔSJR _{m, n} of operation relative to the useful links between the friendly transmitter Tx _m the friend receiver Rx _n (according to their transmission service), expressing a condition of the form π _{Ym, n} / [Σ _j L _{j, n} P _j ]> ΔSJR _n , a condition to be verified by the ratio between the received useful power π _{Ym, n} measured and the cumulative power of the nuisances [Σ _j L _{j, n} P _j ] induced by the totality of the fratricidal interference, nuisances evaluated according to the power estimate P _j specific to the emission of each interferer and according to a link budget model L _{j, n} estimated for each interfering link Br _j - receiver Rx _n . The aforesaid condition translates (in this case simplified but sufficient and effective in many cases of implementation of the invention) the ability to establish and / or maintain the useful link Tx _m Rx _n under acceptable conditions. It can be evaluated quite simply from a priori knowledge of the interference schemes or their in situ recognition by analysis, by a link budget model (where appropriate supported by in-situ analysis of Rx _n on interfering signals ), and from the level measurements received on the wanted signal.

The problem of optimization is solved here again in a very simplified way by a strategy of re-allocation of resource, here conditional on thresholding ΔSJR _n : the fratricidal effects on the friendly posts remain limited and insignificant as soon as the NLC can impose the following setpoint at the slave stations at risk of interference (ie for which we would have π _{Ym, n} / [Σ _j L _{j, n} P _j ] <ΔSJR _n in the absence of re-allocation and in the presence of corresponding scrambling signals to evaluations of received powers P ₁ ... P _J ): for each frame t _k , re-allocate the links under risk of jamming the transmissions and receptions of the useful signals on the slots left free by the jammer, to allocate the slots and free channels to slave transmitters and receivers at risk of scrambling according to a priority management strategy, according to a latency management strategy or according to an ALOHA-type random competitive strategy, or according to any strategy conventionally used in radio access techniques.

Claims (8)

A method for adaptively and decentrally minimizing the fratricidal effects induced by the scrambling of ZB zones or predefined positions in a communications network comprising friendly transmitters, jammers and friendly receivers, said network comprising N_pl platforms, a number M ≤ N_pl of said platforms, said friendly transmission platforms being equipped with antennas and systems of transmission of useful transmission signals dynamically configurable, a number N ≤ N_pl said platforms, also called friends, being equipped with antennas and dynamically configurable systems for receiving useful transmission signals, a number J ≤ N_pl of said platforms being equipped with jamming systems and antennas having known characteristics of the transmitting and receiving receiving platforms, said interference systems and antennas being adapted to prevent transmissions between ext entities to said network of friendly platforms, said platforms constituting a network, characterized in that it comprises at least the following steps: • E ₀ : Establish a local reception situation: at each of the N friendly reception platforms (12 r, 13) measure, E ₁ , the communication signals Su friends received by said platforms from the M friendly transmitters (10 e, 11), from said measurements, for each of the N receiving reception platforms, estimating, E ₂ , the M useful levels received and the M useful propagation channels, N * M estimated, • E ₃ : Establish a local interference situation: at each of the N receiving host platforms (12 r, 13) measure, E ₄ , the interference signals received by said friendly receiving platforms from the J interferers (14 , 15b), from the measurements of the interference signals, for each of the N receiving reception platforms, estimate, E ₅ , the J received fratricidal interference levels and the J fribricidal interference channels, N * J estimated at all. , Knowing a priori the waveforms of the scrambling signals and the associated settings, from the states of the local jamming situation established by each of the N receiving platforms on the J signals from the jamming Js, from the local situation of reception of each of the N receiving platforms on the useful communication signals Su, determining for each of the M friendly sending platforms and for each of the N friendly receiving platforms, at least one of the following configuration parameters: a frequency plan, and / or time positioning of the transmissions, diagrams and / or antenna orientations, radio access schemes and modulation / coding schemes of the transmitted and received signals, the parameter or parameters being adapted to minimize or eliminate the fratricidal effects on the N platforms receiving friends, • use said configuration parameters for transmission and / or reception for the M friendly broadcast platforms and the N friendly reception platforms. - Method according to claim 1 characterized in that , after defining a first set of configuration parameters of M friendly platforms and N friendly platforms, the steps E ₀ to E ₅ are repeated over time in order to maintain and optimize the platform configuration settings. - Method according to claim 1 characterized in that it uses the measurement of the propagation channels from J jamming platforms, to recognize in situ a predefined and known scrambling strategy to jointly optimize the emission and quality of Useful transmissions at the receiving and receiving platform level by adapting transmission power levels and / or frequency plans and / or time positioning of emissions and / or spatio-temporal coding schemes and / or access protocols to the radio resource used by the transmitters and the friendly receivers. - A method according to claim 1 or 2 characterized in that it uses interference signals which encode, in a known manner friendly receivers, information useful to transmitters and receivers friends to inform them of the scrambling strategy used , interference waveform characteristics and associated parameters, transmit power, type of antenna pattern and orientation, position, altitude, to facilitate the joint optimization of transmissions and transmissions receiving useful transmissions at the level of friendly transmitting and receiving platforms, said coded information being reconstituted by analyzing the scrambling signals received by the decoded or decoded receivers in the scrambling signals received by the friendly receivers. - Method according to claim 1, 2 or 3, characterized in that it uses programmable transmitters and receivers adapted to dynamically take into account emission instructions, the power and / or time parameters, the form of wave, spatio-temporal coding, phase amplitude weighting of antenna elements - Use of the method according to one of claims 1 to 5 in transmission networks using the protocols MIMO, MISO, SIMO or SISO with or without feedback from the receivers to friends friendly transmitters. Use of the method according to one of claims 1 to 5 in a radio network comprising receivers adapted to measure values of transmission channels on the useful transmitters and on the jammers. Use of the method according to one of claims 1 to 5 in a radio network comprising one or more reception stations comprising antennal elements coupled to an interceptor adapted to perform transmission channel measurements on useful transmitters and on jammers.

Images