Language selection

Search

Patent 2057447 Summary

Third-party information liability

Some of the information on this Web page has been provided by external sources. The Government of Canada is not responsible for the accuracy, reliability or currency of the information supplied by external sources. Users wishing to rely upon this information should consult directly with the source of the information. Content provided by external sources is not subject to official languages, privacy and accessibility requirements.

Claims and Abstract availability

Any discrepancies in the text and image of the Claims and Abstract are due to differing posting times. Text of the Claims and Abstract are posted:

  • At the time the application is open to public inspection;
  • At the time of issue of the patent (grant).
(12) Patent: (11) CA 2057447
(54) English Title: METHOD AND CIRCUIT FOR TESTING TRANSMISSION PATHS
(54) French Title: METHODE ET CIRCUIT DE VERIFICATION DE TRAJETS DE TRANSMISSION
Status: Expired and beyond the Period of Reversal
Bibliographic Data
(51) International Patent Classification (IPC):
  • H04L 01/24 (2006.01)
  • H04B 17/309 (2015.01)
(72) Inventors :
  • GAUTHIER, JOHN ALBERT (Canada)
  • GOATCHER, JOHN KENNETH (Canada)
(73) Owners :
  • NORTEL NETWORKS LIMITED
(71) Applicants :
  • NORTEL NETWORKS LIMITED (Canada)
(74) Agent:
(74) Associate agent:
(45) Issued: 1998-12-29
(22) Filed Date: 1991-12-11
(41) Open to Public Inspection: 1993-06-12
Examination requested: 1993-11-24
Availability of licence: N/A
Dedicated to the Public: N/A
(25) Language of filing: English

Patent Cooperation Treaty (PCT): No

(30) Application Priority Data: None

Abstracts

English Abstract


A circuit for testing the integrity of transmission
paths includes a first linear feedback shift register (LFSR)
adapted to generate a periodic sequence of pseudo random test
data for transmission on the transmission paths. A second
LFSR synchronizes to the transmitted test data after being
provided with a seed value corresponding to a transmitted
data word. After synchronization, the second LFSR is set to
a free running mode and independently generates a pseudo
random sequence of patterns corresponding to the sequence
generated by the first LFSR. A comparator compares the
pseudo random data generated by the second LFSR with the
pseudo random data received from the transmission paths. If
a mismatch occurs a signal indicating an error condition is
asserted.


French Abstract

Un circuit pour vérifier l'intégrité des voies de transmission comprend un registre à décalage à rebouclage linéaire (RDRL) adapté de façon à générer une séquence périodique de pseudo- données d'essai aléatoires pour fins de transmission sur les voies de transmission. Un second RDRL se synchronise avec les données d'essai transmises après avoir reçu une valeur représentative correspondant à un mot transmis. Après la synchronisation, le second RDRL est placé en mode de fonctionnement libre et génère, de façon indépendante, une pseudo-séquence de modèles correspondant à la séquence générée par le premier RDRL. Un comparateur compare les pseudo-données aléatoires générées par le second RDRL aux pseudo-données aléatoires reçues des voies des transmission. En cas d'écart, un signal indiquant la présence d'erreurs est communiqué.

Claims

Note: Claims are shown in the official language in which they were submitted.


- 9 -
What I claim is:
1. A method of testing a circuit comprising a
plurality of transmission paths having x input terminals
for receiving a series of input test patterns and having
corresponding y output terminals, the method comprising
the steps of:
generating a first series of 2n pseudo random
input test patterns, each pattern having n bits;
applying to the x input terminals at least a
portion of each of the generated input test patterns for
transmission to the corresponding y output terminals;
generating a second series of patterns by
beginning the second series with an n-bit seed value
corresponding to an output pattern from the output
terminals, each pattern in the second series formed of a
plurality of bits, the second series corresponding to the
first series of pseudo random input test patterns; and
comparing each pattern in the second series with
a corresponding output pattern from the series of output
patterns.
2. A method of testing a circuit as defined in claim
1 wherein the seed value is attained by capturing a bit
provided at one of the y output terminals from each of n
sequential test patterns.
3. A method of testing a circuit comprising a
plurality of transmission paths having x input terminals
for receiving series of input test patterns and having
corresponding output terminals, the method comprising the
steps of:
in a first generator for connection to the input
terminals, generating a first series of 2n pseudo random
test patterns, each pattern having n bits;

