LLR BP 总结
- 初始化
- 计算变量节点的初始概率似然比 L ( P i ) L(P_i) L(Pi)
- 设定变量节点传向校验节点的初始消息
L ( 0 ) ( q i j ) = L ( P i ) (1) \begin{aligned} L^{\left( 0\right) }\left( q_{ij}\right) =L\left( P_{i}\right) \end{aligned} \tag{1} L(0)(qij)=L(Pi)(1)
- 迭代处理
-
校验节点消息处理
对所有的校验节点 j j j和与其相邻的变量节点 i ∈ R ( j ) i\in R\left( j\right) i∈R(j),第 l l l次迭代时,计算第 j j j个校验节点传向第 i i i个变量节点的消息
tanh ( 1 2 L ( l ) ( r j i ) ) = ∏ i ′ ∈ V j \ i tanh ( 1 2 L ( l − 1 ) ( q i ′ j ) ) (2) \begin{aligned} \tanh \left( \frac{1}{2} L^{\left( l\right) }\left( r_{ji}\right) \right) =\prod_{i^{\prime }\in V_{j}\backslash i} \tanh \left( \frac{1}{2} L^{\left( l-1\right) }\left( q_{i^{\prime }j}\right) \right) \end{aligned}\tag{2} tanh(21L(l)(rji))=i′∈Vj\i∏tanh(21L(l−1)(qi′j))(2)
或者 L ( l ) ( r j i ) = 2 tanh − 1 ( ∏ i ′ ∈ V j \ i tanh ( 1 2 L ( l − 1 ) ( q i ′ j ) ) ) (3) \begin{aligned} L^{\left( l\right) }\left( r_{ji}\right) =2\tanh^{-1} \left( \prod_{i^{\prime }\in V_{j}\backslash i} \tanh \left( \frac{1}{2} L^{\left( l-1\right) }\left( q_{i^{\prime }j}\right) \right) \right) \end{aligned}\tag{3} L(l)(rji)=2tanh−1⎝⎛i′∈Vj\i∏tanh(21L(l−1)(qi′j))⎠⎞(3) -
变量节点消息处理
对所有的变量节点 i i i和与其相邻的校验节点 j ∈ C ( i ) j\in C\left(i\right) j∈C(i),第l次迭代时,计算第i个变量节点传向第j个校验节点的消息 L ( l ) ( q i j ) = L ( P i ) + ∏ j ∈ C / j L ( l ) ( r j i ) (4) \begin{aligned} L^{(l)}\left(q_{ij}\right) & = L\left(P_{i}\right)+\prod_{j \in C/j} L^{(l)}\left(r_{ji}\right) \end{aligned}\tag{4} L(l)(qij)=L(Pi)+j∈C/j∏L(l)(rji)(4) -
译码判决
所有的变量节点计算硬判决消息 L ( l ) ( q i ) = L ( P i ) + ∏ j ∈ C i L ( l ) ( r j i ) (5) \begin{aligned} L^{(l)}\left(q_{i}\right) = L\left(P_{i}\right)+\prod_{j \in C_i} L^{(l)}\left(r_{ji}\right) \end{aligned}\tag{5} L(l)(qi)=L(Pi)+j∈Ci∏L(l)(rji)(5)
若 L l ( q i ) > 0 L^{l}(q_i)>0 Ll(qi)>0,则 c ^ i = 0 \hat{c}_{i} =0 c^i=0,否则 c ^ i = 1 \hat{c}_{i} =1 c^i=1。
- 停止
若 H c ^ T = 0 H\hat{c}^{T} =0 Hc^T=0或者达到最大迭代次数,则结束运算,否则继续迭代。