# An Alternative Approach Obtaining a Normalization Factor in Normalized Min-Sum Algorithm for Low-Density Parity-Check Code

Authors: In-Woo Yun; Hee-ran Lee; Joon Tae Kim
Journal: Wireless Communications and Mobile Computing
 (2018)

---

## Abstract

The min-sum algorithm (MSA) for decoding Low-Density Parity-Check (LDPC) code is an approximation algorithm that can greatly reduce the computational complexity of the belief propagation algorithm (BPA). To reduce the error between MSA and BPA, an improved MSA such as normalized min-sum algorithm (NMSA) that uses the normalization factor when updating the check node is used in many LDPC decoders. When obtaining an optimal normalization factor, density evolution (DE) is usually used. However, not only does the DE method require a large number of calculations, it may not be optimal for obtaining a normalization factor due to the theoretical assumptions that need to be satisfied. This paper proposes a new method obtaining a normalization factor for NMSA. We first examine the relationship between the minimum value of variable node messages’ magnitudes and the magnitudes of check node outputs of BPA using the check node message distribution (CMD) chart. And then, we find a normalization factor that minimizes the error between the magnitudes of check node output of NMSA and BPA. We use the least square method (LSM) to minimize the error. Simulation on ATSC 3.0 LDPC codes demonstrates that the normalization factor obtained by this proposed method shows better decoding performance than the normalization factor obtained by DE.


---

## Body

## 1. Introduction

Low-Density Parity-Check (LDPC) codes [1] proposed by Gallager in the 1960s have been used for error correcting codes for many communication standards showing the error correcting capability close to the Shannon limit. However, LDPC codes burdens the hardware since it must perform many floating-point operations repeatedly during decoding. Therefore, numerous researches have been carried out to reduce the computational complexity of LDPC decoder. One of the topics of the researches was to reduce the computational complexity of the belief propagation algorithm (BPA), known as an optimal message passing decoder for LDPC codes in the binary symmetric channel. The BPA involves great number of logarithmic and multiplicative operations when updating the check node. In an effort to reduce the computational complexity of the BPA, min-sum algorithm (MSA) has been proposed [2]. MSA approximates the exponential term of the check node update function to the minimum value selector. However, MSA has large performance degradation due to the approximation. To improve decoding performances of MSA normalized min-sum algorithm (NMSA), which normalizes the minimum value of the variable node messages, has been introduced [3].When selecting a normalization factor in the NMSA, density evolution (DE) is usually used [4]. The DE is an analytical tool used for LDPC codes with message passing decoders. It is used to calculate the average probability density function (pdf) of messages along the edges for a given code ensemble and decoding algorithm. If the code length and the number of iterative decoding approach infinity, DE predicts the minimum signal-to-noise ratio (i.e., threshold) for convergence of the bit error probability to zero [5]. However, this method requires the assumption that the specific LDPC code is a tree structure and the algorithm used for decoding should satisfy a symmetric condition. Considering that the LDPC code is rarely a tree structure and the approximation algorithm does not satisfy a symmetric condition, a normalization factor derived from DE may not be optimal. Additionally, performing DE needs a lot of computation when obtaining pdfs of messages [6].For this reason, we introduce an alternative approach obtaining a normalization factor. The main idea of the proposed method is to find a factor that minimizes errors between check node outputs of BPA and NMSA by observing the distribution of check node messages of BPA with a graph called check node message distribution (CMD) chart. Since the BPA uses all the input messages of a check node when processing a check node output, it is very hard to predict the output using only a minimum input message. However, if the signal-to-noise ratio (SNR) and the number of iteration is fixed, we can easily see the trend of the error by plotting the CMD chart with the minimum value of input messages’ magnitudes as the x-axis and the magnitudes of the check node output of BPA as the y-axis. After observing the CMD chart, the LSM is used to find a normalization factor that minimizes the error.The rest of this paper is organized as follows. In Section2.1 we briefly introduce the check node update equation for various decoding algorithms of LDPC codes in the LLR domain. In Section 2.2 we explain how to derive a normalization factor using the CMD chart and the least squares method (LSM). Lastly, we show simulation result with some of the code rates on ATSC 3.0 LDPC codes that the normalization factor derived from the proposed methods shows superior decoding performance over factor using the DE method in NMSA decoding.


## 2. Materials and Methods

### 2.1. Check Node Update of LDPC Codes

BPA, MSA, and NMSA are identical during the decoding procedures but not during the updating of check nodes [7]. Therefore, in this paper, we show only the check node update process for each algorithm. If the nth variable node is Vn, and mth check node is Cm, the check node message of BPA LmnBPA is computed using (1) and (2) where Ln′m denotes variable node messages passing from Vn′ to Cm. The notation n′ denotes variable nodes connected to Cm, excluding n, and the notation dc denotes the number of variable nodes connected to Cm. All algorithms covered in this chapter including BPA calculate the sign of LmnBPA by multiplying all signs of variable node messages except the node that passes the message. The magnitudes of LmnBPA is calculated using Φ(x) function in (2), and this function consists of a transcendental function. This algorithm needs the 2dc floating point addition and 2dcΦx operation to calculate the magnitudes of dc check node output messages per one check node.(1)LmnBPA=∏n′∈Cm∖nsignLn′mΦ∑n′∈Cm∖nΦLn′m(2)Φx=-ln⁡tanh⁡x2Equation (3) is used to update the check node using MSA. Ln′m denotes a column vector whose elements are messages from the variable nodes connected to Cm except the message from Vn. The sign of the check node output is calculated in the same way as BPA. The magnitude of check node output is processed by selecting the minimum value of variable node messages’ magnitudes excluding the node that passes the processed message. In contrast to BPA, this algorithm only needs 2dc floating point comparison to calculate the magnitudes of check node outputs for one check node.(3)LmnMSA=∏n′∈Cm∖nsignLn′mminn′∈Cm∖n⁡Ln′mTo compensate the large difference between the check node output messages of BPA and MSA, the NMSA scales the selected minimum value as in (4). By using a proper normalization factor, the NMSA can achieve performances very close to the BPA [4]. This algorithm needs one additional floating-point multiplier per one check node compare to MSA, but it can greatly improve the decoding performance.(4)LmnNMSA=α·∏n′∈Cm∖nsignLn′mminn′∈Cm∖n⁡Ln′m


### 2.2. The Method of Obtaining the Normalization Factor Using the CMD Chart

In the previous section, we mentioned that the MSA can significantly reduce the number of computations for obtaining the magnitudes of a check node message by approximating the transcendental function to a minimum selecting function. Also, NMSA can bridge the gap between the check node output of BPA and MSA by scaling the minimum value. In this chapter, we visualize how NMSA bridges the gap by showing an example of a CMD chart that we propose in this paper. This chart can be further used to get a normalization factor. CMD chart is short for check node message distribution chart, which plots the magnitudes of check node output messages as the y axis, and the minimum value of input variable node messages’ magnitudes connected to a check node excludingnth variable node (min⁡Ln′m). Figure 1 shows an example of the CMD chart simulated using n,j,k=n,dv,dc=(20,3,4) regular LDPC code where n denotes number of encoded bits and dv denotes the number of check node connected to one variable node. The parity check matrix was constructed using the Gallager method [1]. In this simulation, SNR=-5[dB] AWGN was added to the BPSK mapped signal. After demapping, 20 log-likelihood ratios (LLRs) were set as the initial value of variable node messages and check node output messages are obtained using each decoding algorithm. Data points on Figure 1 are the magnitudes of a check node output messages for the same (min⁡Ln′m). To explain in detail, we pick out one check node then follow the message calculation and plotting process. One check node Cm receives four variable node messages Lnm=[1.49,0.97,-0.40,0.52]. Then, the check node processes output messages using BPA using Eq. (1) and Eq. (2). The four check node output messages are LmnBPA=[-0.04,-0.06,0.14,-0.11]. Meanwhile, the minimum values of the variable node messages are min⁡Ln′m=[-0.40,-0.40,0.52,-0.40] and this vector is equal to the check node output message vector of MSA (LmnMSA). We can plot the data points (min⁡Ln′m,LmnBPA) as shown in Figure 1 (∗). We can easily notice that the check node output messages, obtained using MSA, are very different from the messages obtained using BPA because data points (○, □) are distant from each other. Furthermore, we can guess that this causes a large performance gap between the two algorithms. We can also see how NMSA improves the performance in the CMD chart. In the case of setting the normalization factor as 0.26, the check node output message vector of NMSA is LmnNMSA=[-0.10,-0.10,0.14,-0.10]. NMSA is expected to achieve performances close to that of BPA with the error being reduced from [0.36,0.34,0.38,0.29] to [0.06,0.04,0.01,0.01]. In this way, we find the normalization factor which best approximates the check node output of BPA. To obtain the appropriate normalization factor, we first examine how the appropriate normalization factor varies with dc and SNR in Section 2.2.1. Then we propose a new method to minimize the error between BPA and NMSA by using LSM in Section 2.2.2.Figure 1
CMD chart according todc=3, Es/N0=-5[dB].


#### 2.2.1. Check Node Message Distribution Chart

The CMD chart shows the magnitudes of check node messages of a specific decoding algorithm against the minimum value ofLn′m. In this chapter, we introduce more examples of CMD chart and explain the characteristics of check node output messages of BPA decoder using the chart. We first show how the distribution of the data points in CMD charts changes in a different SNR. Then, we show how the distribution changes when the number of variable nodes connected to one check node (dc) changes. The distribution also changes as the iteration proceeds. However, since the processing of iteration can be considered as an increase in SNR, we skip the subject and cover it in detail in Section 2.2.2. These examples will help us to get a sense of, which values of normalization factor will improve the decoding performance. Figure 2 shows CMD chart for different SNR (Es/N0). The check node messages are obtained through the Monte Carlo simulation. We first generated the random bits and modulated using QPSK. We then calculated the check node messages, assuming that one check node is connected to three variable nodes (dc=3). In Figure 2(a), the simulation shows that values of check node output messages of two algorithms are very similar in a high SNR. In the lowest SNR, as shown in Figure 2(c), the differences are relatively large. This change of distribution in the different SNRs is caused by the characteristics of error between BPA and MSA. The check node update function of the BPA can be divided into two terms, which are sign computing and minimum value selecting term, and error term as in Eq. (5) [8]. Since the sign computing and the minimum value selecting term is equal to the check node update function of the MSA, the error between the check node output messages of the BPA and MSA can be calculated using the error term. This error can have values between ln⁡1+e-|∞|/1+e-|0|≈-ln⁡(2) and ln⁡1+e-|0|/1+e-|∞|≈ln⁡(2). In other words, regardless of the values of variable node messages, the error is bound to give a value between -ln⁡(2) and ln⁡(2). In conclusion, the initial variable node messages have large values in a high SNR environment, so min⁡Ln′m is also high, resulting in the bounded error showing a relatively small value compared to min⁡Ln′m. Therefore, the data points of BPA are distributed closely to that of MSA in a high SNR. Using this information, we can understand that relatively small normalization factor will improve decoding performance in low SNR, and MSA shows great performance in high SNR.(5)Lmn3BPA=signLn1msignLn2mmin⁡Ln1m,Ln2m+ln⁡1+e-Ln1m+Ln2m1+e-Ln1m-Ln2mFigure 2
CMD charts according toEs/N0. (a) Es/N0=5 [dB]. (b) Es/N0=0 [dB]. (c) Es/N0=-5 [dB].
(a) (b) (c)Figure3 shows the CMD chart according to dc. As shown in the figure, when dc becomes larger, the output value of the check node becomes smaller. This can be explained by the characteristics of Φ(x) function of (2) which is used to update the check node with BPA. The function Φx has characteristics, which is that input and output of the function are defined only for positive real values and that they are inversely proportional. Since ΦLn′m from (1) is always positive, when they are summed, the large dc yields a small output of the check node. Therefore, for the NMSA to approximate the BPA well, in lower SNR or larger dc conditions, the normalization factor should have a small value.Figure 3
CMD charts according todc. (a) dc=3, (b) dc=6, and (c) dc=9.
(a) (b) (c)


#### 2.2.2. Obtaining Normalization Factors Using the Least Square Method

The LSM is used to derive the parameters of the curve, which minimizes the square sum (L2 norm) of the shortest distance between the curve and the given data points. It is used to remove noise from data points or to characterize the data set. We use this method to obtain a normalization factor that minimizes the error between the check node messages of BPA and NMSA. We use data pointsmin⁡(|Ln′m|),|LmnBPA| for n′∈Cm∖n, and m∈1,M where M is the number of the check node. If we define a set of min⁡(|Ln′m|) as the column vector X and a column vector LmnBPA as the vector Y, the normalization factor can be obtained from equation (6) as follows.(6)α=XTX-1XTYFigure4 is a graph showing the bit error rate of four different decoding algorithms when the maximum number of iterations is set to 1. The simulation is conducted on the ATSC 3.0 LDPC code rate of 2/15 and the frame size of 64800 while using QPSK mapping. An average value for the normalization factor is derived through repetitive simulation and used for decoding in each SNR. As shown in Figure 4, the decoding performance of the proposed method is close to that of BPA than the DE method [9], especially in low SNR.Figure 4
Bit error rate when the number of maximum iterations is set as 1.When the number of iterations is higher than one, we need to obtain an appropriateα for each iteration. So we rewrite (6) to (7) where α(l) denotes a normalization factor for lth iteration and X(l) and Y(l) denote vectors for data points min⁡(|Ln′m|),|LmnBPA| at lth iteration.(7)αl=XlTXl-1XlTYlFigure5 shows a computer simulation block diagram for obtaining a set of normalization factors α(l). In the simulation, we get vectors X(l) and Y(l) assuming that the (l-1)th iteration is correctly decoded using BPA and find α(l) that has the least square sum with the given data points. Since the decoding tends to proceed well, irrespective of the decoding algorithm in high SNR, the SNR to get α(l) is set to a minimum error free SNR for the BPA algorithm so that the check node messages can be well approximated in a low SNR. The simulation result of obtaining the set of α(l) for each iteration is shown in Figure 6. The maximum iteration number is set as 40 in the simulation. In early iterations, the magnitudes of LLR values of the variable node messages have small values, which means that the messages have high a bit error probability. So, the CMD chart shows similar distribution as Figure 2(c), and the appropriate normalization factor is comparatively small. As the iteration progresses, the magnitudes of LLR values of the variable node messages get larger and their distribution becomes closer to the CMD chart of Figure 2(a). At the completion of iterative decoding, the normalization factor converges to 1 and the NMSA becomes equal to the MSA.Figure 5
Block diagram of a procedure obtainingα with LSM.Figure 6
Trend of appropriate normalization factors over the number of iterations.By using the set of normalization factors derived from this simulation, we can obtain good decoding performance by changing the normalization factor for each iteration. However, for the sakeof computational efficiency, we need to derive a single normalization factor for all iterations. When theα(l) obtained from early iterations is used as a single normalization factor, the error free SNR is high because it does not properly approximate BPA as iteration proceeds. On the other hand, if the α(l) obtained from the end of iterations is selected as a single factor, the message is exaggerated at the beginning of decoding, and as a result the error free SNR is high. Therefore, it is appropriate to use an intermediate normalization factor. So, we derived the best normalization factor for the entire iteration through simulation. The simulation result is shown in Figure 7. In the case of code rate 2/15, Figure 7(a), the normalization factor obtained from the eighth iteration α8≈0.5538 showed the lowest error free SNR. Likewise, in the case of code rate 3/15, Figure 7(b), the normalization factor obtained from the fourth iteration α4≈0.5576 showed the lowest error free SNR. As a result, we specify the normalization factor α8≈0.5538 as a single coefficient at code rate 2/15 and α4≈0.5576 as a single coefficient at code rate 3/15.Figure 7
Error freeEs/N0 whenα(l) used for decoding. (a) 2/15 and (b) 3/15.
(a) (b)The proposed method can efficiently obtain normalization factor for each iteration by using CMD chart and LSM. This method is much easier to implement than DE method since it does not require infinitely repeated pdf calculation to get a single normalization factor [10, 11]. Also, the proposed method needs fixed number (i.e., the maximum iteration number) of α verifications to derive a single alpha for the entire iteration, whereas the DE method needs full search of alpha in range from 0 to 1 [11].


## 2.1. Check Node Update of LDPC Codes

BPA, MSA, and NMSA are identical during the decoding procedures but not during the updating of check nodes [7]. Therefore, in this paper, we show only the check node update process for each algorithm. If the nth variable node is Vn, and mth check node is Cm, the check node message of BPA LmnBPA is computed using (1) and (2) where Ln′m denotes variable node messages passing from Vn′ to Cm. The notation n′ denotes variable nodes connected to Cm, excluding n, and the notation dc denotes the number of variable nodes connected to Cm. All algorithms covered in this chapter including BPA calculate the sign of LmnBPA by multiplying all signs of variable node messages except the node that passes the message. The magnitudes of LmnBPA is calculated using Φ(x) function in (2), and this function consists of a transcendental function. This algorithm needs the 2dc floating point addition and 2dcΦx operation to calculate the magnitudes of dc check node output messages per one check node.(1)LmnBPA=∏n′∈Cm∖nsignLn′mΦ∑n′∈Cm∖nΦLn′m(2)Φx=-ln⁡tanh⁡x2Equation (3) is used to update the check node using MSA. Ln′m denotes a column vector whose elements are messages from the variable nodes connected to Cm except the message from Vn. The sign of the check node output is calculated in the same way as BPA. The magnitude of check node output is processed by selecting the minimum value of variable node messages’ magnitudes excluding the node that passes the processed message. In contrast to BPA, this algorithm only needs 2dc floating point comparison to calculate the magnitudes of check node outputs for one check node.(3)LmnMSA=∏n′∈Cm∖nsignLn′mminn′∈Cm∖n⁡Ln′mTo compensate the large difference between the check node output messages of BPA and MSA, the NMSA scales the selected minimum value as in (4). By using a proper normalization factor, the NMSA can achieve performances very close to the BPA [4]. This algorithm needs one additional floating-point multiplier per one check node compare to MSA, but it can greatly improve the decoding performance.(4)LmnNMSA=α·∏n′∈Cm∖nsignLn′mminn′∈Cm∖n⁡Ln′m


## 2.2. The Method of Obtaining the Normalization Factor Using the CMD Chart

In the previous section, we mentioned that the MSA can significantly reduce the number of computations for obtaining the magnitudes of a check node message by approximating the transcendental function to a minimum selecting function. Also, NMSA can bridge the gap between the check node output of BPA and MSA by scaling the minimum value. In this chapter, we visualize how NMSA bridges the gap by showing an example of a CMD chart that we propose in this paper. This chart can be further used to get a normalization factor. CMD chart is short for check node message distribution chart, which plots the magnitudes of check node output messages as the y axis, and the minimum value of input variable node messages’ magnitudes connected to a check node excludingnth variable node (min⁡Ln′m). Figure 1 shows an example of the CMD chart simulated using n,j,k=n,dv,dc=(20,3,4) regular LDPC code where n denotes number of encoded bits and dv denotes the number of check node connected to one variable node. The parity check matrix was constructed using the Gallager method [1]. In this simulation, SNR=-5[dB] AWGN was added to the BPSK mapped signal. After demapping, 20 log-likelihood ratios (LLRs) were set as the initial value of variable node messages and check node output messages are obtained using each decoding algorithm. Data points on Figure 1 are the magnitudes of a check node output messages for the same (min⁡Ln′m). To explain in detail, we pick out one check node then follow the message calculation and plotting process. One check node Cm receives four variable node messages Lnm=[1.49,0.97,-0.40,0.52]. Then, the check node processes output messages using BPA using Eq. (1) and Eq. (2). The four check node output messages are LmnBPA=[-0.04,-0.06,0.14,-0.11]. Meanwhile, the minimum values of the variable node messages are min⁡Ln′m=[-0.40,-0.40,0.52,-0.40] and this vector is equal to the check node output message vector of MSA (LmnMSA). We can plot the data points (min⁡Ln′m,LmnBPA) as shown in Figure 1 (∗). We can easily notice that the check node output messages, obtained using MSA, are very different from the messages obtained using BPA because data points (○, □) are distant from each other. Furthermore, we can guess that this causes a large performance gap between the two algorithms. We can also see how NMSA improves the performance in the CMD chart. In the case of setting the normalization factor as 0.26, the check node output message vector of NMSA is LmnNMSA=[-0.10,-0.10,0.14,-0.10]. NMSA is expected to achieve performances close to that of BPA with the error being reduced from [0.36,0.34,0.38,0.29] to [0.06,0.04,0.01,0.01]. In this way, we find the normalization factor which best approximates the check node output of BPA. To obtain the appropriate normalization factor, we first examine how the appropriate normalization factor varies with dc and SNR in Section 2.2.1. Then we propose a new method to minimize the error between BPA and NMSA by using LSM in Section 2.2.2.Figure 1
CMD chart according todc=3, Es/N0=-5[dB].


### 2.2.1. Check Node Message Distribution Chart

The CMD chart shows the magnitudes of check node messages of a specific decoding algorithm against the minimum value ofLn′m. In this chapter, we introduce more examples of CMD chart and explain the characteristics of check node output messages of BPA decoder using the chart. We first show how the distribution of the data points in CMD charts changes in a different SNR. Then, we show how the distribution changes when the number of variable nodes connected to one check node (dc) changes. The distribution also changes as the iteration proceeds. However, since the processing of iteration can be considered as an increase in SNR, we skip the subject and cover it in detail in Section 2.2.2. These examples will help us to get a sense of, which values of normalization factor will improve the decoding performance. Figure 2 shows CMD chart for different SNR (Es/N0). The check node messages are obtained through the Monte Carlo simulation. We first generated the random bits and modulated using QPSK. We then calculated the check node messages, assuming that one check node is connected to three variable nodes (dc=3). In Figure 2(a), the simulation shows that values of check node output messages of two algorithms are very similar in a high SNR. In the lowest SNR, as shown in Figure 2(c), the differences are relatively large. This change of distribution in the different SNRs is caused by the characteristics of error between BPA and MSA. The check node update function of the BPA can be divided into two terms, which are sign computing and minimum value selecting term, and error term as in Eq. (5) [8]. Since the sign computing and the minimum value selecting term is equal to the check node update function of the MSA, the error between the check node output messages of the BPA and MSA can be calculated using the error term. This error can have values between ln⁡1+e-|∞|/1+e-|0|≈-ln⁡(2) and ln⁡1+e-|0|/1+e-|∞|≈ln⁡(2). In other words, regardless of the values of variable node messages, the error is bound to give a value between -ln⁡(2) and ln⁡(2). In conclusion, the initial variable node messages have large values in a high SNR environment, so min⁡Ln′m is also high, resulting in the bounded error showing a relatively small value compared to min⁡Ln′m. Therefore, the data points of BPA are distributed closely to that of MSA in a high SNR. Using this information, we can understand that relatively small normalization factor will improve decoding performance in low SNR, and MSA shows great performance in high SNR.(5)Lmn3BPA=signLn1msignLn2mmin⁡Ln1m,Ln2m+ln⁡1+e-Ln1m+Ln2m1+e-Ln1m-Ln2mFigure 2
CMD charts according toEs/N0. (a) Es/N0=5 [dB]. (b) Es/N0=0 [dB]. (c) Es/N0=-5 [dB].
(a) (b) (c)Figure3 shows the CMD chart according to dc. As shown in the figure, when dc becomes larger, the output value of the check node becomes smaller. This can be explained by the characteristics of Φ(x) function of (2) which is used to update the check node with BPA. The function Φx has characteristics, which is that input and output of the function are defined only for positive real values and that they are inversely proportional. Since ΦLn′m from (1) is always positive, when they are summed, the large dc yields a small output of the check node. Therefore, for the NMSA to approximate the BPA well, in lower SNR or larger dc conditions, the normalization factor should have a small value.Figure 3
CMD charts according todc. (a) dc=3, (b) dc=6, and (c) dc=9.
(a) (b) (c)