- 10 -
applying to the x input terminals at least a
portion of each of the generated first series of patterns
for transmission to the corresponding output terminals;
in a second pseudo random test pattern generator
at the output of the circuit, generating a second series
of patterns by beginning the second series with an n bit
seed value corresponding to the nth test pattern generated
by the first generator whereby the test patterns
subsequently generated by the second generator correspond
to the pseudo random test patterns generated by the first
generator and are in synchronism with the test patterns on
the output terminals; and
comparing each of the test patterns on the
output terminals of the circuit with the corresponding
test pattern from the second generator and generating a
signal indicative of the result of the comparison.
4. A method of testing as defined in claim 3 wherein
the seed value is obtained by capturing a bit provided at
one of the output terminals into a register of the second
generator for each of n sequential test patterns.
5. A method of testing as defined in claim 4 wherein
a clock signal is used to drive the circuit under test and
the first and second test pattern generators.
6. A method of testing a transmission path
comprising the steps of:
generating a first series of test patterns;
applying the test patterns to an input port of
the transmission path whereby data appears at an output
port of the transmission path;
replicating one of the test patterns of the
first series of test patterns from the data thereby
synchronizing to a test pattern at the output port;
after synchronizing, continuing to replicate the
series of test patterns applied to the input port thereby

- 11 -
generating a second series of test patterns, independent
of the data at the output port;
comparing the second series of test patterns
with the data appearing at the output port of the
transmission path; and,
generating a flag signal when a mismatch is detected
between the second series of test patterns and the test
patterns at the output port of the transmission path.
7. A circuit for testing transmission paths
comprising:
(a) means for generating a first periodic series of
2n pseudo random input test patterns, each pattern having
n-bits for transmission through the transmission paths;
(b) means for generating a second periodic series of
2n patterns, the second series corresponding to the first
generated series, wherein the second series is generated
after the second series generation means is provided with
an n-bit starting seed value corresponding to an output
pattern transmitted through the transmission paths; the
provision of the seed value corresponding to a
synchronizing mode; the subsequent generation of the
second series corresponding to a free-running mode;
(c) control means for selectively switching the means
for generating the second series from the synchronizing
mode to the free running mode; and
(d) comparator means for comparing each pattern in
the second series with a corresponding output pattern from
a series of output patterns transmitted through the
transmission paths for determining the integrity of a data
transmission.
8. The circuit for testing as claimed in claim 7
further comprising selection means for selectably
connecting the transmission paths with a set of pseudo
random input signals corresponding to a test mode or a set
of normal input signals corresponding to a non-test mode.

- 12 -
9. A circuit as defined in claim 7 wherein the
transmission paths and the circuit for testing the
transmission paths are co-located on an integrated
circuit.
10. A circuit for testing a module comprising:
(a) first means for generating a first series of
pseudo random input test signals for transmission through
the module;
(b) second means for generating a second series of
pseudo random input test signals corresponding the first
series, wherein the second series is based upon a seed
value generated by the first means after having been
transmitted through the module; and,
(c) comparator means for comparing the transmitted
first series of pseudo random test signals with the second
series of pseudo random test signals.
11. A circuit for verifying the integrity of a
plurality of transmission paths having input terminals and
corresponding output terminals, comprising:
a first circuit means for generating a first
series of 2n pseudo random test patterns, each pattern
having n bits;
means for applying to the input terminals at
least a portion of each of the generated first series of
test patterns for transmission to the corresponding output
terminals;
a second circuit means for generating a second
series of pseudo random test patterns, the second circuit
means being responsive to an n bit seed value
corresponding to an nth test pattern generated by the
first circuit means for synchronizing to the test patterns
on the output terminals and being responsive to the seed
value and to control signals for subsequently generating

- 13 -
test patterns corresponding to the test patterns generated
by the first circuit means;
means for comparing the test patterns generated
by the second circuit means to the test patterns on the
output terminals; and
means for generating a signal indicative of the
result of the comparison.
12. A circuit as defined in claim 11 wherein each of
the first and second circuit means comprises a linear
feedback shift register having a shift register with n bit
positions ordered from least to most significant and an
exclusive-or gate responsive to the content of two of the
bit positions of the shift register to generate a feedback
signal, and a feedback path to recirculate the feedback
signal to the least significant bit position of the
register.
13. A circuit as defined in claim 12 wherein the
feedback path of the second circuit means comprises a
selection switch responsive to control signals for
selectively feeding back the associated feedback signal or
at least a portion of the signal at an output terminal of
the transmission paths to thereby acquire the seed value.
14. A circuit as defined in claim 13 wherein the
linear feedback shift registers of the first and second
circuit means and the transmission paths are driven by a
clock signal having a source that is used during normal
operation of the transmission path.
15. A circuit as defined in claim 11 and further
comprising a first switch responsive to control signals
for selectively switching the input terminals of the
transmission paths between a normal source of signals and
the test patterns generated by the first circuit means.

Description

Note: Descriptions are shown in the official language in which they were submitted.


2~5~447
M~l'HOD AND CIRCUIT FOR 1~ S~ G TRANSMISSION PATHS
Field of the Invention
The invention relates to a circuit and method of
testing and more specifically to a method and circuit for
generating pseudo random test data for verifying the
integrity of transmission paths.
Bac~4~ of the Invention
In the past, the integrity of transmission paths
has usually been verified using a signature test. A
signature comprised of a predetermined pattern of data bits
is transmitted through a tr~n~ ission path under test and is
compared to the data received at a receiver~ The
transmission path under test is considered to be fault-free
if the received data matches the transmitted data.
More recently, transmission circuits have become
increasingly more complex with a requirement for data to be
transmitted at higher rates. As bit rates increase, the need
for the testing of transmission circuits becomes more
essential since a transmission circuit which performs
adequately at low frequencies may not perform adequately at
much hiqher frequencies and may cause data to become corrupt.
Transmission circuits capable of transmitting data at high
frequencies often have many closely inter-spaced data lines
forming a data bus. It is not uncommon for noise to be
generated on the bus as data bits carried on the data bus are
changing binary values at very high frequencies. This noise
is often the cause of data corruption, resulting in the loss
of integrity of a transmitted data message. A static data
test such as a signature test may not detect data corruption
in a circuit capable of transmitting large amounts of data at
very high frequencies. Thus, it is desirable to provi~e test
data which is random or pseudo random and which covers a
myriad of possible hit combinations thereby to provide
varying stimuli for a transmission circuit under test.

2 20574~7
Pseudo random data is compr~sed of many varying patterns
which, while appearing random, are periodically based.
In the past, large memory devices have been used to
S store test data; however, memory devices capable of storing
an adequate amount of test data are physically large and may
not be practically incorporated on an integrated circuit that
also includes the circuit under test.
It is therefore an object of the invention to
provide an improved method and circuit for testing the
integrity of a transmission path.
It is also an object of the invention to provide
testing circuitry that may be co-located on an integrated
circuit also containing at least a portion of the circuit to
be tested.
It is a further object of the invention to provide
testing circuitry that is adapted to exercise the circuit
under test at a data rate similar to that normally sent
through the circuit under test.
Summary of the Invention
The circuit of the invention is particularly
well-suited to test the integrity of transmission paths such
as exist through a switching network module. A circuit
adapted to generate pseudo random data may be connected to
apply the generated data to the input ports of the module
whereas another circuit is responsive to the data at the
output ports of the module for synchronizing to the generated
data thereby allowing a continuous comparison between the
generated data and the data at the output ports of the
module. A mismatch of the compared data indicates a problem
associated with the particular transmission path being
tested.
In accordance with the invention there is provided
a method of testin~ a circuit comprising a plurality of

