Wi-Lan, Inc. v. Apple Inc.

811 F.3d 455, 117 U.S.P.Q. 2d (BNA) 1552, 2016 U.S. App. LEXIS 211, 2016 WL 98569
CourtCourt of Appeals for the Federal Circuit
DecidedJanuary 8, 2016
Docket2014-1437, 2014-1485
StatusPublished
Cited by54 cases

This text of 811 F.3d 455 (Wi-Lan, Inc. v. Apple Inc.) is published on Counsel Stack Legal Research, covering Court of Appeals for the Federal Circuit primary law. Counsel Stack provides free access to over 12 million legal documents including statutes, case law, regulations, and constitutions.

Bluebook
Wi-Lan, Inc. v. Apple Inc., 811 F.3d 455, 117 U.S.P.Q. 2d (BNA) 1552, 2016 U.S. App. LEXIS 211, 2016 WL 98569 (Fed. Cir. 2016).

Opinion

REYNA, Circuit Judge.

Wi-LAN, Inc. (“Wi-LAN”) is the as-signee of U.S. Patent No. RE37,802 (“'802 patent”), which concerns a wireless data communication technique called “Multi-Code Direct-Sequence Spread Spectrum” (MC-DSSS). Wi-LAN asserts that the patented technique is embodied in several modern wireless communications standards.

On February 2, 2011, Wi-LAN sued Apple Inc. (“Apple”) and other technology companies in the United States District Court for the Eastern District of Texas for infringing claims 1 and 10 of the '802 patent by manufacturing and selling products complying with various wide-area communication standards. A jury found that Apple did not infringe and that the claims are invalid. The district court denied Wi-LAN’s motion for judgment as a matter of law (“JMOL”) and for a new trial with respect to infringement, but it granted Wi-LAN’s motion for JMOL of no invalidity.

Wi-LAN appeals the trial court’s denial of JMOL and its motion for a new trial on infringement, and Apple cross-appeals the grant of JMOL of no invalidity. Because the jury’s verdict of non-infringement was supported by substantial evidence, we affirm the district court’s denial of JMOL as to non-infringement. Because the trial court’s JMOL determination of no invalidity was based on a postverdict reconstruction of the claims, we reverse the district court’s grant of JMOL of no invalidity.

I. Background

A. The Patented Technology

Wireless communication devices use radio waves to communicate digital data by modulating the frequency, amplitude, or phase of those waves according to prees-tablished patterns. Each pattern communicates a respective “symbol” corresponding to a given combination of bits. J.A. 3546. Devices that detect the radio waves can observe and interpret the modulation patterns to recover the transmitted symbols.

*458 Direcw-Sequence Spread Spectrum” (DSSS) is a prior art modulation technique that prevents third parties from intercepting and interpreting radio communications. Using DSSS, a radio transmitter “spreads” a signal across a band of frequencies by multiplying the signal against a pseudo-random signal called “pseudo-noise.” The pseudonoise signal corresponds to a particular code, such that a receiver with a corresponding code can “invert” (i.e., reverse) the spreading to recover the original signal. A third party scanning the spectrum would detect only what appears to be natural ambient noise, while the intended recipient could use the corresponding code to detect and decode the communication. A drawback of DSSS is that each communication occupies an entire band of frequency, which makes it difficult for multiple users to transmit data simultaneously.

“Code Division Multiple Access” (CDMA) is another prior art modulation technique that addresses the bandwidth shortcomings of DSSS by allowing multiple users to transmit on the same band using different spreading codes. Under CDMA, the signals from the multiple users form a combined noise-like signal, and each receiver can use its respective code to recover the communications intended for it from the combined signal.

The '802 patent discloses a “multi-code” variation of DSSS (MC-DSSS), which enhances throughput by permitting a single transmitter to utilize multiple codes simultaneously. '802 patent col. 1 1.' 66-col. 2 1. 5. The specification describes two embodiments, corresponding to Figures 1 and 4 respectively.

[[Image here]]

*459 [[Image here]]

The embodiment of Figure 1 includes: (1) a converter 10 for converting a stream of data symbols into multiple sets of N data symbols each, (2) a computing means 12 that operates on the sets of data symbols to produce “modulated data symbols corresponding to an invertible randomized spreading of the stream of data symbols” and (3) a combiner 14 for combining the modulated data symbols for transmission. Id. Fig. 1, col. 4 11. 1-7. The computing means modulates each data symbol using a respective DSSS code, which may be derived using a series of mathematical transforms, as shown in Figure 3. Id. col. 4 11. 7-12, col. 4 11. 29-34. The patent lists a dozen exemplary mathematical transforms, including the complex “randomizer transform” of Figure 8. Id. col. 4 1. 66-col. 5 1. 12. In the alternative embodiment of Figure 4, the computing means modulates the N data symbols by applying the transforms directly to the N data symbols rather than indirectly via the DSSS codes. Id. col. 4 11. 38-43. '

Asserted claim 1 recites a transceiver for transmitting data using three components:

1. A transceiver for transmitting a first stream of data symbols, the transceiver comprising:
a converter for converting the first stream of data symbols into plural sets of N data symbols each;
first computing means for operating on the plural sets of N data symbols to produce modulated data symbols corresponding to an invertible randomized spreading of the first stream of data symbols; and
means to combine the modulated data symbols for transmission.

The claimed transceiver includes a “converter” for converting a stream of data symbols into multiple sets of data symbols, where each set includes N symbols. Second, the transceiver includes a “computing means” for. operating on the sets to produce “modulated data symbols corresponding to an invertible randomized spreading” of the original data symbols. Finally, the transceiver includes a “means to combine the modulated data symbols for transmission.” Asserted claim 10, which depends on claim 1, adds means for receiving and decoding the data symbols.

B. Procedural History

The district court held a Markmcm hearing and issued two claim constructions relevant to this appeal. J.A. 18. First, the district court construed “modulated *460 data symbols” to mean “data symbols that have been spread by a spreading code.” J.A. 62. In doing so, the court rejected Apple’s argument that the modulated data symbols must be randomized, explaining that “randomization is a desirable feature that is addressed by other claim language, such as the term invertible randomized spreading,’ which appears in Claim 1.... ” Id. Second, the district court adopted the parties’ agreed construction of “first computing means.” The parties agreed that the limitation is a means-plus-function element subject to 35 U.S.C. § 112 ¶ 6, and that the corresponding structure is “element 12 of Figures 1 and 4, columns 2:6-10, 2:36-10, 2:58-62, 4:2-12, and 4:35-44, and equivalents thereof.” J.A. 73. The agreed upon construction matched the construction of the same term issued by a different court in previous litigation between the parties. Wi-Lan, Inc. v. Acer, Inc., 712 F.Supp.2d 549 (E.D.Tex.2010) (“Acer”).

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

Related

Cite This Page — Counsel Stack

Bluebook (online)
811 F.3d 455, 117 U.S.P.Q. 2d (BNA) 1552, 2016 U.S. App. LEXIS 211, 2016 WL 98569, Counsel Stack Legal Research, https://law.counselstack.com/opinion/wi-lan-inc-v-apple-inc-cafc-2016.