1 Introduction

Transform domain communication system (TDCS) was proposed by the U.S. Air Force Institute of Technology (AFIT) in 1990s. With its unique anti-interference theory, low probability intercept (LPI) and low probability detection (LPD) performance, TDCS has attracted widespread attention in many fields, such as in aeronautical communications and satellite communications [1, 2], etc. A huge number of researches have already been carried out in this field. For instance, the flexible spectrum access and multiple access of TDCS are analyzed in [3, 4] and [5], providing theoretical bases for applications. For the problem that the peak-to-average ratio of the basis function is large, schemes are proposed for improvement in [6] and [7], promoting the system LPI and LPD effectively. The accurate receiving strategy in TDCS which increases the bit error rate (BER) performance and reduces the system complexity is studied in [8].

With the development of research, traditional modulation and demodulation techniques with low spectrum efficiency can no longer meet the real-time requirement for information transmission in modern communication systems. Thus, it is increasingly urgent to design an efficient and reliable modulation technique. In TDCS, the basis function is used as the modulating waveform [9]. At present, the main modulation techniques in TDCS are bipolar modulation and cyclic shift keying (CSK). As a simple modulation scheme, bipolar modulation flips the basis function, and employs different code elements to represent positive and negative energy respectively. The technique has a simple demodulation procedure and good BER performance. However, in bipolar modulation every sending waveform can only transmit a bit of binary information, leading to extremely low transmission efficiency. CSK is developed from cyclic code shift keying (CCSK) [10]. Its sending waveform set is produced by different shifts of the basis function. It improves low spectrum efficiency to a certain extent, yet its information bits are exponential to demodulation complexity. Demodulation efficiency is getting lower with the increase in the amount of information.

For problems existing in bipolar modulation and CSK, some studies on modulation technique with high spectrum efficiency for TDCS have emerged recently. In [11], a sending waveform set including more waveforms is acquired through permutation and combination of the waveforms in the orthonormal waveform set of CSK. Although the spectrum efficiency is improved, it is difficult to be used in engineering due to huge demodulation cost. In [12], a modulation technique based on cluster is presented. After spectrum sensing, the entire unoccupied spectrum are averagely divided into several clusters, and orthogonal modulating waveforms are generated. The technique also improves spectrum efficiency, yet the allocation principle of random allocation modulation scheme is not described in detail, which makes it less applicable. The above techniques only detect maximum correlation value of real part in received waveform, and discard the imaginary part directly in demodulation. For this problem, a joint modulation method of real and imaginary part of the modulating waveform is proposed in [13]. Spectrum efficiency is doubled by the method, but it reduces the orthogonality of waveforms and leads to BER increase.

Due to the drawbacks exist in the above modulation and demodulation schemes, we are motivated to design a novel double modulation technique with high spectrum efficiency for TDCS. The double modulation technique includes two stages, namely the modular CSK and modular bipolar sequently. Furthermore, two demodulation methods are presented, and performance for the methods is simulated and analyzed under different signal-to-noise ratio (SNR) and interference-to-noise ratio (INR). Results verify the effectiveness and reliability of the modulation technique on information transmission with high spectrum efficiency. The contribution of the paper can be summarized as follows. On one hand, a novel double modulation technique with high spectrum efficiency for TDCS is proposed, and the principle and process of the technique is described in detail. On the other hand, two demodulation schemes for the proposed modulation technique are presented, and their BER performance is analyzed respectively.

The remaining of the paper is organized as the following. In Sect. 2, we give a review on the principle of TDCS. In Sect. 3, the double modulation technique is described in detail, and its spectrum efficiency is analyzed. In Sect. 4, we provide two corresponding demodulation methods. Simulations are performed to verify the effectiveness of the proposed method in Sect. 5. Finally, we conclude the paper in Sect. 6.

2 Review on TDCS

TDCS is a broadband communication system. Its principle can be summarized as: the interference spectrum is eliminated in the transform domain, and a noise-like basis function is generated and used to modulate the information bits in order to achieve the goals of anti-interference, LPI and LPD. The main principle of TDCS is shown in Fig. 1.

Fig. 1.
figure 1

Principle of TDCS.

A basis function is employed to modulate information in TDCS. When subcarrier number is \( N \), the discrete basis function in time domain can be expressed as

