LDPC decoder for decoding a low-density parity check (LDPC) codewords

A low-density parity and parity bit technology, applied in the application of multi-bit parity error detection coding, error correction/detection using block codes, data representation error detection/correction, etc., can solve the problem of LDPC decoders Deteriorated performance, high storage size, etc.

Inactive Publication Date: 2005-12-28
INFINEON TECH AG
View PDF0 Cites 48 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

The performance of LDPC decoders according to the state of the art suffers when the number of decoding iterations defined by the threshold is limited
[0068] Traditional LDPC decoding methods and such as Image 6 Another drawback of the corresponding LDPC decoder shown is that checking that the

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
  • LDPC decoder for decoding a low-density parity check (LDPC) codewords
  • LDPC decoder for decoding a low-density parity check (LDPC) codewords
  • LDPC decoder for decoding a low-density parity check (LDPC) codewords

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0128] From Figure 9 As can be seen in , the method for decoding a low density parity check codeword according to the present invention is performed on the basis of received channel observations, ie estimated values ​​or estimates indicating that the received codeword bits have predetermined values. These estimates are computed from the received codeword Y and predetermined parameters of the communication channel. The predetermined parameters of the communication channel are known. In an alternative embodiment of the invention, if the parameters of the communication channel are unknown, the minimum sum message passing calculation rule may be used, for which no parameters of the communication channel are required.

[0129] Figure 11 A general message passing decoding process covering all embodiments is shown in . In the preferred embodiment, these estimates are log-likelihood ratios (LLRs) of the received bits.

[0130] Fig. 15b shows a block diagram of a preferred embodi...

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

As a result of transmitting a low-density parity-check (LDPC) codeword (b) having a number (N) of codeword bits consisting of K information bits and N parity bits, for the received An LDPC decoder for decoding a codeword (Y), comprising: a memory for receiving codeword bits of a noisy codeword (Y), storing the codeword bits from the received noisy codeword (Y) and from The a priori estimate (Qv) of the predetermined value of the predetermined parameter of the communication channel; the generalized check node processing unit, iteratively calculates the messages on the edge of the bipartite graph according to the serial scheduling, and in each iteration, the check for the bipartite graph Node (C), all adjacent variable nodes (V) connected to the check node (C), calculate the input message (Qvc) from the adjacent variable node (V) to the check node (C) and from Output message (RCV) from a check node (C) to a neighboring variable node (V).

Description

technical field [0001] The present invention relates to the field of data communication, in particular, to redundant coding for error correction and error detection. Background technique [0002] Low-density parity-check codes (LDPC) are a class of linear block codes that provide near capacity performance for larger sets of data transmission and storage channels, while allowing achievable encoding and decoding strategies. LDPC codes were first proposed by Gallager in his doctoral dissertation in 1960 (R. Gallager: "Low-density parity check codes", IRE Transformation Series pp. 21-28, January 1962). From a practical point of view, the most notable feature of Gallager's work is the citation of an iterative decoding algorithm, for which he has shown that, when applied to sparse parity-check matrices, it is possible to A significant portion of the channel capacity is achieved. [0003] LDPC codes are defined using a sparse parity check matrix comprising a small number of non-z...

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
IPC IPC(8): H03M13/11
Inventor 西蒙·利辛艾然·沙龙
Owner INFINEON TECH AG
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap