US 7,747,934 Method for selecting low density parity check (LDPC) code used for encoding of variable length data
3 defendants · 3 suits · updated October 21, 2026
Also cited as U.S. Patent No. 7,747,934 · US7747934B2 · US 7,747,934 B2 · 7747934 · the '934 patent
Malikie Innovations Ltd. has filed 3 patent-infringement suits on US 7,747,934, "Method for selecting low density parity check (LDPC) code used for encoding of variable length data" since May 18, 2026, 2 of them in the E.D. Tex., against 3 distinct defendants including TCL INDUSTRIES HOLDINGS CO., LTD., Ubiquiti Inc. and Arcadyan Technology Corporation. The patent was granted June 29, 2010 on a priority date of October 12, 2004. Its abstract opens: "A method for selecting a low-density parity-check (LDPC) code for encoding variable sized data used in data communication systems." The examiner cited 1 reference during prosecution.
- Assignee
- Malikie Innovations Ltd
- Priority date
- October 12, 2004
- Granted
- June 29, 2010
- Expires
- October 12, 2024
- Status
- Active
- Claims
- 19 (3 independent)
- Inventors
- Michael Livshitz
- Full text
- Google Patents
The suits
3 cases · E.D. Tex. (2) · N.D. Ill. (1)
| Filed | Defendant | Plaintiff | Court | Docket |
|---|---|---|---|---|
| 2026-05-18 | TCL INDUSTRIES HOLDINGS CO., LTD. | Malikie Innovations Ltd. | E.D. Tex. | 2:26-cv-00413 |
| 2026-09-10 | Ubiquiti Inc. | Malikie Innovations Ltd. | N.D. Ill. | 1:26-cv-11017 |
| 2026-09-30 | Arcadyan Technology Corporation | Malikie Innovations Ltd. | E.D. Tex. | 2:26-cv-00876 |
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 selecting a low-density parity-check (LDPC) code used for encoding variable sized data, the method comprising the steps of: providing a plurality of LDPC codes of different codeword lengths and code rates; calculating a number of shortening N shortened bits for each of the plurality of LDPC codes; calculating a number of puncturing N punctured bits for each of the plurality of LDPC codes; providing a performance criterion; determining, in a computer processor, a selected LDPC code from the plurality of shortened LDPC codes and the plurality of punctured LDPC codes meeting the performance criterion; and encoding data using the selected LDPC code.
10. A device encoding data using a selected LDPC code obtained by: providing a plurality of LDPC codes of different codeword lengths and code rates; calculating a number of shortening N shortened bits for each of the plurality of LDPC codes; calculating a number of puncturing N punctured bits for each of the plurality of LDPC codes; providing a performance criterion; determining a selected LDPC code from the plurality of shortened LDPC codes and the plurality of punctured LDPC codes meeting the performance; and providing the selected LDPC code.
11. A storage medium readable by a computer encoding a computer program for execution by the computer to carry out a method for selecting a low-density parity-check (LDPC) code used for encoding variable sized data, the method comprising: providing a plurality of LDPC codes of different codeword lengths and code rates; calculating a number of shortening N shortened bits for each of the plurality of LDPC codes; calculating a number of puncturing N punctured bits for each of the plurality of LDPC codes; providing a performance criterion; determining a selected LDPC code from the plurality of shortened LDPC codes and the plurality of punctured LDPC codes meeting the performance criterion; and encoding data using the selected LDPC code.
Art before the examiner
6 references of record, 1 cited by the examiner.
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.
Examiner-cited
- US7263651B2 — Method and apparatus for varying lengths of low density party check codewords (Intel Corporation)
Applicant-cited and other (5)
- US7178080B2 — Hardware-efficient low density parity check code for digital communications
- US7203897B2 — Method and apparatus for encoding and decoding data
- US7313752B2 — Apparatus and method for coding/decoding block low density parity check code in a mobile communication system
- US7581157B2 — Method and apparatus of encoding and decoding data using low density parity check code in a wireless communication system
- US7607063B2 — Decoding method and device for decoding linear code
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
- US7747934B2 — B2 (2010)
- US8583980B2 — B2 (2013)
- US8024641B2 — B2 (2011)
- USRE48212E1 — USRE48212E1 (2020)
- US20070094580A1 — A1 (2007)
- US20100211847A1 — A1 (2010)
- USRE49225E1 — USRE49225E1 (2022)
- US20110107177A1 — A1 (2011)
- US20120117440A1 — A1 (2012)
- US20130013983A1 — A1 (2013)
- USRE46692E1 — USRE46692E1 (2018)
- US8301975B2 — B2 (2012)
- US8099646B2 — B2 (2012)
- US7996746B2 — B2 (2011)
- US20100251065A1 — A1 (2010)
- US7917829B2 — B2 (2011)
- US20090259915A1 — A1 (2009)
- US20130013973A1 — A1 (2013)
- US8291289B2 — B2 (2012)
- US20110307755A1 — A1 (2011)
- 1 foreign family member: WO2006039801A1
Abstract
A method for selecting a low-density parity-check (LDPC) code for encoding variable sized data used in data communication systems. The method selects a LPCD code from a plurality of LDPC codes of different codeword lengths and code rates; by calculating a number of shortening N shortened bits and a number of puncturing N punctured bits for each of the plurality of LDPC codes, and determines a selected LDPC code from the plurality of shortened and punctured LDPC codes meeting a performance criterion.
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,917,829 — Low density parity check (LDPC) code (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.