Sélection de la langue

Search

Sommaire du brevet 2234493 

É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 2234493
(54) Titre français: ARCHITECTURE D'AUTOMATE FINI AVEC MEMOIRE A LIBRE ACCES MULTIPLEX
(54) Titre anglais: STATE MACHINE ARCHITECTURE WITH MULTIPLEXED RANDOM ACCESS MEMORY
Statut: Périmé et au-delà du délai pour l’annulation
Données bibliographiques
Abrégés

Abrégé français

Pluralité de flux de données multiplexés dans le temps qui sont fusionnés en un seul flux de données contenant une pluralité de mots de données et qui sont caractérisés par des vecteurs d'état, traités de manière concurrentielle. Les vecteurs d'état sont stockés dans une mémoire de lecture et d'écriture ayant une pluralité d'emplacements de mémoire adressables. Pendant un cycle d'horloge initial, un pipeline reçoit un mot de données d'entrée de l'un des flux de données, un vecteur d'état caractérisant le flux de données, et l'adresse d'emplacement de mémoire du vecteur d'état d'entrée. Pendant un ou plusieurs cycles d'horloge intermédiaires, le pipeline traite le mot de données d'entrée et le vecteur d'état d'entrée pour donner un mot de données de sortie et un vecteur d'état de sortie. Pendant un cycle d'horloge final, le pipeline transfère le mot de données de sortie vers un flux de données sortant, et transfère le vecteur d'état de sortie dans l'adresse d'emplacement de mémoire précitée. Une unité de commande couplée à la mémoire et au pipeline synchronise leur fonctionnement. Un générateur de cycle zéro couplé au pipeline et à l'unité de commande insère des cycles zéro dans les flux de données traités de manière concurrentielle à intervalles de temps réguliers et sort un signal ZERO à l'unité de commande pendant chaque cycle zéro. Un multiplexeur couplé entre l'unité de commande et la mémoire multiplexe l'accès à la mémoire entre l'unité de commande/le pipeline, et une unité de commande alternée. L'accès en lecture à la mémoire par l'unité de commande ou le pipeline est empêché pendant que le signal ZERO est sorti, et l'accès en écriture à la mémoire par le pipeline est empêché pendant qu'une réplique ZERO SORTANT du signal ZERO est sortie par le pipeline pendant le cycle d'horloge final. En conséquence, l'unité de commande alternée peut obtenir l'accès à la mémoire pendant que le signal ZERO est sorti, et peut obtenir l'accès à la mémoire pendant le signal ZERO SORTANT est sortie.


Abrégé anglais

A plurality of time-division multiplexed data streams which are merged into a single data stream containing a plurality of data words and which are characterized by state vectors, are concurrently processed. The state vectors are stored in a read-write memory having a plurality of addressable memory locations. During an initial clock cycle, a pipeline receives an input data word from one of the data streams, an input state vector characterizing that data stream, and the memory location address of the input state vector. During one or more intermediate clock cycles, the pipeline processes the input data word and the input state vector to yield an output data word and an output state vector. During a final clock cycle, the pipeline transfers the output data word to an outgoing data stream, and transfers the output state vector into the aforementioned memory location address. A controller coupled to the memory and to the pipeline synchronizes operation thereof. A null cycle generator coupled to the pipeline and to the controller inserts null cycles into the concurrently processed data streams at regular time intervals and outputs a NULL signal to the controller during each null cycle. A multiplexer coupled between the controller and the memory multiplexes access to the memory between the controller/pipeline, and an alternate controller. Read access to the memory by the controller or pipeline is inhibited while the NULL signal is output, and write access to the memory by the pipeline is inhibited while an OUTGOING NULL replica of the NULL signal is being output by the pipeline during the final clock cycle. Accordingly, the alternate controller may gain read access to the memory while the NULL signal is output, and may gain write access to the memory while the OUTGOING NULL signal is output.

Revendications

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


-10-
WHAT IS CLAIMED IS:
1. Apparatus for concurrently processing a plurality of time-division
multiplexed data streams merged into a single data stream contain-
ing a plurality of data words and characterized by state vectors,
said apparatus comprising:
(a) read-write memory means having a plurality of addressable
memory locations for storing said state vectors;
(b) a pipeline for:
(i) during an initial clock cycle:
(1) receiving an input data word from one of said
data streams;
(2) receiving, from a predefined memory location
address in said memory means, an input state
vector characterizing said one data stream;
(3) receiving said predefined memory location
address of said input state vector;
(ii) during one or more intermediate clock cycles, pro-
cessing said input data word and said input state
vector to yield an output data word and an output state
vector;
(iii) during a final clock cycle:
(1) transferring said output data word to an outgo-
ing data stream;
(2) transferring said output state vector to said
predefined memory location address in said
memory means;

-11-
(c) control means coupled to said memory means and to said
pipeline for synchronizing operation thereof;
(d) a null cycle generator coupled to said pipeline and to said
control means, said null cycle generator for inserting null
cycles into said concurrently processed data streams at
regular time intervals and for outputting a NULL signal to
said control means during each of said null cycles; and,
(e) multiplexer means coupled between said control means and
said read-write memory means for multiplexing access to
said read-write memory means between:
(i) said control means and said pipeline; and,
(ii) an alternate control means;
wherein said control means inhibits read access to said read-write
memory means by said control means and by said pipeline during
output of said NULL signal and inhibits write access to said read-
write memory means by said pipeline during output of an OUTGO-
ING NULL replica of said NULL signal by said pipeline during
said final clock cycle, thereby enabling read access to said read-
write memory means by said alternate control means during output
of said NULL signal and enabling write access to said read-write
memory means by said alternate control means during output of
said OUTGOING NULL signal.
2. Apparatus as defined in Claim 1, wherein said pipeline further
comprises first delay means, second delay means, and state
machine logic means, wherein:
(a) said first delay means is for:

-12-
(i) delayed storage and output to said state machine logic
means of said input data word and said input state
vector;
(ii) delayed storage and output to said second delay means
of said predefined memory location address;
(iii) delayed storage and output to said second delay means
of said NULL signal;
(b) said state machine logic means performs said processing
during said one or more intermediate clock cycles;
(c) said second delay means is for:
(i) delayed storage and output to said memory means of
said output state vector and said predefined memory
location address;
(ii) delayed storage and output of said output data word;
and,
(iii) delayed storage of said NULL signal and output
thereof to said control means as said OUTGOING
NULL signal.
3 . Apparatus as defined in Claim 1, wherein:
(a) said control means further comprises a clock having a
selected clock cycle; and,
(b) said pipeline has a delay characteristic equal to one of said
clock cycles.
4. Apparatus as defined in Claim 1, wherein said memory means is
a random access memory.

-13-
5. Apparatus as defined in Claim 1, wherein:
(a) said control means further comprises a clock having a
selected clock cycle; and,
(b) said pipeline has a delay characteristic equal to a selected
multiple of said clock cycles.
6. Apparatus as defined in Claim 4, said random access memory
further comprising a read address port, a write address port, a read
data port and a write data port, said multiplexer means further
comprising:
(a) a first multiplexer for multiplexing access to said read
address port between said control means and said alternate
control means;
(b) a second multiplexer for multiplexing access to said write
address port between said pipeline and said alternate control
means; and,
(c) a third multiplexer for multiplexing access to said write data
port between said pipeline and said alternate control means.
7. Apparatus as defined in Claim 4, wherein said random access
memory has a port configuration in which:
(a) said read and write address ports are combined to form a
single address port; and,
(b) said read and write data ports are combined to form a single
data port.

-14-
8. A method of concurrently processing a plurality of data streams
time-division multiplexed into a single stream wherein state vectors
characteristic of said single stream are stored in read-write memory
locations having predefined addresses, said method comprising the
steps of:
(a) inserting null cycles into said single stream at regular time
intervals;
(b) outputting a NULL signal during each of said null cycles;
(c) pipeline processing said NULL signal through a plurality of
clock cycles to output an OUTGOING NULL replica of said
NULL signal;
(d) inhibiting reading of said state vectors from said read-write
memory locations during said outputting of said NULL signal;
and,
(e) inhibiting writing of said state vectors to said read-write
memory locations during said outputting of said OUTGOING
NULL signal.
9. A method as defined in Claim 8, further comprising multiplexing
access to said read-write memory locations between first and second
control means.
10. A method as defined in Claim 9, wherein said multiplexing access
step further comprises:
(a) multiplexing read access to said read-write memory locations
between said first and second control means;
(b) multiplexing address write access to said read-write memory
locations between said first and second control means; and,
(c) multiplexing data write access to said read-write memory
locations between said first and second control means.

-15-
11. A method as defined in Claim 8, wherein said inhibiting steps
further comprise inhibiting said reading of said state vectors from
and said writing of said state vectors to said read-write memory
locations by a first controller to enable said reading of said state
vectors from and said writing of said state vectors to said read-write
memory locations by a second controller.

Description

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


CA 02234493 1998-04-09
STATE MACHINE ARCHITECTURE WITH
MULTIPLEXED RANDOM ACCESS MEMORY
Technical Field
This invention is directed to an improved pipelined, time-
sliced state machine architecture for processing time-division multiplexed
data streams in a manner which facilitates concurrent access to state
vectors stored in a random access memory ("RAM ") by state machine
logic and by separate controller circuitry.
Back rg ound
United States Patent No. 5,640,398 "State Machine Architec-
ture for Concurrent Processing of Multiplexed Data Streams" (hereafter
"the '398 patent") describes the architecture shown in Figure 1, in which
a pipelined state machine coupled to a state vector stored in a random
access memory ("RAM ") enables concurrent processing of a number of
data channels. The '398 patent makes no mention of how data in RAM
12 is to be initialised at system start up, or updated by a control
processor. Typically, the RAM entry pertaining to a particular channel
includes data such as option selection codes which determine how the
state machine is to process that channel's data stream. Such data may
need to be updated or observed by a control processor from time to time.
A simple method of providing control processor access to
RAM 12 is to provide an additional data port on RAM 12. For example,
if the state machine uses separate read and write ports to access RAM 12,
then a triple-port RAM may be used instead of a dual-port RAM, with
the third port being reserved for control processor access. However, this
method suffers from the disadvantage that mufti-port memories are more

CA 02234493 1998-04-09
-2-
complex and expensive due to the requirement to replicate address decode
circuitry and re-design the memory bit cells .
A second method is to multiplex access to RAM 12's write
port between the state machine and the control processor. When the
control processor wishes to update the RAM entry corresponding to a
particular channel, a multiplexes examines the stream of write addresses
being generated by state machine pipeline 18 and, when the required
address is present at RAM 12's write port, substitutes the data supplied
by the control processor for the state machine's write data. However,
this method is feasible only if Timing Generator and Control block 10 is
able to generate all possible RAM addresses within a reasonable time, so
that the multiplexes is not forced to wait indefinitely for an address
match. In certain systems (for example, if channels are permitted to have
widely differing data rates, or if channels may be disabled for extended
periods), it may not be possible to satisfy this condition. The '398 patent
describes the operation of the state machine in a SONET application in
which Timing Generator and Control block 10 tracks SONET time slots
and cycles through all RAM addresses periodically, thereby satisfying the
foregoing condition.
The present invention improves upon the architecture of the
'398 patent in a manner which facilitates timely control processor or
other hardware access to RAM 12 without requiring an additional RAM
port; and, which can be used in situations in which Timing Generator and
Control block 10 is unable to generate every RAM address within a
predeterminable time frame. The invention also facilitates control
processor access to any state machine RAM location, even if that location
is not within the address space of Timing Generator and Control block

CA 02234493 1998-04-09
-3-
10. In prior art SONET applications, state machine RAMs are indexed
by SONET time slot, with Timing Generator and Control block 10
cycling through all RAM addresses. However, in Internet PPP applica-
tions in which data is transported in HDLC format over channelised T1
or E1 links, state machine RAMs are indexed by HDLG channel, and it
is possible for a single channel to be mapped to one or more time slots
of a TDM link. Accordingly, in a HDLG application, it may be
necessary to initialise a channel's RAM entry before that entry is mapped
to a time slot. If a channel is unmapped, Timing Generator and Control
block 10 will not generate the RAM address for that channel's entry, if
configured in accordance with the '398 patent.
SummarX of Invention
The invention facilitates concurrent processing of a plurality
of time-division multiplexed data streams which are merged into a single
data stream containing a plurality of data words and which are charac-
terized by state vectors. The state vectors are stored in a read-write
memory having a plurality of addressable memory locations. During an
initial clock cycle, a pipeline receives an input data word from one of the
data streams, an input state vector characterizing that data stream, and the
memory location address of the input state vector. During one or more
intermediate clock cycles, the pipeline processes the input data word and
the input state vector to yield an output data word and an output state
vector. During a final clock cycle, the pipeline transfers the output data
word to an outgoing data stream, and transfers the output state vector into
the aforementioned memory location address. A controller coupled to the
memory and to the pipeline synchronizes operation thereof. A null cycle

CA 02234493 1998-04-09
-4-
generator coupled to the pipeline and to the controller inserts null cycles
into the concurrently processed data streams at regular time intervals and
outputs a NULL signal to the controller during each null cycle. A
multiplexer coupled between the controller and the memory multiplexes
access to the memory between the controller/pipeline, and an alternate
controller. Read access to the memory by the controller or pipeline is
inhibited while the NULL signal is output, and write access to the
memory by the pipeline is inhibited while an OUTGOING NULL replica
of the NULL signal is being output by the pipeline during the final clock
cycle. Accordingly, the alternate controller may gain read access to the
memory while the NULL signal is output, and may gain write access to
the memory while the OUTGOING NULL signal is output.
Brief Description of Drawings
Figure 1 is a block diagram depiction of a prior art state
machine architecture for concurrent processing of multiplexed data
streams in accordance with the '398 patent.
Figure 2 is a block diagram depiction of a state machine
architecture for concurrent processing of multiplexed data streams in
accordance with the present invention. For ease of reference, compo-
nents which are identical in both the Figure 1 and Figure 2 embodiments
bear identical reference numerals,
Description
Figure 2 illustrates a multi-channel state machine in
accordance with the invention. As in the case of the '398 patent, Timing
Generator and Control block 10 identifies each time-slice of the incoming

CA 02234493 1998-04-09
-5-
multiplexed data stream and controls RAM 12. State vectors which
characterize the information modules being processed in the incoming
multiplexed data stream are stored in unique read-write memory locations
having known addresses within RAM 12. A "logic means" , namely State
Machine Logic block 14 contains combinational logic which implements
the desired state transitions and data stream manipulations. Delay blocks
16A-16F may be flip/flops or latch type delay elements configured to
form a data pipeline having a length of one clock cycle.
Unlike the '398 patent architecture, the present invention
incorporates Null Cycle Generator 20, Delay blocks 16G-16H and RAM
port multiplexers ("MUX") 22, 24, 26. Null Cycle Generator 20
pre-processes the incoming stream by introducing "null cycle" gaps into
the stream at regular intervals to yield a "gapped stream" which is input
to Delay block 16C. Null Cycle Generator 20 also outputs a "NULL"
signal, which remains active during each null cycle to indicate that no
data is present on the incoming stream. The NULL signal is passed to
Timing Generator and Control block 10 for use in controlling multiplex-
ing of the state machine RAM address and data signals, as hereinafter
explained. The NULL signal is also passed through Delay blocks 166-
16H incorporated in state machine pipeline 18A, and is output (as an
"OUTGOING NULL" signal), along with the outgoing data stream, for
use as a "data valid" indicator or as a null cycle indicator by a further,
downstream mufti-channel pipelined state machine (not shown). The
OUTGOING NULL signal output by Delay block 16H is also fed back
to Timing Generator and Contxol block 10 for use in controlling
multiplexers 22, 24, 26 as hereinafter explained.

CA 02234493 1998-04-09
-6-
In operation, Timing Generator and Control block 10 is syn-
chronized to the ordering of the time-slices in the incoming data stream
by the NULL signals output by Null Cycle Generator 20. When the
NULL signal becomes inactive, indicating arrival of a word of data of an
information module in the incoming multiplexed data stream, Timing
Generator and Control block 10 prefetches the state vector for that time-
slice from RAM 12 by supplying the appropriate RAM address location
via multiplexer 22. The state vector, the RAM address used to retrieve
the state vector, and the data word are then inserted into pipeline 18A.
More particularly, during the first (or initial) clock cycle, the state vector
retrieved from RAM 12 is fed into Delay block 16B, the RAM address
from which that state vector was retrieved is fed into Delay block 16A,
the data word is fed into Delay block 16C, and the NULL signal (which
is inactive, indicating data presence on the incoming stream) is fed into
Delay block 16G.
State Machine Logic block 14 performs the desired state
transitions and data manipulations on the time-slice information during
the next (i.e. second, or intermediate) clock cycle. This yields a new
state vector which is output from State Machine Logic block 14 and fed
into Delay block 16E during the second clock cycle; and, a new data
word which is output into Delay block 16F (also during the second clock
cycle). The new data word may or may not be identical to the input data
word, depending upon the manipulations dictated by the state vector.
While State Machine Logic block 14 processes the state vector and data
word, Timing Generator and Control block 12 prefetches the state vector
for the next time-slice.

CA 02234493 1998-04-09
During the next (i.e. third, or final) clock cycle, the new
state vector output by State Machine Logic block 14 is written from
Delay block 16E back into the RAM 12 location addressed by Delay
block 16D, via rnultiplexers 24, 26 respectively. Due to the pipeline
nature of the design, the RAM address for the time-slice must be carried
with the state vector to ensure that the new state vector is written back
into the correct RAM location. Thus, the RAM address from which the
original state vector was retrieved is fed from Delay block 16A to Delay
block 16D, and is then used to perform the write back of the new state
vector into RAM 12. If a given time-slice of the incoming data stream
is to be ignored (i.e. if the NULL signal output by Null Cycle Generator
is active), then Timing Generator and Control block 10 inhibits write
back into RAM 12 for that time-slice, effectively deeming pipeline 18A
to contain non-information.
15 Multiplexers 22, 24 and 26 also facilitate access to RAM 12
by an alternate control processor 28. Specifically, by applying an
appropriate RAM address location to the Read Address port of RAM 12
via the "Controller Address" line and multiplexer 22, alternate controller
28 may read the contents of that location via the "Controller Data Out"
20 line. Similarly, by applying an appropriate RAM address location to the
Write Address port of RAM 12 via the "Controller Address" line and
multiplexer 24, and by applying a data word to the Write Data port of
RAM 12 via the "Controller Data In" line and multiplexer 26, alternate
controller 28 may store that data word in that location. Note that
alternate controller 28 is granted read access to RAM 12 (by the
switching operation of multiplexer 22) only during cycles in which the
NULL signal is active; and, control processor 28 is granted write access

CA 02234493 1998-04-09
to RAM 12 (by the switching operation of multiplexers 24 and 26) only
during cycles in which the OUTGOING NULL signal is active; whereas
Timing Generator and Control block 10 and pipeline 18 are granted read
access to RAM 12 only during cycles in which the NULL signal is
inactive, and are granted write access to RAM 12 only during cycles in
which the OUTGOING NULL signal is inactive. It can thus be seen that
the invention facilitates shared, non-interfering access to RAM 12 by two
different controllers (i.e. Timing Generator and Control block 10 and
pipeline 18 together being a "first" controller, and alternate control
processor 28 being a "second controller").
As with the '398 patent, a single port type RAM may be
used instead of a dual port type RAM if multiple RAM accesses can be
performed during each clock cycle. For example, a RAM write-read
cycle could be performed for each incoming time-slice, effectively
duplicating the function of a dual port type RAM. By writing the new
state vector to the RAM before reading the current state vector, a write-
through mechanism would be implemented. A longer pipeline may also
be provided. Thus, if State Machine Logic block 14 can not generate the
new state vector and/or new data word in one clock period, the entire
pipeline could be lengthened to distribute the processing over multiple
clock cycles (i.e. processing may occur during one or more of the second
or intermediate clock cycles).
As will be apparent to those skilled in the art in the light of
the foregoing disclosure, many alterations and modifications are possible
in the practice of this invention without departing from the spirit or scope
thereof. For example, if a dual port RAM which allows each port to
function as either a read or a write port is used, then only a single

CA 02234493 1998-04-09
-9-
"controller address" (i.e. either a read address or a write address) need
be multiplexed to one of the RAM ports; and, only a single "controller
data out" signal (i.e. a write data signal) or a single "controller data in"
signal (i.e. a read data signal) need be read from the other RAM port.
(Although Figure 2 shows a dual port RAM 12, that RAM is configured
with one port dedicated to write operations only and the other port
dedicated to read operations only). Accordingly, the scope of the
invention is to be construed in accordance with the substance defined by
the following claims.

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é 2014-04-09
Lettre envoyée 2013-04-09
Accordé par délivrance 2002-12-31
Inactive : Page couverture publiée 2002-12-30
Inactive : Taxe finale reçue 2002-09-27
Préoctroi 2002-09-27
Un avis d'acceptation est envoyé 2002-09-19
Lettre envoyée 2002-09-19
month 2002-09-19
Un avis d'acceptation est envoyé 2002-09-19
Inactive : Approuvée aux fins d'acceptation (AFA) 2002-07-30
Modification reçue - modification volontaire 2002-06-19
Inactive : Dem. de l'examinateur par.30(2) Règles 2002-05-24
Demande publiée (accessible au public) 1999-10-09
Inactive : Page couverture publiée 1999-10-08
Symbole de classement modifié 1998-07-13
Inactive : CIB en 1re position 1998-07-13
Inactive : CIB attribuée 1998-07-13
Inactive : Certificat de dépôt - RE (Anglais) 1998-06-19
Demande reçue - nationale ordinaire 1998-06-18
Exigences pour une requête d'examen - jugée conforme 1998-04-09
Toutes les exigences pour l'examen - jugée conforme 1998-04-09

Historique d'abandonnement

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

Taxes périodiques

Le dernier paiement a été reçu le 2002-01-21

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.

Titulaires au dossier

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

Titulaires actuels au dossier
PMC-SIERRA LTD.
Titulaires antérieures au dossier
LARRIE S. CARR
WINSTON KI-CHEONG MOK
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) 
Description 1998-04-08 9 391
Revendications 1998-04-08 6 175
Abrégé 1998-04-08 1 50
Dessins 1998-04-08 2 41
Page couverture 1999-09-22 1 57
Dessin représentatif 1999-09-22 1 10
Page couverture 2002-11-27 2 61
Revendications 2002-06-18 6 184
Courtoisie - Certificat d'enregistrement (document(s) connexe(s)) 1998-06-18 1 117
Certificat de dépôt (anglais) 1998-06-18 1 163
Avis du commissaire - Demande jugée acceptable 2002-09-18 1 163
Avis concernant la taxe de maintien 2013-05-20 1 171
Avis concernant la taxe de maintien 2013-05-20 1 171
Correspondance 2002-09-26 1 35