2~7~ ~7
transmission paths having x input terminals for receiving
series of input test patterns and having corresponding y
output terminals, the method comprising the steps of:
in a first generator for connection to the input
terminals, generating a first series of 2"pseudo random test
patterns, each pattern having n bits;
applying to the x input terminals at least a
portion of each of the generated first series of patterns for
transmission to the corresponding y output terminals;
in a second pseudo random test pattern generator at
the output of the circuit, generating a second series of
patterns by beginning the second series with an n bit seed
value corresponding to the nth test pattern generated by the
first generator whereby the test patterns subsequently
generated by the second generator correspond to the pseudo
random test patterns generated by the first generator and are
in synchronism with the test patterns on the output
tel ; n~ 1 S; and
c -ring each of the test patterns on the output
te~ inAls of the circuit with the corresponding test pattern
from the second generator and generating a signal in the
event of a mismatch.
From a different aspect, the invention also
provides a circuit for testing tr~n~ lssion paths. The
circuit comprises means for generating a first periodic
series of 2npseudo random test input patterns, each pattern
having n-bits for transmission through the transmission
paths; means for generating a second periodic series of 2"
patterns, the second series corresponding to the first
generated series, wherein the second series is generated
after the second series qeneration means is provided with an
n-bit starting seed value corresponding to an output pattern
transmitted through the transmission pa'hs; the provision of
the seed value corresponding to a synchronizing mode; the
subsequent generation of the second series corresponding to a
free-running mode; control means for selectively switching
the means for generating the second series from the
synchronizing mode to the free running mode; and comparator

2~ 74 '1 7
means for comparing e~ch pattern in the second series with a
corresponding output pattern from a series of output patterns
transmitted through the transmission paths for determining
the integrity of a data transmission.
The invention thus provides a simple and economical
circuit and method of testing the integrity of a transmission
path under conditions approximating normal operating
conditions. Furthermore, the circuit of the invention may be
practically implemented as an integrated circuit either by
itself or with other circuitry such as a plurality of
transmission paths that may periodically require to be
exercised. To that end, the circuit of the invention may
also comprise circuit means for switchably coupling it to
transmission paths under control signals such as from a
processor.
Detailed DescriDtion
An embodiment of the invention will be described
with reference to the drawings in which:
Figure 1 is a blocK diagram of a test circuit in
accordance with the invention; and
Figure 2 is a schematic block diagram of a portion
of the test circuit shown in Figure 1.
IA Figures 1 and 2, a linear feedback shift
register (LFSR) 5 for generating pseudo random test data is
shown comprising a conventional shift register 10 coupled to
an exclusi~e-or gate 13. A multiplexer circuit 15 is adapted
to selectively connect the input ports of a circuit under
test 20 via a data bus 14 or to a data inp~t bus 17 under
control of signals 31 from control circuit 30. In more
detail, Figure 2 shows the LFSR S comprised of a 15-bit shift
register 10 and an exclusive-or gate 13. The first 10 stages
3s of the 15-bit shift register correspond to bit positions 1 to
10 and provide a 10 bit parallel output stream of pseudo
random test data on data bus 14. The exclusive-or gate 13 is
connected to receive the values stored in two locations
(e.g., 14th and 15th bit positions) of the 15-bit shift