$$ b(n) = \frac{1}{N}\sum\limits_{k = 1}^{N - 1} C A_{k} e^{{j\theta_{k} }} e^{j2\pi kn/N} $$
(1)

Where \( C \) is the adjusting factor of amplitude, \( A_{k} \) is the amplitude spectrum vector, \( e^{{j\theta_{k} }} \) is the pseudo-random phase, and \( e^{j2\pi kn/N} \) is the coefficient of inverse discrete Fourier transform (IDFT). The basis function in frequency domain is derived through the tagged amplitudes in frequency domain mapping to random phases distributed averagely on \( [0,2\pi ] \). And the basis function in time domain is the inverse transform of that in frequency domain. Thus, it can be regarded as a noise-like sequence with \( N \) points, and has a good correlation performance. Its correlation function can be expressed as

$$ \begin{aligned} & R(m) = \sum\limits_{m = - (N - 1)}^{N - 1} {b(n + m)b^{ * } (n)} \\ & = \sum\limits_{m = - (N - 1)}^{N - 1} {\frac{{C^{2} }}{{N^{2} }}\sum\limits_{k = 1}^{N - 1} {A_{k}^{2} } e^{{j(\theta_{k} - \theta_{k}^{'} )}} e^{{j\left( {\frac{2\pi kn}{N} - \frac{2\pi k(n + m)}{N}} \right)}} } \\ \end{aligned} $$
(2)

When \( m = 0 \), the auto-correlation function reaches the maximum value. When \( N = 512 \), the correlation performance of the basis function is shown in Fig. 2.

Fig. 2.
figure 2

Correlation performance of the basis function in TDCS.

3 Double Modulation Technique

3.1 Modular CSK

Since the basis function has a good correlation property, its waveforms through different time shifts have strict orthogonality. M-CSK is the cyclic shift of the basis function with the same step-length, and can be represented as

$$ \begin{aligned} & s_{i} (n) = b(n - \frac{(i - 1)T}{M})_{T} \, \\ & { = }\frac{1}{N}\sum\limits_{k = 1}^{N - 1} C A_{k} e^{{j\theta_{k} }} e^{j2\pi kn/N} e^{{ - \frac{{j\pi S_{i} k}}{M}}} \\ \end{aligned} \begin{aligned} ,\,\;i \in \left( {1,M} \right) \hfill \\ \hfill \\ \end{aligned} $$
(3)

From another point of view, the basis function with length N can be divided averagely into M modules before modulation, denoted as \( b_{1} \), \( b_{2} \),…, \( b_{M} \) respectively. The length of every module is \( N/M \). The same waveform set as that in M-CSK can be derived by the cyclic shifts of the M modules in sequence. At this time every waveform can represent k bits information (\( M = 2^{k} \)). The process of the modular CSK is shown in Fig. 3.

Fig. 3.
figure 3

Process of the modular CSK.

After the cyclic shift, the waveforms are mutually orthogonal in the waveform set. If the energy of the sending waveform is \( \sqrt \varepsilon \), the energy distance between different waveforms is \( \sqrt {2\varepsilon } \). Let \( \varepsilon_{1} \), \( \varepsilon_{2} \),…, \( \varepsilon_{M} \)denote the energy of every module respectively, and the set of modular CSK waveforms can be represented as

$$ \begin{array}{*{20}c} {\begin{array}{*{20}c} {} \\ {s_{1} } \\ \end{array} } \\ {\begin{array}{*{20}c} {\begin{array}{*{20}c} {s_{2} } \\ {} \\ \end{array} } \\ {s_{M} } \\ \end{array} } \\ \end{array} \begin{array}{*{20}c} {\begin{array}{*{20}c} {} \\ = \\ \end{array} } \\ {\begin{array}{*{20}c} {\begin{array}{*{20}c} = \\ {} \\ \end{array} } \\ = \\ \end{array} } \\ \end{array} \overbrace {{\begin{array}{*{20}c} {(\sqrt \varepsilon ,0, \cdots ,0)} \\ {(0,\sqrt \varepsilon , \cdots ,0)} \\ {\begin{array}{*{20}c} \vdots \\ {(0, \cdots ,0,\sqrt \varepsilon )} \\ \end{array} } \\ \end{array} }}^{N}\begin{array}{*{20}c} {\begin{array}{*{20}c} {} \\ = \\ \end{array} } \\ {\begin{array}{*{20}c} {\begin{array}{*{20}c} = \\ {} \\ \end{array} } \\ = \\ \end{array} } \\ \end{array} \overbrace {{\begin{array}{*{20}c} {(\varepsilon_{1} ,\varepsilon_{2} , \cdots ,\varepsilon_{M} )} \\ {(\varepsilon_{M} ,\varepsilon_{1} , \cdots ,\varepsilon_{M - 1} )} \\ {\begin{array}{*{20}c} \vdots \\ {(\varepsilon_{2} , \cdots ,\varepsilon_{M} ,\varepsilon_{1} )} \\ \end{array} } \\ \end{array} }}^{N} , $$
(4)

3.2 Modular Bipolar Modulation

From (4), in the waveform set derived from the modular CSK, modules corresponding to any two waveforms are all mutually orthogonal. Hence, we can take full use of the orthogonality to achieve the second modulation. Every successive \( \xi \) modules in M modules of the CSK waveform are recombined to derive \( \gamma \) new modules. Thus, \( \gamma = M/\xi \). Let \( s_{i1} (n) \), \( s_{i2} (n) \),…, \( s_{i\gamma } (n) \) denote the new modules respectively. The length of every new module is \( N\xi /M \), and any two modules are mutually orthogonal. When \( \xi \;{ = }\;2 \), the new modules are shown in Fig. 4.

Fig.4
figure 4

Combination of modules when \( \xi \;{ = }\;2 \).

We modulate every new module with bipolar modulation, and denote different information bits by its positive and negative energy, namely,

$$ s_{ij} (n) = \left\{ {\begin{array}{*{20}c} {s_{ij} (n), \text{if information is}\,0} \\ { - s_{ij} (n), \text{if information is}\,1} \\ \end{array} } \right. , $$
(5)

Through the modular bipolar modulation, the sending waveform set can be expressed as

$$ \begin{array}{*{20}c} {\begin{array}{*{20}c} {} \\ {s_{1} } \\ \end{array} } \\ {\begin{array}{*{20}c} {\begin{array}{*{20}c} {s_{2} } \\ {} \\ \end{array} } \\ {s_{M} } \\ \end{array} } \\ \end{array} \begin{array}{*{20}c} {\begin{array}{*{20}c} {} \\ = \\ \end{array} } \\ {\begin{array}{*{20}c} {\begin{array}{*{20}c} = \\ \vdots \\ \end{array} } \\ = \\ \end{array} } \\ \end{array} \overbrace {{\begin{array}{*{20}c} {(( - 1)^{{s^{1} }} (\varepsilon_{1} + \varepsilon_{2} ),( - 1)^{{s^{2} }} (\varepsilon_{3} + \varepsilon_{4} ), \cdots ,( - 1)^{{s^{j} }} (\varepsilon_{M - 1} + \varepsilon_{M} ))} \\ {(( - 1)^{{s^{1} }} (\varepsilon_{M} + \varepsilon_{1} ),( - 1)^{{s^{2} }} (\varepsilon_{2} + \varepsilon_{3} ), \cdots ,( - 1)^{{s^{j} }} (\varepsilon_{M - 2} + \varepsilon_{M - 1} ))} \\ {\begin{array}{*{20}c} \vdots \\ {(( - 1)^{{s^{1} }} (\varepsilon_{2} + \varepsilon_{3} ), \cdots ,( - 1)^{{s^{j - 1} }} (\varepsilon_{M - 2} + \varepsilon_{M - 1} ),( - 1)^{{s^{j} }} (\varepsilon_{M} + \varepsilon_{1} ))} \\ \end{array} } \\ \end{array} }}^{N} , $$
(6)

Where \( s^{1} \), \( s^{2} \),…, \( s^{j} \) denote the information bit 0 or 1 after the modular bipolar modulation of the sending waveform. 0 represents the positive energy of the module, and 1 represents the negative energy of the module. \( \varepsilon_{1} + \varepsilon_{2} \), \( \varepsilon_{2} + \varepsilon_{3} \),… denote the energy of every module through recombination, and its energy is \( {1 \mathord{\left/ {\vphantom {1 \gamma }} \right. \kern-0pt} \gamma } \) of the waveform energy.

3.3 Spectrum Efficiency

For the modular CSK, every waveform can denote k bits information. For the communication system with symbol rate \( R_{s} \), the bit transmission rate is

$$ R_{b} = R_{s} \log_{2} M\;{ = }\;\frac{{\log_{2} M}}{{T_{s} }} , $$
(7)

Where \( T_{s} \) is the symbol period. Then, \( \gamma \) bits information is modulated with bipolar modulation with \( \gamma \) modules. After modulation, the bit transmission rate can be expressed as

$$ R_{b} = R_{s} (\log_{2} M + \gamma )\;{ = }\;\frac{{\log_{2} M + \gamma }}{{T_{s} }} , $$
(8)

The symbol period is \( T_{s} = {1 \mathord{\left/ {\vphantom {1 {\Delta f}}} \right. \kern-0pt} {\Delta f}} \), and \( K_{used} \) is the number of available subcarrier. Thus, the signal bandwidth is

$$ W_{used} = K_{used} \cdot \Delta f , $$
(9)

According to the definition in 9, the spectrum efficiency of the modulation in this paper can be expressed as

$$ \eta { = }\frac{{R_{b} }}{{W_{used} }} = \frac{{R_{s} \cdot (\log_{2} M + \gamma )}}{{K_{used} \cdot \Delta f}} = \frac{{\log_{2} M + \gamma }}{{K_{used} }} , $$
(10)

Therefore, compared with CSK, the spectrum efficiency has been improved \( \frac{\gamma }{{K_{used} }} \).

4 Double Modulation Technique

Through two times modulations, the shift property and local turnover property of the modulating waveform have both been changed. For the demodulation of the sending waveform, both of the properties have interacted with each other. The turnover property is based on the shift property, and the shift property can be extracted simultaneously when the local turnover is exact. In this section, we proposed two demodulation schemes, and analyze their BER performance.

4.1 Csk-Bipolar Demodulation

Double modulating waveform is the combination of modular cyclic shift of the basis function and bipolar modulation. Firstly the order of the cyclic shift is demodulated, and then the sending information is recovered through modular bipolar demodulation. The demodulation flow is shown in Fig. 5.

Fig. 5.
figure 5

Flow of CSK-bipolar demodulation.

For the sending waveform \( s_{i} \), the demodulation model of the modular CSK order for the received waveform \( r \) can be expressed as

$$ a = \hbox{max} \left\{ {r \cdot \left[ {\begin{array}{*{20}c} {s_{1,1}^{ * } } & {s_{1,2}^{ * } } & \cdots & {s_{{1,2^{\gamma } }}^{ * } } \\ {s_{2,1}^{ * } } & \ddots & {} & {s_{{2,2^{\gamma } }}^{ * } } \\ \vdots & {} & \ddots & \vdots \\ {s_{M,1}^{ * } } & {s_{M,2}^{ * } } & \cdots & {s_{{M,2^{\gamma } }}^{ * } } \\ \end{array} } \right]} \right\} , $$
(11)

Where \( a \)is the order when the correlation demodulation of every waveform in the waveform set is maximum. The row number of the matrix represents the dimension \( M \)of the modular CSK orthogonal waveform set, and the column number of the matrix represents \( 2^{\gamma } \) kinds of waveform when the energy of \( \gamma \) modules are positive or negative values respectively in the same modulating waveform. When the received waveform is demodulated using (11), every waveform needs \( M \cdot 2^{\gamma } \) times waveform correlation operations. The computing costs too much for engineering applications.

From (6), we can observe that modular bipolar modulation of the sending waveform does not change the orthogonality between each module. Thus, in the modular CSK demodulation of signal, positive or negative state of every module can be ignored. Thereby, the demodulation of the sending waveform can be simplified to a pure CSK demodulation. Assuming the sending signal is \( s_{1} \), the received signal can be expressed as

$$ r = (\sqrt \varepsilon + n_{1} ,n_{2} , \cdots ,n_{M} ) , $$
(12)

Where \( n_{1} \), \( n_{2} \),…, \( n_{M} \) are Gaussian white noise with mean value 0 and variance \( \frac{{N_{0} }}{2} \). (11) can be simplified as in [14]

$$ \begin{aligned} & a = \hbox{max} (r \cdot s_{i}^{*} ) = \hbox{max} \left\{ {r \cdot \left[ {\begin{array}{*{20}c} {\sqrt \varepsilon ,0, \cdots ,0} \\ {\begin{array}{*{20}c} {0,\sqrt \varepsilon , \cdots ,0} \\ {\begin{array}{*{20}c} \vdots \\ {0, \cdots ,0,\sqrt \varepsilon } \\ \end{array} } \\ \end{array} } \\ \end{array} } \right]} \right\} \\ & = \sum\limits_{{}}^{{}} {} { \hbox{max} }\left\{ {\begin{array}{*{20}c} {\varepsilon + \sqrt \varepsilon n_{1} } \\ \cdots \\ {\sqrt \varepsilon \cdot n_{M} } \\ \end{array} } \right\} \\ \end{aligned} , $$
(13)

Let \( z_{i} = r \cdot s_{i}^{ * } \), and the probability that the waveform is received correctly can be expressed as in [14]

$$ \begin{aligned} P_{a} & \; = \;P(z_{1} > z_{2} ,z_{1} > z_{3} , \cdots ,z_{1} > z_{M} |s_{1} send) \\ & { = }\;P(\sqrt \varepsilon + n_{1} > n_{2} ,\sqrt \varepsilon + n_{1} > n_{3} , \cdots ,\sqrt \varepsilon + n_{1} > n_{M} |s_{1} send) \\ & { = }\;P(\sqrt \varepsilon + n > n_{2} ,\sqrt \varepsilon + n > n_{3} , \cdots ,\sqrt \varepsilon + n > n_{M} |s_{1} send,n_{1} = n) \\ & = \;\int_{ - \infty }^{\infty } {(P(\sqrt \varepsilon + n > n_{2} |s_{1} send,n_{1} = n))}^{M - 1} \cdot p_{{n_{1} }} (n){\text{d}}n \\ \end{aligned} , $$
(14)

Where \( P(\sqrt \varepsilon + n > n_{2} |s_{1} send,n_{1} = n){ = }1 - Q(\frac{n + \sqrt \varepsilon }{{\sqrt {N_{0} /2} }}) \), and \( p_{{n_{1} }} (n){ = }\frac{1}{{\sqrt {\pi N_{0} } }}e^{{ - \frac{{n^{2} }}{{N_{0} }}}} \).

Assuming through the modular bipolar modulation the probability of information bit 0 is equal to that of 1, the decision threshold in bipolar demodulation can be set to 0. The probability of a correct decision in a module can be expressed as

$$ P_{b} = 1 - Q\left( {\sqrt {2\sqrt \varepsilon /\gamma N_{0} } } \right) , $$
(15)

Therefore, the probability that the sending waveform is correctly received absolutely is

$$ P = \frac{k}{k + \gamma }P_{a} + \frac{\gamma }{k + \gamma }P_{a} \cdot (P_{b} )^{\gamma } , $$
(16)

4.2 Bipolar-CSK Demodulation

For the sending waveform \( s_{i} \), if every module \( s_{ij} \) can be received correctly, \( s_{i} \) will also inevitably be received correctly. Therefore, firstly the \( \gamma \) modules in the received waveform can be bipolar-based demodulated respectively, and count the modulation order of every module simultaneously. The maximum order in statistic result will be regarded as modular CSK order. The demodulation flow is shown in Fig. 6.

Fig. 6.
figure 6

Flow of bipolar-CSK demodulation.

In the modular bipolar demodulation of any received waveform \( r \), every module is demodulated by the correlation demodulation of the corresponding module in M waveforms. Let \( r_{1} \) denote the first module of the received waveform, and the demodulation model can be expressed as

$$ \left[ {a,b} \right] = \hbox{max} \left\{ {r_{1} \cdot \left[ {\begin{array}{*{20}c} {\begin{array}{*{20}c} {s_{1,1}^{ * } } \\ {\begin{array}{*{20}c} {s_{2,1}^{ * } } \\ {\begin{array}{*{20}c} \vdots \\ {s_{M,1}^{ * } } \\ \end{array} } \\ \end{array} } \\ \end{array} } & {\begin{array}{*{20}c} { - s_{1,1}^{ * } } \\ {\begin{array}{*{20}c} { - s_{2,1}^{ * } } \\ {\begin{array}{*{20}c} \vdots \\ { - s_{M,1}^{ * } } \\ \end{array} } \\ \end{array} } \\ \end{array} } \\ \end{array} } \right]} \right\} , $$
(17)

Where \( a \in (1,2, \cdots ,M) \) and \( b \in (1,2) \) represent the maximum dimension number and column number of the demodulation matrix, respectively. \( s_{i,1}^{ * } \) is the conjugate of the first module in the sending waveform set. As only the maximum real parts of the correlation receiver are detected in demodulation, and the real parts of \( r_{1} s_{i1}^{ * } \) and \( - r_{1} s_{i1}^{ * } \) are the opposite of each other, (17) can be expressed as

$$ \begin{aligned} & a = \hbox{max} \left[ {\begin{array}{*{20}c} {\left| {r_{1} s_{1,1}^{ * } } \right|} & {\left| {r_{1} s_{2,1}^{ * } } \right|} & \cdots & {\left| {r_{1} s_{M,1}^{ * } } \right|} \\ \end{array} } \right]^{T} \bigcap b \\ & = \hbox{max} \left[ {(r_{1} s_{1,1}^{ * } ) > ( - r_{1} s_{1,1}^{ * } )} \right] \\ \end{aligned} , $$
(18)

Only when \( a \) and \( b \) are both solved correctly, the first module of the received waveform will be demodulated correctly. From (6), we can get that \( s_{{_{1,1} }}^{ * } \), \( s_{2,1}^{ * } \), …, \( s_{M,1}^{ * } \)are \( M \) orthogonal waveform vectors. Therefore, the model for solving \( a \) can be changed to

$$ a = \hbox{max} \left[ {r_{1} \cdot \left( {\begin{array}{*{20}c} {{{\sqrt \varepsilon } \mathord{\left/ {\vphantom {{\sqrt \varepsilon } \gamma }} \right. \kern-0pt} \gamma },0, \cdots ,0} \\ {0,{{\sqrt \varepsilon } \mathord{\left/ {\vphantom {{\sqrt \varepsilon } \gamma }} \right. \kern-0pt} \gamma }, \cdots ,0} \\ \vdots \\ {0, \cdots ,0,{{\sqrt \varepsilon } \mathord{\left/ {\vphantom {{\sqrt \varepsilon } \gamma }} \right. \kern-0pt} \gamma }} \\ \end{array} } \right)} \right] , $$
(19)

Where \( {{\sqrt \varepsilon } \mathord{\left/ {\vphantom {{\sqrt \varepsilon } \gamma }} \right. \kern-0pt} \gamma } \) is the energy of every module. Thus, the probability that \( a \) is judged correctly is

$$ P_{a} = \int_{ - \infty }^{\infty } {\frac{1}{{\sqrt {\pi N_{0} } }}\left[ {1 - Q(\frac{\gamma n + \sqrt \varepsilon }{{\gamma \sqrt {N_{0} /2} }})} \right]}^{M - 1} e^{{ - \frac{{n^{2} }}{{N_{0} }}}} dn , $$
(20)

Assuming through the modular bipolar modulation the probability of information bit 0 is equal to that of 1, the decision threshold for solving \( b \) can be set to 0. The probability for correct decision is

$$ P_{b} = 1 - Q\left( {\sqrt {2\sqrt \varepsilon /\gamma N_{0} } } \right) , $$
(21)

The demodulation of every module in the same received waveform is independent. The probability for correct decision on the bipolar modulation of any module is

$$ P_{one} = P_{a} P_{b} , $$
(22)

For the sending waveform \( s_{1} \), the order decision result of any module is \( a \in (1,2, \cdots ,M) \). For a single module, the probability of correct decision on orders is \( P_{a} \). The possibility number of error decision is \( M - 1 \), and thus the probability that the order is misjudged as \( i \) can be expressed as \( \frac{{1 - P_{a} }}{M - 1} \). The decisions on the CSK order are statistics of the decision on each module order, and the decisions of different modules are independent and have equal probability. When the correct decision probability \( P_{a} \) of a single module order is larger than any error decision probability \( \frac{{1 - P_{a} }}{M - 1} \), the decision on CSK order is correct, namely

$$ P_{csk} = P(P_{a} > \frac{{1 - P_{a} }}{M - 1}) , $$
(23)

In summary, the probability that the sending waveform is received completely correctly is

$$ P = \frac{k}{k + \gamma }P_{csk} + \frac{\gamma }{k + \gamma }(P_{a} P_{b} )^{\gamma } , $$
(24)

5 Simulations

In simulations, the system bandwidth is 10MHz, the subcarrier number is 512, and the amount of information is \( 10^{8} \) bits.

5.1 BER

We denote the CSK with \( k = 4 \) as CSK-4, where \( k \) represents the admissible number of information bits in CSK, and \( M = 2^{k} \). The CSK-bipolar demodulation with \( k = 4 \) and \( \gamma = 2 \), and the bipolar-CSK demodulation with \( k = 4 \) and \( \gamma = 2 \), are represented by CSK-bipolar-4-2 and bipolar-CSK-4-2, respectively. When \( k \) is 4, 5, 6, \( \gamma \) is 2, 4, 8, and the jamming-to-signal power ratio (JSR) is 5 dB, the BER performance under different SNR is shown in Fig. 7.

Fig. 7.
figure 7

BER under different SNR.

From Fig. 7, we can acquire that when the received waveform is CSK-bipolar based demodulated, the BER decreases with the increase of \( k \), and increases with the increase of \( \gamma \). The reason lies in the error accumulation of different modules in the modular bipolar demodulation. Compared with CSK-bipolar demodulation, the BER in bipolar-CSK demodulation is higher, and its growth rate increases with the increase of \( \gamma \). Since the demodulation of received waveform order is based on the correct decision on every module order, BER rises with the increase of \( k \). Compared with CSK of the same \( k \), BER performance for both of the two demodulation schemes decrease with the increase of \( \gamma \).

When \( k = 5 \), \( \gamma \) is 2, 4, and 8 respectively, and SNR is 5 dB, BER with different JSR is shown in Fig. 8.

Fig. 8.
figure 8

BER under different JSR

From Fig. 8, it can be observed that with the increase of JSR, BER for direct sequence spread spectrum (DSSS) system decreases sharply. Nevertheless, TDCS eliminates interference spectrum in transform domain, and thus has a good anti-interference ability. Its BER increases slowly with the increase of JSR. Under the same simulation conditions, the ability of rejecting single-tone interference is better than that of rejecting LFM interference.

5.2 Spectrum Efficiency

We estimate the spectrum of single-tone interference by FFT, and its normalized power spectrum density (PSD) is shown in Fig. 9.

Fig. 9.
figure 9

Normalized PSD of the single-tone interference

When the threshold is set to the peak value of 40%, the number of available subcarrier is 511, and the BER is \( 10^{ - 4} \), the spectrum efficiency and required SNR is shown in Fig. 10.

Fig. 10.
figure 10

Distribution of spectrum efficiency

From Fig. 10, we can know that compared to CSK, the spectrum efficiency of the double modulation technique is increasing continuously with the increase of \( \gamma \). Using the CSK-bipolar demodulation can bring a great improvement to spectrum efficiency at the cost of a little SNR performance. When adopting the bipolar-CSK demodulation, the improvement of spectrum efficiency costs more SNR.

6 Conclusions

In this paper, we proposed a novel double modulation technique with high spectrum efficiency for TDCS. We firstly analyzed the performance of the modulating waveform, and described the modulation flow in detail. Then we proposed two demodulation techniques for this modulation, and derived its mathematical expressions for its performance. Finally, we simulated the technique and analyzed its BER performance and spectrum efficiency with different SNR and JSR, verifying the reliability of information transmission when the two demodulation techniques cope with noises and interferences. Results show that CSK-bipolar demodulation can improve spectrum efficiency greatly at the cost of only a little SNR, while the same spectrum efficiency can be achieved at the cost of more SNR in bipolar-CSK demodulation.