CHECKING TRANSFER SUCCESS OF PN CODE SET

 

 

The purpose of this web page is to tabulate the exact chip-by-chip sequences of two example code sets to allow the client of this spreading code distribution service to check whether the downloaded code file matrices from the spreading code database look like those should be, i.e. whether files are unzipped properly. Consult your system manager in the case of emerging problems in unzipping.

If you think that the problems in downloading may ultimately result from erroneous actions on service provider’s side, I would be very happy if you could inform me by e-mail: kari.karkkainen(at)oulu.fi. With feedback I can continuously improve my database service.

An AO/LSE optimized set of a small set of Kasami sequences of length 15 in files ao_lse_sk15.mat and ao_lse_sk15.gz should look like this:

 

 

The Code Chip Matrix of Files ao_lse_sk15.mat and ao_lse_sk15.gz

Code

Consecutive Binary PN Sequence Chips

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

1

+1

–1

–1

+1

+1

+1

+1

–1

+1

–1

+1

–1

+1

+1

–1

2

–1

+1

–1

+1

+1

+1

–1

–1

–1

–1

–1

–1

+1

–1

–1

3

–1

+1

+1

–1

–1

–1

+1

+1

–1

+1

+1

+1

+1

+1

–1

4

–1

+1

+1

–1

–1

+1

–1

+1

–1

–1

–1

–1

+1

+1

+1

 

 

A MSQCC/CO optimized maximum-length sequence set of length 31 in files msqcc_co_m31.mat and msqcc_co_m31.gz should look like this:

 

 

The Code Chip Matrix of Files msqcc_co_m31.mat and msqcc_co_m31.gz

Code

Consecutive Binary PN Sequence Chips

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

1

–1

–1

–1

+1

+1

+1

–1

–1

+1

–1

–1

–1

+1

–1

+1

–1

+1

+1

+1

+1

–1

+1

+1

–1

+1

–1

–1

+1

+1

–1

–1

2

–1

+1

–1

–1

–1

+1

+1

+1

–1

+1

–1

+1

–1

–1

+1

–1

+1

+1

+1

+1

–1

–1

+1

+1

–1

+1

+1

–1

–1

–1

–1

3

–1

–1

+1

–1

–1

–1

–1

–1

+1

–1

+1

+1

+1

–1

+1

+1

–1

+1

–1

+1

–1

–1

+1

+1

+1

+1

–1

–1

–1

+1

+1

4

+1

–1

+1

–1

–1

–1

+1

–1

–1

+1

+1

+1

–1

–1

–1

–1

–1

+1

+1

–1

–1

+1

–1

+1

+1

–1

+1

+1

+1

+1

–1

5

–1

–1

–1

–1

+1

+1

–1

+1

+1

–1

–1

+1

+1

+1

+1

–1

+1

–1

–1

+1

–1

+1

–1

+1

+1

+1

–1

–1

–1

+1

–1

6

+1

+1

–1

–1

–1

+1

+1

+1

+1

–1

–1

+1

–1

+1

–1

+1

+1

–1

+1

+1

+1

–1

+1

–1

–1

–1

–1

–1

+1

–1

–1