To address the security and performance challenges, a novel smart grid communication system based on the frequency-hopping (FH) technology is investigated in this paper. A new FH sequence set with various levels of Hamming cross-correlation values is proposed for this system in order to endow the power users various qualities of services (QoSs). By using the real measurement, we propose a statistic model of the data collected from power grid. Based on the proposed FH sequence set and the data model, the analytic expression of the bit error rate (BER) of such a system with binary frequency shift keying (BFSK) modulation is derived under slow Rayleigh fading channel model. This expression firstly reveals the general relation among the BER, the properties of deterministic FH sequence and other system parameters and provides the guidance for the sequence design in the view of the system performance. The simulation results which are performed by using the real measurement data coincide with the analytical conclusions.

In this paper, we derive a new bound on maximum nontrivial Hamming correlation of frequency hopping (FH) sequences from the Singleton bound in error correcting code literature, and we discuss the relation between the new bound and the known ones on FH sequences. Further, we construct two classes of FH sequences from punctured Reed–Solomon codes and one class of FH sequences from polynomial functions, which meet the new bound.

In this paper, two generic constructions of optimal frequency-hopping sequence (FHS) sets employingd-form functions with difference-balanced property are presented. They generalize the previous constructions of optimal FHS sets usingm-sequences and produce new optimal FHS sets that cannot be produced by the earlier constructions. By choosing appropriated-form functions with difference-balanced property, both constructions lead to FHSs with large linear complexity. In addition, one of the proposed constructions gives new optimal parameters of FHS sets.

In this letter, based on a pair of mismatched binary sequences with perfect cross-correlation function (PCCF), a new method for constructing zero correlation zone (ZCZ) sequences sets with mismatched filtering is presented. The resultant optimal sets of quadriphase ZCZ sequence have flexible parameters and high efficiency. Compared with the one proposed by Trinh, our method gives cyclically distinct transmitted sequences and corresponding mismatched sequences at the receiver.

In mobile communications, navigation, and radar applications, good periodic binary sequences are normally used with matched-filter technique. However, from the viewpoint of signal processing, there is no need to only consider the filter coefficients as binary. This letter presents a theoretical bound for real-valued mismatched sequence sets with zero correlation zone (ZCZ) and then proposes a method for constructing sets of optimal mismatched ZCZ sequences with respect to the theoretical bound for application in mismatched filtering.

In this paper, a new family of hopping sequences with very large family size suitable for use in time/frequency-hopping (TH/FH) code-division multiple-access (CDMA) systems is proposed and investigated. The construction of the new hopping sequences is based upon the polynomial theory over the finite field, and the new hopping sequences are called the polynomial hopping sequences. It is shown that the new time/frequency-hopping sequences include the well-known cubic hopping sequences, quadratic hopping sequences, and linear hopping sequences as special cases, and are good candidates for the large-capacity ultrawide-bandwidth (UWB) radio systems.

Frequency hopping (FH) sequences have found wide applications in various modern FH spread-spectrum communications and radar systems. In FH spread-spectrum communications, the interference occurs when two distinct transmitters use the same frequency simultaneously. In order to evaluate the goodness of FH sequence design, the Hamming correlation function is used as an important measure. In this correspondence, by considering separately the maximum Hamming autocorrelation sidelobe H/sub a/, and the maximum Hamming cross correlation H/sub c/, several new lower bounds on the size p of the frequency slot set F, the sequence length L, the family size M, and correlation properties are established. The new periodic bounds include the known Lempel-Greenberger bounds as special case when M=2, and are tighter than the Seay bounds under certain conditions when M>2. Furthermore, the new bounds disclose more information on the relationship between the maximum autocorrelation sidelobe and the maximum cross correlation compared with the Lempel-Greenberger bounds and Seay bounds. Besides, the aperiodic FH bounds which have not yet been previously reported are also presented and discussed in this correspondence.

In this paper, a general periodic correlation bound named generalized Sarwate bound for complex roots of unity sequence set with zero or low correlation zone (ZCZ/LCZ), with respect to family size, sequence length, maximum autocorrelation sidelobe, maximum crosscorrelation value and the zero or low correlation zone, are derived. It is shown that all the previous periodic binary sequence bounds, such as Sarwate bound, Welch bound, Tang-Fan bound and Peng-Fan bound, are only special cases of the generalized Sarwate bound.