IP Library › Granted Patent US 9,602,243
Granted Patent B2
US 9,602,243 · App. 14/495,821 · Granted Mar 21, 2017

Low density parity check encoder, and low density parity check encoding method using the same

Inventors: Sung-Ik Park (Daejeon, KR); Heung-Mook Kim (Daejeon, KR); Sun-Hyoung Kwon (Daejeon, KR); Nam-Ho Hur (Daejeon, KR)
Assignee: ELECTRONICS AND TELECOMMUNICATIONS RESEARCH INSTITUTE
H04L1/0057H03M13/036H03M13/1165H03M13/1102H03M13/116H03M13/1148H03M13/1185H03M13/255H03M13/27H03M13/2921H04L1/0041H04L1/0071H04L27/2627
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,602,243
App. No.
14/495,821
Granted
Mar 21, 2017
Kind
B2
Abstract

A low density parity check (LDPC) encoder, an LDPC decoder, and an LDPC encoding method are disclosed. The LDPC encoder includes first memory, second memory, and a processor. The first memory stores an LDPC codeword. The second memory is initialized to 0. The processor generates the LDPC codeword by performing accumulation with respect to the second memory using information bits. The accumulation is performed at parity bit addresses that are updated using a sequence corresponding to a parity check matrix (PCM).

Claims (16)

1. A low density parity check (LDPC) encoder, comprising:

first memory configured to store an LDPC codeword;

second memory configured to be initialized to 0; and

a processor configured to generate the LDPC codeword by performing accumulation with respect to the second memory using information bits;

wherein the accumulation is performed at parity bit addresses that are updated using a sequence corresponding to a parity check matrix (PCM), and

wherein the parity bit addresses are updated in accordance with the following equation:

( x+m×Q 1 ) mod M 1 if x<M 1

M 1 +{( x−M 1 +m×Q 2 ) mod M 2 } if x>M 1

where x denotes previous parity bit addresses, m is an information bit index that is an integer larger than 0 and smaller than L, L is a bit-size of a circulant permutation matrix (CPM) of the PCM, Q 1 is M 1 /L, M 1 is a bit-size of a first parity part, Q 2 is M 2 /L, and M 2 is a bit-size of a second parity part, thereby correcting errors occurring over a wireless channel.

2. The LDPC encoder of claim 1 , wherein the LDPC codeword comprises a systematic part corresponding to the information bits, the first parity part corresponding to a dual diagonal matrix included in the PCM, and the second parity part corresponding to an identity matrix included in the PCM.

3. The LDPC encoder of claim 2 , wherein the second memory has a size corresponding to a sum of the bit-size of the first parity part and the bit-size of the second parity part.

4. The LDPC encoder of claim 3 , wherein the parity bit addresses are updated based on results of comparing each of the previous parity bit addresses specified in each row of the sequence with the bit size of the first parity part.

5. The LDPC encoder of claim 1 , wherein the accumulation is performed while the rows of the sequence are being repeatedly changed by the bit size of the CPM of the PCM.

6. The LDPC encoder of claim 1 , wherein the bit-size of the CPM of the PCM is 360.

7. The LDPC encoder of claim 6 , wherein the first parity part is generated by performing parity interleaving using the first and second memory, and

wherein the second parity part is generated by performing the parity interleaving using the first and second memory after the accumulation performed using the first parity part, which is generated by the parity interleaving, and the sequence.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 26, 2014
From: PARK, SUNG-IK; KIM, HEUNG-MOOK; KWON, SUN-HYOUNG; HUR, NAM-HO
To: ELECTRONICS AND TELECOMMUNICATIONS RESEARCH INSTITUTE
Reel/Frame 033833/0175 →
Priority Claims (2)
KR 10-2014-0111764 · Aug 26, 2014 · national
KR 10-2014-0116872 · Sep 3, 2014 · national
Continuity (1)
Related Publication 20160065242A1 · Mar 3, 2016