Chinese Journal of Electronics Vol.18, No.1, Jan.

2009

Construction of Low-Density Parity-Check Codes Based on Frequency-Hopping Sequences

ZHANG Guohua and WANG Xinmei
(State Key Laboratory of ISN, Xidian University, Xian 710071, China)
Abstract Three classes of structured regular Lowdensity parity-check (LDPC) codes with girth at least 6 are constructed from frequency-hopping sequences. The parity-check matrices of these codes have uniform row and column weights, simple and explicit structure, as well as a large variety of candidate parameters. Simulation results show that the new codes perform very similar to the randomly constructed LDPC codes over Additive white Gaussian noise (AWGN) channels. Key words Low-density parity-check (LDPC) codes, Girth, Iterative decoding, Frequency-hopping sequences.

munication systems, a set of FH sequences having good Hamming correlation properties is required. The Hamming correlation[10] H XY ( ) between two sequences X = (X0 , X1 , , XP 1 ) and Y = (Y0 , Y1 , , YP 1 ) of length P , over a given alphabet A of size Q, is dened by H XY ( ) =
P 1 j =0

h[Xj , Yj + ],

0 <P

I. Introduction
A binary regular Low-density parity-check (LDPC) code is dened as the null space of a sparse parity-check matrix H over GF(2) that has the following structural properties: (1) every row has weight ; (2) every column has weight ; and (3) two rows (or two columns) have at most one 1-component in common. Such a matrix is said to be (, )-regular and the corresponding code is called a (, )-regular LDPC code. Property (3) of H ensures that the minimum distance of the code is at least +1, and that the corresponding Tanner graph has girth at least six[1,2] . Compared with randomly generated codes, structured LDPC codes usually have the advantage of less encoding or storage complexity. Many construction schemes for structured LDPC codes are based on complicated combinatorics such as nite geometries[1] and Balanced incomplete block design (BIBD)[2,3] . Other methods for LDPC codes construction, such as Mutually orthogonal squares (MOLS)[3] , Kirkman triple systems (KTS)[4] , oval design[5] and unital design[6] are also devised based on combinatorics. Besides these complex constructions with intense mathematical avor, several common topics in communication domain, for example ReedSolomon codes and optical orthogonal codes, have lent themselves to the construction of LDPC codes[79] . In this paper we propose a novel construction procedure by Frequency-hopping (FH) sequences, one of the most familiar topics in spread spectrum communications. In Frequency hopping multiple access (FHMA) com Manuscript

where h[x, y ] equals 0 if x = y and otherwise 1. In asynchronous FHMA systems, there exist several FH sequence families satisfying (CA): for any sequence X within set S , H (X ) max, =0 {HXX ( )} = 0; and (CC): for any pair of distinct sequences X and Y , H (X , Y ) max {HXY ( )} = 1. By these families, a construction for LDPC codes follows immediately.

II. Construction Based on Asynchronous Hopping Sequences (AHSC)

Suppose that S is a family with N sequences of length P , over a given alphabet A of size Q, and that S satises CA and CC. Select (1 N ) distinct sequences X 1 , X 2 , , X from S , and then arrange them and their respective 1 ( P ) distinct cyclically-shifted versions T ij X k (1 j 1, 1 k ) into a P matrix H prep as follows X1 X2 X T i1 X 1 T i1 X 2 T i1 X i i2 2 T 2 X1 T X T i2 X H prep = . . . .. . . . . . . . T i 1 X 1 where
k k k T ij X k = (X k ij , , X P 1 , X 0 , X ij 1 )

T i 1 X 2

T i 1 X

and (i1 , i2 , , i 1 ) are 1 distinct integers selected from Z P \0 = {1, 2, , P 1}. Suppose that g () is a mapping from a P -tuple over A to a Q P matrix over GF(2) dened by g (X ) =g (X0 , X1 , XP 1 ) =[(g (X0 )), (g (X1 )), , (g (XP 1 ))]

Received Sept. 2006; Accepted July 2008. This work is supported by the National Natural Science Foundation of China (No.U0635003 and No.60572149).

142

Chinese Journal of Electronics

2009

where g () is a one-to-one correspondence from element over A to element over Z Q+1 \0, and (k) is dened as the k-th (1 k Q) column of a Q Q identity matrix. Then the target matrix H hop is obtained by g (X 1 ) g (X 2 ) g (X ) i1 1 i1 2 i1 g (T X ) g (T X ) g (T X ) i2 2 g (T i2 X 1 ) ( T X ) g (T i2 X ) g H hop = . . . .. . . . . . . . i 1 1 i 1 2 i 1 g (T X ) g (T X ) g (T X ) Constraints CA and CC ensure that any ordered pair in the same position of any two rows within H pre appears only once. By this fact and the denition of g , no two rows (or two columns) within H hop have more than one 1-component in common. Two classes of LDPC codes follow this general construction. 1. Construction AHSC-A Given any prime number p > 2, for every integer k k k k (1 k p 1), a sequence X k = (X0 , X1 , , Xp 1 ) of k length p can be constructed by Xi = (k i) mod p. Then all the sequences X k (1 k p 1) compose a Prime sequence family (PSF)[11,12] , which meets both CA and CC. The resultant LDPC code based on PSF is (, )-regular for any (1 p 1) and any (1 p). 2. Construction AHSC-B Given any nite eld GF (q ) (q , prime power), all elements can be denoted by GF (q ) = { , 0 , 1 , , q2 } where is a primitive element of GF (q ). For any element k k k k over GF (q ), a sequence X k = (X0 , X1 , , Xq 2 ) of length k i q 1 can be constructed by Xi = k + . All the sequences X k (1 k q ) compose a hopping sequences family, which satises CA and CC[12] . Direct application of AHSC (employing only a subset of the family) will result in a parity-check matrix with constant column weight but varying row weight ( {, 1}), due to the obvious fact that every sequence X k in the family excludes a unique element k of GF (q ). In this case, the parity-check matrix is irregular and its null space gives a near-regular LDPC codes. If is selected as q , the size of this family, a (, q 1)-regular LDPC code can be created for any q 1.

k, can be constructed by Xi = k + (i) , where (i) = i1 for 1 i q 1 and (0) = . Then all such pairs (k, ) lead to q (q 1) distinct sequences. Several properties follow immediately. Property (1): each element over GF (q ) occurs once within each sequence; Property (2): the number of elements in common between any two distinct sequences is at most one; Property (3): Given any four parameters , , k and k such that = and k = k , construct four sequences:

X (i) =k + (i), R(i) =k + (i),

Y (i) = k + (i) , T (i) = k + (i) .

If X is superposed on Y , and R superposed on T , then every ordered pair of elements appears at most once. Proof Propertyies 1 and 2 are obvious. Proof of property 3: any ordered pair (, ) appears at most once within the superposition of any two sequences due to property (1). Suppose that an ordered pair (, ) appears two times within the superposition of X and Y and the superposition of R and T , then X (i1 ) = R(i2 ) = and Y (i1 ) = T (i2 ) = , i.e. the two equations: k + (i1 ) = k + (i2 ) k + (i1 ) = k + (i2 ) (1) (2)

III. Construction Based on Synchronous Hopping Sequences (SHSC)

The above construction is based on FH sequences for asynchronous FH systems; there is another construction, which is based on FH sequences used in synchronous FH systems. 1. A family of synchronous hopping sequences Given any nite eld GF (q ) (q , prime power), all elements excluding zero can be denoted by GF (q ) = {0 , 1 , , q2 } where is a primitive element of GF (q ). For any element k over GF (q ) and over GF (q ), a sequence X k, of length q

hold for a pair of integers i1 , i2 (0 i1 , i2 q 1). Solving these simultaneous equations, the relation (i1 ) = (i2 ) follows and hence k + (i1 ) = k + (i1 ) , which is impossible for k = k . Q.E.D Property 1 and property 2 make this FH sequences family desirable in synchronous FH systems. Employing this family, a construction for LDPC codes is available with the aid of property 3. 2. Construction SHSC Let S be the family dened above. For any number (1 q ) and (1 q 1), select distinct elements k1 , k2 , , k from GF (q ) and distinct elements 1 , 2 , , from GF (q ). Construct sequences by k, Xi = k + (i) , and then arrange them to form matrix H prep as follows. k1 ,1 X X k2 ,1 X k ,1 X k1 ,2 X k2 ,2 X k ,2 k , 1 3 X k2 ,3 X k ,3 H prep = X . . . .. . . . . . . . X k1 , X k2 , X k , The procedure to obtain the target matrix H hop from H prep is just the same as in asynchronous case and hence omitted here. Property 3 ensures that H hop is free of 4-cycles; property 1 ensures that H hop is with row weight , and by the construction H hop is with column weight . The codes based on SHSC are (, )-regular for any (1 q ) and any (1 q 1). Although this construction has almost the same parameters as those in Ref.[7], the former has several advantages. The SHSC is simple and explicit, without any pretreatment (partitioning RS codes into cosets, for instance) before construction. It is straightforward

Construction of Low-Density Parity-Check Codes Based on Frequency-Hopping Sequences to construct new parity-check matrix from the old by appending or deleting FH sequences column-wise (or row-wise) to updated parameter (or , respectively), as with the MOLS and KTS cases[3,4] .

143

IV. Examples and Simulations

Example of AHSC-A: Given p = 53, PSF includes 52 FH sequences. Let g (x) = x + 1. Then the 53 frequency slots (0, 1, 52) are mapped into (1, 2, 53). Choose = 3, = 52 and (i1 , i2 ) = (1, 2). The resultant AHSC-A-LDPC code is a (3, 52)-regular (2756, 2599) code with rate 0.943. Example of AHSC-B: Given GF (25 ), this family includes 32 FH sequences. Set = 15 and (i1 , i2 , , i 1 ) = (1, 2, , 14). Using the 32 FH sequences, we obtain a (15, 31)-regular (992, 771) AHSC-B-LDPC code with rate 0.777. Example of SHSC: Given GF (26 ), this family includes 6 6 2 (2 1) synchronous FH sequences. Choose = 32, = 6, k1 = , ki = i2 (2 i ) and i = i1 (1 i ). The resultant SHSC-LDPC code is a (6, 32)-regular (2048, 1723) code with rate 0.841.

iterations 100, and BPSK modulation assumed over AWGN channel. We see in Fig.1 that AHSC-A code performs equally well compared with its equivalent code, and AHSC-B code outperforms MacKay code below a BER of 1 105 , and in Fig.2 that SHSC code outperforms its counterpart in high SNR region.

