942 F.3d 1143
Fed. Cir.2019Background
- KPN sued multiple defendants for infringement of U.S. Patent No. 6,212,662 (’662), which claims a device that generates “check data” for error detection in transmitted data blocks.
- The patent identifies a problem with prior art: a fixed check-data generating function can produce identical (defective) check data for repeated “systematic errors,” allowing those errors to evade detection.
- The ’662 patent’s asserted solution (embodiment at issue) permutes bit positions of each data block before generating check data and varies the permutation over time (claims 2–4 add time-varying and data-based permutation and a stored-permutation table).
- Appellees moved for judgment on the pleadings under Rule 12(c) arguing claims 1–4 are ineligible under 35 U.S.C. § 101; the district court held all claims abstract under Alice and dismissed.
- KPN disclaimed claim 1 and appealed only claims 2–4; the Federal Circuit reversed as to claims 2–4, holding they are directed to a non-abstract technological improvement (no need to reach Alice step two).
Issues
| Issue | Plaintiff's Argument | Defendant's Argument | Held |
|---|---|---|---|
| Whether claims 2–4 are directed to an abstract idea under Alice step one | KPN: claims recite a specific technological improvement—varying permutations over time to detect systematic errors—so not abstract | Appellees: claims merely reorder/generate data (data-manipulation) and lack a concrete application | Held: Not abstract; claims 2–4 recite a specific implementation improving error-detection technology and survive step one |
| Whether the claims sufficiently link permutation to check-data generation | KPN: claim language requires permuting original data “prior to supplying” it to the generating device | Appellees: claims don’t tie permutation to generation of new check data | Held: Court reads claim 1 to require varied data be supplied to the generator, so linkage exists |
| Whether absence of an explicit final “application” step (using check data to detect errors) renders claims abstract | KPN: improvement to the check-data generator itself is a sufficient, patent-eligible technological improvement without reciting the downstream detection step | Appellees: lack of a concrete application step means abstractness | Held: No need to recite the system-level application; improving a tool in the system can be patent-eligible |
| Whether the specification supports the asserted technological benefit of permutations | KPN: specification describes variable checking functions preventing non-detection and identifies permutations as a variation method | Appellees: specification allegedly fails to show technological benefit of permutations | Held: Specification, read as whole, links time-varying permutations to preventing non-detection of repetitive errors |
Key Cases Cited
- Alice Corp. v. CLS Bank Int'l, 573 U.S. 208 (framework for § 101 analysis)
- Mayo Collaborative Servs. v. Prometheus Labs., 566 U.S. 66 (laws of nature and abstract ideas excluded from § 101)
- Ass'n for Molecular Pathology v. Myriad Genetics, 569 U.S. 576 (pre-emption concern for excluded subject matter)
- Enfish, LLC v. Microsoft Corp., 822 F.3d 1327 (software claims patent-eligible when directed to specific improvement in computer capabilities)
- Finjan, Inc. v. Blue Coat Sys., 879 F.3d 1299 (claims patent-eligible where claimed technique produced capabilities computers previously lacked)
- McRO, Inc. v. Bandai Namco Games Am. Inc., 837 F.3d 1299 (claims patent-eligible where specific rules automated a prior manual process)
- Digitech Image Techs., LLC v. Elec. for Imaging, Inc., 758 F.3d 1344 (claims ineligible where they merely reorganized information without specifying how to achieve improvement)
- Two-Way Media Ltd. v. Comcast Cable Commc'ns, LLC, 874 F.3d 1329 (data-processing claims held abstract where result-oriented and implementation details lacking)
- RecogniCorp, LLC v. Nintendo Co., 855 F.3d 1322 (encoding/decoding claims held abstract absent specific claimed improvement)
- Electric Power Group, LLC v. Alstom S.A., 830 F.3d 1350 (claims directed to abstract ideas where computers invoked merely as tools)
- Ancora Techs., Inc. v. HTC America Inc., 908 F.3d 1343 (claims patent-eligible when they recite improvement to computer memory/structure)
- SAP America, Inc. v. InvestPic, LLC, 898 F.3d 1161 (clarifying need for specific means to transform abstract ideas into patent-eligible applications)