Professional Documents
Culture Documents
Efficient Early Termination Strategy For LDPC Codes in GPS Systems PDF
Efficient Early Termination Strategy For LDPC Codes in GPS Systems PDF
Abstract: By exploiting the structural features of L1C messages, a novel Early Termination ( ET) strategy is
proposed to speed up the decoding of low⁃density parity⁃check ( LDPC) codes in the GPS system. The proposed
strategy is based on the cyclic redundancy check ( CRC) of the messages in the subframes 2 and 3. The
simulation results show that average number of iterations of the proposed strategy is less than that of the standard
ET strategy, with nearly no degradation in decoding performance. Besides, the proposed ET strategy can be
efficiently implemented in a sequential or parallel manner. Thus, the proposed ET strategy is attractive for
practical purposes.
Keywords: GPS system, low⁃density parity⁃check ( LDPC) codes, early termination ( ET) strategy, cyclic
redundancy check ( CRC)
CLC number: TN911 22 Document code: A Article ID: 1005⁃9113(2013)06⁃0118⁃05
Received 2013-05-08.
Sponsored by the National Natural Science Foundation of China ( Grant No. 61271423) .
Corresponding author: Feng Wang. E⁃mail: wangfeng@ ime.ac.cn.
· 118·
Journal of Harbin Institute of Technology ( New Series) , Vol.20, No.6, 2013
by
1, γ^ (i k) > 0
mc
(
ol
umns
600/
274)
A B T 599/
273 x (i k) = { 0, other
(5)
Step 4 Set k = k + 1, go to Step 1.
C D E 1
The above iterative process continues until k =
600/
274 1 599/
273
K max , where K max is a preset maximum iterative number.
( b) Structure of parity⁃check matrix of GPS LDPC codes
In practice, the decoding process usually converges
Fig.1 Structure of subframes 2 and 3 and the structure of before K max is reached. In order to avoid unnecessary
parity⁃check matrix iterations and speedup the decoding, an early
· 119·
Journal of Harbin Institute of Technology ( New Series) , Vol.20, No.6, 2013
termination ( ET ) strategy is necessary. In the next [9] , one can find the following interesting property:
subsection, a brief review on ET strategies is the average degree of the information bit nodes is much
presented. larger than that of the redundant bit nodes, as shown in
2 4 Review on ET Strategies Table 1. ( Note that the degree of a bit node in G H is
The most standard ET strategy is that all check equal to the weight of the corresponding column in H.)
equations defined by the rows of H are satisfied [6] , Hence, the information bits are expected to converge
i.e., the equation more quickly on the average than the redundant bits,
x^ ( k) ·H = 0 (6) which can be verified by the following observations.
holds. In this case, x^ ( k) is output as the decoding
result. Since Eq.(6) holds if and only if x^ ( k) is a valid Table 1 Average degree of the information and redundant
codeword, the strategy does not introduce any decoding bit nodes of GPS LDPC codes
performance loss. However, this strategy may take Average degree number
Length
much hardware cost for the check equations in Information bit nodes Redundant bit nodes
practice [12] . 1200 5 96 2 07
In addition to this standard strategy, there are 548 5 43 2 13
some typical works on this topic [10-12] . In Ref. [ 10] ,
the decoding blocks are divided into decodable and 3 1 Convergence Behavior Observations
undecodable blocks, and an ET strategy is designed for In order to analyze the convergence behavior of
these two kinds of blocks, respectively. In Ref. [11] , LDPC decoding, the average magnitudes of APP
the ET strategy is presented based on the convergence messages in the iterative process are calculated for the
of the mean magnitude. Although these ET strategies information and redundant bit nodes, respectively, as
have little performance degradation, they require shown in Fig. 2. The test code is of length 1200 and
massive mathematical operations and statistical the signal⁃to⁃noise ratio ( SNR) is set as 2 0 dB. The
properties of the decoded messages. Hence, they are values are obtained over 1000 realizations.
not suitable for practical purposes. Recently, a strategy
suitable for practical implementation has been proposed
ges
I
nformat
ionbi
ts
fAPPme
6
terminated. This strategy is chosen for comparison in
t
ni
the simulations. 4
g
ema
2
g
0 5 10 15
decoding of GPS LDPC codes is analyzed. Based on the Fig.2 Average magnitudes of APP messages in the iterative
analysis, a novel ET strategy is proposed and its process
complexity is compared with Eq.(6) .
As discussed previously, the decoding of an From Fig. 2, it is known that the average
LDPC code is an iterative message passing process. magnitude of APP messages of information bits
With the messages being passed and updated between increases faster and become more reliable than that of
check and bit nodes, the unreliable a prior messages is the redundant bits as the iteration number increases.
corrected and the reliable a posterior probabilities For example, the average magnitude of APP messages
( APP) messages is obtained. It is well known that the of information bits is about twice that of redundant bits
decoding process of an irregular LDPC code has wave after 15 iterations. As a consequence, the information
effect [5] : bit nodes with higher degree tend to correct bits tend to be corrected more quickly on the average
their value firstly and then provide good information to than the redundant bits. In other words, if all check
the check nodes, which subsequently provide better equations are satisfied, some decoding iterations are
information to lower degree bit nodes. As a result, bit used to correct the errors in the redundant bits, which
nodes with high degree tend to get corrected more is meaningless in practice. Consequently, if some
quickly than those with low degree. detect mechanism can be developed, the unnecessary
The two LDPC codes in GPS system are both iterations can be avoided to some extent.
irregular. By careful observation on the positions of 3 2 Proposed ET Strategy
entries 1 s of two parity⁃check matrices given in Ref. By exploiting the special structures of subframes 2
· 120·
Journal of Harbin Institute of Technology ( New Series) , Vol.20, No.6, 2013
and 3, an efficient ET strategy for GPS LDPC codes is used in the simulation is the Normalized MSA. The
developed in this subsection. modification factor is α = 0 75, and the maximum
As shown in Fig. 2, the LDPC encoding is iterative number K max is set as 15.
performed after the CRC for subframes 2 and 3. For Fig. 3 illustrates the bit error rate ( BER )
both subframes, the last 24 bits are the CRC word of performances of two LDPC codes on the AWGN
the previous message bits. The CRC word can detect channel. The performance of SPA is included for
the errors in the message bits. Conversely, if a comparison. Besides, the HDA ET strategy given in
temporary hard decision in the iterative process is subsection 2 4 is also evaluated. The BER of each
obtained, we can check CRC for the information bits. algorithm is calculated by
If CRC is satisfied, the message can be accepted as a NE
valid one and LDPC decoding can be stopped. BER = (7)
N
Therefore, the following ET strategy for decoding GPS where N E and N stand for the total number of error and
LDPC codes can be developed to replace the strategy simulated message bits, respectively.
given by Eq.(6) .
ET strategy: For the k⁃th iteration of LDPC 10-1
decoding, check CRC for the information bits. If CRC is
satisfied, stop decoding and output the hard decision x^ (k) . 10-2
BER
the decoded and the transmitted information bits are the
same if the CRC is satisfied. However, the effectiveness
10-4 NMSA,
st
anda
rdET
NMSA,
pro
pos
edET
of the strategy can be shown by the simulation test in 10-5 NMS
SP
A
A,
HDAET
which a total of 106 decoding realizations that CRC is 10-6
satisfied are collected. Among these 106 realizations, no 1.
4 1.
6 1.8 2.0 2.
2 2.
4 2.
6
decoding error is found. Moreover, the effectiveness of
SNR(dB)
the strategy can also be demonstrated by the decoding ( a) Code length of 1200
o
the high SNR situations. Moreover, the proposed ET
i
t
St
anda
rdET
ra Pr
opos
edET
strategy can be flexibly implemented in a sequential or
t
fie 13 HDAET
ro
11
In conclusion, the proposed ET strategy is a good
9 choice for practical purposes.
rg
a
References
e
Av
1.
4 1.
6 1.8 2.0 2.
2 2.
4 2.
6
SNR(dB)
[1] Gallager R G. Low⁃density parity⁃check codes. IRE Trans⁃
( a) Code Length of 1200 actions on Information Theory, 1962, 8(1) : 21-28.
[2] Gallager R G. Low⁃Density Parity⁃Check codes. Cambridge,
MA: MIT Press, 1963.
ns
15
io
St
anda
rdET
ra
13 Pr
opos
edET
of low density parity check codes. Electronics Letters,
t
fie
HDAET
1996, 32(18) : 1645-1646.
ro
11
enumbe
618.
e
5
Av
1.0 1.
5 2.
0 2.
5 3.
0 [5] Luby M G, Mitzenmacher M, Shkrollahi M A, et al.
SNR(
dB) Improved low⁃density parity⁃check codes using irregular
graphs. IEEE Transactions on Information Theory,2001, 47
( b) Code Length of 548
(2) : 585-598.
Fig.4 The average number of iterations for LDPC codes in [6] Blanksby A, Howland C. A 690⁃mW 1⁃Gb / s, rate⁃1 / 2 low⁃
the GPS system density parity⁃check code decoder. IEEE Journal of Solid⁃
State Circuits, 2002, 37(3) : 404-412.
Table 2 Iteration number reduction of the proposed ET [7] Mansour M, Shanbhag N. High⁃throughput LDPC decoders.
strategy compared with the standard ET strategy IEEE Transactions on Very Large Scale Integration
Code length Systems, 2003, 11(6) : 976-996.
[8] Wang Z F, Cui Z Q. A memory efficient partially parallel
1200 548 decoder architecture for quasi⁃cyclic LDPC codes. IEEE
SNR( dB) Reduction( %) SNR( dB) Reduction( %) Transactions on VLSI Systems, 2007, 15(4) : 483-488.
[9 ] GPS Navstar Joint Program Office. Global Positioning
1.3 2.60 1.0 1.79
System Wing( GPSW) Systems Engineering & Integration:
1.5 4.75 1.4 5.97 Navstar GPS Space Segment / User Segment L1C Interfaces.
2008-10-04.
1.7 8.64 1.8 9.75
[10] Kienle F, Wehn N. Low Complexity Stopping Criterion for
1.9 11.11 2.2 12.91 LDPC Code Decoders. Proceeding of IEEE VTC 2005⁃
2.1 12.81 2.6 14.16 Spring. Stockholm: IEEE Press, 2005 606-609.
[11] Li J, You X H, Li J. Early stopping for LDPC decoding:
2.3 13.79 3.0 14.68 Convergence of Mean Magnitude ( CMM ) . IEEE
Communications Letters, 2006, 10(9) : 667-669.
From these results, it is shown that the average [12] Shih X Y, Zhan C Z, Lin C H, et al. An 8 29 mm2
number of iterations of the proposed strategy is reduced 52 mW multi⁃mode LDPC decoder design WiMAX system
compared with the standard ET strategy. Besides, as in 0 13 μm CMOS process. IEEE Journal of Solid⁃State
Circuits, 2008, 43(3) : 672-683.
the SNR increases, the reduction becomes obvious. All
[ 13 ] Fossorier M P C, Mihaljevic M, Imai H. Reduced
these demonstrate the effectiveness of the proposed ET complexity iterative decoding of low⁃density parity check
strategy. codes based on belief propagation. IEEE Transcations on
Communications,1999, 47(5) : 673-679.
5 Conclusions [14] Chen J, Fossorier M P C. Near optimum universal belief
propagation based decoding of low⁃density parity check
In this paper, the decoding of LDPC codes in the codes. IEEE Transcations on Communications, 2002, 50
next generation GPS system is studied. By exploiting (3) : 406-414.
[15] Pei T⁃B, Zukowski C. High⁃speed parallel CRC circuits in
the structural features of L1C messages, an efficient ET
VLSI. IEEE Transcations on Communications, 1992, 40
strategy based on CRC is proposed to avoid (4) : 653-657.
unnecessary iterations in decoding GPS LDPC codes. [ 16 ] Henriksson T, Liu D. Implementation of Fast CRC
The simulation results show that the proposed ET Calculation. Proceeding of the ASP—DAC. Kitakyushu:
strategy introduces nearly no performance losses. The ASP—DAC Press, 2003. 563-564.
average number of iterations of the proposed strategy is
· 122·