CROSS-CORRELATION ANALYSIS OF SETS OF GENERALIZED BINARY BARKER SEQUENCES
DOI:
https://doi.org/10.18372/1990-5548.59.13633Keywords:
Generalized binary Barker sequences, correlation properties, cross-correlation, signal processing, signal detection, signal analysisAbstract
The effectiveness of many signal processing techniques and their practical value, which is particularly prominent in accuracy of detection and measurement, range and time resolution etc., depends on correlation properties of signals being processed. The article is focused on a study of correlation properties of generalized binary Barker sequences, namely cross-correlation between signal components in sets based on generalized binary Barker sequences. These sets of sequences provide low peak sidelobe level after their joint signal processing (multiplicative complementariness), but their cross-correlation characteristics can also have an impact upon the quality of radio and signal processing systems. There are 5 sets of generalized binary Barker sequences with different structures that were analyzed in the article. The presented results have established that signal components based on generalized binary Barker sequences are characterized by a relatively high level of cross-correlation, which can be up to a typical value 0.25 between different signal components in a set consisting of not more than 8 sequences. This fact restricts the application of generalized binary Barker sequences in some techniques (e.g., CDMA) due to the impossibility of separation of signal components or it requires enhancement of these techniques in order to take account of cross-correlation between signal components. Sets of generalized binary Barker sequences with the lowest maximum absolute values of cross-correlation were also identified and shown in the article.
References
I. A. Arriaga-Trejo, A. G. Orozco-Lugo, and J. Flores-Troncoso, “Design of unimodular sequences with good autocorrelation and good complementary autocorrelation properties,” IEEE Signal Processing Letters, vol. 24, no. 8, 2017, pp. 1153–1157. DOI: 10.1109/LSP.2017.2696950
S.-H. Wang, C.-P. Li, H.-H. Chang, and C.-D. Lee, “A systematic method for constructing sparse Gaussian integer sequences with ideal periodic autocorrelation functions,” IEEE Transactions on Communications, vol. 64, no. 1, 2016, pp. 365–376. DOI: 10.1109/TCOMM.2015.2498185
Y.-C. Kao and Y. Li, “Matrix representations of aperiodic auto and cross correlation functions,” Fourth International Workshop on Signal Design and its Applications in Communications, Oct. 19-23, 2009 (Fukuoka, Japan), Proceedings, 2009, pp. 96–99. DOI: 10.1109/IWSDA.2009.5346448
Q. Li, J. Gao, and X. Zhao, “Periodic correlation bounds of binary sequence pairs,” 5th International Conference on Wireless Communications, Networking and Mobile Computing, Sept. 24-26, 2009 (Beijing, China), Proceedings, 2009, pp. 1–3. DOI: 10.1109/WICOM.2009.5302414
A. Holubnychyi, “Generalized binary Barker sequences and their application to radar technology,” Signal Processing Symposium (SPS), June 5-7, 2013 (Serock, Poland), Proceedings, 2013, pp. 1–9. DOI: 10.1109/SPS.2013.6623610
A. G. Holubnychyi, “Generation of generalized binary Barker sequences and their structure,” Problems of Informatization and Management, vol. 4, no. 44, 2013, pp. 20–26 (in Russian). DOI: 10.18372/2073-4751.4.6359
A. H. Holubnychyi and G. F. Konakhovych, “Multiplicative complementary binary signal-code constructions,” Radioelectronics and Communications Systems, vol. 61, no. 10, 2018, pp. 431–443. DOI: 10.3103/S0735272718100011
A. G. Holubnychyi, “Correlation properties of generalized binary Barker sequences,” Problems of Informatization and Management, vol. 2, no. 50, 2015, pp. 48–55 (in Russian). DOI: 10.18372/2073-4751.2.8940
J. Brest and B. Bošković, “A heuristic algorithm for a low autocorrelation binary sequence problem with odd length and high merit factor,” IEEE Access, vol. 6, 2018, pp. 4127–4134. DOI: 10.1109/ACCESS.2018.2789916
M. A. Nasrabadi and M. H. Bastani, “A survey on the design of binary pulse compression codes with low autocorrelation,” Ch. 3 in Trends in Telecommunications Technologies (Edited by Christos Bouras), 2010, pp. 39–61. DOI: 10.5772/8496
W. Ren, H. Zhang, Q. Liu, and Yi Yang, “Greedy code search based memetic algorithm for the design of orthogonal polyphase code sets,” IEEE Access, vol. 7, 2019, pp. 13561–13576. DOI: 10.1109/ACCESS.2019.2893970
Bo Liu, Z. He, J. Zeng, and B. Liu, “Polyphase orthogonal code design for MIMO radar systems,” CIE International Conference on Radar, Oct. 16-19, 2006 (Shanghai, China), Proceedings, 2006, pp. 1–4. DOI: 10.1109/ICR.2006.343409
A. Ukil, “Low autocorrelation binary sequences: Number theory-based analysis for minimum energy level, Barker codes,” Digital Signal Processsing, vol. 20, no. 2, 2010, pp. 483–495. DOI: 10.1016/j.dsp.2009.08.003
M. A. Nasrabadi and M. H. Bastani, “A new approach for long low autocorrelation binary sequence problem using genetic algorithm,” CIE International Conference on Radar, Oct. 16-19, 2006 (Shanghai, China), Proceedings, 2006, pp. 1–3. DOI: 10.1109/ICR.2006.343514
M. Alam and Qi Zhang, “Non-orthogonal multiple access with sequence block compressed sensing multiuser detection for 5G,” IEEE Access, vol. 6, 2018, pp. 63058–63070. DOI: 10.1109/ACCESS.2018.2877477
A. Quayum, H. Minn, and Y. Kakishima, “Non-orthogonal pilot designs for joint channel estimation and collision detection in grant-free access systems,” IEEE Access, vol. 6, 2018, pp. 55186–55201. DOI: 10.1109/ACCESS.2018.2872793
Downloads
Issue
Section
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).
