throbber

`
`Exhibit 3 – Preliminary Claim Chart For U.S. Patent No. 7,916,781
`
`Claim Language
`
`Analysis
`
`Claim 1 [not asserted]
`
`
`
`[1] A method of encoding a signal,
`comprising:
`
`To the extent this preamble is construed to be limiting, the Accused Products practice a
`method of encoding a signal.
`
`For example, the Accused Products implement the IEEE Standards, which provide a
`method of encoding a signal.
`
`For example, the IEEE 802.11n-2009 amendment to the IEEE 802.11-2007 standard and
`the IEEE 802.11-2012 version of the 802.11 standard include “low-density parity check
`(LDPC) encoding.”
`
`IEEE 802.11n-2009 at § 5.2.9; IEEE 802.11-2012 at § 4.3.10; IEEE 802.11-2020 at
`§ 4.3.13 (emphasis added).
`
`
`
`CONFIDENTIAL
`
`1
`
`Page 1 of 93
`
`SAMSUNG EXHIBIT 1018
`
`

`

`
`
`Exhibit 3 – Preliminary Claim Chart For U.S. Patent No. 7,916,781
`
`Claim Language
`
`Analysis
`
`IEEE 802.11n-2009 at § 7.3.2.56.2; IEEE 802.11-2012 at § 8.4.2.58.2; IEEE 802.11-2020
`at § 9.4.2.55 (emphasis added).
`
`IEEE 802.11n-2009 at Table 7-43j; see also IEEE 802.11-2012 at Table 8-124; IEEE
`802.11-2020 at Table 9-184.
`
`
`
`
`
`
`
`CONFIDENTIAL
`
`2
`
`Page 2 of 93
`
`

`

`
`
`Exhibit 3 – Preliminary Claim Chart For U.S. Patent No. 7,916,781
`
`Claim Language
`
`Analysis
`
`IEEE 802.11n-2009 at § 9.6.0e.5.5; IEEE 802.11-2012 at § 9.7.6.5.5; IEEE 802.11-2020 at
`§ 10.6.6.5.7 (emphasis added).
`
`IEEE 802.11n-2009 at § 9.6.0e.7; 802.11-2012 at § 9.7.6.7; 802.11-2020 at
`§ 10.6.6.7(emphasis added)
`
`LDPC coding was incorporated into the IEEE 802.11 standard via the 802.11n-2009
`amendment. In general, the following sections of 802.11n discuss LDPC coding: § 9.7f,
`§ 20.3.11.6, Annex G at sections G.2 and G.3 and Annex R.
`
`IEEE 802.11n-2009 at § 9.7f; see also IEEE 802.11-2012 at § 9.14; IEEE 802.11-2020 at
`§ 10.15.
`
`
`
`
`
`
`
`CONFIDENTIAL
`
`3
`
`Page 3 of 93
`
`

`

`
`
`Exhibit 3 – Preliminary Claim Chart For U.S. Patent No. 7,916,781
`
`Claim Language
`
`Analysis
`
`* * *
`
`IEEE 802.11n-2009 at Table 20-1; IEEE 802.11-2012 at Table 20-1; IEEE 802.11-2020 at
`Table 19-1 (emphasis added).
`
`IEEE 802.11n-2009 at § 20.3.3 (emphasis added); see also IEEE 802.11-2012 at § 20.3.3;
`IEEE 802.11-2020 at § 19.3.3
`
`
`
`
`
`CONFIDENTIAL
`
`4
`
`Page 4 of 93
`
`

`

`
`
`Exhibit 3 – Preliminary Claim Chart For U.S. Patent No. 7,916,781
`
`Claim Language
`
`Analysis
`
`IEEE 802.11n-2009 at Fig. 20-3; IEEE 802.11-2012 at Fig. 20-3; IEEE 802.11-2020 at
`Fig. 19-3 (emphasis added)
`
`
`
`
`
`CONFIDENTIAL
`
`5
`
`Page 5 of 93
`
`

`

`
`
`Exhibit 3 – Preliminary Claim Chart For U.S. Patent No. 7,916,781
`
`Claim Language
`
`Analysis
`
`* * *
`
`* * *
`
`IEEE 802.11n-2009 at § 20.3.4 (emphasis added); see also IEEE 802.11-2012 at § 20.3.4;
`IEEE 802.11-2020 at § 19.3.4.
`
`CONFIDENTIAL
`
`6
`
`
`
`
`
`
`
`Page 6 of 93
`
`

`

`
`
`Exhibit 3 – Preliminary Claim Chart For U.S. Patent No. 7,916,781
`
`Claim Language
`
`Analysis
`
`* * *
`
`IEEE 802.11n-2009 at § 20.3.9.4.3, Table 20-10; see also IEEE 802.11-2012 at Table 20-
`11; IEEE 802.11-2020 at Table 19-11.
`
`IEEE 802.11n-2009 at § 20.3.11 (emphasis added); see also IEEE 802.11-2012 at
`§ 20.3.11.1; IEEE 802.11-2020 at § 19.3.11.1.
`
`
`
`
`
`
`
`
`
`IEEE 802.11n-2009 at § 20.3.11.3 (emphasis added); see also IEEE 802.11-2012 at
`§ 20.3.11.4; IEEE 802.11-2020 at § 19.3.11.4.
`
`CONFIDENTIAL
`
`7
`
`Page 7 of 93
`
`

`

`
`
`Exhibit 3 – Preliminary Claim Chart For U.S. Patent No. 7,916,781
`
`Claim Language
`
`Analysis
`
`IEEE 802.11n-2009 at § 20.3.11.6.1 (emphasis added); see also IEEE 802.11-2012 at
`§ 20.3.11.7; IEEE 802.11-2020 at § 19.3.11.7.
`
`* * *
`
`* * *
`
`IEEE 802.11n-2009 at Table 20-23; see also IEEE 802.11-2012 at Table 20-24; IEEE
`802.11-2020 at Table 19-24.
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`CONFIDENTIAL
`
`8
`
`* * *
`
`Page 8 of 93
`
`

`

`
`
`Exhibit 3 – Preliminary Claim Chart For U.S. Patent No. 7,916,781
`
`Claim Language
`
`Analysis
`
`IEEE 802.11n-2009 at Table 20-27 (emphasis added); see also IEEE 802.11-2012 at Table
`20-28.
`
`
`
`* * *
`
`
`
`
`
`IEEE 802.11n-2009 at Annex A, § A.4.19.2; see also IEEE 802.11-2012 at Annex B,
`§ B.4.19.2; IEEE 802.11-2020 at Annex B, § B.4.17.2.
`
`CONFIDENTIAL
`
`9
`
`Page 9 of 93
`
`

`

`
`
`Exhibit 3 – Preliminary Claim Chart For U.S. Patent No. 7,916,781
`
`Claim Language
`
`Analysis
`
`IEEE 802.11ax-2021 at Annex B, § B.4.33.2.
`
`See also IEEE 802.11n-2009 at § 20.3.11.6.3, Annex G, Annex R; IEEE 802.11-2012 at
`§ 20.3.11.7.3, Annex L, Annex F; IEEE 802.11-2020 at § 19.3.11.7.3, Annex I, Annex F.
`
`The Very High Throughput (“VHT”) PHY specification of the IEEE 802.11ac-2013
`amendment to the IEEE 802.11-2012 standard, which uses LDPC coding, is based on and
`incorporates the LDPC coding used in the High Throughput (“HT”) PHY, as defined in
`Clause 20 of the IEEE 802.11-2012 standard.
`
`
`
`CONFIDENTIAL
`
`10
`
`Page 10 of 93
`
`

`

`
`
`Exhibit 3 – Preliminary Claim Chart For U.S. Patent No. 7,916,781
`
`Claim Language
`
`Analysis
`
`IEEE 802.11ac-2013 at § 22.1.1 (emphasis added).
`
`
`
`
`
`CONFIDENTIAL
`
`11
`
`Page 11 of 93
`
`

`

`
`
`Exhibit 3 – Preliminary Claim Chart For U.S. Patent No. 7,916,781
`
`Claim Language
`
`Analysis
`
`IEEE 802.11ac-2013 at § 22.3.10.5.4 (emphasis added).
`
`The High Efficiency (“HE”) PHY specification of the IEEE 802.11ax-2021 amendment to
`the IEEE 802.11-2020 standard, which uses LDPC coding, is based on and incorporates
`the LDPC coding used in the High Throughput (“HT”) PHY, as defined in Clause 19 of the
`IEEE 802.11-2020 standard.
`
`
`
`CONFIDENTIAL
`
`12
`
`Page 12 of 93
`
`

`

`
`
`Exhibit 3 – Preliminary Claim Chart For U.S. Patent No. 7,916,781
`
`Claim Language
`
`Analysis
`
`IEEE 802.11ax-2021 at § 27.1.1 (emphasis added)
`
`
`
`CONFIDENTIAL
`
`13
`
`Page 13 of 93
`
`

`

`
`
`Exhibit 3 – Preliminary Claim Chart For U.S. Patent No. 7,916,781
`
`Claim Language
`
`Analysis
`
`
`
`
`
`IEEE 802.11ax-2021 at § 27.3.12.5.2 (emphasis added)
`
`On information and belief, products made or sold by Samsung that implement the IEEE
`Standards do so in such a way that infringes this limitation. To the extent that Samsung
`contends that their LDPC encoding and/or decoding implementations do not literally
`infringe the limitations of this claim, such differences are insubstantial and thus the claim
`limitations are satisfied under the doctrine of equivalents.
`
`CONFIDENTIAL
`
`14
`
`Page 14 of 93
`
`

`

`
`
`Exhibit 3 – Preliminary Claim Chart For U.S. Patent No. 7,916,781
`
`Claim Language
`
`Analysis
`
`[1a] receiving a block of data in the
`signal to be encoded, the block of data
`including information bits;
`
`The Accused Products receive a block of data in the signal to be encoded, the block of data
`including information bits.
`
`For example, the Accused Products implement the IEEE Standards, which receive a block
`of data in the signal to be encoded, the block of data including information bits.
`
`For example, the process of LDPC-encoding a signal per IEEE 802.11 includes obtaining a
`block of data in the signal to be encoded. The IEEE 802.11 LDPC codes are block codes.
`Each signal to be encoded, e.g. an MPDU from the MAC layer, is divided into one or more
`blocks of data including information bits as shown in Table 20-14.
`
`\
`
`CONFIDENTIAL
`
`15
`
`Page 15 of 93
`
`

`

`
`
`Exhibit 3 – Preliminary Claim Chart For U.S. Patent No. 7,916,781
`
`Claim Language
`
`Analysis
`
`IEEE 802.11n-2009 at § 20.3.11.6.2 (emphasis added); see also 802.11-2012 at
`§ 20.3.11.7.2; 802.11-2020 at § 19.3.11.7.2.
`
`
`
`IEEE 802.11n-2009 at § 20.3.11.6.3(emphasis added); see also IEEE 802.11-2012 at
`§ 20.3.11.7.3; IEEE 802.11-2020 at § 19.3.11.7.3.
`
`
`
`CONFIDENTIAL
`
`16
`
`Page 16 of 93
`
`

`

`
`
`Exhibit 3 – Preliminary Claim Chart For U.S. Patent No. 7,916,781
`
`Claim Language
`
`Analysis
`
`See also IEEE 802.11n-2009 at § 20.3.11.6.4, Tables R.1 to R.3 and IEEE 802.11-2012 at
`§ 20.3.11.7.4, Tables F-1 to F-3 and IEEE 802.11-2020 at § 19.3.11.7.4, Tables F-1 to F-3,
`showing “Parity-check matrices” in block form, thus further indicating that blocks of data
`in the signal are encoded.
`
`
`
`IEEE 802.11n-2009 at § 20.3.11.6.4; see also IEEE 802.11-2012 at § 20.3.11.7.4; IEEE
`802.11-2020 at § 19.3.11.7.4.
`
`
`
`CONFIDENTIAL
`
`17
`
`Page 17 of 93
`
`

`

`
`
`Exhibit 3 – Preliminary Claim Chart For U.S. Patent No. 7,916,781
`
`Claim Language
`
`Analysis
`
`IEEE 802.11n-2009 at Figure 20-13; see also IEEE 802.11-2012 at Figure 20-13; IEEE
`802.11-2020 at Figure 19-13.
`
`Annex G of IEEE 802.11n-2009 and Annex L of IEEE 802.11-2012 and Annex I of IEEE
`802.11-2020 provide examples of how a block of data in the signal to be encoded is
`received.
`
`
`
`CONFIDENTIAL
`
`18
`
`Page 18 of 93
`
`

`

`
`
`Exhibit 3 – Preliminary Claim Chart For U.S. Patent No. 7,916,781
`
`Claim Language
`
`Analysis
`
`IEEE 802.11n-2009 at Annex G, § G.2.1; see also IEEE 8022.11-2012 at Annex L,
`§ L.2.1; IEEE 802.11-2020 at Annex I, § I.2.2.
`
`
`
`
`
`
`
`CONFIDENTIAL
`
`19
`
`Page 19 of 93
`
`

`

`
`
`Exhibit 3 – Preliminary Claim Chart For U.S. Patent No. 7,916,781
`
`Claim Language
`
`Analysis
`
`* * *
`
`
`
`IEEE 802.11n-2009 at Annex G, § G.2.5; see also IEEE 802.11-2012 at Annex L, § L.2.5;
`IEEE 802.11-2020 at Annex I, § I.2.6.
`
`See also IEEE 802.11n-2009 at Annex G, § § G.3.1, G.3.5; IEEE 802.11-2012 at Annex L
`§ L.3.1, L.3.5; IEEE 802.11-2020 at Annex I, § I.3.2, I.3.6.
`
`On information and belief, products made or sold by Samsung that implement the IEEE
`Standards do so in such a way that infringes this limitation. To the extent that Samsung
`contends that their LDPC encoding and/or decoding implementations do not literally
`infringe the limitations of this claim, such differences are insubstantial and thus the claim
`limitations are satisfied under the doctrine of equivalents.
`
`For example, to the extent that Samsung contends that their LDPC encoding and/or
`decoding implementations do not literally infringe because they do not receive a block of
`data in a “signal” to be encoded, e.g., by construing “signal” to mean an analog waveform,
`the accused products would infringe under the doctrine of equivalents because they receive
`a block of data in a digital representation of a signal to be encoded. Whether or not the
`block of data is received from an analog waveform or its digital equivalent is an
`insubstantial difference: both scenarios accomplish substantially the same function of
`obtaining data to be encoded, in substantially the same way, i.e., processing that data as a
`block including information bits, and accomplish substantially the same result of preparing
`a block of data including information bits for encoding by the LDPC encoder.
`
`[1b] performing a first encoding
`operation on at least some of the
`information bits, the first encoding
`operation being a linear transform
`
`The Accused Products perform a first encoding operation on at least some of the
`information bits, the first encoding operation being a linear transform operation that
`generates L transformed bits.
`
`CONFIDENTIAL
`
`20
`
`Page 20 of 93
`
`

`

`
`
`Exhibit 3 – Preliminary Claim Chart For U.S. Patent No. 7,916,781
`
`Claim Language
`
`Analysis
`
`operation that generates L transformed
`bits; and
`
`For example, the Accused Products implement the IEEE Standards, which perform a first
`encoding operation on at least some of the information bits, the first encoding operation
`being a linear transform operation that generates L transformed bits.
`
`As shown below, the parity check matrices of the LDPC codes in the 802.11 standard use a
`dual diagonal pattern. This dual diagonal pattern permits efficient “first encoding” and
`“second encoding.”
`
`The 802.11 standard defines a codeword c = (i0,i1,…i(k-1), p0,p1,…p(n-k-1)), with information
`bits i and parity bits p. The parity bits p may be determined from a parity check matrix H
`by computing H x cT = 0.
`
`IEEE 802.11n-2009 at § 20.3.11.6.3 (emphasis added); see also IEEE802.11-2012 at
`§ 20.3.11.7.3; IEEE 802.11-2020 at § 19.3.11.7.3.
`
`The parity check matrix H for each block size and code rate is defined in Tables R.1 to R.3
`of the 802.11n-2009 amendment, and in Tables F-1 to F-3 of the 802.11-2012 standard;
`and the 802.11-2020 standard.
`
`
`
`* * *
`
`
`
`CONFIDENTIAL
`
`21
`
`Page 21 of 93
`
`

`

`
`
`Exhibit 3 – Preliminary Claim Chart For U.S. Patent No. 7,916,781
`
`Claim Language
`
`Analysis
`
`IEEE 802.11n-2009 at Annex R, Table R.1; see also IEEE 802.11-2012 at Annex F, Table
`F-1; IEEE 802.11-2020 at Annex F, Table F-1.
`
`
`
`
`
`CONFIDENTIAL
`
`22
`
`
`
`
`
`Page 22 of 93
`
`

