Abstract

This paper considers spectrally efficient differential frequency hopping (DFH) system design. Relying on time-frequency diversity over large spectrum and high speed frequency hopping, DFH systems are robust against hostile jamming interference. However, the spectral efficiency of conventional DFH systems is very low due to only using the frequency of each channel. To improve the system capacity, in this paper, we propose an innovative high order differential frequency hopping (HODFH) scheme. Unlike in traditional DFH where the message is carried by the frequency relationship between the adjacent hops using one order differential coding, in HODFH, the message is carried by the frequency and phase relationship using two-order or higher order differential coding. As a result, system efficiency is increased significantly since the additional information transmission is achieved by the higher order differential coding at no extra cost on either bandwidth or power. Quantitative performance analysis on the proposed scheme demonstrates that transmission through the frequency and phase relationship using two-order or higher order differential coding essentially introduces another dimension to the signal space, and the corresponding coding gain can increase the system efficiency.

1. Introduction

As one of the two basic modulation techniques used in spread spectrum communications, frequency hopping (FH) was originally designed to be inherently secure and reliable under adverse battle conditions for military applications. However, there are three major bottlenecks: low data rate, narrow bandwidth frequency hopping, and a low hopping rate when using frequency hopping in the high frequency (HF) band. Currently, the data rate of the existing HF frequency hopping radio is limited to 2400 bps or less, the reliable data rate is 1200 bps, the highest hopping rate is only tens of hops per sec, and the antijamming capability is weak. Under current conditions, it is difficult to achieve high-capacity communications with HF communications technology when there are harsh electromagnetic environments.

In the 1990s, the Sanders Company, from the United States of America, pioneered an enhanced hopping spread spectrum radio (Correlated Hopping Enhanced Spread Spectrum), referred to as CHESS Radio [1, 2]. It was based on the differential frequency hopping system and was a good solution to improve the data rate and anti-tracking-jamming abilities, among other issues. Its hopping rate is 5000 hops per sec and the frequency hopping bandwidth is 2 MHz; these were breakthroughs compared to conventional HF communication systems. However, the conventional DFH system has low spectral efficiency over large bandwidth. Typically, conventional DFH systems require large bandwidth, which is proportional to the requirement on the frequency number. Along with the ever increasing demand on inherently secure high data rate wireless communications, new techniques that are more efficient and reliable have to be developed. In literature [3], a FH system called modulated differential frequency hopping was proposed, in this system, some information was used to produce a pseudo-random carrier frequency slot (as in the DFH technology), and others were changed into narrowband modulated waveforms (as in the conventional FH technology). The message-driven frequency hopping (MDFH) scheme proposed in literature [4] possesses higher spectral efficiency than conventional FH communication system. In literature [5], based on the idea of MDFH, a new scheme was proposed to improve the ability of anti-fixed-frequency interference. In literature [6, 7], the antijamming performance of the MDFH was analyzed in depth.

In this paper, we propose an innovative high order differential frequency hopping (HODFH) scheme. The basic idea is that the frequencies and the phases of the signal are numbered and then using the two-order or higher order differential coding to code the message and the signal number. The message is parsed into several parts; each part will be transmitted by different order differential coding. In other words, the serial message stream is converted into parallel data stream transmitted by each order differential coding. At the receiver, the transmitting frequency is captured using a filter bank as in the FSK receiver rather than using the frequency synthesizer. As a result, the frequency can be blindly detected at each hop. This relaxes the burden of strict frequency synchronization at the receiver. And the phase is estimated as in the PSK receiver. Then the frequency and the phase are used to decode the message. The system spectral efficiency is significantly improved, because the high order differential coding and the phases do not require extra cost on bandwidth and power.

In this paper, in-depth performance analysis is conducted based on both theoretical derivation and simulation examples. Our analysis demonstrates that phases essentially add another dimension to the signal space, and the high order differential coding can increase the system spectral efficiency.

2. The Concept of High Order Differential Frequency Hopping

2.1. Transmitter Design

Unlike the conventional DFH systems in which only the frequencies are coded by the one-order coding, the HODFH systems code the frequencies and their phases by high order coding. That is to say, in the conventional DFH system, only the carrier frequencies carry the message; however, in the HODFH system, not only frequencies but also the phases carry the information. In a HODFH system, we add several phases to the frequencies; therefore, the signal number is significantly increased almost without increase in bandwidth.

Let be the total number of frequencies, with being the set of all frequencies. Let be the number of initial phases where the frequency is in each hop, with being the set of all phases. Define as the combinated signal of these frequencies and phases in the hop; it is clear that there are signals. The set , with being its elements, is the set of all the combinated signals.

Let be the order of the HODFH system; we start by reshaping the one-dimensional set into -dimensional set , where the subscript denotes element number of each dimension, and ; denote as the element of the set . We assume that . Divide the data stream into blocks of length , where is the number of bits that is transmitted through the order differential coding. Denote the block by . The block can be grouped into vectors, denoted by , where denotes the order bits, as shown in Figure 1. We will transmit within one hop.

The transmitter block diagram of the proposed HODFH scheme is illustrated in Figure 2. Each input data block, , is fed into a serial-to-parallel (S/P) converter, where the data bits are split into parallel data streams. Denote the signals in the and hop by and . The index of the is obtained by -order differential coding the index of the and information data block . The differential processing is called a function and expressed by the following equations:

Using the index vectors to select the combinated signal, the signal transmitted over the channel is .

Recall that is the combination of the frequency and phase. The transmitted signal in the hop can be expressed aswhere is the signal amplitude, is the center frequency of the hop, is the possible phases of the hop, and is the hop duration. The passband waveform of the transmitted signal may be expressed aswhere is the signal pulse-shaping filter.

2.2. Receiver Design

The receiver block diagram of the proposed HODFH scheme is illustrated in Figure 3. Recall that there are frequencies that are extended out signals. First, we must detect which frequency is transmitted. For this purpose, a bank of bandpass filters (BPF), each centered at , with the same channel bandwidth as the transmitter, is deployed at the receiver front end. Since only one frequency band is occupied at any given hop, we simply measure the outputs of bandpass filters at each possible signaling frequency. The actual carrier frequency at a certain hopping period can be detected by selecting the one that captures the strongest signal. As a result, blind detection of the carrier frequency is achieved at the receiver.

More specifically, the received signal is a convolution of the transmitted signal with the channel impulse response, and it can be expressed aswhere is the channel impulse response and denotes additive white Gaussian noise (AWGN). Accordingly, the outputs of bandpass filters are given bywhere is the ideal bandpass filter centered at frequency . If the channel is ideal, that is, , thenwhere is the filtered version of WGN. If the signal-to-noise ratio is sufficiently high, and there is no strong jamming, as in most communication systems, there is one and only one significantly strong signal among the outputs of the filter bank. Suppose that the filter captures this distinctive signal during the hop; then the estimated hopping frequency . The same procedures can be carried out to determine the carrier frequency at each hop.

Next, the estimated hopping frequency is used to control NCO. The output signal multiplied by the received signal and NCO is used to estimate the phase of the transmitted signal. Denote the estimated phase as .

Then, the estimated hopping frequency and the estimated phase are used to estimate the transmitted signal. Denote the estimated signal as . The estimated index at the hop and the estimated index at the hop are fed into the function , the inverse function of , to recover the information data blocks. This processing can be expressed by the following equations:

It then follows that the estimate of the block can be obtained as .

3. Bit Error Probability for HODFH

In HODFH system, the input bit stream is carried by hopping frequency and its phase. So, firstly, we analyze hopping frequency symbol error probability and phase symbol error probability, respectively, and then deduce the bit error rate (BER) of the HODFH.

3.1. Symbol Error Probability

Firstly, we analyze the hopping frequency symbol error probability. Based on the receiver design in HODFH, analysis of the hopping frequency symbol error probability is analogous to that of noncoherent FSK demodulation. For noncoherent detection of -ary FSK signals, the probability of symbol error is given by [8, eqn. (5-4-46), page 310]:where is the SNR per symbol. For a HODFH system with frequencies, . Let denote the probability of the hopping frequency symbol detection error (corresponding to the symbol error in FSK) in HODFH; then we havewhere is the SNR of hopping frequency per symbol.

Next, we focus on the phase symbol error probability. The phase symbol error probability can be calculated in a similar manner as that of the -ary PSK. The probability of phase symbol error probability is given by [8, eqn. (5-2-56) & (5-2-55), page 268]:

For a HODFH system, signal phase detection is implemented at the condition that the hopping frequency is detected correctly, for which the probability is ; the probability of phase symbol error can be calculated as that of the -ary PSK. Let denote the probability of the phase symbol detection error (corresponding to the symbol error in PSK). Recall that there are possible phases in each hopping frequency; we havewhere is the SNR of phase per symbol and it will be substituted in (11) when we calculate .

