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

Residue to analog converter

Assignee: AG Communication Systems Corp
•
Filing: 1984-09-24
•
Granted: 1986-05-13
•
Expires: 2004-09-24
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A residue to analog converter associated with residue numbers {m1,m2,m3} of the residue number system defined by the moduli set {p1=2 n -1, p2=2 n , p3=2 n +1} and which does not require memory comprises five standard binary adder circuits, apparatus for performing multiplication by bit shifting, and a modulo p1 p3 adder circuit. First and second binary adders combine the residue signals m1 and m3 to produce sum and difference signals which are bit shifted by grounding 2n-1 and n-1 lines, respectively, and locating them as less significant bit lines ahead of these sum and difference signal lines. A modulo p1*p3 adder sums these bit shifted signals. A third binary adder, which ignores overflow, performs a modulo p2=2 n subtraction of m2 from the n less significant bits of the modulo p1*p3 sum signal to produce a second difference signal. This second difference signal is bit shifted by 2n grounded lines that are connected as less significant bit lines ahead of this signal, and then subtracted from this bit shifted signal in a fourth binary adder to produce a correction signal. The modulo p1*p3 sum signal and the correction signal are summed in a fifth binary adder to produce a three dimensional binary signal r(m1,m2,m3) that is representative of a residue signal {m1,m2,m3}. The corresponding analog signal is produced with a standard D/A converter. Structure for implementing the modulo p1*p3 adder circuit with adders that are all standard binary adders is disclosed.

Inventors

  • 👤 Peter S. Bernardson

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-07 05:43
CPC Classifications
H; H03; H03M; H03M7/00; H03M7/14; H03M7/18

Claims Analysis