20~7~7
register and generates an exclusive-or feedback signal which
is transmitted on feedback path 12 to the input stage of the
shift register 10. The circuit under test 20 receives the
test patterns from the LFSR 5 and provides the test patterns
on bus 22. As mentioned above, the circuit of the invention
is particularly well suited to the testing of a circuit such
as a switching network which of course comprises a plurality
of transmission paths. The multiplexer 15 is thus arranged
to switchably connect the test signals from the LFSR 5 or the
normal input data on bus 17 to the various input ports of the
switching network. Data bus 21 connected to bus 22 provides
ouL~L data to other circuitry connected to the circuit under
test 20. The data transmitted on data bus 21 is either
normal input data which originated on data bus 17 or the
input test data originating from the LFSR 5.
A second LFSR circuit 50 is configured in a similar
-nner as the first; however, a multiplexer 40 permits one of
two signals to be fed back to the input stage of a shift
register 51. An exclusive-or gate 53 is responsive to the
two most significant bits of the shift register 51, (e.g.,
bits 14 and 15), to generate an exclusive-or feedback signal
which is transmitted on feedback path 52 to the multiplexer
40 which is also cor.nected to data line 24 to receive a
signal carried on the least significant data line of data bus
22. The control circuit 30 provides a selection control
signal on control line 34 for selecting the signal carried on
data line 24 or the feedback signal carried on feedback path
52. The least significant data line on data bus 22 is
connected to data line 24 to permit a portion of the pseudo
random data transmitted in the least significant bit position
to be transmitted to the second LFSR 50 via the multiplexer
40. The control circuit also monitors the value stored in
the LFSR 5 and the LFSR 50 via control lines 16 and 19
respectively.
A comparator 60 is connected to receive the 10-bit
series of output test patterns from the circuit 20 and a
10-bit pattern generated by the second LFSR circuit 50 on

2~7~47
data bus 58. The comparator 60 compares the two 10-bit
series of test patterns and generates true or false signals.
A clock signal provided on control line 18 provides a timing
signal to the first LFSR 5, the control circuit 30, the
second LFSR circuit 50 and to the comparator 60. If that
clock signal has the same frequency as that normally driving
the circuit under test 20, then the circuit is exercised
under real-life conditions.
In operation, the LFSR S is adapted to generate
pseudo random binary test data for provision to the circuit
under test 20. After a sequence of 215-l patterns have been
generated by the LFSR 5 the sequence of patterns repeats.
Upon power up of the test circuitry, the control
circuit 30 initializes the 15-bit binary value stored in the
LFSR 5 to a non-zero value to prevent the LFSR 5 from
generating only zero-bit patterns. After initialization, the
control circuit 30 continues to monitor the contents of the
first and second LFSRs 5 and 50 to ensure that they do not
remain in a state where either one of them contains all zero
bits. If an all zero state is detected in the LFSR 5 or the
LFSR 50, the control circuit 30 re-initializes the test
circuit by asserting the signals on control lines 32 and 34.
Once the LFSR 5 has been initialized, the binary
word stored in the 15-bit shift register 10 is shifted in the
more significant direction in a rotational manner; the bit
stored in the first stage of the shift register 10 is shifted
to the second stage; the bit stored in the second stage is
simultaneously shifted to the third stage, and so on. Each
shift occurs synchronously with each period of the clock
signal. As each shift occurs, the bits stored in the two
most significant bit positions, bits 14 and 15 are
exclusive-ored and the resultant signal is fed back to the
least significant bit position of the shift register 10.
Feeding back the resultant signal ensures that, with each
period of the clock signal, the binary value of the 15-bit
binary word in the LFSR 5 changes with each shift. The least

2a~74~7
significant 10 bits of the 15-bit binary word corresponding
to the first 10 stages of the shift register, form a binary
pattern and with each shift, a different pattern is formed.
Of course, the entire 15 bits could be used to form test
patterns, however, in the embodiment described only the least
10 significant bits are required. Providing an LFSR which
has more register stages than the bits used for the test
patterns as exemplified in the embodiment, provides more
patterns in the series of test patterns and thus provides a
greater variation of stimuli presented to the circuit under
test. The series of pseudo random binary data patterns are
transmitted to the circuit under test 20 via data bus 14 and
multiplexer 15.
After a transmission delay in the circuit under
test 20, the comparator 60 is presented with the first
patterrl via data bus 2Z. During the initialization stage,
the selection control signal is asserted on control line 34
to select a least significant bit of the series of patterns
transmitted on data bus 22 to provide an input signal to the
second LFSR circuit 50. After 15 clock cycles have occurred,
a 15-bit word corresponding to a word that was generated in
the first LFSR 5 will have been written into the second LFSR
circuit 50. By copying 15 successive values from the least
significant data line of data bus 22, and shifting the 15
bits into the second LFSR 50, a 15-bit word is captured which
was generated sometime before in the first LFSR 5. The
15-bit binary word in the LFSR 50 represents a seed value
from which it may generate data patterns on its own in a free
running mode. The control circuit 30 thus de-asserts the
selection control signal on control line 34 and the
multiplexer 40 provides the input stage of the second LFSR 50
with the exclusive-or feedback signal carried on feedbac~
path 52. With each successive period of the clock signal, a
10-bit binary word corresponding to the least significant
10-bits of the second LFSR 50 are presented to the comparator
60. Each 10-bit binary word presented to the comparator 60
on data bus 58 should henceforth match a pattern of the
series of patterns received on data bus 22. A mismatch

2 ~ ~ 7 ~ ~ 7
between the two 10-bit binary words presented to the
comparator 60 results in the comparator generating a false
condition signal on an output line 62. A mismatch indicates
that a 10-bit pseudo random binary pattern has become altered
during transmission through the circuit under test 20.
Corrective action may be taken on each error detection or
statistics of false conditions may be logged and corrective
action taken when the number of false conditions exceeds an
acceptable predetermined number.
The invention thus provides a simple and economical
circuit and method of verifying the integrity of a
tr~n~ ission path. Since the circuit uses only digital logic
circuitry, it may be readily implemented as an integrated
circuit either on its own or as a portion of another
integrated circuit. In addition, the circuit may be driven
by the same clock signal source as that of the circuit under
test thus providing real life test conditions.
Numerous other modifications, variations and
adaptations may be made to the particular embodiment of the
invention described above without departing from the scope of
the claims.

Representative Drawing
A single figure which represents the drawing illustrating the invention.
Administrative Status

2024-08-01:As part of the Next Generation Patents (NGP) transition, the Canadian Patents Database (CPD) now contains a more detailed Event History, which replicates the Event Log of our new back-office solution.

Please note that "Inactive:" events refers to events no longer in use in our new back-office solution.

For a clearer understanding of the status of the application/patent presented on this page, the site Disclaimer , as well as the definitions for Patent , Event History , Maintenance Fee  and Payment History  should be consulted.

Event History

Description Date
Revocation of Agent Requirements Determined Compliant 2021-04-01
Inactive: IPC deactivated 2015-03-14
Inactive: IPC from PCS 2015-01-17
Inactive: IPC expired 2015-01-01
Time Limit for Reversal Expired 2006-12-11
Inactive: Adhoc Request Documented 2006-02-23
Letter Sent 2005-12-12
Inactive: Late MF processed 2003-11-25
Letter Sent 2000-10-13
Letter Sent 1999-07-22
Grant by Issuance 1998-12-29
Inactive: Final fee received 1998-09-03
Pre-grant 1998-09-03
Notice of Allowance is Issued 1998-08-27
Letter Sent 1998-08-27
Notice of Allowance is Issued 1998-08-27
Inactive: Status info is complete as of Log entry date 1998-08-20
Inactive: Application prosecuted on TS as of Log entry date 1998-08-20
Inactive: Approved for allowance (AFA) 1998-07-02
Inactive: IPC assigned 1998-07-02
Inactive: Delete abandonment 1998-04-06
Deemed Abandoned - Failure to Respond to Maintenance Fee Notice 1997-12-11
All Requirements for Examination Determined Compliant 1993-11-24
Request for Examination Requirements Determined Compliant 1993-11-24
Application Published (Open to Public Inspection) 1993-06-12

Abandonment History

Abandonment Date Reason Reinstatement Date
1997-12-11

Maintenance Fee

The last payment was received on 1998-11-12

Note : If the full payment has not been received on or before the date indicated, a further fee may be required which may be one of the following

  • the reinstatement fee;
  • the late payment fee; or
  • additional fee to reverse deemed expiry.

Patent fees are adjusted on the 1st of January every year. The amounts above are the current amounts if received by December 31 of the current year.
Please refer to the CIPO Patent Fees web page to see all current fee amounts.

Fee History

Fee Type Anniversary Year Due Date Paid Date
MF (application, 6th anniv.) - standard 06 1997-12-11 1997-12-10
Final fee - standard 1998-09-03
MF (application, 7th anniv.) - standard 07 1998-12-11 1998-11-12
MF (patent, 8th anniv.) - standard 1999-12-13 1999-11-04
MF (patent, 9th anniv.) - standard 2000-12-11 2000-08-25
MF (patent, 10th anniv.) - standard 2001-12-11 2001-12-11
MF (patent, 11th anniv.) - standard 2002-12-11 2002-12-11
MF (patent, 12th anniv.) - standard 2003-12-11 2003-11-25
MF (patent, 13th anniv.) - standard 2004-12-13 2004-12-10
2004-12-10
Owners on Record

Note: Records showing the ownership history in alphabetical order.

Current Owners on Record
NORTEL NETWORKS LIMITED
Past Owners on Record
JOHN ALBERT GAUTHIER
JOHN KENNETH GOATCHER
Past Owners that do not appear in the "Owners on Record" listing will appear in other documentation within the application.
Documents

To view selected files, please enter reCAPTCHA code :



To view images, click a link in the Document Description column (Temporarily unavailable). To download the documents, select one or more checkboxes in the first column and then click the "Download Selected in PDF format (Zip Archive)" or the "Download Selected as Single PDF" button.

List of published and non-published patent-specific documents on the CPD .

If you have any difficulty accessing content, you can call the Client Service Centre at 1-866-997-1936 or send them an e-mail at CIPO Client Service Centre.

({010=All Documents, 020=As Filed, 030=As Open to Public Inspection, 040=At Issuance, 050=Examination, 060=Incoming Correspondence, 070=Miscellaneous, 080=Outgoing Correspondence, 090=Payment})


Document
Description 
Date
(yyyy-mm-dd) 
Number of pages   Size of Image (KB) 
Representative drawing 1998-12-23 1 7
Representative drawing 1998-10-12 1 13
Claims 1998-06-16 5 211
Drawings 1998-06-16 2 25
Drawings 1993-12-19 2 21
Claims 1993-12-19 5 180
Abstract 1993-12-19 1 20
Description 1993-12-19 8 329
Commissioner's Notice - Application Found Allowable 1998-08-26 1 166
Maintenance Fee Notice 2006-02-05 1 172
Maintenance Fee Notice 2006-02-05 1 172
Fees 2002-12-10 1 32
Correspondence 1997-12-09 2 58
Correspondence 1998-09-02 1 36
Correspondence 2000-02-07 1 22
Fees 1999-11-03 1 33
Fees 2001-12-10 2 71
Fees 1998-11-11 1 39
Fees 1997-12-09 1 36
Fees 2000-08-24 1 31
Fees 2004-12-09 2 66
Correspondence 2006-03-07 2 132
Fees 1996-11-26 1 44
Fees 1994-11-29 1 46
Fees 1993-11-23 1 45
Fees 1995-11-14 1 49
Prosecution correspondence 1991-12-10 13 550
Prosecution correspondence 1993-11-23 1 31
Prosecution correspondence 1993-11-23 1 38
Prosecution correspondence 1994-02-22 1 38
Prosecution correspondence 1994-02-22 1 18
Examiner Requisition 1997-07-07 2 48
Prosecution correspondence 1998-01-06 2 47
Prosecution correspondence 1998-03-31 1 26
Courtesy - Office Letter 1998-04-01 2 33
Courtesy - Office Letter 1993-12-23 1 35