A Novel Orthogonal Minimum Cross-correlation Spreading Code in CDMA System

Monisankha Pal
Department of Electronics and Telecommunication Engineering, Jadavpur University, Kolkata, India. monisankha.pal@gmail.com
Abstract - Code Division Multiple Access (CDMA) had been used as an emergent technology in present generation Wireless Communication System. In CDMA system, a large number of users could be served over the same bandwidth by assigning a unique code to each of the users. In order to support large number of users in CDMA system, one of the primary objectives of the mobile system designers had been to create a large number of spreading codes by maintaining low Cross-correlation values between them to mitigate the effect of Multiple Access Interference (MAI). In this paper, we have proposed an algorithm to generate an Orthogonal Minimum Cross-correlation Spreading Code (OMCCSC), which can provide a large number of distinct spreading codes as compared to the existing orthogonal and near orthogonal spreading codes, namely Walsh code, Orthogonal Gold code and Orthogonal Kasami code. The study of cross-correlation property of the proposed code proves its superiority over other existing codes. The proposed code has been used as a spreading code in synchronous CDMA system and its Bit Error Rate (BER) performance has been compared with other existing spreading codes, in multi-user scenario. Keywords BER; CDMA; MAI; Orthogonal Gold Code; Orthogonal Kasami Code; Walsh code.

Sudipta Chattopadhyay
Department of Electronics and Telecommunication Engineering, Jadavpur University, Kolkata, India. sudiptachat@yahoo.com A new, mathematical way of generating orthogonal sets of spreading sequences with minimum magnitude of crosscorrelation has been described in [1]. For codes of length N, N-1 orthogonal codes with minimum cross-correlation property has been found and each code has been used by a CDMA user. To generate this code, eigenvectors of minimum Eigen-values of a special NN matrix has been found out. The numerical results show that the average magnitude of crosscorrelation value between any pair of codes for a particular length is better than Walsh and Gold codes. A new, sets of spreading codes with minimum correlation property has been generated in [2]. In this paper, convex optimization technique has been used to make a tradeoff between auto and cross correlation properties. The Bit Error Rate (BER) and average magnitude of auto and cross correlation has been studied and also compared with that of Walsh code. In this paper, we have proposed a novel algorithm to generate a new set of minimum cross-correlation spreading codes. The performance of the proposed code has been studied and compared to other existing codes in terms of various attribute, like number of generated codes and cross-correlation value. The performance of the proposed code in synchronous CDMA system has also been analyzed by measuring its BER values, in multi-user scenario. A comparison of the BER performance of the proposed code with other existing codes has also been provided. II. WALSH AND MINIMUM CROSS-CORRELATION SPREADING CODE - MATHEMATICAL BACKGROUND A. Walsh code Walsh code provides useful code sets for CDMA wireless systems as all the codes of the sets are orthogonal to each other [3]. Walsh functions are generated by mapping codeword rows of special square matrix called Hadamard matrix. The length N of a Walsh code is of power 2, i.e. N=2n (n is any positive integer). The matrix contain one row of all zeros and the other rows each have equal number of ones and zeros. Walsh codes can be generated by following recursive procedure:

I. INTRODUCTION The Code Division Multiple Access (CDMA) technique has been widely accepted in present generation wireless systems. Spreading codes play an important role in CDMA system to spread the user signals and distinguish among different users. Among the different spreading codes, Walsh code has proved its existence as a popular orthogonal code, whereas, PseudoNoise (PN) sequence, Gold codes and Kasami codes have established themselves as popular non-orthogonal binary codes. Walsh code is used in synchronous downlink CDMA system. This code maintains orthogonality and thus produces low Multiple Access Interference (MAI) in a CDMA system. Walsh code set of length N can provide maximum N number of distinct orthogonal spreading codes. So, Walsh code may not be that effective to meet the increasing demand of users in CDMA system. Again, capacity of CDMA system is limited by MAI, where MAI is a function of the cross-correlation value between different spreading-codes. Hence generation of a large number of spreading codes with a minimum crosscorrelation value can be treated as one of the challenging areas in CDMA system.

978-1-4244-9005-9/10/$26.00 2010 IEEE

80

0 0 0 0 W1=[0], W2 = , W4 = 0 0 1 0
And W2 N

0 1 0 1

0 0 1 1

0 1 1 0

Take 2nd row of any Walsh matrix WN as a spreading code of length N

W N WN = W N WN

Construct matrix X of size (NN), whose first column is the input N length spreading sequence, all the other columns of the matrix are obtained by rotating the previous column by 1 bit position. Construct the matrix E of size (NN) by taking all the elements except diagonal is 1, diagonal elements are 0. a) Take E and multiply with each column vector of X and obtain a column vector of (N1). We can get N, (N1) column vectors. Thus we get a matrix A (NN). b) Transpose this each column vector of A and we can get N, (1N) row vector. This can be represented as a matrix B of size (NN). Multiply each column vector of A with the corresponding row vector of B. In this way we can get N, (NN) matrix. These matrices are symmetric and rank 1 matrix.

Where, N is a power of 2 and over-score implies the binary complement of corresponding bits in the matrix. Each row of the matrix represents a Walsh code by mapping 0 to 1 and 1 to 1. So, N length Walsh code can provide N number of codes which can serve maximum N number of CDMA users. These codes are orthogonal to each other and thus have zero crosscorrelation between any pair. B. Minimum Cross-correlation Spreading Code A minimum cross-correlation spreading code is a code that minimizes cross-correlation values with a known spreading code and all its shifts [1]. If the unknown code y is [Y1 Y2 .YN]T and the known code x is [X1 X2 .XN]T, then to minimize cross-correlation between these two codes, it is required to obtain the following result: X1 X2. XN 0 X1. XN-1 . . . . . . . . . . . . 0 0 X1 Y1 min1 Y2 min2 . . . = . . . . . YN min N

(1)

Take each matrix and obtain the eigenvalues and their corresponding eigenvectors by using iterative methods or by using MATLAB.

To obtain the desired code which covers all these conditions, a solution has considered for each condition separately, and then bound them into a single solution by boundary relation. The restriction on the desired code y is that it will be an orthogonal code set following the condition: yT. y = 1. The eigenvector of a symmetric rank one matrix R provides the minimum cross-correlation spreading sequence following T T the relation R=E.x.x .E . Where, x is a spreading code of length N and E is a square matrix of dimension NN with all diagonal elements zeros and all the other elements ones. Any N length spreading code can provide N-1 number of minimum cross-correlation spreading codes. Here, the generated N-1 codes which are eigenvectors of zero Eigen-value of the matrix R are orthogonal to each other. III. FLOW CHART REPRESENTATION OF THE PROPOSED CODE GENERATION ALGORITHM

For each (NN) matrix, there are N-1 eigenvectors of zero eigenvalue. These eigenvectors are mutually orthogonal to each other. These N-1 eigenvectors of a (NN) matrix are orthogonal codes.

So, we can get N number of orthogonal code set of minimum cross-correlation by using same procedure. Each code set contains N-1 number of orthogonal spreading codes.

For N length code, total number of orthogonal codes generated are N(N-1).
Fig. 1. Flow-chart of proposed code generation algorithm

The proposed code generation algorithm has been described using flow-chart as presented in Fig. 1.

81

IV.

SIMULATION RESULTS AND ITS ANALYSIS

A. Performance based on number of codes Simulation of the proposed algorithm shows that it is capable to generate a large number of distinct codes, each of which can be used as a spreading code in CDMA system. In general, the proposed orthogonal code is capable to produce N (N-1) number of distinct codes, each of length N. A comparative study among the different orthogonal codes, in terms of the number of distinct spreading codes generated, has been illustrated in TABLE I.
TABLE I. NO OF CODE MEMBERS OF DIFFERENT ORTHOGONAL CODES Length of the Code 4 16 64 Number of distinct code members
Walsh Orthogonal Gold Orthogonal small set Kasami Proposed Orthogonal MCCSC

C. Performance based on BER value The performance of the proposed Orthogonal MCCSC code of length 16 has been studied in synchronous CDMA system under multi-user scenario by measuring its BER values. Fig. 3 to Fig. 5 describes the BER performances of the CDMA system using the proposed code under 8, 10 and 12 user scenario, considering AWGN channel. In these figures the

4 16 64

12 240 4032

6 60 504

12 240 4032

TABLE I depicts that the proposed code can generate a large number of codes as compared to Walsh and Orthogonal Small Set Kasami code and same number of codes as compared Orthogonal Gold code. B. Performance based on cross-correlation The study of cross-correlation properties of the proposed code along with other existing codes have been presented in Fig. 2 for code length of 16. From this figure, it is evident that for a fixed length, the average magnitude of crosscorrelation function between different code members of the proposed code is much lower than that of other existing codes.

Fig. 3. Comparison of BER performances for synchronous downlink communication under 8 user scenario in AWGN channel.

BER performances of the existing spreading codes have also been included for the purpose of comparison.

Fig. 2. Comparison based on average magnitude of cross-correlation

Fig. 4. Comparison of BER performances for synchronous downlink communication under 10 user scenario in AWGN channel.

82

10

Wa lsh Orthogonal Gold Orthogonal Kasami Proposed Orthogonal MCCSC

BER

10

-1

10

-2

8.5

9.5 10 10.5 Number of Use r

11

11.5

12

Fig. 5. Comparison of BER performances for synchronous downlink communication under 12 user scenario in AWGN h l

Fig. 7. Multi-user BER performance for synchronous downlink communication under AWGN channel at SNR=20dB

The critical analysis of BER curves shows that at a SNR level of 20 dB, the BER performance of the proposed code is almost similar to Walsh and Orthogonal Gold code under 8 users scenario. At the same level of SNR, the BER performance of the proposed code is comparable to Walsh code but much superior to Orthogonal Gold code, under 10 and 12 users scenario. In this respect, the Orthogonal Kasami code outperforms the others. It is also evident from the above figures that there is degradation in BER values with the increase in number of users. The reason behind this fact is that as the number of users is increased in a multiple access system, the probability of finding an erroneous bit out of total transmitted bits also gets enhanced due to increased interference among the different codes. In this regard our proposed code outperforms the other codes in the sense that it offers less amount of degradation in BER as compared to other codes. Fig. 6 and Fig. 7 elaborate the effect of number of users on the BER performance of synchronous CDMA system using the proposed and other codes for two different values of SNR of 12 dB and 20 dB respectively.
10
0

A close inspection of these curves reveals that at a SNR level of 12 dB, the BER performance of the proposed code almost remains constant with the number of users. This indicates that the performance of the proposed code does not degrade under multi-user scenario, which is a desirable property of the code. Whereas, keeping the SNR value at 20 dB, there is a slight degradation in BER performance of the proposed code when the number of users is increased beyond a specific value of 10. V. CONCLUSIONS Availability of more number of codes, minimum crosscorrelation value, maximum auto-correlation value at zero time shift and minimum Peak to Average Power Ratio (PAPR) are some of the important features to be possessed by a good spreading code in CDMA environment. In this paper, an attempt has been made to generate a novel orthogonal minimum cross-correlation CDMA spreading code. The algorithm described for this purpose is efficient enough to generate a large number of spreading codes as compared to Walsh and Orthogonal Kasami code. In this respect, the performance of the proposed code is similar to Orthogonal Gold code. Regarding cross-correlation value, the proposed code shows a significant improvement over all other existing codes. As far as BER performance of synchronous CDMA system is concerned, the proposed code either outperforms or behaves similarly except the Orthogonal Gold code, at a high value of SNR. REFERENCES
[1] A. K. Farraj and A. I Amayreh, Minimum Cross Correlation Spreading Codes, Wireless Personal Communications Journal, vol. 48, no. 3, pp. 385394, 2009. A. K. Farraj, Minimum Correlation Spreading Codes Design, Wireless Personal Communications Journal, August 2009. E. H. Dinan and B. Jabbari, Spreading codes for direct sequence CDMA and wideband CDMA cellular networks, IEEE Communications Magazine, vol. 36, no. 9, pp. 48-54, September 1998. D. Kedia, M. Duhan and S. L. Maskara, Evaluation of Correlation Properties of Orthogonal Spreading Codes for CDMA Wireless Mobile Communication, IEEE 2nd International Advance Computing Conference, 2010.

Walsh Orthogonal Gold Orthogonal Kasami Proposed Orthogonal MCCSC

BER

10

-1

[2] [3]

10

-2

8.5

9.5 10 10.5 Number of User

11

11.5

12

[4] downlink

Fig. 6. Multi-user BER performance for synchronous communication under AWGN channel at SNR=12dB

83

[5]

[6]

[7]

[8]

H. Donelan and T.O Farrell, Methods for generating sets of orthogonal sequences, Electronics Letters, vol. 35, no. 18, pp. 1537-1538, September 1999. A. Chandra and S. Chattopadhyay, Small set orthogonal Kasami codes for CDMA system, in Proc. Computers and Devices for Communication (CODEC-2009), Kolkata, December 2009. J. Zhang, D. W. Matolak, Multiple level orthogonal codes and their application in MC-CDMA systems, ELSEVIER Computer Communication journal , vol. 32, pp. 492-500, 2009. A.N. Akansu and R. Poluri, Walsh-like nonlinear phase orthogonal codes for direct sequence CDMA communications, IEEE Trans. Signal Processing, vol. 55, no.7, pp. 3800-3806, July 2007.

[9]

P. Kumar and S.Chakraborty, A New Overloading Scheme for Cellular DS-CDMA Using Orthogonal Gold codes, IEEE vehicular technology conference, pp. 1042-1046, May 2008. [10] J. E. Gilley, Bit-Error-Rate Simulation Using Matlab, Transcript International Inc, August 2003. [11] Z. Fu and E. M Dowling, Conjugate gradient eigenstructure tracking for adaptive spectral estimation, IEEE Transactions on Signal Processing, vol. 43, no. 5, pp. 11511160, 1995. [12] Z. Wu and C. R. Nasar, Novel orthogonal codes for DS-CDMA with improved cross-correlation characteristics in multipath fading channels, International symposium on Wireless Personal Multimedia Communication, vol. 3, pp. 1128-1132, 2

84