Code shift differential chaotic shift keying modulation and demodulation method and modem
By introducing orthogonal code and time index modulation technology into the code shift differential chaotic shift keying modulation and demodulation method, the problem of poor transmission rate and bit error performance of the CS-DCSK modem and demodulation method is solved, and a higher The transmission rate and lower bit error rate are avoided.
Patent Information
- Application Number
- CN202411170937.3
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2024-08-26
- Publication Date
- 2024-11-05
- Estimated Expiration
- 2044-08-26
AI Technical Summary
The transmission rate and bit error performance of the existing code shift differential chaotic shift keying (CS-DCSK) modem and demodulation methods are poor, and it is difficult to avoid the use of broadband RF delay lines in the receiver, which limits its application.
The code shift differential chaotic shift keying modulation and demodulation method is adopted to superimpose information and reference signals through the steps of serial/parallel conversion, polarity modulation, zero-complement code generation, zero-plug module, Cronek multiplication, etc., and Use orthogonal code distinction and combined with time index modulation technology to achieve effective demodulation of the signal.
Under the premise that the system order is the same, the bit transmission rate is increased, the bit error rate is reduced, and the broadband RF delay line is avoided in the receiver, which is conducive to the implementation of the CMOS circuit.
Smart Images

Figure CN118677735B_ABST
Abstract
Description
Technical Field
[0001] The invention relates to the field of communication technology, and in particular to a code shift differential chaotic shift keying modulation and demodulation method and a modem. Background Art
[0002] Chaotic digital modulation technology can not only retain the low intercept probability and multipath effect mitigation characteristics of traditional spread spectrum communication systems, but also show unique advantages in many other aspects, including: reducing the hardware cost of the system; improving communication security; being suitable for effectively distinguishing different users in a multi-user environment; improving the performance of spread spectrum communication systems, etc. Therefore, chaotic digital modulation technology has become one of the hot issues of concern and research in the nonlinear science and information science community.
[0003] Due to the lack of reliable and effective methods to achieve chaotic synchronization at the receiving end, most of the existing chaotic digital modulation and demodulation methods are based on the transmission reference method, that is, both the carrier signal and the signal carrying the information are sent to the receiving end. Among them, the most classic is the Differential Chaos Shift Keying (DCSK) modulation and demodulation method. The reference signal and the information carrier chaotic waveform are transmitted in two consecutive time slots. This time division multiple access (TDMA) method provides two independent channels for the transmission of the reference signal and the information carrier waveform, but it requires the introduction of delay components in the modulator and demodulator circuits, further reducing the available data rate. The wideband radio frequency (RF) delay line of the receiver is difficult to implement using CMOS technology, so DCSK modulation cannot be used in many applications, such as ultra-wideband.
[0004] In order to avoid the use of broadband RF delay lines in the receiver, the Code-Shifted Differential Chaos Shift Keying (CS-DCSK) modulation and demodulation method sends the reference signal and the information carrier signal in the same time slot. The two signals are distinguished by Walsh codes instead of time delay. Although CS-DCSK avoids the use of broadband RF delay lines in the receiver, the transmission rate and bit error performance of CS-DCSK are not improved compared with DCSK. Summary of the invention
[0005] The code shift differential chaotic shift keying modulation and demodulation method and modem proposed in the present invention can solve at least one of the technical problems in the background technology, specifically, can solve the problem of poor transmission rate and bit error performance of the existing CS-DCSK modulation and demodulation method.
[0006] To achieve the above object, the present invention adopts the following technical solutions:
[0007] A code shift differential chaotic shift keying modulation and demodulation method comprises the following steps:
[0008] Step 1: The serial / parallel converter converts n+1 serial information bits to be transmitted in the current symbol time into 1 modulation bit and n parallel index bits;
[0009] Step 2: The polar modulator performs polarity modulation on the 1-channel modulation bit generated in step 1 to obtain 1 polarity modulation bit;
[0010] Step 3: The zero-padding code generator generates two orthogonal sequences of length N, one of which is used as a reference orthogonal sequence and the other as an information orthogonal sequence;
[0011] Step 4: multiply the information orthogonal sequence generated in step 3 by the polarity modulation bit generated in step 2 to obtain a set of information modulation sequences;
[0012] Step 5: Add the reference orthogonal sequence generated in step 3 and the information modulation sequence generated in step 4 to obtain a set of mixed modulation sequences;
[0013] Step 6: The zero insertion module inserts 0 at the corresponding position of the mixed modulation sequence generated in step 5 according to the n-way index bits generated in step 1 to obtain a symbol modulation sequence;
[0014] Step 7: Generate a discrete chaotic signal sequence with a length of β;
[0015] Step 8: Perform Kronecker multiplication on the symbol modulation sequence generated in step 6 and the chaotic signal generated in step 7, and send them;
[0016] Step 9: The storage module 1 receives the signal sent in step 8 and stores it in a matrix of N+1 rows and β columns;
[0017] Step 10: The correlator 1 reads the data in the storage module 1, and correlates the data in the first row of the matrix with the data in the second to N+1 rows respectively, to obtain N correlation values;
[0018] Step 11: Take the absolute values of the N correlation values generated in step 10;
[0019] Step 12: The minimum value detector detects the position of the minimum value among the N data generated in step 11, and demodulates a 1-way index symbol;
[0020] Step 13: The zero removal module reads the data in the storage module 1, and removes the data of the corresponding row in the matrix according to the 1-way index symbol generated in step 12;
[0021] Step 14: The storage module 2 stores the data generated in step 13 into a matrix of N rows and β columns;
[0022] Step 15: The multiplier reads the data in the storage module 2, and multiplies the N rows of data in the matrix with the reference orthogonal sequence of length N in sequence to obtain a vector of N rows and β columns;
[0023] Step 16: The averager calculates the average sequence of the vectors generated in step 15 to obtain a reference average sequence of length β;
[0024] Step 17: The multiplier reads the data in the storage module 2, and multiplies the N rows of data in the matrix with the information orthogonal sequence of length N in sequence to obtain a vector of N rows and β columns;
[0025] Step 18: The averager calculates the average sequence of the vectors generated in step 17 to obtain an information average sequence of length β;
[0026] Step 19: The correlator correlates the two-way average sequences generated in step 16 and step 18 to obtain a correlation value;
[0027] Step 20: The decision device performs a threshold decision on the correlation value generated in step 19, and demodulates a modulated bit;
[0028] Step 21: The index demodulator demodulates n-way index bits according to the 1-way index symbol generated in step 12;
[0029] Step 22: Through a parallel / serial converter, the 1-channel modulation bit generated in step 20 and the n-channel index bits generated in step 21 are converted into 1-channel bit stream and output.
[0030] Further, as a preferred technical solution of the present invention: in step 6, 0 is inserted into the corresponding position of the mixed modulation sequence, specifically: .in It is a mixed modulation sequence generated by adding two groups of orthogonal code sequences accordingly; is the position index modulation symbol converted by the bitmap, =Decimal conversion value of the index bit + 1.
[0031] On the other hand, the present invention also proposes a code-shift differential chaotic shift keying modem, which can use the above method to modulate and demodulate signals. Specifically, the modulator distinguishes reference and information signals through two groups of orthogonal sequences, and inserts empty time slots in multiple time slots of a symbol period to achieve index modulation. The demodulator demodulates the index bit from the correlation value of the first time slot and the subsequent N time slot signals according to the detection principle of the smallest absolute value; according to the index bit, removes the empty time slot data in the signal to obtain N segments of data; multiplies the N segments of data with the two groups of orthogonal sequences in turn, and averages them in segments to recover the information signal and the reference signal, and demodulates the modulated bit according to the polarity of the correlation value of the recovered information signal and the reference signal.
[0032] Furthermore, the modulator of the modulation modulator includes: a chaotic signal generator, a serial-to-parallel converter, a polarity converter, a zero-filling code generator, a multiplier, an adder, a zero-insertion module, and a Kronecker multiplier; the chaotic signal generator generates a discrete chaotic signal sequence; the serial-to-parallel converter converts n+1 serial data bits to be transmitted in the current symbol time into 1 modulation bit and n parallel index bits; the polarity converter obtains the polarity modulation bit according to the mapping relationship: 0→-1, 1→+1; the zero-filling code generator generates and These two mutually orthogonal sequences ( is Kronecker product); the multiplier multiplies the information orthogonal sequence with the polarity modulation bit to obtain a set of information modulation sequences; the adder adds the reference orthogonal sequence with the information modulation sequence to obtain a set of mixed modulation sequences; the zero insertion module inserts 0 backwards in sequence at the corresponding positions of the mixed modulation sequence according to the decimal conversion value of the index bit variable to obtain a symbol modulation sequence; the Kronecker multiplier performs Kronecker multiplication on the symbol modulation sequence and the chaotic signal and then sends them.
[0033] Furthermore, the demodulator of the modulation modulator includes: a storage module 1, a correlator 1, an absolute value module, a minimum value detector, an index demodulator, a zero removal module, a storage module 2, a multiplier, an averager, a correlator 2, a decision device, and a parallel-to-serial converter; the storage module 1 receives the transmitted signal and stores it in a matrix of N+1 rows and β columns; the correlator 1 reads the data in the storage module 1, correlates the data in the first row of the matrix with the data in the second to N+1 rows respectively, and obtains N correlation values; the absolute value module takes the absolute value of the N correlation values; the minimum value detector detects the position of the minimum value among the N absolute values, and demodulates a 1-way index symbol; the zero removal module reads the data in the storage module 1, and removes the data in the corresponding row in the matrix according to the 1-way index symbol; the storage module 2 stores the data processed and output by the zero removal module in the N rows and β columns The multiplier reads the data in the second storage module, and sequentially multiplies the N rows of data in the matrix with the reference orthogonal sequence of length N; the averager calculates the average sequence for the N rows of data to obtain the reference average sequence of length β; the multiplier reads the data in the second storage module, and sequentially multiplies the N rows of data in the matrix with the information orthogonal sequence of length N; the averager calculates the average sequence for the N rows of data to obtain the information average sequence of length β; the second correlator correlates the 2-way average sequences output by the averager to obtain a correlation value; the decision device compares the correlation value after correlation with the threshold value, and outputs a modulated data bit according to the threshold decision; the index demodulator demodulates the n-way index bits according to the 1-way index symbol; the parallel-to-serial conversion circuit converts the 1-way modulated bit and the n-way index bits into a l-way bit stream and outputs it.
[0034] It can be seen from the above technical scheme that the present invention proposes a code-shift differential chaotic shift keying modulation and demodulation method and a modem, which belongs to the field of communication technology; the reference and information chaotic signals are superimposed and transmitted, and the reference and information chaotic signals are distinguished by using orthogonal codes. In the superimposed signal, multiple time slots are divided according to the length of the orthogonal code sequence, and time index modulation is realized by inserting empty time slots. The signal is modulated and demodulated using index mapping rules and reverse index mapping rules. Under the premise of the same system order, compared with the existing code-shift differential chaotic shift keying system, the present invention combines time index modulation technology within one symbol period to improve the system's bit transmission rate and reduce the bit error rate. In addition, the present invention also avoids the use of broadband RF delay lines in the receiver, which is conducive to the realization of CMOS circuits.
[0035] Specifically, the code shift differential chaotic shift keying modulation and demodulation method of the present invention obtains a chaotic signal within the current symbol period; converts n+1 serial data bits to be transmitted into 1 modulation bit and n parallel index bits; generates 2 orthogonal code sequences; processes the 2 orthogonal sequences according to the polarity modulation bits and the index modulation bits to obtain a symbol modulation sequence; completes information modulation and sends; completes time index demodulation to recover n index bits and 1 index symbol; removes time index bit data according to the index symbol to recover a reference information mixed signal; completes orthogonal code demodulation to recover a reference signal and an information signal; averages the reference signal and the information signal in sections and correlates them to obtain a correlation value; completes threshold judgment to demodulate 1 data bit; converts 1 modulation bit and n index bits into 1 bit stream and outputs it. Based on CS-DCSK, the present invention combines time index modulation technology to improve the bit transmission rate of the system and the bit error performance of the system.
[0036] Compared with the prior art, the present invention has the following beneficial effects:
[0037] The code shift differential chaotic shift keying modulation and demodulation method provided by the present invention introduces a new orthogonal code on the basis of CS-DCSK, and distinguishes information from reference signals through the orthogonal code. By inserting empty time slots between multiple time slots, the combination of time index modulation is realized without destroying the orthogonality of the signal. The method described in the present invention can improve the transmission rate of the system on the basis of CS-DCSK, and also reduce the bit energy of the system, thereby improving the bit error performance of the system. BRIEF DESCRIPTION OF THE DRAWINGS
[0038] Figure 1 It is a flow chart of the code shift differential chaotic shift keying modulation and demodulation method according to an embodiment of the present invention;
[0039] Figure 2 This is a schematic diagram of the structure of a code-shift differential chaotic shift keying transmitter modulator according to an embodiment of the present invention;
[0040] Figure 3 This is a schematic diagram of the structure of a code-shift differential chaotic shift keying receiving end demodulator according to an embodiment of the present invention;
[0041] Figure 4 The figure is a comparison diagram of the bit error performance between the modulation and demodulation method according to the embodiment of the present invention and the existing CS-DCSK method in an additive white Gaussian noise channel. DETAILED DESCRIPTION
[0042] In order to make the purpose, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments.
[0043] like Figure 1 As shown, the code-shift differential chaotic shift keying modulation and demodulation method described in this embodiment includes: obtaining a chaotic signal within the current symbol period; converting n+1 serial data bits to be transmitted into 1 modulation bit and n parallel index bits; generating 2 orthogonal code sequences; processing the 2 orthogonal sequences according to the polarity modulation bits and the index modulation bits to obtain a symbol modulation sequence; completing information modulation and sending; completing time index demodulation to recover n index bits and 1 index symbol; removing the time index bit data according to the index symbol to recover the reference information mixed signal; completing orthogonal code demodulation to recover the reference signal and the information signal; averaging the reference signal and the information signal in segments, correlating them, and obtaining 1 correlation value; completing threshold judgment, demodulating 1 data bit; converting 1 modulation bit and n index bits into 1 bit stream and outputting it.
[0044] The method specifically comprises the following steps:
[0045] Step 1: The serial / parallel converter converts n+1 serial information bits to be transmitted in the current symbol time into 1 modulation bit and n parallel index bits;
[0046] Step 2: The polar modulator performs polarity modulation on the 1-channel modulation bit generated in step 1 to obtain 1 polarity modulation bit;
[0047] Step 3: The zero-filling code generator generates two orthogonal sequences of length N, one of which is used as a reference orthogonal sequence. , and the other is used as an information orthogonal sequence ;
[0048] Step 4: multiply the information orthogonal sequence generated in step 3 by the polarity modulation bit generated in step 2 to obtain a set of information modulation sequences;
[0049] Step 5: Add the reference orthogonal sequence generated in step 3 and the information modulation sequence generated in step 4 to obtain a set of mixed modulation sequences;
[0050] Step 6: The zero insertion module inserts 0 at the corresponding position of the mixed modulation sequence generated in step 5 according to the n-way index bits generated in step 1 to obtain a symbol modulation sequence;
[0051] Step 7: Generate a discrete chaotic signal sequence with a length of β;
[0052] Step 8: Perform Kronecker multiplication on the symbol modulation sequence generated in step 6 and the chaotic signal generated in step 7, and send them;
[0053] Step 9: The storage module 1 receives the signal sent in step 8 and stores it in a matrix of N+1 rows and β columns;
[0054] Step 10: The correlator 1 reads the data in the storage module 1, and correlates the data in the first row of the matrix with the data in the second to N+1 rows respectively, to obtain N correlation values;
[0055] Step 11: Take the absolute values of the N correlation values generated in step 10;
[0056] Step 12: The minimum value detector detects the position of the minimum value among the N data generated in step 11, and demodulates a 1-way index symbol;
[0057] Step 13: The zero removal module reads the data in the storage module 1, and removes the data of the corresponding row in the matrix according to the 1-way index symbol generated in step 12;
[0058] Step 14: The storage module 2 stores the data generated in step 13 into a matrix of N rows and β columns;
[0059] Step 15: The multiplier reads the data in the storage module 2 and multiplies the N rows of data in the matrix with the reference orthogonal sequence of length N. Multiply them one by one to get a vector with N rows and β columns;
[0060] Step 16: The averager calculates the average sequence of the vectors generated in step 15 to obtain a reference average sequence of length β;
[0061] Step 17: The multiplier reads the data in the storage module 2 and multiplies the N rows of data in the matrix with the information orthogonal sequence of length N. Multiply them one by one to get a vector with N rows and β columns;
[0062] Step 18: The averager calculates the average sequence of the vectors generated in step 17 to obtain an information average sequence of length β;
[0063] Step 19: The correlator correlates the two-way average sequences generated in step 16 and step 18 to obtain a correlation value;
[0064] Step 20: The decision device performs threshold decision on the correlation value generated in step 19 and demodulates a modulated bit; the demodulation rule is: when the correlation value > threshold value 0, the demodulated data bit is "+1", otherwise, the demodulated data bit is "-1".
[0065] Step 21: The index demodulator demodulates n-way index bits according to the 1-way index symbol generated in step 12;
[0066] Step 22: Through a parallel / serial converter, the 1-channel modulation bit generated in step 20 and the n-channel index bits generated in step 21 are converted into 1-channel bit stream and output.
[0067] Wherein, in step 6, in order not to destroy the orthogonality of the signal, 0 is inserted into the corresponding position of the mixed modulation sequence, specifically: .in It is a mixed modulation sequence generated by adding two groups of orthogonal code sequences accordingly; is the position index modulation symbol converted by the bitmap, =Decimal conversion value of the index bit + 1.
[0068] The above method adds two orthogonal sequences to distinguish the two signals, inserts 0 at the corresponding position according to the index bit in the added mixed modulation sequence, obtains the symbol modulation sequence, and realizes the time index modulation within the code without destroying the orthogonality of the signal. The symbol modulation coefficient is Kronecker multiplied with the chaotic signal and sent.
[0069] In the above method, in the receiving side, the storage module 1 stores the received signal in a matrix of N+1 rows and β columns; the correlator 1 reads the data in the storage module 1, correlates the data in the 1st row of the matrix with the data in the 2nd to N+1 rows respectively, obtains N correlation values, takes the absolute value of the N correlation values, and the minimum value detector detects the position of the minimum value in the N absolute values, and demodulates a 1-way index symbol; the zero removal module reads the data in the storage module 1, removes the data of the corresponding row in the matrix according to the 1-way index symbol, and the storage module 2 stores the data in the matrix of N rows and β columns; the multiplier reads the data in the storage module 2, and compares the N rows of data in the matrix with the N-length index symbol. The reference orthogonal sequences are multiplied in sequence, and the averager calculates the average sequence for N rows of data to obtain an average sequence with a length of β; the multiplier reads the data in the second storage module, multiplies the N rows of data in the matrix with the information orthogonal sequence with a length of N in sequence, and the averager calculates the average sequence for N rows of data to obtain an average sequence with a length of β; the correlator correlates the 2-way average sequences to obtain a correlation value, and the decision device performs a threshold decision on the correlation value to demodulate a modulation bit; the index demodulator demodulates n-way index bits according to 1-way index symbol; the parallel / serial converter converts 1-way modulation bit and n-way index bits into 1-way bit stream and outputs it.
[0070] On this basis, the present invention also proposes a code-shift differential chaotic shift keying modem, which can use the above method to modulate and demodulate signals. Specifically, the modulator distinguishes reference and information signals through two groups of orthogonal sequences, inserts empty time slots in multiple time slots of a symbol period, and implements index modulation. The demodulator demodulates the index bit from the correlation value of the first time slot and the subsequent N time slot signals according to the detection principle of the smallest absolute value; according to the index bit, removes the empty time slot data in the signal to obtain N segments of data; multiplies the N segments of data with the two groups of orthogonal sequences in turn, and averages them in segments to recover the information signal and the reference signal, and demodulates the modulated bit according to the polarity of the correlation value of the recovered information signal and the reference signal.
[0071] The structure of the modulator in the modem is as follows Figure 2 As shown, it specifically includes: a chaotic signal generator, a serial-to-parallel converter, a polarity converter, a zero-filling code generator, a multiplier, an adder, a zero-insertion module, and a Kronecker multiplier; the chaotic signal generator generates a discrete chaotic signal sequence; the serial-to-parallel converter converts n+1 serial data bits to be transmitted in the current symbol time into 1 modulation bit and n parallel index bits; the polarity converter obtains the polarity modulation bit according to the mapping relationship: 0→-1, 1→+1; the zero-filling code generator generates and These two mutually orthogonal sequences ( is Kronecker product); the multiplier multiplies the information orthogonal sequence with the polarity modulation bit to obtain a set of information modulation sequences; the adder adds the reference orthogonal sequence with the information modulation sequence to obtain a set of mixed modulation sequences; the zero insertion module inserts 0 backwards in sequence at the corresponding positions of the mixed modulation sequence according to the decimal conversion value of the index bit variable to obtain a symbol modulation sequence; the Kronecker multiplier performs Kronecker multiplication on the symbol modulation sequence and the chaotic signal and then sends them.
[0072] The structure of the demodulator in the modem is as follows Figure 3As shown, it specifically includes: storage module 1, correlator 1, absolute value module, minimum value detector, index demodulator, zero removal module, storage module 2, multiplier, averager, correlator 2, decision device, parallel-to-serial converter; the storage module 1 receives the transmitted signal and stores it in a matrix of N+1 rows and β columns; the correlator 1 reads the data in the storage module 1, and correlates the data in the first row of the matrix with the data in the second to N+1 rows respectively to obtain N correlation values; the absolute value module takes the absolute value of the N correlation values; the minimum value detector detects the position of the minimum value in the N absolute values, and demodulates a 1-way index symbol; the zero removal module reads the data in the storage module 1, and removes the data in the corresponding row in the matrix according to the 1-way index symbol; the storage module 2 stores the data processed and output by the zero removal module in a matrix of N rows and β columns; The multiplier reads data in the second storage module, and sequentially multiplies N rows of data in the matrix with a reference orthogonal sequence of length N; the averager calculates an average sequence for the N rows of data to obtain a reference average sequence of length β; the multiplier reads data in the second storage module, and sequentially multiplies N rows of data in the matrix with an information orthogonal sequence of length N; the averager calculates an average sequence for the N rows of data to obtain an information average sequence of length β; the second correlator correlates the 2-way average sequences output by the averager to obtain a correlation value; the decision device compares the correlation value after correlation with the threshold value, and outputs 1-way modulated data bit according to the threshold decision; the index demodulator demodulates n-way index bits according to 1-way index symbol; the parallel-to-serial conversion circuit converts 1-way modulated bit and n-way index bits into 1-way bit stream and outputs it.
[0073] Furthermore, in order to verify that the code shift differential chaotic shift keying modulation and demodulation method provided by the present invention can improve the transmission rate and reduce the bit error rate, the present invention cites a verification example for verification and explanation. The method of this verification example includes the following steps:
[0074] Step 1: Implement the method based on the present invention under the condition that the length β of the discrete chaotic signal sequence within one symbol time is 75, the number of index bits n is 2, and N=4;
[0075] Step 2: Use a serial-to-parallel conversion circuit to convert a serial data bit with a length of 3 to be transmitted in the current symbol period into three parallel low-speed data bits, one of which is used as a modulation bit and two of which are used as index bits;
[0076] Step 3: The 1-channel modulated bit generated in step 2 is passed through a polar modulator to obtain 1 polar modulated bit;
[0077] Step 4: The zero-padding code generator generates two orthogonal sequences of length N, one of which is used as a reference sequence. =[0,1,0,1], the other is used as the information sequence =[1,0,1,0];
[0078] Step 5: multiply the information orthogonal sequence generated in step 4 by the polarity modulation bit generated in step 3 to obtain a set of information modulation sequences;
[0079] Step 6: Add the reference orthogonal sequence generated in step 4 to the information modulation sequence generated in step 5 to obtain a set of mixed modulation sequences. ;
[0080] Step 7: According to the index bit generated in step 2, insert 0 into the corresponding position of the mixed modulation coefficient vector generated in step 6 to obtain the symbol modulation coefficient vector;
[0081] Step 8: Within one symbol period [0, Tb], the chaotic signal generator outputs a discrete chaotic signal sequence of length ;
[0082] Step 9: Perform Kronecker multiplication on the symbol modulation sequence generated in step 7 and the chaotic signal generated in step 8, and transmit the result through the antenna;
[0083] At the receiving end, the signal is received and demodulated, including:
[0084] Step 10: The storage module 1 receives the signal sent in step 9 and stores it in a matrix of 5 rows and 75 columns;
[0085] Step 11: Read the data in the storage module 1, and correlate the data of the first row with a length of 75 with the data of the second to fifth rows with a length of 75, respectively, to obtain 4 correlation values;
[0086] Step 12: Take the absolute values of the four correlation values generated in step 11;
[0087] Step 13: The minimum value detector detects the position of the minimum value among the four data generated in step 12, and demodulates a 1-way index symbol;
[0088] Step 14: The zero removal module reads the data in the storage module 1, and removes the data of the corresponding row in the matrix according to the 1-way index symbol generated in step 13;
[0089] Step 15: The storage module 2 stores the data generated in step 14 into a matrix of 4 rows and 75 columns;
[0090] Step 16: The multiplier reads the data in the storage module 2 and multiplies the 4 rows of data in the matrix with the reference orthogonal sequence of length 4. Multiply them one by one to get a vector with 4 rows and 75 columns;
[0091] Step 17: The averager calculates the average sequence of the vector generated in step 16 to obtain a reference average sequence with a length of 75;
[0092] Step 18: The multiplier reads the data in the storage module 2 and adds the 4 rows of data in the matrix to the information orthogonal sequence of length 4. Multiply them one by one to get a vector with 4 rows and 75 columns;
[0093] Step 19: The averager calculates the average sequence of the vectors generated in step 18, and obtains an information average sequence with a length of 75;
[0094] Step 20: The correlator correlates the two-way average sequences generated in step 17 and step 19 to obtain a correlation value;
[0095] Step 21: The decision device performs a threshold decision on the correlation value generated in step 20, and demodulates a modulated bit;
[0096] Step 22: The index demodulator demodulates 2-way index bits according to the 1-way index symbol generated in step 13;
[0097] Step 23: Through a parallel / serial converter, the 1-way modulation bit generated in step 21 and the 2-way index bits generated in step 22 are converted into 1-way bit stream and output.
[0098] The present invention uses computer simulation to conduct a transmission test on the code shift differential chaotic shift keying modulation and demodulation method provided by the present invention. In the test, the number of transmitted data bits is , the discrete chaotic signal sequence is mapped by the second-order Chebyshev polynomial The chaotic signal sampling frequency is 1MHz and the symbol duration is , the equivalent number of signal sampling points in each symbol time is 75.
[0099] Figure 4 is the bit error rate of the method of the present invention obtained by simulation in an additive white Gaussian noise channel. As a comparison, the figure also shows the bit error rate of the existing CS-DCSK method obtained by simulation under the same conditions. It can be seen from the figure that compared with the existing CS-DCSK method, the method of the present invention reduces the bit error rate and shows better bit error performance.
[0100] In summary, the present invention improves the transmission rate of the system, reduces the bit energy of the system, and thus improves the bit error performance of the system. At the same time, the present invention also retains the advantage of avoiding the use of a broadband RF delay line.
[0101] The above embodiments are only used to illustrate the technical solutions of the present invention, rather than to limit the same. Although the present invention has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that the technical solutions described in the aforementioned embodiments may still be modified, or some of the technical features may be replaced by equivalents. However, these modifications or replacements do not deviate the essence of the corresponding technical solutions from the spirit and scope of the technical solutions of the embodiments of the present invention.
Claims
1. A code shift differential chaotic shift keying modulation and demodulation method, characterized in that: include: Obtain the chaotic signal in the current symbol period; Convert n+1 serial data bits to be transmitted into 1 modulation bit and n parallel index bits; Generate 2 orthogonal code sequences; According to the polarity modulation bit and the index modulation bit, the two-way orthogonal sequence is processed to obtain a symbol modulation sequence; the information modulation is completed and sent; Complete time index demodulation and recover n index bits and 1 index symbol; Remove the time index bit data according to the index symbol to restore the reference information mixed signal; Complete orthogonal code demodulation and recover reference signal and information signal; The reference signal and the information signal are averaged in sections and correlated to obtain a correlation value; Complete threshold judgment and demodulate 1 data bit; convert 1 modulation bit and n index bits into 1 bit stream and output; The specific steps include: Step 1: The serial / parallel converter converts the n+1 serial information bits to be transmitted in the current symbol time into one modulation bit and n parallel index bits; Step 2: The polar modulator performs polarity modulation on the one modulation bit generated in step 1 to obtain one polarity modulation bit; Step 3: The zero-padding code generator generates two orthogonal sequences of length N, one of which is used as a reference orthogonal sequence and the other as an information orthogonal sequence; Step 4: multiply the information orthogonal sequence generated in step 3 by the polarity modulation bit generated in step 2 to obtain a set of information modulation sequences; Step 5: Add the reference orthogonal sequence generated in step 3 and the information modulation sequence generated in step 4 to obtain a set of mixed modulation sequences; Step 6: The zero insertion module inserts 0 at the corresponding position of the mixed modulation sequence generated in step 5 according to the n-way index bits generated in step 1 to obtain a symbol modulation sequence; Step 7: Generate a discrete chaotic signal sequence with a length of β; Step 8: Perform Kronecker multiplication on the symbol modulation sequence generated in step 6 and the chaotic signal generated in step 7, and send them; Step 9: Receive the signal sent in step 8 through storage module 1 and store it in a matrix of N+1 rows and β columns; Step 10: read the data in the storage module 1 through the correlator 1, and correlate the data in the first row of the matrix with the data in the second to N+1 rows respectively to obtain N correlation values; Step 11: Take the absolute values of the N correlation values generated in step 10; Step 12: The minimum value detector detects the position of the minimum value among the N data generated in step 11, and demodulates a 1-way index symbol; Step 13: The zero removal module reads the data in the storage module 1, and removes the data of the corresponding row in the matrix according to the 1-way index symbol generated in step 12; Step 14: The storage module 2 stores the data generated in step 13 into a matrix of N rows and β columns; Step 15: The multiplier reads the data in the storage module 2, and multiplies the N rows of data in the matrix with the reference orthogonal sequence of length N in sequence to obtain a vector of N rows and β columns; Step 16: The averager calculates the average sequence of the vectors generated in step 15 to obtain a reference average sequence of length β; Step 17: The multiplier reads the data in the storage module 2, and multiplies the N rows of data in the matrix with the information orthogonal sequence of length N in sequence to obtain a vector of N rows and β columns; Step 18: The averager calculates the average sequence of the vectors generated in step 17 to obtain an information average sequence of length β; Step 19: The correlator correlates the two-way average sequences generated in step 16 and step 18 to obtain a correlation value; Step 20: The decision device performs a threshold decision on the correlation value generated in step 19, and demodulates a modulated bit; Step 21: The index demodulator demodulates n-way index bits according to the 1-way index symbol generated in step 12; Step 22: Through a parallel / serial converter, the 1-channel modulation bit generated in step 20 and the n-channel index bits generated in step 21 are converted into an l-channel bit stream and output.
2. The code shift differential chaotic shift keying modulation and demodulation method according to claim 1 is characterized in that: In step 6, 0 is inserted into the corresponding position of the mixed modulation sequence, specifically: ; in is the mixed modulation sequence generated by adding two sets of orthogonal code sequences correspondingly. ; is the position index modulation symbol converted by the bitmap, =Decimal conversion value of the index bit + 1.
3. A code-shift differential chaotic shift keying modem, characterized in that: The modem comprises a modulator and a demodulator, and uses the code shift differential chaotic shift keying modulation and demodulation method described in claim 1 or 2 to modulate and demodulate the signal; The modulator distinguishes reference and information signals through two groups of orthogonal sequences, inserts empty time slots in multiple time slots of a symbol period, and implements index modulation; The demodulator demodulates the index bit from the correlation value between the first time slot and the subsequent N time slot signals according to the detection principle of the minimum absolute value; removes the empty time slot data in the signal according to the index bit to obtain N segments of data; multiplies the N segments of data with two groups of orthogonal sequences in sequence, and averages them in sections to recover the information signal and the reference signal; and demodulates the modulated bit according to the polarity of the correlation value between the recovered information signal and the reference signal.
4. A code shift differential chaotic shift keying modem according to claim 3, characterized in that: The modulator includes a chaotic signal generator, a serial-to-parallel converter, a polarity converter, a zero-filling code generator, a multiplier, an adder, a zero-insertion module, and a Kronecker multiplier; The chaotic signal generator generates a discrete chaotic signal sequence; The serial-to-parallel converter converts n+1 serial data bits to be transmitted in the current symbol time into 1 modulation bit and n parallel index bits; The polarity converter obtains polarity modulation bits according to the mapping relationship: 0→-1, 1→+1; The zero-padding code generator generates and , These two mutually orthogonal sequences are is the Kronecker product; The multiplier multiplies the information orthogonal sequence with the polarity modulation bit to obtain a set of information modulation sequences; The adder adds the reference orthogonal sequence and the information modulation sequence to obtain a set of mixed modulation sequences; The zero insertion module sequentially inserts 0s backward at corresponding positions of the mixed modulation sequence according to the decimal conversion value of the index bit variable to obtain a symbol modulation sequence; The Kronecker multiplier performs Kronecker multiplication on the symbol modulation sequence and the chaotic signal and then sends the result.
5. A code-shift differential chaotic shift keying modem according to claim 4, characterized in that: The demodulator comprises a storage module 1, a correlator 1, an absolute value module, a minimum value detector, an index demodulator, a zero removal module, a storage module 2, a multiplier, an averager, a correlator 2, a decision device, and a parallel-to-serial converter; The storage module 1 receives the transmitted signal and stores it in a matrix of N+1 rows and β columns; The correlator 1 reads the data in the storage module 1, and correlates the data in the first row with the data in the second to N+1 rows in the matrix to obtain N correlation values; The absolute value taking module takes absolute values of N correlation values; The minimum value detector detects the position of the minimum value among the N absolute values and demodulates a 1-way index symbol; The zero removal module reads the data in the storage module 1 and removes the data of the corresponding row in the matrix according to the 1-way index symbol; The storage module 2 stores the data processed and output by the zero removal module into a matrix of N rows and β columns; The multiplier reads the data in the second storage module, and multiplies the N rows of data in the matrix with the reference orthogonal sequence of length N in sequence; The averager calculates an average sequence for N rows of data to obtain a reference average sequence with a length of β; The multiplier reads the data in the second storage module, and sequentially multiplies the N rows of data in the matrix with the information orthogonal sequence of length N; The averager calculates an average sequence for N rows of data to obtain an information average sequence with a length of β; The correlator 2 correlates the two-way averaged sequences output by the averager to obtain a correlation value; The decision device compares a correlation value after correlation with a threshold value, and outputs a modulated data bit according to the threshold decision; The index demodulator demodulates n index bits according to 1 index symbol; The parallel-to-serial converter converts 1-way modulation bit and n-way index bits into 1-way bit stream and outputs the bit stream.
