6:24-cv-00448
TurboCode LLC v. Deere & Co
I. Executive Summary and Procedural Information
- Parties & Counsel:
- Plaintiff: TurboCode LLC (Texas)
- Defendant: Deere & Company (Delaware)
- Plaintiff’s Counsel: Direction IP Law
- Case Identification: 6:24-cv-00448, W.D. Tex., 08/30/2024
- Venue Allegations: Venue is alleged to be proper based on Defendant maintaining a place of business within the Western District of Texas.
- Core Dispute: Plaintiff alleges that Defendant’s telematics gateways, which provide 3G and 4G/LTE connectivity, infringe a patent related to high-speed, efficient architectures for turbo code decoders.
- Technical Context: The technology concerns turbo codes, a class of high-performance error correction codes essential for reliable data transmission in modern wireless communication standards such as 3G and 4G/LTE.
- Key Procedural History: The patent-in-suit underwent Ex Parte Reexamination, with a certificate issuing in 2009. The asserted claim, claim 6, was added during this proceeding, potentially strengthening its presumption of validity against the prior art considered by the USPTO.
Case Timeline
| Date | Event |
|---|---|
| 2001-01-02 | ’742 Patent Priority Date |
| 2004-11-02 | ’742 Patent Issue Date |
| 2006-07-13 | Reexamination Request Filed for ’742 Patent |
| 2009-02-10 | Ex Parte Reexamination Certificate Issued for ’742 Patent |
| 2024-08-30 | Complaint Filing Date |
II. Technology and Patent(s)-in-Suit Analysis
U.S. Patent No. 6,813,742 - "High Speed Turbo Codes Decoder for 3G Using Pipelined SISO Log-Map Decoders Architecture"
The Invention Explained
- Problem Addressed: The patent’s background section states that prior art methods for decoding turbo codes were too complex, power-intensive, and costly for practical implementation in consumer wireless devices like 3G mobile phones, as they required significant hardware and complex mathematical operations (’742 Patent, col. 2:10-22).
- The Patented Solution: The invention discloses a decoder architecture that uses two serially connected, pipelined Log-MAP (Logarithmic Maximum a Posteriori) decoders operating in a feedback loop (’742 Patent, col. 2:40-44; Fig. 4). This architecture is designed to be simpler to implement in silicon (ASIC), using binary adders instead of more complex multipliers, thereby achieving higher data throughput with lower power consumption suitable for 3G applications (’742 Patent, col. 2:52-61).
- Technical Importance: By simplifying the hardware requirements for turbo decoding, this type of architecture facilitated the integration of powerful error correction into mass-market, power-constrained mobile devices, a critical step for enabling high-speed 3G data services (’742 Patent, col. 2:32-40).
Key Claims at a Glance
- The complaint asserts independent claim 6, which was added during reexamination (Compl. ¶12-13).
- The essential elements of asserted claim 6 are:
- A method of iteratively decoding received baseband signals.
- Providing an input buffer with at least three shift registers to generate first, second, and third shifted input signals.
- Providing first and second "soft decision decoders" serially coupled in a circular circuit, where each processes output from the preceding decoder.
- Providing at least one memory module coupled to the output of each decoder, where the output from the second decoder’s associated memory is fed back as an input to the first decoder.
- Processing systematic and extrinsic information data using a maximum a posteriori (MAP) or logarithm approximation algorithm.
- Generating a soft decision based on a MAP or logarithm approximation algorithm.
- Weighing and storing the soft decision information into the corresponding memory module.
- Performing iterative decoding for a predetermined number of times, where an output from the last decoder is fed back to the first decoder in a circular circuit.
III. The Accused Instrumentality
Product Identification
The accused instrumentalities are Deere & Company’s M-Modem, R-Modem, and MTG 4G LTE telematics gateways, which are part of its "John Deere Connectivity Family" (Compl. ¶12, p. 5).
Functionality and Market Context
These devices are modular telematics gateways that integrate GNSS and mobile connectivity (2G/3G/LTE) into agricultural and industrial machinery (Compl. p. 5). They are used for applications such as machine health monitoring, remote diagnostics, and logistics (Compl. p. 5). The complaint alleges that because these products are designed to comply with 3G and 4G/LTE cellular standards, they must necessarily implement a turbo decoder that practices the patented method (Compl. ¶12, ¶17). The complaint includes a John Deere product specification sheet showing the M-Modem and R-Modem offer "LTE CAT4 with /2/3G fallback" connectivity (Compl. p. 5).
IV. Analysis of Infringement Allegations
U.S. Patent No. 6,813,742 Infringement Allegations
| Claim Element (from Independent Claim 6) | Alleged Infringing Functionality | Complaint Citation | Patent Citation |
|---|---|---|---|
| providing an input buffer comprising at least three shift registers, for receiving an input signal and generating first, second, and third shifted input signals | The Accused Instrumentalities allegedly utilize a "channel coded bit buffer" structure, as specified by 3GPP standards, to receive an input signal and generate three distinct shifted input signals ("soft data," "soft parity 1," and "soft parity 2") for the decoders. | ¶20-22 | col. 4:54-65 |
| providing first and second soft decision decoders serially coupled in a circular circuit, wherein each decoder processes soft decision from the preceding decoder output data... | The accused devices allegedly implement two constituent soft-in, soft-out (SISO) decoders arranged in an iterative feedback loop, as depicted in a standard 3GPP turbo decoder architecture diagram. | ¶23-25 | col. 4:8-14 |
| providing at least one memory module...wherein the output of the memory module associated with the second soft decision decoder is fed back as an input of the first soft decision decoder | The complaint alleges the use of memory modules, identified as an "interleaver" and a "deinterleaver," where the output of the second decoder ("soft output 2") is fed back to the input of the first decoder to enable iterative processing. A diagram from a 3GPP standard is provided to illustrate this feedback loop (Compl. p. 20, Fig. 18). | ¶27-29 | col. 9:1-12 |
| processing systematic information data and extrinsic information data using the maximum a posteriori (AP) probability algorithm, and/or logarithm approximation algorithm | The Accused Instrumentalities are alleged to use the Bahl-Cocke-Jelinek-Raviv (BCJR) algorithm, which is identified as a type of MAP algorithm, for turbo decoding. | ¶30-32 | col. 9:20-25 |
| generating soft decision based on the maximum a posteriori (MAP) probability algorithm, and/or logarithm approximation algorithm | The complaint asserts that the BCJR algorithm implemented in the accused devices processes soft inputs to generate soft decision outputs. | ¶35 | col. 9:36-39 |
| weighing and storing soft decision information into the corresponding memory module | It is alleged that soft decision information is "normalized," which the complaint equates with "weighing," before being stored in memory modules like the interleaver or deinterleaver. | ¶36-37 | col. 9:40-41 |
| performing, for a predetermined number of times, iterative decoding...wherein an output from the last soft decision decoder is fed back as an input to the first soft decision decoder...in a circular circuit | The complaint alleges that decoding is performed iteratively for a default of 8 iterations, as defined by the "FEC_ITERATIONS" variable in 3GPP source code, with the output of the second decoder fed back to the first to form a circular circuit. A high-level block diagram from a technical paper illustrates this iterative loop structure (Compl. p. 12). | ¶40-41 | col. 9:41-49 |
- Identified Points of Contention:
- Scope Questions: The complaint's infringement theory is based on standard-compliance, alleging that any device implementing the 3G/4G LTE standards must infringe. A central question for the court will be whether the standards permit non-infringing alternative implementations of a turbo decoder.
- Technical Questions: The analysis will likely focus on whether the specific implementations within Deere's products, which use i.MX8DXL processors, map directly onto the claim elements as interpreted through the 3GPP standard's high-level diagrams and example source code. For instance, what evidence demonstrates that the accused products' "normalization" of soft decision values constitutes "weighing" as required by the claim?
V. Key Claim Terms for Construction
The Term: "weighing and storing soft decision information"
- Context and Importance: This term is critical because the infringement allegation hinges on equating the 3GPP source code's "normalization" process with the claim's requirement of "weighing" (Compl. ¶37, ¶39). The defense may argue that "normalization" (often a subtraction in the log-domain to prevent numerical overflow) is technically distinct from "weighing" (which may imply scaling by a factor).
- Intrinsic Evidence for Interpretation:
- Evidence for a Broader Interpretation: The patent specification does not explicitly define "weighing," which may support an argument that the term should be given its plain and ordinary meaning, potentially encompassing any numerical adjustment like normalization.
- Evidence for a Narrower Interpretation: The claim language recites "weighing and storing" as a distinct step from "generating soft decision." This could support an interpretation that "weighing" must be a separate, affirmative step beyond the inherent calculations of the MAP algorithm itself. The patent focuses on hardware simplification, which might suggest "weighing" refers to a specific, simple operation.
The Term: "performing, for a predetermined number of times, iterative decoding"
- Context and Importance: Practitioners may focus on this term because modern decoders often use dynamic stopping rules rather than a fixed number of iterations to improve efficiency. The complaint acknowledges this but argues that even dynamic rules involve performing decoding "a predetermined number of times according to a stopping rule" (Compl. ¶41). This phrasing may create ambiguity.
- Intrinsic Evidence for Interpretation:
- Evidence for a Broader Interpretation: The patent mentions performing "iterative decoding L times" and shows a counter in Figure 23, suggesting a number is set before the process begins, which could be compatible with a dynamic stopping condition that resolves to a specific number of iterations for a given data block.
- Evidence for a Narrower Interpretation: The phrase "predetermined number" could be construed to mean a fixed, constant number of iterations (like the 8 iterations cited from the source code at Compl. ¶39) that does not vary based on real-time channel conditions.
VI. Other Allegations
- Indirect Infringement: The complaint alleges induced infringement, stating that Defendant advertises and sells the Accused Instrumentalities with knowledge of their 3G/4G functionality, thereby intending for its customers to perform the infringing decoding method (Compl. ¶42-43). It also pleads contributory infringement, asserting that the accused functionality is a material part of the invention and not a staple article of commerce (Compl. ¶44).
- Willful Infringement: The complaint alleges that Defendant became aware of the ’742 Patent and its infringement at least by the receipt of a letter, but continued its infringing conduct (Compl. ¶43-44). The specific timing and content of this alleged notice are not detailed.
VII. Analyst’s Conclusion: Key Questions for the Case
- A core issue will be one of infringement by standardization: Can Plaintiff prove that compliance with the 3G/4G LTE standards, as implemented in the accused Deere products, necessarily results in practicing every limitation of the asserted method claim, or can Defendant show that a standard-compliant, non-infringing alternative exists or is used in its products?
- The case may also turn on a question of definitional scope: Will the claim term "weighing," which is not explicitly defined in the patent, be construed broadly enough to read on the "normalization" techniques allegedly used in standard-compliant turbo decoders?
- A third key question will be one of temporal limitation: Does the claim language "performing, for a predetermined number of times," limit the claim to decoders that use a fixed number of iterations, or is it broad enough to cover modern decoders that employ dynamic stopping criteria based on real-time conditions?