Abstract
The prime characteristic of spread spectrum modulated signals is that their bandwidth is greater than the information rate. In this way a redundancy is introduced that allows the severe levels of inteference inherent in the transmission of digital information over radio and satellite links to be overcome. Current spread spectrum applications are primarily in military communications; nevertheless, there is growing interest in this technique for third generation mobile radio networks (UMTS, FPLTS, etc.) with open discussion regarding the practicality of using a multiple access system based on spread spectrum techniques (CDMA). However, in order to support as many users in the same bandwidth as other multiple access techniques such as TDMA or FDMA, it is important how to generate large families of sequences that present low cross-correlation. The aim of this paper is to describe a spreading codes generator that can produce a large number of PN sequences with good properties of auto- and cross-correlation. Moreover, the codes generated shows high unpredictability and good statistical behaviour. This also allows the implementation of some features that are common on military networks such as message privacy (increasingly important in commercial networks) without additional cost. The structure presented shows itself to be advantageous for high speed generation of codes at a low cost, low power consumption (allowing longer life for batteries), small size and simplicity of implementation, essential ingredients for commercial equipment. Another attractive feature is its structural parallelism, useful in VLSI implementations. All of these features render it potentially suitable for the implementation of channel bandwidth sharing systems in future wireless personal communications networks.
Similar content being viewed by others
References
R. Skaug, J.F. Hjelmstad, “Spread spectrumin communications”, IEE Telecommuniations Series, v. 12. ISBN 0–86341-034-0.
R. Gold, “Optimal binary sequences for spread spectrum multiplexing”, IEEE Trans, 1967. IT-13(5), pp. 619–621.
R. Gold, “Maximal recursive sequences with 3-valued recursive coss-correlation functions”, IEEE Trans., 1968. IT-14 pp. 154.
J.L. Massey, “Shift register sysnthesis and BCH decoding”, IEEE Trans on Information Theory, Vol. IT-15, No 1, Jan. 1976.
F. Piper, “Stream cipher”, Proc. Workshop on Cryptography, Springer-Verlag Lecture Notes in Computer Science, No 149, New York 1982.
D.V. Sarwate, M.B. Pursley, “Correlation properties of pseudo random and related sequences”.
M.B. Pursley, D.V. Sarwate, “Evaluation of correlation parameters for periodic sequences”, IEEE Trans, 1977, IT-23(4), pp. 508
T. Beth, “On the complexity of pseudo random sequences”, Proceeding of the workshop on Stream Ciphers. Report 89/1. 1989.
Ruepple, R. A. “Analysis and design of stream ciphers”, Springer-Verlag, New York, 1986.
G. Carter, “Statistical tests for randomness”, Proccedings of the Workshop on Stream Ciphers. Report 89/1, 1989.
U. Mauer, J.L. Massey, “Perfect local randomness in pseudorandom sequences”, CRYPTO 89.
D.E. Knuth, “The art of computer programming. Vol 2: Seminumérical algorithms”, Adison-Wesley 1967.
U. Mauer, “A universal statistical test for random bit generators”, Advances in Cryptology-CRYPTO'90. Springer-Verlag Lecture Notes in Computer Science, No 537. Berlin, 1991.
M.J.E. Golay, “The merit factor of long low autocorrelation of sequences”, IEEE Trans., 1982. IT-28(3), pp. 543–549.
E.J. Cruselles, M. Soriano, J.L. MelÚs, “Uncorrelated PN sequences generator for spreading codes in CDMA systems”, 6th IEEE International Sysmposium on Personal, Indoor and Mobile Radio Communications (PIMRC'95). September 27–29, 1995. Toronto, Canada.
M. Soriano, “Contribution to the design and evaluation of stream ciphers for secure communications”, PhD. Thesis, Politechnical University of Catalonia, Barcelona. 1996.
K. Zeng, C. Yang, T.R.N. Rao, “Pseudorandom bit generators in stream cipher cryptography”, IEEE, 1991.
W.E. Stark, D.V. Sarwate, “Kronecker sequences for spread spectrum communications”, Proc. IEE, Part F, 1982, 128(2), pp. 104.
M.B. Pursley, “Evaluating performance of codes for spread spectrum multiple access communications”, 12th Annual Allerton conference on Circuit and Systems Theory, Monticello III, October, 1974.
V.M. Sidelnikov, “On mutual correlation of sequences”, Soviet Math Dolk, 1971, 12(1), pp. 197–201.
R.L. Harris, “Introduction to spread spectrum techniques”, Agard Lecture Series No 58, 1973.
H.J. Beker, F.C. Piper, “Cipher systems: The protection of communications”, Van Nostrand Reinhold, London, 1982.
M. Blum, S. Micali, “How to generate cryptographically strong sequences of pseudorandom bits”, SIAM J. Comput. 13 (1984), pp. 850–864
S.W. Golomb, “Shift Register Sequences”, Holden-Day. 1967.
W.G. Chambers, D. Gollman, “Generators for sequences with near-maximal linear equivalence”, IEE Proc. E., vol. 135, pp 67–69, 1988.
J.O. Bruer, “On pseudo random sequences as crypto generators”, Proceedings of Int. Zurich Seminar on Digital Communicationes, Switzerland, 1984.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Cruselles, E.J., Soriano, M. & Melús, J.L. Spreading Codes Generator for Wireless CDMA Networks. Wireless Personal Communications 7, 69–88 (1998). https://doi.org/10.1023/A:1008860715309
Issue Date:
DOI: https://doi.org/10.1023/A:1008860715309