Results 231 to 240 of about 4,433,394 (276)
Some of the next articles are maybe not open access.
LSTM-based Frequency Hopping Sequence Prediction
2020 International Conference on Wireless Communications and Signal Processing (WCSP), 2020The continuous change of communication frequency brings difficulties to the reconnaissance and prediction of non-cooperative communication. The core of this communication process is the frequency-hopping (FH) sequence with pseudo-random characteristics, which controls carrier frequency hopping.
Gao Li +5 more
openaire +2 more sources
Chaotic frequency hopping sequences
IEEE Transactions on Communications, 1998This letter describes a novel family of frequency hopping sequences generated by chaotic systems. The sequences give a uniform spread over the entire frequency bandwidth. In addition to having good Hamming correlation properties, they possess ideal linear span.
Cong Ling 0001, Songgeng Sun
openaire +2 more sources
Maximal length sequences for frequency hopping
IEEE Journal on Selected Areas in Communications, 1990Normally, frequency hopping sequences for spread-spectrum communication systems are obtained by selecting groups of elements of binary m sequences. An alternative to using groups of binary m-sequence elements is developed. It involves obtaining nonbinary m sequences with the number of desired hopping frequencies equal to the number of symbols in the ...
John J. Komo, Shyh-Chang Liu
openaire +1 more source
Optimal frequency-hopping sequences based on the decimated m-sequences
Cryptography and Communications, 2022zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Cognitive Frequency Hopping Sequences
Chinese Journal of Electronics, 2016Since the immutable conventional Frequency hopping (FH) sequence cannot keep high FHcommunication reliability in complex electromagnetic environment, we propose an algorithm that cangenerate high-performance Cognitive frequency hopping sequence (CFHS) for Cognitive frequencyhopping (CFH) system.
Lei Guan +4 more
openaire +1 more source
Proceedings. IEEE Energy and Information Technologies in the Southeast', 2003
A procedure for obtaining frequency-hopping sequences with good random properties and good autocorrelation properties is presented. Normally, frequency-hopping sequences for spread-spectrum communication systems are obtained by selecting groups of elements of binary m-sequences.
J.J. Komo, S.-C. Liu
openaire +1 more source
A procedure for obtaining frequency-hopping sequences with good random properties and good autocorrelation properties is presented. Normally, frequency-hopping sequences for spread-spectrum communication systems are obtained by selecting groups of elements of binary m-sequences.
J.J. Komo, S.-C. Liu
openaire +1 more source
Analysis of protocol sequences for slow frequency hopping
Wireless Networks, 1998Decoding error probability bounds are derived for slow frequency hopping schemes. For unslotted asynchronous multiple access random protocol sequences with interleaved codes are considered. Nonrandom constructions of protocol sequences with good cyclic correlation properties are given.
László Györfi, István Vajda
openaire +2 more sources
Optimal Frequency-Hopping Sequences Via Cyclotomy
IEEE Transactions on Information Theory, 2005Using cyclotomic numbers, a simple construction is presented for frequency-hopping (FH) sequences having optimal autocorrelation with respect to the well-known Lempel-Greenberger bound. Some optimal families of FH sequences are constructed. The simplicity of this technique makes it attractive for practical use.
Wensong Chu, Charles J. Colbourn
openaire +2 more sources
Optimal Frequency-Hopping Sequences With New Parameters
IEEE Transactions on Information Theory, 2010A frequency-hopping sequence (FHS) of length v and frequency set size M is called a (v,M,?)-FHS if its maximum out-of-phase Hamming autocorrelation is ?. Three new classes of optimal FHSs with respect to the Lempel-Greenberger bound are presented in this paper.
Chung, JH, Yang, K
openaire +2 more sources
Optimal Frequency Hopping Sequences: A Combinatorial Approach
IEEE Transactions on Information Theory, 2004Frequency hopping multiple access (FHMA) spread-spectrum communication systems employing multiple frequency-shift keying (MFSK) as data modulation technique are investigated from a combinatorial approach. A correspondence between optimal frequency hopping (FH) sequences and partition-type difference packings is first established.
Ryoh Fuji-Hara +2 more
openaire +1 more source