Case 1:07-md-01848-GMS
Document 264
Filed 07/07/2008
Page 1 of 16
IN THE UNITED STATES DISTRICT COURT FOR THE DISTRICT OF DELAWARE ) ) ) MDL Docket No. 07-md-1848 (GMS) ) ) ) )
In re: REMBRANDT TECHNOLOGIES, LP PATENT LITIGATION
JOINT APPENDIX OF INTRINSIC AND EXTRINSIC EVIDENCE FOR `627 PATENT
Collins J. Seitz, Jr. (#2237) Francis DiGiovanni (#3189) James D. Heisman (#2746) Connolly Bove Lodge & Hutz LLP 1007 N. Orange Street P.O. Box 2207 Wilmington, Delaware 19899 (302) 658-9141 [email protected] [email protected] [email protected] Attorneys for Rembrandt Technologies, LP and Rembrandt Technologies, LLC
Jack B. Blumenfeld (#1014) Karen Jacobs Louden (#2881) Morris, Nichols, Arsht & Tunnell LLP 1201 N. Market Street P.O. Box 1347 Wilmington, DE 19899 (302) 658-9200 [email protected] [email protected] Liaison Counsel for `627 Patent Infringement Defendants
Dated: July 7, 2008
Case 1:07-md-01848-GMS
Document 264
Filed 07/07/2008
Page 2 of 16
JOINTLY SUBMITTED EXHIBITS Tab 1 Description U.S. Patent No. 5,243,627 Party Citing Defendants Rembrandt Pages A001-A012
PLAINTIFFS' EXHIBITS Tab 2 3 Description U.S. Patent No. 4,677,625 Chart of Rembrandt and All Other Parties' Proposed Constructions for U.S. Patent No. 5,243,627 and the Texas Court's Claim Constructions from Rembrandt Technologies, L.P. v. Comcast, Corp., et al. Newton's Telecom Dictionary , relevant pages Memorandum Opinion and Order in the Texas Court's Rembrandt Technologies, L.P. v. Comcast, Corp., et al. 05-443, Dated June 5, 2007 Richard D. Gitlin Deposition dated June 23, 2008, relevant pages Party Citing Rembrandt Rembrandt Pages B001-B013 B014-B016
4
Rembrandt
B017-B018
5
Rembrandt
B019-B040
6
Rembrandt
B041-B055
DEFENDANTS' EXHIBITS Tab 7 Description Declaration of Richard D. Gitlin Exhibit A - Declaration of Richard D. Gitlin, Curriculum Vitae Party Citing Defendants Defendants Pages D0001-D0018 D0019-D0027
1
Case 1:07-md-01848-GMS
Document 264
Filed 07/07/2008
Page 3 of 16
Exhibit B - Declaration of Richard D. Gitlin, "TrellisCoded Modulation with Redundant Signal Sets Part I: Introduction" IEEE Communications Magazine, Vol. 25, No. 2, pp. 5-11, February 1987 Exhibit C - Declaration of Richard D. Gitlin, "TrellisCoded Modulation with Multidimensional Constellations", IEEE Transactions on Information Theory, Vol. 33, No. 4. July 1987 Exhibit D - Declaration of Richard D. Gitlin, U.S. Patent No. 4,641,327 Exhibit E - Declaration of Richard D. Gitlin, U.S. Patent No. 4,755,998 Exhibit F - Declaration of Richard D. Gitlin, U.S. Patent No. 5,214,656
Defendants
D0028-D0034
Defendants
D0035-D0053
Defendants
D0054-D0065
Defendants
D0066-D0078
Defendants
D0079-D0091
Exhibit G - Declaration of Defendants Richard D. Gitlin, Robert G. Gallager, INFORMATION THEORY AND RELIABLE COMMUNICATION 287 (John Wiley & Sons 1968) Exhibit H - Declaration of Richard D. Gitlin, U.S. Patent No. 4,677,625 8 Claim Charts for U.S. Patent No. 5,243,627 Richard D. Gitlin Deposition dated June 23, 2008 Defendants
D0092-D0097
D0098-D0105
Defendants
D106-D111
9
Defendants
D112-D184
2
Case 1:07-md-01848-GMS
Document 264
Filed 07/07/2008
Page 4 of 16
TAB 1
Case 1:07-md-01848-GMS
Document 264
Filed 07/07/2008
Page 5 of 16
Case 1:07-md-01848-GMS
Document 264
Filed 07/07/2008
Page 6 of 16
Case 1:07-md-01848-GMS
Document 264
Filed 07/07/2008
Page 7 of 16
Case 1:07-md-01848-GMS
Document 264
Filed 07/07/2008
Page 8 of 16
Case 1:07-md-01848-GMS
Document 264
Filed 07/07/2008
Page 9 of 16
Case 1:07-md-01848-GMS
Document 264
Filed 07/07/2008
Page 10 of 16
Case 1:07-md-01848-GMS
Document 264
Filed 07/07/2008
Page 11 of 16
Case 1:07-md-01848-GMS
Document 264
Filed 07/07/2008
Page 12 of 16
Case 1:07-md-01848-GMS
Document 264
Filed 07/07/2008
Page 13 of 16
Case 1:07-md-01848-GMS
Document 264
Filed 07/07/2008
Page 14 of 16
Case 1:07-md-01848-GMS
Document 264
Filed 07/07/2008
Page 15 of 16
Case 1:07-md-01848-GMS
Document 264
Filed 07/07/2008
Page 16 of 16
Case 1:07-md-01848-GMS
Document 264-2
Filed 07/07/2008
Page 1 of 44
TAB 2
Case 1:07-md-01848-GMS
Document 264-2
Filed 07/07/2008
Page 2 of 44
Case 1:07-md-01848-GMS
Document 264-2
Filed 07/07/2008
Page 3 of 44
Case 1:07-md-01848-GMS
Document 264-2
Filed 07/07/2008
Page 4 of 44
Case 1:07-md-01848-GMS
Document 264-2
Filed 07/07/2008
Page 5 of 44
Case 1:07-md-01848-GMS
Document 264-2
Filed 07/07/2008
Page 6 of 44
Case 1:07-md-01848-GMS
Document 264-2
Filed 07/07/2008
Page 7 of 44
Case 1:07-md-01848-GMS
Document 264-2
Filed 07/07/2008
Page 8 of 44
Case 1:07-md-01848-GMS
Document 264-2
Filed 07/07/2008
Page 9 of 44
Case 1:07-md-01848-GMS
Document 264-2
Filed 07/07/2008
Page 10 of 44
Case 1:07-md-01848-GMS
Document 264-2
Filed 07/07/2008
Page 11 of 44
Case 1:07-md-01848-GMS
Document 264-2
Filed 07/07/2008
Page 12 of 44
Case 1:07-md-01848-GMS
Document 264-2
Filed 07/07/2008
Page 13 of 44
Case 1:07-md-01848-GMS
Document 264-2
Filed 07/07/2008
Page 14 of 44
Case 1:07-md-01848-GMS
Document 264-2
Filed 07/07/2008
Page 15 of 44
TAB 3
Case 1:07-md-01848-GMS
Document 264-2
Filed 07/07/2008
Page 16 of 44
Case 1:07-md-01848-GMS
Document 264-2
Filed 07/07/2008
Page 17 of 44
Case 1:07-md-01848-GMS
Document 264-2
Filed 07/07/2008
Page 18 of 44
Case 1:07-md-01848-GMS
Document 264-2
Filed 07/07/2008
Page 19 of 44
TAB 4
Case 1:07-md-01848-GMS
Document 264-2
Filed 07/07/2008
Page 20 of 44
Case 1:07-md-01848-GMS
Document 264-2
Filed 07/07/2008
Page 21 of 44
Case 1:07-md-01848-GMS
Document 264-2
Filed 07/07/2008
Page 22 of 44
TAB 5
Case 1:07-md-01848-GMS
Document 264-2
Filed 07/07/2008
Page 23 of 44
Case 1:07-md-01848-GMS
Document 264-2
Filed 07/07/2008
Page 24 of 44
Case 1:07-md-01848-GMS
Document 264-2
Filed 07/07/2008
Page 25 of 44
Case 1:07-md-01848-GMS
Document 264-2
Filed 07/07/2008
Page 26 of 44
Case 1:07-md-01848-GMS
Document 264-2
Filed 07/07/2008
Page 27 of 44
Case 1:07-md-01848-GMS
Document 264-2
Filed 07/07/2008
Page 28 of 44
Case 1:07-md-01848-GMS
Document 264-2
Filed 07/07/2008
Page 29 of 44
Case 1:07-md-01848-GMS
Document 264-2
Filed 07/07/2008
Page 30 of 44
Case 1:07-md-01848-GMS
Document 264-2
Filed 07/07/2008
Page 31 of 44
Case 1:07-md-01848-GMS
Document 264-2
Filed 07/07/2008
Page 32 of 44
Case 1:07-md-01848-GMS
Document 264-2
Filed 07/07/2008
Page 33 of 44
Case 1:07-md-01848-GMS
Document 264-2
Filed 07/07/2008
Page 34 of 44
Case 1:07-md-01848-GMS
Document 264-2
Filed 07/07/2008
Page 35 of 44
Case 1:07-md-01848-GMS
Document 264-2
Filed 07/07/2008
Page 36 of 44
Case 1:07-md-01848-GMS
Document 264-2
Filed 07/07/2008
Page 37 of 44
Case 1:07-md-01848-GMS
Document 264-2
Filed 07/07/2008
Page 38 of 44
Case 1:07-md-01848-GMS
Document 264-2
Filed 07/07/2008
Page 39 of 44
Case 1:07-md-01848-GMS
Document 264-2
Filed 07/07/2008
Page 40 of 44
Case 1:07-md-01848-GMS
Document 264-2
Filed 07/07/2008
Page 41 of 44
Case 1:07-md-01848-GMS
Document 264-2
Filed 07/07/2008
Page 42 of 44
Case 1:07-md-01848-GMS
Document 264-2
Filed 07/07/2008
Page 43 of 44
Case 1:07-md-01848-GMS
Document 264-2
Filed 07/07/2008
Page 44 of 44
Case 1:07-md-01848-GMS
Document 264-3
Filed 07/07/2008
Page 1 of 16
TAB 6
Case 1:07-md-01848-GMS
Document 264-3
Filed 07/07/2008
Page 2 of 16
Case 1:07-md-01848-GMS
Document 264-3
Filed 07/07/2008
Page 3 of 16
Case 1:07-md-01848-GMS
Document 264-3
Filed 07/07/2008
Page 4 of 16
Case 1:07-md-01848-GMS
Document 264-3
Filed 07/07/2008
Page 5 of 16
Case 1:07-md-01848-GMS
Document 264-3
Filed 07/07/2008
Page 6 of 16
Case 1:07-md-01848-GMS
Document 264-3
Filed 07/07/2008
Page 7 of 16
Case 1:07-md-01848-GMS
Document 264-3
Filed 07/07/2008
Page 8 of 16
Case 1:07-md-01848-GMS
Document 264-3
Filed 07/07/2008
Page 9 of 16
Case 1:07-md-01848-GMS
Document 264-3
Filed 07/07/2008
Page 10 of 16
Case 1:07-md-01848-GMS
Document 264-3
Filed 07/07/2008
Page 11 of 16
Case 1:07-md-01848-GMS
Document 264-3
Filed 07/07/2008
Page 12 of 16
Case 1:07-md-01848-GMS
Document 264-3
Filed 07/07/2008
Page 13 of 16
Case 1:07-md-01848-GMS
Document 264-3
Filed 07/07/2008
Page 14 of 16
Case 1:07-md-01848-GMS
Document 264-3
Filed 07/07/2008
Page 15 of 16
Case 1:07-md-01848-GMS
Document 264-3
Filed 07/07/2008
Page 16 of 16
Case 1:07-md-01848-GMS
Document 264-4
Filed 07/07/2008
Page 1 of 28
TAB 7
Case 1:07-md-01848-GMS
Document 264-4
Filed 07/07/2008
Page 2 of 28
IN THE UNITED STATES DISTRICT COURT FOR THE DISTRICT OF DELAWARE ) ) ) ) )
In Re: REMBRANDT TECHNOLOGIES, LP PATENT LITIGATION
MDL Docket No. 07-md-1848 (GMS)
DECLARATION OF DR. RICHARD D. GITLIN I, Richard D. Gitlin, declare as follows: 1. The purpose of this declaration is to provide a concise guided tour of the technology in U.S. Pat. No. 5,243,627 -- a system and method for transmitting digital data over a communication channel -- by discussing three techniques used to reduce a system's error-rate: two-dimensional trellis-coded modulation (2-D TCM), multidimensional (greater than 2-D) TCM, and interleaving. I will also discuss the concept of a state transition, which is key to understanding these techniques, and address some of the disputed claim terms from the '627 patent from the perspective of one of ordinary skill in the art. In particular, I explain that a single state transition in a 2-D TCM system produces one expanded bit-group corresponding to one 2-D signal point transmitted in one signaling interval; by contrast, a single state transition in a multidimensional TCM system also produces one expanded bit-group, but it corresponds to multiple 2-D signal points transmitted over multiple signaling intervals. 2. At the end of this month, I will become the Agere-Cerrent Distinguished Professor of Electrical Engineering at the University of South Florida. From 1969 to 2001, I held several positions at AT&T Bell Labs/Lucent Technologies in the field of data communications, including Vice President of R&D and CTO of the Data Networking Systems Group at Lucent and Senior Vice President of Communications Sciences Research at Bell Labs. In those thirty-plus years, I
D0001
Case 1:07-md-01848-GMS
Document 264-4
Filed 07/07/2008
Page 3 of 28
contributed to and gained experience with a variety of signal processing techniques for information transmission. During my career, I have co-authored the textbook DATA COMMUNICATIONS PRINCIPLES, and have been named as an inventor on over forty patents, and co-authored three prize papers. I have also been honored for my accomplishments by being appointed an IEEE Fellow and an AT&T Bell Labs Fellow, and by being elected a member of the National Academy of Engineering. My curriculum vitae is attached as Exhibit A. Transmitting Digital Data 3. Although the most elemental form of digital data are binary digits called bits, represented by 1's or 0's, channels that span great distances do not typically carry bits directly. Instead, such channels carry bits indirectly by using a signal known as a carrier wave. The transmitted signal is chosen to have characteristics to match those of the analog communication channel, such as its center frequency and bandwidth.
4. Using a process called modulation, digital data is transformed into a signal that is appropriate for transmission over a communication channel. As part of this process, a transmitter varies one or more characteristics of a carrier wave (such as its amplitude, frequency, or phase) in response to the information to be communicated over the channel. Typically, carrier waves are modulated once every period of time called a signaling interval to convey a group of one or more bits. The process of recovering the digital data from the received signal (i.e., the output of the
2 D0002
Case 1:07-md-01848-GMS
Document 264-4
Filed 07/07/2008
Page 4 of 28
channel) is called demodulation. A device capable of performing both processes is known as a modem, short for modulator-demodulator. 5. For modems to communicate successfully, the transmitter will vary the carrier wave in only a limited number of predefined ways, and each variation will uniquely convey a defined number of bits. This type of signaling scheme is graphically represented by a signal constellation. For example, shown below is a signaling scheme illustrated as a two-dimensional, circular signal constellation composed of eight signal points, P0P7, where each signal point conveys three bits1 (high-performance, bandwidth-efficient communication systems always convey more than one bit per signal point). Although Fig. 2 of the '627 patent discloses a signal constellation with thirty-two signal points, each corresponding to five bits, the eight-point signaling scheme embodies the same basic principles and reduces the complexity of the examples below.
6. Each of the eight signal points on the constellation depicted above represents discrete values of both the I and Q components of a carrier wave -- i.e., a transmitted signal -- and conveys a unique group of three bits. The two axes of the signal constellation represent, respectively, the amplitude of the cosine component of the carrier wave (the horizontal or in-phase I-axis) and
If each transmitted signal conveys N bits, the constellation requires 2N signal points, which in our example is 23 or eight signal points. In the '627 patent, each transmitted signal conveys five bits, so the constellation requires 25 or thirty-two signal points. 3 D0003
1
Case 1:07-md-01848-GMS
Document 264-4
Filed 07/07/2008
Page 5 of 28
the amplitude of the sine component of the carrier wave (the vertical or quadrature Q-axis). Accordingly, each signal point may also be referred to by its two coordinate values: (I, Q)2 Channel Noise and Interference 7. Noise, or other impairments in a communication channel, can distort the characteristics of the transmitted, modulated carrier wave. If the noise is large enough, this may cause the receiver to make errors in attempting to recover the transmitted information. For example, assume a transmitter sends the signal corresponding to P2 and noise causes it to be received as the signal Z that has I and Q values falling between P2 and P1 in the signal constellation as illustrated below:
In an uncoded system, a receiver will decide that the transmitter sent the signal point that is closest to the received signal. So in this example, the receiver would decide that the received signal Z corresponds to the transmitted signal point P1, instead of P2; this would result in bit-errors during reception by outputting the bit sequence 0 0 1 instead of 0 1 0. 8. One means to improve the reliability of an uncoded communication system in the presence of noise and other signal degradations is through the use of error-control codes. These codes introduce extra bits used to improve system performance, e.g., by lowering the system's error-rate. But adding extra bits generally increases the required bandwidth, and the bandwidth is limited in many applications and cannot be easily increased. For example, the '627 patent refers to "a transmitted signal point having coordinates (3, -5)" at 5:61-64. 4 D0004
2
Case 1:07-md-01848-GMS
Document 264-4
Filed 07/07/2008
Page 6 of 28
Trellis-Coded Modulation 9. In the 1970s, Gottfried Ungerboeck pioneered a solution to this problem called TCM or trellis-coded modulation. TCM combines modulation and coding to improve system performance without increasing the system's bandwidth requirements. As with other error-control techniques, TCM constrains the sequence of transmitted signals, which is the succession, in time, of signals produced by the transmitter. TCM also exploits the constraints on the signaling scheme to increase the distance between allowable signal sequences. The distance between any two signal sequences is a cumulative function of the distance between each sequence's constituent signal points. 10. Increasing distances between allowable sequences lowers the probability that one transmitted sequence will be mistaken for another in the receiver because of channel noise. For example, a receiver knowing that TCM restricts the next signal in the transmitted sequence to P0, P4, P2, or P6 would not decide that P1 was transmitted when presented with the received signal Z from the example above since P1 is not one of the signal points in an allowed sequence. 11. To appreciate how TCM works, consider the relevant components of a TCM system3 as illustrated below:
The TCM system used in this section is a simplified version of the four-state trellis-coded eight-phase modulation (8-PSK) discussed by Ungerboeck in "Trellis-Coded Modulation with Redundant Signal Sets Part I: Introduction" IEEE Communications Magazine, Vol. 25, No. 2, pp. 5-11, February 1987 (attached as Exhibit B) which predates the '627 patent. 5 D0005
3
Case 1:07-md-01848-GMS
Document 264-4
Filed 07/07/2008
Page 7 of 28
The component on the left is an encoder that expands two parallel input bits4 (x2 x1) into a three-bit group (y2 y1 y0) once every signaling interval as a function of an XOR gate ( ) and the bit stored
in each time-delay element (T); the middle component maps the expanded three-bit groups (y2 y1 y0) into one of eight signal points (P0P7) depending on the values of y2, y1, and y0; and the constellation on the right defines each signal point's I and Q coordinates -- i.e., the transmitted signals. State Transitions 12. TCM systems lower the error-rate as described above by using the extra bits produced by time-constrained state transitions. In the example encoder, once every signaling interval (T seconds), an extra bit is produced by the XOR gate ( ), which logically operates on two binary
inputs, outputting a 0 when the inputs are the same and a 1 when they differ. As shown below, the bits stored in the time-delay elements ( ) represent the state of the encoder. For example,
when both of the stored bits are 0, the encoder's state is S0:
Each time-delay element stores either a 1 or a 0, so the encoder has four possible states: S0 = 00; S1 = 01; S2 = 10; and S3 = 11. Each time the encoder produces an expanded bit-group in response to an input, the bits stored in the time-delay elements are updated. This expansion process results in a new state and is called a state transition. 13. As demonstrated below, each state transition depends on the encoder's input as well as its current state. Consequently, the encoder's new state and output are dependent on the encoder's
4
The serial user input stream (not shown) is converted into two parallel input bit streams. 6 D0006
Case 1:07-md-01848-GMS
Document 264-4
Filed 07/07/2008
Page 8 of 28
previous history; because of these dependencies, the allowable values for the new state are constrained. This creates a time-dependency among a sequence of expanded bit-groups from the same encoder. By considering all the allowable sequences of state transitions -- and the signal history they represent -- a decoder can compare each allowable sequence of state transitions with the sequence of received signals and ultimately determine which signal points were most likely to have been transmitted. 14. At the encoder, the process of choosing signal points can be considered in two parts: some bits identify one of several possible subsets of signal points, and the remaining bits select a particular signal point from within the identified subset. The examples shown below (in color) illustrate how state transitions produce expanded bit-groups that identify subsets of signal points and select particular points from within those subsets. First assume that at time instant n, the encoder's state is S0 = 00 and the value of the x1 input-bit5 is 1. In response to the input, the encoder undergoes a state transition which produces the output shown on the right side of the figure below -- an expanded bit-group.
Specifically, the x2 input-bit (
) becomes the y2 output-bit, the x1 input-bit (
) becomes the y1
output bit, and the bit stored in the right time-delay element ( addition, the bit stored in the left time-delay element ( right time-delay element ( on its two inputs (
5
) becomes the y0 output bit. In
) is replaced with the bit stored in the ) based
), which is itself replaced by the output of the XOR gate ( ).
and
Because the x2 input-bit is not used to determine the next state of the encoder, it is left unassigned in this example. Its effect on the actual signal point selected is discussed below. 7 D0007
Case 1:07-md-01848-GMS
Document 264-4
Filed 07/07/2008
Page 9 of 28
15. Thus, from time instant n to time instant n+1, the state transitions from S0 = S1 = ( and the encoder produces an expanded bit-group ( ) and y0 (
to
). As shown below, the y1
) bits identify a subset of signal points (P2 and P6), and the y2 bit selects which of
those two points will be transmitted.
Note that P2 and P6 are separated by the maximum distance possible, lowering the probability that one transmitted sequence of signal points will be mistaken for another in the receiver because of channel noise. 16. If, however, the value of the x1 input-bit had been 0, the state would have transitioned from S0 = bit-group ( back to S0 = and the encoder would have produced a different expanded
), which identifies a different subset of signal points6 (P0 and P4) again
separated by the maximum distance:
In this example the four possible subsets (00, 01, 10, and 11) are determined solely by the y1 and y0 bits. Similarly, the examples in the '627 patent also use two-bit subset identifiers (00, 01, 10, 11) and refer to the resulting four subsets as A, B, C, and D. 8 D0008
6
Case 1:07-md-01848-GMS
Document 264-4
Filed 07/07/2008
Page 10 of 28
Trellis Diagrams 17. The constraint on the number of allowable state transitions produces a limited number of allowable transmitted sequences of signal points, which improves the system's error-rate. The two examples above illustrate the only state transitions from S0 that are allowed: S0 S1 or S0. Transitions from the other initial states are similarly restricted: S1 S2 or S3; S2 S0 or S1; and S3 S2 or S3. Allowable state transitions are graphically represented on a trellis diagram (named for its resemblance to a garden trellis). The following trellis diagram illustrates the allowable state transitions for the TCM system discussed here:
The sequence of state transitions produces a path over time (n+2, n+3, etc...), where each state transition is subject to the same constraints. Each state transition, in addition to producing a new state, produces an expanded bit-group that, in this case, leads to the transmission of one signal point. The TCM receiver will estimate the sequence of transmitted states using the received signal samples and the knowledge of the allowable state transitions. The time dependency between the signal points in the transmitted signal sequence enables the receiver to more accurately estimate the transmitted signal sequences corresponding to the state transitions. 18. Although the x2 input-bit is not used to determine the next state of the encoder, it does become part of the expanded bit-group as the y2 bit and is used to select a specific point from the subset of signal points identified by the state transition. In the examples above, x2 is always equal 9 D0009
Case 1:07-md-01848-GMS
Document 264-4
Filed 07/07/2008
Page 11 of 28
to y2, but more complex TCM systems often use multiple bits to select points from within subsets or perform additional operations on the input bit(s) or both.7 Here, however, the value of x2 may only be 1 or 0, so each possible state transition may only result in one of two signal points. The signal points possible with each state transition can be added to the trellis diagram above to illustrate a complete set of restrictions for this TCM system:
19. At the receiver, the decoder analyzes the sequence of received signals, and along with knowledge of the trellis encoding structure, uses the Viterbi algorithm to determine the most likely sequence that was sent. Decoders using the Viterbi algorithm analyze the received signals by following multiple paths of state transitions from each state and determining their relative likelihood (or probability) of having been transmitted. In this way, a TCM decoding system estimates the state transition path at the transmitter from one signaling interval to the next for each state. This process of tracking signals through time minimizes the effects of channel noise.
For example, the 2-D TCM system disclosed in the '627 patent sends a group of three bits that are not used to determine the next state of the encoder through a "modulus converter" to produce an "index value" used to select one of eight signal points from one of the subsets A, B, C, or D. ('627 patent at 3:22-36). 10 D0010
7
Case 1:07-md-01848-GMS
Document 264-4
Filed 07/07/2008
Page 12 of 28
Multidimensional TCM 20. The TCM techniques described above are referred to as two-dimensional (2-D), since in each signaling interval both dimensions of the carrier wave (I and Q) are modulated to generate one signal point, for example using the 8-PSK signal constellation described above. 21. In the 1980s, Lee-Fang Wei improved the efficiency of the 2-D TCM described above. As detailed in his paper "Trellis-Coded Modulation with Multidimensional Constellations" (attached as Exhibit C and cited in the '627 patent at 4:48-51), multidimensional TCM schemes with multidimensional (greater than 2-D8) signal constellations have a number of potential advantages over the usual 2-D schemes, including further reducing the error-rate relative to 2-D TCM. 22. In 2-D TCM systems, as discussed above, every state transition produces one expanded bit-group that leads to the transmission of one signal point in each signaling interval. In multidimensional TCM systems, as explained in the Wei paper, every state transition still produces one expanded bit-group, but this one expansion now leads to the transmission of multiple signal points over multiple signaling intervals. So, a 4-D TCM system will map the product of one encoder expansion into I and Q components over two signaling intervals (I and Q dimensions over two successive signaling intervals comprise the four dimensions). This is a fundamental distinction between 2-D TCM and multidimensional TCM. 23. For example, Fig. 3 of U.S. Pat. No. 5,214,656 (attached as Exhibit F) which predates the '627 patent, illustrates a 4-D TCM system in which a single state transition (one expansion) produces two signal points: one for transmission in the "first signaling interval" and another for transmission in the "second signaling interval":
8
Multidimensional signals that consisted of multiple two-dimensional signal points were commonly used in the prior art to the '627 patent. For example, see U.S. Pat. No. 4,641,327 (attached as Exhibit D) at 1:14-26 or U.S. Pat. No. 4,755,998 (attached as Exhibit E) at 3:24-32. 11 D0011
Case 1:07-md-01848-GMS
Document 264-4
Filed 07/07/2008
Page 13 of 28
Similarly, Fig. 6 of the Wei paper (Exh. C) cited in the '627 patent also shows a 4-D TCM system in which a single state transition (one expansion) produces two signal points that are transmitted over two signaling intervals. Likewise, although the '627 patent does not disclose the details of the 4-D TCM system used in its examples, it does explain (at 3:65-4:3) that each expansion of the trellis encoder results in the transmission of two signal points. As a result, only one extra bit is added for every two signal points instead of one for every signal point as in 2-D TCM. This improves the transmission efficiency of the system. 24. Multidimensional signal points are interdependent because they are selected together as the result of a single state transition by an encoder. This interdependence is in addition to the time dependence between the expanded bit-groups produced by a sequence of state transitions. In the parlance of the '627 patent, the multiple signal points corresponding to a single state transition of an encoder constitute a trellis-encoded channel symbol. Accordingly, a decoder in a multidimensional TCM system needs all of the received signals associated with a single state transition by a corresponding encoder before it begins to process any of them. For example, a decoder in a 4-D TCM receiver will process together the signals that are received over two signaling intervals.
12 D0012
Case 1:07-md-01848-GMS
Document 264-4
Filed 07/07/2008
Page 14 of 28
Interleaving 25. While both 2-D and multidimensional TCM systems help correct reception errors caused by noise and interference, it has been observed that their effectiveness decreases when the noise occurs in a burst over several consecutive signaling intervals. As discussed above, decoders using the Viterbi algorithm analyze the received signals by following multiple paths of state transitions from each state and determine their relative likelihood (or probability) of having been transmitted. But if several signaling intervals are impaired by a long burst of noise (i.e., too many steps in the path are obscured), the Viterbi decoder may be unable to correct the errors. This is a well understood effect of noise bursts on coded systems, including TCM systems. Interleaving in time is an established technique for alleviating the effects of such burst noise on a coded system's error rate. 26. If a 2-D TCM system is used, groups of input bits can be divided between multiple encoders and the resulting expanded bit-groups then recombined in an alternating fashion as shown below in an illustration using n encoders that is adapted from Fig. 6.10.1. of Robert G. Gallager, INFORMATION THEORY AND RELIABLE COMMUNICATION 287 (John Wiley & Sons 1968) (attached as Exhibit G):9
A similar figure appears in the '627 (Fig. 3, elements 331, 319, 337) and in the '625 (Fig. 1, elements 16, 18, 20, 22, 24, 42). 13 D0013
9
Case 1:07-md-01848-GMS
Document 264-4
Filed 07/07/2008
Page 15 of 28
The result is a sequence of transmitted signals in which adjacent signals (those transmitted in consecutive signaling intervals such as v1 and v2) are generally unrelated because they were produced using different physical encoders with different inputs (although each encoder might have the same encoding algorithm) and thus producing a different sequence of state transitions. A burst of noise that is longer than M signaling intervals would affect multiple transmitted signals from the same encoder. If the received signal points are then divided among a similar arrangement of multiple corresponding decoders, each decoder would process a sequence of received signals that were generated by the same encoder. In this way, any noise effects are spread out over time and each decoder will see isolated effects of the noise burst and each decoder has a much higher probability of correcting the effects of this type of noise. 27. If a multidimensional TCM system is used, however, the product of a single state transition is used to select multiple, interdependent signal points. Thus dividing the groups of input bits between multiple encoders and simply recombining the resulting expanded bit-groups in an alternating fashion would not separate the sets of interdependent signal points, though each set would be separated from the next produced using the same encoder. To separate the interdependent signal points of a single state transition (present only in multidimensional TCM systems) an additional method must be used. 28. For example, the Signal Point Interleaver 341 shown in Fig. 3 of the '627 patent (reproduced below) uses a delay element 3411 to separate the adjacent, interdependent twodimensional signal points on line 325 (e.g., x0 and x1; x2 and x3, and x4 and x5) produced by three separate 4-D encoders , , and (not shown).
14 D0014
Case 1:07-md-01848-GMS
Document 264-4
Filed 07/07/2008
Page 16 of 28
Signal points x0 and x1, which are produced by a single state transition of the 4-D encoder , are adjacent when entering the Signal Point Interleaver 341, but are separated by the signal points x-1 and x2 upon exiting the interleaver by operation of the delay element 3411. 29. When x0 is input to the Signal Point Interleaver, it is applied to line 3412 and immediately passed through as the output on line 342. The next input (x1), however, is stored in the delay element 3411, which outputs its previously stored signal point (x-1) on line 342. Simply repeating this process by holding back every other signal point achieves the desired separation between adjacent, interdependent two-dimensional signal points. Disputed Claim Terms 30. As explained above, TCM and interleaving are techniques used to overcome burst noise and interference in signaling systems. In the 1980s, William Betts, one of the '627 patent inventors, patented a multiple-trellis-encoder system for separating channel symbols encoded by any particular encoder from one another on the channel (U.S. Pat. No. 4,677,625 attached as Exhibit H), which is similar to the multiple encoder system in the Gallager book described above. As disclosed in that earlier Betts patent, each channel symbol is separated from the next channel symbol from the same encoder by intervening channel symbols from other trellis encoders in the
15 D0015
Case 1:07-md-01848-GMS
Document 264-4
Filed 07/07/2008
Page 17 of 28
system using a round-robin switching circuit. The '627 patent purports to be an improvement over the '625 patent specifically for use with multidimensional signaling in which each channel symbol comprises multiple, adjacent interdependent signal points. In Betts' own words, in accordance with the '627 invention, "it has been realized that the Viterbi decoder performance in a data communication system using 2N-dimensional channel symbols can be further enhanced by an interleaving technique which uses, in combination, a) the aforementioned distributed trellis encoder/Viterbi decoder technique [from the '625 patent] and b) a signal point interleaving technique which causes the constituent signal points of the channel symbols to be non-adjacent as they traverse the channel." ('627 patent at 2:5-13.) That is, the improvement claimed in the '627 patent addresses multidimensional trellis encoding and takes the further step of separating the adjacent signal points of each multidimensional channel symbol from one another. 31. I believe Defendants' proposed construction of "trellis encoded channel symbol ... comprised of a plurality of signal points" is correct. Their construction properly reflects the understanding of one of ordinary skill in the art that the '627 patent and claims are directed to the problem of burst interference in the context of multidimensional signaling. The '627 patent would be pointless -- or at least undifferentiated from the '625 patent -- if there were no inherent relationship between the signal points of a given trellis-encoded channel symbol beyond that which is always present among the stream of signal points processed by the same encoder. Defendants thus properly propose construing the entire phrase "trellis encoded channel symbol...comprised of a plurality of signal points," because one of ordinary skill in the art would understand this to be the patentees' way of claiming multidimensional symbols. Moreover, defendants properly construe this language to require "two or more signal points all selected using the same group of parallel input bits as expanded once by a trellis encoder"; i.e., a multidimensional, multiple-signal-point
16 D0016
Case 1:07-md-01848-GMS
Document 264-4
Filed 07/07/2008
Page 18 of 28
channel symbol arising from one state transition of a trellis encoder. Rembrandt's proposed construction, in contrast, would not require the multiple signal points of a trellis encoded channel symbol to comprise a multidimensional symbol and so would be inconsistent with the understanding of one of ordinary skill in the art who read the specification and claims of the '627 patent. 32. Similarly, I believe Defendants' proposed construction of "signal point" is correct. Throughout the patent specification, the patentees described multidimensional channel symbols as "2N-dimensional" where N>1. As I have explained, multidimensional channel symbols arise from multiple, interdependent signal points produced by a single state transition of a trellis encoder, which are transmitted over multiple signaling intervals. "2N-dimensional" is a nomenclature commonly used in the art to describe such a multidimensional symbol having N, 2-D signal points.10 For example, a 4-D symbol has two (N=2) signal points, each with two dimensions. These dimensions represent the I and Q components of the transmitted signal. Defendants' proposed construction of "signal point" as "a point on a 2-dimensional constellation having a pair of coordinates representing two components of a corresponding signal" thus accurately reflects the understanding of one of ordinary skill in the art in accordance with the '627 disclosure and claims. In contrast, Rembrandt's proposed construction of "signal point" simply as a "value that is transmitted by a modulator in one signaling interval" is inadequate because it fails to reflect the patentees' use of the term to mean one of the signal points in a multidimensional symbol.
10
See, e.g., U.S. Pat. No. 5,214,656 (Exh. F) at 2:59-68. 17 D0017
Case 1:07-md-01848-GMS
Document 264-4
Filed 07/07/2008
Page 19 of 28
D0018
Case 1:07-md-01848-GMS
Document 264-4
Filed 07/07/2008
Page 20 of 28
EXHIBIT A
Case 1:07-md-01848-GMS
Document 264-4
Filed 07/07/2008
Page 21 of 28
Case 1:07-md-01848-GMS
Document 264-4
Filed 07/07/2008
Page 22 of 28
Case 1:07-md-01848-GMS
Document 264-4
Filed 07/07/2008
Page 23 of 28
Case 1:07-md-01848-GMS
Document 264-4
Filed 07/07/2008
Page 24 of 28
Case 1:07-md-01848-GMS
Document 264-4
Filed 07/07/2008
Page 25 of 28
Case 1:07-md-01848-GMS
Document 264-4
Filed 07/07/2008
Page 26 of 28
Case 1:07-md-01848-GMS
Document 264-4
Filed 07/07/2008
Page 27 of 28
Case 1:07-md-01848-GMS
Document 264-4
Filed 07/07/2008
Page 28 of 28
Case 1:07-md-01848-GMS
Document 264-5
Filed 07/07/2008
Page 1 of 28
Case 1:07-md-01848-GMS
Document 264-5
Filed 07/07/2008
Page 2 of 28
EXHIBIT B
Case 1:07-md-01848-GMS
Document 264-5
Filed 07/07/2008
Page 3 of 28
Case 1:07-md-01848-GMS
Document 264-5
Filed 07/07/2008
Page 4 of 28
Case 1:07-md-01848-GMS
Document 264-5
Filed 07/07/2008
Page 5 of 28
Case 1:07-md-01848-GMS
Document 264-5
Filed 07/07/2008
Page 6 of 28
Case 1:07-md-01848-GMS
Document 264-5
Filed 07/07/2008
Page 7 of 28
Case 1:07-md-01848-GMS
Document 264-5
Filed 07/07/2008
Page 8 of 28
Case 1:07-md-01848-GMS
Document 264-5
Filed 07/07/2008
Page 9 of 28
Case 1:07-md-01848-GMS
Document 264-5
Filed 07/07/2008
Page 10 of 28
EXHIBIT C
Case 1:07-md-01848-GMS
Document 264-5
Filed 07/07/2008
Page 11 of 28
Case 1:07-md-01848-GMS
Document 264-5
Filed 07/07/2008
Page 12 of 28
Case 1:07-md-01848-GMS
Document 264-5
Filed 07/07/2008
Page 13 of 28
Case 1:07-md-01848-GMS
Document 264-5
Filed 07/07/2008
Page 14 of 28
Case 1:07-md-01848-GMS
Document 264-5
Filed 07/07/2008
Page 15 of 28
Case 1:07-md-01848-GMS
Document 264-5
Filed 07/07/2008
Page 16 of 28
Case 1:07-md-01848-GMS
Document 264-5
Filed 07/07/2008
Page 17 of 28
Case 1:07-md-01848-GMS
Document 264-5
Filed 07/07/2008
Page 18 of 28
Case 1:07-md-01848-GMS
Document 264-5
Filed 07/07/2008
Page 19 of 28
Case 1:07-md-01848-GMS
Document 264-5
Filed 07/07/2008
Page 20 of 28
Case 1:07-md-01848-GMS
Document 264-5
Filed 07/07/2008
Page 21 of 28
Case 1:07-md-01848-GMS
Document 264-5
Filed 07/07/2008
Page 22 of 28
Case 1:07-md-01848-GMS
Document 264-5
Filed 07/07/2008
Page 23 of 28
Case 1:07-md-01848-GMS
Document 264-5
Filed 07/07/2008
Page 24 of 28
Case 1:07-md-01848-GMS
Document 264-5
Filed 07/07/2008
Page 25 of 28
Case 1:07-md-01848-GMS
Document 264-5
Filed 07/07/2008
Page 26 of 28
Case 1:07-md-01848-GMS
Document 264-5
Filed 07/07/2008
Page 27 of 28
Case 1:07-md-01848-GMS
Document 264-5
Filed 07/07/2008
Page 28 of 28
Case 1:07-md-01848-GMS
Document 264-6
Filed 07/07/2008
Page 1 of 28
Case 1:07-md-01848-GMS
Document 264-6
Filed 07/07/2008
Page 2 of 28
EXHIBIT D
Case 1:07-md-01848-GMS
Document 264-6
Filed 07/07/2008
Page 3 of 28
Case 1:07-md-01848-GMS
Document 264-6
Filed 07/07/2008
Page 4 of 28
Case 1:07-md-01848-GMS
Document 264-6
Filed 07/07/2008
Page 5 of 28
Case 1:07-md-01848-GMS
Document 264-6
Filed 07/07/2008
Page 6 of 28
Case 1:07-md-01848-GMS
Document 264-6
Filed 07/07/2008
Page 7 of 28
Case 1:07-md-01848-GMS
Document 264-6
Filed 07/07/2008
Page 8 of 28
Case 1:07-md-01848-GMS
Document 264-6
Filed 07/07/2008
Page 9 of 28
Case 1:07-md-01848-GMS
Document 264-6
Filed 07/07/2008
Page 10 of 28
Case 1:07-md-01848-GMS
Document 264-6
Filed 07/07/2008
Page 11 of 28
Case 1:07-md-01848-GMS
Document 264-6
Filed 07/07/2008
Page 12 of 28
Case 1:07-md-01848-GMS
Document 264-6
Filed 07/07/2008
Page 13 of 28
Case 1:07-md-01848-GMS
Document 264-6
Filed 07/07/2008
Page 14 of 28
Case 1:07-md-01848-GMS
Document 264-6
Filed 07/07/2008
Page 15 of 28
EXHIBIT E
Case 1:07-md-01848-GMS
Document 264-6
Filed 07/07/2008
Page 16 of 28
Case 1:07-md-01848-GMS
Document 264-6
Filed 07/07/2008
Page 17 of 28
Case 1:07-md-01848-GMS
Document 264-6
Filed 07/07/2008
Page 18 of 28
Case 1:07-md-01848-GMS
Document 264-6
Filed 07/07/2008
Page 19 of 28
Case 1:07-md-01848-GMS
Document 264-6
Filed 07/07/2008
Page 20 of 28
Case 1:07-md-01848-GMS
Document 264-6
Filed 07/07/2008
Page 21 of 28
Case 1:07-md-01848-GMS
Document 264-6
Filed 07/07/2008
Page 22 of 28
Case 1:07-md-01848-GMS
Document 264-6
Filed 07/07/2008
Page 23 of 28
Case 1:07-md-01848-GMS
Document 264-6
Filed 07/07/2008
Page 24 of 28
Case 1:07-md-01848-GMS
Document 264-6
Filed 07/07/2008
Page 25 of 28
Case 1:07-md-01848-GMS
Document 264-6
Filed 07/07/2008
Page 26 of 28
Case 1:07-md-01848-GMS
Document 264-6
Filed 07/07/2008
Page 27 of 28
Case 1:07-md-01848-GMS
Document 264-6
Filed 07/07/2008
Page 28 of 28
Case 1:07-md-01848-GMS
Document 264-7
Filed 07/07/2008
Page 1 of 30
EXHIBIT F
Case 1:07-md-01848-GMS
Document 264-7
Filed 07/07/2008
Page 2 of 30
Case 1:07-md-01848-GMS
Document 264-7
Filed 07/07/2008
Page 3 of 30
Case 1:07-md-01848-GMS
Document 264-7
Filed 07/07/2008
Page 4 of 30
Case 1:07-md-01848-GMS
Document 264-7
Filed 07/07/2008
Page 5 of 30
Case 1:07-md-01848-GMS
Document 264-7
Filed 07/07/2008
Page 6 of 30
Case 1:07-md-01848-GMS
Document 264-7
Filed 07/07/2008
Page 7 of 30
Case 1:07-md-01848-GMS
Document 264-7
Filed 07/07/2008
Page 8 of 30
Case 1:07-md-01848-GMS
Document 264-7
Filed 07/07/2008
Page 9 of 30
Case 1:07-md-01848-GMS
Document 264-7
Filed 07/07/2008
Page 10 of 30
Case 1:07-md-01848-GMS
Document 264-7
Filed 07/07/2008
Page 11 of 30
Case 1:07-md-01848-GMS
Document 264-7
Filed 07/07/2008
Page 12 of 30
Case 1:07-md-01848-GMS
Document 264-7
Filed 07/07/2008
Page 13 of 30
Case 1:07-md-01848-GMS
Document 264-7
Filed 07/07/2008
Page 14 of 30
Case 1:07-md-01848-GMS
Document 264-7
Filed 07/07/2008
Page 15 of 30
EXHIBIT G
Case 1:07-md-01848-GMS
Document 264-7
Filed 07/07/2008
Page 16 of 30
Case 1:07-md-01848-GMS
Document 264-7
Filed 07/07/2008
Page 17 of 30
Case 1:07-md-01848-GMS
Document 264-7
Filed 07/07/2008
Page 18 of 30
Case 1:07-md-01848-GMS
Document 264-7
Filed 07/07/2008
Page 19 of 30
Case 1:07-md-01848-GMS
Document 264-7
Filed 07/07/2008
Page 20 of 30
Case 1:07-md-01848-GMS
Document 264-7
Filed 07/07/2008
Page 21 of 30
Case 1:07-md-01848-GMS
Document 264-7
Filed 07/07/2008
Page 22 of 30
EXHIBIT H
Case 1:07-md-01848-GMS
Document 264-7
Filed 07/07/2008
Page 23 of 30
Case 1:07-md-01848-GMS
Document 264-7
Filed 07/07/2008
Page 24 of 30
Case 1:07-md-01848-GMS
Document 264-7
Filed 07/07/2008
Page 25 of 30
Case 1:07-md-01848-GMS
Document 264-7
Filed 07/07/2008
Page 26 of 30
Case 1:07-md-01848-GMS
Document 264-7
Filed 07/07/2008
Page 27 of 30
Case 1:07-md-01848-GMS
Document 264-7
Filed 07/07/2008
Page 28 of 30
Case 1:07-md-01848-GMS
Document 264-7
Filed 07/07/2008
Page 29 of 30
Case 1:07-md-01848-GMS
Document 264-7
Filed 07/07/2008
Page 30 of 30
Case 1:07-md-01848-GMS
Document 264-8
Filed 07/07/2008
Page 1 of 7
TAB 8
Case 1:07-md-01848-GMS
Document 264-8
Filed 07/07/2008
Page 2 of 7
Case 1:07-md-01848-GMS
Document 264-8
Filed 07/07/2008
Page 3 of 7
Case 1:07-md-01848-GMS
Document 264-8
Filed 07/07/2008
Page 4 of 7
Case 1:07-md-01848-GMS
Document 264-8
Filed 07/07/2008
Page 5 of 7
Case 1:07-md-01848-GMS
Document 264-8
Filed 07/07/2008
Page 6 of 7
Case 1:07-md-01848-GMS
Document 264-8
Filed 07/07/2008
Page 7 of 7
Case 1:07-md-01848-GMS
Document 264-9
Filed 07/07/2008
Page 1 of 74
TAB 9
Case 1:07-md-01848-GMS
Document 264-9
Filed 07/07/2008
Page 2 of 74
Case 1:07-md-01848-GMS
Document 264-9
Filed 07/07/2008
Page 3 of 74
Case 1:07-md-01848-GMS
Document 264-9
Filed 07/07/2008
Page 4 of 74
Case 1:07-md-01848-GMS
Document 264-9
Filed 07/07/2008
Page 5 of 74
Case 1:07-md-01848-GMS
Document 264-9
Filed 07/07/2008
Page 6 of 74
Case 1:07-md-01848-GMS
Document 264-9
Filed 07/07/2008
Page 7 of 74
Case 1:07-md-01848-GMS
Document 264-9
Filed 07/07/2008
Page 8 of 74
Case 1:07-md-01848-GMS
Document 264-9
Filed 07/07/2008
Page 9 of 74
Case 1:07-md-01848-GMS
Document 264-9
Filed 07/07/2008
Page 10 of 74
Case 1:07-md-01848-GMS
Document 264-9
Filed 07/07/2008
Page 11 of 74
Case 1:07-md-01848-GMS
Document 264-9
Filed 07/07/2008
Page 12 of 74
Case 1:07-md-01848-GMS
Document 264-9
Filed 07/07/2008
Page 13 of 74
Case 1:07-md-01848-GMS
Document 264-9
Filed 07/07/2008
Page 14 of 74
Case 1:07-md-01848-GMS
Document 264-9
Filed 07/07/2008
Page 15 of 74
Case 1:07-md-01848-GMS
Document 264-9
Filed 07/07/2008
Page 16 of 74
Case 1:07-md-01848-GMS
Document 264-9
Filed 07/07/2008
Page 17 of 74
Case 1:07-md-01848-GMS
Document 264-9
Filed 07/07/2008
Page 18 of 74
Case 1:07-md-01848-GMS
Document 264-9
Filed 07/07/2008
Page 19 of 74
Case 1:07-md-01848-GMS
Document 264-9
Filed 07/07/2008
Page 20 of 74
Case 1:07-md-01848-GMS
Document 264-9
Filed 07/07/2008
Page 21 of 74
Case 1:07-md-01848-GMS
Document 264-9
Filed 07/07/2008
Page 22 of 74
Case 1:07-md-01848-GMS
Document 264-9
Filed 07/07/2008
Page 23 of 74
Case 1:07-md-01848-GMS
Document 264-9
Filed 07/07/2008
Page 24 of 74
Case 1:07-md-01848-GMS
Document 264-9
Filed 07/07/2008
Page 25 of 74
Case 1:07-md-01848-GMS
Document 264-9
Filed 07/07/2008
Page 26 of 74
Case 1:07-md-01848-GMS
Document 264-9
Filed 07/07/2008
Page 27 of 74
Case 1:07-md-01848-GMS
Document 264-9
Filed 07/07/2008
Page 28 of 74
Case 1:07-md-01848-GMS
Document 264-9
Filed 07/07/2008
Page 29 of 74
Case 1:07-md-01848-GMS
Document 264-9
Filed 07/07/2008
Page 30 of 74
Case 1:07-md-01848-GMS
Document 264-9
Filed 07/07/2008
Page 31 of 74
Case 1:07-md-01848-GMS
Document 264-9
Filed 07/07/2008
Page 32 of 74
Case 1:07-md-01848-GMS
Document 264-9
Filed 07/07/2008
Page 33 of 74
Case 1:07-md-01848-GMS
Document 264-9
Filed 07/07/2008
Page 34 of 74
Case 1:07-md-01848-GMS
Document 264-9
Filed 07/07/2008
Page 35 of 74
Case 1:07-md-01848-GMS
Document 264-9
Filed 07/07/2008
Page 36 of 74
Case 1:07-md-01848-GMS
Document 264-9
Filed 07/07/2008
Page 37 of 74
Case 1:07-md-01848-GMS
Document 264-9
Filed 07/07/2008
Page 38 of 74
Case 1:07-md-01848-GMS
Document 264-9
Filed 07/07/2008
Page 39 of 74
Case 1:07-md-01848-GMS
Document 264-9
Filed 07/07/2008
Page 40 of 74
Case 1:07-md-01848-GMS
Document 264-9
Filed 07/07/2008
Page 41 of 74
Case 1:07-md-01848-GMS
Document 264-9
Filed 07/07/2008
Page 42 of 74
Case 1:07-md-01848-GMS
Document 264-9
Filed 07/07/2008
Page 43 of 74
Case 1:07-md-01848-GMS
Document 264-9
Filed 07/07/2008
Page 44 of 74
Case 1:07-md-01848-GMS
Document 264-9
Filed 07/07/2008
Page 45 of 74
Case 1:07-md-01848-GMS
Document 264-9
Filed 07/07/2008
Page 46 of 74
Case 1:07-md-01848-GMS
Document 264-9
Filed 07/07/2008
Page 47 of 74
Case 1:07-md-01848-GMS
Document 264-9
Filed 07/07/2008
Page 48 of 74
Case 1:07-md-01848-GMS
Document 264-9
Filed 07/07/2008
Page 49 of 74
Case 1:07-md-01848-GMS
Document 264-9
Filed 07/07/2008
Page 50 of 74
Case 1:07-md-01848-GMS
Document 264-9
Filed 07/07/2008
Page 51 of 74
Case 1:07-md-01848-GMS
Document 264-9
Filed 07/07/2008
Page 52 of 74
Case 1:07-md-01848-GMS
Document 264-9
Filed 07/07/2008
Page 53 of 74
Case 1:07-md-01848-GMS
Document 264-9
Filed 07/07/2008
Page 54 of 74
Case 1:07-md-01848-GMS
Document 264-9
Filed 07/07/2008
Page 55 of 74
Case 1:07-md-01848-GMS
Document 264-9
Filed 07/07/2008
Page 56 of 74
Case 1:07-md-01848-GMS
Document 264-9
Filed 07/07/2008
Page 57 of 74
Case 1:07-md-01848-GMS
Document 264-9
Filed 07/07/2008
Page 58 of 74
Case 1:07-md-01848-GMS
Document 264-9
Filed 07/07/2008
Page 59 of 74
Case 1:07-md-01848-GMS
Document 264-9
Filed 07/07/2008
Page 60 of 74
Case 1:07-md-01848-GMS
Document 264-9
Filed 07/07/2008
Page 61 of 74
Case 1:07-md-01848-GMS
Document 264-9
Filed 07/07/2008
Page 62 of 74
Case 1:07-md-01848-GMS
Document 264-9
Filed 07/07/2008
Page 63 of 74
Case 1:07-md-01848-GMS
Document 264-9
Filed 07/07/2008
Page 64 of 74
Case 1:07-md-01848-GMS
Document 264-9
Filed 07/07/2008
Page 65 of 74
Case 1:07-md-01848-GMS
Document 264-9
Filed 07/07/2008
Page 66 of 74
Case 1:07-md-01848-GMS
Document 264-9
Filed 07/07/2008
Page 67 of 74
Case 1:07-md-01848-GMS
Document 264-9
Filed 07/07/2008
Page 68 of 74
Case 1:07-md-01848-GMS
Document 264-9
Filed 07/07/2008
Page 69 of 74
Case 1:07-md-01848-GMS
Document 264-9
Filed 07/07/2008
Page 70 of 74
Case 1:07-md-01848-GMS
Document 264-9
Filed 07/07/2008
Page 71 of 74
Case 1:07-md-01848-GMS
Document 264-9
Filed 07/07/2008
Page 72 of 74
Case 1:07-md-01848-GMS
Document 264-9
Filed 07/07/2008
Page 73 of 74
Case 1:07-md-01848-GMS
Document 264-9
Filed 07/07/2008
Page 74 of 74
Free Appendix - District Court of Delaware - Delaware
| File Size: | 16,793.1 kB |
| Pages: | 271 |
| Date: | September 7, 2008 |
| File Format: | |
| State: | Delaware |
| Category: | District Court of Delaware |
| Author: | unknown |
| Word Count: | 8,700 Words, 50,740 Characters |
| Page Size: | Letter (8 1/2" x 11") |
| URL |
https://www.findforms.com/pdf_files/ded/38499/264.pdf |
| Download Appendix - District Court of Delaware ( 16,793.1 kB) |
Preview Appendix - District Court of Delaware
Popular Searches
United States Free Forms
Canada Free Forms
United Kingdom Free Forms
Australia Free Forms