Chaotic Pulse-Shaping Filter Based on Root-Raised-Cosine Division

Abstract

Chaotic baseband wireless communication system (CBWCS) suffers bit error rate (BER) degradation due to their intrinsic intersymbol interference (ISI). To this end, an ISI-free chaotic filter based on root-raised-cosine (RRC) division is constructed to generate a chaotic signal. A wireless communication system using this chaotic signal as a baseband waveform is proposed. The chaotic property is proved by the corresponding new hybrid dynamical system with topological conjugation to symbolic sequences and a positive Lyapunov exponent. Simulation results show that under a single-path channel and multi-path channel, the proposed method outperforms CBWCS in both BER performance and computational complexity.

1. Introduction

Chaos, as a deterministic system, exhibits quasi-random and unpredictable behavior from a simple but nonlinear rule. A number of characteristics of low-frequency broadband, sensitivity to initial values, and impulsive autocorrelation give chaos a good application prospect in the field of chaos-based physical-layer security [1,2,3,4,5]. In practice, chaos communication has been included in some communication standards. Many chaos-based modulation schemes have been proposed as promising solutions for the ultra-wide band radio standards in wireless personal area networks [6]. Frequency-modulated differential chaos shift keying (FM-DCSK) has been adopted as the standard IEEE 802.15.6 [7]. Furthermore, chaos has been applied in high-speed long-distance communication over a commercial fiber-optic channel [8]. However, for the high-rate narrowband wireless communication systems, such as Wi-Fi and cellular networks, there are few practical applications of chaos-based communications in the available literature. The main reasons are as follows. First, the coherent chaotic communication is difficult to be realized due to the difficulty of chaos synchronization between transmitters and receivers in multi-path time-varying channels. Second, the existing chaos-based wireless communications require complicated hardware and software support. Third, non-coherent chaotic communication, such as DCSK, requires a broadband spectrum, which is not applicable to wireless channels with limited-frequency bands. To overcome those problems, the chaotic transmission method in the universal narrowband wireless communication system framework needs to be explored.

Chaotic baseband wireless communication system (CBWCS), first proposed in [9], constructs chaotic signal as baseband waveform by using a special basis function as a pulse-shaping filter. A second-order linear system with an analytic solution provides the expression of the filter [10]. Its infinitely long and exponentially increasing precursor provides determinism and a positive Lyapunov exponent. Due to the invariance of the Lyapunov exponent over the wireless channel [11], CBWCS has excellent performance when communicating in the presence of bounded noise. At the receiver, instead of complex chaotic synchronization steps, a simple matched-filter structure corresponding to the pulse-shaping filter is used to maximize the signal-to-noise ratio (SNR) [12]. Thus, the whole scheme is easily implementable in the universal wireless communication platform [9,13,14,15].

Furthermore, the chaotic pulse is applicable to all scenarios where root-raised-cosine (RRC) can be used as a pulse-shaping filter. Ref. [16] used raised-cosine (RC) windowing to mitigate the effect of intercarrier interference in an orthogonal frequency division multiplexing system. Ref. [17] compared the performance of RC and RRC in filter bank multicarrier/offset quadrature amplitude modulation. In [18], RRC is used in a band-limited spatial modulation massive multi-input multi-output system. Ref. [19] presented an analysis of the influence of RC and RRC and their roll-off factors over the additive white Gaussian noise (AWGN) and the Rician fading channel on communication quality. A detailed analysis of generalized frequency division multiplexing performance under Hoyt-q, Weibull-v and log-normal shadowing fading channels with RC as a pulse-shape filter is represented in [20]. In all communication scenarios mentioned above with RC or RRC as a pulse-shaping filter, chaotic pulses can be applied.

However, the aforementioned pulse-shaping filter does not satisfy the Nyquist intersymbol interference (ISI) criterion. The presence of intrinsic ISI degrades system performance. Refs. [21,22] designed a threshold sequence in the symbol detection process to mitigate ISI from the filter itself and multi-path propagation. However, the threshold structure is complex, which requires high computational complexity in threshold calculation.

