← Back to Patent Explorer
US3886520A Expired / Lapsed US ⏱️ 0.0 years remaining

Checking circuit for a 1-out-of-n decoder

Assignee: Unisys Corp
•
Filing: 1974-04-03
•
Granted: 1975-05-27
•
Expires: 1994-04-03
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A checking circuit for a 1-out-of-n decoder and a method of the designing thereof is disclosed. The method involves generating a binary table of n rows, 0 through n-1, each row comprising a set of K, 0 or 1, entries, and K columns, 0 through K-1, with a 0 or a 1 entry at each row-column intersection. Associating each of the n sets of entries with an associated one of the n outputs of the decoder, the 0 entries and the 1 entries of each column are coupled to separate pairs of column-associated 0-OR gates and 1OR gates, respectively. The output of each of the pairs of column-associated OR gates are then coupled to a separate columnassociated AND gate, the outputs of which are coupled to a >1-OR gate for indicating that two or more of the decoder outputs are active. The outputs of a pair of column-associated OR gates are coupled to a <1-OR gate for indicating that none of the decoder outputs is active.

Inventors

  • 👤 Bruce A Christensen

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-26 05:21
CPC Classifications
G; G06; G06F; G06F11/00; G06F11/07; G06F11/08; G06F11/085

Claims Analysis

