Prosecution Insights
Last updated: October 02, 2026
Application No. 18/148,984

FLOATING-POINT UNIT WITH A FUSED MULTIPLY-ADD (FMA) ENGINE FOR GENERATING BINARY INTEGER OUTPUT OR FLOATING POINT OUTPUT BASED ON A SELECTOR

Non-Final OA §103
Filed
Dec 30, 2022
Priority
Oct 19, 2022 — provisional 63/380,231
Examiner
YAARY, MICHAEL D
Art Unit
Tech Center
Assignee
International Business Machines Corporation
OA Round
1 (Non-Final)
87%
Grant Probability
Favorable
1-2
OA Rounds
0m
Est. Remaining
95%
With Interview

Examiner Intelligence

Grants 87% — above average
87%
Career Allowance Rate
888 granted / 1018 resolved
+27.2% vs TC avg
Moderate +8% lift
Without
With
+8.1%
Interview Lift
resolved cases with interview
Typical timeline
3y 1m
Avg Prosecution
16 currently pending
Career history
1027
Total Applications
across all art units

Statute-Specific Performance

§101
24.8%
-15.2% vs TC avg
§103
35.6%
-4.4% vs TC avg
§102
19.8%
-20.2% vs TC avg
§112
8.7%
-31.3% vs TC avg
Black line = Tech Center average estimate • Based on career data from 1018 resolved cases

Office Action

§103
DETAILED ACTION 1. Claims 1-20 are pending in the application. Notice of Pre-AIA or AIA Status 2. The present application, filed on or after March 16, 2013, is being examined under the first inventor to file provisions of the AIA . Claim Rejections - 35 USC § 103 3. In the event the determination of the status of the application as subject to AIA 35 U.S.C. 102 and 103 (or as subject to pre-AIA 35 U.S.C. 102 and 103) is incorrect, any correction of the statutory basis (i.e., changing from AIA to pre-AIA ) for the rejection will not be considered a new ground of rejection if the prior art relied upon, and the rationale supporting the rejection, would be the same under either status. The following is a quotation of 35 U.S.C. 103 which forms the basis for all obviousness rejections set forth in this Office action: A patent for a claimed invention may not be obtained, notwithstanding that the claimed invention is not identically disclosed as set forth in section 102, if the differences between the claimed invention and the prior art are such that the claimed invention as a whole would have been obvious before the effective filing date of the claimed invention to a person having ordinary skill in the art to which the claimed invention pertains. Patentability shall not be negated by the manner in which the invention was made. 4. Claim(s) 1, 9, and 15 is/are rejected under 35 U.S.C. 103 as being unpatentable over Das et al (hereafter Das)(US Pub. 20200257527) in view of Mei et al (hereafter Mei)(US Pub. 20220309124). Das was cited in the IDS filed 12/30/2022. 5. As to claim 1, Das discloses a floating-point unit incorporating functionality to enable a fused- multiply-add instruction (abstract fma operations), comprising: logic to receive a first input operand, a second input operand ([0041]-[0043] and fig. 2 inputs), and a result format selector value, wherein the first input operand and the second input operand comprise floating-point values ([0052] and fig. 2, floating-point); and fused multiply-add logic to process the first input operand, the second input operand, and the third input operand to produce a final result comprising one of a binary integer value and a floating point value based on the result format selector value ([0058]-[0060] FMA processing). 6. Das does not explicitly disclose a third input operand. However, Mei discloses a third input operand ([0143] up to 3 operands). Therefore, it would have been obvious to one of ordinary skill in the art prior to the effective filing date of the claimed invention to modify the teachings of Das, by incorporating 3 operands, as taught by Mei. Using a plurality of different operands would not have limiting, as one of ordinary skill in the art would have the option of using different amounts of inputs as needed. This would have also been well-known knowledge to one of ordinary skill in the art prior to the effective filing date of the claimed invention, and thus; in views of Mei and the well-known knowledge, one of ordinary skill in the art would have been able to select from as many input operands as seen fit. 7. As to claim 9, Das discloses a system, comprising: a plurality of processing cores ([0029] core architecture); a cache memory ([0156] Cache); and a plurality of accelerators that produce processing results to return to the cache memory (fig, 12A, 12B) for processing by the processing cores, wherein each of the plurality of accelerators include a plurality of floating-point units incorporating functionality to enable a fused multiply-add instruction ([0183]), wherein a floating-point unit of the plurality of floating-point units comprises: logic to receive a first input operand, a second input operand, and a result format selector value, wherein the first input operand and the second input operand comprise floating-point values; and fused multiply-add logic to process the first input operand and the second input operand to produce a final result comprising one of a binary integer value and a floating point value based on the result format selector value. 8. Das does not explicitly disclose artificial intelligence accelerators and a third input operand. However, Mei discloses artificial intelligence accelerators ([0044] and [0108]) and a third input operand ([0143] up to 3 operands). Therefore, it would have been obvious to one of ordinary skill in the art prior to the effective filing date of the claimed invention to modify the teachings of Das, by incorporating 3 operands and applying them to artificial intelligence accelerators, as taught by Mei. Using a plurality of different operands would not have limiting, as one of ordinary skill in the art would have the option of using different amounts of inputs as needed. This would have also been well-known knowledge to one of ordinary skill in the art prior to the effective filing date of the claimed invention, and thus; in views of Mei and the well-known knowledge, one of ordinary skill in the art would have been able to select from as many input operands as seen fit. 9. As to claim 15, the claim is rejected for similar reasons as claims 1 and 9 above. Allowable Subject Matter 10. Claims 2, 10, and 16 are objected to as being dependent upon a rejected base claim, but would be allowable if rewritten in independent form including all of the limitations of the base claim and any intervening claims. The following is a statement of reasons for the indication of allowable subject matter: The claims recite at least wherein the fused multiply-add logic comprises: inputting the result selector format value to a multiplexor, wherein the multiplexor passes a first shift amount in response to the result selector format value indicating that the final result is to be the binary integer value, and wherein the multiplexor passes a second shift amount in response to the result selector format value indicating that the final result is to be the floating point value. The closest prior art of record US Pub. 20200257527 teaches the claimed floating-point with fused multiply add. However, the prior art of record does not teach or suggest at least wherein the fused multiply-add logic comprises: inputting the result selector format value to a multiplexor, wherein the multiplexor passes a first shift amount in response to the result selector format value indicating that the final result is to be the binary integer value, and wherein the multiplexor passes a second shift amount in response to the result selector format value indicating that the final result is to be the floating point value. Conclusion 11. The prior art made of record and not relied upon is considered pertinent to applicant's disclosure. US Pub. 20140188968 – related to the field of processors and, in particular, to an energy efficient variable precision floating point computation circuit. Any inquiry concerning this communication or earlier communications from the examiner should be directed to MICHAEL D YAARY whose telephone number is (571)270-1249. The examiner can normally be reached Mon-Fri 9-5:30. 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. /MICHAEL D. YAARY/Primary Examiner, Art Unit 2151
Read full office action

Prosecution Timeline

Dec 30, 2022
Application Filed
Aug 13, 2026
Non-Final Rejection mailed — §103 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12748570
ELECTROMECHANICAL APPARATUS, SYSTEM, AND METHOD FOR GENERATING TRUE RANDOM NUMBERS
4y 2m to grant Granted Sep 29, 2026
Patent 12730856
DEVICE AND METHOD FOR PARALLELIZING ANALOG IN-MEMORY COMPUTING BASED ON FREQUENCY DIVISION MULTIPLEXING
3y 9m to grant Granted Sep 08, 2026
Patent 12731019
ASYNCHRONOUS ACCUMULATOR USING LOGARITHMIC-BASED ARITHMETIC
2y 3m to grant Granted Sep 08, 2026
Patent 12725066
COMPUTATION IN MEMORY FOR ANNEAL PROCESSING USING BITWISE CAPACITIVE COUPLING
4y 1m to grant Granted Sep 01, 2026
Patent 12724587
PARALLEL FINITE FIELD MULTIPLICATION DEVICE
3y 11m to grant Granted Sep 01, 2026
Study what changed to get past this examiner. Based on 5 most recent grants.

Strategy Recommendation AI-generated — please review before filing

Get a prosecution strategy drawn from examiner precedents, rejection analysis, and claim mapping.
Typically takes 5-10 seconds — AI-generated, attorney review required before filing

Prosecution Projections

1-2
Expected OA Rounds
87%
Grant Probability
95%
With Interview (+8.1%)
3y 1m (~0m remaining)
Median Time to Grant
Low
PTA Risk
Based on 1018 resolved cases by this examiner. Grant probability derived from career allowance rate.

Sign in with your work email

Enter your email to receive a magic link. No password needed.

Personal email addresses (Gmail, Yahoo, etc.) are not accepted.

Free tier: 3 strategy analyses per month