In this paper, we design a novel chaotic pulse-shaping filter to generate an ISI-free chaotic baseband waveform. Taking RRC as a starting point, an unequal division method is proposed, which can not only retain the ISI-free property of RC but also produce asymmetric pulses that provide the oscillatory nature of the chaotic signal. Firstly, the RRC pulse is divided into three parts, with the time when the amplitude first decays to zero as a division point. The first two parts are combined to construct an asymmetric pulse. The overall response of those pulses can still hit zero at symbol sampling instants, which meets the Nyquist ISI criteria, such as RC. Then, taking the proposed pulse as an analytical solution of differential equations, a new hybrid dynamical system is constructed with an infinitely long and exponentially increasing precursor. Its chaotic property is proved by the positive maximal Lyapunov exponent.

Implementing the proposed pulse as a shaping filter, a novel chaotic baseband wireless communication system is constructed. At the receiver, a mirrored copy of the transmitted pulse shaping as a matched filter is introduced, which avoids the complicated chaos synchronization between the transmitter and receiver. A corresponding threshold is calculated to relieve the ISI caused by multi-path propagation. Simulation results show that the bit error rate (BER) performance of the proposed method is very close to the lower bound of BER in a single-path AWGN channel. Under a multi-path channel, for BER = ${10}^{-3}$, the proposed method outperforms CBWCS by more than 2 dB when the threshold is zero. By setting optimal and suboptimal thresholds, the proposed method maintains a satisfactory BER, while the computational complexity of the threshold calculation is reduced by 52.5%.

The rest of this paper is organized as follows. Section 2 briefly reviews the RC and RRC filter. The division method and new dynamical system are presented in Section 3. In Section 4, a novel chaotic wireless communication system is constructed, and its performance is analyzed. Finally, conclusions are drawn in Section 5.

2. Backgrounds

In wireless communication systems, to maintain the minimum ISI, the overall responses of the transmit filter, channel response and receive filter have to satisfy Nyquist ISI criterion. The RC pulse has become the de facto standard, which has the impulse response

