DETAILED ACTION
Notice of Pre-AIA or AIA Status
The present application, filed on or after March 16, 2013, is being examined under the first inventor to file provisions of the AIA .
Claims 1-18 are pending in this application. Claims 1-2, 9-11 and 18 are currently amended; clams 3-8 and 12-17 are original.
Remarks
Applicant is reminded of manner of making amendments in the specification. C.F.R. 1.121(b)(1)(ii) states “The full text of any replacement paragraph with markings to show all the changes relative to the previous version of the paragraph. The text of any added subject matter must be shown by underlining the added text. The text of any deleted matter must be shown by strike-through except that double brackets placed before and after the deleted characters may be used to show deletion of five or fewer consecutive characters. The text of any deleted subject matter must be shown by being placed within double brackets if strike-through cannot be easily perceived”. The amendments to the specification in page 8-9 do not have any markings to show all the changes relative to the previous version of the paragraph.
Furthermore, the amendments to the specification is not in compliance with C.F.R. 1.121(h) which states “Each section of an amendment document (e.g., amendment to the claims, amendment to the specification, replacement drawings, and remarks) must begin on a separate sheet”.
Examiner also notes that there are multiple amendments to the specification in page 9-10 and 11-13. Furthermore, the marked up portions of the specification in page 11-13 are inconsistent with the replacement paragraph in page 9-10.
Information Disclosure Statement
The information disclosure statement (IDS) submitted on 03/30/2026 and 09/30/2026 are in compliance with the provisions of 37 CFR 1.97. Accordingly, the information disclosure statement is being considered by the examiner.
Drawings
The drawings are objected to as failing to comply with 37 CFR 1.84(p)(5) because they do not include the following reference sign(s) mentioned in the description: 410 mentioned in paragraphs [0049].
Corrected drawing sheets in compliance with 37 CFR 1.121(d) are required in reply to the Office action to avoid abandonment of the application. Any amended replacement drawing sheet should include all of the figures appearing on the immediate prior version of the sheet, even if only one figure is being amended. Each drawing sheet submitted after the filing date of an application must be labeled in the top margin as either “Replacement Sheet” or “New Sheet” pursuant to 37 CFR 1.121(d). If the changes are not accepted by the examiner, the applicant will be notified and informed of any required corrective action in the next Office action. The objection to the drawings will not be held in abeyance.
Claim Objections
Claims 9, 11 and 18 are objected to under 37 C.F.R. 1.71(a) which requires “full, clear, concise, and exact terms” as to enable any person skilled in the art or science to which the invention or discovery appertains, or with which it is most nearly connected, to make and use the same. The following should be corrected.
A. In claim 9 at the last two lines “a third floating-point binary value and a fourth floating-point binary value” should read “[[a]] the third floating-point binary value and [[a]] the fourth floating-point binary value” instead because a third floating-point binary value and a fourth floating-point binary value is already introduced in line 2. Claim 18 recites a similar limitation and is objected to for the same reason.
In claim 11 lines 3-4, “converting the first floating-point binary value including to the first logarithmic binary value:” should read “converting the first floating-point binary value including:” instead for better clarity.
Claim Rejections - 35 USC § 112
The following is a quotation of 35 U.S.C. 112(b):
(b) CONCLUSION.—The specification shall conclude with one or more claims particularly pointing out and distinctly claiming the subject matter which the inventor or a joint inventor regards as the invention.
The following is a quotation of 35 U.S.C. 112 (pre-AIA ), second paragraph:
The specification shall conclude with one or more claims particularly pointing out and distinctly claiming the subject matter which the applicant regards as his invention.
Claims 9 and 18 are rejected under 35 U.S.C. 112(b) or 35 U.S.C. 112 (pre-AIA ), second paragraph, as being indefinite for failing to particularly point out and distinctly claim the subject matter which the inventor or a joint inventor (or for applications subject to pre-AIA 35 U.S.C. 112, the applicant), regards as the invention.
Claim 9 recites “the fourth logarithmic binary value” in line 7; and “the second shifted bias value” in line 10. There is insufficient antecedent basis for these limitations in the claim. For purposes of examination, these are interpreted as “a fourth logarithmic binary value” and “a second shifted bias value” respectively. Claim 18 recites a similar limitation and is rejected for the same reason.
Claim Rejections - 35 USC § 101
35 U.S.C. 101 reads as follows:
Whoever invents or discovers any new and useful process, machine, manufacture, or composition of matter, or any new and useful improvement thereof, may obtain a patent therefor, subject to the conditions and requirements of this title.
Claims 1-18 are rejected under 35 U.S.C. 101 because the claimed invention is directed to an abstract idea without significantly more.
Under Step 1, claims 1-9 recite a system and, therefore, is a machine. Claims 10-18 recite a series of steps and, therefore, is a process.
Under Step 2A prong 1, claim 1 recites
A system comprising: an integrated circuit including a hardware inexact floating-point logarithmic number system (FPLNS) multiplier configured to perform FPLNS functions without lookup tables or piecewise-linear approximation tables, the integrated circuit configured to:
access registers containing a first floating-point binary value and a first logarithmic binary value of the first floating-point binary value, each of the first floating-point binary value and the first logarithmic binary value being in an FPLNS data format, the first floating-point binary value in the FPLNS format including a sign bit followed by exponent bits, the exponent bits followed by mantissa bits;
access registers containing a second floating-point binary value and a second logarithmic binary value of the second floating-point binary value, each of the second floating-point binary value and the second logarithmic binary value being in the FPLNS data format;
multiplying, by the FPLNS multiplier, the first floating-point binary value and the second floating-point binary value, the FPLNS multiplier configured to:
add, by the FPLNS multiplier, the first logarithmic binary value to the second logarithmic binary value to form a first logarithmic sum,
shift a bias constant by a number of bits of the mantissa of the first floating-point binary value to form a first shifted bias value,
subtract a correction factor from the first shifted bias value to form a first corrected bias value, and
subtract the first corrected bias value from the first logarithmic sum to form a first result; and
the integrated circuit being further configured to perform an antilogarithm on the first result to generate a multiplication result of the multiplication of the first floating-point binary value and the second floating-point binary value.
The above underlined limitations of calculating a product of a first floating-point value and a second floating-point value using their respective logarithmic value to perform the multiplication using add, shift, subtract and antilogarithm operations amounts to processing mathematical relationships/calculations and falls within the “Mathematical Concepts” and “Mental Processes” grouping of abstract ideas. The step of “multiplying” including the sub-steps of “add”, “shift”, “subtract”, “subtract” and “perform an antilogarithm” is a process that under its broadest reasonable interpretation, covers performance of the limitation in the mind. That is, other than reciting “by the FPLNS multiplier” and “the integrated circuit”, nothing in the claim element precludes the step from practically being performed in the human mind. For example, but for the reciting “by the FPLNS multiplier” and “the integrated circuit” language, the claim encompasses manually multiplying a first and second binary floating-point numbers by converting the first and second binary floating-point numbers into first and second binary logarithmic numbers; adding the first and second binary logarithmic numbers to generate a sum; shifting a bias constant by the number of bits of the mantissa of the first binary floating-point number to generate a shifted bias constant, subtracting a correction factor from the shifted bias constant to generate a corrected bias value; subtracting the corrected bias value to the sum to generate a corrected sum; and taking an antilogarithm of the corrected sum to generate the product of the first and second binary floating-point numbers as described in at least Figs. 7A-7B and paragraphs [0078 and 0084-0085] using pen and paper. Accordingly, the claim is directed to recite an abstract idea.
Under step 2A prong 2, the claim recites the following additional elements: an integrated circuit including a hardware inexact floating-point logarithmic number system (FPLNS) multiplier without lookup tables or piecewise-linear approximation tables, the integrated circuit configured to: access registers containing a first floating-point binary value and a first logarithmic binary value of the first floating-point binary value; access registers containing a second floating-point binary value and a second logarithmic binary value of the second floating-point binary value. However, the additional elements of “an integrated circuit”, “a hardware inexact floating-point logarithmic number system (FPLNS) multiplier without lookup tables or piecewise-linear approximation tables” and “registers” are recited at a high-level of generality (i.e., as an integrated circuit comprising a generic FPLNS multiplier without reciting any particular configuration with specific circuit structure of the FLPNS multiplier (the limitation of without lookup tables or piecewise-linear approximation tables is a negative limitation that describes what the multiplier does not comprise of rather than what the multiplier is comprised of); and as generic registers for storing data) such that they amount to no more than merely reciting the words “apply it” (or an equivalent) with the judicial exception or merely as tools to implement the abstract idea. The additional elements of “access registers containing a first floating-point binary value and a first logarithmic binary value of the first floating-point binary value” and “access registers containing a second floating-point binary value and a second logarithmic binary value of the second floating-point binary value” are merely adding insignificant extra-solution activities, i.e. mere data gathering. The additional elements do not, individually or in combination, integrate the exception into a practical application. Accordingly, the claim is not integrated into a practical application.
Under step 2B, claim 1 does not include additional elements that, individually or in combination, are sufficient to amount to significantly more than the judicial exception. As discussed above with respect to integration of the abstract idea into a practical application, the additional elements of “an integrated circuit”, “a hardware inexact floating-point logarithmic number system (FPLNS) multiplier without lookup tables or piecewise-linear approximation tables” and “registers” are recited at a high-level of generality (i.e., as an integrated circuit comprising a generic FPLNS multiplier without reciting any particular configuration with specific circuit structure of the FLPNS multiplier (the limitation of without lookup tables or piecewise-linear approximation tables is a negative limitation that describes what the multiplier does not comprise of rather than what the multiplier is comprised of); and as generic registers for storing data) such that they amount to no more than merely reciting the words “apply it” (or an equivalent) with the judicial exception or merely as tools to implement the abstract idea. The additional elements of “access registers containing a first floating-point binary value and a first logarithmic binary value of the first floating-point binary value” and “access registers containing a second floating-point binary value and a second logarithmic binary value of the second floating-point binary value” are merely adding insignificant extra-solution activities, i.e. mere data gathering. See MPEP 2106.05(d)(II) which states that the courts have recognized computer functions such as “Receiving or transmitting data over a network” and “Storing and retrieving information in memory” as well‐understood, routine, and conventional functions when they are claimed in a merely generic manner (e.g., at a high level of generality) or as insignificant extra-solution activity. The claim does not recite additional elements that alone or in combination amount to an inventive concept. Accordingly, the claim does not amount to significantly more than the abstract idea.
Under step 2A prong 1, claims 2-9 recite the same abstract idea as claim 1 by reason of dependence. Further, claim 2 recites further abstract idea of “convert the first floating-point binary value to the first logarithmic binary value comprising: determine a base-2 logarithm of a quantity of one plus a mantissa of the first floating-point binary value to form a first log quantity, add the first log quantity to the exponent of the first floating-point binary value to form a first total, and subtract the bias constant from the first total to form the first logarithmic binary value, and convert the second floating-point binary value to the second logarithmic binary value, the first floating-point binary value being in the FPLNS format, convert the second floating-point binary value to the second logarithmic binary value comprising: determine a base-2 logarithm of a quantity of one plus a mantissa of the second floating-point binary value to form a second log quantity, add the second log quantity to the exponent of the second floating-point binary value to form a second total, and subtract the bias constant from the second total to form the second logarithmic binary value”; claim 3 recites further details of the abstract idea of “the multiplication result being in the FPLNS format”; claim 4 recites further details of the abstract idea of “the bias constant being 2(E-1)-1, where E is the number of bits in the exponent of the first floating-point binary value in the FPLNS format”; claim 6 recites further details of the abstract idea of “wherein the correction factor is within a range of 0.04 to 0.06”; claim 7 recites further details of the abstract idea of “wherein the exponent bits of the first floating-point binary value in the FPLNS format are positioned such that a highest exponent bit of the exponent bits is closest to the sign bit and a lowest exponent bit is closest to the mantissa bits, the mantissa bits of the first floating-point binary value of the FPLNS format being positioned such that the highest mantissa bit of the mantissa bits is closest to the exponent bits and the lowest mantissa bit is farthest from the exponent bits”; claim 8 recites further details of the abstract idea of “wherein the exponent bits of the first logarithmic binary value in the FPLNS format are positioned such that the highest exponent bit of the exponent bits is closest to the sign bit and the lowest exponent bit is closest to the mantissa bits, the mantissa bits of the first logarithmic binary value of the FPLNS format being positioned such that the highest mantissa bit of the mantissa bits is closest to the exponent bits and the lowest mantissa bit is farthest from the exponent bits”; claim 9 recites further abstract idea of “divide a third floating-point binary value and a fourth floating-point binary value, the third floating-point binary value and the fourth floating-point binary value being in the FPLNS data format, divide the third floating-point binary value and the fourth floating-point binary value by: subtracting a third logarithmic binary value of the third floating-point binary value from the fourth logarithmic binary value of the fourth floating-point binary value to form a first logarithmic difference, shifting the bias constant by a number of bits of the mantissa of the third floating-point binary value to form the second shifted bias value, subtracting the correction factor from the second shifted bias value to form a second corrected bias value, and adding the second corrected bias value from the first logarithmic difference to form a second result; and perform an antilogarithm on the second result to generate a division result of the division of the third floating-point binary value and the fourth floating-point binary value” which falls within the “Mathematical Concepts” and/or “Mental Processes” grouping of abstract ideas. In particular claims 3-4 and 6-9 do not include additional elements that would require further analysis under step 2A prong 2 and step 2B. Accordingly, the claims are directed to recite an abstract idea.
Under step 2A prong 2, claim 2 recites the following additional elements: a processor. Claim 5 recites the following additional elements “retrieves the correction factor from one or more registers that do not contain the first floating-point binary value, the first logarithmic binary value, the second floating-point binary value, and the second logarithmic binary value”. However, the additional elements of “a processor” in claim 2; and “one or more registers “ in claim 5 are recited at a high-level of generality (i.e., as a generic processor for converting a data format for the first and second floating-point values to the first and second logarithmic values; and as generic registers for storing data) such that they amount to no more than mere instructions using a generic computer component or merely as tools to implement the abstract idea. The additional elements of “retrieves the correction factor from one or more registers that do not contain the first floating-point binary value, the first logarithmic binary value, the second floating-point binary value, and the second logarithmic binary value” in claim 5 is merely adding insignificant extra-solution activity, i.e. mere data gathering. The additional elements do not, individually or in combination, integrate the exception into a practical application. Accordingly, the claims are not integrated into a practical application.
Under step 2B, claims 2 and 5 does not include additional elements that, individually or in combination, are sufficient to amount to significantly more than the judicial exception. As discussed above with respect to integration of the abstract idea into a practical application, the additional elements of “a processor” in claim 2; and “one or more registers “ in claim 5 are recited at a high-level of generality (i.e., as a generic processor for converting a data format for the first and second floating-point values to the first and second logarithmic values; and as generic registers for storing data) such that they amount to no more than mere instructions using a generic computer component or merely as tools to implement the abstract idea. The additional elements of “retrieves the correction factor from one or more registers that do not contain the first floating-point binary value, the first logarithmic binary value, the second floating-point binary value, and the second logarithmic binary value” in claim 5 is merely adding insignificant extra-solution activity, i.e. mere data gathering. See MPEP 2106.05(d)(II) which states that the courts have recognized computer functions such as “Receiving or transmitting data over a network” and “Storing and retrieving information in memory” as well‐understood, routine, and conventional functions when they are claimed in a merely generic manner (e.g., at a high level of generality) or as insignificant extra-solution activity. The claims do not recite additional elements that alone or in combination amount to an inventive concept. Accordingly, the claims do not amount to significantly more than the abstract idea.
Regarding claims 10-18, they are directed to a method practiced by the system of claims 1-9 respectively. All steps performed by the method of claims 10-18 would be practiced by the system of claims 1-9 respectively. Claims 1-9 analysis applies equally to claims 10-18 respectively.
Allowable Subject Matter
Claims 1-18 would be allowable if rewritten to overcome the 35 U.S.C. 101 rejection discussed above, and if claims 9 and 18 are rewritten to overcome the 35 U.S.C. 112(b) rejection discussed above.
The following is a statement of reasons for the indication of allowable subject matter:
The reasons for the indication of allowable subject matter are the same reasons provided in the non-final office action submitted on 03/18/2026.
Response to Arguments
Applicant’s amendments has not addressed all the objection to the drawings and the claims. Further, the amendments made raise new objection to the claims discussed above.
Applicant’s amendments has not addressed the 35 U.S.C. 112(b) rejection of claims 9 and 18 as discussed above.
Applicant has amended the last two lines of claims 9 and 18 instead of lines 7 and 10. See remarks page 14 top where Applicant amended the instance of “the third floating-point binary value and the fourth floating-point binary value” rather than the instances of “the fourth logarithmic binary value” in line 7; and “the second shifted bias value” in line 10.
In view of Applicant’s submission of a terminal disclaimer, the nonstatutory double patenting rejections have been withdrawn.
Applicant’s arguments, see remarks page 14-15, filed 09/18/2026, with respect to the 35 U.S.C. 101 rejection of claims 1-18 have been fully considered but they are not persuasive.
Applicant argues the following:
1.) claim 1 recites a particular machine because claim 1 recites that the FPLNS multiplier performs multiplication without lookup tables or piecewise-linear approximation tables which is an unconventional arrangement of hardware components of the FPLNS multiplier which achieves a 90% reduction in circuit size, 68% reduction in power, and 55% reduction in latency compared to a standard floating-point multiplier as disclosed in paragraph [0040].
Response: Examiner respectfully disagrees. Claim 1 does not recite a particular machine. Claim 1 is merely reciting what the FPLNS multiplier is not comprised of rather than a specific circuit configuration of the FPLNS multiplier with particular structural arrangement. In contrast, the FPLNS multiplier is recited as a black box design without reciting any internal structure and interconnections between the internal structures such that it amounts to no more than merely reciting the words “apply it” to implement the abstract idea. Furthermore, the alleged improvement in size, power consumption and latency is a result of performing the multiplication in the logarithmic domain in which the floating-point multiplication is approximated by shift and add operations in the logarithmic domain (see at least paragraphs [0029, 0043, 0046]) as evidenced by comparing FPLNS multiplier to a standard floating-point multiplier rather than to a standard FPLNS multiplier which is an improvement in the abstract idea rather than an improvement to the technology itself.
Conclusion
Applicant's amendment necessitated the new ground(s) of rejection presented in this Office action. Accordingly, THIS ACTION IS MADE FINAL. See MPEP § 706.07(a). Applicant is reminded of the extension of time policy as set forth in 37 CFR 1.136(a).
A shortened statutory period for reply to this final action is set to expire THREE MONTHS from the mailing date of this action. In the event a first reply is filed within TWO MONTHS of the mailing date of this final action and the advisory action is not mailed until after the end of the THREE-MONTH shortened statutory period, then the shortened statutory period will expire on the date the advisory action is mailed, and any nonprovisional extension fee (37 CFR 1.17(a)) pursuant to 37 CFR 1.136(a) will be calculated from the mailing date of the advisory action. In no event, however, will the statutory period for reply expire later than SIX MONTHS from the mailing date of this final action.
Any inquiry concerning this communication or earlier communications from the examiner should be directed to Carlo Waje whose telephone number is (571)272-5767. The examiner can normally be reached 9:00-6:00 M-F.
Examiner interviews are available via telephone, in-person, and video conferencing using a USPTO supplied web-based collaboration tool. To schedule an interview, applicant is encouraged to use the USPTO Automated Interview Request (AIR) at http://www.uspto.gov/interviewpractice.
If attempts to reach the examiner by telephone are unsuccessful, the examiner’s supervisor, James Trujillo can be reached at (571) 272-3677. The fax phone number for the organization where this application or proceeding is assigned is 571-273-8300.
Information regarding the status of published or unpublished applications may be obtained from Patent Center. Unpublished application information in Patent Center is available to registered users. To file and manage patent submissions in Patent Center, visit: https://patentcenter.uspto.gov. Visit https://www.uspto.gov/patents/apply/patent-center for more information about Patent Center and https://www.uspto.gov/patents/docx for information about filing in DOCX format. For additional questions, contact the Electronic Business Center (EBC) at 866-217-9197 (toll-free). If you would like assistance from a USPTO Customer Service Representative, call 800-786-9199 (IN USA OR CANADA) or 571-272-1000.
/Carlo Waje/Examiner, Art Unit 2151 (571)272-5767