### 2.2.2. Obtaining Normalization Factors Using the Least Square Method

The LSM is used to derive the parameters of the curve, which minimizes the square sum (L2 norm) of the shortest distance between the curve and the given data points. It is used to remove noise from data points or to characterize the data set. We use this method to obtain a normalization factor that minimizes the error between the check node messages of BPA and NMSA. We use data pointsmin⁡(|Ln′m|),|LmnBPA| for n′∈Cm∖n, and m∈1,M where M is the number of the check node. If we define a set of min⁡(|Ln′m|) as the column vector X and a column vector LmnBPA as the vector Y, the normalization factor can be obtained from equation (6) as follows.(6)α=XTX-1XTYFigure4 is a graph showing the bit error rate of four different decoding algorithms when the maximum number of iterations is set to 1. The simulation is conducted on the ATSC 3.0 LDPC code rate of 2/15 and the frame size of 64800 while using QPSK mapping. An average value for the normalization factor is derived through repetitive simulation and used for decoding in each SNR. As shown in Figure 4, the decoding performance of the proposed method is close to that of BPA than the DE method [9], especially in low SNR.Figure 4
Bit error rate when the number of maximum iterations is set as 1.When the number of iterations is higher than one, we need to obtain an appropriateα for each iteration. So we rewrite (6) to (7) where α(l) denotes a normalization factor for lth iteration and X(l) and Y(l) denote vectors for data points min⁡(|Ln′m|),|LmnBPA| at lth iteration.(7)αl=XlTXl-1XlTYlFigure5 shows a computer simulation block diagram for obtaining a set of normalization factors α(l). In the simulation, we get vectors X(l) and Y(l) assuming that the (l-1)th iteration is correctly decoded using BPA and find α(l) that has the least square sum with the given data points. Since the decoding tends to proceed well, irrespective of the decoding algorithm in high SNR, the SNR to get α(l) is set to a minimum error free SNR for the BPA algorithm so that the check node messages can be well approximated in a low SNR. The simulation result of obtaining the set of α(l) for each iteration is shown in Figure 6. The maximum iteration number is set as 40 in the simulation. In early iterations, the magnitudes of LLR values of the variable node messages have small values, which means that the messages have high a bit error probability. So, the CMD chart shows similar distribution as Figure 2(c), and the appropriate normalization factor is comparatively small. As the iteration progresses, the magnitudes of LLR values of the variable node messages get larger and their distribution becomes closer to the CMD chart of Figure 2(a). At the completion of iterative decoding, the normalization factor converges to 1 and the NMSA becomes equal to the MSA.Figure 5
Block diagram of a procedure obtainingα with LSM.Figure 6
Trend of appropriate normalization factors over the number of iterations.By using the set of normalization factors derived from this simulation, we can obtain good decoding performance by changing the normalization factor for each iteration. However, for the sakeof computational efficiency, we need to derive a single normalization factor for all iterations. When theα(l) obtained from early iterations is used as a single normalization factor, the error free SNR is high because it does not properly approximate BPA as iteration proceeds. On the other hand, if the α(l) obtained from the end of iterations is selected as a single factor, the message is exaggerated at the beginning of decoding, and as a result the error free SNR is high. Therefore, it is appropriate to use an intermediate normalization factor. So, we derived the best normalization factor for the entire iteration through simulation. The simulation result is shown in Figure 7. In the case of code rate 2/15, Figure 7(a), the normalization factor obtained from the eighth iteration α8≈0.5538 showed the lowest error free SNR. Likewise, in the case of code rate 3/15, Figure 7(b), the normalization factor obtained from the fourth iteration α4≈0.5576 showed the lowest error free SNR. As a result, we specify the normalization factor α8≈0.5538 as a single coefficient at code rate 2/15 and α4≈0.5576 as a single coefficient at code rate 3/15.Figure 7
Error freeEs/N0 whenα(l) used for decoding. (a) 2/15 and (b) 3/15.
(a) (b)The proposed method can efficiently obtain normalization factor for each iteration by using CMD chart and LSM. This method is much easier to implement than DE method since it does not require infinitely repeated pdf calculation to get a single normalization factor [10, 11]. Also, the proposed method needs fixed number (i.e., the maximum iteration number) of α verifications to derive a single alpha for the entire iteration, whereas the DE method needs full search of alpha in range from 0 to 1 [11].


## 2.2.1. Check Node Message Distribution Chart

The CMD chart shows the magnitudes of check node messages of a specific decoding algorithm against the minimum value ofLn′m. In this chapter, we introduce more examples of CMD chart and explain the characteristics of check node output messages of BPA decoder using the chart. We first show how the distribution of the data points in CMD charts changes in a different SNR. Then, we show how the distribution changes when the number of variable nodes connected to one check node (dc) changes. The distribution also changes as the iteration proceeds. However, since the processing of iteration can be considered as an increase in SNR, we skip the subject and cover it in detail in Section 2.2.2. These examples will help us to get a sense of, which values of normalization factor will improve the decoding performance. Figure 2 shows CMD chart for different SNR (Es/N0). The check node messages are obtained through the Monte Carlo simulation. We first generated the random bits and modulated using QPSK. We then calculated the check node messages, assuming that one check node is connected to three variable nodes (dc=3). In Figure 2(a), the simulation shows that values of check node output messages of two algorithms are very similar in a high SNR. In the lowest SNR, as shown in Figure 2(c), the differences are relatively large. This change of distribution in the different SNRs is caused by the characteristics of error between BPA and MSA. The check node update function of the BPA can be divided into two terms, which are sign computing and minimum value selecting term, and error term as in Eq. (5) [8]. Since the sign computing and the minimum value selecting term is equal to the check node update function of the MSA, the error between the check node output messages of the BPA and MSA can be calculated using the error term. This error can have values between ln⁡1+e-|∞|/1+e-|0|≈-ln⁡(2) and ln⁡1+e-|0|/1+e-|∞|≈ln⁡(2). In other words, regardless of the values of variable node messages, the error is bound to give a value between -ln⁡(2) and ln⁡(2). In conclusion, the initial variable node messages have large values in a high SNR environment, so min⁡Ln′m is also high, resulting in the bounded error showing a relatively small value compared to min⁡Ln′m. Therefore, the data points of BPA are distributed closely to that of MSA in a high SNR. Using this information, we can understand that relatively small normalization factor will improve decoding performance in low SNR, and MSA shows great performance in high SNR.(5)Lmn3BPA=signLn1msignLn2mmin⁡Ln1m,Ln2m+ln⁡1+e-Ln1m+Ln2m1+e-Ln1m-Ln2mFigure 2
CMD charts according toEs/N0. (a) Es/N0=5 [dB]. (b) Es/N0=0 [dB]. (c) Es/N0=-5 [dB].
(a) (b) (c)Figure3 shows the CMD chart according to dc. As shown in the figure, when dc becomes larger, the output value of the check node becomes smaller. This can be explained by the characteristics of Φ(x) function of (2) which is used to update the check node with BPA. The function Φx has characteristics, which is that input and output of the function are defined only for positive real values and that they are inversely proportional. Since ΦLn′m from (1) is always positive, when they are summed, the large dc yields a small output of the check node. Therefore, for the NMSA to approximate the BPA well, in lower SNR or larger dc conditions, the normalization factor should have a small value.Figure 3
CMD charts according todc. (a) dc=3, (b) dc=6, and (c) dc=9.
(a) (b) (c)


## 2.2.2. Obtaining Normalization Factors Using the Least Square Method

