Chaotic shape-forming and matched filter-based wireless communication method

Abstract

a chaotic shape-forming and corresponding matched filter-based wireless communication method is provided, and the method includes that: 1) data to be transmitted is prepared; 2) chaotic shape-forming filter is performed on a digital symbol to be transmitted to generate a baseband signal; 3) the baseband signal is transmitted and transferred by use of a radio frequency component and transmitting antenna of a conventional wireless communication system; 4) a wireless signal is received by use of a conventional receiving antenna, and down-carrier process is performed on the received signal to obtain a received baseband signal; 5) matched filter is performed on the received baseband signal; 6) wireless channel estimation and multipath interference cancellation judgment threshold calculation are performed; and 7) sampling judgment is performed on an output signal of matched filter, symbol sampling is performed on the output signal of the matched filter in Step 5), and the sampled signal is judged by use of a judgment threshold calculated in Step 6) to obtain a decoded output signal.

Claims

1. A data sending method, comprising: acquiring data to be transmitted; processing the data to be transmitted by use of a chaotic shape-forming filter to obtain a baseband signal; and sending the baseband signal; wherein processing the data to be transmitted by use of the chaotic shape-forming filter to obtain the baseband signal comprises: generating the baseband signal by use of the following formula: $x\left(t\right)=\underset{m=.Math.t.Math.}{\overset{.Math.t.Math.+N_p}{.Math.}}{s}_m.Math.p\left(t-m\right),$ where t is a time variable, └t┘ represents a rounding-down operation over the variable t, N.sub.p is a parameter related to a chaotic basis function, m is a variable loop sequence number, s.sub.m represents an mth symbol to be transmitted, and p(t) is the chaotic basis function.

