GENERATION OF LARGE SET OF BINARY SEQUENCES DERIVED FROM CHAOTIC FUNCTIONS DEFINED OVER FINITE FIELD GF(28 )WITH GOOD LINEAR COMPLEXITY AND PAIRWISE CROSS CORRELATION PROPERTIES

Some of the techniques of deriving binary sequences from chaotic function is defined in the literature. In this paper a new algebraic structure for generation of sequences using chaotic functions defined over finite field GF(28 ) is proposed. The results indicate that for appropriate choice of bifurcation parameters and initial values both from GF(28 ), a periodic sequence of period (28 – 1) can be obtained. These sequences over GF(28 ) are transformed to binary using three techniques (i), (ii) and (iii) i) expressing every element in GF(28 )of the sequence as binary 8 tuple ii) selecting a particular binary bit from each element of the sequence over GF(28 ) iii) mapping every element in GF(28 ) to GF(2) using Trace function The cross correlation and Linear Complexity properties of binary sequences so obtained are studied. It is found that they have good cross correlation values and large linear complexity and hence can be used as spreading sequences in CDMA applications