Only when the hopping frequency and the phase are detected correctly, the transmitted signal can be estimated correctly. Since, in a HODFH system, the transmitted signal carries the frequency and phase information, the SNR of the hopping frequency per symbol is the same as the SNR of the phase; that is, . We denote the SNR per symbol by . The overall symbol error probability of the HODFH scheme is calculated as the combination of and , defined as , which can be found in

3.2. Bit Error Probability

It is reasonable to assume that the probability of the index estimated incorrectly is inversely proportionate to the number of elements at the dimensionality, when the symbol error occurs. Let be the error probability of the dimensional index; we have

For the first order bits , it is only decided by and . The correct probability of is equal to the symbol correct probability . Recall that there are bits at the first order. The BER of the first order bits, denoted as , is obtained:

For the order bits , it is decided by and . Only the and are estimated correctly; the information bits can be recovered correctly. Assume that the error probability of and is independent. This is insured by the processing of reshaping the 1-dimensional set into -dimensional set . Let be the correct probability of the and the dimensional index simultaneity; we have

Recall that there are bits at the order. The BER of the order bits, denoted as , is obtained:

Therefore, the total BER of a HODFH system, denoted as , can be obtained as

Since , (18) can be transformed as

We assume that one symbol not correctly detected will incur the dimensional index being not correctly estimated. That is to say, and will satisfy the following equations:

Substitute (20) into (15) and (17); the uniform of the upper bound of BER for the first and the order bits, denoted as , can be obtained as

When the symbol error probability is small enough, the bit error probability can be approximated as

Substitute (22) into (19); the upper bound of total BER for the HODFH system is obtained

The lower bound of total BER, denoted as , can be obtained by assuming that the symbol error only incurs bits error in that hopping. The error probability of the dimensional index is expressed as (14), and the dimensional index error only incurs the order bits. Therefore, the lower bound of total BER is

To summarize our discussions above, we have the following.

Proposition. In HODFH, the total BER, , is bounded by

3.3. Further Discussions about Bit Error Probability

Recall that there are available frequencies for the HODFH system, and they distribute in broad band. It only occupies narrow band, centered at ), available frequencies at any given moment. The SNR usually is unequal at each narrow band. In this occasion, the symbol error probability of the frequency and phase cannot be simply calculated by (9) and (12). The symbol correct decision probability of the frequency can be deduced by [8, eqn. (5-4-41), page 309]. Because the random variables are statistically independent and identically distributed and we assume that the signals centered at the available frequencies have equal energy and different noise, the probability can be expressed aswhere is the variance of the AWGN at frequency and

Substitute (27) into (26); we obtain the general probability

We have known that, in a HODFH system, signal phase detection is implemented at the condition that the hopping frequency centred at is detected correctly, for which the probability is ; the probability of phase symbol error can be calculated as (10) and (11), but the SNR of phase per symbol will be substituted by , which is the SNR at frequency . Let denote the probability of the phase symbol detection error at frequency . In this occasion, the overall symbol error probability of the HODFH scheme is calculated by where the is the probability that the signals centered at frequency and the all equal . Substitute the probability by in (16) and (17); we can calculate the total BER of a HODFH system by (18) when it works in the occasion that the available frequencies distribute in broad band and the SNR is not equal at each narrow band centered at .

4. Simulation Results

Without loss of generality, in this paper, the HODFH system in the AWGN channel with equal SNR at anywhere was simulated and its bit error rate (BER) performance was analyzed.

Example 1. BER performance of the HODFH system in AWGN channel: the performance of BER at the information rates of 9600 bps, 19200 bps, and 28800 bps in AWGN channel was compared. For the information rate of 9600 bps, , , , and . For the information rate of 19200 bps, , , , and . For the information rate of 28800 bps, , , , , and .

Figure 4 is the BER performance of the HODFH system in AWGN channel. The requirement for the energy-per-bit noise rate () becomes lower when the information rate increases. In practice, it is usually possible that only the energy-per-symbol noise rate () can be measured. According to formula ( is the number of bits per symbol), convert to , and then the higher is required for the higher information rate, which is reasonable.

Example 2. The BER performance of information rate 28800 bps at different number of phases: assume and . The numbers of available frequencies are 64, 32, and 16; the numbers of phases are 4, 8, and 16, respectively.

As seen in Figure 5, when more phrases are used while keeping the information rate the same, there is poorer performance for the HODFH system. It will spend about 6 dB extra to obtain the same BER performance of when the number of phases increases from 8 to 16. Therefore, the number of phases should be kept to a minimum, if the number of transmission signals has reached the requirements.

Example 3. The BER performance of the HODFH system and the conventional DFH (CDFH) system: for the information rate of 9600 bps, the HODFH system has the following parameters: , , , and ; for the information rate of 19200 bps, it has parameters: , , , and . The CDFH has the following parameters: for information rate of 9600 bps, and ; for information rate of 19200 bps, and .

Figure 6 shows the BER performance comparison of the HODFH system and the conventional DFH system for information rates of 9600 bps and 19200 bps. At the same information rate, the HODFH system has a better BER performance than the conventional DFH system. The higher information rate is, the higher gain is obtained by the HODFH system when compared to the conventional DFH system.

Example 4. Compare the BER performances of the HODFH system at three information rates (9600 bps, 19200 bps, and 28800 bps) with the theoretical BER performance of QPSK, 8PSK, 16PSK, 32PSK, and 64PSK. Assume the HODFH system has the following parameters, respectively. For the information rate of 9600 bps, , , , and . For the information rate of 19200 bps, , , , and . For the information rate of 28800 bps, we have three combinations; the first is , , , and , the second is , , , and , and the third is , , , and .

Figure 7 presents the BER performance of the HODFH system and the theoretical BER performance of QPSK, 8PSK, 16PSK, 32PSK, and 64PSK. When the information rate is 9600 bps, the HODFH system carries two bits of information per hop (symbol), which is the same as the QPSK; the BER performance of the HODFH system is worse than the QPSK. When the information rate is 19200 bps, the HODFH system carries four bits of information per hop (symbol), which is the same as the 16PSK, but it has better BER performance than the 16PSK. When the information rate is 28800 bps, the HODFH system carries six bits of information per hop (symbol), which is the same as the 64PSK, but its performance is much better than the 64PSK no matter how many phases are used by the HODFH system. The BER performance of the HODFH system is better than the M-PSK when the information rate is high. The carrier frequencies of the HODFH systems are used to transmit information; the HODFH systems have higher information rate without extra cost on power and do not need extra cost on power, when the numbers of phases adopted by the HODFH systems and the M-PSK are equal. The HODFH systems have better BER performance at the same energy-per-bit noise rate compared to the PSK.

Example 5. Compare the BER performance of information rate 19200 bps at the occasion that the SNR is equal and unequal at each narrow band. Assume that the SNRs at narrow bands are different with the SNRs at the other narrow bands. Use to denote the difference among the SNRs. The increases from 2 to 8 by increment 2. Use the average SNR in the broad band as the symbol signal-to-noise ratio. The HODFH system has the following parameters: , , , and .

Example 6. Compare the BER performance of information rate 28800 bps at different number of phases when the SNR difference and 6. The SNR is similar as Example 5. The HODFH system has the following parameters: , , , and 4, 8, and .

As seen in Figure 8, the BER performance is worse when the SNR is unequal at each narrow band, despite the average SNR of the unequal signal-to-noise ratio broad band being the same as the SNR of the equal signal-to-noise ratio. As the difference of the SNRs is increasing, the performance is degraded.

Figure 9 shows that the BER performance is degraded when the number of phases used by the HODFH system increases. This recalls the conclusion in Example 2 that the number of phases should be kept to a minimum, if the number of transmission signals has reached the requirements.

5. Summary

In the future, communication will have higher information rate requirements, and this paper proposed a solution for this with a novel differential frequency hopping, high order differential frequency hopping method. This was done by conumbering the frequencies and their phases, so that the system information rate was improved without having to increase the frequency resources. The BER performance of the HODFH system is better than the conventional DFH system and M-PSK in the AWGN channel. In this work, the number of phases can be adjusted to match the channel conditions to obtain the optimal performance.

Although using phases to expand the signal set can improve the bandwidth efficiency, their introduction of the phases makes the HODFH system more sensitive to frequency offset and timing errors. That is to say, implementation of this system is more complex, but it is a price worth paying for the information rate improvement and increased performance.

Conflict of Interests

The authors declare that there is no conflict of interests regarding the publication of this paper.