2. The method as claimed in claim 1, wherein an expression of p(t) is as follows: $p\left(t\right)=\{\begin{array}{cc}\left(1-e^{-\beta }\right)e^{\beta t}\left(\cos \omega t-\frac{\beta }{\omega }\sin \omega t\right),& t<0\\ 1-e^{\beta \left(t-1\right)}\left(\cos \omega t-\frac{\beta }{\omega }\sin \omega t\right),& 0\le t<1\\ 0,& t\ge 1\end{array},$ where β and ω are chaotic system parameters.

3. The method as claimed in claim 1, wherein the chaotic shape-forming filter comprises a finite impulse response filter, s.sub.m is an mth element in an input symbol sequence of the chaotic shape-forming filter, the tap number of the chaotic shape-forming filter is N.sub.p+1, and an nth tap coefficient p.sub.n is represented as follows:
p.sub.n=p(t−└t┘−N.sub.p+n),n=0,1, . . . ,N.sub.p, where t is the time variable, └t┘ represents the rounding-down operation over the variable t, and N.sub.p is the parameter related to the chaotic base function.

4. The method as claimed in claim 3, wherein a valuing principle for N.sub.p is to make p(t−N.sub.p) close to 0.

5. The method as claimed in claim 1, wherein sending the baseband signal comprises: sending the baseband signal by use of a wireless transmission component in a conventional wireless communication system.

6. The method as claimed in claim 1, wherein the data to be transmitted comprises that: a data frame structure is adopted for the data to be transmitted, and each frame is divided into two parts of a preamble sequence and a data sequence, the preamble sequence being configured for channel estimation and frame synchronization and the data sequence being valid data to be sent.

7. A data receiving method, comprising: receiving a baseband signal, the baseband signal being a signal obtained by processing data to be transmitted by use of a chaotic shape-forming filter; processing the baseband signal by use of a matched filter to obtain demodulated data; performing channel estimation by use of a preamble sequence in the demodulated data to obtain a channel parameter; determining a signal judgment threshold at a present sampling moment on the basis of the channel parameter and the demodulated data; and performing symbol sampling on the demodulated data, and judging a sampled symbol by use of the signal judgment threshold to obtain a target signal.

8. The method as claimed in claim 7, wherein processing the baseband signal by use of the matched filter comprises: performing matched filter on the baseband signal to obtain an output signal of the matched filter; and extracting data from the output signal to obtain the demodulated data.

9. The method as claimed in claim 8, wherein the output signal of the matched filter is: $y\left(t\right)=\underset{m=.Math.t.Math.-N_C{N}_p}{\overset{.Math.t.Math.}{.Math.}}r\left(m\right)g\left(t-m\right),$ where y(t) is the output signal, t is a time variable, ┌t┐ is a rounding-up operation over the variable t, N.sub.C represents a chaotic symbol oversampling rate, r(m) is an nth element of an input signal sequence of the matched filter, and g(t) is a time inverse function of a chaotic basis function, namely g(t)=p(−t).

10. The method as claimed in claim 7, wherein the matched filter adopts a finite impulse response filter structure.

11. The method as claimed in claim 7, wherein performing channel estimation by use of the preamble sequence in the demodulated data to obtain the channel parameter comprises: performing channel estimation on the preamble sequence by use of a least square method to obtain channel parameters τ.sub.l and α.sub.l, l being a multipath sequence number and τ.sub.l and α.sub.l being delay time and attenuation coefficient of an lth path respectively; and determining the signal judgment threshold at the present sampling moment on the basis of the channel parameter and the demodulated data comprises: calculating the signal judgment threshold by use of the following formula:
θ.sub.n=Σ.sub.l=0.sup.L−1Σ.sub.i=┌−τ.sub.l.sub.┐.sup.−1s.sub.n+iC.sub.l,i, where s.sub.n+i is a symbol at an n+ith sampling moment, L is the number of multiple paths, i is a symbol loop variable, and inter-symbol interference C.sub.l,i of an ith symbol of an lth path at the present moment is calculated as follows:
C.sub.l,i=a.sub.l∫.sub.τ=−∞.sup.∞p(τ)p(τ+τ.sub.l+i)dτ.

12. The method as claimed in claim 7, wherein, if a sampling signal at an nth sampling moment is represented as y.sub.n, signal judgment at this moment is performed as follows: $s_n=\{\begin{array}{cc}1& \left(y_n\ge {\theta }_n\right)\\ -1& \left(y_n<{\theta }_n\right)\end{array},$ where θ.sub.n is the signal judgment threshold.

13. A chaotic shape-forming and corresponding matched filter-based wireless communication method, comprising: Step 1): preparing data to be transmitted, wherein a data frame structure is adopted for the data to be transmitted, and each frame is divided into two parts of a preamble sequence and a data sequence, the preamble sequence being configured for channel estimation and frame synchronization and the data sequence being valid data to be sent; Step 2): performing chaotic shape-forming filtering on a digital symbol to be transmitted to generate a baseband signal, wherein the baseband signal generated by use of a chaotic shape-forming filter is represented as follows: $x\left(t\right)=\underset{m=.Math.t.Math.}{\overset{.Math.t.Math.+N_p}{.Math.}}{s}_m.Math.p\left(t-m\right),$ where t is a time variable, └t┘ represents a rounding-down operation over the variable t, N.sub.p is a parameter related to a chaotic basis function, m is a variable loop sequence number, s.sub.m represents an mth symbol to be transmitted, and an expression of p(t) is as follows: $p\left(t\right)=\{\begin{array}{cc}\left(1-e^{-\beta }\right)e^{\beta t}\left(\cos \omega t-\frac{\beta }{\omega }\sin \omega t\right),& t<0\\ 1-e^{\beta \left(t-1\right)}\left(\cos \omega t-\frac{\beta }{\omega }\sin \omega t\right),& 0\le t<1\\ 0,& t\ge 1\end{array},$ where β and ω are chaotic system parameters; Step 3): sending and transferring the baseband signal by use of a radio frequency component and transmitting antenna of a conventional wireless communication system; Step 4): receiving a wireless signal by use of a conventional receiving antenna, and performing carrier frequency removal on the received signal to obtain the received baseband signal; Step 5): performing matched filtering on the received baseband signal, wherein an output signal of a matched filter is: $y\left(t\right)=\underset{m=.Math.t.Math.-N_C{N}_p}{\overset{.Math.t.Math.}{.Math.}}r\left(m\right)g\left(t-m\right),$ where y(t) is the output signal, t is the time variable, ┌t┐ is a rounding-up operation over the variable t, N.sub.C represents a chaotic symbol oversampling rate, r(m) is an mth element of an input signal sequence of the matched filter, and g(t) is a time inverse function of the chaotic basis function, namely g(t)=p(−t), the matched filter adopts a finite impulse response filter structure, the number of taps is N.sub.CN.sub.p+1, and an mth tap coefficient g.sub.m is represented as follows:
g.sub.m=g(t−┌t┘m),m=0,1,. . . ,N.sub.CN.sub.p; Step 6): performing wireless channel estimation and multipath interference cancellation judgment threshold calculation, wherein a delay and attenuation parameter of a wireless channel are estimated by use of the preamble sequence and a channel estimation algorithm, a signal judgment threshold at a present moment is calculated by use of an estimated channel parameter in combination with a chaotic characteristic and a demodulated symbol, and for a wireless channel comprising L paths, an estimated delay and attenuation coefficient of an Ith path of the channel are τ.sub.l and α.sub.l respectively, l=0, 1, 2, . . . , L−1, response values exist only delay points of the L paths, and a channel impulse response is represented as h(t)=Σ.sub.l=0.sup.L−1α.sub.l(t−τ.sub.l), where δ(t) is a unit impulse response, and τ.sub.l and α.sub.l are channel parameters; and Step 7): performing sampling judgment on the output signal of matched filtering, wherein symbol sampling is performed on the output signal of the matched filter in Step 5), and a sampling signal is judged by use of the judgment threshold calculated in Step 6) to obtain a decoded output signal.

14. The chaotic shape-forming and corresponding matched filter-based wireless communication method as claimed in claim 13, wherein, in Step 2), the chaotic shape-forming filter adopts a finite impulse response filter structure, the number of taps of the chaotic forming filter is N.sub.p+1, tap coefficients from left to right are represented as p.sub.0, p.sub.1, . . . , p.sub.N.sub.p respectively, and an nth tap coefficient p.sub.n is represented as follows:
p.sub.n=p(t−└t┘−N.sub.p+n),n=0,1, . . . ,N.sub.p; and for the chaotic shape-forming filter, a valuing principle of N.sub.p is to make p(t−N.sub.p) close to 0, where p(t−N.sub.p) is a state value of the chaotic basis function at a moment t−N.sub.p.

15. The chaotic shape-forming filter and matched filter-based wireless communication method as claimed in claim 14, wherein, in Step 5), the matched filter adopts a finite impulse response filter structure.

16. The chaotic shape-forming and matched filter-based wireless communication method as claimed in claim 13, wherein, in Step 6), a least square method is adopted for estimation of the channel parameter, and the estimated channel parameters τ.sub.l and α.sub.l are utilized, where l is the multipath sequence number, and τ.sub.l and α.sub.l are delay time and attenuation coefficient of the lth path respectively; and determining a signal judgment threshold at a present sampling moment on the basis of a channel parameter and demodulated data comprises: calculating the signal judgment threshold by use of the following formula:
θ.sub.n=Σ.sub.l=0.sup.L−1Σ.sub.i=┌−τ.sub.l.sub.┐.sup.−1s.sub.n+iC.sub.l,i, where s.sub.n+i is a symbol at an n+ith sampling moment, L is the number of multiple paths, i is a symbol loop variable, and inter-symbol interference C.sub.l,i of an ith symbol of an lth path at the present moment is calculated as follows:
C.sub.l,i=a.sub.l∫.sub.τ=−∞.sup.∞p(τ)p(τ+τ.sub.l+i)dτ.

