CN112822133A - Multi-user orthogonal frequency division multiplexing differential chaos keying communication method - Google Patents

Multi-user orthogonal frequency division multiplexing differential chaos keying communication method Download PDF

Info

Publication number
CN112822133A
CN112822133A CN202011565976.5A CN202011565976A CN112822133A CN 112822133 A CN112822133 A CN 112822133A CN 202011565976 A CN202011565976 A CN 202011565976A CN 112822133 A CN112822133 A CN 112822133A
Authority
CN
China
Prior art keywords
user
signal
chaotic
matrix
sampling
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN202011565976.5A
Other languages
Chinese (zh)
Other versions
CN112822133B (en
Inventor
任海鹏
赵晓辉
白超
李洁
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Xian University of Technology
Original Assignee
Xian University of Technology
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Xian University of Technology filed Critical Xian University of Technology
Priority to CN202011565976.5A priority Critical patent/CN112822133B/en
Publication of CN112822133A publication Critical patent/CN112822133A/en
Application granted granted Critical
Publication of CN112822133B publication Critical patent/CN112822133B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L27/00—Modulated-carrier systems
    • H04L27/001—Modulated-carrier systems using chaotic signals
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04J—MULTIPLEX COMMUNICATION
    • H04J13/00—Code division multiplex systems
    • H04J13/0007—Code type
    • H04J13/0018—Chaotic
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04J—MULTIPLEX COMMUNICATION
    • H04J13/00—Code division multiplex systems
    • H04J13/0007—Code type
    • H04J13/004—Orthogonal
    • H04J13/0048—Walsh

Abstract

The invention discloses a multi-user orthogonal frequency division multiplexing differential chaos keying communication method, which comprises the following steps: 1) setting communication system parameters; 2) allocating index values for P users; 3) each user correspondingly selects a reference symbol sequence by using the index value; 4) generating chaotic reference signals of each user; 5) distributing sub-carriers for the chaotic reference signals of each user; 6) forming an information bearing signal for the user; 7) constructing an inverse Fourier transform input matrix; 8) obtaining a sending signal; 9) removing a cyclic prefix, performing serial-to-parallel conversion and performing Fourier transform on a received signal in sequence; 10) sampling the point with the maximum signal-to-noise ratio; 11) sample sequence recombination; 12) user index value recovery judgment; 13) selecting an element sequence of a row corresponding to the reference matrix as a new chaotic reference sequence; 14) and decoding the user transmission information data. The method of the invention ensures that the chaos reference sequence is more accurate, and further improves the error rate performance of the communication system.

Description

Multi-user orthogonal frequency division multiplexing differential chaos keying communication method
Technical Field
The invention belongs to the technical field of chaotic communication, and relates to a multi-user orthogonal frequency division multiplexing differential chaotic keying communication method.
Background
The chaotic signal is widely applied to communication due to the characteristics of wide frequency spectrum, noise-like noise, initial value sensitivity and the like, the chaotic communication is initially developed rapidly as a secret communication scheme, and the secret performance of the chaotic secret communication is proved to have no obvious advantages along with the research depth, so the research of the chaotic communication is transferred to the research of improving the communication performance by using chaos under an actual channel. Chaotic communication is not only successfully applied to fiber channels, but also a chaotic differential keying scheme, which is a classic spread spectrum communication scheme, forms a local area network communication standard, such as ieee802.15.6. However, due to the problems of low transmission efficiency, high error rate and the like of the chaotic differential keying scheme, the chaotic differential keying scheme based on the OFDM is provided, the transmission efficiency is improved, the error rate is lower, and a multiple access function is provided. In addition, the latest research results show that the chaos as a baseband signal receiving end can maximize the signal-to-noise ratio through a simple matched filter; meanwhile, the chaotic characteristic can also be used to solve an inter-symbol interference (ISI) problem in wireless communication.
Although chaos differential keying schemes based on OFDM have achieved good performance. But the system error rate is higher because the system introduces larger interference among users in the multiple access. Therefore, it is important to further obtain a lower error rate while reducing the inter-user interference in the multiple access.
Disclosure of Invention
The invention aims to provide a multi-user orthogonal frequency division multiplexing differential chaos keying communication method, which solves the problems of large multi-access interference and high error rate in the prior art.
The technical scheme adopted by the invention is that a multi-user orthogonal frequency division multiplexing differential chaos keying communication method is implemented according to the following steps:
step 1, setting relevant parameters of a communication system;
step 2, distributing index value I to P users of information to be sentpPreparing binary bit information b to be transmitted for each useri,pThe subscript i is 1,2, …, M, P is 1,2, …, and P indicates the ith bit of the data transmitted by the pth user in a frame;
step 3, each useThe user uses the index value to correspondingly select the element sequence of different rows of the Hadamard matrix as the reference symbol sequence
Figure BDA0002860934410000021
Step 4, the reference symbol sequence corresponding to each user is used as the input of the chaotic forming filter to generate chaotic reference signals corresponding to each user;
step 5, copying the chaotic reference signals of all users, distributing subcarriers for the chaotic reference signals of all users, and distributing the chaotic reference signal X obtained in the step 4p(t) repeating C times to obtain
Figure BDA0002860934410000022
C, 1,2, 4, distributing C private subcarrier frequencies uniformly distributed in a used frequency band for each user to transmit corresponding chaotic reference signals;
step 6, multiplying the bit data of the information to be transmitted of each user by the chaotic reference signal of the user to form an information bearing signal of the user, adding the information bearing signals corresponding to the users to obtain a sending signal in a shared subcarrier, sampling each subcarrier signal according to a sampling frequency to obtain corresponding sampling points to form a partial row of an inverse Fourier transform input matrix, and preparing for inverse Fourier transform;
step 7, adding comb-shaped pilot frequency, filling zero, and constructing an inverse Fourier transform input matrix;
step 8, performing inverse Fourier transform on the inverse Fourier transform input matrix column by column, performing parallel-serial conversion on the output of the inverse Fourier transform input matrix, and adding a cyclic prefix to obtain a sending signal;
step 9, after receiving the sending signal, the receiving end sequentially removes the cyclic prefix, performs serial-to-parallel conversion and performs Fourier transform on the received signal, extracts the received user chaotic reference signal and the information bearing signal according to the preset subcarrier, averages the C times chaotic reference signal transmitted by the user, and performs matched filtering with the information bearing signal respectively;
step 10, sampling the maximum signal-to-noise ratio points of the filtered chaotic reference signal and the filtered information bearing signal to obtain maximum signal-to-noise ratio point sequences X 'and Y' respectively sampled by the chaotic reference signal and the information bearing signal;
step 11, sample sequence recombination, namely recombining a chaos reference signal sample sequence and an information bearing sample sequence of a user respectively;
step 12, user index value recovery judgment, wherein each row of the Hadamard matrix which is the same as the transmitting end is firstly subjected to maximum signal-to-noise ratio point sampling on the output signal of the matched filter through a forming filter and the matched filter respectively to obtain a new reference matrix; calculating the Euclidean distance between the reference sequence recombined by the user and each row of the reference matrix, and selecting the row with the minimum distance as the recovered user index value;
step 13, selecting the element sequence of the corresponding row of the reference matrix as a new chaotic reference sequence by using the recovered index value, namely, according to the estimated value of the index value obtained in step 12
Figure BDA0002860934410000031
Selecting the row corresponding to the mapping reference matrix as a new chaotic reference sequence
Figure BDA0002860934410000032
Substitution of the recombined chaotic reference sequence
Figure BDA0002860934410000041
Step 14, decoding the user transmission information data, and carrying the information bearing sequence Y in step 11infAnd the chaos reference sequence obtained in step 13
Figure BDA0002860934410000042
The transpose of the data is multiplied, the symbol decision is taken as the product result, and the transmission data is recovered to finish decoding.
The beneficial effects of the invention are as follows:
1) the technology of the invention can reduce the multiple access interference. And each user at the transmitting end generates a chaotic reference signal by using row elements of the Hadamard matrix as a reference symbol sequence according to the index value, and the interference of other users to the current user is smaller when the users are distinguished due to the complete orthogonality among the rows of the Hadamard matrix. Since the order of the Hadamard matrix is an integral power of 2, the error rate will not be deteriorated with the increase of the number of users as long as the number of actual users is less than the maximum limited number of users in a certain spread spectrum range. Therefore, compared with the traditional OFDM differential keying scheme, the invention has smaller multiple access interference, thereby improving the system error rate performance.
2) The invention can obtain lower transmission error rate by utilizing the chaotic forming filter and the corresponding matched filter. The effect of maximizing the signal-to-noise ratio is achieved by using the corresponding matched filter at the receiving end, and the bit error rate performance is better due to the application of the point of maximizing the signal-to-noise ratio. The receiving end recovers the index value by using a maximum likelihood method, and then obtains an accurate reference sequence by using the index value, thereby further improving the error rate performance of the system.
Drawings
FIG. 1 is a block diagram of a transmitting end employed in the method of the present invention;
FIG. 2 is a block diagram of a receiving end employed by the method of the present invention;
FIG. 3 is a graph of the basis function of a chaotic shaping filter used in the method of the present invention;
FIG. 4 is a chaotic reference signal generated by a chaotic shaping filter according to the method of the present invention;
FIG. 5 is an information bearing signal to be transmitted in accordance with an embodiment of the method of the present invention;
FIG. 6 is a real part of a transmission signal according to an embodiment of the method of the present invention;
FIG. 7 illustrates an embodiment of the method of the present invention receiving an output signal of a chaotic reference signal through a matched filter;
FIG. 8 is a block diagram of a method embodiment of the present invention for receiving an information-bearing signal and outputting the signal through a matched filter;
FIG. 9 shows bit error rate simulation results of different methods for single users and 3 users under different spreading gains under Gaussian channels;
fig. 10 shows bit error rate simulation results of different methods for different spreading gains of single users and 3 users under a wireless channel;
Detailed Description
The present invention will be described in detail below with reference to the accompanying drawings and specific embodiments.
Referring to fig. 1 and fig. 2, which are block diagrams of a transmitting end and a receiving end of a communication system adopted by the method of the present invention, the method of the present invention is based on a chaos shaping filter and a Hadamard index modulation multi-user OFDM differential keying communication, and is specifically implemented according to the following steps:
step 1, setting relevant parameters of a communication system,
setting fundamental frequency f of chaotic shaping filtersSpread spectrum gain coefficient beta, sampling frequency fcA gain coefficient n of chaotic signs＝fc/fsDefining the number P of users and the number M of binary information bits which can be sent by each user in a frame of transmission signal;
setting subcarrier parameters including total carrier number N and number N of shared information transmission subcarriersmThe number of the extended subcarriers C of each user reference signal, the number of the comb pilot subcarriers Nct and the number of the guard interval subcarriers No, and N is equal to Nm+P*C+Nct+No(ii) a Defining the length L of cyclic prefix, and setting the dimension N of Hadamard matrixs＝β/nsGenerating a Hadamard matrix;
in the embodiment, the fundamental frequency f of the chaotic shaping filter is sets2.5MHz, sampling frequency fc40MHz, a chaotic sign gain coefficient nsLet Hadamard matrix dimension N16sWhen the spreading gain coefficient is 8, the spreading gain coefficient is ns*N s128, the number P of users is 5, and each user sends information M of one frame of transmission signal with 48 bits (binary number); subcarrier setting N128, Nm 48, C4, Nct 4, cyclic prefix length L4, the Hadamard matrix generated is as follows:
Figure BDA0002860934410000061
step 2, distributing P users of information to be sentIndex value IpPreparing binary bit information b to be transmitted for each useri,pThe subscript i is 1,2, …, M, P is 1,2, …, and P indicates the ith bit of the data transmitted by the pth user in a frame;
in the embodiment, it is assumed that 5 users of information to be transmitted are assigned index values, i.e. I1＝1，I2＝2，I3＝3，I4＝4，I5Each subscriber transmits 48 binary bit information b, 5i,pWherein i is 1,2, 48, and p is 1,2, 5.
Step 3, each user correspondingly selects element sequences of different rows of the Hadamard matrix by using the index values as reference symbol sequences
Figure BDA0002860934410000062
In the embodiment, 5-user scenes are selected, wherein the first 5 rows are selected as indexes in the selection sequence, and the 1 st user selects the first 5 rows as indexes according to the index value I1The first row of the Hadamard matrix is selected as the reference symbol sequence 1, i.e.
Figure BDA0002860934410000071
w＝1,2,...,NsRepresents a vector subscript; and so on to obtain the reference symbol sequences of other 4 users
Figure BDA0002860934410000072
Step 4, the reference symbol sequence corresponding to each user is used as the input of the chaotic shaping filter to generate the chaotic reference signal corresponding to each user,
will be provided with
Figure BDA0002860934410000073
The output Chaotic reference signals are respectively obtained as the inputs of a Chaos Shaping Filter (CSF) as follows, and are shown in formula (1):
Figure BDA0002860934410000074
wherein t is the time for generating a user chaotic reference signal, Xp(T) is the output of the chaotic shaping filter as the chaotic reference signal of the pth user, Ts＝1/fsFor the duration of one symbol in the reference symbol sequence, the basis function ψ (t) is as shown in equation (2):
Figure BDA0002860934410000075
wherein f issFor the fundamental frequency of the chaotic shaping filter set in step 1, the parameter ω is 2 π fs，η＝fs ln2；
In the embodiment, the sampling frequency f is set in step 1c40MHz, chaotic signal fundamental frequency fs2.5MHz, a chaotic sign gain coefficient ns16, the corresponding sampling time t is 0,1/fc,2/fc…, fig. 3 is a plot of the basis functions of the corresponding chaotic shaping filter. The chaos shaping filter realizes the convolution operation of the digital signal and the primary function psi (t), and the reference symbol sequence of each user in step 3
Figure BDA0002860934410000081
As an input of the chaotic shaping filter, the chaotic reference signal of the 3 rd user in the embodiment is shown in FIG. 4, wherein the solid line is the generated chaotic reference signal X3(t) dashed lines are corresponding reference symbol sequences
Figure BDA0002860934410000082
In addition, due to the fundamental frequency fs2.5MHz, available X3(t) duration t ∈ [0,3.2 × 10 ∈ ]-6)s。
Step 5, copying the chaotic reference signals of all users, distributing subcarriers for the chaotic reference signals of all users, and distributing the chaotic reference signal X obtained in the step 4p(t) repeating C times to obtain
Figure BDA0002860934410000083
c is 1,2, 4, eachC private subcarrier frequencies are uniformly distributed in a use frequency band by each user to send corresponding chaotic reference signals;
in an embodiment, C is 4, that is, the chaotic reference signal of each user obtained in step 4 is repeated 4 times, for example, the chaotic reference signal X of the 3 rd user3(t) repeating the reaction 4 times to obtain
Figure BDA0002860934410000084
The 4 private subcarriers of the user are evenly distributed over the entire available spectrum to cope with frequency selective fading in the channel. In 5 user scenarios, 20 private subcarriers are used together to transmit the chaotic reference signal. The total carrier number is 128, and the 5-user private carrier range is set to ([31: 35)],[49:53],[67:71],[85:89])。
Step 6, multiplying the bit data of the information to be transmitted of each user by the user chaotic reference signal to form an information bearing signal of the user, adding the information bearing signals corresponding to the users to obtain a sending signal in a shared subcarrier, sampling each subcarrier signal according to a sampling frequency to obtain corresponding sampling points to form a part of rows of an inverse Fourier transform input matrix to prepare for inverse Fourier transform,
the information-bearing signal transmitted by the ith shared subcarrier carries the ith bit superposition information of all P users, and the information-bearing signal is shown in the following formula (3):
Figure BDA0002860934410000091
wherein b isi,pI-th binary data, i-1, 2, M, X, representing the p-th user transmissionp(t) is the chaotic reference signal of the p-th user,
transmitting signal Y for each subcarrieri(t) according to the sampling frequency fcSampling to obtain a sampling matrix of the information bearing signal:
Figure BDA0002860934410000092
wherein Y isi(k)＝Yi(kΔt)，Δt＝1/fcIs the sampling time;
in an embodiment, the 3 rd information carrying signal
Figure BDA0002860934410000093
Is shown in fig. 5, in which the sampling points are marked with crosses, during which time the time is equal to 1/f in terms of Δ tc＝4*10-7A second sample may result in 128 samples. And drawing a graph and obtaining sampling points for other carrier transmission signals. In addition, 48 shared subcarriers are set to be allocated within 128 subcarriers in the range of ([36: 47)],[54:65],[72:83],[90:101])。
Step 7, adding comb-shaped pilot frequency, filling zero, constructing an inverse Fourier transform input matrix,
setting NctEach subcarrier transmits a comb-shaped pilot signal consisting of bipolar symbols of (N)ctX beta) matrix, and pilot frequency sub-carriers are uniformly inserted into the sub-carriers of the chaotic reference signal and the information carrying signal; the chaotic reference signal obtained in the step 5 is used for
Figure BDA0002860934410000094
According to the sampling period delta t being 1/fcSampling to obtain a chaotic reference signal sampling matrix, an information bearing signal sampling matrix Y obtained in the step 6 and a comb-shaped pilot signal matrix in the front of the step, and arranging the chaotic reference signal sampling matrix, the information bearing signal sampling matrix Y and the comb-shaped pilot signal matrix in parallel according to a preset sequence, wherein the rest N are0Row complementary zero matrix UoObtaining a matrix with the size of (Nxbeta) as an inverse Fourier transform input matrix;
in the examples, N ct4, the comb pilot consists of [1,1, -1,1]TSpreading 128 times results in a (4 × 128) comb pilot signal matrix. And arranging the obtained reference signal sampling (20 × 128) matrix, the information bearing signal sampling (48 × 128) matrix and the comb-shaped pilot signal (4 × 128) matrix in parallel according to a preset sequence, and then complementing (56 × 128) zero matrixes to obtain (128 × 128) inverse Fourier transform input matrixes. In the step 5 and step 6 embodiments are givenChaotic reference signal and information bearing signal subcarrier range, comb pilot subcarrier range is ([30,48,66, 84)]) The remaining two sides of the subcarrier range ([1:31 ]],[102:128]) Is a guard interval.
Step 8, inverse Fourier transform is carried out on the inverse Fourier transform input matrix column by column, the output of the inverse Fourier transform input matrix is added with cyclic prefix after parallel-serial conversion to obtain a sending signal,
step 7, obtaining an inverse fourier transform input matrix of (N × β) as an input of inverse fourier transform, performing IFFT operation on N points in each column to complete an OFDM symbol transform, performing IFFT operation on a frame for β times (columns), and performing parallel-to-serial conversion on IFFT output to obtain a time domain signal s (t), which is represented by formula (4):
Figure BDA0002860934410000101
where k is a sampling point of a signal on one subcarrier, and f is a sampling point of a signal on one subcarrierc,pThe sub-carrier frequency of the c reference expansion of the p user, fiFor the ith information carrying signal subcarrier frequency, fdAnd foThe carrier frequencies of the comb pilot and the zero padding matrix are respectively, d is 1,2, …, Nct，o＝1,2,…,No(ii) a Then, copying L sampling points at the tail of the beta sampling points corresponding to each OFDM symbol, and adding the copied sampling points to the front end of the symbol to be used as cyclic prefixes, so as to obtain a sending signal;
in an embodiment, the inverse fourier transform is input as a (128 × 128) matrix, and the output matrix is parallel-to-serial converted to obtain a time duration of (128 × 128) TcT, Tc＝1/fcFor the duration of one sample, then L-4 samples (corresponding to 4T) at the end of each OFDM symbolcDuration) is added at the front of the symbol, resulting in a duration of (128 x (128+4)) TcThe transmission signal of (1). The center frequency is set to be 1MHz in the formula (4), fc,p、fi、fd、foCorresponding to the subcarrier ranges in the embodiments of step 5, step 6 and step 7, respectively. The real part of the corresponding time domain signal s (t) is shown in FIG. 6。
Step 9, after receiving the sending signal, the receiving end sequentially removes the cyclic prefix, performs serial-to-parallel conversion and performs Fourier transform on the received signal, extracts the received user chaotic reference signal and the information bearing signal according to the preset subcarrier, averages the C times chaotic reference signal transmitted by the user, and performs matched filtering with the information bearing signal respectively;
i.e. the received signal r of the p-th userp(t) obtaining an (Nxbeta) Fourier transform output matrix by removing the cyclic prefix, performing serial-to-parallel conversion and Fourier transform, and then extracting the chaotic reference signal X 'and the information bearing signal Y' of the user according to preset subcarrier allocation, as shown in formula (5):
Figure BDA0002860934410000111
wherein the content of the first and second substances,
Figure BDA0002860934410000112
k-th sampling point, Y ', representing the c-th copy of the received p-th user chaotic reference signal'i,kA kth sampling point representing a received ith information-bearing signal; n is1(k) And n2(k) Respectively representing the noise of a channel during the transmission of the chaotic reference signal and the noise of the channel during the transmission of the information bearing signal; hk,p,fcRepresents the equivalent multi-path fading channel impulse response transmitted by the c-th chaotic reference signal copy of the p-th user in the channel,
Figure BDA0002860934410000127
representing the equivalent multipath fading channel impulse response transmitted by the information-bearing signal received by the p-th user in the ith subcarrier channel, the expression of the impulse responses of the two multipath fading channels is shown as the formula (6):
Figure BDA0002860934410000121
wherein the content of the first and second substances,
Figure BDA0002860934410000122
and τl,p,cRespectively representing the attenuation coefficient and delay time of the ith path of the channel in which the chaotic reference signal is transmitted, Lp,cThe number of multipath of the c sub-carrier channel of the p user; in the same way as above, the first and second,
Figure BDA0002860934410000123
and τl′,iRespectively representing the attenuation coefficient and delay time of the L' th path of the channel in which the information-bearing signal is transmitted, LiAs to the number of multi-paths,
since the chaotic reference signal of each user is copied for C times, the received C chaotic reference signals are averaged to obtain an averaged chaotic reference signal of the user
Figure BDA0002860934410000124
As shown in the following formula (7):
Figure BDA0002860934410000125
then, the averaged chaotic reference signal and information bearing signal are subjected to matched filtering to obtain a chaotic reference signal X 'and an information bearing signal Y' which are subjected to matched filtering, and the output of the matched filtering is as shown in a formula (8):
Figure BDA0002860934410000126
wherein g (t) ═ ψ (-t) is the time inverse function of the basis function of the chaotic shaping filter, X ″p,kThe k sampling point, Y' of the output signal of the filter after the chaos reference signal of the p user is averagedi,kA kth sampling point representing an output signal of the ith information-bearing signal after passing through the filter;
in the embodiment, in order to clearly show the signal variation law, an ideal channel model is considered, namely n1(t)＝n2(t) 0 and Hk,p,fc＝H k,p,fi1. The matched filter realizes the convolution operation of the time inverse of the received signal and the basis function, and the 3 rd user filtered chaotic reference signal and the i-3 th bit information bearing signal X ″3(t) and Y ″)3(t) are shown in FIGS. 7 and 8, respectively.
Step 10, maximum signal-to-noise ratio point sampling is carried out on the filtered chaotic reference signal and the filtered information bearing signal, so as to obtain maximum signal-to-noise ratio point sequences X 'and Y' respectively sampled by the chaotic reference signal and the information bearing signal, wherein an expression is shown as a formula (9):
Figure BDA0002860934410000131
wherein w' is 1,2sSampling points with the maximum signal-to-noise ratio;
in the examples, β 128, NsThe filtered signal obtained in step 9 is sampled according to the above formula (9), and the corresponding sampling sequence and sampling value are shown in table 1 below, and the star marks in fig. 7 and fig. 8.
Table 1, sample sequences and sample values of the 3 rd user chaotic reference signal and the i ═ 3 th information carrying signal after filtering in the embodiment
Figure BDA0002860934410000132
Step 11, sample sequence recombination, namely recombining the chaos reference signal sample sequence and the information bearing sample sequence of the user respectively, wherein the expression is shown as the formula (10):
Figure BDA0002860934410000141
in the embodiment, the sampling sequences obtained in step 10 are respectively recombined according to the above formula (10) to obtain the chaos reference sequence and the information bearing sequence of the 3 rd user, and the expression is as follows:
Figure BDA0002860934410000142
step 12, user index value recovery judgment, wherein each row of the Hadamard matrix which is the same as the transmitting end is firstly subjected to maximum signal-to-noise ratio point sampling on the output signal of the matched filter through a forming filter and the matched filter respectively to obtain a new reference matrix; then calculating Euclidean distance between the reference sequence recombined by the user and each row of the reference matrix, selecting the row with the minimum distance as the recovered user index value,
let the reference matrix obtained by sampling each row of the Hadamard matrix with the maximum SNR point after CSF and MF be
Figure BDA0002860934410000145
gqIs the q-th row in the reference matrix; then calculating Euclidean distance between the recombined reference sequence and each row in the reference matrix G, and selecting the row with the minimum distance as the estimated value of the user index value
Figure BDA0002860934410000143
The expression is shown in formula (11):
Figure BDA0002860934410000144
wherein sum (·) is summation operation, and min {. } is minimum value calculation;
in an embodiment, the expression of the reference matrix is:
Figure BDA0002860934410000151
subjecting to step 11
Figure BDA0002860934410000152
And the reference matrix is substituted into the formula (11) to obtain
Figure BDA0002860934410000153
Step 13, selecting the element sequence of the corresponding row of the reference matrix as a new chaotic reference sequence by using the recovered index value, namely, according to the estimated value of the index value obtained in step 12
Figure BDA0002860934410000154
Selecting the row corresponding to the mapping reference matrix as a new chaotic reference sequence
Figure BDA0002860934410000155
Substitution of the recombined chaotic reference sequence
Figure BDA0002860934410000156
In the embodiment, the index value estimated value calculated by the 3 rd user at the receiving end is
Figure BDA0002860934410000157
Thus, the 3 rd row of the mapping reference matrix G is selected as a new chaotic reference sequence, i.e.
Figure BDA0002860934410000158
And so on to analogize the chaotic reference sequences of the other four users.
Step 14, decoding the user transmission information data, and carrying the information bearing sequence Y in step 11infAnd the chaos reference sequence obtained in step 13
Figure BDA0002860934410000159
The transpose multiplication, the symbol decision is taken as the result of the multiplication, the transmission data is recovered to finish the decoding,
estimated value of M binary data recovered by p-th user
Figure BDA00028609344100001510
As shown in equation (12):
Figure BDA00028609344100001511
wherein (.)TRepresenting matrix transposition, sgn { } representing symbol taking operation, and finally obtaining
Figure BDA00028609344100001512
The matrix is used for completing the decoding process for M binary data transmitted by a frame of the pth user;
in the embodiment, the example of decoding the transmission bit data of the 3 rd user and the information carrying sequence Y obtained in step 11infAnd the chaos reference sequence obtained in step 13
Figure BDA0002860934410000161
Belt (12), the calculation results are as follows:
Figure BDA0002860934410000162
binary data estimation value transmitted by other users
Figure BDA0002860934410000163
And by parity of reasoning, finishing the whole decoding process to obtain the final product.
Simulation verification:
1) error rate in single path channel.
The simulation adopts a gaussian channel model, the error rate performance of different schemes under the same spreading gain and the same user access number is tested, and the simulation result is shown in fig. 9. The simulation is compared with a chaos keying modulation scheme based on multi-user OFDM. The spread spectrum gain of all schemes is set to be beta-64 and 256, the number of users is single user and 3 users, and the sampling frequency fc40MHz, wherein the scheme has a chaotic signal fundamental frequency fs2.5MHz, then corresponds to ns16. Setting M to 48 indicates that 48 binary bits of information are transmitted per user per frame. In fig. 9, the abscissa represents the signal-to-noise ratio and the ordinate represents the bit error rate. The dash-dot line and the dot-dash-dot line in the figure are error rate curves of the comparison scheme in a single-user scene and a 3-user scene beta of 64 respectively, and the left triangular dot-dot line and the right triangular dot-The dotted lines are error rate curves of the comparison scheme in the single-user and 3-user scenarios β ═ 256, the dotted lines and the circular dotted lines are error rate curves of the proposed scheme in the single-user and 3-user scenarios β ═ 64, respectively, and the solid lines and the circular straight lines are error rate curves of the proposed scheme in the single-user and 3-user scenarios β ═ 256, respectively. As can be seen from the simulation result of fig. 9, the method of the present invention has a lower error rate at the same spreading gain and the same number of user accesses compared to the comparison scheme (the chaos keying modulation scheme based on multi-user OFDM). Meanwhile, different from the comparison scheme, the method provided by the invention has the advantage that the information error rate is basically kept constant along with the increase of the user number M on the premise of a single-path channel and fixed spread spectrum gain.
2) Error rate under wireless channel.
Under a wireless channel, the bit error rate performance under the same spreading gain and the same user access number is shown in fig. 10, all communication parameter settings are consistent with the simulation under the gaussian channel, and the meaning of each curve representation in fig. 10 is consistent with that in fig. 9. The average power gain of the three paths in the simulation is E1＝0.6、E2＝0.3、E30.1, each corresponding delay time τ 10 second,. tau20.0000009 seconds,. tau20.000001 sec. It can be seen that the method of the present invention always has better error code performance under the same spread spectrum gain and user number.
In summary, the method of the present invention uses the chaotic shaping filter to generate the chaotic reference signal, and uses the matched filter to reduce the interference effect, and the chaotic signal realizes the modulation of the user index Hadamard matrix symbol, so that the communication system has multi-user capability, and the multiple access interference is greatly reduced. The receiving end reduces the influence of environmental noise by using the corresponding matched filter, and simultaneously, the chaotic reference sequence is more accurate by using the method of calculating the Euclidean distance and mapping, thereby further improving the error rate performance of the communication system.

Claims (10)

1. A multi-user orthogonal frequency division multiplexing differential chaos keying communication method is characterized by comprising the following steps:
step 1, setting relevant parameters of a communication system;
step 2, distributing index value I to P users of information to be sentpPreparing binary bit information b to be transmitted for each useri,pThe subscript i is 1,2, …, M, P is 1,2, …, and P indicates the ith bit of the data transmitted by the pth user in a frame;
step 3, each user correspondingly selects element sequences of different rows of the Hadamard matrix by using the index values as reference symbol sequences
Figure FDA0002860934400000011
Step 4, the reference symbol sequence corresponding to each user is used as the input of the chaotic forming filter to generate chaotic reference signals corresponding to each user;
step 5, copying the chaotic reference signals of all users, distributing subcarriers for the chaotic reference signals of all users, and distributing the chaotic reference signal X obtained in the step 4p(t) repeating C times to obtain
Figure FDA0002860934400000012
C, 1,2, 4, distributing C private subcarrier frequencies uniformly distributed in a used frequency band for each user to transmit corresponding chaotic reference signals;
step 6, multiplying the bit data of the information to be transmitted of each user by the chaotic reference signal of the user to form an information bearing signal of the user, adding the information bearing signals corresponding to the users to obtain a sending signal in a shared subcarrier, sampling each subcarrier signal according to a sampling frequency to obtain corresponding sampling points to form a partial row of an inverse Fourier transform input matrix, and preparing for inverse Fourier transform;
step 7, adding comb-shaped pilot frequency, filling zero, and constructing an inverse Fourier transform input matrix;
step 8, performing inverse Fourier transform on the inverse Fourier transform input matrix column by column, performing parallel-serial conversion on the output of the inverse Fourier transform input matrix, and adding a cyclic prefix to obtain a sending signal;
step 9, after receiving the sending signal, the receiving end sequentially removes the cyclic prefix, performs serial-to-parallel conversion and performs Fourier transform on the received signal, extracts the received user chaotic reference signal and the information bearing signal according to the preset subcarrier, averages the C times chaotic reference signal transmitted by the user, and performs matched filtering with the information bearing signal respectively;
step 10, sampling the maximum signal-to-noise ratio points of the filtered chaotic reference signal and the filtered information bearing signal to obtain maximum signal-to-noise ratio point sequences X 'and Y' respectively sampled by the chaotic reference signal and the information bearing signal;
step 11, sample sequence recombination, namely recombining a chaos reference signal sample sequence and an information bearing sample sequence of a user respectively;
step 12, user index value recovery judgment, wherein each row of the Hadamard matrix which is the same as the transmitting end is firstly subjected to maximum signal-to-noise ratio point sampling on the output signal of the matched filter through a forming filter and the matched filter respectively to obtain a new reference matrix; calculating the Euclidean distance between the reference sequence recombined by the user and each row of the reference matrix, and selecting the row with the minimum distance as the recovered user index value;
step 13, selecting the element sequence of the corresponding row of the reference matrix as a new chaotic reference sequence by using the recovered index value, namely, according to the estimated value of the index value obtained in step 12
Figure FDA0002860934400000021
Selecting the row corresponding to the mapping reference matrix as a new chaotic reference sequence
Figure FDA0002860934400000022
Substitution of the recombined chaotic reference sequence
Figure FDA0002860934400000023
Step 14, decoding the user transmission information data, and carrying the information bearing sequence Y in step 11infAnd the chaos reference sequence obtained in step 13
Figure FDA0002860934400000024
The transpose of the data is multiplied, the symbol decision is taken as the product result, and the transmission data is recovered to finish decoding.
2. The multi-user orthogonal frequency division multiplexing differential chaos keying communication method of claim 1, wherein: in the step 1, the specific process is that the fundamental frequency f of the chaotic shaping filter is setsSpread spectrum gain coefficient beta, sampling frequency fcA gain coefficient n of chaotic signs＝fc/fsDefining the number P of users and the number M of binary information bits which can be sent by each user in a frame of transmission signal;
setting subcarrier parameters including total carrier number N and number N of shared information transmission subcarriersmThe number of the reference signal extension sub-carriers C of each user and the number of the comb-shaped pilot frequency sub-carriers NctAnd the number No of guard interval subcarriers, and satisfy N ═ Nm+P*C+Nct+No(ii) a Defining the length L of cyclic prefix, and setting the dimension N of Hadamard matrixs＝β/nsAnd generating a Hadamard matrix.
3. The multi-user orthogonal frequency division multiplexing differential chaos keying communication method of claim 2, wherein: in the step 4, the specific process is that
Figure FDA0002860934400000031
The chaos reference signals are respectively used as the input of the following chaos shaping filter to obtain the output chaos reference signals, as shown in formula (1):
Figure FDA0002860934400000032
wherein t is the time for generating a user chaotic reference signal, Xp(T) is the output of the chaotic shaping filter as the chaotic reference signal of the pth user, Ts＝1/fsFor a symbol in a sequence of reference symbolsThe basis function ψ (t) is as shown in equation (2):
Figure FDA0002860934400000033
wherein f issFor the fundamental frequency of the chaotic shaping filter set in step 1, the parameter ω is 2 π fs，η＝fsln2。
4. The multi-user orthogonal frequency division multiplexing differential chaos keying communication method of claim 3, wherein: in step 6, the specific process is that the information-bearing signal transmitted by the ith shared subcarrier carries the ith bit superposition information of all P users, and the information-bearing signal is as shown in the following formula (3):
Figure FDA0002860934400000041
wherein b isi,pI-th binary data, i-1, 2, M, X, representing the p-th user transmissionp(t) is the chaotic reference signal of the p-th user,
transmitting signal Y for each subcarrieri(t) according to the sampling frequency fcSampling to obtain a sampling matrix of the information bearing signal:
Figure FDA0002860934400000042
wherein Y isi(k)＝Yi(kΔt)，Δt＝1/fcIs the sampling time.
5. The multi-user orthogonal frequency division multiplexing differential chaos keying communication method of claim 4, wherein: in the step 7, the specific process is to set NctEach subcarrier transmits a comb-shaped pilot signal consisting of bipolar symbols of (N)ctX beta) matrix, and pilot frequency sub-carriers are uniformly inserted into the sub-carriers of the chaotic reference signal and the information carrying signal; the chaotic reference signal obtained in the step 5 is used for
Figure FDA0002860934400000043
According to the sampling period delta t being 1/fcSampling to obtain a chaotic reference signal sampling matrix, an information bearing signal sampling matrix Y obtained in the step 6 and a comb-shaped pilot signal matrix in the front of the step, and arranging the chaotic reference signal sampling matrix, the information bearing signal sampling matrix Y and the comb-shaped pilot signal matrix in parallel according to a preset sequence, wherein the rest N are0Row complementary zero matrix UoAnd obtaining a matrix with the size of (N multiplied by beta) as an inverse Fourier transform input matrix.
6. The multi-user orthogonal frequency division multiplexing differential chaos keying communication method of claim 5, wherein: in step 8, the specific process is that the inverse fourier transform input matrix (N × β) obtained in step 7 is used as the input of inverse fourier transform, each column performs N-point IFFT operation to complete an OFDM symbol transform, β (column) IFFT operations are performed for a frame, and the IFFT outputs are parallel-to-serial converted to obtain a time domain signal s (t), which is represented by formula (4):
Figure FDA0002860934400000051
where k is a sampling point of a signal on one subcarrier, and f is a sampling point of a signal on one subcarrierc,pThe sub-carrier frequency of the c reference expansion of the p user, fiFor the ith information carrying signal subcarrier frequency, fdAnd foThe carrier frequencies of the comb pilot and the zero padding matrix are respectively, d is 1,2, …, Nct，o＝1,2,…,No(ii) a And then, copying L sampling points at the tail of the beta sampling points corresponding to each OFDM symbol, and adding the copied sampling points to the front end of the symbol to be used as cyclic prefixes, so as to obtain the sending signal.
7. The multi-user orthogonal frequency division multiplexing differential chaos keying communication method of claim 6, whereinIs characterized in that: in step 9, the specific process is that the received signal r of the p-th user isp(t) obtaining an (Nxbeta) Fourier transform output matrix by removing the cyclic prefix, performing serial-to-parallel conversion and Fourier transform, and then extracting the chaotic reference signal X 'and the information bearing signal Y' of the user according to preset subcarrier allocation, as shown in formula (5):
Figure FDA0002860934400000061
Figure FDA0002860934400000062
wherein the content of the first and second substances,
Figure FDA0002860934400000063
k-th sampling point, Y ', representing the c-th copy of the received p-th user chaotic reference signal'i,kA kth sampling point representing a received ith information-bearing signal; n is1(k) And n2(k) Respectively representing the noise of a channel during the transmission of the chaotic reference signal and the noise of the channel during the transmission of the information bearing signal;
Figure FDA0002860934400000067
represents the equivalent multi-path fading channel impulse response transmitted by the c-th chaotic reference signal copy of the p-th user in the channel,
Figure FDA0002860934400000068
representing the equivalent multipath fading channel impulse response transmitted by the information-bearing signal received by the p-th user in the ith subcarrier channel, the expression of the impulse responses of the two multipath fading channels is shown as the formula (6):
Figure FDA0002860934400000064
wherein the content of the first and second substances,
Figure FDA0002860934400000069
and τl,p,cRespectively representing the attenuation coefficient and delay time of the ith path of the channel in which the chaotic reference signal is transmitted, Lp,cThe number of multipath of the c sub-carrier channel of the p user; in the same way as above, the first and second,
Figure FDA00028609344000000610
and τl′,iRespectively representing the attenuation coefficient and delay time of the L' th path of the channel in which the information-bearing signal is transmitted, LiAs to the number of multi-paths,
since the chaotic reference signal of each user is copied for C times, the received C chaotic reference signals are averaged to obtain an averaged chaotic reference signal of the user
Figure FDA0002860934400000065
As shown in the following formula (7):
Figure FDA0002860934400000066
then, the averaged chaotic reference signal and information bearing signal are subjected to matched filtering to obtain a chaotic reference signal X 'and an information bearing signal Y' which are subjected to matched filtering, and the output of the matched filtering is as shown in a formula (8):
Figure FDA0002860934400000071
wherein g (t) ═ ψ (-t) is the time inverse function of the basis function of the chaotic shaping filter, X ″p,kThe k sampling point, Y' of the output signal of the filter after the chaos reference signal of the p user is averagedi,kRepresenting the kth sample point of the output signal after the ith information-bearing signal has passed through the filter.
8. The multi-user orthogonal frequency division multiplexing differential chaos keying communication method of claim 7, wherein: in the step 10, the specific process is that the chaos reference signal and the information-bearing signal are sampled respectively to obtain maximum snr point sequences X '″ and Y' ″, and the expression is as shown in formula (9):
Figure FDA0002860934400000072
wherein w' is 1,2sThe number of sampling points is the maximum signal-to-noise ratio.
9. The multi-user orthogonal frequency division multiplexing differential chaos keying communication method of claim 8, wherein: in the step 11, the specific process is to recombine the chaos reference signal sampling sequence and the information bearing sampling sequence of the user respectively, and the expression is shown as the formula (10):
Figure FDA0002860934400000081
Figure FDA0002860934400000082
10. the multi-user orthogonal frequency division multiplexing differential chaos keying communication method of claim 9, wherein: in the step 12, the specific process is to set a reference matrix obtained by sampling each row of the Hadamard matrix with the maximum snr point after CSF and MF as
Figure FDA0002860934400000085
gqIs the q-th row in the reference matrix; then calculating Euclidean distance between the recombined reference sequence and each row in the reference matrix G, and selecting the row with the minimum distance as the estimation of the user index valueValue of
Figure FDA0002860934400000083
The expression is shown in formula (11):
Figure FDA0002860934400000084
wherein sum (·) is summation operation, and min {. is minimum value operation.
CN202011565976.5A 2020-12-25 2020-12-25 Multi-user orthogonal frequency division multiplexing differential chaos keying communication method Active CN112822133B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202011565976.5A CN112822133B (en) 2020-12-25 2020-12-25 Multi-user orthogonal frequency division multiplexing differential chaos keying communication method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202011565976.5A CN112822133B (en) 2020-12-25 2020-12-25 Multi-user orthogonal frequency division multiplexing differential chaos keying communication method

Publications (2)

Publication Number Publication Date
CN112822133A true CN112822133A (en) 2021-05-18
CN112822133B CN112822133B (en) 2022-07-26

Family

ID=75853934

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202011565976.5A Active CN112822133B (en) 2020-12-25 2020-12-25 Multi-user orthogonal frequency division multiplexing differential chaos keying communication method

Country Status (1)

Country Link
CN (1) CN112822133B (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113612713A (en) * 2021-06-21 2021-11-05 深圳信恳智能电子有限公司 Chaos multiple access combines OFDM's safe communication system in 5G network

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20050041746A1 (en) * 2003-08-04 2005-02-24 Lowell Rosen Software-defined wideband holographic communications apparatus and methods
US20120250783A1 (en) * 2010-07-26 2012-10-04 John David Terry Method and Apparatus for Communicating Data in a Digital Chaos Communication System
CN106357576A (en) * 2016-10-28 2017-01-25 河南理工大学 Hadamard matrix-based related delay keying chaos communication method
CN110365365A (en) * 2019-07-19 2019-10-22 西安理工大学 A kind of multi-system differential Chaos Shift Keying method based on chaos molding filtration
CN111628955A (en) * 2020-06-04 2020-09-04 南京邮电大学 Dual-mode multi-carrier differential chaotic shift keying modulation method and transmitter
CN111756664A (en) * 2020-06-18 2020-10-09 南京邮电大学 Short reference carrier index differential chaotic shift keying modulation and demodulation method and system
CN111988251A (en) * 2019-05-21 2020-11-24 重庆邮电大学 Improved orthogonal multi-user differential chaotic communication system

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20050041746A1 (en) * 2003-08-04 2005-02-24 Lowell Rosen Software-defined wideband holographic communications apparatus and methods
US20120250783A1 (en) * 2010-07-26 2012-10-04 John David Terry Method and Apparatus for Communicating Data in a Digital Chaos Communication System
CN106357576A (en) * 2016-10-28 2017-01-25 河南理工大学 Hadamard matrix-based related delay keying chaos communication method
CN111988251A (en) * 2019-05-21 2020-11-24 重庆邮电大学 Improved orthogonal multi-user differential chaotic communication system
CN110365365A (en) * 2019-07-19 2019-10-22 西安理工大学 A kind of multi-system differential Chaos Shift Keying method based on chaos molding filtration
CN111628955A (en) * 2020-06-04 2020-09-04 南京邮电大学 Dual-mode multi-carrier differential chaotic shift keying modulation method and transmitter
CN111756664A (en) * 2020-06-18 2020-10-09 南京邮电大学 Short reference carrier index differential chaotic shift keying modulation and demodulation method and system

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
HAI-PENG REN: "Multi-carrier Differential Chaos Shift Keying Wireless Communication Based On Chaotic Shape-forming Filter", 《 2019 CHINESE AUTOMATION CONGRESS (CAC)》 *
张刚等: "改进型OMU-NRDCSK通信系统的设计与分析", 《西安电子科技大学学报》 *
王世练等: "MIMO多径衰落信道下的多载波混沌键控混沌通信", 《国防科技大学学报》 *

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113612713A (en) * 2021-06-21 2021-11-05 深圳信恳智能电子有限公司 Chaos multiple access combines OFDM's safe communication system in 5G network
CN113612713B (en) * 2021-06-21 2024-01-12 深圳信恳智能电子有限公司 Chaotic multiple access OFDM-combined secure communication system in 5G network

Also Published As

Publication number Publication date
CN112822133B (en) 2022-07-26

Similar Documents

Publication Publication Date Title
Li et al. Subspace-based blind channel estimation for OFDM by exploiting virtual carriers
Petropulu et al. Blind OFDM channel estimation through simple linear precoding
Dinis et al. A multiple access scheme for the uplink of broadband wireless systems
CN1643867B (en) Device and method for estimating channels
Tepedelenlioglu et al. Low-complexity multipath diversity through fractional sampling in OFDM
CN101399803B (en) Multi-user detection method and device for OFDM signal
CN100395975C (en) Reception of multicarrier spread- sprectrum signals
Chung Spectral precoding for rectangularly pulsed OFDM
CN112491756A (en) RLS channel estimation method for joint channel equalization in FBMC system
Liu et al. Low PAPR OFDM-based DCSK design with carrier interferometry spreading codes
CN109617840B (en) Partial FFT communication signal detection method based on overlap reservation method
CN112822133B (en) Multi-user orthogonal frequency division multiplexing differential chaos keying communication method
Wang et al. Complementary coded CDMA systems with CP-free OFDM
CN116566780B (en) Multi-user multi-carrier DCSK communication method and system based on sparse code multiple access
CN106059980B (en) It is a kind of based on fast frequency-hopped multi-carrier spread spectrum method
CN1801792A (en) Channel estimating method in MIMO-OFDM system
CN112637096B (en) Differential keying communication method based on chaotic shaping filter and pulse position modulation
Zhang et al. Complexity reduction for MC-CDMA with MMSEC
Khan et al. Data aided channel estimation for MIMO-OFDM wireless systems using reliable carriers
Ho et al. Iterative detection for pretransformed OFDM by subcarrier reconstruction
Cain et al. Low-complexity universal-filtered multi-carrier for beyond 5G wireless systems
Zemen OFDM multi-user communication over time-variant channels
Banelli et al. Spectral efficiency of multicarrier schemes for 5G
Huang Diversity performance of precoded OFDM with MMSE equalization
Rangaraj et al. Improved channel estimation for OFDM based WLAN systems

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant