Realtime Data, LLC v. Iancu

Court of Appeals for the Federal Circuit·Decided January 10, 2019·No. 18-1154·Published

Opinion

United States Court of Appeals for the Federal Circuit

REALTIME DATA, LLC, DBA IXO, Appellant

v.

ANDREI IANCU, UNDER SECRETARY OF COMMERCE FOR INTELLECTUAL PROPERTY AND DIRECTOR OF THE UNITED STATES PATENT AND TRADEMARK OFFICE, Intervenor

2018-1154

Appeal from the United States Patent and Trademark Office, Patent Trial and Appeal Board in No. IPR2016- 00783.

Decided: January 10, 2019

KAYVAN B. NOROOZI, Noroozi PC, Santa Monica, CA, argued for appellant.

SARAH E. CRAVEN, Office of the Solicitor, United States Patent and Trademark Office, Alexandria, VA, argued for intervenor. Also represented by THOMAS W. KRAUSE, JOSEPH MATAL, FARHEENA YASMEEN RASHEED.

2 REALTIME DATA, LLC v. IANCU

Before DYK, TARANTO, and STOLL, Circuit Judges.

STOLL, Circuit Judge.

Hewlett Packard Enterprise Co., HP Enterprise Services , LLC, and Teradata Operations, Inc. (collectively, “HP”) sought inter partes review of claims 1–4, 8, 14–17, 21, and 28 of U.S. Patent No. 6,597,812 (the ’812 patent) before the U.S. Patent and Trademark Office’s Patent Trial and Appeal Board. The Board instituted review and, in its final written decision, found that all of the challenged claims would have been obvious over the prior art. Realtime Data, LLC, owner of the ’812 patent, appeals the Board’s decision. We affirm.

BACKGROUND

I

The ’812 patent discloses “[s]ystems and methods for providing lossless data compression and decompression . . . [that] exploit various characteristics of run-length encoding, parametric dictionary encoding, and bit packing .” ’812 patent Abstract. Run-length encoding is a form of lossless data compression where a “run” of characters is replaced with an identifier for each individual character and the number of times it is repeated. For example, using run-length encoding, the input string AAABBBBBBCCCCAA could be represented as 3A6B4C2A, which contains seven fewer characters.

Dictionary encoding is a form of lossless data compression that assigns a code word to a particular data string, maps that code word to an index, and replaces every matching data string with the corresponding code word. For example, the same input string described above could be assigned the code word “EASY123,” which contains eight fewer characters. This assignment would be mapped into an index, or dictionary, so that every time the input string AAABBBBBBCCCCAA appeared, it would be replaced with EASY123.

REALTIME DATA, LLC v. IANCU 3

Claim 1, which combines run-length and dictionary encoding techniques, is illustrative of the challenged claims:

1. A method for compressing input data comprising a plurality of data blocks, the method comprising the steps of:

detecting if the input data comprises a run-length sequence of data blocks; outputting an encoded run-length sequence , if a run-length sequence of data blocks is detected; maintaining a dictionary comprising a plurality of code words, wherein each code word in the dictionary is associated with a unique data block string; building a data block string from at least one data block in the input data that is not part of a run-length sequence; searching for a code word in the dictionary having a unique data block string associated therewith that matches the built data block string; and outputting the code word representing the built data block string.

Id. at col. 16 l. 53–col. 17 l. 2.

Claim 4 is relevant to the claim construction dispute raised by Realtime on appeal. The claim further limits the “maintaining a dictionary” step and reads as follows:

4. The method of claim 1, wherein the step of maintaining a dictionary comprises the steps of:

dynamically generating a new code word corresponding to a built data block string, 4 REALTIME DATA, LLC v. IANCU

if the built data block string does not match a unique data block string in the dictionary; and adding the new code word in the dictionary .

Id. at col. 17 ll. 17–23.

II

In April 2016, HP petitioned for inter partes review of the ’812 patent, alleging that claims 1–4, 8, 14–17, 21, and 28 would have been obvious under 35 U.S.C. § 103(a). In particular, HP argued that claims

1

1–4, 8, and 28 would have been obvious over U.S. Patent No. 4,929,946 (“O’Brien”) in view of Nelson, a data compression textbook, 2 and that claims 14–17 and 21 would have been obvious over O’Brien in view of Nelson and U.S. Patent No. 4,558,302 (“Welch”).

With respect to independent claim 1, HP argued that O’Brien disclosed the preamble, the “detecting” step, and the first “outputting” step, and that O’Brien and Nelson both individually disclosed the “maintaining” step, the “building” step, the “searching” step, and the second “outputting” step. For the “maintaining” and “searching” steps, HP clarified that even though O’Brien did not use the specific claim term “dictionary,” a person of ordinary

1 Because the issue date of the ’812 patent is July 22, 2003, and neither the ’812 patent nor the application from which it issued ever contained a claim with an effective filing date on or after March 16, 2013, the version of 35 U.S.C. § 103 that applies here is the one preceding the changes made by the America Invents Act. See Leahy-Smith America Invents Act, Pub. L. No. 112-29, 125 Stat. 284, 293, § 3(n) (2011).

2 Mark Nelson, The Data Compression Book (1992).

REALTIME DATA, LLC v. IANCU 5

skill in the art “would have recognized this and known, as taught in Nelson, that O’Brien’s string compression is a dictionary algorithm.” Pet. Requesting Inter Partes Review, SAP Am. Inc. et al. v. Realtime Data LLC, IPR2016-00783, Paper 1 at 41 (P.T.A.B. Apr. 1, 2016).

In its response, Realtime conceded that O’Brien’s string compression was, in fact, dictionary encoding as required by the claims. Instead of challenging O’Brien’s teaching of dictionary encoding, Realtime primarily focused its response on the “maintaining” step. Specifically , Realtime argued that O’Brien did not disclose “maintaining a dictionary” because O’Brien generates a new dictionary for each data segment, while the ’812 patent processes an input data stream through a single dictionary that resets to its initial state only when full. Realtime also argued that HP presented insufficient evidence of a motivation to combine O’Brien and Nelson, and that HP attempted instead to sidestep this requirement by arguing Nelson as an alternative to O’Brien. As Realtime noted, “[i]ndeed, Petitioner and its declarant allege O’Brien in fact discloses all of the limitations of all claims challenged in Ground 1.” Patent Owner Resp., Hewlett- Packard Enter. Co. v. Realtime Data LLC, IPR2016- 00783, Paper 29 at 44 (P.T.A.B. Jan. 5, 2017) (emphasis in original).

The Board agreed with Realtime’s statement, finding that O’Brien discloses the “maintaining a dictionary” limitation and every other limitation in independent claim 1. While recognizing that there was a dispute as to the construction of the phrase “maintaining a dictionary,” the Board determined that no construction was necessary as O’Brien taught every step for “maintaining a dictionary ” identified in dependent claim 4. The Board also determined that O’Brien teaches the limitations of claims 1–4, 8, and 28.

6 REALTIME DATA, LLC v. IANCU

Free access — add to your briefcase to read the full text and ask questions with AI

Realtime Data, LLC v. Iancu, (Fed. Cir. 2019).

Realtime Data, LLC v. Iancu (Realtime Data, LLC v. Iancu) — published by Counsel Stack Legal Research, free access to 12M+ legal documents.

Related

KSR International Co. v. Teleflex Inc.
550 U.S. 398 (Supreme Court, 2007)
Genentech, Inc. v. Chiron Corporation
112 F.3d 495 (Federal Circuit, 1997)
Plantronics, Inc. v. Aliph, Inc.
724 F.3d 1343 (Federal Circuit, 2013)
In Re Cuozzo Speed Technologies, LLC
793 F.3d 1268 (Federal Circuit, 2015)
Dome Patent L.P. v. Lee
799 F.3d 1372 (Federal Circuit, 2015)
Sas Institute, Inc. v. Complementsoft, LLC.
825 F.3d 1341 (Federal Circuit, 2016)
Cuozzo Speed Technologies, LLC v. Lee
579 U.S. 261 (Supreme Court, 2016)
HTC Corp. v. Cellular Communications Equipment, LLC
877 F.3d 1361 (Federal Circuit, 2017)
SAS Institute Inc. v. Iancu
584 U.S. 357 (Supreme Court, 2018)
Zup, LLC v. Nash Manufacturing, Inc.
896 F.3d 1365 (Federal Circuit, 2018)
Teva Pharm. United States, Inc. v. Sandoz, Inc.
135 S. Ct. 831 (Supreme Court, 2015)
In re Fracalossi
681 F.2d 792 (Customs and Patent Appeals, 1982)