`Apple v. California Institute of Technology
`
`
`UNITED STATES PATENT AND TRADEMARK OFFICE
`
`BEFORE THE PATENT TRIAL AND APPEAL BOARD
`
`
`
`
`
`APPLE INC.,
`Petitioner,
`
`v.
`
`CALIFORNIA INSTITUTE OF TECHNOLOGY,
`Patent Owner.
`_________________________________________
`
`Case IPR2017-00219
`Patent 7,116,710
`_________________________________________
`
`PETITIONER’S REPLY TO PATENT OWNER’S RESPONSE
`
`
`
`
`
`
`
`
`
`U.S. Patent No. 7,116,710
`Apple v. California Institute of Technology
`
`
`I.
`
`II.
`
`TABLE OF CONTENTS
`INTRODUCTION ........................................................................................... 1
`
`ARGUMENT ................................................................................................... 1
`
`A.
`
`The Challenged Claims are Obvious ..................................................... 1
`
`1.
`
`Divsalar in view of Luby renders claims 1-8 and 11-14
`
`obvious ........................................................................................ 1
`
`2.
`
`Divsalar in view of Luby and Luby97 renders claims
`
`15-17, 19-22, and 24-33 obvious .............................................. 13
`
`3.
`
`Caltech fails to establish a nexus between its alleged
`
`objective evidence of non-obviousness and the claimed
`
`invention. ................................................................................... 14
`
`B.
`
`Caltech Mischaracterizes the Testimony of Petitioner’s Expert,
`
`Prof. Davis. .......................................................................................... 17
`
`C.
`
`Caltech Fails to Antedate Frey. ........................................................... 21
`
`1.
`
`Frey was publicly available before Caltech’s alleged
`
`conception date. ........................................................................ 22
`
`2.
`
`3.
`
`Caltech fails to corroborate its alleged date of conception. ...... 23
`
`Caltech fails to demonstrate diligence. ..................................... 26
`
`- i -
`
`
`
`U.S. Patent No. 7,116,710
`Apple v. California Institute of Technology
`
`III. CONCLUSION .............................................................................................. 27
`
`
`
`- ii -
`
`
`
`I.
`
`INTRODUCTION
`
`U.S. Patent No. 7,116,710
`Apple v. California Institute of Technology
`
`
`The Patent Owner Response (“POR”) filed by Caltech fails to rebut
`
`Petitioner’s showing that the challenged claims are unpatentable. First, Caltech
`
`mischaracterizes the teachings of Divsalar and Luby. Second, Caltech has failed to
`
`demonstrate secondary considerations of non-obviousness. Third, Caltech
`
`mischaracterizes the testimony of Petitioner’s expert, Prof. Davis. Finally,
`
`Caltech’s alleged pre-filing activity fails to antedate the Frey reference.
`
`II. ARGUMENT
`A. The Challenged Claims are Obvious
`1.
`
`Divsalar in view of Luby renders claims 1-8 and 11-14 obvious
`
`The POR relies on the same arguments that the Board preliminarily
`
`rejected—irregularity, partitioning, and combinability—and should reject again.
`
`POPR, 13-35; DI, 22.
`
`i.
`
`Luby teaches irregular repetition of information bits
`
`Caltech asserts that is unclear whether Luby’s irregular message nodes result
`
`from irregular information bits, irregular parity bits, or both. See POR, 19-26.
`
`Caltech is mistaken.
`
`Luby teaches that its codes have “rate ½ with 16,000 message bits and 8,000
`
`check bits.” Ex. 1204, 256. This means that each of Luby’s codewords contain
`
`8,000 information bits and 8,000 parity bits. Luby’s Table 1 provides parameters for
`
`- 1 -
`
`
`
`four codes. POR, 26. As Prof. Frey explains, the lambda values in Luby’s table
`
`U.S. Patent No. 7,116,710
`Apple v. California Institute of Technology
`
`
`correlate to the number of nodes of each degree. The table below summarizes the
`
`percentages and total number of each type of message node for two codes in Table 1.
`
`Code
`22
`
`14’
`
`
`
`Percentages of messages nodes of each degree
`Degree 5 Message Nodes: ~63% (~10,080 nodes)
`Degree 6 Message Nodes: ~23% (~3,680 nodes)
`Degree 27 Message Nodes: ~3% (~480 nodes)
`Degree 29 Message Nodes: ~4% (~640 nodes)
`Degree 30 Message Nodes: ~4% (~640 nodes)
`Degree 100 Message Nodes: ~3% (~480 nodes)
`Degree 3 Message Nodes: ~22% (~3,520 nodes)
`Degree 4 Message Nodes: ~61% (~9,760 nodes)
`Degree 21 Message Nodes: ~5% (~800 nodes)
`Degree 23 Message Nodes: ~12% (1,920 nodes)
`
`Ex. 1265, ¶¶21-27.1
`
`Prof. Frey explains that in implementations of Luby’s codes, the information
`
`bits would have different degrees. For example, in Luby’s Code 22, some of the
`
`information bits would have degree 100 and others would have degree 30. Similarly,
`
`in Luby’s Code 14’, some of the information bits would have degree 23 and others
`
`would have degree 21. Ex. 1265, ¶¶28-29.
`
`
`
`1 After submitting his declaration, Dr. Davis relocated to Europe pursuant to a
`
`Fulbright Global Scholar Award. As a result, he was unavailable to work on the
`
`Reply. Petitioner’s Reply is instead supported by the Declaration of Dr. Frey.
`
`- 2 -
`
`
`
`U.S. Patent No. 7,116,710
`Apple v. California Institute of Technology
`
`Luby states that message nodes “with higher degree tend to their correct value
`
`quickly.” Ex. 1204, 253. This would have led a POSA to preferentially use higher
`
`degrees for information bits. Because there are 8,000 information bits and fewer
`
`than 8,000 messages nodes with higher degrees (e.g., only 1,920 nodes with degree
`
`23 for Code 14’), it would have been impossible to use a single high degree for all
`
`the information bits. Also, even if POSAs were to randomly assign information and
`
`parity bits to particular nodes, it would have been highly unlikely for all the
`
`information bits to have the same degree. Thus, POSAs would have understood that
`
`Luby discloses information bits with different degrees. At a minimum, information
`
`bits with different degrees would have been obvious, because having at least some
`
`irregular information bits is one of only two possibilities (i.e., at least some
`
`information bits with different degrees or all information bits with the same degree)
`
`when the message nodes are irregular, as they are in Luby. Ex. 1265, ¶¶29-33.
`
`ii.
`
`Even under Caltech’s incorrect interpretation of Luby,
`Caltech’s argument regarding irregularity fails
`
`Caltech’s complaint that Luby does not disclose irregular information bits is
`
`untrue and irrelevant. Applying Luby’s fundamental teaching—that irregular codes,
`
`with message bits that have irregular degrees, outperform their regular
`
`counterparts—to Divsalar results in codes that repeat information bits a different
`
`number of times. Ex. 1265, ¶¶34-35.
`
`- 3 -
`
`
`
`U.S. Patent No. 7,116,710
`Apple v. California Institute of Technology
`
`The simplest way for a POSA to incorporate Luby’s irregularity into Divsalar
`
`would have been to modify Divsalar’s repeater to make it repeat some bits more than
`
`others. Pet., 37. Doing so would not have required modification of Divsalar’s other
`
`components, i.e., the interleaver and accumulator. Id., 37. Incorporating irregularity
`
`into Divsalar’s repeater would only have required repeating some bits more than
`
`others. By contrast, incorporating irregularity in Divsalar’s accumulator would have
`
`complicated the already simple accumulator. Ex. 1265, ¶36.
`
`This can be seen graphicly. Exhibit 1246 shows a Tanner graph for Divsalar’s
`
`code for the case in which q=3. Exhibit 1247 shows the Tanner graph for Luby’s
`
`Code 14.
`
`- 4 -
`
`
`
`U.S. Patent No. 7,116,710
`Apple v. California Institute of Technology
`
`
`
`
`Ex. 1246
`
`
`
`
`
`
`
`Ex. 1247
`
`The left sides of the Tanner graphs are similar, i.e., they both include nodes and a
`
`random permutation. However, whereas Divsalar’s left nodes all have the same
`
`degree, Luby’s do not. It would have been obvious for a POSA to use Luby’s
`
`irregularity in Divsalar by making the degree of Divsalar’s information nodes
`
`irregular, which exactly corresponds to repeating some bits more than others.
`
`Ex. 1265, ¶37.
`
`Caltech argues that Luby’s irregularity is in the codeword bits and that using
`
`Luby’s irregularity in Divsalar would mean changing the degree of the parity nodes
`
`- 5 -
`
`
`
`at the right side of Divsalar’s Tanner graph. See POR, 26-29. However, Caltech’s
`
`U.S. Patent No. 7,116,710
`Apple v. California Institute of Technology
`
`
`approach would treat a POSA as an automaton. As explained above, a POSA would
`
`have been motivated to modify Divsalar’s repeater. Similarly, changing the degree
`
`of Divsalar’s left nodes such that it repeats bits a different number of times would
`
`have been simple and obvious. Ex. 1265, ¶38.
`
`Moreover, Frey actually used Luby’s teaching to irregularly repeat
`
`information bits, which disproves Caltech’s charge of hindsight. Ex. 1202, 241. A
`
`POSA reading Divsalar and Luby would have been motivated to do the same.
`
`Ex. 1265, ¶¶39-40.
`
`iii. Divsalar in view of Luby discloses the “partitioning”
`limitation
`
`Divsalar in view of Luby partitions information bits into sub-blocks by
`
`repeating some information bits more than others. DI, 20; Pet., 46-47. Ex. 1265,
`
`¶41.
`
`The POR does not dispute that repeating bits a different number of times
`
`would disclose partitioning them into different sub-blocks, or that such partition
`
`would have been an obvious implementation of the irregular repeater of Divsalar in
`
`view of Luby. See POR, 29-30. Instead, the sole argument Caltech makes in its
`
`POR is that it is theoretically possible to “implement the modified Divsalar code
`
`without partitioning.” POR, 29-30. Caltech’s argument fails. Ex. 1265, ¶42.
`
`- 6 -
`
`
`
`U.S. Patent No. 7,116,710
`Apple v. California Institute of Technology
`
`First, Caltech attempts to impose an inherency standard. The Petition did not
`
`rely on a showing of inherency. Rather, the Petition showed repeating bits different
`
`numbers of times discloses the “partitioning” limitation. That the irregular
`
`repetition “de facto” causes partitioning or “defines the different sub-blocks of the
`
`partition,” Pet., 46-47, does not impose an inherency requirement—rather, it shows
`
`the disclosure and obviousness of the “partitioning” limitation in view of Divsalar
`
`and Luby.
`
`Second, Dr. Mitzenmacher’s argument that POSAs implementing Divsalar
`
`and Luby could avoid partitioning by using a random number generator should be
`
`rejected. Even if such a random number generator were used, because its output
`
`sequence would be known in advance, that sequence would provide the partitioning,
`
`i.e., it would define in advance which bits are repeated which number of times.
`
`Ex. 1262, 381:3-382:13. Ex. 1265, ¶43.
`
`Third, even if it were possible to alter Divsalar’s encoder to irregularly repeat
`
`without partitioning, the combination of Divsalar and Luby would still disclose
`
`partitioning. Dr. Mitzenmacher acknowledges his proposed implementation is
`
`merely a hypothetical that “one could envision.” Ex. 2003, ¶94. He offers no
`
`testimony that this implementation is a practical or likely implementation. Id. Dr.
`
`Frey shows that it is not, and that repeating bits different numbers of times would
`
`have partitioned the data as recited in the claims. Ex. 1265, ¶44.
`- 7 -
`
`
`
`U.S. Patent No. 7,116,710
`Apple v. California Institute of Technology
`
`iv. Caltech has failed to show that a POSA would not have
`combined Divsalar and Luby.
`
`First, as the Caltech cannot and does not dispute, Luby plainly states that
`
`irregularity could be used to design codes that are “far superior to any regular
`
`code.” Ex. 1204, 257. Instead, Caltech urges an artificially narrow interpretation of
`
`Luby. POR, 30-32, 35. POSAs would not have read Luby so narrowly. Rather,
`
`POSAs would have been encouraged to use Luby’s irregularity in other codes. Frey
`
`did exactly that and, noting the success of Luby, incorporated irregularity by
`
`irregularly repeating information bits. Ex. 1202, 241-244. POSAs would have
`
`similarly been motivated to do what Frey2 did and obtain the benefit of Luby’s
`
`irregularity in other codes such as Divsalar’s. Ex. 1265, ¶46.
`
`Caltech similarly reads Luby’s use of the term “irregular” unduly narrowly.
`
`POR 25-26. Caltech attempts to show that Luby offers a different definition of
`
`
`
`2 Caltech also misreads Frey. POR, 35-37. Caltech’s interpretation is rebutted by
`
`Frey itself, which states, e.g., “In this paper, we show that by tweaking a turbocode
`
`so that it is irregular, we obtain a coding gain…” Ex. 1202, 241. Additionally, the
`
`POR does not dispute that Frey teaches “irregular turbocode clearly performs better”
`
`in at least some cases. Id., 246. Thus, Frey provides further evidence a POSA would
`
`have been motivated to combine Divsalar and Frey.
`
`- 8 -
`
`
`
`“irregularity” than Dr. Davis. Caltech states that Luby defines irregularity with
`
`U.S. Patent No. 7,116,710
`Apple v. California Institute of Technology
`
`
`respect to the lambda values in Table 1. But as shown above, those lamba values
`
`disclose irregular information bits. Thus, Luby’s use of irregularity is consistent
`
`with the definition offered by Dr. Davis and with the understanding of POSAs. Ex.
`
`1265, ¶47.
`
`Second, the POR does not dispute that Divsalar could be made irregular by
`
`modifying the repeater to repeat information bits different numbers of times.
`
`Instead, the POR argues that such modifications were not sufficiently described and
`
`would not have an expectation of success. POR, 37-47. These arguments should be
`
`rejected. Ex. 1265, ¶48.
`
`As Caltech concedes, rigorous mathematical analysis of codes is difficult, and,
`
`as a result, POSAs routinely developed codes by experimentation. POR, 2.
`
`Encouraged by Luby’s results, a POSA would have been motivated to use Luby’s
`
`irregularity in Divsalar. The Petition showed that POSAs would have had an
`
`expectation of success because it was simple to modify Divsalar to repeat
`
`information bits different numbers of times, which meets the limitations of the
`
`claimed invention. Pet., 37-41. Intelligent Bio-Sys., Inc. v. Illumina Cambridge
`
`Ltd., 821 F.3d 1359, 1367 (Fed. Cir. 2016) (“The reasonable expectation of success
`
`requirement refers to the likelihood of success in combining references to meet the
`
`limitations of the claimed invention.”). Dr. Mitzenmacher agreed that repeating
`- 9 -
`
`
`
`some bits in Divsalar “q+10” times and others “q” times would make the code
`
`U.S. Patent No. 7,116,710
`Apple v. California Institute of Technology
`
`
`irregular. Ex. 1262, 153:11-154:8. Ex. 1265, ¶49.
`
`A POSA’s expectation of success is further illustrated by the Tanner graphs
`
`for Divsalar and Luby referenced above. Exs. 1046-1047. All that is required to
`
`make Divsalar’s code repeat information bits irregularly is to rearrange the edges for
`
`information nodes so that some nodes have different numbers of edges than others.
`
`Doing so would have been simple and obvious and would have resulted in a
`
`functioning code. Supra, §II.1.ii. Ex. 1265, ¶50.
`
`Moreover, Dr. Frey’s simulation confirms that using Luby’s irregularity in
`
`Divsalar would not have been difficult, and a POSA would have had an expectation
`
`of success. Exhibit 1268 demonstrates that an irregular version of Divsalar’s code,
`
`in which half the bits are repeated three times and the other half are repeated seven
`
`times, outperforms the original. These results show that POSAs would have had an
`
`expectation of success and would have easily obtained a coder with improved
`
`performance. As Prof. Frey explains, it took him only 30 minutes to adapt the
`
`regular Divsalar code to make it irregular and obtain a result showing that the
`
`irregular version had superior performance. Ex. 1265, ¶¶51-63.
`
`Third, Caltech’s argument that Luby does not provide a motivation to modify
`
`Divsalar’s repeater fails. POR, 33-34. POSAs would have been motivated to apply
`
`irregularity to the repeater because it is a simple component that could be easily
`- 10 -
`
`
`
`modified. Supra, §II.1.ii. Caltech’s argument that Divsalar already has some
`
`U.S. Patent No. 7,116,710
`Apple v. California Institute of Technology
`
`
`irregularity also fails. Accumulators such as those in Divsalar were known long
`
`before the coding community began discussing irregular codes. POSAs did not
`
`consider use of an accumulator to make codes irregular. Ex. 1265, ¶63.
`
`v.
`
`Dr. Divsalar’s testimony confirms that it would have
`been obvious to combine Divsalar and Frey
`
`Dr. Divsalar’s declaration should be disregarded because he did not do the
`
`work necessary to form an obviousness opinion. First, Dr. Divsalar purports to
`
`provide an opinion of non-obviousness, but he did not review any materials related
`
`to obviousness, including his (almost 20-year-old) paper, any of the patents or
`
`claims, any prior art, or any of Petitioner’s explanations of why the claims are
`
`obvious. Ex. 2031, ¶¶9-10, 33; Ex. 1264, 38:9-44:11. He also worked less than six
`
`hours on the case prior to his deposition, so the declaration was not well-considered.
`
`Ex. 1264, 14:10-17.
`
`Second, Dr. Divsalar is biased. He has been employed by Caltech for
`
`decades, was paid twice his normal salary for work on this case, and considers the
`
`inventor, Dr. McEliece, a friend. Id., 7:1-4, 10:2-10, 11:20-15:21.
`
`Third, Dr. Divsalar’s declaration is inconsistent with his own prior
`
`statements. In a 2005 publication, Dr. Divsalar stated that IRA codes “generalized
`
`the notion of RA codes by allowing irregular repetition of input bits.” Id.,
`
`- 11 -
`
`
`
`U.S. Patent No. 7,116,710
`Apple v. California Institute of Technology
`
`257:21-260:12; Ex. 1261. As Petitioner has explained, IRA codes are no more than
`
`an obvious generalization of Divsalar’s RA code.
`
`Finally, the basis for Dr. Divsalar’s opinion that a POSA would not have
`
`made his RA code irregular is because doing so would decrease the code rate.
`
`Ex. 2013, ¶ 36. However, Dr. Divsalar conceded at his deposition that his code can
`
`be made irregular without altering the rate, and “there are a very large number of
`
`ways” to do so. Ex. 1264, 101:12-22, 104:9-19, 105:5-13; Exs. 1257-1258. For
`
`example, he confirmed that modifying a rate 1/5 RA code to repeat half the bits three
`
`times and the other half seven times would not change the rate. Id. That is the same
`
`example used by Dr. Frey to demonstrate that irregular versions of Divsalar
`
`outperform the original. Ex. 1265, ¶64.
`
`Moreover, Dr. Divsalar’s deposition confirms a POSA would have been
`
`motivated to combine Divsalar and Frey. Dr. Divsalar confirmed that he received an
`
`email from Dr. Frey on December 8, 1999 (prior to the alleged priority date) in
`
`which Dr. Frey suggested “it would be interesting to extend the work that you and
`
`Bob [McEliece] have done to the case of irregular turbocodes.” Ex. 1264,
`
`183:15-186:20. Dr. Divsalar confirmed that Dr. Frey’s reference to “irregular
`
`turbocodes” was a reference to Frey, which Dr. Divsalar had received by December
`
`1999. Id. Ex. 1265, ¶65.
`
`- 12 -
`
`
`
`U.S. Patent No. 7,116,710
`Apple v. California Institute of Technology
`
`Dr. Divsalar additionally confirmed that RA codes in Divsalar could be made
`
`irregular by rearranging the edges for information nodes u1 to uk so that some nodes
`
`have different numbers of edges than other nodes. Ex. 1264, 95:7-101:22. This
`
`demonstrates it would have been simple for a POSA to modify the RA code in
`
`Divsalar to arrive at the claimed IRA code. Dr. Divsalar’s suggestion that Tanner
`
`graphs were innovative is also incorrect. Ex. 2031, ¶15. Tanner graphs were a
`
`standard technique for representing codes, including turbo-like codes, and in fact,
`
`Frey used such graphs to represent the irregular code Dr. Frey suggested applying to
`
`Divsalar. Ex. 1265, ¶66.
`
`2.
`
`Divsalar in view of Luby and Luby97 renders claims 15-17,
`19-22, and 24-33 obvious
`
`The Petition showed that, to the extent Divsalar and/or Luby alone do not
`
`disclose receiving “streams” of bits, it would have been obvious to incorporate this
`
`feature of Luby97 because such encoders were common and well-known. Petition at
`
`55-56. The POPR argued that the Petition did not sufficiently identify reasons to
`
`combine the references. POPR, 36-42. The Board preliminarily rejected these
`
`arguments in the Institution Decision. DI, 22-24. The POR simply repeats these
`
`same arguments again, and fails to identify any reasons the Board should reach a
`
`different conclusion than it reached at the institution stage. POR, 48-52. Ex. 1265,
`
`¶67.
`
`- 13 -
`
`
`
`U.S. Patent No. 7,116,710
`Apple v. California Institute of Technology
`
`
`Caltech also argues that the LDGM limitation of claims 20 and 28 is not
`
`explained. But the Petition explains how Divsalar teaches that limitation for claim 7,
`
`and Caltech failed to identify anything missing from the Petition’s explanation.
`
`Ex. 1265, ¶67.
`
`3.
`
`Caltech fails to establish a nexus between its alleged objective
`evidence of non-obviousness and the claimed invention.
`
`The Federal Circuit has explained that “[f]or objective evidence of secondary
`
`considerations to be accorded substantial weight, its proponents must establish a
`
`nexus between the evidence and the merits of the claimed invention.” Merck & Cie
`
`v. Gnosis S.P.A., 808 F.3d 829, 837 (Fed. Cir. 2015) (citation omitted). Caltech fails
`
`to establish such a nexus.
`
`Caltech’s nexus argument rests entirely on its contention that the DVB-S2
`
`standard practices the claimed invention. POR, 51-53. It does not. Judge Pfaelzer
`
`of the Central District of California addressed this issue in her summary judgment
`
`opinion. Ex. 1267. She explained that “[t]he DVB-S2 standard does not appear to
`
`require repetition of bits.” Id., *4. As Judge Pfaelzer found, the DVB-S2 standard
`
`- 14 -
`
`
`
`does not satisfy the limitations of the ’710 patent, which require repetition of
`
`U.S. Patent No. 7,116,710
`Apple v. California Institute of Technology
`
`
`information bits.3 Ex. 1265, ¶¶68-69.
`
`Caltech presents no evidence beyond what was available to Judge Pfaelzer.
`
`Its expert, Dr. Mitzenmacher, relied solely on evidence regarding the DVB-S2
`
`standard itself, Ex. 2004, ¶¶133-140; he admitted that he did not review any actual
`
`implementation of the DVB-S2 standard. Ex. 1262, 443:17-445:10.
`
`Without the requisite nexus to the challenged claims, Caltech’s evidence is
`
`entitled to no weight. See Merck, 808 F.3d at 837.
`
`i.
`
`Long-Felt Need and Failure of Others
`
`Caltech’s suggestion that IRA codes represent the endpoint of the
`
`development of certain error correction codes is false. POR, 54-56.
`
`Information theorists have long sought new codes that performed closer to the
`
`Shannon Limit. That search drove the development of LDPC codes, turbocodes, RA
`
`codes, and IRA codes. At no time was there a “long-felt need” for IRA codes.
`
`Rather, there is always a present need for the next improvement to code performance.
`
`Similarly, the codes that came before IRA codes were not “failures.” Rather, they
`
`
`3 While Judge Pfaelzer’s analysis relates to related Patent No. 7,421,032, it
`
`applies equally to the ’710 patent, which also requires repetition of information bits.
`
`E.g., Ex. 1201, 7:19-20.
`
`- 15 -
`
`
`
`U.S. Patent No. 7,116,710
`Apple v. California Institute of Technology
`
`were improvements on what came before. IRA codes were at most a predictable and
`
`incremental step in this process. Ex. 1265, ¶70.
`
`Caltech’s argument also fails because it focuses on the alleged success of IRA
`
`codes in general, not the claimed invention. IRA codes are not equivalent to the
`
`claimed invention. Named inventor Jin testified during deposition that there are
`
`multiple forms of IRA codes. Ex. 1263, 60:7-14. The claimed invention is one type
`
`of IRA code. Caltech makes no effort to prove that the features claimed in the ’710
`
`patent are what drove the alleged success of IRA codes.
`
`ii.
`
`Industry Praise and Unexpected Results
`
`Caltech’s evidence of alleged industry praise and unexpected results is also
`
`irrelevant because it relies on IRA codes and DVB-S2 without establishing a nexus.
`
`iii. Commercial Success
`
`Caltech’s claim “widespread adoption of IRA codes in communication
`
`standards” similarly fails. POR, 60. The only communication standard it identifies
`
`is DVB-S2, which, as detailed above, has been found not to use the claimed
`
`invention.
`
`Caltech’s reliance on a single license to establish commercial success is
`
`equally unavailing. Caltech has not entered the license into the record, and the little
`
`evidence Caltech has introduced shows that the license was taken to settle litigation.
`
`Ex. 2017. In such circumstances, affirmative evidence of a nexus between the
`
`- 16 -
`
`
`
`claimed invention and the license is “specifically require[d] . . . because it is often
`
`U.S. Patent No. 7,116,710
`Apple v. California Institute of Technology
`
`
`‘cheaper to take licenses than to defend infringement suits.’” Iron Grip Barbell Co.
`
`v. USA Sports, Inc., 392 F.3d 1317, 1324 (Fed. Cir. 2004) (citation omitted).
`
`Caltech has presented no such affirmative evidence.
`
`B. Caltech Mischaracterizes the Testimony of Petitioner’s Expert,
`Prof. Davis.
`
`Caltech’s efforts to discredit the testimony of Prof. Davis are unfounded.
`
`Prof. Davis holds B.S., M.S., and Ph.D. degrees in mathematics. Ex. 1206 ¶ 3. He
`
`serves as a Professor of Mathematics at the University of Richmond, where his
`
`research focuses on coding theory, algebra, and combinatorics. Id. ¶¶ 4-9; Ex. 2033,
`
`294:11-18. He has authored over 50 peer-reviewed publications in those fields. Ex.
`
`1206, ¶11. He submitted a 185-page declaration in this proceeding, id., and testified
`
`for over six hours of cross-examination in a straightforward manner.
`
`In view of Prof. Davis’s experience and well-supported opinions, Caltech
`
`resorts to mischaracterizing his testimony. For example, Prof. Davis did not
`
`“avoid[] answering whether Frey’s Figure 3(b) graph shows data points for the range
`
`of 8-12 degrees.” POR, 16. Rather, when asked whether “Frey obtained the best
`
`results when the elite bits were repeated in the range of 8 to 12 times,” Prof. Davis
`
`answered precisely that with respect to Figure 3(b) “the best degree is roughly 10.”
`
`Ex. 2033, 138:21-139:9.
`
`- 17 -
`
`
`
`U.S. Patent No. 7,116,710
`Apple v. California Institute of Technology
`
`
`The other allegations leveled by Caltech are equally baseless.
`
`Caltech contends that Prof. Davis could not answer “basic questions” about
`
`Berrou. POR, 12, 15. This is false. Prof. Davis testified that he had not recently
`
`reviewed Berrou, Ex. 2033, 54:20-22, 56:17-18, and that he would have to review
`
`the paper to answer counsel’s questions with confidence, id., 55:6-7, 58:4-6,
`
`58:15-18, 59:2-3, 59:15-17, 59:22-60:3. Counsel did not allow Prof. Davis to
`
`review Berrou during the deposition and Caltech cannot now criticize him for
`
`properly framing his responses.
`
`Caltech criticizes Prof. Davis because “[h]e could not give an opinion on what
`
`‘irregular’ meant in the field.” POR, 12, 15-16. But, as Prof. Davis testified, he did
`
`“provide in [his] declaration what [he] mean[s] by irregular codes in the context that
`
`matters for these proceedings,” Ex. 2033, 88:2-4—i.e., “the codes in the patents as
`
`well as the codes in the prior art,” id., 88:11-16. See Ex. 1206, ¶ 59. This is the
`
`proper interpretation of claim terms. See Paper 17, 9 (claims interpreted “in the
`
`context of the entire disclosure”). Prof. Davis then consistently applied this
`
`definition to the prior art. For example, contrary to Caltech’s argument to the
`
`contrary, POR, 20-24, Prof. Davis testified that POSAs would have understood
`
`Luby to disclose “codes in which different information bits or groups of information
`
`bits contribute to different numbers of parity bits,” Ex. 1206, ¶59. Specifically, he
`
`explained that POSAs would understand Luby to teach assigning message
`- 18 -
`
`
`
`U.S. Patent No. 7,116,710
`Apple v. California Institute of Technology
`
`nodes—which are made up of information bits and parity bits—a higher degree than
`
`check nodes. Ex. 2033, 175:16-177:11. And, in the examples disclosed in Luby,
`
`e.g., Ex. 1204, 256, there are an insufficient number of high-degree message nodes
`
`to assign all information bits a single degree, thereby requiring that some
`
`information bits are repeated irregularly.
`
`Prof. Davis’s testimony regarding the Frey reference covers over seventy
`
`pages of the deposition transcript. Ex. 2033, 96:5-166:18. Caltech attacks
`
`Prof. Davis for not addressing certain aspects of Frey is his declaration—e.g.,
`
`puncturing, error floor. POR, 12-13. But those aspects were irrelevant to Prof.
`
`Davis’s analysis.
`
`Caltech argues that Dr. Davis “repeatedly contended that [Luby] does not
`
`define what it mean by ‘irregular’ despite Luby’s express statement to the contrary.”
`
`Id., 13. Yet, Caltech does not recite Luby’s alleged “express statement to the
`
`contrary.” And, a review of the page cited by Caltech—i.e., Ex. 1204, 249—comes
`
`up empty. As Dr. Davis accurately testified, “Luby never gives an explicit definition
`
`of what he means by irregular.” Ex. 2033, 181:10-11. Instead, Luby “gives intuition
`
`about what that is and he give examples of what those are, but, in terms of having an
`
`exact definition, we don’t have that.” Id., 183:5-9.
`
`Caltech’s criticism of Prof. Davis’s example of modifying an RA code to
`
`make it irregular by repeating certain information bits twice misses the mark. POR,
`- 19 -
`
`
`
`13; Ex. 1206, ¶¶132-124. Divsalar’s statement regarding the minimum number of
`
`U.S. Patent No. 7,116,710
`Apple v. California Institute of Technology
`
`
`repeats necessary in his regular codes is irrelevant to these irregular codes.
`
`Caltech’s argument that Prof. Davis’s declaration is entitled to little weight
`
`due to similarities to the Petition or an earlier expert report are equally misguided.
`
`POR, 14-15. Caltech first misrepresents the Board’s decision in Wowza Media
`
`Systems, LLC v. Adobe Systems, Inc. in which the Board afforded an expert
`
`declaration little weight because it included the same deficiencies as the petition.
`
`See IPR2013-00054, Paper 12, 12 (2013). Here, the Petition tracks Prof. Davis’s
`
`declaration because the declaration clearly lays out the case for unpatentability. Any
`
`similarity between the earlier Frey report and Dr. Davis’s declaration is due to the
`
`fact that they address the same subject, background of the patents and invalidity of
`
`the claims.
`
`Caltech’s claim that Prof. Davis was “unresponsive” to questions related to
`
`puncturing is contradicted by the very transcript Caltech cites. POR, 16 (citing Ex.
`
`2033, 152:12-159:14). Prof. Davis testified that if puncturing were removed from a
`
`specific example in Frey the rate of the code would go down, Ex. 2033, 153:9-154:5;
`
`requested additional information when counsel struggled to craft a hypothetical
`
`- 20 -
`
`
`
`U.S. Patent No. 7,116,710
`Apple v. California Institute of Technology
`
`scenario, id., 154:6-159:8; and testified that “[i]f you stop puncturing . . . the rate of
`
`the code will go down” when given that information, id., 159:9-14.4
`
`Caltech’s accusation of “shenanigans” during the deposition is baseless and
`
`unsupported by the record. POR, 16. Caltech’s counsel had an opportunity to ask
`
`Prof. Davis questions regarding what, if anything, was discussed during breaks.
`
`However, Caltech’s counsel chose to ask no questions and having forgone that
`
`opportunity cannot now complain. In any event, counsel did not instruct Prof. Davis
`
`to change his approach to answering questions.
`
`C. Caltech Fails to Antedate Frey.
`
`In IPR2017-00210 Caltech attempts to disqualify Frey as prior art.
`
`(IPR2017-00210 POR, 13-17.) While Caltech does not pursue the same argument in
`
`its POR in this proceeding, it did file a declaration from named inventor Jin that
`
`relates largely to the alleged conception and reduction to practice of the ’710 patent.
`
`Because the Petition uses Frey as evidence of a motivation to combine Luby and
`
`Divsalar, Petitioner addresses Caltech’s argument here.
`
`
`
`