Patent US4866657A successfully refreshed from Google Patents.
← Back to Patent Explorer
US4866657A Expired / Lapsed US ⏱️ 0.0 years remaining

Adder circuitry utilizing redundant signed digit operands

Assignee: Panasonic Holdings Corp
•
Filing: 1987-08-18
•
Granted: 1989-09-12
•
Expires: 2007-08-18
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A high speed arithmetic processor and adder circuitry thereof are disclosed in which carry (borrow) propagation is never more than one digit. Addition (or subtraction) are performed by: (a) determining an intermediate carry (or borrow) at the i-th order position and an intermediate sum (or difference) at the i-th order position from the addend (or subtrahend) and the augend (or minuend) and (b) determining the sum (or difference) of the intermediate sum (or difference) at the i-th order position and the intermediate carry (or borrow) at the (i-1)-th or next-lower-order position. Logic equations, truth tables and circuitry are disclosed for implementing several embodiments of the invention.

Inventors

  • 👤 Tamotsu Nishiyama
  • 👤 Shigeo Kuninobu
  • 👤 Naofumi Takagi
  • 👤 Takashi Taniguchi

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-03 04:14
CPC Classifications
G; G06; G06F; G06F7/00; G06F7/38; G06F7/48; G06F7/4824; G06F7/52; G06F7/535; G06F7/537; G06F7/5375

Claims Analysis