$$h_{rc}(t)=\left\{\begin{array}{ccc}\frac{\pi }{4}\frac{sin\left(\frac{\pi }{2\beta }\right)}{\frac{\pi }{2\beta }},\hfill & \hfill & t=\pm \frac{T_s}{2\beta },\hfill \\ \frac{sin\left(\frac{\pi t}{T_s}\right)}{\frac{\pi t}{T_s}}\frac{cos\left(\frac{\beta \pi t}{T_s}\right)}{1-{\left(\frac{2\beta t}{T_s}\right)}^2},\hfill & \hfill & \mathrm{otherwise},\hfill \end{array}\right.$$

(1)

where $\beta$ ($0<\beta \le 1$) is the roll-off factor, and $T_s$ is the reciprocal of symbol rate. Its frequency-domain description is a piecewise-defined function, given by:

$$\begin{array}{c}\hfill H_{rc}(f)=\left\{\begin{array}{ccc}1,\hfill & \hfill & \left|f\right|\le \frac{1-\beta }{2T_s},\hfill \\ \frac{1}{2}\left[1+cos\left(\frac{\pi T_s}{\beta }\left[\left|f\right|-\frac{1-\beta }{2T_s}\right]\right)\right],\hfill & \hfill & \frac{1-\beta }{2T_s}<\left|f\right|\le \frac{1+\beta }{2T_s},\hfill \\ 0,\hfill & \hfill & \mathrm{otherwise}.\hfill \end{array}\right.\end{array}$$

(2)

The total effective filter in the transmission system is the convolution of the transmit filter and receive filter and the convolution in time domain is equal to the multiplication in the frequency domain. Taking the square root of the RC filter in the frequency domain, we obtain the so-called RRC filter, which has the frequency response $H_{rrc}(f)$ as follows:

$$H_{rc}(f)=H_{rrc}(f)H_{rrc}(f),$$

(3)

or:

$$H_{rrc}(f)=\sqrt{|H_{rc}(f)|}.$$

(4)

The impulse response of RRC is written as:

$$\begin{array}{c}\hfill h_{rrc}(t)=\left\{\begin{array}{ccc}\frac{1}{T_s}\left(1+\beta (\frac{4}{\pi }-1)\right),\hfill & \hfill & t=0,\hfill \\ \frac{\beta }{T_s\sqrt{2}}\left[(1+\frac{2}{\pi })sin(\frac{\pi }{4\beta })+(1-\frac{2}{\pi })cos(\frac{\pi }{4\beta })\right],\hfill & \hfill & t=\pm \frac{T_s}{4\beta },\hfill \\ \frac{1}{1-{\left(\frac{4\beta t}{T_s}\right)}^2}\left[cos\frac{(1+\beta )\pi t}{T_s}+\frac{T_s}{4\beta t}sin\frac{(1-\beta )\pi t}{T_s}\right],\hfill & \hfill & otherwise.\hfill \end{array}\right.\end{array}$$

(5)

Unlike RC, the impulse response of RRC is not zero at intervals of $\pm T_s$. However, the combination of two RRC filters forms a RC pulse, which is zero at intervals of $\pm T_s$. Furthermore, since the filter is real-valued and symmetric, RRC is its own matched filter.

3. RRC-Divided Chaotic Filter

In this section, we first propose a RRC division scheme to obtain two asymmetric pulses. Their convolution result is compared with the standard RC waveform. Taking the impulse response of the novel filter as the basis function, one new hybrid dynamical system is derived. Its topological conjugation to a symbolic sequence and a positive Lyapunov exponent are proven.

3.1. RRC-Division Scheme

Since the RRC waveform attenuates symmetrically with $t=0$ as the center, taking the first zero crossing time $T_c$ as a division point (one positive and one negative), the waveform can be divided into three parts. $T_c$ can be calculated by:

$$\frac{1}{1-{\left(\frac{4\beta T_c}{T_s}\right)}^2}\left[cos\frac{(1+\beta )\pi T_c}{T_s}+\frac{T_s}{4\beta T_c}sin\frac{(1-\beta )\pi T_c}{T_s}\right]=0,$$

(6)

which is a function of the roll-off factor $\beta$ and symbol time $T_s$. Since Equation (6) has infinite solutions, there is no exact analytic solution for zero crossing time. Using fsolve in MATLAB to solve the nonlinear equation, a positive $T_c$ with various $\beta$ and $T_s$ can be obtained, as shown in Figure 1.

We can see that when $T_s$ is constant, $T_c$ decreases linearly with the growth of $\beta$. Thus, $T_c$ is a linear function of $T_s$. The intercept is $T_s$, and the slope of the function is $-0.25\beta$. Thus, $T_c$ can be derived as:

$$T_c=-0.25\beta T_s+T_s.$$

(7)

Since RRC is symmetric at $t=0$, taking $-T_c$ and $T_c$ as division points, the waveform of RRC can be divided into three parts. By multiplying the first part by two and then combining it with the second part, we can obtain an asymmetric basis function $p(t)$. By combining the second part with the third part by two, another asymmetric basis function $g(t)$ is derived.

From the points discussed above, the impulse responses of $p(t)$ and $g(t)$ are obtained as:

$$\begin{array}{c}\hfill p(t)=\left\{\begin{array}{ccc}2h_{rrc}(t),\hfill & \hfill & t<-T_c,\\ h_{rrc}(t),\hfill & \hfill & -T_c\le t\le T_c,\end{array}\right.\end{array}$$

(8)

$$\begin{array}{c}\hfill g(t)=p(-t)=\left\{\begin{array}{ccc}{h}_{rrc}(t),\hfill & \hfill & -T_c\le t\le T_c,\\ 2h_{rrc}(t),\hfill & \hfill & t>T_c,\end{array}\right.\end{array}$$

(9)

where $h_{rcc}$ is shown in Equation (5).

Figure 2 gives the basis function of Equations (8) and (9) with different $\beta$. It can be seen that a large value of $\beta$ results in fast sidelobe decay rates. Figure 3 compares the results of convolution of those two pulses and a theoretical RC pulse. Figure 3a shows the waveforms of two pulses in the time domain, and Figure 3b shows the corresponding frequency domain responses. Due to the approximation error of the division point, the frequency response is slightly jittery compared with the standard RC waveform. However, the ability to provide a zero crossing at the optimal sampling point of other pulse intervals is presented.

All the pulses satisfying the vestigial sideband criterion, namely, that the pulse spectrum has odd symmetry about the corresponding ideally bandlimited spectrum band edge, will be ISI-free. There are an infinite number of such pulses corresponding to different vestigial sidebands. The proposed division method is applicable to all those pulses with the implementation of zero crossing points.

3.2. Hybrid Dynamical System

Taking Equation (8) as the basis function and carrying out a linear convolution with the random bi-polar information symbol $s(t)$ as the analytical solution of the differential equation [23], we construct a new hybrid dynamical system to discuss the dynamic behavior of the generated chaotic signal, as follows:

$$\ddot{x}(t)-2B\dot{x}(t)+[B^2+{\pi }^2{(\beta +1)}^2]x(t)=As(t),$$

(10)

$$t\ddot{x}(t)-2Bt\dot{x}(t)+2\dot{x}(t)+[B^2+{\pi }^2{(\beta -1)}^2]tx(t)-2Bx(t)=s(t),$$

(11)

where $x(t)$, $\dot{x}(t)$ and $\ddot{x}(t)$ are the encoded signal and the first and second derivative of $x(t)$, respectively. In this dynamical system, $T_s$ is normalized to 1. The new hybrid dynamical system contains two linear differential equations. A chaotic signal can be obtained by summing the solutions of these two differential equations. Parameters A and B have two sets of values according to $\left|t\right|=\frac{T_s}{4\beta }$. For $\left|t\right|>\frac{T_s}{4\beta }$, $A=168e^{-3.755\beta }$, $B=4.8(t<0),-4.8(t>0)$, and for $\left|t\right|\le \frac{T_s}{4\beta }$, $A=6.5\times {10}^{-4}{e}^{13.63\beta }$, $B=-0.1(t<0),0.1(t>0)$.

The generated chaotic signal has an exact analytic solution given by:

$$x(t)=\sum _{m=-\infty }^{\infty }s(m)·p(t-m).$$

(12)

3.2.1. Topological Conjugation

For a communication system, the information symbols can be recovered from the received signal only if the encoding baseband waveform and the symbol sequence are topologically conjugated [9,24]. By defining ${\varphi }_m(t)=s(m)·p(t-m)$, we have:

$$x(t)=\sum _{m=-\infty }^{\infty }s(m)·p(t-m)=\sum _{m=-\infty }^{\infty }{\varphi }_m(t).$$

(13)

The sufficient conditions for the topological conjugation between the chaotic waveform $x(t)$ and driving symbols $s(m)(m=-\infty ,\dots ,+\infty )$ are [9]:

$Conditions$: For all $a,b\in A$, fixed constants $G,H>0$, and $\alpha ,\gamma >1$:

• $\left|{\varphi }_a(t)\right|<H{\alpha }^{-\left|t\right|}$;
• ${\varphi }_a(t)\ne {\varphi }_b(t)$ almost everywhere for $a\ne b$;
• $ma{x}_{a,b}\left|{\varphi }_a(t)-{\varphi }_b(t)\right|<G·{\gamma }^{-\left|t\right|}$, where $G\in \mathbb{R}$;
• ${min}_{a\ne b}{\int }_{0\le t<1}\left|{\varphi }_a(t)-{\varphi }_b(t)\right|\mathrm{d}t>{\int }_{t<0}{max}_{a,b}\mid {\varphi }_a(t)-{\varphi }_b(t)\mid \mathrm{d}t$.

Under the assumptions of $s(m)\in \{+1,-1\}$, the above conditions are satisfied. The proof is as follows:

For Condition 1, since the solution of differential Equation (11) $x(t)$ has an exponential decay, this condition is satisfied.

For Condition 2, when $k\ne j$, ${\varphi }_k(t)\ne {\varphi }_j(t)$ is satisfied, because when $s_a\in \{+1,-1\}$ and $s_b\in \{+1,-1\}$, $\left|p(t-a)\right|\ne \left|p(t-b)\right|$.

For Condition 3, we have ${max}_{a,b}\left|{\varphi }_a(t)-{\varphi }_b(t)\right|=2\left|p(t)\right|<2A\times 2^{-\left|t\right|}$. Then, the condition is satisfied.

For Condition 4, we have:

${min}_{a\ne b}{\int }_{\left|t\right|<1/2}\left|{\varphi }_a(t)-{\varphi }_b(t)\right|dt=2{\int }_{\left|t\right|<1/2}\left|p(t)\right|dt$,

${max}_{a\ne b}{\int }_{\left|t\right|>1/2}\left|{\varphi }_a(t)-{\varphi }_b(t)\right|dt=2{\int }_{\left|t\right|>1/2}\left|p(t)\right|dt$.

The curve of ${\int }_{\left|t\right|<1/2}\left|p(t)\right|dt-{\int }_{\left|t\right|>1/2}\left|p(t)\right|dt$ versus $\beta$ is given in Figure 4, from which, this condition is satisfied if $\beta >0.3602$.

Because of topological conjugation, we can not only construct a chaotic waveform from a symbol sequence, but we can also reversely recover a symbol sequence from a chaotic waveform.

3.2.2. Dynamic Behavior

The Lyapunov exponent is an important index to judge whether a dynamical system is chaotic. Figure 5 shows the calculation of the maximum Lyapunov exponents of the system of Equations (10) and (11), which are 4.8 and 4.5648, respectively. The Lyapunov exponent remains unchanged when parameter B is invariant. Furthermore, the Lyapunov dimension of the chaotic signal is unchanged by the wireless channel [11], which means that the baseband waveform can be transmitted in a physical media that linearly filters signals.

4. Wireless Communication System Using Chaotic Filter

Applying the proposed chaotic filter as a pulse-shaping filter and matched filter, a novel chaotic baseband wireless communication system is constructed. The effects of different wireless channels on the system are discussed. The BER performance and computational complexity of different methods are compared.

4.1. Transmitter and Receiver

In modern digital communication systems, binary information symbols are usually mapped into a predefined constellation using constellation mapping, such as multi-phase shift keying (MPSK) and multi-stage quadrature amplitude modulation (MQAM). In this paper, binary-phase shift keying (BPSK) is taken as an example, and binary information is mapped to obtain bipolar symbols $s_m\in \{+1,-1\}$. After being oversampled, mapped symbols are then encoded by an RRC-based chaotic pulse-shaping filter $p(t)$ to generate the baseband waveform $x(t)$. Different roll-off factors of the shaping filter can be selected according to different needs. The encoding chaotic baseband wireless waveform at the transmitter with $\beta =0.5$ and the corresponding bit information are shown in Figure 6 with a blue solid line and red dotted line, respectively.

The received signal passing through the wireless channel can be written as:

$$r(t)=h(t)\ast x(t)+w(t),$$

(14)

where ‘∗’ denotes convolution, $w(t)$ is AWGN with $w\sim C\mathcal{N}\left(0,{\sigma }^2\right),\mathrm{and}{\sigma }^2=N_0$. $h(t)$ is the impulse response of the wireless channel, which can be modeled as:

$$h(t)=\sum _{l=0}^{L-1}{\alpha }_l\delta \left(t-{\tau }_l\right),$$

(15)

where ${\alpha }_l$ and ${\tau }_l$ are the attenuation and propagation delay corresponding to path l, respectively, and $\delta (·)$ is the Dirac delta function. Assume that delay $(l=0,1,\dots ,L-1)$ satisfies $0={\tau }_0<{\tau }_1<\dots <{\tau }_{L-1}$, and channel fading ${\alpha }_l$ is modeled as a negative exponential decay ${\alpha }_l=e^{-\gamma {\tau }_l}$, where $\gamma$ is the damping coefficient. Equation (15) is a statistical average channel model [25] for a practical wireless communication channel, and it is considered for the theoretical performance analysis.

At the receiver, the matched filter $g(t)$ expressed in Equation (9) is used to maximize SNR. The filter output $y(t)$ is:

$$\begin{array}{cc}\hfill y(t)& =r(t)\ast g(t)\hfill \\ \hfill & =s(t)\ast p(t)\ast h(t)\ast g(t)+W(t),\hfill \end{array}$$

(16)

where $W(t)=w(t)\ast g(t)$ is the filtered noise. If $w(t)$ is AWGN with a zero mean, then $W(t)$ is also Gaussian noise with a zero mean [26].

After sampling $y(t)$ by $n=\lfloor t\rfloor$, a symbol decision algorithm is implemented as:

$$s(n)=\left\{\begin{array}{cc}1,\hfill & \mathrm{if}\left(y(n)\ge \theta (n)\right),\hfill \\ -1,\hfill & \mathrm{if}\left(y(n)<\theta (n)\right),\hfill \end{array}\right.$$

(17)

where $\theta (n)$ is the threshold to carry out the symbol decision process. The threshold calculation algorithm for the proposed method is described as follows.

4.2. Threshold Calculation

The total impulse response of the pulse-shaping filter, wireless channel and matched filter can be described as:

$$\begin{array}{cc}\hfill R(t)& =p(t)\ast h(t)\ast g(t)\hfill \\ \hfill & =\sum _{l=0}^{L-1}{\alpha }_l\frac{sin\frac{\pi \left(t-{\tau }_l\right)}{T_S}}{\frac{\pi \left(t-{\tau }_l\right)}{T_S}}\frac{cos\frac{\beta \pi \left(t-{\tau }_l\right)}{T_S}}{1-{\left(\frac{2\beta \left(t-{\tau }_l\right)}{T_S}\right)}^2}.\hfill \end{array}$$

(18)

Thus, the output signal $y(t)$ is:

$$\begin{array}{cc}\hfill y(t)& =s(t)\ast R(t)+W(t)\hfill \\ \hfill & =\sum _{m=-\infty }^{\infty }s(m)R(t-m)+W(t),\hfill \end{array}$$

(19)

where $s(m)\in \{+1,-1\}$ represents bipolar information symbols with equal probability. The sampled $y(t)$ can be calculated by:

$$\begin{array}{cc}\hfill y(n)=& \sum _{m=-\infty }^{\infty }s(m)R\left(n-m\right)+W(n)\hfill \\ \hfill =& \underset{\mathrm{Expected}\mathrm{signal}}{\underbrace{s(n)R\left(0\right)}}+\underset{\mathrm{Intersymbol}\mathrm{interference}}{\underbrace{\underset{m=-\infty }{\sum _{m\ne n}^{m=\infty }}s(m)R\left(n-m\right)}}+\underset{\mathrm{Noise}}{\underbrace{W(n)}}.\hfill \end{array}$$

(20)

In Equation (20), the first term contains the expected symbol $s(n)$ with $m=n$. The second term is the ISI from the other symbol $s(m)$ with $m\ne n$. Different from CBWCS with two ISI sources, the method proposed in this paper satisfies Nyquist ISI criteria, so only one ISI source caused by multi-path propagation needs to be considered.

To eliminate ISI caused by multi-path propagation, we take the second term of Equation (20) as the optimal threshold sequence $\theta {(n)}_{opt}$ [21]:

$$\theta {(n)}_{opt}=\sum _{\begin{array}{c}m\ne n\\ m=-\infty \end{array}}^{\infty }s(m)R\left(n-m\right),$$

(21)

where $R(n-m)$ can be calculated if the channel parameters ${\tau }_l$ and ${\alpha }_l$ are known. Substituting Equation (21) into Equation (17), the calculated threshold is used in the symbol decision stage to relieve ISI. Now, signal transmission is only effected by Gaussian white noise.

However, in order to obtain $\theta {(n)}_{opt}$ in Equation (21), two parts of symbols are needed: the past symbols $s(m)(m<n)$ and the future symbols $s(m)(m>n)$. The past symbols can be decoded directly, while the future symbols are not available. Thus, a suboptimal threshold with only the past symbols is described as:

$$\theta {(n)}_{subopt}=\sum _{\begin{array}{c}m=-\infty \end{array}}^{n-1}s(m)R\left(n-m\right).$$

(22)

4.3. Performance Analysis

In this section, the BER performance and computational complexity of the proposed scheme are analyzed.

4.3.1. BER Performance Analysis

• AWGN channel

For an AWGN channel ($L=1$), $\tau =0$ and $\gamma =0$. The simulation results of CBWCS [21], the proposed method, conventional RRC filter, and the theoretical BER of BPSK under an AWGN channel are presented in Figure 7. In this simulation, for fair comparison, the threshold $\theta (n)$ was 0, and any channel equalization methods were not implemented at receiver. In all of the following simulations, the oversampling rate $N_o$ was 10, and the tap number of filter $N_f$ was 6. More than 100,000 trials were performed on average.

From Figure 7, since the proposed shaping filter is designed without ISI, the chaotic waveform can achieve the same BER performance as an RRC filter. CBWCS has the worst BER performance because of ISI caused by the chaotic filter itself.

• Multi-path channel

For a multi-path channel, we assessed the performance under two conditions: a two-path channel ($L=2$), ${\tau }_0=0$, ${\tau }_1=1$, $\gamma =0.6$, and a three-path channel ($L=3$), ${\tau }_0=0$, ${\tau }_1=1$, ${\tau }_2=2$, $\gamma =0.6$.

First, we discuss the case with $\theta (n)=0$ and no channel equalization. The BER performance comparison between CBWCS, the proposed method, and the RRC filter is shown in Figure 8. The dotted lines and solid lines indicate the performance under a two-path channel and a three-path channel, respectively. From Figure 8, it can be seen that ISI caused by multi-path propagation leads to worse BER performance compared with the AWGN channel. The RRC filter and the proposed method have similar BER performance, while CBWCS not only has ISI itself but is also effected by ISI due to multi-path propagation, so it has the worst BER performance. When BER = ${10}^{-3}$, the proposed method outperforms CBWCS by more than 2 dB under a two-path channel.

Next, we implemented the calculated threshold in symbol detection. Figure 9 shows the comparison results of CBWCS, the proposed method, and the RRC filter with the optimal threshold (Equation (21)). For the conventional RRC-based communication system, a minimum mean square error (MMSE) equalizer is used for channel equalization. For BER = ${10}^{-3}$, the proposed method has about 0.2 dB and 0.25 dB gain under two-path and three-path channels compared with CBWCS, respectively, because the ISI, which is not completely eliminated, effects the accuracy of CBWCS. The gap between the chaotic waveform without channel equalization and the traditional non-chaotic waveform using linear equalization shows that the threshold can be implemented without amplifying the channel noise to combat multi-path effects, because the Lyapunov exponent of the chaotic waveform stays constant after passing through the wireless channel.

Figure 10 shows BER performance with the suboptimal threshold (Equation (22)). Similar to Figure 9, the performance of the two-path channel generally outperforms that of the three-path channel. When BER is ${10}^{-3}$, the BER of the suboptimal threshold is about 1.7 dB worse than the optimal threshold.

All these analyses are based on the premise that the state of the channel, including decay and delay, are constant. Thus, for all frames, a perfect channel knowledge assumption is employed for threshold calculation. However, in an actual environment, the channel state of each frame will change. We assume that the channel parameter ${\tau }_L$ is invariant in one frame and uniformly distributed in the range of $[0.3,0.9]$ in different frames of both the two-path channel and three-path channel. In this simulation, 1024 bits in one frame are divided into two parts: 896 data bits and 128 pilot bits. Pilot bits are used to carry out the least squares (LS) algorithm for channel estimation. Figure 11a shows the comparison of different methods under this quasi-static channel with the suboptimal threshold, where the BER performance deteriorates due to the inaccurate estimation of channel state information. However, the proposed threshold calculation method is still 2.2 dB better than traditional MMSE equalization.

In addition to BPSK, the proposed method can also be used in high-order modulation. Figure 11b shows the comparison of different methods for 16QAM, where BER performance degrades more than 3 dB compared with BPSK due to the distance between constellation points being reduced. The proposed method outperforms the CBWCS and RRC filters by 0.4 dB and 0.56 dB for BER = ${10}^{-3}$, respectively.

4.3.2. Computational Complexity Analysis

In this subsection, we study the computational complexity of different wireless communication systems in terms of floating-point operations (flops). A flop is defined as one addition, subtraction, multiplication, or division of two floating point numbers, a comparison, and the usually accompanying fetch and store [27]. The flop count can be obtained by simply adding up all of the described operations. With this definition, one complex addition and one complex multiplication can be viewed as 2 and 6 flops, respectively.

The main differences between the proposed system and the traditional non-chaotic system are the pulse-shaping filter, corresponding matched filter and symbol decision algorithm. Thus, the number of flops of these three parts are discussed and shown in

Table 1. Computational complexity comparison.

Method	Pulse Shaping	Matched Filtering	Decoding
Root-raised-cosine (RRC) with minimum mean square error (MMSE)	$2N_o{N}_f$	$2N_o{N}_f$	$24L^3$
Chaotic baseband wireless communication system (CBWCS)	$2N_o{N}_f$	$2N_o{N}_f$	$40N_{s}L$
Proposed method	$2N_o{N}_f$	$2N_o{N}_f$	$19N_{s}L$

. $N_s$, $N_o$, $N_f$ and L are the length of the symbol, the oversampling rate, the tap number of the filter, and the multi-path number, respectively. The cost of executing pulse shaping for one symbol is $N_f$ multiplications and $N_f-1$ adds. Therefore, by omitting the lower-order terms, $2N_o{N}_f$ flops are required to carry out pulse shaping after oversampling with the sampling frequency $N_o$ for all three methods. Matched filtering has the same computational complexity as pulse shaping. To decode one symbol, in a non-chaotic communication system, the computational complexity of the decoding algorithm mainly caused by MMSE equalization is $24L^3$ flops [28]. In CBWCS, for each optimal threshold calculation, one convolution needs $38N_s$ mathematical operations, $N_s-1$ multiplications and $N_s-2$ additions, while in the proposed method, because the threshold has a simpler impulse response expression, the flops of one convolution are reduced to $17N_s$ mathematical operations, $N_s-1$ multiplications and $N_s-2$ additions. Multiplying by the multi-path number and omitting the lower-order terms, the computational complexity of threshold calculation in CBWCS and the proposed system are $40N_{s}L$ flops and 19$N_{s}L$ flops, respectively. The reduction of 52.5% flops in threshold calculation means that the proposed method has a performance advantage in terms of overall computational complexity.

In threshold calculation, because the response of $R(t)$ will rapidly decay to zero, ${\theta }_{opt}$ only depends on the current and future $N_p$ non-zero coefficients of $R(t)$. In CBWCS, for $N_p=5$, the requirement is satisfied, and in the proposed method, $N_p=6$. Thus, for $L\ge 3$, the RRC with MMSE has the highest computational complexity, while the proposed method has the key advantages of involving less computational complexity and a simpler structure of the decision threshold.

5. Conclusions

In this paper, a novel chaotic pulse-shaping filter and matched filter from RRC division are proposed. The unequal RRC division method provides the possibility to generate chaotic waveforms while ensuring no ISI. Based on this, a wireless communication system architecture using generated chaotic waveforms is developed, where a chaotic pulse-shaping filter and corresponding matched filter are used to implement encoding at the transmitter and maximize the SNR during decoding at the receiver, respectively. In order to guarantee that the information can be retrieved from the received signal, a continuous-time chaotic waveform is proved to be topologically conjugate to the bi-polar information. Simulation results in a single-path channel and multi-path channel with a time delay validate its effectiveness and superiority. Under an AWGN single-path channel, the proposed chaotic waveform can achieve the same BER performance as an RRC filter, which is very close to the lower bound of the BER. Under a multi-path channel, the proposed method is demonstrated to be 2 dB better than CBWCS when the threshold is zero. In the case with optimal and suboptimal thresholds, compared with CBWCS, the proposed scheme reduces computational complexity by 52.5% without effecting the BER performance.