17. The chaotic shape-forming and matched filter-based wireless communication method as claimed in claim 13, wherein, in Step 7), if a sampling signal at an nth sampling moment is represented as y.sub.n, signal judgment at this moment is performed as follows: $s_n=\{\begin{array}{cc}1& \left(y_n\ge {\theta }_n\right)\\ -1& \left(y_n<{\theta }_n\right)\end{array}.$

Description

BRIEF DESCRIPTION OF THE DRAWINGS

(1) The drawings described herein are adopted to provide a further understanding to the embodiments of the disclosure and form a part of the disclosure. Schematic descriptions about the embodiments of the disclosure are adopted to explain the embodiments of the disclosure and not intended to form improper limits to the embodiments of the disclosure. In the drawings:

(2) FIG. 1 is an implementation block diagram of a chaotic transmission structure adopted for a method according to an embodiment of the disclosure;

(3) FIG. 2 is an implementation block diagram of a chaotic receiving structure adopted for a method according to an embodiment of the disclosure;

(4) FIG. 3 is a system data frame structure for a method according to an embodiment of the disclosure;

(5) FIG. 4 is an implementation block diagram of a chaotic shape-forming filter designed for a method according to an embodiment of the disclosure;

(6) FIG. 5 is an implementation block diagram of a matched filter designed for a method according to an embodiment of the disclosure;

(7) FIG. 6 is a test picture of a scenario of a first experiment of a method according to an embodiment of the disclosure;

(8) FIG. 7 is a normalization channel parameter of the scenario of the first experiment of the method according to the embodiment of the disclosure;

(9) FIG. 8 show curves of Bit Error Rates (BERs) of the method according to the embodiment of the disclosure and a conventional non-chaotic method under different transmitted power in the scenario of the first experiment of the method according to the embodiment of the disclosure;

(10) FIG. 9 is a test picture of a scenario of a second experiment of a method according to an embodiment of the disclosure;

(11) FIG. 10 is a normalization channel parameter of the scenario of the second experiment of the method according to the embodiment of the disclosure;

(12) FIG. 11 show curves of BERs of the method according to the embodiment of the disclosure and a conventional non-chaotic method under different transmitted power in the scenario of the second experiment of the method according to the embodiment of the disclosure;

(13) FIG. 12 is a flowchart of a data sending method according to the embodiment of the disclosure;

(14) FIG. 13 is a flowchart of a data receiving method according to the embodiment of the disclosure;

(15) FIG. 14 is a structural schematic diagram of a data sending according to the embodiment of the disclosure;

(16) FIG. 15 is a structural schematic diagram of a data receiving device according to the embodiment of the disclosure.

DETAILED DESCRIPTION OF THE EMBODIMENTS

(17) FIG. 1 is a functional block diagram of a chaotic transmission structure (transmitter of a chaotic wireless communication system) adopted for a method according to an embodiment of the disclosure, including five parts of constellation diagram mapping, chaotic forming filtering (a chaotic forming filter is adopted), digital carrier frequency addition, digital-to-analog conversion and analog carrier frequency addition. The chaotic transmission structure is different from a conventional wireless digital communication transmitter structure in that a pair of chaotic shape-forming filters are added. In FIG. 1, signals of input ports A, B, C and D are represented as S.sub.A, S.sub.B, X.sub.C and X.sub.D respectively; and upper and lower paths between the port B and the port C are an in-phase signal path and an orthogonal signal path after digital baseband modulation respectively, so that S.sub.B.sup.i and S.sub.B.sup.q are an in-phase component and orthogonal component of the signal S.sub.B of the port B, and X.sub.C.sup.i and X.sub.C.sup.q are an in-phase component and orthogonal component of the signal X.sub.C of the port C. Design and implementation of the chaotic forming filter will be described in subsequent steps in detail.

(18) FIG. 2 is a block diagram of a chaotic receiving structure (a receiver of a chaotic wireless communication system) adopted for a method according to an embodiment of the disclosure. FIG. 2 is equivalent to an inverse process of FIG. 1, and includes six parts of analog carrier removal, analog-to-digital conversion, digital down-carrier, matched filter (a matched filter is adopted), sampling judgment and constellation diagram inverse mapping. In FIG. 2, signals of input ports A′, B′, C′, D′ and E′ are represented as and respectively; and upper and lower paths between the port B′ and the port D′ are an in-phase signal path and orthogonal signal path of a digital baseband signal respectively, Y.sub.B.sup.i and Y.sub.B.sup.q are an in-phase component and orthogonal component of the signal Y.sub.B of the port B′, Y.sub.C.sup.i and Y.sub.C.sup.q are an in-phase component and orthogonal component of the signal Y.sub.C of the port C′, and Y.sub.D.sup.i and Y.sub.D.sup.q are an in-phase component and orthogonal component of the signal Y.sub.D of the port D′. Design and implementation of the matched filter and a sampling judgment method will be elaborated in subsequent steps.

(19) Based on the abovementioned transmitter and receiver structures, a chaotic shape-forming filter and matched filter-based wireless communication method of the embodiments of the disclosure is specifically implemented according to the following steps.

(20) Step 1): data to be transmitted is prepared.

(21) As shown in FIG. 3, a data frame structure is adopted for the data to be transmitted, and each frame is divided into two parts of a preamble sequence and a data sequence, the preamble sequence being configured for channel estimation and frame synchronization and the data sequence being valid data to be sent. It is also necessary to perform digital baseband modulation (constellation diagram mapping) on the data to be transmitted according to a practical condition.

(22) Step 2): chaotic shape-forming filtering is performed on a digital symbol to be transmitted to generate a baseband signal.

(23) The baseband signal generated by use of a chaotic shape-forming filter is represented as follows:

(24) $\begin{array}{cc}x\left(t\right)=\underset{m=.Math.t.Math.}{\overset{.Math.t.Math.+N_p}{.Math.}}{s}_m.Math.p\left(t-m\right),& \left(1\right)\end{array}$

(25) where t is a time variable, └t┘ represents a rounding-down operation over the variable t, N.sub.p is a parameter related to a chaotic basis function, m is a variable loop sequence number, s.sub.m represents an mth symbol to be transmitted, and an expression of p(t) is as follows:

(26) $\begin{array}{cc}p\left(t\right)=\{\begin{array}{cc}\left(1-e^{-\beta }\right)e^{\beta t}\left(\cos \omega t-\frac{\beta }{\omega }\sin \omega t\right),& t<0\\ 1-e^{\beta \left(t-1\right)}\left(\cos \omega t-\frac{\beta }{\omega }\sin \omega t\right),& 0\le t<1\\ 0,& t\ge 1\end{array},& \left(2\right)\end{array}$

(27) where β and ω are chaotic system parameters, and values are required to be determined according to a requirement of a communication system. Under a normal condition, β=ln 2 and ω=2π.

(28) During specific digital implementation, the chaotic shape-forming filter adopts a finite impulse response filter structure, and an implementation block diagram is shown in FIG. 4. In the figure, S is an input symbol sequence of the chaotic shape-forming filter, s.sub.m is an mth element of the sequence, and Z.sub.1.sup.−1 is a delay of a unit symbol of the input sequence of the chaotic shape-forming filter. The number of taps of the chaotic shape-forming filter is N.sub.p+1, tap coefficients from left to right are represented as p.sub.0, p.sub.1, . . . , p.sub.N.sub.p respectively, and an nth tap coefficient p.sub.n is represented as follows:
p.sub.n=p(t−└t┘−N.sub.p+n),n=0,1,. . . ,N.sub.p,  (3).

(29) For the chaotic shape-forming filter, if a value of N.sub.p is larger, filtering performance is higher, but algorithm complexity is also higher. Therefore, a valuing principle for N.sub.p in the step is to make p(t−N.sub.p) close to 0, where p(t−N.sub.p) is a state value of the chaotic basis function at a moment t−N.sub.p, and it can be seen that the requirement is satisfied for the chaotic basis function, N.sub.p=6

(30) Step 3): the baseband signal is transmitted and transferred by use of a radio frequency component and transmitting antenna of a conventional wireless communication system.

(31) Step 4): a wireless signal is received by use of a conventional receiving antenna, and down-carrier process is performed on the received signal to obtain the received baseband signal.

