Posts Tagged: "algorithm requirement"

CAFC: Software means plus function claims Indefinite for failure to disclose algorithm

The Court also affirmed that the this means-plus-function term was indefinite. In the case of computer-implemented functions, the specification must disclose an algorithm for performing the claimed function. The patents-in-suit did not disclose an operative algorithm for the claimed “symbol generator.” A patentee cannot claim a means for performing a specific function and then disclose a “general purpose computer” as the structure performing that function. The specification must disclose an algorithm in hardware or software for performing the stated function.

A Strategy for Protecting Software Claims from Invalidation Under the Algorithm Requirement

In general, the courts distinguish between functions and algorithms, and they require patent applicants to disclose algorithms to cure perceived deficiencies in functions. The problem with this line of reasoning is that both algorithms and functions under 35 U.S.C. § 112(f) are composed of the same things: steps. So the result of the algorithm requirement is to simply make patent applicants “fix” one step by specifying more steps. Accordingly, if the algorithm requirement is taken to its logical conclusion, then each step would be fixed with more steps, and each of those steps would be fixed with even more steps, like Russian dolls. Instead, the courts do not take the algorithm to its logical conclusion and, instead, only require a single layer: the original step and the further steps (i.e., algorithm) for it. This is arbitrary, confusing for patent applicants and examiners, and a poorly calibrated solution to concerns about software patents.

A Software Patent History: The Algorithm Cases

These cases are very important though because they give us the best glimpse yet into understanding the disclosure requirements for software patents that utilize means-plus-function claim language. Understanding this particular aspect of patent drafting may be crucial moving forward given that some believe that means-plus-function claiming may be one way to get at least some patent claim coverage in the wake of Alice. Therefore, given that the extraordinarily strict disclosure requirements mandated by employing means-plus-function claiming, this technique may well be the future for software patents. Certainly adhering to the extreme disclosure requirements in the Algorithm cases will be a best practice moving forward even if you do not employ means-plus-function claiming, and it will likely remain a best practice until some statutory or common law relief from Alice is achieved.

Exclusive Interview with Steve Kunin, Part 2

On May 6, 2013, I sat down with Steve Kunin and we discussed a wide range of patent issues. In Part 1 of the interview we discussed the new post grant procedures for challenging issued patents, and started discussing the estoppel provisions. In Part 2 we conclude our discussion of estoppel and move into discussing secret prior art, the Economic Espionage Act, the algorithm line of cases from the Federal Circuit and the erosion of patent rights that started with eBay v. MercExchange.

Livid About Non-precedential Avid Decision from Federal Circuit

When an element is claimed using language falling under the scope of §112, ¶6, the specification must be consulted to determine the structure, material, or acts corresponding to the function recited in means-plus-function element in the claim. As emphasized by the Federal Circuit, “the ‘broadest reasonable interpretation’ that an examiner may give means-plus-function language is that statutorily mandated in paragraph six…, the PTO may not disregard the structure disclosed in the specification corresponding to such language when rendering a patentability determination.” In re Donaldson, 16 F.3d 1189, 1194 (Fed. Cir. 1994)(en banc); see also, MPEP 2182, 8th Ed. (August 2012). But here, the Federal Circuit held that there was no error in the Board’s reliance on the broadest reasonable interpretation for language appearing in a seemingly means-plus-function claim element.