The LSM is used to derive the parameters of the curve, which minimizes the square sum (L2 norm) of the shortest distance between the curve and the given data points. It is used to remove noise from data points or to characterize the data set. We use this method to obtain a normalization factor that minimizes the error between the check node messages of BPA and NMSA. We use data pointsmin⁡(|Ln′m|),|LmnBPA| for n′∈Cm∖n, and m∈1,M where M is the number of the check node. If we define a set of min⁡(|Ln′m|) as the column vector X and a column vector LmnBPA as the vector Y, the normalization factor can be obtained from equation (6) as follows.(6)α=XTX-1XTYFigure4 is a graph showing the bit error rate of four different decoding algorithms when the maximum number of iterations is set to 1. The simulation is conducted on the ATSC 3.0 LDPC code rate of 2/15 and the frame size of 64800 while using QPSK mapping. An average value for the normalization factor is derived through repetitive simulation and used for decoding in each SNR. As shown in Figure 4, the decoding performance of the proposed method is close to that of BPA than the DE method [9], especially in low SNR.Figure 4
Bit error rate when the number of maximum iterations is set as 1.When the number of iterations is higher than one, we need to obtain an appropriateα for each iteration. So we rewrite (6) to (7) where α(l) denotes a normalization factor for lth iteration and X(l) and Y(l) denote vectors for data points min⁡(|Ln′m|),|LmnBPA| at lth iteration.(7)αl=XlTXl-1XlTYlFigure5 shows a computer simulation block diagram for obtaining a set of normalization factors α(l). In the simulation, we get vectors X(l) and Y(l) assuming that the (l-1)th iteration is correctly decoded using BPA and find α(l) that has the least square sum with the given data points. Since the decoding tends to proceed well, irrespective of the decoding algorithm in high SNR, the SNR to get α(l) is set to a minimum error free SNR for the BPA algorithm so that the check node messages can be well approximated in a low SNR. The simulation result of obtaining the set of α(l) for each iteration is shown in Figure 6. The maximum iteration number is set as 40 in the simulation. In early iterations, the magnitudes of LLR values of the variable node messages have small values, which means that the messages have high a bit error probability. So, the CMD chart shows similar distribution as Figure 2(c), and the appropriate normalization factor is comparatively small. As the iteration progresses, the magnitudes of LLR values of the variable node messages get larger and their distribution becomes closer to the CMD chart of Figure 2(a). At the completion of iterative decoding, the normalization factor converges to 1 and the NMSA becomes equal to the MSA.Figure 5
Block diagram of a procedure obtainingα with LSM.Figure 6
Trend of appropriate normalization factors over the number of iterations.By using the set of normalization factors derived from this simulation, we can obtain good decoding performance by changing the normalization factor for each iteration. However, for the sakeof computational efficiency, we need to derive a single normalization factor for all iterations. When theα(l) obtained from early iterations is used as a single normalization factor, the error free SNR is high because it does not properly approximate BPA as iteration proceeds. On the other hand, if the α(l) obtained from the end of iterations is selected as a single factor, the message is exaggerated at the beginning of decoding, and as a result the error free SNR is high. Therefore, it is appropriate to use an intermediate normalization factor. So, we derived the best normalization factor for the entire iteration through simulation. The simulation result is shown in Figure 7. In the case of code rate 2/15, Figure 7(a), the normalization factor obtained from the eighth iteration α8≈0.5538 showed the lowest error free SNR. Likewise, in the case of code rate 3/15, Figure 7(b), the normalization factor obtained from the fourth iteration α4≈0.5576 showed the lowest error free SNR. As a result, we specify the normalization factor α8≈0.5538 as a single coefficient at code rate 2/15 and α4≈0.5576 as a single coefficient at code rate 3/15.Figure 7
Error freeEs/N0 whenα(l) used for decoding. (a) 2/15 and (b) 3/15.
(a) (b)The proposed method can efficiently obtain normalization factor for each iteration by using CMD chart and LSM. This method is much easier to implement than DE method since it does not require infinitely repeated pdf calculation to get a single normalization factor [10, 11]. Also, the proposed method needs fixed number (i.e., the maximum iteration number) of α verifications to derive a single alpha for the entire iteration, whereas the DE method needs full search of alpha in range from 0 to 1 [11].


## 3. Results and Discussion

In this section, we show computer simulation results on ATSC 3.0 LDPC codes that compare the BPA, NMSA with the normalization factor proposed in [9] ([9]-α NMSA), and NMSA with the single normalization factor proposed in this paper.Figure8 shows the simulation result, when the maximum iteration is set as 40 on both ATSC 3.0 LDPC 2/15 and 3/15 codes for a code length of 64800, when layered decoding and QPSK mapping are used. As shown in Figure 8(a), the BPA showed the best performance that -6.35 [dB] of Es/N0 is required to have BER under 10-6. The NMSA which uses the normalization factor derived in [9] (α=0.63) (□) has a performance gap of 0.75 [dB] compared to BPA. Whereas the NMSA, using the proposed α≈0.5538, showed a performance gap of 0.50 [dB] (◇). The simulation on code rate 3/15 also showed that the NMSA using the proposed α≈0.5576showed better performance by 0.15 [dB] compared to the NMSA that uses the normalization factor derived in [9] α≈0.63 (□) as shown in Figure 8(b).Figure 8
Bit error rate of code rate (a) 2/15 and (b) 3/15.
(a) (b)


## 4. Conclusions

In this paper, we introduced the CMD chart and proposed a new method to obtain a single normalization factor using the chart and LSM. In addition, we showed that the NMSA using the normalization factor derived from the proposed method showed far superior decoding performance than the NMSA employing the normalization factor of the conventional scheme [9]. Furthermore, the proposed method can be used to obtain the correction coefficients of other decoding algorithms that approximate the BPA algorithm.



---

*Source: 1398191-2018-10-17.xml*