Sélection de la langue

Search

Sommaire du brevet 2703369 

Énoncé de désistement de responsabilité concernant l'information provenant de tiers

Une partie des informations de ce site Web a été fournie par des sources externes. Le gouvernement du Canada n'assume aucune responsabilité concernant la précision, l'actualité ou la fiabilité des informations fournies par les sources externes. Les utilisateurs qui désirent employer cette information devraient consulter directement la source des informations. Le contenu fourni par les sources externes n'est pas assujetti aux exigences sur les langues officielles, la protection des renseignements personnels et l'accessibilité.

Disponibilité de l'Abrégé et des Revendications

L'apparition de différences dans le texte et l'image des Revendications et de l'Abrégé dépend du moment auquel le document est publié. Les textes des Revendications et de l'Abrégé sont affichés :

  • lorsque la demande peut être examinée par le public;
  • lorsque le brevet est émis (délivrance).
(12) Brevet: (11) CA 2703369
(54) Titre français: PROCEDE ET SYSTEME POUR DESENTRELACER DES SIGNAUX
(54) Titre anglais: METHOD AND SYSTEM FOR DEINTERLEAVING SIGNALS
Statut: Périmé et au-delà du délai pour l’annulation
Données bibliographiques
(51) Classification internationale des brevets (CIB):
  • G1S 1/00 (2006.01)
  • G1S 7/292 (2006.01)
(72) Inventeurs :
  • DRAKE, SAMUEL PICTON (Australie)
  • ANDERSON, BRIAN (Australie)
  • YU, CHANGBIN (Australie)
(73) Titulaires :
  • NATIONAL ICT AUSTRALIA LIMITED
  • THE COMMONWEALTH OF AUSTRALIA, OF THE SECRETARY, DEPARTMENT OF DEFENCE
(71) Demandeurs :
  • NATIONAL ICT AUSTRALIA LIMITED (Australie)
  • THE COMMONWEALTH OF AUSTRALIA, OF THE SECRETARY, DEPARTMENT OF DEFENCE (Australie)
(74) Agent: ROBIC AGENCE PI S.E.C./ROBIC IP AGENCY LP
(74) Co-agent:
(45) Délivré: 2017-07-11
(22) Date de dépôt: 2010-05-07
(41) Mise à la disponibilité du public: 2011-10-28
Requête d'examen: 2015-04-14
Licence disponible: S.O.
Cédé au domaine public: S.O.
(25) Langue des documents déposés: Anglais

Traité de coopération en matière de brevets (PCT): Non

(30) Données de priorité de la demande:
Numéro de la demande Pays / territoire Date
2010201700 (Australie) 2010-04-28

Abrégés

Abrégé français

Une méthode et un système sont présentés servant à désentrelacer des signaux. La méthode comprend : (a) lenregistrement de plusieurs événements de réception de signal, où chaque événement de réception de signal est associé à un signal reçu par un récepteur et représenté par une coordonnée espace-temps ayant une composante fondée sur un emplacement du récepteur et une composante de temps fondée sur lheure darrivée du signal reçu; (b) la sélection dun sous-ensemble dévénements de réception de signal à partir des événements de réception de signal enregistrés, où le nombre dévénements de réception de signal du sous-ensemble est fondé sur la composante despace et (c) la détermination de la satisfaction dune condition prédéterminée pour le sous-ensemble sélectionné et, si la détermination savère, lassociation des événements de détection de signal du sous-ensemble sélectionné avec une émission dun émetteur.


Abrégé anglais

There are provided method and system for deinterleaving signals. The method comprises: (a) recording plural signal reception events, wherein each signal reception event is associated with a received signal at a receiver, and represented by a space-time coordinate having a space component based on a location of the receiver and a time component based on an arrival time of the received signal; (b) selecting a subset of signal reception events from the recorded signal reception events, wherein the number of signal reception events in the subset is based on the dimension of the space component; and (c) determining whether the signal reception events in the selected subset satisfy a predetermined condition, and if the determination is in the affirmative, associating the signal reception events in the selected subset with an emission of an emitter.

Revendications

Note : Les revendications sont présentées dans la langue officielle dans laquelle elles ont été soumises.


22
CLAIMS
1. A method practiced by a processor and a data store for deinterleaving
signals, the
method comprising:
(a) the processor recording plural signal reception events in the data store,
wherein
each signal reception event is associated with a received signal at a
receiver, and
represented by a space-time coordinate having a space component based on
location of
the receiver and a time component based on arrival time of the received
signal;
(b) the processor selecting a subset of signal reception events from the
signal
reception events recorded in the data store, wherein the number of signal
reception events
in the subset is based on the dimension of the space component;
(c) the processor determining whether the signal reception events in the
selected
subset satisfy a predetermined condition, and if the determination is in the
affirmative,
associating the signal reception events in the selected subset with an
emission of an
emitter; and
(d) the processor recording a mapping between the associated subset of signal
reception events and the emission in the data store.
2. The method of claim 1, wherein the number of signal reception events in
the
subset is four if the space component is two dimensional, or five if the space
component
is three dimensional.
3. The method of claim 1 or 2, wherein the predetermined condition is that
signal
reception events in the selected subset lie on a light-cone of the emission.
4. The method of claim 3, wherein step (c) comprises the processor
calculating a
Cayley-Menger determinant of the selected subset of signal reception events
and
determining whether the calculated Cayley-Menger determinant satisfies the
predetermined condition.
5. The method of claim 4, wherein calculating the Cayley-Menger determinant
further comprises the processor calculating Euclidean space-time distances
between one
signal reception event and every other signal reception events in the selected
subset of
signal reception events.

23
6. The method of any one of claims 1 to 5, wherein the predetermined
condition is a
hypothesis test.
7. The method of any one of claims 1 to 6, further comprising the processor
determining the number of emission events based on the number of subset of
signal
reception events that are from the emission.
8. The method of any one of claims 1 to 7, wherein the emitter lies on a
first plane
above or below a second plane on which the receiver lies, and the height of
the emitter on
the first plane is significantly less than the mean distance between the
emitter and the
receiver.
9. The method of any one of claims 1 to 8, wherein the receiver is an
antenna array
comprising a plurality of receivers located apart in space.
10. The method of any one of claims 1 to 9, wherein signals received from
the
plurality of emitters are radar pulses.
11. The method of any one of claims 1 to 10, further comprising the
processor
repeating step (b) to select another subset of signal reception events and
repeating step (c)
until all combinations of signal reception events are selected.
12. A computer program product comprising a computer-readable medium
storing
executable instructions thereon that when executed by a processor perform the
steps of
the method according to any one of claims 1 to 11.
13. A system for deinterleaving signals, comprising a processor operable
to:
(a) record plural signal reception events, wherein each signal reception event
is
associated with a received signal at a receiver, and represented by a space-
time
coordinate having a space component based on a location of the receiver and a
time
component based on an arrival time of the received signal;
(b) select a subset of signal reception events from the recorded signal
reception
events, wherein the number of signal reception events in the subset is based
on the
dimension of the space component; and
(c) determine whether the signal reception events in the selected subset
satisfy a
predetermined condition, and if the determination is in the affirmative,
associate the
signal reception events in the selected subset with an emission of an emitter.

Description

Note : Les descriptions sont présentées dans la langue officielle dans laquelle elles ont été soumises.


CA 2703369 2017-02-24
1
Title
Method and System for Deinterleaving Signals
Technical Field
This description generally concerns deinterleaving of signals, and in
particular, a method,
system and software for deinterleaving signals.
Background
In many applications such as Electronic Support Measures (ESMs), it is
important to
determine the number, type and location of emitters in the environment. The
process of
associating the received signals to emitters is known as deinterleaving and in
rich
electromagnetic environments this can be extremely difficult.
Traditional approaches to deinterleaving separate signals on the basis of some
of the
signal parameters such as the carrier frequency, modulation scheme, or in the
case of
radars the where the signal is composed of discrete pulses, pulse repetition
pattern, pulse
width, or pulse modulation scheme [1-4].
Summary
According to the present invention, there is provided a method practiced by a
processor
and a data store for deinterleaving signals, the method comprising
(a) the processor recording plural signal reception events in the data store,
wherein
each signal reception event is associated with a received signal at a
receiver, and
represented by a space-time coordinate having a space component based on
location of
the receiver and a time component based on arrival time of the received
signal;
(b) the processor selecting a subset of signal reception events from the
signal
reception events recorded in the data store, wherein the number of signal
reception events
in the subset is based on the dimension of the space component;
(c) the processor determining whether the signal reception events in the
selected
subset satisfy a predetermined condition, and if the determination is in the
affirmative,
associating the signal reception events in the selected subset with an
emission of an
emitter; and
(d) the processor recording a mapping between the associated subset of signal
reception events and the emission in the data store.
Preferred embodiments are described hereunder.

CA 2703369 2017-02-24
la
According to a first aspect, there is provided a method for deinterleaving
signals,
comprising:
(a) recording plural signal reception events, wherein each signal reception
event is
associated with a received signal at a receiver, and represented by a space-
time
coordinate having a space component based on a location of the receiver and a
time
component based on an arrival time of the received signal;
(b) selecting a subset of signal reception events from the recorded signal
reception
events, wherein the number of signal reception events in the subset is based
on the
dimension of the space component; and
(c) determining whether the signal reception events in the selected subset
satisfy a
predetermined condition, and if the determination is in the affirmative,
associating the
signal reception events in the selected subset with an emission of an emitter.
Using the method, signals that arrive at different arrival times and at
different receivers
are associated with an emitter based on the arrival times and location of the
receivers.
The method can be applied to a subset of signal reception events at a time,
where the
number of signal reception events in the subset is based on the dimension of
the space

CA 02703369 2010-05-07
2
component. The method has application in various fields, such as for
deinterleaving
signal reception events such as radar pulses in a defence application.
The method is to be contrasted with techniques that require collection or
calculation of
large amount of emitter characteristics data, such as transmitter power,
carrier
frequency, modulation of pulse and pulse train cross correlation [5-11].
Measurement
of the modulation of pulse generally requires very high sampling rates and
hence is
generally more expensive, heavier and has hardware with higher power
consumption.
The method is also to be contrasted with techniques that require estimation of
pulse
train cross correlation, which requires a continuous stream of pulse to be
recorded by at
!east two receivers. If the pulse train is not long enough or there are many
emitters, it is
often not possible to separate out the emitting radar signals. Further, when
multipath is
present (where the reflection of emitted signals from an object prior to being
received),
the received signals are often become mixed in with the unobstructed signals.
Also, the
brevity of this dwell time means that is often impossible to calculate pulse
train cross
correlation for radars in surveillance mode that scan continuously and hence
only dwell
for about tens of milliseconds on a receiver.
Further, techniques that generate angle of arrivals to estimate number and
angle of
arrival of emitters [21] might be unable to separate emitters that are near
the same
bearing lines and "ghost" emitters that are indistinguishable from real
emitters may
occur [12-14].
The number of signal reception events in the subset may be four if the space
component
is two dimensional, or five if the space component is three dimensional. The
predetermined condition may be that signal reception events in the selected
subset lie
on a light-cone of the emission.
Step (c) may comprise calculating a Cayley-Menger determinant of the selected
subset
of signal reception events and determining whether the calculated Cayley-
Menger
determinant satisfies the predetermined condition. Calculating the Cayley-
Menger
determinant may further comprise calculating Euclidean space-time distances
between
one signal reception event and every other signal reception events in the
selected subset
of signal reception events.

CA 2703369 2017-02-24
3
The predetermined condition may be a hypothesis test, such as to take into
account signal
noises.
The method may further comprise determining the number of emission events
based on
the number of subset of signal reception events that are from the same
emission.
The emitter may lie on a first plane above or below a second plane on which
the receiver
lies. In this case, the height of the emitter on the first plane is
significantly less than the
mean distance between the emitter and the receiver.
The receiver may be an antenna array comprising a plurality of receivers
located apart in
space. In one application, signals received from the plurality of emitters may
be radar
pulses.
The method may further comprise repeating step (b) to select another subset of
signal
reception events and repeating step (c) until all combinations of signal
reception events
are selected.
According to the present invention, there is also provided a computer program
product
comprising a computer-readable medium storing executable instructions thereon
that
when executed by a processor perform the steps of the method.
According to a second aspect, there is provided a computer program comprising
executable instructions recorded on a computer-readable medium, the program
being
operable to perform the method for deinterleaving signals according to the
first aspect.
According to a third aspect, there is provided a system for deinterleaving
signals,
comprising a processor operable to:
(a) record plural signal reception events, wherein each signal reception event
is
associated with a received signal at a receiver, and represented by a space-
time
coordinate having a space component based on a location of the receiver and a
time
component based on an arrival time of the received signal;
(b) select a subset of signal reception events from the recorded signal
reception
events, wherein the number of signal reception events in the subset is based
on the
dimension of the space component; and
(c) determine whether the signal reception events in the selected subset
satisfy a
predetermined condition, and if the determination is in the affirmative,
associate the
signal reception events in the selected subset with an emission of an emitter.

