The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.

The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.

Date of Patent:
Jul. 05, 2022

Filed:

Jan. 06, 2020
Applicant:

Codelucida, Inc., Tucson, AZ (US);

Inventors:

Benedict J. Reynwar, Tucson, AZ (US);

David Declercq, Tucson, AZ (US);

Shiva Kumar Planjery, Tucson, AZ (US);

Assignee:

Codelucida, Inc., Tucson, AZ (US);

Attorney:
Primary Examiner:
Assistant Examiner:
Int. Cl.
CPC ...
H03M 13/11 (2006.01); H03M 13/00 (2006.01); H03M 13/37 (2006.01); H04L 1/00 (2006.01); H03M 13/29 (2006.01);
U.S. Cl.
CPC ...
H03M 13/118 (2013.01); H03M 13/114 (2013.01); H03M 13/116 (2013.01); H03M 13/1117 (2013.01); H03M 13/6577 (2013.01); H03M 13/1102 (2013.01); H03M 13/1108 (2013.01); H03M 13/1111 (2013.01); H03M 13/1171 (2013.01); H03M 13/2975 (2013.01); H03M 13/3707 (2013.01); H03M 13/3746 (2013.01); H04L 1/005 (2013.01); H04L 1/0054 (2013.01);
Abstract

This invention presents a method and apparatus for vertical layered finite alphabet iterative decoding of low-density parity-check codes (LDPC) which operate on parity check matrices that consist of blocks of sub-matrices. The iterative decoding involves passing messages between variable nodes and check nodes of the Tanner graph that associated with one or more sub-matrices constitute decoding blocks, and the messages belong to a finite alphabet. Various embodiments for the method and apparatus of the invention are presented that can achieve very high throughputs with low hardware resource usage and power.


Find Patent Forward Citations

Loading…