US 7,917,829 Low density parity check (LDPC) code
3 defendants · 3 suits · updated October 6, 2026
Also cited as U.S. Patent No. 7,917,829 · US7917829B2 · US 7,917,829 B2 · 7917829 · the '829 patent
Malikie Innovations Ltd. has filed 3 patent-infringement suits on US 7,917,829, "Low density parity check (LDPC) code" since May 11, 2026, 2 of them in the N.D. Tex., against 3 distinct defendants including American Honda Motor Co., Inc., Toyota Motor Corporation and Stellantis NV. The patent was granted March 29, 2011 on a priority date of October 12, 2004. Its abstract opens: "Low density parity check code (LDPC) base parity check matrices and the method for use thereof in communication systems."
- Assignee
- Malikie Innovations Ltd
- Priority date
- October 12, 2004
- Granted
- March 29, 2011
- Expires
- October 12, 2024
- Status
- Expired - Lifetime
- Claims
- 10 (2 independent)
- Inventors
- Michael Livshitz
- Full text
- Google Patents
The suits
3 cases · N.D. Tex. (2) · E.D. Tex. (1)
| Filed | Defendant | Plaintiff | Court | Docket |
|---|---|---|---|---|
| 2026-05-11 | American Honda Motor Co., Inc. | Malikie Innovations Ltd. | N.D. Tex. | 3:26-cv-01503 |
| 2026-06-12 | Toyota Motor Corporation | Malikie Innovations Ltd. | E.D. Tex. | 2:26-cv-00469 |
| 2026-07-27 | Stellantis NV | Malikie Innovations Ltd | N.D. Tex. | 3:26-cv-02475 |
Docket links open the public record on CourtListener. Filing dates are the complaint's.
Independent claims
What is actually asserted, verbatim.
1. A method for low-density parity-check (LDPC) encoding data, comprising: receiving input data from a data source; applying the following expanded parity check matrix to the input data to generate encoded data with a code length of 1944: 61 75 4 63 56 −1 −1 −1 −1 −1 −1 8 56 74 77 20 −1 −1 −1 64 24 4 67 −1 28 21 68 10 7 14 65 −1 −1 −1 23 −1 48 38 43 78 76 −1 −1 −1 −1 5 36 −1 40 2 53 25 −1 52 62 −1 20 −1 −1 44 69 23 64 10 22 −1 21 −1 −1 −1 −1 −1 12 0 68 20 55 61 −1 40 −1 −1 −1 52 58 8 34 64 78 −1 −1 11 78 24 −1 −1 −1 2 17 25 1 0 −1 −1 −1 −1 −1 −1 7 −1 −1 −1 −1 0 0 −1 −1 −1 −1 −1 −1 −1 75 −1 −1 −1 0 0 −1 −1 −1 −1 15 72 −1 −1 −1 −1 −1 0 0 −1 −1 −1 −1 −1 −1 −1 0 −1 −1 −1 0 0 −1 −1 68 23 29 −1 −1 −1 −1 −1 −1 0 0 −1 −1 −1 −1 44 −1 −1 −1 −1 −1 −1 0 0 −1 −1 −1 58 1 −1 −1 −1 −1 −1 −1 0 wherein −1represents an 81×81 all-zero square matrix, and all other integers represent an 81×81 identity matrix, circularly right shifted a respective number of times corresponding to the respective integers.
6. Apparatus for low-density parity-check (LDPC) encoding data, comprising: a processor; and an instruction storage element operable to store instructions executable by the processor, the instructions comprising: instructions executable to apply the following expanded parity check matrix to the data to produce encoded data with a code length of 1944: 61 75 4 63 56 −1 −1 −1 −1 −1 −1 8 −1 2 17 25 1 0 −1 −1 −1 −1 −1 −1 56 74 77 20 −1 −1 −1 64 24 4 67 −1 7 −1 −1 −1 −1 0 0 −1 −1 −1 −1 −1 28 21 68 10 7 14 65 −1 −1 −1 23 −1 −1 −1 75 −1 −1 −1 0 0 −1 −1 −1 −1 48 38 43 78 76 −1 −1 −1 −1 5 36 −1 15 72 −1 −1 −1 −1 −1 0 0 −1 −1 −1 40 2 53 25 −1 52 62 −1 20 −1 −1 44 −1 −1 −1 −1 0 −1 −1 −1 0 0 −1 −1 69 23 64 10 22 −1 21 −1 −1 −1 −1 −1 68 23 29 −1 −1 −1 −1 −1 −1 0 0 −1 12 0 68 20 55 61 −1 40 −1 −1 −1 52 −1 −1 −1 44 −1 −1 −1 −1 −1 −1 0 0 58 8 34 64 78 −1 −1 11 78 24 −1 −1 −1 −1 −1 58 1 −1 −1 −1 −1 −1 −1 0 wherein −1represents a 81×81 all-zero square matrix, and all other integers represent an 81×81 identity matrix, circularly right shifted a respective number of times corresponding to the respective integers.
Art before the examiner
6 references of record.
Everything listed here was before the Office and is what a challenge must go beyond. Art the examiner never saw is where an invalidity search starts.
Applicant-cited and other (6)
- US20040034828A1 — Hardware-efficient low density parity check code for digital communications
- US20050050435A1 — Apparatus and method for coding/decoding block low density parity check code in a mobile communication system
- US20050289437A1 — Method and apparatus of encoding and decoding data using low density parity check code in a wireless communication system
- US20060015791A1 — Decoding method, decoding device, program, recording/reproduction device and method, and reproduction device and method
- US7203897B2 — Method and apparatus for encoding and decoding data
- US7263651B2 — Method and apparatus for varying lengths of low density party check codewords
Classification
- H03M13/1111primary — Soft-decision decoding, e.g. by means of message passing or belief propagation algorithms
- H03M13/1137 — Partly parallel processing, i.e. sub-blocks or sub-groups of nodes being processed in parallel
- H03M13/114 — Shuffled, staggered, layered or turbo decoding schedules
- H03M13/116 — Quasi-cyclic LDPC [QC-LDPC] codes, i.e. the parity-check matrix being composed of permutation or circulant sub-matrices
- H03M13/118 — Parity check matrix structured for simplifying encoding, e.g. by having a triangular or an approximate triangular structure
- H03M13/1185 — Parity check matrix structured for simplifying encoding, e.g. by having a triangular or an approximate triangular structure wherein the parity-check matrix comprises a part with a double-diagonal
- H03M13/1188 — Parity check matrix structured for simplifying encoding, e.g. by having a triangular or an approximate triangular structure wherein the parity-check matrix comprises a part with a double-diagonal wherein in the part with the double-diagonal at least one column has an odd column weight equal or greater than three
- H03M13/618 — Shortening and extension of codes
- H03M13/6362 — Error control coding in combination with rate matching by puncturing
- H03M13/6368 — Error control coding in combination with rate matching by puncturing using rate compatible puncturing or complementary puncturing
- H03M13/6393 — Rate compatible low-density parity check [LDPC] codes
- H04L1/0057 — Block codes
- H04L1/0068 — Rate matching by puncturing
Family
- US7917829B2 — B2 (2011)
- US8024641B2 — B2 (2011)
- USRE49225E1 — USRE49225E1 (2022)
- US20090259915A1 — A1 (2009)
- US20120117440A1 — A1 (2012)
- US20110107177A1 — A1 (2011)
- US8099646B2 — B2 (2012)
- USRE46692E1 — USRE46692E1 (2018)
- US7747934B2 — B2 (2010)
- US20130013983A1 — A1 (2013)
- US8291289B2 — B2 (2012)
- US8301975B2 — B2 (2012)
- US20070094580A1 — A1 (2007)
- US7996746B2 — B2 (2011)
- USRE48212E1 — USRE48212E1 (2020)
- US20100211847A1 — A1 (2010)
- US20130013973A1 — A1 (2013)
- US20100251065A1 — A1 (2010)
- US20110307755A1 — A1 (2011)
- US8583980B2 — B2 (2013)
- 1 foreign family member: WO2006039801A1
Abstract
Low density parity check code (LDPC) base parity check matrices and the method for use thereof in communication systems. The method of expanding the base check parity matrix is described. Examples of expanded LDPC codes with different code lengths and expansion factors are also shown.
Also asserted by Malikie Innovations Ltd.
- US 8,532,286 — System and method for reducing the computation and storage requirements for a montgomery-style reduction (4 defendants)
- US 7,453,856 — Method, apparatus, and communications interface for sending and receiving data blocks associated with different multiple access techniques (3 defendants)
- US 7,747,934 — Method for selecting low density parity check (LDPC) code used for encoding of variable length data (3 defendants)
- US 8,291,289 — Low density parity check (LDPC) code (3 defendants)
- US 8,712,039 — Efficient implementation of hash algorithm on a processor (3 defendants)
- US 8,788,827 — Accelerated verification of digital signatures and public keys (3 defendants)
- US 8,806,197 — Accelerated verification of digital signatures and public keys (3 defendants)
Named in one of these suits? A prior-art search is commissioned once and serves every defendant who shares it. The examiner's own search record is free on the tools page, and your first preliminary search is free — one claim, back within 24 hours — so you know whether there is art the Office never saw before anyone pays for more. Flat fees: $2,500$899 for the independent claims, $5,000$1,500 for every asserted claim.
This page is assembled from public records — federal court dockets and the patent's own file — and is updated as the case list changes. It states what the record shows and is not an opinion on the validity or infringement of any claim. Patent data via Google Patents; docket data via CourtListener.