V. Conclusion
Based on FH sequences that are needed in FHMA communication systems, we presented three families of structured binary LDPC codes. The proposed method can generate lowdensity parity-check matrices with constant column and row weight, simple and explicit structure, girth at least six, as well as exible code parameters. Experimental results show that the proposed codes can achieve identical or comparable performance compared with randomly generated codes over AWGN channels. Quasi-cyclic LDPC codes are a special class of LDPC codes whose encoding can be eciently implemented by shift-register circuits; the codes presented in this paper and several other existing families of codes such as those in Ref.[7], however, do not share the quasi-cyclic property. The further work is to develop ecient encoders for these novel codes. References
[1] Y. Kou, S. Lin, M.P.C. Fossorier, Low-density parity-check codes based on nite geometries: a rediscovery and new results, IEEE Trans. Inform. Theory, Vol.47, No.7, pp.2711 2736, 2001. [2] B. Ammar, B. Honary, Y. Kou, J. Xu, S. Lin, Construction of low-density parity-check codes based on balanced incomplete block designs, IEEE Trans. Inform. Theory, Vol.50, No.6, pp.12571268, 2004. [3] B. Vasic, O. Milenkovic, Combinatorial constructions of lowdensity parity-check codes for iterative decoding, IEEE Trans. Inform. Theory, Vol.50, No.6, pp.11561176, 2004. [4] S.R. Weller, S.J. Jonson, Construction of low-density paritycheck codes from Kirkman triple systems, Proceedings of IEEE Globecom Conference, San Antonio, TX., USA, pp.970974, 2001. [5] S.R. Weller, S.J. Jonson, Regular low-density parity-check codes from oval designs, Euro. Trans. Telecomms, Vol.14, No.5, pp.399409, 2003. [6] S.J. Jonson, S.R. Weller, High-rate LDPC codes from unital designs, IEEE Globecom 2003, San Francisco, CA, pp.2036 2040, 2003. [7] I. Djurdjevic, J. Xu, K. Abdel-Ghaar, S. Lin, A class of lowdensity parity-check codes constructed based on Reed-Solomon codes with two information symbols, IEEE Commun. Lett., Vol.7, No.7, pp.317319, 2003. [8] L. Chen, Construction of structured low-density parity-check codes: combinatorial and algebraic approaches, Ph.D. Dissertation, University of California, Davis, USA, 2005. [9] H. Wen, F. Hu, J. Li, F. Jin, A new family of irregular LDPC codes, IEEE 6th CAS Symp. on Emerging Technologies: Mobile and Wireless Comm., Shanghai, China, pp.285288, 2004. [10] A. Lempel, H. Greenberger, Families of sequence with optimal Hamming correlation properties, IEEE Trans. Inform. Theory, Vol.20, No.1, pp.9094, 1974. [11] A.A. Shaar, P.A. Davies, Prime sequences: quasi-optimal sequence for OR channel code division multiplexing, Electron. Lett., Vol.19, No.21, pp.888889, 1983.

Fig. 1. Error performance of the (2756,2599) AHSCA-based (3,52)-regular LDPC code and (992,771) AHSCBbased (15,31)-regular LDPC code

Fig. 2. Error performance of the (2048,1723) SHSC-based (6,32)-regular LDPC code

Shown in Figs.12 is the performance of these example codes and their counterparts randomly generated (construction 1A of Ref.[13] with column weight 3) with identical code length and rate. BP algorithm[13] is employed with maximal

144

Chinese Journal of Electronics

2009

[12] A.A. Shaar, P.A. Davies, A survey of one-coincidence sequences for frequency-hopped spread-spectrum systems, IEE Proceedings, Vol.131, Pt.F, No.7, pp.719723, 1984. [13] D.J.C. MacKay, R.M. Neal, Near Shannon limit performance of low density parity check codes, Electron. Lett., Vol.33, No.6, pp.457458, 1997. ZHANG Guohua was born in Linfen, Shanxi Province, China in Sept. 1977. He received the B.S. degree in electronics and information system from Shandong University in 1999, and the M.S. degree in communication and information system from China Academy of Space Technology (CAST, Xian) in 2002. He is currently working toward the Ph.D. degree at Xidian University. His current research interests include error-control coding techniques and their application to digital communications. (E-mail: zgh@cast504.com).

WANG Xinmei was born in Zhejiang Province, China in Nov. 1937. He is currently a professor and Ph.D. supervisor of Xidian University. His research interests include channel coding, cryptogram and telecommunication network security. He is one of the pioneer researchers in errorcorrection coding in China. He has published seven books and over 100 papers. One of his books, Error-Correction Coding has been awarded as one of the best university textbooks in China. He has served as Visiting/Adjunct/Guest Professors in various universities, including the National University of Singapore, City University of Hong Kong, Hunan University and National Defense University of Science and Technology etc. He has received numerous awards from various governments and academic institutions. He is a Fellow of CIC and CIE.