Total Claims: 25
Claim 1
Independent Claim 399 words
In an arithmetic processor which performs arithmetic operations on radix 2 signed-digit numbers each having N digits denoted by an order index which assumes integer values from 1 to N, said arithmetic processor having a plurality of adder cells each of which performs addition operations on an i-th digit x i of a signed-digit augend x and an i-th digit y i of a signed-digit addend y for a different value of the order index i by first determining an intermediate carry digit c i and an intermediate sum digit s i , and then determining the final sum digit z i by adding the intermediate sum s i to an intermediate carry c i-1 obtained from the adder cell operating on the next lower order digits, wherein each of said digits of said augend and addend are represented by two one-bit signals respectively representing the sign and magnitude of said digit, said adder cells each comprising: (a) first circuit means to which are supplied signals representative of said digits x i and y i , said first circuit means determining therefrom and providing as output a 1-bit signal p i whose value depends upon the binary states of said digits x i and y i ; (b) second circuit means to which are supplied at least two signals representative of said digits x i and y i , and a 1-bit signal p i-1 obtained from the first circuit means of the adder cell which operates on the next lower order digits, said second circuit means determining therefrom and providing as output a 1-bit signal u i representing the difference p i-1 -s i ; (c) third circuit means to which are supplied at least two signals representative of said digits x i and y i and said signal p i-1 , said third circuit means determining therefrom and providing as output a 1-bit signal v i representing the sum p i +c i ; and (d) fourth circuit means to which are supplied as input said signal u i and a signal v i-1 obtained from the third circuit means of the adder cell which operates on the next lower digits, said fourth circuit means determining therefrom and prodiving as output a 2-bit signal representing the sign and magnitude of the i-th digit of the sum of x and y expressed as a radix 2 signed-digit number.
Claim 2
Dependent Claim 399 words
In an arithmetic processor which performs arithmetic operations on radix 2 signed-digit numbers each having N digits denoted by an order index which assumes integer values from 1 to N, said arithmetic processor having a plurality of adder cells each of which performs addition operations on an i-th digit x i of a signed-digit augend x and an i-th digit y i of a signed-digit addend y for a different value of the order index i by first determining an intermediate carry digit c i and an intermediate sum digit s i , and then determining the final sum digit z i by adding the intermediate sum s i to an intermediate carry c i-1 obtained from the adder cell operating on the next lower order digits, wherein each of said digits of said augend and addend are represented by two one-bit signals respectively representing the sign and magnitude of said digit, said adder cells each comprising: (a) first circuit means to which are supplied signals representative of said digits x i and y i , said first circuit means determining therefrom and providing as output a 1-bit signal p i whose value depends upon the binary states of said digits x i and y i ; (b) second circuit means to which are supplied at least two signals representative of said digits x i and y i , and a 1-bit signal p i-1 obtained from the first circuit means of the adder cell which operates on the next lower order digits, said second circuit means determining therefrom and providing as output a 1-bit signal u i representing the difference p i-1 -s i ; (c) third circuit means to which are supplied at least two signals representative of said digits x i and y i and said signal p i-1 , said third circuit means determining therefrom and providing as output a 1-bit signal v i representing the sum p i +c i ; and (d) fourth circuit means to which are supplied as input said signal u i and a signal v i-1 obtained from the third circuit means of the adder cell which operates on the next lower digits, said fourth circuit means determining therefrom and prodiving as output a 2-bit signal representing the sign and magnitude of the i-th digit of the sum of x and y expressed as a radix 2 signed-digit number.
Claim 3
Dependent Claim 79 words
The arithmetic processor in accordance with claim 1, wherein said first circuit means is supplied with a 1-bit signal x i s and a 1 -bit signal y i s which represent the sign of digits x i and y i respectively and determines therefrom a 1-bit signal p i whose value depends upon whether digits x i and y i are both non-negative, or whether at least one of said digits x i and y i is negative.
Claim 4
Dependent Claim 85 words
The arithmetic processor according to claim 2 wherein said second circuit means is supplied with two 1-bit signals x i a and y i a representing the magnitude of said digits x i and y i respectively and a 1-bit signal p i-1 obtained from the first circuit means of the adder cell which operates on the next lower order digits, said second circuit means determining therefrom and providing as an output a 1-bit signal u i representing the difference p i-1 -s i .
Claim 5
Dependent Claim 78 words
The arithmetic processor in accordance with claim 1, wherein said first circuit means is supplied with a 1-bit signal x i s and a 1-bit signal y i s which represent the sign of digits x i and y i respectively and determines therefrom a 1-bit signal p i whose value depends upon whether digits x i and y i are both non-positive or whether at least one of said digits x i and y i is positive.
Claim 6
Dependent Claim 85 words
The arithmetic processor according to claim 4 wherein said second circuit means is supplied with two 1-bit signals x i a and y i a representing the magnitude of said digits x i and y i respectively and a 1-bit signal p i-1 obtained from the first circuit means of the adder cell which operates on the next lower order digits, said second circuit means determining therefrom and providing as an output a 1-bit signal u i representing the difference p i-1 -s i .
Claim 7
Dependent Claim 87 words
The arithmetic processor in accordance with claim 1, wherein said first circuit means is supplied with a 1-bit signal x i s and a 1-bit signal y i s which represent the sign of digits x i and y i respectively and determines therefrom a 1-bit signal p i whose value depends upon whether the sum of the digits x i and y i is greater than or equal to zero or whether the sum of the digits x i and y i is less than zero.
Claim 8
Dependent Claim 85 words
The arithmetic processor according to claim 6 wherein said second circuit means is supplied with two 1-bit signals x i a and y i a representing the magnitude of said digits x i and y i respectively and a 1-bit signal p i-1 obtained from the first circuit means of the adder cell which operates on the next lower order digits, said second circuit means determining therefrom and providing as an output a 1-bit signal u i representing the difference p i-1 -s i .
Claim 9
Dependent Claim 85 words
The arithmetic processor according to claim 1 wherein said second circuit means is supplied with two 1-bit signals x i a and y i a representing the magnitude of said digits x i and y i respectively and a 1-bit signal p i-1 obtained from the first circuit means of the adder cell which operates on the next lower order digits, said second circuit means determining therefrom and providing as an output a 1-bit signal u i representing the difference p i-1 -s i .
Claim 10
Dependent Claim 442 words
In an arithmetic processor which performs arithmetic operations on radix 2 signed-digit numbers each having N digits denoted by an order index which assumes integer values from 1 to N, said arithmetic processor having a plurality of adder cells each of which performs addition operations on an i-th digit x i of a signed-digit augend x and an i-th digit y i of a signed-digit addend y for a different value of the order index i by first determining an intermediate carry digit c i and an intermediate sum digit s i , and then determining the final sum digit z i by adding the intermediate sum s i to an intermediate carry c i-1 obtained from the adder cell operating on the next lower order digits, wherein each of said digits of said augend and addend are represented by two one-bit signals respectively representing the sign and magnitude of said digit, said adder cells each comprising: (a) first circuit means to which are supplied as inputs a 1-bit signal x i s and a 1-bit signal y i s which represent the sign of digits x i and y i respectively, said first circuit means determining therefrom and providing as output a 1-bit signal p i whose value depends upon whether both x i and y i are non-negative, or whether at least one of said digits x i and y i is negative; (b) second circuit means to which are supplied as input a 1-bit signal x i a and a 1-bit signal y i a which represent the magnitude of said digits x i and y i respectively and a signal p i-1 obtained from the first circuit means of the adder cell which operates on the next lower order digits, said second circuit means determining therefrom and providing as output a 1-bit signal u i representing the difference p i-1 -s i ; (c) third circuit means to which are supplied input signals representing the digits x i and y i respectively and said signal p i-1 , said third circuit means determining therefrom and providing as output a 1-bit signal v i representing the sum p i +c i ; and (d) fourth circuit means to which are supplied as input said 1-bit signal u i and a 1-bit signal v i-1 obtained from the third circuit means of the adder cell which operates on the next lower order digits, said fourth circuit means determining therefrom and providing as output a 2-bit signal representing the sign and magnitude of the i-th ordere digit of the sum of x and y expressed as a radix 2 signed-digit number.
Claim 11
Dependent Claim 442 words
In an arithmetic processor which performs arithmetic operations on radix 2 signed-digit numbers each having N digits denoted by an order index which assumes integer values from 1 to N, said arithmetic processor having a plurality of adder cells each of which performs addition operations on an i-th digit x i of a signed-digit augend x and an i-th digit y i of a signed-digit addend y for a different value of the order index i by first determining an intermediate carry digit c i and an intermediate sum digit s i , and then determining the final sum digit z i by adding the intermediate sum s i to an intermediate carry c i-1 obtained from the adder cell operating on the next lower order digits, wherein each of said digits of said augend and addend are represented by two one-bit signals respectively representing the sign and magnitude of said digit, said adder cells each comprising: (a) first circuit means to which are supplied as inputs a 1-bit signal x i s and a 1-bit signal y i s which represent the sign of digits x i and y i respectively, said first circuit means determining therefrom and providing as output a 1-bit signal p i whose value depends upon whether both x i and y i are non-negative, or whether at least one of said digits x i and y i is negative; (b) second circuit means to which are supplied as input a 1-bit signal x i a and a 1-bit signal y i a which represent the magnitude of said digits x i and y i respectively and a signal p i-1 obtained from the first circuit means of the adder cell which operates on the next lower order digits, said second circuit means determining therefrom and providing as output a 1-bit signal u i representing the difference p i-1 -s i ; (c) third circuit means to which are supplied input signals representing the digits x i and y i respectively and said signal p i-1 , said third circuit means determining therefrom and providing as output a 1-bit signal v i representing the sum p i +c i ; and (d) fourth circuit means to which are supplied as input said 1-bit signal u i and a 1-bit signal v i-1 obtained from the third circuit means of the adder cell which operates on the next lower order digits, said fourth circuit means determining therefrom and providing as output a 2-bit signal representing the sign and magnitude of the i-th ordere digit of the sum of x and y expressed as a radix 2 signed-digit number.
Claim 12
Dependent Claim 400 words
In an arithmetic processor which performs arithmetic operations on radix 2 signed-digit numbers each having N digits denoted by an order index which assumed integer values from 1 to N, said arithmetic processor having a plurality of adder cells each of which performs addition operations on an i-th digit x i of a signed-digit augend x and an i-th digit y i of a signed-digit addend y for a different value of the order index i by first determining an intermediate carry digit c i and an intermediate sum digit s i , and then determining the final sum digit z i by adding the intermediate sum s i to an intermediate carry c i-1 obtained from the adder cell operating on the next lower order digits, wherein each of said digits of said augend and addend are represented by two one-bit signals respectively representing the sign and magnitude of said digit, said adder cells each comprising: (a) first circuit means to which are supplied signals representative of said digits x i and y i , said first circuit means determining therefrom and providing as output a 1-bit signal p i whose value depends upon the binary states of said digits x i and y i ; (b) second circuit means to which are supplied at least two signals representative of said digits x i and y i , and a 1-bit signal p i-1 obtained from the first circuit means of the adder cell which operates on the next lower order digits, said second circuit means determining therefrom and providing as output a 1-bit signal u i representing the sum p i-1 +s i ; (c) third circuit means to which are supplied at least two signals representative of said digits x i and y i , and said signal p i-1 , said third circuit means determining therefrom and providing as output a 1-bit signal v i representing the difference p i -c i ; and (d) fourth circuit means to which are supplied as input said signal u i and a signal v i-1 obtained from the third circuit means of the adder cell which operates on the next lower digits, said fourth circuit means determining therefrom and providing as output a 2-bit signal representing the sign and magnitude of the i-th digit of the sum of x and y expressed as a radix 2 signed-digit number.
Claim 13
Dependent Claim 400 words
In an arithmetic processor which performs arithmetic operations on radix 2 signed-digit numbers each having N digits denoted by an order index which assumed integer values from 1 to N, said arithmetic processor having a plurality of adder cells each of which performs addition operations on an i-th digit x i of a signed-digit augend x and an i-th digit y i of a signed-digit addend y for a different value of the order index i by first determining an intermediate carry digit c i and an intermediate sum digit s i , and then determining the final sum digit z i by adding the intermediate sum s i to an intermediate carry c i-1 obtained from the adder cell operating on the next lower order digits, wherein each of said digits of said augend and addend are represented by two one-bit signals respectively representing the sign and magnitude of said digit, said adder cells each comprising: (a) first circuit means to which are supplied signals representative of said digits x i and y i , said first circuit means determining therefrom and providing as output a 1-bit signal p i whose value depends upon the binary states of said digits x i and y i ; (b) second circuit means to which are supplied at least two signals representative of said digits x i and y i , and a 1-bit signal p i-1 obtained from the first circuit means of the adder cell which operates on the next lower order digits, said second circuit means determining therefrom and providing as output a 1-bit signal u i representing the sum p i-1 +s i ; (c) third circuit means to which are supplied at least two signals representative of said digits x i and y i , and said signal p i-1 , said third circuit means determining therefrom and providing as output a 1-bit signal v i representing the difference p i -c i ; and (d) fourth circuit means to which are supplied as input said signal u i and a signal v i-1 obtained from the third circuit means of the adder cell which operates on the next lower digits, said fourth circuit means determining therefrom and providing as output a 2-bit signal representing the sign and magnitude of the i-th digit of the sum of x and y expressed as a radix 2 signed-digit number.
Claim 14
Dependent Claim 78 words
The arithmetic processor in accordance with claim 10, wherein said first circuit means is supplied with a 1-bit signal x i s and a 1-bit signal y i ys which represent the sign of digits x i and y i respectively and determines therefrom a 1-bit signal p i whose value depends upon whether digits x i and y i are both non-negative, or whether at least one of said digits x i and y i is negative.
Claim 15
Dependent Claim 85 words
The arithmetic processor according to claim 11 wherein said second circuit means is supplied with two 1-bit signals x i a and y i a representing the magnitude of said digits x i and y i respectively and a 1-bit signal p i-1 obtained from the first circuit means of the adder cell which operates on the next lower order digits, said second circuit means determining therefrom and providing as an output a 1-bit signal u i representing the sum p i-1 +s i .
Claim 16
Dependent Claim 78 words
The arithmetic processor in accordance with claim 10, wherein said first circuit means is supplied with a 1-bit signal x i s and a 1-bit signal y i s which represent the sign of digits x i and y i respectively and determines therefrom a 1-bit signal p i whose value depends upon whether digits x i and y i are both non-positive or whether at least one of said digits x i and y i is positive.
Claim 17
Dependent Claim 85 words
The arithmetic processor according to claim 13 wherein said second circuit means is supplied with two 1-bit signals x i a and y i a representing the magnitude of said digits x i and y i respectively and a 1-bit signal p i-1 obtained from the first circuit means of the adder cell which operates on the next lower order digits, said second circuit means determining therefrom and providing as an output a 1-bit signal u i representing the sum p i-1 +s i .
Claim 18
Dependent Claim 87 words
The arithmetic processor in accordance with claim 10, wherein said first circuit means is supplied with a 1-bit signal x i s and a 1-bit signal y i s which represent the sign of digits x i and y i respectively and determines therefrom a 1-bit signal p i whose value depends upon whether the sum of the digits x i and y i is greater than or equal to zero or whether the sum of the digits x i and y i is less than zero.
Claim 19
Dependent Claim 85 words
The arithmetic processor according to claim 15 wherein said second circuit means is supplied with two 1-bit signals x i a and y i a representing the magnitude of said digits x i and y i respectively and a 1-bit signal p i-1 obtained from the first circuit means of the adder cell which operates on the next lower order digits, said second circuit means determining therefrom and providing as an output a 1-bit signal u i representing the sum p i-1 +s i .
Claim 20
Dependent Claim 85 words
The arithmetic processor according to claim 10 wherein said second circuit means is supplied with two 1-bit signals x i a and y i a representing the magnitude of said digits x i and y i respectively and a 1-bit signal p i-1 obtained from the first circuit means of the adder cell which operates on the next lower order digits, said second circuit means determining therefrom and providing as an output a 1-bit signal u i representing the sum p i-1 +s i .
Claim 21
Dependent Claim 442 words
In an arithmetic processor which performs arithmetic operations on radix 2 signed-digit numbers each having N digits denoted by an order index which assumed integer values from 1 to N, said arithmetic processor having a plurality of adder cells each of which performs addition operations on an i-th digit x i of a signed-digit augend x and an i-th digit y i of a signed-digit addend y for a different value of the order index i by first determining an intermediate carry digit c i and an intermediate sum digit s i , and then determining the final sum digit z i by adding the intermediate sum s i to an intermediate carry c i-1 obtained from the adder cell operating on the next lower order digits, wherein each of said digits of said augend and addend are represented by two one-bit signals respectively representing the sign and magnitude of said digit, said adder cells each comprising: (a) first circuit means to which are supplied as inputs a 1-bit signal x i s and a 1-bit signal y i s which represent the sign of digits x i and y i respectively, said first circuit means determining therefrom and providing as output therefrom a 1-bit signal p i whose value depends upon whether both x i and y i are non-negative, or whether at least one of said digits x i and y i is negative; (b) second circuit means to which are supplied as input a 1-bit signal x i a and a 1-bit signal y i a which represent the magnitude of said digits x i and y i respectively and a signal p i-1 obtained from the first circuit means of the adder cell which operates on the next lower order digits, said second circuit means determining therefrom and providing as output a 1-bit signal u i representing the sum p i-1 +p i ; (c) third circuit means to which are supplied input signals representing the digits x i and y i respectively and said signal p i-1 , said third circuit means determining therefrom and providing as output a 1-bit signal v i representing the difference p i -c i ; and (d) fourth circuit means to which are supplied as input said 1-bit signal u i and a 1-bit signal v i-1 obtained from the third circuit means of the adder cell which operates on the next lower digits, said fourth circuit means determining therefrom and providing as output a 2-bit signal representing the sign and magnitude of the i-th order digit of the sum of x and y expressed as a radix 2 signed-digit number.
Claim 22
Dependent Claim 442 words
In an arithmetic processor which performs arithmetic operations on radix 2 signed-digit numbers each having N digits denoted by an order index which assumed integer values from 1 to N, said arithmetic processor having a plurality of adder cells each of which performs addition operations on an i-th digit x i of a signed-digit augend x and an i-th digit y i of a signed-digit addend y for a different value of the order index i by first determining an intermediate carry digit c i and an intermediate sum digit s i , and then determining the final sum digit z i by adding the intermediate sum s i to an intermediate carry c i-1 obtained from the adder cell operating on the next lower order digits, wherein each of said digits of said augend and addend are represented by two one-bit signals respectively representing the sign and magnitude of said digit, said adder cells each comprising: (a) first circuit means to which are supplied as inputs a 1-bit signal x i s and a 1-bit signal y i s which represent the sign of digits x i and y i respectively, said first circuit means determining therefrom and providing as output therefrom a 1-bit signal p i whose value depends upon whether both x i and y i are non-negative, or whether at least one of said digits x i and y i is negative; (b) second circuit means to which are supplied as input a 1-bit signal x i a and a 1-bit signal y i a which represent the magnitude of said digits x i and y i respectively and a signal p i-1 obtained from the first circuit means of the adder cell which operates on the next lower order digits, said second circuit means determining therefrom and providing as output a 1-bit signal u i representing the sum p i-1 +p i ; (c) third circuit means to which are supplied input signals representing the digits x i and y i respectively and said signal p i-1 , said third circuit means determining therefrom and providing as output a 1-bit signal v i representing the difference p i -c i ; and (d) fourth circuit means to which are supplied as input said 1-bit signal u i and a 1-bit signal v i-1 obtained from the third circuit means of the adder cell which operates on the next lower digits, said fourth circuit means determining therefrom and providing as output a 2-bit signal representing the sign and magnitude of the i-th order digit of the sum of x and y expressed as a radix 2 signed-digit number.
Claim 23
Dependent Claim 341 words
In an arithmetic processor which performs arithmetic operations on radix 2 signed-digit numbers each having N digits denoted by an order index which assumes integer values from 1 to N, said arithmetic processor having a plurality of adder cells each of which performs addition operations on an i-th digit x i of a signed-digit augend x and an i-th digit y i of an ordinary binary addend y for a different value of the order index i by first determining an intermediate carry digit c i and an intermediate sum digit s i , and then determining the final sum digit z i by adding the intermediate sum s i to an intermediate carry c i-1 obtained from the adder cell operating on the next lower order digits, wherein each of said digits of said augend are represented by two one-bit signals x i s and x i a respectively representing the sign and magnitude of said digit and each of said digits of said addend are represented by a 1-bit signal y i , said adder cells each comprising: (a) first circuit means to which are supplied signals representative of said digits x i and y i , said first circuit means determining therefrom and providing as output a 1-bit signal u i representing said intermediate sum digit s i ; (b) second circuit means to which are supplied at the signals representative of said digits x i and y i , said second circuit means determining therefrom and providing as an output a 1-bit signal v i representing said intermediate carry c i ; and (c) third circuit means to which are supplied as inputs said 1-bit signal u i and a 1-bit signal v i-1 obtained from the second circuit means of the adder cell which operates on the next lower digits, said third circuit means determining therefrom and providing as output a 2-bit signal representing the sign and magnitude of the i-th digit of the sum of x and y expressed as a radix 2 signed-digit number.
Claim 24
Dependent Claim 341 words
In an arithmetic processor which performs arithmetic operations on radix 2 signed-digit numbers each having N digits denoted by an order index which assumes integer values from 1 to N, said arithmetic processor having a plurality of adder cells each of which performs addition operations on an i-th digit x i of a signed-digit augend x and an i-th digit y i of an ordinary binary addend y for a different value of the order index i by first determining an intermediate carry digit c i and an intermediate sum digit s i , and then determining the final sum digit z i by adding the intermediate sum s i to an intermediate carry c i-1 obtained from the adder cell operating on the next lower order digits, wherein each of said digits of said augend are represented by two one-bit signals x i s and x i a respectively representing the sign and magnitude of said digit and each of said digits of said addend are represented by a 1-bit signal y i , said adder cells each comprising: (a) first circuit means to which are supplied signals representative of said digits x i and y i , said first circuit means determining therefrom and providing as output a 1-bit signal u i representing said intermediate sum digit s i ; (b) second circuit means to which are supplied at the signals representative of said digits x i and y i , said second circuit means determining therefrom and providing as an output a 1-bit signal v i representing said intermediate carry c i ; and (c) third circuit means to which are supplied as inputs said 1-bit signal u i and a 1-bit signal v i-1 obtained from the second circuit means of the adder cell which operates on the next lower digits, said third circuit means determining therefrom and providing as output a 2-bit signal representing the sign and magnitude of the i-th digit of the sum of x and y expressed as a radix 2 signed-digit number.
Claim 25
Dependent Claim 68 words
The arithmetic processor in accordance with claim 19, wherein said first circuit means is supplied with a 1-bit signal x i a which represents the magnitude of said signed-digit x i and a 1-bit signal which represents the ordinary binary digit y i , said first circuit means determining therefrom and providing as output a 1-bit signal u i which represents said intermediate sum digit s i .

References Cited (Backward Citations)

No citation records indexed.

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1992-09-11 1993-03-13 1993-09-12 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1996-09-11 1997-03-13 1997-09-12 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2000-09-11 2001-03-13 2001-09-12 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag