California Institute of Technology v. Hughes Communications Inc.
59 F. Supp. 3d 974
C.D. Cal.2014Background
- Caltech sues Hughes for four IRA-code related patents: ’710, ’032, ’781, ’833.
- Court had issued a claim construction order in 2014.
- Hughes moved for summary judgment arguing §101 ineligibility.
- Court declines summary judgment and finds the asserted claims patentable under §101.
- Patents cover error-correction techniques using irregular repetition and parity calculations implemented in software.
- Court discusses Mayo two-step framework and post-Alice considerations for software patentability.
Issues
| Issue | Plaintiff's Argument | Defendant's Argument | Held |
|---|---|---|---|
| Whether the asserted claims are directed to abstract ideas under Mayo/Alice | Caltech claims encode/decode data for error correction; abstract at step one | Hughes argues broad abstract ideas in software/not patentable | Yes, but claims contain inventive concepts at step two |
| Whether the claims contain an inventive concept at Mayo step two | Limited, non-conventional features (irregular repetition, prior parity bit) are inventive | Elements are conventional or just routine | Yes, claims recite inventive concepts and are patentable |
| Whether software-based error-correction claims can be patentable post-Alice | Software can be patentable when it improves computing functions | Alice forecloses abstract software claims | Yes, software claims here are patentable under §101 |
| Whether the independent claims’ limitations sufficiently limit preemption | Irregular repetition and rate constraints limit preemption | Claims may preempt broad error-correction space | Yes, limitations provide inventive concept and narrow preemption |
Key Cases Cited
- Gottschalk v. Benson, 409 U.S. 63 (U.S. 1972) (mathematical formula abstract; preemption concerns)
- Parker v. Flook, 437 U.S. 584 (U.S. 1978) (point-of-novelty approach; novelty not fatal to patentability)
- Diamond v. Diehr, 450 U.S. 175 (U.S. 1981) (disagreed with Flook; claims may be patentable as a new combination of old elements)
- Bilski v. Kappos, 561 U.S. 593 (U.S. 2010) (hedging claims; abstract concepts not patentable)
- Mayo Collaborative Servs. v. Prometheus Labs., Inc., 132 S. Ct. 1289 (U.S. 2012) (two-step Mayo framework; conventional activity not enough)
- Alice Corp. v. CLS Bank Int’l, 134 S. Ct. 2347 (U.S. 2014) (two-step test governs eligibility; generic computer not enough)
- Digitech Image Techs., LLC v. Electronics for Imaging, Inc., 758 F.3d 1344 (Fed. Cir. 2014) (algorithmic data manipulation rules; caution against overbreadth)
- Planet Bingo, LLC v. VKGS LLC, 576 Fed.Appx. 1005 (Fed. Cir. 2014) (computerized game claims held abstract; lack of meaningful limitations)
- buySAFE, Inc. v. Google, Inc., 765 F.3d 1357 (Fed. Cir. 2014) (contractual guaranty claims held abstract; no inventive concept)