{"title":"物理层安全中用于数据包检测的频率距离序列","authors":"Radi Abubaker, Guang Gong","doi":"10.1007/s10623-024-01475-x","DOIUrl":null,"url":null,"abstract":"<p>In this paper, we investigate how to construct the required sequences to be used as pilot signals for packet detection in physical-layer security. Our construction starts from the frequency domain, where a set of orthogonal frequencies cover an entire given bandwidth. The construction is a generalized construction from Milewski’s construction, where it takes the inverse discrete Fourier transform of the given frequency domain sequences. In this paper, we call a set of the <i>q</i> sequences of length <span>\\(\\ell q\\)</span> with an equal distanced, nonzero frequency response in the frequency domain a <i>frequency distance sequence set</i> (<i>FDSS</i>) and a sequence interleaved from this set an <i>FDSS interleaved sequence</i>. By applying frequency and time domain relations, we show that such a set is mutually orthogonal, and is a complementary sequence set if and only if the seed sequence is perfect (i.e., zero autocorrelation at all out-of-phase shift). The FDSS interleaved sequence is perfect if and only if the seed sequence is perfect. We apply the proposed sequences to real world experiments as pilot sequences for coarse synchronization. In our experiments, we selected Frank–Zadoff–Chu sequences and Golay pair sequences in our construction for use with an ADALM-Pluto SDR from Analog Devices and simulations, and we show the pilot detection rate under different noisy channel conditions, when compared to alternative pilot selections. The false negative detection rate of our pilot decreases to zero when the SNR is 20 dB. In contrast, a general OFDM QPSK pilot has a false-negative detection rate near 70% at the same SNR. In general, our pilot sequence consistently has a lower false-negative rate to the OFDM QPSK pilot, which failed to detect most packets in the ADALM-Pluto SDR environment.</p>","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"380 1","pages":""},"PeriodicalIF":1.4000,"publicationDate":"2024-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Frequency distance sequences for packet detection in physical-layer security\",\"authors\":\"Radi Abubaker, Guang Gong\",\"doi\":\"10.1007/s10623-024-01475-x\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>In this paper, we investigate how to construct the required sequences to be used as pilot signals for packet detection in physical-layer security. Our construction starts from the frequency domain, where a set of orthogonal frequencies cover an entire given bandwidth. The construction is a generalized construction from Milewski’s construction, where it takes the inverse discrete Fourier transform of the given frequency domain sequences. In this paper, we call a set of the <i>q</i> sequences of length <span>\\\\(\\\\ell q\\\\)</span> with an equal distanced, nonzero frequency response in the frequency domain a <i>frequency distance sequence set</i> (<i>FDSS</i>) and a sequence interleaved from this set an <i>FDSS interleaved sequence</i>. By applying frequency and time domain relations, we show that such a set is mutually orthogonal, and is a complementary sequence set if and only if the seed sequence is perfect (i.e., zero autocorrelation at all out-of-phase shift). The FDSS interleaved sequence is perfect if and only if the seed sequence is perfect. We apply the proposed sequences to real world experiments as pilot sequences for coarse synchronization. In our experiments, we selected Frank–Zadoff–Chu sequences and Golay pair sequences in our construction for use with an ADALM-Pluto SDR from Analog Devices and simulations, and we show the pilot detection rate under different noisy channel conditions, when compared to alternative pilot selections. The false negative detection rate of our pilot decreases to zero when the SNR is 20 dB. In contrast, a general OFDM QPSK pilot has a false-negative detection rate near 70% at the same SNR. In general, our pilot sequence consistently has a lower false-negative rate to the OFDM QPSK pilot, which failed to detect most packets in the ADALM-Pluto SDR environment.</p>\",\"PeriodicalId\":11130,\"journal\":{\"name\":\"Designs, Codes and Cryptography\",\"volume\":\"380 1\",\"pages\":\"\"},\"PeriodicalIF\":1.4000,\"publicationDate\":\"2024-08-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Designs, Codes and Cryptography\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1007/s10623-024-01475-x\",\"RegionNum\":2,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Designs, Codes and Cryptography","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s10623-024-01475-x","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
Frequency distance sequences for packet detection in physical-layer security
In this paper, we investigate how to construct the required sequences to be used as pilot signals for packet detection in physical-layer security. Our construction starts from the frequency domain, where a set of orthogonal frequencies cover an entire given bandwidth. The construction is a generalized construction from Milewski’s construction, where it takes the inverse discrete Fourier transform of the given frequency domain sequences. In this paper, we call a set of the q sequences of length \(\ell q\) with an equal distanced, nonzero frequency response in the frequency domain a frequency distance sequence set (FDSS) and a sequence interleaved from this set an FDSS interleaved sequence. By applying frequency and time domain relations, we show that such a set is mutually orthogonal, and is a complementary sequence set if and only if the seed sequence is perfect (i.e., zero autocorrelation at all out-of-phase shift). The FDSS interleaved sequence is perfect if and only if the seed sequence is perfect. We apply the proposed sequences to real world experiments as pilot sequences for coarse synchronization. In our experiments, we selected Frank–Zadoff–Chu sequences and Golay pair sequences in our construction for use with an ADALM-Pluto SDR from Analog Devices and simulations, and we show the pilot detection rate under different noisy channel conditions, when compared to alternative pilot selections. The false negative detection rate of our pilot decreases to zero when the SNR is 20 dB. In contrast, a general OFDM QPSK pilot has a false-negative detection rate near 70% at the same SNR. In general, our pilot sequence consistently has a lower false-negative rate to the OFDM QPSK pilot, which failed to detect most packets in the ADALM-Pluto SDR environment.
期刊介绍:
Designs, Codes and Cryptography is an archival peer-reviewed technical journal publishing original research papers in the designated areas. There is a great deal of activity in design theory, coding theory and cryptography, including a substantial amount of research which brings together more than one of the subjects. While many journals exist for each of the individual areas, few encourage the interaction of the disciplines.
The journal was founded to meet the needs of mathematicians, engineers and computer scientists working in these areas, whose interests extend beyond the bounds of any one of the individual disciplines. The journal provides a forum for high quality research in its three areas, with papers touching more than one of the areas especially welcome.
The journal also considers high quality submissions in the closely related areas of finite fields and finite geometries, which provide important tools for both the construction and the actual application of designs, codes and cryptographic systems. In particular, it includes (mostly theoretical) papers on computational aspects of finite fields. It also considers topics in sequence design, which frequently admit equivalent formulations in the journal’s main areas.
Designs, Codes and Cryptography is mathematically oriented, emphasizing the algebraic and geometric aspects of the areas it covers. The journal considers high quality papers of both a theoretical and a practical nature, provided they contain a substantial amount of mathematics.