Total Claims: 5
Claim 1
Independent Claim 368 words
A checking circuit for a 1-out-of-n binary decoder where n 2K, n being the number of decoder outputs 0 through n-1 that are to be checked on the associated n decoder output lines 0 through n-1 and n, K being positive integers wherein there is utilized for identification of the input lines associated therewith a binary table of n rows, 0 through n-1, and K columns, 0 through K-1, with a binary 0 or 1 entry at each of the nK row-column intersections, said checking circuit comprising: nK separate input lines, said nK separate input lines arranged into K sets of n column-associated input lines and n sets of K row-associated input lines, each of said nK separate input lines associated with and identified by an associated one of said nK binary entries of said binary table for being identified either as a 0-associated input line or as a 1associated input line as determined by the 0 or 1 binary entry at the associated one of said nK binary entries; means parallel intercoupling the K input lines of each of said n sets of K row-associated input lines for receiving the associated ones of said n decoder outputs; K pairs of column-associated OR gates, each pair comprised of a 0-associated OR gate and a 1-associated OR gate; K column-associated AND gates; a <1 OR gate; a >1 OR gate; means coupling the 0-associated input lines and the 1-associated input lines of each of said K sets of n column-associated input lines to the 0-associated OR gate and the 1-associated OR gate, respectively, of the associated pair of the K pairs of columnassociated OR gates; means coupling the outputs of each pair of the K pairs of column-associated OR gates to an associated one of the K columnassociated AND gates; means coupling the outputs of the K column-associated AND gates to said >1 OR gate for generating the >1 output signal only when two or more of said n decoder outputs are active; means coupling the outputs of any pair of the K pairs of columnassociated OR gates to said <1 OR gate for generating the <1 output signal only when none of said n decoder outputs is active.
Claim 2
Dependent Claim 368 words
A checking circuit for a 1-out-of-n binary decoder where n 2K, n being the number of decoder outputs 0 through n-1 that are to be checked on the associated n decoder output lines 0 through n-1 and n, K being positive integers wherein there is utilized for identification of the input lines associated therewith a binary table of n rows, 0 through n-1, and K columns, 0 through K-1, with a binary 0 or 1 entry at each of the nK row-column intersections, said checking circuit comprising: nK separate input lines, said nK separate input lines arranged into K sets of n column-associated input lines and n sets of K row-associated input lines, each of said nK separate input lines associated with and identified by an associated one of said nK binary entries of said binary table for being identified either as a 0-associated input line or as a 1associated input line as determined by the 0 or 1 binary entry at the associated one of said nK binary entries; means parallel intercoupling the K input lines of each of said n sets of K row-associated input lines for receiving the associated ones of said n decoder outputs; K pairs of column-associated OR gates, each pair comprised of a 0-associated OR gate and a 1-associated OR gate; K column-associated AND gates; a <1 OR gate; a >1 OR gate; means coupling the 0-associated input lines and the 1-associated input lines of each of said K sets of n column-associated input lines to the 0-associated OR gate and the 1-associated OR gate, respectively, of the associated pair of the K pairs of columnassociated OR gates; means coupling the outputs of each pair of the K pairs of column-associated OR gates to an associated one of the K columnassociated AND gates; means coupling the outputs of the K column-associated AND gates to said >1 OR gate for generating the >1 output signal only when two or more of said n decoder outputs are active; means coupling the outputs of any pair of the K pairs of columnassociated OR gates to said <1 OR gate for generating the <1 output signal only when none of said n decoder outputs is active.
Claim 3
Dependent Claim 383 words
A checking circuit for a 1-out-of m binary decoder where m<n 2K, m being the number of decoder outputs 0 through m-1 that are to be checked on the associated m decoder output lines 0 through m-1 and m, n, K being positive integers wherein there is utilized for identification of the input lines associated therewith a binary table of n rows, 0 through n-1, and K columns, 0 through K-1, with a binary 0 or 1 entry at each of the nK row-column intersections, said checking circuit comprising: mK separate input lines, said mK separate input lines arranged into K sets of m column-associated input lines and m contiguous sets of K row-associated input lines, each of said mK separate input lines associated with and identified by an associated one of the mK binary entries in the associated m contiguous sets of K row-associated binary entries of said binary table for being identified either as a 0-associated input line or as a 1-associated input line as determined by the 0 or 1 binary entry at the associated one of said mK binary entries; means parallel intercoupling the K input lines of each of said m sets of K row-associated input lines for receiving the associated ones of said n decoder outputs; K pairs of column-associated OR gates, each pair comprised of a 0-associated OR gate and a 1-associated OR gate; K column-associated AND gates; a <1 OR gate; a >1 OR gate; means coupling the 0-associated input lines and the 1-associated input lines of each of said K sets of m column-associated input lines to the 0-associated OR gate and the 1-associated OR gate, respectively, of the associated pair of the K pairs of column-associated OR gates; means coupling the outputs of each pair of the K pairs of column-associated OR gates to an associated one of the K column-associated AND gates; means coupling the outputs of the K column-associated AND gates to said >1 OR gate for generating the >1 output signal only when two or more of said m decoder outputs are active; means coupling the outputs of any one pair of the K pairs of column-associated OR gates to said <1 OR gate for generating the <1 output signal only when none of said m decoder outputs is active.
Claim 4
Dependent Claim 383 words
A checking circuit for a 1-out-of m binary decoder where m<n 2K, m being the number of decoder outputs 0 through m-1 that are to be checked on the associated m decoder output lines 0 through m-1 and m, n, K being positive integers wherein there is utilized for identification of the input lines associated therewith a binary table of n rows, 0 through n-1, and K columns, 0 through K-1, with a binary 0 or 1 entry at each of the nK row-column intersections, said checking circuit comprising: mK separate input lines, said mK separate input lines arranged into K sets of m column-associated input lines and m contiguous sets of K row-associated input lines, each of said mK separate input lines associated with and identified by an associated one of the mK binary entries in the associated m contiguous sets of K row-associated binary entries of said binary table for being identified either as a 0-associated input line or as a 1-associated input line as determined by the 0 or 1 binary entry at the associated one of said mK binary entries; means parallel intercoupling the K input lines of each of said m sets of K row-associated input lines for receiving the associated ones of said n decoder outputs; K pairs of column-associated OR gates, each pair comprised of a 0-associated OR gate and a 1-associated OR gate; K column-associated AND gates; a <1 OR gate; a >1 OR gate; means coupling the 0-associated input lines and the 1-associated input lines of each of said K sets of m column-associated input lines to the 0-associated OR gate and the 1-associated OR gate, respectively, of the associated pair of the K pairs of column-associated OR gates; means coupling the outputs of each pair of the K pairs of column-associated OR gates to an associated one of the K column-associated AND gates; means coupling the outputs of the K column-associated AND gates to said >1 OR gate for generating the >1 output signal only when two or more of said m decoder outputs are active; means coupling the outputs of any one pair of the K pairs of column-associated OR gates to said <1 OR gate for generating the <1 output signal only when none of said m decoder outputs is active.
Claim 5
Dependent Claim 66 words
The checking circuit of claim 2 in which the number of input lines coupled to each of said column-associated 0-OR gates and said column-associated 1-OR gates is balanced by identifying the m contiguous sets of K row-associated input lines with the m contiguous sets of K row-associated binary entries with the substanTial center of the n sets of K row-associated binary entries of said binary table.

References Cited (Backward Citations)

US3541507A Cited
US3559167A Cited
US3559168A Cited
US3602886A Cited
US3634665A Cited
US3784977A Cited
US3779458A Cited
US3784978A Cited
US3825894A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1978-05-26 1978-11-25 1979-05-27 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1982-05-26 1982-11-25 1983-05-27 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1986-05-26 1986-11-25 1987-05-27 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag