Chaotic spreading codes and their generation

Details Chaotic spreading codes and their generation Chaotic spreading codes and their generation

2007-11-30

2011-12-27

Nguyen, Brian (Department: 2472)

Multiplex communications

Communication over free space

Combining or distributing information via code word channels...

C370S335000

Reexamination Certificate

active

08085749

ABSTRACT:
Generation of a set of spreading codes starts with determining first and second chaotic pseudo-random noise codes having delta-peak-like autocorrelation functions and a low cross-correlation function. Further codes are obtained by the steps: (a) generating a further pseudo-random noise code by computing Dk=F(C1)+TkC2+F(C2), where k represents a positive integral index, Dkthe generated pseudo-random noise code, C1the first code, C2the second code, F a binary function based on basic binary operations and Tkthe operator cyclically shifting a code by k chip positions; (b) adding code Dkto the set of already determined pseudo-random noise codes if it has a delta-peak-like autocorrelation and low cross-correlation functions with the pseudo-random noise codes already determined; (c) discarding code Dkif the conditions of step (b) are not satisfied; (d) modifying index k and repeating steps (a)-(d) until the cardinal number of the set of determined pseudo-random noise codes reaches the cardinal number of the set of spreading codes to be generated.

REFERENCES:
patent: 5321409 (1994-06-01), Walker
patent: 6999966 (2006-02-01), Liang et al.
patent: 7203685 (2007-04-01), Abdo et al.
patent: 7974413 (2011-07-01), Chester et al.
patent: 8005221 (2011-08-01), Chester et al.
patent: 2007/0185851 (2007-08-01), Bruno et al.
patent: 2011/0134890 (2011-06-01), Fodor
D. Flachs, et al. “Galileo Signal in Space Interface Control Document (SIS-ICD), Ver. 10.1,” Galileo Industries Sep. 28, 2005.
S. Wallner, “Consolidated Code Design (TN ID31),” Galileo Phase C0 / CN001, Nov. 10, 2004.
V. Varadan and H. Leung, “Design of Piecewise Maps for Chaotic Spread-Spectrum Communications Using Genetic Programming,” IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications, vol. 49, pp. 1543-1553, 2002.
G. Mazzini, G. Setti, and R. Rovatti, “Chaotic complex spreading sequences for asynchronous DS-CDMA—Part I: System modeling and results,” IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications, vol. 44, pp. 937-947, 1997.
D. Yoshioka, A. Tsuneda, and T. Inoue, “On Transformation between Discretized Bernoulli and Tent Maps,” IEICE TRANS, Fundamentals, vol. E88-A, 2005.
T. Kohda and A. Tsuneda, “Statistics of chaotic binary sequences,” IEEE Trans. Inf. Theory, vol. 43, pp. 104-112, 1997.
A. L. Baranovski, F. Dachselt, and W. R.. “Nonlinear dynamics of PNsequences,”Proceedings of the IST Mobile & Wireless Communications Summit 2005.
A. L. Baranovski, “On Generation of Chaotic M-Sequences,” Proceedings of the International Symposium on Nonlinear Theory and its Applications (NOLTA), Bruges, Belgium, 2005.
D. Yoshioka, A. Tsuneda, and T. Inoue, “An algorithm for the generation of maximal-period sequences based on one-dimensional chaos maps with finite bits,” IEICE Trans. Fundamentals, vol. E87-A, No. 6, pp. 1371-1376, Jun. 2004.
A. L. Baranovski and A. J. Lawrance, “Sensitive parameter dependence of autocorrelation function in piecewise linear maps,” International Journal of Bifurcations and Chaos, 2006.
F. Soualle, et al., “Spreading Code Selection Criteria for the future GNSS Galileo,” Proceedings of the GNSS 2005, Munich, 2005.
Stephane Penaud, et al. “Potentialites des sequences d'etalement chaotiques pour l'amelioration du TEEB d'un systeme DS-CDMA asynchrone”, Annales des Telecommunication, vol. 58 No. 3-4, 2003.
Alireza Mirzaee, et al. “Design of a New Class of Spreading Sequence Using Chaotic Dynamical Systems for Asynchronous DS-CDMA Applications”, Computers and Communications 2004, vol. 2, pp. 720-724.
Tohru Kohda, et al. “Pseudonoise Sequences by Chaotic Nonlinear Maps and Their Correlation Properties.”, IEICE Transactions on Communications, Communications Society, Tokyo Japan, Aug. 1, 1993, vol. E76, No. 8, pp. 855-862, XP000396888.
R. Rovatti, et al., “Chaotic complex spreading sequences for asynchronous DS-CDMA—Part II:Some Theoretical Performance Bounds,” IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications, vol. 45, No. 4, pp. 497-505, 1998.
International Search Report PCT/EP2007/063080; Dated May 6, 2008.

Affiliated with

Also associated with

Rating

Chaotic spreading codes and their generation does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Chaotic spreading codes and their generation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Chaotic spreading codes and their generation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4297168