CA 02703369 2010-05-07
4
Brief Description of Drawings
Non-limiting example(s) of the method and system will now be described with
reference to the accompanying drawings, in which:
Fig. i is a schematic diagram of system with a plurality of receivers and
emitters.
Fig. 2 is a flowchart of steps performed by a signal processor.
Fig. 3 is a graph showing a light cone and a geodesic curved in Cartesian
space
time coordinates.
Fig. 4 is a chart of all possible 81 bearing lines for the emitters based on
the
combinations of quartets of received signal space-time events given in Table
2.
Fig. 5 is a chart showing the locations of receivers, and the true emitter
locations
and the bearing lines of the only space-time quartets that satisfy the
hypothesis test
given in Eq. (7).
Fig. 6 is an exemplary system for deinterleaving signals.
Detailed Description
Referring first to Fig. 1, the system 100 comprises a plurality of emitters
110, 112
emitting electromagnetic signals and an antenna array 120 comprising a
plurality of
receivers 122, 124, 126, 128 capable of accurately measuring the time
difference of
arrival of signals. The antenna array 120 may be constructed using a precise
time
interval measuring unit such as the ATMD-GPX [16-18].
The system 100 further comprises a signal processor 130 that records signal
reception
events based on signals received at the antenna array 120. A data store 140 is
accessible
by the signal processor 130 to store the signal reception events 142.
A signal reception event represents a point on a space-time diagram. For
example in
the 2+1 Cartesian space time coordinates, a signal reception event comprises
three
parameters:
[ct, x, y],
where c is the speed of light, t is a time component representing the time of
arrival of a
signal received at a receiver 122, 124, 126, 128 in time domain, and (x, y) is
a space
component in the form of a two-dimensional coordinate of the receiver 122,
124, 126,
128 in Cartesian space domain.

CA 02703369 2010-05-07
In this example, the two-dimensional of the receivers 122, 124, 126, 128 when
placed
on the same plane on a square are:
-3 - - - - -
¨3
P = P:= Ii-0 = P4 =
_ - 3-
where p, is the two-dimensional coordinates of the ith receiver antenna in the
space
5 domain and i = 1,...,4.
Due to multipath and scattering, different versions of the signals emitted by
the emitters
110, 112 arrive at the receivers 122, 124, 126, 128 at different times.
Consider a
situation where three emitted signals arrive at each of the four receivers
122, 124, 126,
128 due to multipath propagation. The time of arrival of the respective signal
is
provided below in nanoseconds:
Table 1: Arrival Times in Nanoseconds
First Signal Second Signal Third Signal
Receiver 122 10.8000 13.3777 26.4210
Receiver 124 10.7780 12.5963 18.1737
Receiver 126 6.8247 21.2730 24.6170
Receiver 128 14.9967 17.9013 27.3223
Referring now to the flowchart in Fig. 2, the task of the signal processor 130
is to
deinterleave the received signals, i.e. to determine which of the signals are
associated
with the same emission of an emitter 110, 112 or different ones. An emission
is
represented by a space-time coordinate of a signal emission by an emitter 110,
112.
Based on the three received signals at each of the four receivers 122, 124,
126, 128, the
signal processor 130 records the signal reception events in Table 2; see step
210. Each
signal reception event is represented by a space-time coordinate having a two-
dimensional space component and a one-dimensional time component. The space
component represents the coordinate of the receiver's location in metres and
the time
component represents the arrival time of the signal in nanoseconds.

CA 02703369 2010-05-07
6
Table 2: Signal Reception Events
Receiver locations Signal reception events represented by space-time
relative to the coordinates comprising a time component in nanoseconds and
centre of the a two-dimensional space component in metres
antenna array in
metres
122 - p1 = [3, 0] T [10.8000, 3, 01 T [13.3777, 3, 0] r
[26.4210, 3, 0] T
124 -P2= [0, 317' [10.7780,0, 3] T [12.5963,0, 3] T [18.1737,0, 31T
126- p3 = [-3, 0] T [6.8247, -3,01 r [21.2730, -3,0] T
[24.6170, -3,01 T
128 - pa= [0, -3] T [14.9967, 0, -3] T [17.9013, 0, -3] T
[27.3223, 0, -3] T
To associate the signal reception events with the emitters 110, 112, the
signal processor
130 relies on the knowledge that signal reception events that lie on the same
light-cone
are causally connected to the same emission event of an emitter 110, 112, and
as such,
the Cayley-Menger determinant D constructed from the geodesic distances on the
surface of the light-cone of the events is zero. In an environment where the
time of
arrival measurements are noisy, the Cayley-Menger determinant D can be tested
against a predetermined condition in the form of hypothesis test Ho that will
be defined
below.
To explain the remaining steps in Fig. 2, the Cayley¨Menger determinant D,
Euclidean
distances4 and hypothesis test Ho for D in a noisy environment are first
discussed.
Cayley¨Menger Determinant
For 2+1 signal reception events, the Cayley¨Menger determinant D for four
signal
reception events is defined as [13]:
T4 1
\ (I \ I
11) del s-; Ai, 5i4 1 )
õ
57 1/47. s 7 0 1
I I I I 0

CA 02703369 2010-05-07
7
where 4 is the squared geodesic (shortest) distance between any two signal
reception
events in the space and i, j = 1, , 4.
The Cayley¨Menger determinant D can be used to determine whether a surface
defined
by four signal reception events is flat [7]. The Cayley¨Menger determinant D
for a flat
surface is zero if the distance between points on the surface is the geodesic
distance
which, in general, is not the Euclidean distance.
The proof of this more general result can be verified by following the proof
in
Euclidean geometry in [9] and realizing that the result generalises so long as
there
exists a coordinate system in which the metric tensor has constant
coefficients, which is
an equivalent definition of the flatness of a surface [6].
From this, it can be derived that the Cayley¨Menger determinant D is zero in
2+1
Minkowski space time if the signal reception space-time events lie on a plane.
If the
Minkowski metric is used to calculate the space time interval then 4 may be
positive
or negative depending on the signature of the Minkowski metric.
As the Cayley¨Menger determinant D specified by Eq. (1) only contains terms
that are
cubic in 4 , for errorless measurements:
0 If all pulls Ire on a flat Or
lace.
L)ls1 II oily points do not lic6 on a flat 1.irfac.e..
In 2+1 space time, the light-cone is a two dimensional surface defined by all
the
possible paths of a photon emitted at a particular space-time point. Using the
condition
stated in Eq. (2), the Cayley¨Menger determinant is zero for all space-time
events that
lie on the same light-cone and hence are causally connected to the same
emission event.
Distances, flatness and the Cayley-Menger determinant
Following the definition of the Cayley-Menger determinant D in Eq. (1), it can
be
extended to flat non-Euclidean spaces. Specifically, it can be derived that D
= 0 if all
the points lie on a flat two dimensional surface, such as a cone or a
cylinder. This result
is the specific instantiation of the more general result below.

1
CA 02703369 2010-05-07
8
Theorem 1. If n points 1 1 ........ ,,, lie in an in dimensional flat space
where in
.... _
then the squared distance 4 between any pair of points (.I', = x.; ) can be
expressed as:
1
= .; - .r.11)(.1.,4 --
where g" '1 is an array of constants, '1(4(1) = 0, and M is of size (n + 1) x
(n + 1)
- 0 4, = = = q I-
.,
N7.1 0 ¨ .7,17, 1
= =
. .
";);1 s7. ) ' = I) 1
= = - I 0
- 1 I _.
Proof- Define the matrices A and B of size (n +1) x (in + 2) and (in + 2) x (n
+ 1)
respectively as:
(1`.1=14 2,r111.F7: 1-
[
- = -
21 ................................ -_, = = .
a .,,,, a. (It 9.1, ii: ,77: 1
_
() (-)-
- 1 = = = 1 (I
13 :1,-: , 1, , 1, (- 7 , , , , , ,, ,
r i. ,-- , , t
...g...0 1 -1' 1 - = = gõ3.1- , a' a .
is the m-dimensional basis vector in the (I direction and ritt :I 7--: (7=:.k
' r.i. These
definitions yield
A I = AB.
Now because 1" '- " - - implies A has fewer columns than rows, it is immediate
that
M is singular, with rank at most in ¨ 2.
It follows that the Cayley-Menger determinant D for m+2 points on an in
hypersurface
in tn+1 dimensional space is zero if and only if the metric tensor that
defines the
distances in the hyperspace can be made up of constants.
If the metric tensor is constant then the Riemann curvature tensor is zero by
definition
[19, 20] and is referred to as Riemann flat or just flat. The distance between
two points
is independent of the coordinate system used; hence the Riemann tensor for
Euclidean
space is flat in polar coordinates, even though in these coordinates the
metric tensor is
not constant.
1

CA 02703369 2010-05-07
9
Evaluation of the Cayley¨Menger determinant D using Eq. (1) requires knowledge
of
the geodesic distance between points on the light-cone. Calculation of the
geodesic
distance requires determining the metric tensor for the embedded conical
surface and
integrating the corresponding geodesic equation [6].
This process can be simplified considerably by choosing an appropriate set of
conical
c ==-t
coordinates I (--.1 so
that the metric tensor is diagonal and constant on the surface
of the light-cone 310 in Cartesian coordinates [ct,(x,y)] i n Fig. 3. The
,
coordinates l`c.' 1/- I are the conical coordinates derived in [21] and
describe positions
on the cone. If this can be done then the geodesic distance 320 is the
Euclidean
distance in these coordinates.
One such set of coordinates is given by:
= t= cost (.6 sin III
(3a)
, .
111= t' o sin (3b)
(=IL
(3c)
and the corresponding inverse relations:
= _ c2 ./ 2
¨ + . (4a)
1 lb
= ¨arctan ¨ ).
sin (4b)
= (4c)
where { r = (i= COare the spherical polar coordinates.
The spherical polar coordinates If = fi.`Nare used as an intermediate step to
transition
from Cartesian to conical coordinates, and are related to the 2+1 Cartesian
space-time
coordinates by:
t= = (.v ¨.t.1,12 +1 Vyr,i2 + U ¨
(5a)
; V ¨
= arctani
X ¨ (5b)
t ¨ to
µ, (X ¨A0)- + (y ¨ ' (5c)

CA 02703369 2010-05-07
where time is measured in natural units, i.e., c=1 and [10¨t11' -rti] is the
space-time
coordinate of the emission event. Note that the coordinates defined by
Equations (3-5)
are not the conical coordinates as defined by [10], they have been formulated
so that
the metric tensor on the cone is diagonal and constant.
5
The infinitesimal Euclidean distance between two points in coordinates defined
by Eq.
(2) is:
1 ,
ds2. (4:2+ dili2+ ifr2 ) lire tan ¨ ct
1
I 1,11
+ arctan ¨
= =
¨ 2 raan C 7 cut
10 If we constrain the path between any two points to be on the light-cone so
that
.4-7:: 77: 4 then the geodesic distance between any two points 4'; = siri =
41 and
¨
,$ )
(6)
One aim of signal association algorithms is to provide information so that the
emitter
may be localised. Calculation of the Cayley¨Menger determinant D in Eq. (1)
using
Eq. (6) requires the space-time coordinates of the emission event for
insertion into Eq.
(5) and hence would not appear to be useful.
However, the difficulty is alleviated, or overcome, by noting that in the far-
field limit
the geodesic distance on the light-cone can be approximated by a quantity that
is
obtainable from the measurements, viz. the Euclidean distance, i.e.,
. ,
The far field approximation is valid if the difference between the geodesic
distance on
the light-cone and the Euclidean distance is much less than the Euclidean
distance. It
can be shown that this condition is equivalent to the inter-antenna spatial
distances
being much less than the spatial distance to the emitter, i.e.,

CA 02703369 2010-05-07
11
\ (r¨)- 0.\ ¨ x,i- (y, ¨
as in a radar application.
Hypothesis Test in a Noisy Environment
In practical scenarios, the measured signal time of arrival is generally
noisy. This
means that the value of D from Eq. (1) and computed using actual measurements
will
not be zero, even if all the points lie on a flat surface.
To calculate the expected value of Cayley¨Menger determinant D in the presence
of
noise, a noise term E: is added to each of the signal reception events. The
square
distance is then calculated as a function of the noiseless distances and the
noise. These
distances are then substituted into Eq. (1) to obtain an expression for the
Cayley¨
Menger determinant D in terms of the noiseless space-time distances and 6, .
This rather complex procedure can be avoided and the effect of noise on Eq.
(1) can be
approximated by a rather simple expression once it is realized the
Cayley¨Menger
,
determinant D contains only terms of the type and hence, to
lowest order, the
4
-
effect of noise can be approximated by 0?"-;, where 'S --hT is the maximum
square
(r-
interval between events and r is the variance in the time of arrival noise.
Using this result, it is possible to construct a hypothesis test:
: All receive events are caused by the same emission event.
The decision rule we use to test between the hypothesis is:
talc 1( I 96 4
H,=
t:il Ii /) 2: I 96,r,12,4
(7)
The factors 2 and 1.96 come from the fact that the time difference variance is
twice the
time of arrival variance and that 95% of time of arrival measurements lie
between
¨96(r
¨ of the noiseless time of arrival.
Algorithm
Referring to Fig. 2 again, the signal processor 130 performs the following
steps for
deinterleaving the signal reception events recorded in Table 2.

CA 02703369 2010-05-07
12
(a) The signal processor 130 first selects a subset of four signal
reception events are
selected; see step 220 in Fig. 2. There are 34 combinations in which the
signal
reception events can be grouped into quartets, and the bearing lines 430
associated with
the 81 combinations in total are shown in Fig. 4. The x-axis 410 and y-axis
420 of the
chart each represent distance in metres.
For example, in the first iteration, the following signal reception space-time
events are
selected: '
m1 = [13.3777, 3, 0], which is detected at receiver 122;
m2 = [10.7780, 0, 3], which is detected at receiver 124;
m3 = [24.6170, -3, 01, which is detected at receiver 126; and
ma = [27.3223, 0, -3], which is detected at receiver 128.
(b) As shown in step 230 in Fig. 2, the signal processor 130 then
calculates the
Euclidean space-time distances s,2.1 between one signal reception event with
the other
three signal reception events in the selected subset according to Eq. (6) for
i = 1 , , 4,j
= 1, ..., 4 and i j
For example, 4, is a function of m1 and m4 and s is a function of m2 and m3
Distances si2õ s2, 4, and 4, are not calculated because they are set to zero
according
to Eq. (1).
(c) Based on the calculated Euclidean distances4 , the signal processor 130
then
calculates the Cayley¨Menger determinant D using Eq. (1); see step 240 in Fig.
2.
(d) The signal processor 130 then determines whether the calculated
determinant D
satisfies a predetermined condition in the form of hypothesis test H,1
according to Eq.
(7); see step 250 in Fig. 2.
(e) If HI is true, the signal processor 130 associates the four signal
reception
events selected in step (a) with the same emission of an emitter; see step
260. For
example, this involves recording the mapping between the four signal reception
events
and the emission event in a data store accessible by the signal processor 130.

CA 02703369 2010-05-07
13
(f) The signal processor 130 then determines whether there is at least one
more
combination of four signal reception events mi to m4 to be considered; see
step 270.
The same determination is performed if H is false.
(g) When all combinations of four signal reception events are exhausted,
the signal
processor 130 determines the number of emission events, which is the number of
subsets of four signal reception events that satisfy the hypothesis test 111.
Results
In the example given in Table 2, the receiver clock noise is set to 50
picoseconds, and
the threshold condition for the Cayley-Menger determinant D in step 250 is
therefore
9.3312 square metres.
Using the algorithm 200 in Fig. 2, the signal processor 130 is able to
conclude that
there are only two valid subsets of signal reception events that satisfy the
condition.
This means that there are two emission events each having the following signal
reception events:
Signal reception events corresponding to Emission Event 1:
m1 = [13.3777, 3, 0] T,m2= [10.7780, 0, 3] T,
M3= [24.6170, -3, 0] T and m4 = [27.3223, 0, -31
Signal reception events corresponding to Emission Event 2:
= [26.4210, 3, 0] T ,12= [18.1737, 0, 3] T,
13= [6.8247, -3, 0] Tand 14 = [14.9967, 0, -3] T.
Since each emission event is associated with an emitter 110, 112, the location
of the
emitters can be estimated using Time Difference of Arrival (TDOA) or Range
Difference of Arrival (RDOA) techniques in [11], which is herein incorporated
by
reference.
Using these techniques, the locations of the emitters 110, 112 are calculated
and
represented in Fig. 5.
Location of Emitter I (indicated at 530)
X = 2813,

CA 02703369 2010-05-07
14
Y = 4134,
Bearing = 55.7665.
Location of Emitter 2 (indicated at 540)
X = -4934,
Y = -807,
Bearing = -170.711.
The x (520) and y (510) axes in Fig. 5 each represent distance in metres. The
numbers
indicate that the emitters are each located 5 km from location of the antenna
array 550.
It is noted that the size of the subset of signal reception events selected in
step (a) is
d+2, where d is the dimension of the space component in the space-time
coordinates of
the events. In the example above, four reception events are selected when 2+1
space-
time coordinates are used. For 3+1 space-time coordinates, five reception
events are
selected.
It is also noted that the arrival times given in Table 1 are generated by
adding zero
mean Gaussian noise with 50 picoseconds standard deviation to the arrival time
of
signals generated by two emitters located 5 km from the centre of the antenna
array,
which is the same as calculated above. The third set of arrival times was
generated by
a random number generator and could represent spurious measurements.
The described method is applicable in various fields. For example, defence-
related
applications require the knowledge of the number of electromagnetic emitters
and
where they are. To be able to determine the number and location, it is
necessary to find
out whether signals received at different points and different times come from
the same
emitter or different ones. Further, the method is applicable to any type of
signal
reception events, such as radar pulses in defence-related applications.
System
One example of how the system for deinterleaving signals is implemented is
shown in
Fig. 6. The components of the exemplary system are as follows.
1. Cavity Backed Wideband Spiral Antennas 610

CA 02703369 2010-05-07
Cavity backed wideband spiral antennas 610 are used to receive incident radio
frequency (RF) energy from the Emitter 110 112. Each antenna 610 has a
wideband
frequency response from 2-18 GHz to maximize probability of intercepting the
signals.
Spiral antennas are used to allow reception of both vertical and horizontally
polarised
5 signals.
2. Tunable Bandpass Yttrium Iron Garnet (YIG) filter 615
The signals received by the antennas 610 are passed through a tunable bandpass
YIG
filter to select sign als within a 40MHz bandwidth of the 2-18 GHz range.
Bandpass
10 filtering reduces the amount of noise in subsequent stages and eliminates
unwanted
signals.
3. Pre-Amplified Microwave Detector 620
The pre-amplifier amplifies weak signals from the emitter than have passed
from the
15 filter 615 and delivers the amplified signals to the detector. The detector
610 extracts
modulation from the signals to convert the signals to a baseband or low
amplitude
video signal 625.
4. Video Amplifier 630
The video amplifier 630 amplifies often weak signal from the pre-amplified
microwave
detector 620 to a level suitable for further processing in the subsequent
stage. The base
level and polarity of the video signal may also be modified at this stage. The
output
signals 635 of the amplifier 630 are Low Voltage Transistor-Transistor Logic
(LVTTL)
compatible.
5. TDC Integrated Circuit 640
The four signals 635 from the video amplifiers 630 are inputted to a Time-to-
Digital
Converter (TDC) 640 to measure time difference of the signals. One suitable
TDC is
the TDC-GPX integrated circuit developed by ACAM Messelectronic GMBH of
Germany (www.acam.de) that is operable to provide time difference measurement
at 81
ps resolution.
6. Interface Processor 650
The first processor 650 interfaces with the ACAM TDC-GPX integrated circuit to
extract time difference measurements and send them to a second Processor 670
via a
communications link 660, which may be an Ethernet.

CA 02703369 2010-05-07
16
7. Signal Processor 670
The signal processor 670 receives the time difference measurements from the
Interface
Processor 650 to perform the algorithm in steps Fig. 2.
Error Calculations
In one embodiment, a source of error occurs when the emitter is not in the
same plane
as the receivers. The maximum effect of this error in calculating the Cayley-
Menger
determinant is explained as follows.
We first determine the difference between squared geodesic distances and
sy2,
where ¨ is used to denote that the emitter lies in the same plane as the
receivers and the
absence of a ¨ means that the emitter is z metres above the plane. The
measured time
of arrival (in natural units where c = 1) for an emitter above the plane is:
= 1., -I- viLri ¨ .1%1)2 + (8)
= e=I + ¨ =rti))! I
(9)
1
iõ (,/,, ¨ .
¨ (10)
; 1
= .
' "
\ (xi ¨ -ru (11)
The approximation in (10) is valid if and only if ':12 (xi ¨ Xqi2,
viz the height
above the plane is much less than the distance from the emitter to the
receivers. In
practice, this condition is generally met if ; 1
The measured time difference of arrival is:
1
¨ J. ¨ )2 ) (12)
That is to say the effect of the emitter being a distance z from the plane of
the
receivers causes an error (v ?.;) in the measured time difference of arrival
of:

CA 02703369 2010-05-07
17
1 1
¨
¨ \.; (.I.: ¨
(13)
The location of the receiver j can be expressed in terms of the receiver i by:
.1.J
(14)
It follows that:
(=/',; ¨ = - =I'1))2 2A.i. = (.r1 - .r1,)
- + 2A.r = (,r; ¨ .rõ
(15)
This approximation is valid if the receiver spacing is much less than the
distance from
the receivers to the emitters, this is normally the case is the required "far
field" emitter
receiver geometry for this application.
Using the approximation given in (15), it follows that:
1 1
v`1=1!,.i =ri,12 .r,02 2.1.r = i.r, .r.11 (16)
1 1
¨ .p1:2
(17)
A.r = ¨
1
\-; =I'lli2 (4'; - ) (18)
Substituting (18) into (13), the maximum time of arrival error caused by the
emitter
being off the plane is:
111,JI
(19)
To reduce the effect of the off-plane error the error should be much less
than
the receiver spacing, i.e. .This condition can be satisfied if:
z 2
(20)
In applications where the emitter lies on a plane located z metres above or
below a
plane on which the receivers lie, the effect of the approximation error is
reduced if the
height of the emitter is significantly less than the mean distance between the
emitter

CA 02703369 2010-05-07
18
and the receivers. In practice, this condition is generally satisfied when z
is less than
about one tenth of the distance from the emitter to the receivers.
It will be appreciated that while the light-cone is Lorentz invariant and
hence at least
one embodiment of this algorithm is independent of the velocity of the
receivers and
emitters, it can be generalised to non electromagnetic signals such as sonar
and seismic
waves as long as some assumption can be made about the velocity of the sensors
relative to the emitter. In this case c2 term in the calculation of the space-
time interval is
replaced by v2 where v is the speed of the signal relative to the receivers.
Variations and Possible Modifications
It will be appreciated by persons skilled in the art that numerous variations
and/or
modifications may be made to the invention as shown in the specific
embodiments
without departing from the scope of the invention as broadly described. The
present
embodiments are, therefore, to be considered in all respects as illustrative
and not
restrictive.
While radar pulses have been used as an example, it is important to realize
that the
proposed algorithm is valid for associating any signal reception events that
lie on the
same light-cone. Furthermore although the following treatment assumes four
receivers
in 2+1 space time it can be extended trivially to five receivers in 3+1 space
time. The
method disclosed may also be adapted for sonar and seismic waves.
It is also noted that different antenna placements may improve the performance
of the
algorithm in Fig. 2. A fifth antenna element may be added on a different plane
as the
other elements in 3+1 space time. Once again, optimal placement of this fifth
antenna
may improve the performance of the signal processor. A sixth element may be
used to
measure the background noise and hence be used as a calibration tool.
The algorithm in Fig. 2 may also be extended to include ducting, that is
slightly varying
light speed and non-linear path for the signals.
It should also be understood that, unless specifically stated otherwise as
apparent from
the following discussion, it is appreciated that throughout the description,
discussions
utilizing terms such as "receiving", "processing", "retrieving", "selecting",
"calculating", "determining", "displaying", "associating" or the like, refer
to the action
and processes of a computer system, or similar electronic computing device,
that

CA 02703369 2010-05-07
19
processes and transforms data represented as physical (electronic) quantities
within the
computer system's registers and memories into other data similarly represented
as
physical quantities within the computer system memories or registers or other
such
information storage, transmission or display devices. Unless the context
clearly
requires otherwise, words using singular or plural number also include the
plural or
singular number respectively.
It should also be understood that the techniques described might be
implemented using
a variety of technologies. For example, the methods described herein may be
implemented by a series of computer executable instructions residing on a
suitable
computer readable medium. Suitable computer readable media may include
volatile
(e.g. RAM) and/or non-volatile (e.g. ROM, disk) memory, carrier waves and
transmission media (e.g. copper wire, coaxial cable, fibre optic media,
specialised
hardware). Exemplary carrier waves may take the form of electrical signals,
electromagnetic signals, optical signals, sonic or sonar waves conveying
digital data
steams along a local network or a publically accessible network such as the
Internet.
References
[1] T. Conroy and J. B. Moore, "The limits of extended Kalman filtering for
pulse
train deinterleaving," Signal Processing, IEEE Transactions on, vol. 46, pp.
3326-3332, 1998.
[2] A. Logothetis and V. Krishnamurthy, "An interval-amplitude algorithm
for
deinterleaving stochastic pulse train sources," Signal Processing, IEEE
Transactions on, vol. 46, pp. 1344-1350, 1998.
[3] D. J. Milojevic and B. M. Popovic, "Improved algorithm for the
deinterleaving
of radar pulses," Radar and Signal Processing, IEE Proceedings F, vol. 139,
pp. 98-104, 1992.
[4] J. B. Moore and V. Krishnamurthy, "Deinterleaving pulse trains using
discrete-
time stochastic dynamic-linear models," Signal Processing, IEEE Transactions
on, vol. 42, pp. 3092-3103, 1994.
[5] V. Chandra and R. C. Bajpai, "ESM data processing parametric
deinterleaving
approach," in TENCON '92. "Technology Enabling Tomorrow : Computers,
Communications and Automation towards the 21st Century.' 1992 IEEE Region
10 International Conference., 1992, pp. 26-30 vol.l.
[6] H. E. A. B. Hassan, F. Chan, and Y. T. Chan, "Queueing analysis of the
deinterleaving of radar pulses in a dense emitter environment," in Electrical
and

CA 02703369 2010-05-07
Computer Engineering, 2003. IEEE CCECE 2003. Canadian Conference on,
2003, pp. 2015-2020 vol.3.
[7] H. E. A. B. Hassan, F. Chan, and Y. T. Chan, "Joint
deinterleaving/recognition
of radar pulses," in Electrical and Computer Engineering, 2003. IEEE CCECE
5 2003. Canadian Conference on, 2003, pp. 2009-2014 vol.3.
[8] J. Wang, P. Lei, D. Yang, W. Li, and X. Yan, "A novel deinterleaving
algorithm
of radar pulse signal based on DSP," in Industrial Electronics, 2009. ISIE
2009.
IEEE International Symposium on, 2009, pp. 1899-1903.
[9] P. Yunwei, G. Zhilin, J. Weidong, and H. Laizhao, "A DOA-Based
Separability
10 Test and Confidence Evaluation Approach for Deinterleaving Pulse
Sequence,"
in Computational Intelligence and Industrial Application, 2008. PACHA '08.
Pacific-Asia Workshop on, 2008, pp. 954-957.
[10] W. T. L. C. 0. Horn and S. F. P. C. 0. Hurt, "Method and system for
deinterleaving," US, 2006.
15 [11] P. C. R. N. J. Wang, M. H. N. Y. Orr, M. W. N. J. Sparrow, and M. W.
N. J.
Apa, "System and method for detecting and de-interleaving radar emitters,"
US, 2008.
[12] F. J. Berle, "Mixed triangulation/trilateration technique for emitter
location,"
Communications, Radar and Signal Processing, IEE Proceedings F, vol. 133,
20 pp. 638-641, 1986.
[13] A. N. Bishop and P. N. Pathirana, "Localization of Emitters via the
Intersection
of Bearing Lines: A Ghost Elimination Approach," Vehicular Technology,
IEEE Transactions on, vol. 56, pp. 3106-3110, 2007.
[14] H. W. L. Naus and C. V. van Wijk, "Simultaneous localisation of multiple
emitters," Radar, Sonar and Navigation, IEE Proceedings -, vol. 151, pp. 65-
70, 2004.
[15] L. M. Blumenthal, Applications of Distance Geometry. Oxford: Oxford
University Press, 1953.
[16] "http://www.acam.de/fileadmin/Download/pdf/Endish/DB AMGPX e.pdf',
"ATMD-GPX TDC-GPX Evaluation System: Datasheet," acam mess
electronic, 2005.
[17] G. E. James, "The Application of Time to Digital Converters to ESM
Systems,"
in 1st EMRS DTC Technical Conference Edinburgh, 2004, p. A15.
[18] G. E. James, "The Practical Implementation of DF Systems Using Time-to-
Digital Converters," in 2nd EMRS DTC Technical Conference, Edinburgh,
2005, p. A8.
[19] C. W. Misner, K. S. Thome, and J. A. Wheeler, Gravitation: W. H. Freeman
and
Company, 1973.
[20] S. Weinberg, Gravitation and cosmology: principles and applications of
the
general theory of relativity. New York: Wiley, 1972.

CA 02703369 2010-05-07
21
[21] S. P. Drake, B. D. 0. Anderson, and C. Yu, "Causal association of
electromagnetic signals using the Cayley--Menger determinant," Applied
Physics Letters, vol. 95, pp. 034106-3, 2009.

Dessin représentatif
Une figure unique qui représente un dessin illustrant l'invention.
États administratifs

2024-08-01 : Dans le cadre de la transition vers les Brevets de nouvelle génération (BNG), la base de données sur les brevets canadiens (BDBC) contient désormais un Historique d'événement plus détaillé, qui reproduit le Journal des événements de notre nouvelle solution interne.

Veuillez noter que les événements débutant par « Inactive : » se réfèrent à des événements qui ne sont plus utilisés dans notre nouvelle solution interne.

Pour une meilleure compréhension de l'état de la demande ou brevet qui figure sur cette page, la rubrique Mise en garde , et les descriptions de Brevet , Historique d'événement , Taxes périodiques et Historique des paiements devraient être consultées.

Historique d'événement

Description Date
Le délai pour l'annulation est expiré 2022-11-08
Lettre envoyée 2022-05-09
Lettre envoyée 2021-11-08
Lettre envoyée 2021-05-07
Inactive : COVID 19 - Délai prolongé 2020-04-28
Représentant commun nommé 2019-10-30
Représentant commun nommé 2019-10-30
Requête pour le changement d'adresse ou de mode de correspondance reçue 2018-12-04
Accordé par délivrance 2017-07-11
Inactive : Page couverture publiée 2017-07-10
Préoctroi 2017-05-25
Inactive : Taxe finale reçue 2017-05-25
Un avis d'acceptation est envoyé 2017-04-13
Lettre envoyée 2017-04-13
month 2017-04-13
Un avis d'acceptation est envoyé 2017-04-13
Inactive : Approuvée aux fins d'acceptation (AFA) 2017-04-03
Inactive : Q2 réussi 2017-04-03
Modification reçue - modification volontaire 2017-02-24
Inactive : Dem. de l'examinateur par.30(2) Règles 2016-08-31
Inactive : Rapport - Aucun CQ 2016-07-29
Lettre envoyée 2015-04-29
Exigences pour une requête d'examen - jugée conforme 2015-04-14
Requête d'examen reçue 2015-04-14
Toutes les exigences pour l'examen - jugée conforme 2015-04-14
Requête visant le maintien en état reçue 2015-04-08
Requête visant le maintien en état reçue 2014-04-09
Requête visant le maintien en état reçue 2013-04-16
Demande publiée (accessible au public) 2011-10-28
Inactive : Page couverture publiée 2011-10-27
Inactive : CIB attribuée 2010-12-30
Inactive : CIB en 1re position 2010-12-30
Inactive : CIB attribuée 2010-12-30
Inactive : Lettre officielle 2010-12-02
Inactive : Correspondance - Transfert 2010-09-13
Demande de priorité reçue 2010-09-07
Lettre envoyée 2010-08-12
Lettre envoyée 2010-08-12
Inactive : Lettre officielle 2010-08-12
Inactive : Correspondance - TME 2010-08-10
Inactive : Correspondance - Formalités 2010-07-15
Inactive : Transfert individuel 2010-07-15
Demande de correction du demandeur reçue 2010-06-11
Inactive : Déclaration des droits - Formalités 2010-06-11
Inactive : Certificat de dépôt - Sans RE (Anglais) 2010-06-10
Demande reçue - nationale ordinaire 2010-06-09

Historique d'abandonnement

Il n'y a pas d'historique d'abandonnement

Taxes périodiques

Le dernier paiement a été reçu le 2017-02-24

Avis : Si le paiement en totalité n'a pas été reçu au plus tard à la date indiquée, une taxe supplémentaire peut être imposée, soit une des taxes suivantes :

  • taxe de rétablissement ;
  • taxe pour paiement en souffrance ; ou
  • taxe additionnelle pour le renversement d'une péremption réputée.

Les taxes sur les brevets sont ajustées au 1er janvier de chaque année. Les montants ci-dessus sont les montants actuels s'ils sont reçus au plus tard le 31 décembre de l'année en cours.
Veuillez vous référer à la page web des taxes sur les brevets de l'OPIC pour voir tous les montants actuels des taxes.

Historique des taxes

Type de taxes Anniversaire Échéance Date payée
Taxe pour le dépôt - générale 2010-05-07
Enregistrement d'un document 2010-07-15
TM (demande, 2e anniv.) - générale 02 2012-05-07 2012-03-08
TM (demande, 3e anniv.) - générale 03 2013-05-07 2013-04-16
TM (demande, 4e anniv.) - générale 04 2014-05-07 2014-04-09
TM (demande, 5e anniv.) - générale 05 2015-05-07 2015-04-08
Requête d'examen - générale 2015-04-14
TM (demande, 6e anniv.) - générale 06 2016-05-09 2016-03-16
TM (demande, 7e anniv.) - générale 07 2017-05-08 2017-02-24
Taxe finale - générale 2017-05-25
TM (brevet, 8e anniv.) - générale 2018-05-07 2018-04-16
TM (brevet, 9e anniv.) - générale 2019-05-07 2019-04-09
TM (brevet, 10e anniv.) - générale 2020-05-07 2020-05-04
Titulaires au dossier

Les titulaires actuels et antérieures au dossier sont affichés en ordre alphabétique.

Titulaires actuels au dossier
NATIONAL ICT AUSTRALIA LIMITED
THE COMMONWEALTH OF AUSTRALIA, OF THE SECRETARY, DEPARTMENT OF DEFENCE
Titulaires antérieures au dossier
BRIAN ANDERSON
CHANGBIN YU
SAMUEL PICTON DRAKE
Les propriétaires antérieurs qui ne figurent pas dans la liste des « Propriétaires au dossier » apparaîtront dans d'autres documents au dossier.
Documents

Pour visionner les fichiers sélectionnés, entrer le code reCAPTCHA :



Pour visualiser une image, cliquer sur un lien dans la colonne description du document (Temporairement non-disponible). Pour télécharger l'image (les images), cliquer l'une ou plusieurs cases à cocher dans la première colonne et ensuite cliquer sur le bouton "Télécharger sélection en format PDF (archive Zip)" ou le bouton "Télécharger sélection (en un fichier PDF fusionné)".

Liste des documents de brevet publiés et non publiés sur la BDBC .

Si vous avez des difficultés à accéder au contenu, veuillez communiquer avec le Centre de services à la clientèle au 1-866-997-1936, ou envoyer un courriel au Centre de service à la clientèle de l'OPIC.


Description du
Document 
Date
(yyyy-mm-dd) 
Nombre de pages   Taille de l'image (Ko) 
Dessin représentatif 2017-06-08 1 8
Page couverture 2017-06-08 2 45
Description 2010-05-06 21 768
Abrégé 2010-05-06 1 18
Revendications 2010-05-06 2 82
Dessins 2010-05-06 6 85
Dessin représentatif 2011-10-02 1 7
Page couverture 2011-10-12 2 45
Description 2017-02-23 22 770
Dessins 2017-02-23 6 89
Revendications 2017-02-23 2 95
Certificat de dépôt (anglais) 2010-06-09 1 167
Courtoisie - Certificat d'enregistrement (document(s) connexe(s)) 2010-08-11 1 102
Courtoisie - Certificat d'enregistrement (document(s) connexe(s)) 2010-08-11 1 103
Rappel de taxe de maintien due 2012-01-09 1 113
Rappel - requête d'examen 2015-01-07 1 118
Accusé de réception de la requête d'examen 2015-04-28 1 174
Avis du commissaire - Demande jugée acceptable 2017-04-12 1 162
Avis du commissaire - Non-paiement de la taxe pour le maintien en état des droits conférés par un brevet 2021-06-17 1 558
Courtoisie - Brevet réputé périmé 2021-11-28 1 549
Avis du commissaire - Non-paiement de la taxe pour le maintien en état des droits conférés par un brevet 2022-06-19 1 543
Correspondance 2010-06-10 5 150
Correspondance 2010-07-14 2 66
Correspondance 2010-08-11 1 15
Correspondance 2010-08-09 1 46
Correspondance 2010-09-06 3 73
Correspondance 2010-12-01 1 22
Correspondance 2010-08-11 1 25
Correspondance 2012-01-09 1 46
Taxes 2012-03-07 1 54
Taxes 2013-04-15 1 55
Taxes 2014-04-08 1 55
Taxes 2015-04-07 1 57
Demande de l'examinateur 2016-08-30 3 171
Modification / réponse à un rapport 2017-02-23 18 611
Taxe finale 2017-05-24 2 59