IP Library › Granted Patent US 9,473,173
Granted Patent B2
US 9,473,173 · App. 14/193,018 · Granted Oct 18, 2016

Method for early terminating decoding processes of serial concatenated coding and decoder using the same

Inventors: Chih Nan Yen (Hsinchu, TW); Jui Hui Hung (Hsinchu, TW)
Assignee: Storart Technology Co. Ltd.
H03M13/1105H03M13/1128H03M13/2906H03M13/6502H03M13/116H03M13/152
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,473,173
App. No.
14/193,018
Granted
Oct 18, 2016
Kind
B2
Abstract

A method and decoder for early terminating decoding processes of serial concatenated coding are disclosed. The method includes the steps of providing a codeword, encoded by a first coding and a second coding sequentially; setting a maximum syndrome weight; decoding the second coding for the codeword by iterative calculations for syndromes; terminating decoding of the second coding if a number of the iterative calculations reaches a preset number or a syndrome weight of one iterative calculation is equal to or smaller than the maximum syndrome weight, otherwise repeating the decoding step and the terminating step; and decoding the first coding for the codeword.

Claims (25)

1. A method for early terminating decoding processes of a codeword coded by serial concatenated coding, comprising the steps of:

A. providing a codeword, encoded by a first coding and a second coding sequentially;

B. setting a maximum syndrome weight;

C. decoding the second coding for the codeword by iterative calculations for syndromes;

D. terminating decoding of the second coding if a syndrome weight of one iterative calculation is equal to or smaller than the maximum syndrome weight, otherwise repeating step C to step D; and

E. decoding the first coding for the codeword,

wherein the syndrome is a binary number which includes a plurality of “0” and “1”; and

wherein the syndrome weight is an amount of “1” in the syndromes and updated after step C is completed.

2. The method according to claim 1 , wherein step C comprises the steps of:

C1. checking node updating for the codeword by a parity check matrix;

C2. performing syndrome calculation to obtain the syndrome weight; and

C3. updating bit nodes for the codeword.

3. The method according to claim 1 , wherein the first coding is a convolutional code or turbo code.

4. The method according to claim 1 , wherein the first coding is a block code comprising Bose-Chaudhuri-Hocquenghem (BCH) code, Quasi-Cyclic Low-Density Parity Check (QC-LDPC) code, Low-Density Parity Check (LDPC) code, Hamming code, Reed-Solomon (RS) code or Quadratic Residue (QR) code.

5. The method according to claim 1 , wherein the second coding is QC-LDPC code or LDPC code.

6. A decoder for early terminating decoding processes of a codeword coded by serial concatenated coding, the decoder comprising:

an inner decoding module, receiving a codeword, encoded by a first coding and a second coding sequentially, for decoding the second coding for the codeword and sending a treated codeword, comprising:

a decoding circuit, for checking whether bit nodes of the codeword is updated by a parity check matrix and updating bit nodes for the codeword iteratively until a number of iterative calculation thereof reaches a preset number; and

a syndrome weight checking circuit, for checking a syndrome weight after the decoding circuit checks node updating for the codeword, and terminating decoding of the second coding when the syndrome weight is equal to or smaller than a maximum syndrome weight and keeping current form of the codeword as the treated codeword; and

an outer decoding module, linked to the inner decoding module, for receiving the treated codeword and processing decoding of the first coding for the treated codeword,

wherein the syndrome is a binary number which includes a plurality of “0” and “1”; and

wherein decoding of the second coding needs iterative calculations for syndromes and the syndrome weight is an amount of “1” in the syndromes.

7. The decoder according to claim 6 , wherein the first coding is a convolutional code or turbo code.

8. The decoder according to claim 6 , wherein the first coding is a block code comprising Bose-Chaudhuri-Hocquenghem (BCH) code, Quasi-Cyclic Low-Density Parity Check (QC-LDPC) code, Low-Density Parity Check (LDPC) code, Hamming code, Reed-Solomon (RS) code or Quadratic Residue (QR) code.

9. The decoder according to claim 6 , wherein the second coding is QC-LDPC code or LDPC code.

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Mar 30, 2018
From: STORART TECHNOLOGY CO., LTD.
To: STORART TECHNOLOGY(SHENZHEN) CO., LTD.
Reel/Frame 045394/0576 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 28, 2014
From: YEN, CHIH NAN; HUNG, JUI HUI
To: STORART TECHNOLOGY CO., LTD.
Reel/Frame 032320/0563 →
Continuity (1)
Related Publication 20150249471A1 · Sep 3, 2015