(32) Step 5): matched filtering is performed on the received baseband signal.

(33) An output signal of a matched filter is:

(34) 0$\begin{array}{cc}y\left(t\right)=\underset{m=.Math.t.Math.-N_C{N}_p}{\overset{.Math.t.Math.}{.Math.}}r\left(m\right)g\left(t-m\right),& \left(4\right)\end{array}$

(35) where y(t) is the output signal, t is the time variable, ┌t┐ is a rounding-up operation over the variable t, N.sub.C represents a chaotic symbol oversampling rate, r(m) is an mth element of an input signal sequence of the matched filter, and g(t) is a time inverse function of the chaotic basis function, namely g(t)=p(−t).

(36) The matched filter adopts a finite impulse response filter structure, the number of taps is N.sub.CN.sub.p+1, and an mth tap coefficient g.sub.m is represented as follows:
g.sub.m=g(t−┌t┐+m),m=0,1, . . . ,N.sub.CN.sub.p.

(37) During specific digital implementation, the matched filter adopts the finite impulse response filter structure, and an implementation block diagram is shown in FIG. 5. In FIG. 5, R=[ . . . , r(m), . . . , r(2), r(1)] is the input symbol sequence of the matched filter, and Z.sub.2.sup.−1 is a delay of a unit symbol of the input sequence. The number of the taps of the matched filter is N.sub.CN.sub.p+1, where N.sub.C represents the chaotic symbol oversampling rate, the tap coefficients from left to right are represented as g.sub.0, g.sub.1, . . . , g.sub.N.sub.C.sub.N.sub.p respectively, and the mth tap coefficient g.sub.m is represented as follows:
g.sub.m=g(t−┌t┐+m),m=0,1, . . . ,N.sub.CN.sub.p,  (5).

(38) Step 6): wireless channel estimation and multipath interference elimination judgment threshold calculation are performed.

(39) A delay and attenuation parameter of a wireless channel are estimated by use of the preamble sequence and a channel estimation algorithm, and a signal judgment threshold at a present moment is calculated by use of an estimated channel parameter in combination with a chaotic characteristic and a demodulated symbol. If the wireless multipath channel practically includes L paths, an estimated delay and attenuation coefficient of an Lth path of the channel are τ.sub.l and α.sub.l respectively, l=0, 1, 2, . . . , L−1, response values exist only delay points of the L paths, and a channel impulse response is represented as h(t)=Σ.sub.l=0.sup.L−1α.sub.lδ(t−τ.sub.l), where δ(t) is a unit impulse response, and τ.sub.l and α.sub.l are channel parameters. A least square method is specifically adopted to estimate the channel parameter, and the estimated channel parameters τ.sub.l and α.sub.l are utilized, where l is the multipath sequence number, and τ.sub.l and α.sub.l are delay time and attenuation coefficient of the lth path respectively. The output signal y(t) of matched filter in Step 5) is sampled, and a judgment threshold at an nth sampling moment is calculated as follows:
θ.sub.n=Σ.sub.l=0.sup.L−1Σ.sub.i=┌−τ.sub.l.sub.┐.sup.−1s.sub.n+iC.sub.l,i,  (6),

(40) where s.sub.n+i is a symbol at an n+ith sampling moment, L is the number of multi-paths, and i is a symbol loop variable. Because of the variable i≤−1 in Eq. (7), a value of s.sub.n+i at the nth sampling moment is known. Inter-symbol interference C.sub.l,i of an ith symbol of an lth path at the present moment is calculated as follows:
C.sub.l,i=a.sub.l∫.sub.τ=−∞.sup.∞p(τ)p(τ+τ.sub.l+i)dτ,  (7).

(41) The judgment threshold comprehensively considers a chaotic system property and a wireless channel parameter, and may effectively reduce inter-symbol interference brought by wireless multipath transmission and improve BER performance of a receiver.

(42) Step 7): sampling judgment is performed on the output signal of matched filter.

(43) Symbol sampling is performed on the output signal of the matched filter in Step 5), and a sampling signal is judged by use of the judgment threshold calculated in Step 6) to obtain a decoded output signal.

(44) If a sampling signal at the nth sampling moment is represented as y.sub.n, signal judgment at this moment is performed as follows:

(45) $\begin{array}{cc}{s}_n=\{\begin{array}{cc}1& \left(y_n\ge {\theta }_n\right)\\ -1& \left(y_n<{\theta }_n\right),\end{array}.& \left(8\right)\end{array}$

(46) According to the chaotic shape-forming and corresponding matched filter-based wireless communication method of the embodiments of the disclosure, chaos is used as a communication baseband waveform, and a conventional sinusoidal carrier is used as a communication carrier. For achieving compatibility with an existing wireless communication system, finite impulse response filter structures are adopted to implement the chaotic shape-forming filter of the transmitter and the matched filter corresponding to the receiver, thereby obtaining a chaotic waveform gain and also greatly reducing system implementation complexity.

(47) An embodiment of the disclosure also provides a data sending method, which, as shown in FIG. 12, includes the following steps.

(48) In S120, data to be transmitted is acquired.

(49) In S122, the data to be transmitted is processed by use of a chaotic shape-forming filter to obtain a baseband signal.

(50) In S124, the baseband signal is sent.

(51) The operation that the data to be transmitted is processed by use of the chaotic shape-forming filter to obtain the baseband signal includes that: the baseband signal is generated by use of the following equation:

(52) $x\left(t\right)=\underset{m=.Math.t.Math.}{\overset{.Math.t.Math.+N_p}{.Math.}}{s}_m.Math.p\left(t-m\right),$

(53) where t is a time variable, └t┘ represents a rounding-down operation over the variable t, N.sub.p is a parameter related to a chaotic basis function, m is a variable loop sequence number, s.sub.m represents an mth symbol to be transmitted, and p(t) is the chaotic basis function.

(54) Herein, an expression of p(t) is as follows:

(55) $p\left(t\right)=\{\begin{array}{cc}\left(1-e^{-\beta }\right)e^{\beta t}\left(\cos \omega t-\frac{\beta }{\omega }\sin \omega t\right),& t<0\\ 1-e^{\beta \left(t-1\right)}\left(\cos \omega t-\frac{\beta }{\omega }\sin \omega t\right),& 0\le t<1\\ 0,& t\ge 1\end{array},$

(56) where β and ω are chaotic system parameters.

(57) Preferred implementation modes of the embodiment may refer to above related descriptions and will not be elaborated herein.

(58) An embodiment of the disclosure also provides a data receiving method, which, as shown in FIG. 13, includes the following steps.

(59) In S130, a baseband signal is received, the baseband signal being a signal obtained by processing data to be transmitted by use of a shape-forming filter.

(60) In S132, the baseband signal is processed by use of a matched filter to obtain demodulated data.

(61) In S134, channel estimation is performed by use of a preamble sequence in the demodulated data to obtain a channel parameter.

(62) In S136, a signal judgment threshold at a present sampling moment is determined on the basis of the channel parameter and the demodulated data.

(63) In S138, symbol sampling is performed on the demodulated data, and a sampled symbol is judged by use of the signal judgment threshold to obtain a target signal.

(64) Optionally, the operation that the baseband signal is processed by use of the matched filter includes that: matched filter is performed on the baseband signal to obtain an output signal of the matched filter, and data is extracted from the output signal to obtain the demodulated data. Herein, the output signal is:

(65) $y\left(t\right)=\underset{m=.Math.t.Math.-N_C{N}_p}{\overset{.Math.t.Math.}{.Math.}}r\left(m\right)g\left(t-m\right),$

(66) where y(t) is the output signal, t is a time variable, ┌t┐ is a rounding-up operation over the variable t, N.sub.C represents a chaotic symbol oversampling rate, r(m) is an mth element of an input signal sequence of the matched filter, and g(t) is a time inverse function of a chaotic basis function, namely g(t)=p(−t).

(67) An embodiment of the disclosure provides a data sending device, which is configured to implement the method shown in FIG. 12. As shown in FIG. 14, the device includes:

(68) an acquisition component 140, configured to acquire data to be transmitted;

(69) a processing component 142, configured to process the data to be transmitted by use of a chaotic shape-forming filter to obtain a baseband signal; and

(70) a sending component 144, configured to send the baseband signal.

(71) An embodiment of the disclosure provides a data receiving device, which is configured to implement the method shown in FIG. 13. As shown in FIG. 15, the device includes:

(72) a receiving component 150, configured to receive a baseband signal, the baseband signal being a signal obtained by processing data to be transmitted by use of a chaotic shape-forming filter;

(73) a processing component 152, configured to process the baseband signal by use of a matched filter to obtain demodulated data;

(74) a channel estimation component 154, configured to perform channel estimation by use of a preamble sequence in the demodulated data to obtain a channel parameter;

(75) a determination component 156, configured to determine a signal judgment threshold at a present sampling moment on the basis of the channel parameter and the demodulated data; and

(76) a judgment component 158, configured to perform symbol sampling on the demodulated data and judge a sampled symbol by use of the signal judgment threshold to obtain a target signal.

(77) Experiments for Verification

(78) In a practical wireless channel environment, performance of a chaotic wireless communication method disclosed in the embodiments of the disclosure is verified. In the experiments, a system carrier frequency is 2.4 GHz, a system bandwidth is 20 MHz, and each of transmission and receiving nodes adopts a single antenna for point-to-point transmission. A test scenario is short-distance transmission in a campus (a transmission distance is 25˜30 meters), a time sequence structure and time-domain frame structure of a transmitted signal are shown in FIG. 3, and a verification result is obtained by averaging transmission results of 100 frames. BER performance of totally four methods is tested, and the four methods are the method of the embodiments of the disclosure in case of a judgment threshold 0, the method of the embodiments of the disclosure in case of a judgment threshold θ.sub.n, a channel equalization-free conventional non-chaotic method and a channel equalization-based conventional non-chaotic method respectively, and a Minimum Mean Square Error (MMSE) algorithm is adopted for channel equalization.

(79) First Experiment

(80) FIG. 6 is a test picture of a scenario of the first experiment. In FIG. 6, TX represents the transmitter, RX represents the receiver, a distance between the transmitter and the receiver is about 30 meters, and there are many buildings and trees around. A preamble sequence and a least square channel estimation algorithm are utilized. FIG. 7 shows estimated channel coefficients of the scenario. In FIG. 7, power normalization is performed on a first path by use of the channel parameter. It can be seen that the scenario includes three main paths, and the channel coefficients are 1, 0.31 and 0.17 respectively. Power of the transmitter is regulated, and changing curves of BERs of the four algorithms along with the transmitted power are shown in FIG. 8. It can be seen that the BER performance of the algorithm of the embodiments of the disclosure in case of the judgment threshold 0 and the channel equalization-free conventional non-chaotic method is poorest, the performance of the conventional non-chaotic method based on MMSE channel equalization is improved to a certain extent, and the performance of the method of the embodiments of the disclosure in case of the judgment threshold θ.sub.n is highest.

(81) Second Experiment

(82) FIG. 9 is a test picture of a scenario of the second experiment. In FIG. 9, TX represents the transmitter, RX represents the receiver, there is no line of sight transmission for the transmitter and the receiver, and a distance is about 25 meters. FIG. 10 shows normalized estimated channel coefficients of the scenario. It can be seen that the scenario includes four main paths, and the channel coefficients are 1, 0.46, 0.19 and 0.21 respectively. Curves of BER performance of the four algorithms along with the transmitted power are shown in FIG. 11. Similar to test results of the first scenario, the BER performance of the method of the embodiments of the disclosure in case of the judgment threshold θ.sub.n is highest.

(83) Comparison between the experimental results shows that, in a practical wireless transmission scenario, the method of the embodiments of the disclosure has higher BER performance than a conventional method.