IP Library Granted Patent US 9,197,248
Granted Patent B2
US 9,197,248 · App. 13/483,290 · Granted Nov 24, 2015

Low density parity check decoder

Inventor: Avidan Akerib (Tel Aviv, IL)
Assignee: MIKAMONU GROUP LTD.
H03M13/1122H03M13/114H03M13/1137H03M13/1165G11C15/00
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 9,197,248
App. No.
13/483,290
Granted
Nov 24, 2015
Kind
B2
Abstract

An error correction code decoder, including a computational memory array having at least a variable node section, a check node section, and a plurality of computational memory cells, each cell capable of storing at least one bit of memory and of performing operations at least on the bit and each cell implementing one node. A controller instructs the computational memory to perform the operations and to write the results of computations on a block of variable nodes into associated set of blocks of check nodes and to write the results of computations on a block of check nodes into associated set of blocks of variable nodes.

Claims (13)

1. A low-density parity check (LDPC) decoder comprising:

a computational memory array having at least a variable node section comprising at least one block of variable nodes and a check node section comprising at least one block of check nodes associated with said least one block of variable nodes, said block of variable nodes and said associated block of check nodes comprising a plurality of computational memory cells, each cell capable of storing at least one bit of memory and of performing operations at least on said bit and a group of cells implementing one node; and

a controller to instruct said computational memory to:

perform said operations inside said computational memory on said block of variable nodes and

write results of computations associated with said variable node operations into said associated block of check nodes; and

perform said operations in said computational memory on said associated block of check nodes and

write results of computations associated with said check node operations into said associated block of variable nodes,

wherein said results of said computations associated with said variable node operations and said check node operations are transferred between said block of variable nodes and said block of associated check nodes through bit lines in said computational memory.

2. The decoder according to claim 1 and wherein each said computational memory cell is one of the following: a content addressable memory (CAM) cell, a TCAM (Ternary Content-Addressable Memory) cell and a memory cell capable of comparing input data against stored data and of returning output data responsive to the comparison.

3. The decoder according to claim 1 and also comprising an I/O (input/output) interface to receive data to be decoded, said I/O interface providing said data to said controller and said controller writing said data to selected ones of said variable nodes.

4. The decoder according to claim 1 and implemented on a memory storage chip.

5. The decoder according to claim 1 wherein said computational memory array is a content-addressable memory (CAM).

6. The decoder according to claim 1 wherein said computational memory array is a ternary content-addressable memory (T-CAM).

Assignments (3)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 4, 2016
From: GSI TECHNOLOGY ISRAEL LTD.
To: GSI TECHNOLOGY INC.
Reel/Frame 040510/0832 →
CHANGE OF NAME Recorded Feb 8, 2016
From: MIKAMONU GROUP LTD.
To: GSI TECHNOLOGY ISRAEL LTD.
Reel/Frame 037805/0551 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 5, 2012
From: AKERIB, AVIDAN, MR.
To: MIKAMONU GROUP LTD.
Reel/Frame 028314/0550 →
Continuity (4)
Provisional Application 61491236 · May 30, 2011
Provisional Application 61531425 · Sep 6, 2011
Provisional Application 61533273 · Sep 12, 2011
Related Publication 20120311404A1 · Dec 6, 2012