A fast synchronization algorithm in communication systems with spectrum expansion
Main Article Content
Abstract
The fast algorithm of synchronization using 2m points fast convolution for communication systems with direct sequence spread spectrum by 2m-1 points pseudo noise sequence has been proposed. The types and lengths of pseudo noise sequences suitable for usage with proposed algorithm are determined. There were made estimates of correlation errors and computational complexity.
Article Details
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors who publish with this journal agree to the following terms:- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
References
K. Feer, Wireless digital communication. Modulation and spectrum spreading methods, Moscow: Radio i svyaz, 2000, p. 520.
J. Proakis, Digital Communications, Moscow: Radio i svyaz, 2000, p. 800.
R.E. Blahut, Fast Algorithms for Digital Signal Processing, Moscow: Mir, 1989, p. 448.
R. Lyons, Digital signal processing: Second edition, Moscow: LLC"Binom-Press", 2006, p. 656.
C. Rader, “Discrete Fourier transforms when the number of data samples is prime”, Proceedings of the IEEE, vol. 56, no. 6, pp. 1107–1108, Jan. 1968. DOI:10.1109/PROC.1968.6477
L. Bluestein, “A linear filtering approach tothe computation of the discrete Fourier transform”, Northeast Electronics Research and EngineeringMeeting Record, no. 10, pp. 218–219, 1968.
