📄 dep-h.html
字号:
<HTML><HEAD><TITLE> Linear Dependence in Parity Check Matrices </TITLE></HEAD><BODY><H1> Linear Dependence in Parity Check Matrices </H1><P>If a code is specified by means of a <I>M</I> by <I>N</I> paritycheck matrix, <B>H</B>, in which some rows are linearly dependent - asituation that is usually avoided - it would be possible to map morethan the usual <I>K=N-M</I> message bits into a codeword, since one ormore rows of <B>H</B> could have been deleted without affecting whichbit vectors are codewords.<P>However, this software does not increase the number of message bitsin this case, but instead produces a generator matrix in which somerows are all zero, which will cause some bits of the codeword toalways be zero, regardless of the source message. Referring to the <AHREF="encoding.html#gen-rep">description of generator matrixrepresentations</A>, this is accomplished by continuing to computewhat would normally become <B>A</B><SUP><SMALL>-1</SMALL></SUP> (for adense or mixed representations) or the <B>L</B> and <B>U</B> matrices(for a sparse representation), even though singularity has become apparent.<P><B>Example:</B> The parity check matrix created below is redundant,since the 10100 row is equal to the sum of the 11000 and 01100 rows.<UL><PRE><LI>make-pchk dep.pchk 4 5 0:0 0:1 1:1 1:2 2:0 2:2 3:3 3:4<LI>print-pchk -d dep.pchkParity check matrix in dep.pchk (dense format): 1 1 0 0 0 0 1 1 0 0 1 0 1 0 0 0 0 0 1 1<LI>make-gen dep.pchk dep.gen denseNote: Parity check matrix has 1 redundant checksNumber of 1s per check in Inv(A) X B is 0.2<LI>print-gen dep.genGenerator matrix (dense representation):Column order (message bits at end): 0 1 2 3 4Inv(A) X B: 0 0 0 1</PRE></UL>The generator matrix above can be used to encode message blocks containingone bit. This message bit is copied unchanged to the last bit (numbered 4) of the codeword, and the first four bits of the codeword are set by multiplying<B>A</B><SUP><SMALL>-1</SMALL></SUP><B>B</B>, shown above, by the messagebit. The result is that the first three bits of the codeword produced are always zeros, and the last two bits are always the same (and equal to the message bit).<P>Note that codeword bits that are always zero can arise even when <B>H</B>does not have linearly dependent rows. For example, if a row of <B>H</B>has just one 1 in it, the codeword bit at that position must be zero in anycodeword. The way the software handles parity check matrices with lessthan <I>M</I> independent rows is equivalent to adding additional rowsto <B>H</B> in which only one bit is 1, in order to produce <I>M</I> independent checks.<HR><A HREF="index.html">Back to index for LDPC software</A></BODY></HTML>⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -