Scribd Logo
Upload

Welcome to Scribd!

  • Summary Chapter 7 ACM

    Uploaded by

    Oliver
    2 views5 pages
    This document provides a description of low-density parity-check (LDPC) codes in 3 paragraphs or less: 1) It introduces the idea of LDPC codes and describes the parity check matrix H, which has a sparse structure with few 1's in each row and column. 2) It explains that H has the property that the number of 1's in each row and column is fixed. H is considered "regular" if each column and row has the same number of 1's. 3) It briefly mentions Gallager's message passing algorithm for hard decision decoding of LDPC codes using a Tanner graph, and belief propagation for soft decision decoding using message passing between variable and check nodes.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document provides a description of low-density parity-check (LDPC) codes in 3 paragraphs or less: 1) It introduces the idea of LDPC codes and describes the parity check matrix H, which has a sparse structure with few 1's in each row and column. 2) It explains that H has the property that the number of 1's in each row and column is fixed. H is considered "regular" if each column and row has the same number of 1's. 3) It briefly mentions Gallager's message passing algorithm for hard decision decoding of LDPC codes using a Tanner graph, and belief propagation for soft decision decoding using message passing between variable and check nodes.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    2 views5 pages

    Summary Chapter 7 ACM

    Uploaded by

    Oliver
    This document provides a description of low-density parity-check (LDPC) codes in 3 paragraphs or less: 1) It introduces the idea of LDPC codes and describes the parity check matrix H, which has a sparse structure with few 1's in each row and column. 2) It explains that H has the property that the number of 1's in each row and column is fixed. H is considered "regular" if each column and row has the same number of 1's. 3) It briefly mentions Gallager's message passing algorithm for hard decision decoding of LDPC codes using a Tanner graph, and belief propagation for soft decision decoding using message passing between variable and check nodes.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 5

    I Desiription of LDPC Code

    a Desiriptions

    Idea E Ht 0 however
    more thanHt can beused for G

    A's is M Wc Wr LDI rod


    sparie
    4 number
    of 1s each row
    1
    number
    of 1 s eachcolumn

    m We m n Wr L A Mm Who

    r 1 Waf
    7 0 We Wo

    H has a property m num.io rmn of H


    n rank
    of H
    i
    His regular if each columnhas thesame Wc

    andeach row has same Wo

    H is irregular with degree distribution

    1 1
    If xix

    eg totalcolumn

    hum column with Wa L


    of
    I Tanner
    Graph

    In 5 5 54 9,565 checknodes

    I
    Check
    if there are errors
    Cj to or
    y Ht 0

    Construct Tanner
    Graph

    1 1 51

    I 1
    53
    j
    1 4
    5g C2

    Is m n

    56
    m
    Jp
    I LDPC Hard Decision Deloding byMessage Passing

    a Gallagher's Algorithm

    Initialization O

    Ji x o 0

    7 1 at cheek node Cj
    i Parity cheek equation I stopcriterion
    Cj 51in 5 iz
    j 51in g to

    ii Extrinsic estimate 5 ii j
    I it
    linjt.FI jli.gl
    4 sumofallinsoming messages 5 iv j
    except theone that come along this
    node

    iii Update
    g ing
    J ing f Zi
    jli.jnl.jli.gr I i jus
    Case l
    if I linja I i
    jul 4 Zi
    Zi else

    Case 2 based
    on majorityderision

    1 Ji I injl
    I LDPC SoftDecision Decoding byBeliefPropagation

    Mapping to 0 1

    1 1

    Initialization o

    Ili 1121

    Iteration X 1
    Check node
    update return ex
    info from
    cheek tovarnodes
    I in j I ii Cheinbox sumover allother
    j entries
    in thenov

    1 ing in i is iq is to it
    I 1121 42 424 11261

    j 1122142 428

    1 42 1124 1120 11271

    421 112
    4111251 11271

    Li Uti 421 1124 42,1 42911125 426 11271


    Variable node
    update Update messages from variable tochecknodes
    I li.jo hi I trig sum
    ofallotherentries
    gg in the lotmn

    I sign Li I ii j

    You might also like