Total Claims: 28
Claim 1
Independent Claim 279 words
Apparatu"s, which does not require any memory devices, for converting a binary representation of a residue signal {m1,m2,m3} in a prescribed residue number system that is defined by the moduli set {p=2 n -1, p2=2 n , p3=2 n +1}, where n is an integer, to an associated binary output signal r(m1,m2,m3), said apparatus comprising: first means responsive to the residue digit signals m1 and m3 for producing first and second digital output signals which are binary representations of the sum and difference of m1 and m3; second means for producing a third binary signal corresponding to the product of the first signal and the constant (2 2n-1 ); third means for producing a fourth output signal corresponding to the product of the second signal and the constant (2 n-1 ); fourth means summing said third and fourth signals modulo p1*p3 for producing a fifth output signal on a plurality of output lines which is a binary representation of the modulo p1*p3 sum of products of the residue digit signals m1 and m3 and associated constants S3 and S1, where S1=p1*p2/2 and S3=p2*p3/2; fifth means responsive to bits of the fifth output signal of said fourth means and the residue digit signal m2 for producing a sixth output signal which is the modulo p2 difference therebetween; sixth means producing a seventh output signal which is the product of the sixth output signal of said fifth means and the constants p1 and p3; and seventh means responsive to the fifth and seventh output signals from said fourth and sixth means for producing the binary output signal r(m1,m2,m3) which is the sum thereof and which corresponds to the residue signal {m1,m2,m3}.
Claim 2
Dependent Claim 279 words
Apparatu"s, which does not require any memory devices, for converting a binary representation of a residue signal {m1,m2,m3} in a prescribed residue number system that is defined by the moduli set {p=2 n -1, p2=2 n , p3=2 n +1}, where n is an integer, to an associated binary output signal r(m1,m2,m3), said apparatus comprising: first means responsive to the residue digit signals m1 and m3 for producing first and second digital output signals which are binary representations of the sum and difference of m1 and m3; second means for producing a third binary signal corresponding to the product of the first signal and the constant (2 2n-1 ); third means for producing a fourth output signal corresponding to the product of the second signal and the constant (2 n-1 ); fourth means summing said third and fourth signals modulo p1*p3 for producing a fifth output signal on a plurality of output lines which is a binary representation of the modulo p1*p3 sum of products of the residue digit signals m1 and m3 and associated constants S3 and S1, where S1=p1*p2/2 and S3=p2*p3/2; fifth means responsive to bits of the fifth output signal of said fourth means and the residue digit signal m2 for producing a sixth output signal which is the modulo p2 difference therebetween; sixth means producing a seventh output signal which is the product of the sixth output signal of said fifth means and the constants p1 and p3; and seventh means responsive to the fifth and seventh output signals from said fourth and sixth means for producing the binary output signal r(m1,m2,m3) which is the sum thereof and which corresponds to the residue signal {m1,m2,m3}.
Claim 3
Dependent Claim 23 words
Apparatus according to claim 1 further comprising a digital to analog converter for producing an analog signal corresponding to the residue signal {m1,m2,m3}.
Claim 4
Dependent Claim 14 words
Apparatus according to claim 1 wherein said seventh means comprises a first adder means.
Claim 5
Dependent Claim 15 words
Apparatus according to claim 3 wherein said first adder means comprises a first binary adder.
Claim 6
Dependent Claim 32 words
Apparatus according to claim 4 wherein said fifth means is responsive to the n less significant bits in the fifth output signal of said fourth means for producing the prescribed difference signal.
Claim 7
Dependent Claim 15 words
Apparatus according to claim 5 wherein said fifth means comprises a second adder circuit means.
Claim 8
Dependent Claim 22 words
Apparatus according to claim 6 wherein said second adder circuit means comprises a first modulo adder which operates modulo 2 n .
Claim 9
Dependent Claim 15 words
Apparatus according to claim 7 wherein said second adder means comprises a second binary adder.
Claim 10
Dependent Claim 30 words
Apparatus according to claim 8 wherein said second adder means comprises a second binary adder which ignores any overflow produced by a carry that is generated during the operation thereof.
Claim 11
Dependent Claim 37 words
App tus according to claim 6, wherein said first means comprises third and fourth adder circuit means which are each responsive to the residue signals m1 and m3 for producing the specified sum and difference signals, respectively.
Claim 12
Dependent Claim 19 words
Apparatus according to claim 10 wherein said third and fourth adder means comprise third and fourth binary adders, respectively.
Claim 13
Dependent Claim 15 words
Apparatus according to claim 11 wherein said second adder means comprises a second binary adder.
Claim 14
Dependent Claim 45 words
Apparatus according to claim 12 wherein said second means comprises first bit shifting means which is operative for inserting binary 0's as the 2n-1 less significant bits ahead of the first output signal in said third output signal which is a first bit shifted signal.
Claim 15
Dependent Claim 45 words
Apparatus according to claim 13 wherein said third means comprises second bit shifting means which is operative for inserting binary 0's as the n-1 less significant bits ahead of the second output signal in said fourth output signal which is a second bit shifted signal.
Claim 16
Dependent Claim 36 words
Apparatus according to claim 14 wherein said fourth means comprises a second modulo adder circuit which performs a modulo p1*p3 summation of the first and second bit shifted (product) signals from said second and third means.
Claim 17
Dependent Claim 41 words
Apparatus according to claim 15 wherein said sixth means comprises third bit shifting means for inserting 2n binary 0's as less significant bits ahead of the sixth output signal of said fifth means for producing an associated third bit shifted signal.
Claim 18
Dependent Claim 40 words
Apparatus according to claim 16 wherein said sixth means further comprises eighth means responsive to the third bit shifted signal and the sixth output signal of said fifth means for producing a seventh output signal which is the difference between.
Claim 19
Dependent Claim 14 words
Apparatus according to claim 17 wherein said eighth means comprises a fifth binary adder.
Claim 20
Dependent Claim 221 words
Apparatus according to claim 15 wherein said second modulo (p1*p3) adder circuit comprises: eighth means operative for summing the third and fourth signals for producing an eighth binary signal; ninth means responsive to bits of the eighth signal for producing a ninth binary signal which is proportional to the product of a constant 2 2n and the integer part of the eighth signal divided by 2 2n ; tenth means responsive to the ninth signal and bits of the eighth signal for producing a tenth binary signal which is proportional to the difference between the ninth signal and the integer part of the eighth signal divided by 2 2n ; eleventh means responsive to the eighth signal and the tenth signal for producing an eleventh binary signal which is proportional to the difference therebetween; twelfth means for generating a twelfth binary signal that is proportional to a constant (2 2n -1); thirteenth means responsive to the eleventh and twelfth signals for passing the twelfth signal as an output signal thereof only when said eleventh signal is greater than or equal to said twelfth binary signal representation of said constant (2 2n -1); and fourteenth means responsive to the eleventh signal and the output signal of said thirteenth means for producing the fifth binary signal which is proportional to the difference therebetween.
Claim 21
Dependent Claim 14 words
Apparatus according to claim 19 wherein said eighth means comprises a fifth binary adder.
Claim 22
Dependent Claim 14 words
Apparatus according to claim 20 wherein said tenth means comprises a sixth binary adder.
Claim 23
Dependent Claim 50 words
Apparatus according to claim 21 further comprising fifteenth means coupling a prescribed number of more significant bits of the eighth signal, which correspond to the integer part of the eighth signal divided by 2 2n , as a thirteenth signal to a difference input terminal of said sixth binary adder.
Claim 24
Dependent Claim 59 words
Apparatus according to claim 22 wherein said ninth means inserts 2n binary 0's as less significant bits ahead of said more significant bits of the thirteenth signal to produce the ninth signal that is a third bit shifted signal that corresponds to a product signal and which is applied to a sum input terminal of said sixth binary adder.
Claim 25
Dependent Claim 14 words
Apparatus according to claim 23 wherein said fourteenth means comprises a seventh binary adder.
Claim 26
Dependent Claim 84 words
Apparatus according to claim 24 wherein said thirteenth means comprises: comparator means operative for producing a fourteenth binary output signal of other and one values when the eleventh signal is less than and is greater than or equal to said twelfth signal which is the constant (2 2n -1), respectively; and gate means responsive to other and one values of the fourteenth output signal of said comparator means for blocking and passing, respectively, the twelfth binary signal representation of said constant (2 2n -1).
Claim 27
Dependent Claim 13 words
Apparatus according to claim 25 wherein said gate means comprises an AND-gate circuit.
Claim 28
Dependent Claim 17 words
Apparatus according to claim 25 wherein said third and fourth signals comprise 3n+1 and 2n binary bits.

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) 1989-05-12 1989-11-11 1990-05-13 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1993-05-12 1993-11-11 1994-05-13 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1997-05-12 1997-11-11 1998-05-13 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag