Unlock instant, AI-driven research and patent intelligence for your innovation.

Method for decoding non-binary codes and corresponding decoding apparatus

A non-binary, decoder technology, applied in the field of telecommunications and data storage, can solve the problems of lack, decoding iterative recovery, performance loss, etc., to achieve the effect of improving performance

Inactive Publication Date: 2017-05-10
CENT NAT DE LA RECHERCHE SCI +2
View PDF5 Cites 6 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

This performance loss is due to the lack of soft information used in the CNU of GBFDA and MD, and cannot be recovered using a large number of decoding iterations [18]

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Method for decoding non-binary codes and corresponding decoding apparatus
  • Method for decoding non-binary codes and corresponding decoding apparatus
  • Method for decoding non-binary codes and corresponding decoding apparatus

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0051] A method for decoding non-binary low density parity check (NB-LDPC) codes defined in a finite field of size q is based on including at least one variable node V n ,n=0,...,N-1 and at least one check node C m ,m=0,..., the bipartite graph of M-1.

[0052] Figure 1a Shows that there are M check nodes C m ,m=0,...,M-1 and N variable nodes V n ,n=0,...,N-1 bipartite graph. As shown in this figure, each check node C m Is connected to d c Variable node V n .

[0053] NB-LDPC notation

[0054] Let us define a code length N and information length K in GF(q)(q=2 p ) On the (N, K) NB-LDPC code. Its parity check matrix H M,N It has N columns and M rows. H M,N The non-zero coefficient is h m,n , Where m is the row index and n is the column index. The check node degree is expressed as d c And the variable node degree is expressed as d v . Defines the set of variable nodes connected to the m-th check node, and A set of check nodes connected to the nth variable node is defined. Aft...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention concerns an extension to the enhanced serial generalized bit-flipping decoding algorithm (ES-GBFDA) of non- binary LDPC codes by introducing soft information in the check node operation. Contrary to the ES-GBFDA, the application not only considers the most reliable symbol in the syndrome computation, but also takes at least the second most reliable symbol of each incoming message into account. By doing so, an extended information set is available for the parity-check node update and this allows introducing the concept of weak and strong votes performed by the check node unit. With this feature, each variable node can receive two kinds of votes, whose amplitudes can be tuned to the reliability of the syndrome that produces the vote.

Description

Technical field [0001] The invention relates to the decoding of error correction codes in the fields of telecommunications and data storage. More specifically, the present invention relates to a decoding method and corresponding decoder for a non-binary low density parity check (LDPC) code. Background technique [0002] The design of a high-throughput decoder for non-binary low-density parity check (NB-LDPC) codes in GF(q) using medium silicon area is a challenging problem, which requires both low-complexity algorithms and Efficient architecture. [0003] Algorithms derived from q-ary sum products (QSPA)[1], [2], [3], [4] (such as extended minimum sum (EMS)[5] and minimum maximum (Min-Max)[7]) It involves high complexity in the Check Node Unit (CNU) where they implement the parity node update equation. In particular, due to the large inherent delay, different versions of CNU of EMS or Min-Max require many comparisons, which reduces the maximum achievable throughput. This high d...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Applications(China)
IPC IPC(8): H03M13/11
CPCH03M13/1108H03M13/1171
Inventor 大卫·德克莱尔李二保弗朗西斯科·米格尔·加西亚·赫雷罗哈维尔·巴利斯·科基亚
Owner CENT NAT DE LA RECHERCHE SCI