In re Benson

441 F.2d 682, 58 C.C.P.A. 1134, 169 U.S.P.Q. (BNA) 548, 1971 CCPA LEXIS 348
CourtCourt of Customs and Patent Appeals
DecidedMay 6, 1971
DocketNo. 8376
StatusPublished
Cited by19 cases

This text of 441 F.2d 682 (In re Benson) 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
In re Benson, 441 F.2d 682, 58 C.C.P.A. 1134, 169 U.S.P.Q. (BNA) 548, 1971 CCPA LEXIS 348 (ccpa 1971).

Opinion

Rich, Judge,

delivered the opinion of the court.

This appeal is from the January 31, 1968 decision of the Patent Office Board of Appeals1 affirming the rejection of claims 8 and 13, the only claims remaining in appellants’ application serial ISTo. 315,-050, filed October 9, 1963, and assigned to Bell Telephone Laboratories Incorporated, entitled “Conversion of Numerical Information.” We reverse.

The Inve,ntw\n

The invention of the appealed claims is in the field of computer technology and relates to data processing systems. The claims are both directed to methods. The opening sentence of the specification states that the invention relates to the processing of data by program and more particularly to the programed conversion of numerical information. The particular conversion to which both of the claims on appeal are directed is the conversion of “binary coded decimal” (BCD) numerical information in the form of “signals” (claim 8) or “representations” (claim 13) into binary number signals or representations, respectively. Though we presume this statement would be an adequate explanation to those skilled in the computer art, for the benefit of those not so skilled we will elucidate further.

[1136]*1136Most digital computers perform their computing operations on information in binary form, a system of representation having only two elementary constituents, called “bits,” indicated by “1” and “0”. Men, on the other hand, are accustomed to quantitative information in decimal form and, for the computer to work on or utilize it, it must be converted into binary form. It has become a general practice to make this conversion in two stages: from decimal to BCD; from BCD to binary. The following table shows the ten familiar decimal digits and their binary equivalents expressed in groups of four bits:

Decimal Binary Decimal Binary
0_. 0000 5 0101
1-0001 6 0110
2_. 0010 7 0111
3-0011 8 1000
4 0100 9-1001

In BCD notation the decimal number 53 would be represented as 0101 0011, the binary form of 5 followed by the binary form of 3, each group of four bits being a BCD “digit.” Although the BCD notation is in terms of “1” and “0” only and can be represented in a binary machine, it is not in a form in which the machine can utilize it to perform its computing operations. In true binary the decimal number 53 is represented by 110101. The problem is to convert the intermediate BCD representation into the true binary. Various ways of doing this were known prior to appellants’ invention. They claim to have discovered a better and simpler way of doing it having various advantages recited in the specification such as reducing the number of steps required to be taken, dispensing with the repetitive storing and retrieval of partially converted information, eliminating the need for interchanging signals among various equipment components and the need for auxiliary equipment, and decreasing the chance of error.

The digital computer which is to receive the information in BCD form can itself be programed to convert it into binary form. The specification gives as an illustrative example an actual program for converting a binary-coded decimal number to ordinary binary and apparatus is described in conventional block diagram form in which the program can be carried out.

The two claims on appeal read as follows:

8. The method of converting signals from binary coded decimal form into binary which comprises the steps of
(1) storing the binary coded decimal signals in a reentrant shift register,
(2) shifting the signals to the right by at least three places, until there is a binary “1” in the second position of said register,
(3) masking out said binary “1” in said second position of said register,
[1137]*1137(4) adding a binary “1” to the first position of said register,
(5) shifting the signals to the left by two positions,
(6) adding a “1” to said first position, and
(7) shifting the signals to the right by at least three positions in preparation for a succeeding binary “1” in the second position of said register.
13. A data processing method for converting binary coded decimal number representations into binary number representations comprising the steps of
(1) testing each binary digit position i, beginning with the least significant binary digit position, of the most significant decimal digit representation for a binary “0” or a binary “1” ;
(2) if a binary “0” is detected, repeating step (1) for the next least significant binary digit position of said most significant decimal digit representation;
(3) if a binary “1” is detected, adding a binary “1” at the (i + l)th and (i + 3)th least significant binary digit positions of the next lesser significant decimal digit representation, and repeating step (1) for the next least significant binary digit position of said most significant decimal digit representation;
(4) upon exhausting the binary digit positions of said most significant decimal digit representation, repeating steps (1) through (3) for the next lesser significant decimal digit representation as modified by the previous execution of steps (1) through (3) ; and
(5) repeating steps (1) through (4) until the second least significant decimal digit representation has been so processed.

As to these claims, no prior art is cited and no question is raised as to utility, novelty, or unobviousness. The asserted advantages and the implicit advance resulting therefrom in the data-processing art have not been questioned.

The Rejection

The first problem it is necessary to settle is what the ground or grounds of rejection is or are. Appellants’ brief correctly states “The only explicit rejection outstanding against claims 8 and T3 is the rejection on the grounds [sic] that these claims are directed to subject matter not embraced by Section 101.” Study of the two Examiner’s Answers makes it clear that that was the only ground he relied on. In his first Answer the examiner specified that “all grounds of rejection are withdrawn except the art rejections and nonstatutory subject matter rejections.” We no longer have any art rejections. In his second Answer, on remand, he said:

In summary, the remaining ground of rejection of claims 8 and 13 now in the case is that these claims are directed to non-statutory subject matter.

In reciting what the rejection was, the board opinion says:

Claims 8 and 13 stand rejected as for subject matter not embraced by 35 U.S.O. 101 in that they set forth “mental processes” and “mathematical steps,” neither being an “art” as construed by a long line of decisions * * *.

[1138]*1138Nowhere does the board opinion indicate that any new ground of rejection is being made.

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

Related

CLS Bank International v. Alice Corp. Pty. Ltd.
717 F.3d 1269 (Federal Circuit, 2013)
Diamond v. Diehr
450 U.S. 175 (Supreme Court, 1981)
Arshal v. United States
621 F.2d 421 (Court of Claims, 1980)
In re Gelnovatch
595 F.2d 32 (Customs and Patent Appeals, 1979)
In re Toma
575 F.2d 872 (Customs and Patent Appeals, 1978)
In re de Castelet
562 F.2d 1236 (Customs and Patent Appeals, 1977)
In re Chatfield
545 F.2d 152 (Customs and Patent Appeals, 1976)
In re Christensen
478 F.2d 1392 (Customs and Patent Appeals, 1973)
Gottschalk v. Benson
409 U.S. 63 (Supreme Court, 1972)
In re Miles
463 F.2d 1401 (Customs and Patent Appeals, 1972)
In re Waldbaum
457 F.2d 997 (Customs and Patent Appeals, 1972)
Application of Malcolm D. McIlroy
442 F.2d 1397 (Customs and Patent Appeals, 1971)

Cite This Page — Counsel Stack

Bluebook (online)
441 F.2d 682, 58 C.C.P.A. 1134, 169 U.S.P.Q. (BNA) 548, 1971 CCPA LEXIS 348, Counsel Stack Legal Research, https://law.counselstack.com/opinion/in-re-benson-ccpa-1971.