`

`
`
`Exhibit 3 – Preliminary Claim Chart For U.S. Patent No. 7,916,781
`
`Claim Language
`
`Analysis
`
`IEEE 802.11n-2009 at § 20.3.11.6.4; see also IEEE 802.11-2012 at § 20.3.11.7.4; IEEE
`802.11-2020 at § 19.3.11.7.4.
`
`The parity check matrices may also be represented as a combination of two matrices, H1
`and H2, where H = [H1 H2], H1 is an (n-k) x k matrix, and H2 is an (n-k) x (n-k) matrix,
`such that H1 x iT + H2 x pT = 0, i = (i0,i1,…i(k-1)) and p = (p0,p1,…p(n-k-1)). The dual
`diagonal structure of H2 makes its inverse multiplication (and thus the encoding) efficient.
`
`The parity check matrices may be used to generate a Tanner Graph that reflects the code
`structure. The Tanner Graph representation of the 802.11 parity check matrices show the
`first encoding operation generating L transformed bits.
`
`For example, in the exemplary Tanner Graph shown below for the (648, 486) code (R =
`3/4), the dashed green rectangle illustrates the first encoding operation. This encoding
`operation takes 486 information bits as inputs and generate 162 transformed bits.
`
`CONFIDENTIAL
`
`23
`
`
`
`Page 23 of 93
`
`

`

`
`
`Exhibit 3 – Preliminary Claim Chart For U.S. Patent No. 7,916,781
`
`Claim Language
`
`Analysis
`
`See also Appendix B (showing exemplary Tanner Graph representations for all 12 parity
`check matrices defined in the 802.11 standards).
`
`Zooming in on the left-hand portion of the exemplary Tanner Graph shows that the
`information bits are inputs to the first encoding operation:
`
`
`See also Appendix B.
`
`The first encoding operation processes each information bit to generate a subset of the L
`transformed bits, reflected by the green line segments in the exemplary Tanner Graph, as
`shown below:
`
`
`
`CONFIDENTIAL
`
`24
`
`Page 24 of 93
`
`

`

`
`
`Exhibit 3 – Preliminary Claim Chart For U.S. Patent No. 7,916,781
`
`Claim Language
`
`Analysis
`
`
`
`See also Appendix B.
`
`Different information bits are used in different numbers of subsets of L transformed bits, as
`shown below:
`
`
`
`CONFIDENTIAL
`
`25
`
`Page 25 of 93
`
`

`

`
`
`Exhibit 3 – Preliminary Claim Chart For U.S. Patent No. 7,916,781
`
`Claim Language
`
`Analysis
`
`
`
`CONFIDENTIAL
`
`26
`
`Page 26 of 93
`
`

`

`
`
`Exhibit 3 – Preliminary Claim Chart For U.S. Patent No. 7,916,781
`
`Claim Language
`
`Analysis
`
`The information bits are interleaved, as shown below:
`
`
`
`CONFIDENTIAL
`
`27
`
`Page 27 of 93
`
`

`

`
`
`Exhibit 3 – Preliminary Claim Chart For U.S. Patent No. 7,916,781
`
`Claim Language
`
`Analysis
`
`See also Appendix B.
`
`Subsets of interleaved information bits are then summed at each check node, as represented
`in the exemplary Tanner Graph at the points where green line segments intersect with red
`line segments.
`
`
`
`CONFIDENTIAL
`
`28
`
`Page 28 of 93
`
`

`

`
`
`Exhibit 3 – Preliminary Claim Chart For U.S. Patent No. 7,916,781
`
`Claim Language
`
`Analysis
`
`
`
`
`
`See also Appendix B.
`
`The above illustrated first encoding operation is a linear transform operation because it is
`comprised of a series of linear operations—specifically, interleaving followed by binary
`summation.
`
`As shown by their corresponding exemplary Tanner Graphs, each of the eleven other parity
`check matrices provided in the 802.11 standard—(1944, 974); (1296, 648); (648, 324);
`(1944, 1296); (1296, 864); (648, 432); (1944, 1458); (1296, 972); (1944, 1620); (1296,
`1080); and (648,540)—define a code whose encoding involves a first encoding operation
`on at least some of the information bits, the first encoding operation being a linear
`transform operation that generates L transformed bits. See Appendix B.
`
`On information and belief, products made or sold by Samsung that implement the IEEE
`Standards do so in such a way that infringes this limitation. To the extent that Samsung
`
`CONFIDENTIAL
`
`29
`
`Page 29 of 93
`
`

`

`
`
`Exhibit 3 – Preliminary Claim Chart For U.S. Patent No. 7,916,781
`
`Claim Language
`
`Analysis
`
`[1c] performing a second encoding
`operation using the L transformed bits
`as an input, the second encoding
`operation including an accumulation
`operation in which the L transformed
`bits generated by the first encoding
`operation are accumulated, said second
`encoding operation producing at least a
`portion of a codeword, wherein L is
`
`two or more.
`
`contends that their LDPC encoding and/or decoding implementations do not literally
`infringe the limitations of this claim, such differences are insubstantial and thus the claim
`limitations are satisfied under the doctrine of equivalents.
`
`The Accused Products perform a second encoding operation using the L transformed bits
`as an input, the second encoding operation including an accumulation operation in which
`the L transformed bits generated by the first encoding operation are accumulated, said
`second encoding operation producing at least a portion of a codeword, wherein L is
`
`two or more.
`
`For example, the Accused Products implement the IEEE Standards, which perform a
`second encoding operation using the L transformed bits as an input, the second encoding
`operation including an accumulation operation in which the L transformed bits generated
`by the first encoding operation are accumulated, said second encoding operation producing
`at least a portion of a codeword, wherein L is two or more.
`
`As shown below, the parity check matrix of the LDPC codes in the 802.11 standard use a
`dual diagonal pattern. This dual diagonal pattern permits efficient “first encoding” and
`“second encoding.”
`
`The dual diagonal pattern results in the second encoding including an accumulation
`operation because at least some parity bits will be equal to the sum of a transformed bit and
`another parity bit. The second encoding operation generates parity bits, which are a portion
`of the codeword.
`
`CONFIDENTIAL
`
`30
`
`
`
`Page 30 of 93
`
`

`

`
`
`Exhibit 3 – Preliminary Claim Chart For U.S. Patent No. 7,916,781
`
`Claim Language
`
`Analysis
`
`IEEE 802.11n-2009 at § 20.3.11.6.3 (emphasis added); see also IEEE802.11-2012 at
`§ 20.3.11.7.3; IEEE 802.11-2020 at § 19.3.11.7.3.
`
`* * *
`
`
`
`IEEE 802.11n-2009 at Annex R, Table R.1; see also IEEE 802.11-2012 at Annex F, Table
`F-1; IEEE 802.11-2020 at Annex F, Table F-1.
`
`
`
`
`
`CONFIDENTIAL
`
`31
`
`Page 31 of 93
`
`

`

`
`
`Exhibit 3 – Preliminary Claim Chart For U.S. Patent No. 7,916,781
`
`Claim Language
`
`Analysis
`
`
`
`
`
`IEEE 802.11n-2009 at § 20.3.11.6.4; see also IEEE 802.11-2012 at § 20.3.11.7.4; IEEE
`802.11-2020 at § 19.3.11.7.4.
`
`The parity check matrices may be used to generate a Tanner Graph that reflects the code
`structure. The Tanner Graph representation of the 802.11 parity check matrices show the
`second encoding operation using the L transformed bits to generate at least a portion of a
`codeword.
`
`CONFIDENTIAL
`
`32
`
`Page 32 of 93
`
`

`

`
`
`Exhibit 3 – Preliminary Claim Chart For U.S. Patent No. 7,916,781
`
`For example, in the exemplary Tanner Graph shown below for the (648, 486) code (R =
`3/4), the dashed red rectangle illustrates the second encoding operation. This encoding
`operation takes 162 transformed bits as inputs and generates 162 parity bits.
`
`See also Appendix B (showing exemplary Tanner Graph representations for all 12 parity
`check matrices defined in the 802.11 standard).
`
`Zooming in on the right-hand portion of the exemplary Tanner Graph shows that the L
`transformed bits are inputs to the second encoding operation:
`
`
`
`CONFIDENTIAL
`
`33
`
`Page 33 of 93
`
`

`

`
`
`Exhibit 3 – Preliminary Claim Chart For U.S. Patent No. 7,916,781
`
`Claim Language
`
`Analysis
`
`
`
`See also Appendix B.
`
`The second encoding operation accumulates the L transformed bits to generate parity bits,
`as shown above. The zig-zagging red line segments reflect the accumulation of the L
`transformed bits to generate parity bits. The parity bits are at least a portion of the
`codeword.
`
`On information and belief, products made or sold by Samsung that implement the IEEE
`Standards do so in such a way that infringes this limitation. To the extent that Samsung
`contends that their LDPC encoding and/or decoding implementations do not literally
`infringe the limitations of this claim, such differences are insubstantial and thus the claim
`limitations are satisfied under the doctrine of equivalents.
`
`For example, to the extent that Samsung contends that their LDPC encoding and/or
`decoding implementations do not literally infringe because they do not perform distinct
`first and second encoding operations (e.g., because each parity bit is generated in a single
`
`CONFIDENTIAL
`
`34
`
`Page 34 of 93
`
`

`

`
`
`Exhibit 3 – Preliminary Claim Chart For U.S. Patent No. 7,916,781
`
`Claim Language
`
`Analysis
`
`operation that incorporates both of the claimed first and second encoding operations), the
`accused products would infringe under the doctrine of equivalents because they generate at
`parity bits by combining a plurality of information bits with previous parity bits. Whether
`or not the first and second encoding operations are performed separately, in sequence, or
`combined into a single step is an insubstantial difference: both scenarios accomplish
`substantially the same function of generating parity bits, in substantially the same way, i.e.,
`using a plurality of information bits and a previous parity bit to generate a successive
`parity bit, and accomplish substantially the same result of providing an efficient and
`effective linear error correction code.
`
`Alternatively, to the extent that Samsung contends that their LDPC encoding and/or
`decoding implementations do not literally infringe because they do not perform an
`accumulation (e.g., because parity bits are generated by computing the sum of the L
`transformed bits and other parity bits, without an accumulator), the accused products
`would infringe under the doctrine of equivalents because they generate parity bits by
`combining a plurality of information bits with previous parity bits. Whether or not this
`combination is performed in an accumulator (which performs a type of summation) is an
`insubstantial difference: both scenarios accomplish substantially the same function of
`generating parity bits, in substantially the same way, i.e., using a plurality of information
`bits and a previous parity bit to generate a successive parity bit, and accomplish
`substantially the same result of providing an efficient and effective linear error correction
`code.
`
`Claim 2 [not asserted]
`
`
`
`[2] The method of claim 1, further
`comprising:
`
`The Accused Products practice the method of claim 1.
`
`See supra [1]-[1c].
`
`[2a] outputting the codeword, wherein
`the codeword comprises parity bits.
`
`The Accused Products output a codeword, wherein the codeword comprises partiy bits.
`
`CONFIDENTIAL
`
`35
`
`Page 35 of 93
`
`

`

`
`
`Exhibit 3 – Preliminary Claim Chart For U.S. Patent No. 7,916,781
`
`Claim Language
`
`Analysis
`
`For example, the Accused Products implement the IEEE Standards, which output a
`codeword, wherein the codeword comprises partiy bits.
`
`For example, the LDPC encoder outputs a codeword “c” of size “n” that includes “k”
`information bits and “n-k” parity bits.
`
`IEEE 802.11n-2009 at § 20.3.11.6.3 (emphasis added); see also IEEE802.11-2012 at
`§ 20.3.11.7.3; IEEE 802.11-2020 at § 19.3.11.7.3.
`
`IEEE 802.11n-2009 at § 20.3.11.6.6 (emphasis added); see also IEEE 802.11-2012 at
`§ 20.3.11.7.6; IEEE 802.11-2020 § 19.3.11.7.6.
`
`
`
`
`
`CONFIDENTIAL
`
`36
`
`Page 36 of 93
`
`

`

`
`
`Exhibit 3 – Preliminary Claim Chart For U.S. Patent No. 7,916,781
`
`Claim Language
`
`Analysis
`
`IEEE 802.11n-2009 at Figure 20-13; IEEE 802.11-2012 at Figure 20-13; IEEE 802-11-
`2020 at Figure 19-13.
`
`On information and belief, products made or sold by Samsung that implement the IEEE
`Standards do so in such a way that infringes this limitation. To the extent that Samsung
`contends that their LDPC encoding and/or decoding implementations do not literally
`infringe the limitations of this claim, such differences are insubstantial and thus the claim
`limitations are satisfied under the doctrine of equivalents.
`
`
`
`Claim 3
`
`
`
`[3] The method of claim 2, wherein
`outputting the codeword comprises:
`
`The Accused Products practice the method of claim 2.
`
`See claim [2]-[2a].
`
`[3a] outputting the parity bits; and
`
`The Accused Products output the parity bits.
`
`CONFIDENTIAL
`
`37
`
`Page 37 of 93
`
`

`

`
`
`Exhibit 3 – Preliminary Claim Chart For U.S. Patent No. 7,916,781
`
`Claim Language
`
`Analysis
`
`For example, the Accused Products implement the IEEE Standards, which output the
`parity bits.
`
`For example, the LDPC encoder outputs a codeword “c” of size “n” that includes “k”
`information bits and “n-k” parity bits.
`
`IEEE 802.11n-2009 at § 20.3.11.6.3 (emphasis added); see also IEEE802.11-2012 at
`§ 20.3.11.7.3; IEEE 802.11-2020 at § 19.3.11.7.3.
`
`IEEE 802.11n-2009 at § 20.3.11.6.6 (emphasis added); see also IEEE 802.11-2012 at
`§ 20.3.11.7.6; IEEE 802.11-2020 at § 19.3.11.7.6.
`
`
`
`
`
`CONFIDENTIAL
`
`38
`
`Page 38 of 93
`
`

`

`
`
`Exhibit 3 – Preliminary Claim Chart For U.S. Patent No. 7,916,781
`
`Claim Language
`
`Analysis
`
`IEEE 802.11n-2009 at Figure 20-13; IEEE 802.11-2012 at Figure 20-13; IEEE 802.11-
`2020 at Figure 19-13.
`
`On information and belief, products made or sold by Samsung that implement the IEEE
`Standards do so in such a way that infringes this limitation. To the extent that Samsung
`contends that their LDPC encoding and/or decoding implementations do not literally
`infringe the limitations of this claim, such differences are insubstantial and thus the claim
`limitations are satisfied under the doctrine of equivalents.
`
`
`
`The Accused Products output at least some of the information bits.
`
`For example, the Accused Products implement the IEEE Standards, which output at least
`some of the information bits.
`
`For example, the LDPC encoder outputs a codeword “c” of size “n” that includes “k”
`information bits and “n-k” parity bits.
`
`[3b] outputting at least some of the
`information bits.
`
`CONFIDENTIAL
`
`39
`
`Page 39 of 93
`
`

`

`
`
`Exhibit 3 – Preliminary Claim Chart For U.S. Patent No. 7,916,781
`
`Claim Language
`
`Analysis
`
`IEEE 802.11n-2009 at § 20.3.11.6.3 (emphasis added); see also IEEE802.11-2012 at
`§ 20.3.11.7.3; IEEE 802.11-2020 at § 19.3.11.7.3.
`
`IEEE 802.11n-2009 at § 20.3.11.6.6 (emphasis added); see also IEEE802.11-2012 at
`§ 20.3.11.7.6; IEEE 802.11-2020 at § 19.3.11.7.6.
`
`
`
`
`
`CONFIDENTIAL
`
`40
`
`Page 40 of 93
`
`

`

`
`
`Exhibit 3 – Preliminary Claim Chart For U.S. Patent No. 7,916,781
`
`Claim Language
`
`Analysis
`
`IEEE 802.11n-2009 at Figure 20-13; IEEE 802.11-2012 at Figure 20-13; IEEE 802.11-
`2020 at Figure 19-13.
`
`On information and belief, products made or sold by Samsung that implement the IEEE
`Standards do so in such a way that infringes this limitation. To the extent that Samsung
`contends that their LDPC encoding and/or decoding implementations do not literally
`infringe the limitations of this claim, such differences are insubstantial and thus the claim
`limitations are satisfied under the doctrine of equivalents.
`
`
`
`Claim 4
`
`
`
`[4] The method of claim 3, wherein
`outputting the codeword comprises:
`
`The Accused Products practice the method of claim 3.
`
`See claim [3]-[3b].
`
`CONFIDENTIAL
`
`41
`
`Page 41 of 93
`
`

`

`
`
`Exhibit 3 – Preliminary Claim Chart For U.S. Patent No. 7,916,781
`
`Claim Language
`
`Analysis
`
`[4a] outputting the parity bits following
`the information bits.
`
`The Accused Products output the parity bits following the information bits.
`
`For example, the Accused Products implement the IEEE Standards, which output the
`parity bits following the information bits.
`
`For example, the LDPC encoder outputs a codeword “c” of size “n” that includes “k”
`information bits followed by “n-k” parity bits.
`
`IEEE 802.11n-2009 at § 20.3.11.6.3 (emphasis added); see also IEEE802.11-2012 at
`§ 20.3.11.7.3; IEEE 802.11-2020 at § 19.3.11.7.3.
`
`
`
`CONFIDENTIAL
`
`42
`
`Page 42 of 93
`
`

`

`
`
`Exhibit 3 – Preliminary Claim Chart For U.S. Patent No. 7,916,781
`
`Claim Language
`
`Analysis
`
`
`
`IEEE 802.11n-2009 at Figure 20-13; IEEE 802.11-2012 at Figure 20-13; IEEE 802.11-
`2020 at Figure 19-13.
`
`See also, e.g., IEEE 802.11n-2009 at Annex G, § G.2.5, G.3.5; IEEE 802.11-2012 at
`Annex L, § L.2.5, L.3.5; IEEE 802.11-2020 at Annex I, § I.2.6, I.3.6. (showing in
`examples that LDPC encoder appends parity bits after information bits).
`
`On information and belief, products made or sold by Samsung that implement the IEEE
`Standards do so in such a way that infringes this limitation. To the extent that Samsung
`contends that their LDPC encoding and/or decoding implementations do not literally
`infringe the limitations of this claim, such differences are insubstantial and thus the claim
`limitations are satisfied under the doctrine of equivalents.
`
`Claim 5
`
`
`
`CONFIDENTIAL
`
`43
`
`Page 43 of 93
`
`

`

`
`
`Exhibit 3 – Preliminary Claim Chart For U.S. Patent No. 7,916,781
`
`Claim Language
`
`Analysis
`
`[5] The method of claim 2, wherein
`performing the first encoding operation
`comprises transforming the at least
`some of the information bits via a low
`density generator matrix
`transformation.
`
`The Accused Products practice the method of claim 2.
`
`See claim [2]-[2a].
`
`In the Accused Products, performing the first encoding operation comprises transforming
`the at least some of the information bits via a low density generator matrix transformation.
`
`For example, the Accused Products implement the IEEE Standards, and in said standards
`performing the first encoding operation comprises transforming the at least some of the
`information bits via a low density generator matrix transformation.
`
`As shown below, the parity check matrix of the LDPC codes in the 802.11 standard use a
`dual diagonal pattern. This dual diagonal pattern permits efficient “first encoding” and
`“second encoding.”
`
`* * *
`
`
`
`
`
`IEEE 802.11n-2009 at Annex R, Table R.1; see also IEEE 802.11-2012 at Annex F, Table
`F-1; IEEE 802.11-2020 at Annex F, Table F-1.
`
`CONFIDENTIAL
`
`44
`
`Page 44 of 93
`
`

`

`
`
`Exhibit 3 – Preliminary Claim Chart For U.S. Patent No. 7,916,781
`
`Claim Language
`
`Analysis
`
`
`
`
`
`
`
`IEEE 802.11n-2009 at § 20.3.11.6.4; see also IEEE 802.11-2012 at § 20.3.11.7.4; IEEE
`802.11-2020 at § 19.3.11.7.4.
`
`As shown in [1b] and [1c], the 802.11 LDPC codes can be represented using a Tanner
`Graph that includes the claimed first and second encoding operations.
`
`This first encoding operation can also be described using a low density generator matrix
`(LDGM). An exemplary LDGM for the (648, 486) LDPC code (R=3/4) is shown below.
`The matrix is 486 by 162. Dots are used to show the locations in the LDGM that are equal
`to one. All other locations are equal to zero. Other LDGMs with the information bits
`(inputs) and check nodes (outputs) in a different order may also be used, and would satisfy
`the claim limitation.
`
`CONFIDENTIAL
`
`45
`
`Page 45 of 93
`
`

`

`
`
`Exhibit 3 – Preliminary Claim Chart For U.S. Patent No. 7,916,781
`
`Claim Language
`
`Analysis
`
`See also Appendix B (showing corresponding exemplary LDGMs for all 12 parity check
`matrices defined in the 802.11 standard).
`
`Analysis of the 12 parity check matrices defined in the 802.11 standard shows the
`generator matrix used in connection with the first encoding operation is low density. The
`following are the densities of exemplary LDGMs generated from the 12 parity check
`matrices defined in the 802.11 standard:
`
`
`
`CONFIDENTIAL
`
`46
`
`Page 46 of 93
`
`

`

`
`
`Exhibit 3 – Preliminary Claim Chart For U.S. Patent No. 7,916,781
`
`Claim Language
`
`Analysis
`
`LDGM Number Density
`LDGM 1
`1.6204%
`LDGM 2
`2.0544%
`LDGM 3
`2.572%
`LDGM 4
`3.6574%
`LDGM 5
`0.78447%
`LDGM 6
`1.0272%
`LDGM 7
`1.286%
`LDGM 8
`1.7593%
`LDGM 9
`0.52298%
`LDGM 10
`0.6848%
`LDGM 11
`0.82305%
`LDGM 12
`1.0802%
`
`On information and belief, products made or sold by Samsung that implement the IEEE
`Standards do so in such a way that infringes this limitation. To the extent that Samsung
`contends that their LDPC encoding and/or decoding implementations do not literally
`infringe the limitations of this claim, such differences are insubstantial and thus the claim
`limitations are satisfied under the doctrine of equivalents.
`
`For example, to the extent that Samsung contends that their LDPC encoding and/or
`decoding implementations do not literally infringe because they do not perform

This document is available on Docket Alarm but you must sign up to view it.


Or .

Accessing this document will incur an additional charge of $.

After purchase, you can access this document again without charge.

Accept $ Charge
throbber

Still Working On It

This document is taking longer than usual to download. This can happen if we need to contact the court directly to obtain the document and their servers are running slowly.

Give it another minute or two to complete, and then try the refresh button.

throbber

A few More Minutes ... Still Working

It can take up to 5 minutes for us to download a document if the court servers are running slowly.

Thank you for your continued patience.

This document could not be displayed.

We could not find this document within its docket. Please go back to the docket page and check the link. If that does not work, go back to the docket and refresh it to pull the newest information.

Your account does not support viewing this document.

You need a Paid Account to view this document. Click here to change your account type.

Your account does not support viewing this document.

Set your membership status to view this document.

With a Docket Alarm membership, you'll get a whole lot more, including:

  • Up-to-date information for this case.
  • Email alerts whenever there is an update.
  • Full text search for other cases.
  • Get email alerts whenever a new case matches your search.

Become a Member

One Moment Please

The filing “” is large (MB) and is being downloaded.

Please refresh this page in a few minutes to see if the filing has been downloaded. The filing will also be emailed to you when the download completes.

Your document is on its way!

If you do not receive the document in five minutes, contact support at support@docketalarm.com.

Sealed Document

We are unable to display this document, it may be under a court ordered seal.

If you have proper credentials to access the file, you may proceed directly to the court's system using your government issued username and password.


Access Government Site

We are redirecting you
to a mobile optimized page.





Document Unreadable or Corrupt

Refresh this Document
Go to the Docket

We are unable to display this document.

Refresh this Document
Go to the Docket