Eckert v. Williams

500 F.2d 1160, 182 U.S.P.Q. (BNA) 554, 1974 CCPA LEXIS 132
CourtCourt of Customs and Patent Appeals
DecidedAugust 1, 1974
DocketPatent Appeal No. 9108
StatusPublished
Cited by1 cases

This text of 500 F.2d 1160 (Eckert v. Williams) is published on Counsel Stack Legal Research, covering Court of Customs and Patent Appeals primary law. Counsel Stack provides free access to over 12 million legal documents including statutes, case law, regulations, and constitutions.

Bluebook
Eckert v. Williams, 500 F.2d 1160, 182 U.S.P.Q. (BNA) 554, 1974 CCPA LEXIS 132 (ccpa 1974).

Opinion

LANE, Judge.

This is an appeal from the decision of the Board of Patent Interferences awarding priority on all counts, counts 2 through 17, in Interference No. 93,544 to Williams et al. (Williams), the senior party. The interference involves Williams’ patent No. 3,012,725, for “Electronic Digital Computing Devices,” granted December 12, 1961, on an application filed July 22, 1957, as a division of an application filed June 1, 1950, and an application of Eckert et al. (Eckert) for a “Binary Automatic Computer” (acronym: BINAC), serial No. 179,782, filed August 16, 1950. We dismiss the appeal as to count 16 and affirm on the other counts.

The questions before the board and still in issue here are: (1) Eckert’s right to make counts 2-15 and 17,1 (2) Williams’ right to the benefit of the filing date of an earlier-filed British provisional application, and (3) Eckert’s alleged conception and diligence, and actual reduction to practice. On the first issue, the board ruled that the Eckert application did not support counts 3-7, 9-12, 14 and 17, but that it did support counts 2, 8, 13 and 15. It denied Williams’ claim to the benefit of the earlier British provisional application. The board additionally ruled that Eckert did not have an actual reduction to practice prior to Williams’ effective filing date of June 1, 1950.

The invention involves an improvement in an electronic* digital computer wherein instruction words may be stored in pairs in a single location in an addressable memory. As the Williams patent indicates, that feature permits use of a reduced number of memory locations and a saving in cost because instruction words in a program frequently involve less than half of the bit positions normally available in each location. The systems of the Williams patent and the Eckert application differ in a manner which will be further explained below. An adequate understanding of the invention may be obtained from inspection of one of the more comprehensive counts, count 11, which reads:

11. An electronic binary digital computing machine including
[a] at least one data word storage device having a plurality of discrete address storage locations each of a digit capacity equal to the digit length of one machine number word,
[b] signal-controlled address selection means for rendering any required one of said address storage locations accessible for reading-out or writing-in thereto under the control of an applied address selection signal defining said required address location,
[c] signal-controlled selection means for restricting the data selected by said address election means to a chosen one of a plurality of integral fractional parts thereof,
[d] a control system for governing the operation of said machine during each computing cycle in accordance with the form of an applied instruction word signal, said instruction signals being each of a digit length equal to one of said integral fractional parts,
[e] said control system including means for selecting a series of in[1162]*1162struction word signals in turn from said data word storage device each under the control of a binary coded instruction address selection signal, said binary coded instruction address selection signal including at least one lowest significant digit providing a control signal for said selections means and at least one further more significant binary digit for providing an address selection control signal to said signal-controlled address selection means, [paragraphing and emphasis added]

The first issue considered by the board was Eckert’s right to make the counts. On that matter, the board stated:

Williams’ principal contention is that although the disclosed Eckert apparatus stores two instruction words at a single address, the one occupying the most significant digits portion is always read out and used first and then the one occupying the least significant digits portion is utilized so that there is no selectivity or choice in the order in which the words are read out and utilized. There seems to be no contention that this is an incorrect interpretation of the Eckert disclosure. Williams urges that all of the counts require selection or choice by virtue of which either of the two words could be read out and used first. Eckert urges, and the Primary Examiner held, that the counts are not limited to require this option.

It then discussed the specific language in each count which Williams urged was unsupported. The board concluded that Eckert did not support counts 3-7, 9-12, 14 and 17, but that counts 2, 8, 13 and 15 were so broad that Eckert could support them.

Before us, Eckert challenges the decision against him as to counts 3-7, 9-12, 14 and 17. While he obviously accepts the board’s favorable decision as to counts 2, 8, 13 and 15, he does not offer any specific supporting argument. Eck-ert does not question the board’s understanding of the operation of his computer. Williams urges in detail, as he did before the primary examiner and then the board, that Eckert has no right to make any of the counts.

Turning to the parties’ disclosures, both Eckert and Williams provide means whereby a pair of instructions, including a left half instruction and a right half instruction, are stored in a single location having a digit capacity of one data word. The Williams computer includes apparatus which permits selective execution of either the left half instruction disposed in the left half of the location or the other instruction disposed in the right half of the location. The non-selected instruction may be either excluded from the program or executed after the selected instruction. In the Eckert BIN AC computer, the multiple instructions in the single location are executed in a fixed order during the machine cycle.

In the Williams computer, after the instruction pair is extracted from memory and entered into the instruction pair holding register, the next step is entirely dependent upon a control bit in the control store. If the control bit has a first value, the left half- instruction is gated from the instruction pair holding register to the L and F staticisor (instruction register) to be executed. If the control bit has a second value, the right half instruction is gated and executed instead. The half of the instruction pair which is not gated out in response to the control bit is not acted upon by any apparatus in the Williams computer. If it is desired subsequently to execute the “other” instruction in the pair of instructions, the Williams computer must go back to the memory again, re-extract the same instruction pair and repeat the selection process. This arrangement provides added flexibility by permitting the use of an instruction half in any sequence relative to its companion half or any instruction half in any other memory location.

[1163]*1163Eckert’s , disclosed computer permits no such flexibility. Once a pair of instructions is entered into the instruction holding register or location, both halves of the pair are invariably gated out and executed in the inflexible sequence of the half in the most significant digits region followed by the half in the least significant digits region.

The board found that counts 3-7, 9-12, 14, and 17 all required that the apparatus offer a selection or choice between the halves or parts of the instruction words of a pair.

Free access — add to your briefcase to read the full text and ask questions with AI

Related

Kroekel v. Shah
558 F.2d 29 (Customs and Patent Appeals, 1977)

Cite This Page — Counsel Stack

Bluebook (online)
500 F.2d 1160, 182 U.S.P.Q. (BNA) 554, 1974 CCPA LEXIS 132, Counsel Stack Legal Research, https://law.counselstack.com/opinion/eckert-v-williams-ccpa-1974.