CN113242198A - PI-DCSK modulation and demodulation method and system based on Walsh codes - Google Patents
PI-DCSK modulation and demodulation method and system based on Walsh codes Download PDFInfo
- Publication number
- CN113242198A CN113242198A CN202110473102.5A CN202110473102A CN113242198A CN 113242198 A CN113242198 A CN 113242198A CN 202110473102 A CN202110473102 A CN 202110473102A CN 113242198 A CN113242198 A CN 113242198A
- Authority
- CN
- China
- Prior art keywords
- sequence
- modulation
- bit
- permutation
- bits
- 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
Links
- 238000000034 method Methods 0.000 title claims abstract description 26
- 230000000739 chaotic effect Effects 0.000 claims abstract description 42
- 239000011159 matrix material Substances 0.000 claims abstract description 38
- 238000013507 mapping Methods 0.000 claims abstract description 27
- 230000005540 biological transmission Effects 0.000 claims description 10
- 230000000875 corresponding effect Effects 0.000 claims description 10
- 238000004590 computer program Methods 0.000 claims description 6
- 239000013598 vector Substances 0.000 claims description 5
- 230000002596 correlated effect Effects 0.000 claims description 4
- 230000009286 beneficial effect Effects 0.000 abstract description 3
- 238000000638 solvent extraction Methods 0.000 abstract 1
- 238000004891 communication Methods 0.000 description 4
- 238000011161 development Methods 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 3
- 238000004088 simulation Methods 0.000 description 2
- 238000001228 spectrum Methods 0.000 description 2
- 102100029469 WD repeat and HMG-box DNA-binding protein 1 Human genes 0.000 description 1
- 101710097421 WD repeat and HMG-box DNA-binding protein 1 Proteins 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005265 energy consumption Methods 0.000 description 1
- 238000005562 fading Methods 0.000 description 1
- 238000011084 recovery Methods 0.000 description 1
- 238000011160 research Methods 0.000 description 1
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/004—Orthogonal
- H04J13/0048—Walsh
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04J—MULTIPLEX COMMUNICATION
- H04J13/00—Code division multiplex systems
- H04J13/10—Code generation
- H04J13/12—Generation of orthogonal codes
Abstract
The invention relates to a PI-DCSK modulation and demodulation method and a system based on Walsh codes, wherein the method constructs a Walsh matrix and multiplies a reference chaotic signal to obtain an orthogonal permutation sequence; partitioning a data bit stream to be transmitted, selecting a mapping orthogonal permutation sequence, taking the remaining single bit as a modulation bit, carrying out BPSK modulation, multiplying the modulation bit by the selected permutation sequence, and then transmitting; a transmitting end transmits a reference chaotic signal in a first time slot, and other time slots are all used for transmitting a modulated information bearing signal; the receiving end firstly restores the reference chaotic signal and obtains an orthogonal permutation sequence by using a walsh matrix which is the same as that of the transmitting end, then associates the received information bearing signal with the orthogonal permutation sequence to calculate an inner product, estimates a mapping bit by using an index of a correlator with maximum amplitude output, and simultaneously compares an output inner product value of a corresponding correlator with a zero threshold value to restore a modulation bit. The method and the system are beneficial to reducing the bit error rate and the receiving and transmitting cost.
Description
Technical Field
The invention belongs to the technical field of chaotic digital modulation, and particularly relates to a PI-DCSK modulation and demodulation method and system based on Walsh codes.
Background
In recent years, with the development of mobile internet, especially the rapid development of 5G, in the face of the increasing demand of communication among large-scale users, the network traffic also increases explosively, and in the face of the increasing demand of network traffic, how to quickly and safely transmit a large amount of traffic data and simultaneously reduce the interference among users, and ensure the reliability of data becomes the central importance of the future communication development.
Chaotic signals have found increasingly widespread use in spread spectrum communication systems over the last two decades. The main reason is that such signals can be easily generated and have the characteristics of a wide-band spectrum, good autocorrelation and low cross-correlation. These characteristics are of great significance for improving multiple access performance, anti-interference capability and anti-multipath interference capability. In addition, its aperiodic nature enhances transmission security. Differential Chaos Shift Keying (DCSK) is a typical representative of chaotic digital modulation techniques, which have excellent performance in multipath fading or time-varying channels. In DCSK, the duration of each bit is divided into two slots. The reference chaotic sequence is transmitted in a first time slot, and the data-modulated delay reference chaotic sequence is transmitted in a second time slot. At the receiving end, the reference sequence is correlated with the data modulation sequence to recover the transmitted bits. The method has the main advantages that the recovery of the chaotic sequence is avoided, a receiver does not need a channel state estimator, the multipath interference is resisted, and the realization is simple. However, the method adopts a T-R (Transmitted-Reference) transmission mode, wastes half of time and power, and has the defects of low information transmission rate, high energy consumption, poor safety and the like.
In recent years, with the intensive research on the chaotic digital modulation technology based on the DCSK, many improvements are proposed. In the document "complete Index DCSKModulation Technique for Secure multiuser high-Data-Rate Communication Systems", a PI-DCSK modulation Technique is proposed, each Data frame is divided into two time slots, a reference chaotic signal is transmitted in the first time slot, and a Permutation sequence of a modulation bit multiplied by the reference chaotic signal is transmitted in the second time slot, so that the reference chaotic signal needs to be transmitted for multiple times. In particular, the bit stream is divided at the transmitter into blocks of (n +1) bits, where n mapping bits are used to select one of the predefined permutation sequences, while a single modulation bit is spread by the just mentioned permutated reference signal. At the receiving end, the reference signal is first recovered, then all permutation sequences thereof are associated with the data-carrying signal to obtain an inner product, the mapping bits are estimated with the index of the correlator with the largest absolute value of the output, and simultaneously the output inner product value of the corresponding correlator is compared with a zero threshold value to recover the modulation bits. The permutation sequence selected in the scheme is used as an orthogonal permutation sequence by circularly shifting the reference chaotic signal to find a sequence with a relatively small inner product between every two sequences, so that absolute orthogonality between the permutation sequences cannot be guaranteed, and interference between signals is large.
Disclosure of Invention
The invention aims to provide a PI-DCSK modulation and demodulation method and system based on Walsh codes, which are beneficial to reducing the bit error rate and the receiving and transmitting cost.
In order to achieve the purpose, the invention adopts the technical scheme that: a PI-DCSK modulation-demodulation method based on Walsh codes is characterized in that a Walsh matrix is constructed and is combined with a generated reference chaotic signal w0Multiplying to obtain mutually absolute orthogonal permutation sequences w1,w2,…,wi(ii) a Dividing a data bit stream to be transmitted into blocks of (n +1) bits, where n bits are mapping bits for selecting mapping orthogonal permutation sequences w1,w2,…,wi(ii) a The remaining single bit is a modulation bit, is subjected to BPSK modulation and then multiplied by the selected permutation sequence, and then is transmitted;
the transmitting end transmits the reference chaotic signal only in a first time slot, and other time slots are all used for transmitting the modulated information bearing signal;
at the receiving end, the reference chaotic signal is recovered firstly
And obtaining orthogonal permutation sequence by using walsh matrix same as that of transmitting end
Then all received information-bearing signals are combined with orthogonal permutation sequences
The inner product is correlated, the mapped bits are estimated with the index of the correlator with the largest amplitude output, and the output inner product value of the corresponding correlator is compared to a zero threshold to recover the modulated bits.
Further, the transmitting end modulates data to be transmitted according to the following steps:
A1) the chaotic signal generator generates a reference chaotic signal w0And sending out in the first time slot;
A2) constructing a walsh matrix and generating an orthogonal permutation sequence by using the walsh matrix;
for the case that the quaternary M is 4, the length of the reference chaotic signal is beta, and two users are 2, the Walsh code is constructed by utilizing a Hadamard matrix, and the basic structure of the Hadamard matrix is W1＝[+1]Based on the fundamental matrix, a higher order Hadamard matrix can be obtained by equation (1):
wherein j is an integer greater than 0;
therefore, the formula (1) is given as follows:
the following equations (1) and (2) show:
using W4Generating four mutually orthogonal permutation sequences, which are respectively:
w1＝w0*[+1 +1 +1 +1] (4)
w2＝w0*[+1 -1 +1 -1] (5)
w3＝w0*[+1 +1 -1 -1] (6)
w4＝w0*[+1 -1 -1 +1] (7)
each user respectively selects two permutation sequences to respectively represent data '1' and '0' to be transmitted;
A3) the data bit stream to be transmitted is divided into blocks of (n +1) bits, and the ith bit block of the kth user is written as
Wherein
Is a vector of n mapping bits for selecting an orthogonal permutation sequence,
BPSK modulation is carried out for the modulation bits;
A4) formulating a mapping rule and modulating a sending signal;
by Log2M +1 indicates that the mapping bit of quaternary M + 4 is 1 bit, that is, n is 1, and the mapping rule is selected as follows:
user 1: 0-)>w1＝w0*[+1 +1 +1 +1]
1—>w2＝w0*[+1 -1 +1 -1]
And (4) a user 2: 0-)>w3＝w0*[+1 +1 -1 -1]
1—>w4＝w0*[+1 -1 -1 +1]
I.e. the data sent by user 1Sequence w for "01Permutation transmission, sequence w for transmitted data "12Carrying out permutation sending; sequence w for data "0" transmitted by user 23Permutation transmission, sequence w for transmitted data "14And (5) permutation sending.
Further, for the case of two users with different orders M, the Hadamard matrix W with different orders is generated by using formula (1)MM mutually orthogonal permutation sequences are formed.
Further, for the case of different orders M of a single user, the Hadamard matrix W of different orders is generated by using formula (1)M/2M/2 mutually orthogonal permutation sequences are formed.
Further, the receiving end demodulates the received data according to the following steps:
B1) user 1 first recovers the reference chaotic signal
And receiving information bearing signals in sequence;
B2) receiving a reference chaotic signal
And walsh matrix W4Multiplying to obtain a corresponding permutation sequence:
the received signal
Except for reference chaotic signal
Each element except the other element is respectively associated with the obtained orthogonal permutation sequence
Solving an inner product;
B3) the mapping bits are estimated with the index of the correlator whose inner product absolute value is the largest, while the output inner product value of the corresponding correlator is compared with a zero threshold to recover the modulation bits.
The invention also provides a PI-DCSK modulation and demodulation system based on Walsh codes, which comprises a sending end and a receiving end, wherein the sending end and the receiving end respectively comprise a memory, a processor and a computer program which is stored on the memory and can be operated on the processor, and when the processor operates the computer program, the steps of the method are realized.
Compared with the prior art, the invention has the following beneficial effects: the method and the system generate the orthogonal permutation sequence through the walsh matrix, have absolute orthogonality, avoid mutual interference between signals and between users, and improve the error rate performance of the system. Meanwhile, the reference chaotic signal is only transmitted once in the scheme, so that the transmitting and receiving cost is saved. Therefore, the invention has strong practicability and wide application prospect.
Drawings
FIG. 1 is a flow chart of a method implementation of an embodiment of the present invention.
Fig. 2 is a flowchart of the operation of the transmitting end in the embodiment of the present invention.
Fig. 3 is a flowchart of the operation of the receiving end in the embodiment of the present invention.
FIG. 4 is a simulation comparison diagram of the prior art PI-DCSK and the method.
Detailed Description
The invention is described in detail below with reference to the figures and specific embodiments. The present embodiment is implemented on the premise of the technical solution of the present invention, and a detailed implementation manner and a specific operation process are given, but the scope of the present invention is not limited to the following embodiments.
As shown in fig. 1 to 3, the present embodiment provides a PI-DCSK modulation and demodulation method based on Walsh codes, which constructs a Walsh matrix and generates a reference chaotic signal w0Multiplying to obtain mutually absolute orthogonal permutation sequences w1,w2,…,wi. The data bit stream to be transmitted is divided into blocks of (n +1) bits, where n bits are the mappingBits for selecting a permutation sequence w mapping orthogonally1,w2,…,wi. The remaining single bit is a modulation bit, subjected to BPSK modulation, multiplied by the selected permutation sequence, and then transmitted.
The transmitting end only transmits the reference chaotic signal in the first time slot, and other time slots are all used for transmitting the modulated information bearing signal.
At the receiving end, the reference chaotic signal is recovered firstly
And obtaining orthogonal permutation sequence by using walsh matrix same as that of transmitting end
Then all received information-bearing signals are combined with orthogonal permutation sequences
The inner product is correlated, the mapped bits are estimated with the index of the correlator with the largest amplitude output, and the output inner product value of the corresponding correlator is compared to a zero threshold to recover the modulated bits.
As shown in fig. 2, the transmitting end modulates data to be transmitted according to the following steps:
A1) the chaotic signal generator generates a reference chaotic signal w0And is transmitted in the first time slot.
A2) A walsh matrix is constructed and orthogonal permutation sequences are generated using the walsh matrix.
For the case that the quaternary M is 4, the length of the reference chaotic signal is β, and the two users are 2, the Walsh code is constructed by using a Hadamard matrix, which is an orthogonal square matrix composed of +1 and-1 elements, and any two rows (or two columns) of the Hadamard matrix are orthogonal to each other. The basic structure of the Hadamard matrix is W1＝[+1]Based on the fundamental matrix, a higher order Hadamard matrix can be obtained by equation (1):
wherein j is an integer greater than 0;
therefore, the formula (1) is given as follows:
the following equations (1) and (2) show:
can know W4The four row vectors in the group are orthogonal two by two, so each user can respectively select two row vectors to represent data "1" and "0" to be sent. Using W4Generating four mutually orthogonal permutation sequences, which are respectively:
w1＝w0*[+1 +1 +1 +1] (4)
w2＝w0*[+1 -1 +1 -1] (5)
w3＝w0*[+1 +1 -1 -1] (6)
w4＝w0*[+1 -1 -1 +1] (7)
each user selects two permutation sequences to represent data '1' and '0' to be transmitted respectively.
A3) The data bit stream to be transmitted is divided into blocks of (n +1) bits, and the ith bit block of the kth user is written as
Wherein
Is a vector of n mapping bits for selecting an orthogonal permutation sequence,
BPSK modulation is performed for the modulation bits.
A4) A mapping rule is formulated and the transmission signal is modulated.
By Log2M +1 indicates that the mapping bit of quaternary M + 4 is 1 bit, that is, n is 1, and the mapping rule is selected as follows:
user 1: 0-)>w1＝w0*[+1 +1 +1 +1]
1—>w2＝w0*[+1 -1 +1 -1]
And (4) a user 2: 0-)>w3＝w0*[+1 +1 -1 -1]
1—>w4＝w0*[+1 -1 -1 +1]
I.e. the sequence w for data "0" sent by user 11Permutation transmission, sequence w for transmitted data "12And (5) permutation sending. Sequence w for data "0" transmitted by user 23Permutation transmission, sequence w for transmitted data "14And (5) permutation sending.
Assuming that the data bit stream to be transmitted by the user 1 is 10011101011100011010, the blocks divided into (n +1) bits are respectively 10, 01,11,01,01,11,00,01,10,10, the former bit of each block is a mapping bit for selecting an orthogonal permutation sequence, and the latter bit is subjected to BPSK modulation (0->-1,1-->+1) the modulated bits are multiplied by the orthogonal permutation sequence to obtain the information-bearing signal to be transmitted. For example, if the previous bit of the block "10" is 1 (i.e., the mapping bit is 1), the mapping rule selected above indicates that the replacement sequence corresponding to the data "1" of the user 1 is w2. The latter bit is 0 and becomes "-1" after BPSK modulation, so the block "10" will become "-w2"sequence is sent out. Similarly, block "01" would be replaced with "+ w1", block" 11 "will be replaced with" + w2", block" 00 "will be replaced with" -w1", as follows:
10--->w2*(-1) 01--->w1*(+1)
11--->w2*(+1) 00--->w1*(-1)
so the signal sent by user 1 is: w is ainf＝[w0,-w2,+w1,+w2,+w1,+w1,+w2,-w1,+w1,-w2,-w2]。
For the condition that two users have different orders M, Hadamard matrix W with different orders is generated by using formula (1)MM mutually orthogonal permutation sequences are formed. For example, when the user octal (2, M, 8) is two, a higher order Hadamard matrix W is used8Forming 8 mutually orthogonal permutation sequences.
For the case of different orders M of a single user, Hadamard matrixes W of different orders are generated by using formula (1)M/2M/2 mutually orthogonal permutation sequences are formed. For example, for a single user quaternary (user ═ 1, M ═ 4), W is used2Constructing two 2 mutually orthogonal permutation sequences; for single user octal (user 1, M8), W is utilized44 mutually orthogonal permutation sequences are constructed.
More generally, for the case of U users with different orders M, Hadamard matrices W of different orders are generated using equation (1)M*U/2Forming M × U/2 mutually orthogonal permutation sequences. Wherein, the value of the number of the users is 1,2,4, …,2kWhere k is 0,1,2, …, to ensure M is U/2 is 2j。
As shown in fig. 3, the receiving end demodulates the received data according to the following steps:
B1) user 1 first recovers the reference chaotic signal
And receives the information-bearing signals in sequence.
B2) Receiving a reference chaotic signal
And walsh matrix W4Multiplying to obtain a corresponding permutation sequence:
the received signal
Except for reference chaotic signal
Each element except the other element is respectively associated with the obtained orthogonal permutation sequence
And (6) solving the inner product.
B3) The mapping bits are estimated with the index of the correlator whose inner product absolute value is the largest, while the output inner product value of the corresponding correlator is compared with a zero threshold to recover the modulation bits.
The present embodiment also provides a Walsh code based PI-DCSK modem system, including a transmitting end and a receiving end, where the transmitting end and the receiving end respectively include a memory, a processor, and a computer program stored in the memory and capable of being run on the processor, and when the processor runs the computer program, the above-mentioned method steps are implemented.
Fig. 4 shows simulation comparison results of the PI-DCSK modulation and demodulation technology added with the walsh code of the present invention and the PI-DCSK technology in the prior art. As can be seen from fig. 4, the delay performance of the present invention is also improved compared to the prior art.
The above are preferred embodiments of the present invention, and all changes made according to the technical scheme of the present invention that produce functional effects do not exceed the scope of the technical scheme of the present invention belong to the protection scope of the present invention.
Claims (6)
1. A PI-DCSK modulation-demodulation method based on Walsh codes is characterized in that a Walsh matrix is constructed and is combined with a generated reference chaotic signal w0Multiplying to obtain mutually absolute orthogonal permutation sequences w1,w2,…,wi(ii) a Dividing a data bit stream to be transmitted into blocks of (n +1) bits, where n bits are mapping bits for selecting mapping orthogonal permutation sequences w1,w2,…,wi(ii) a The remaining single bit is a modulation bit, is subjected to BPSK modulation and then multiplied by the selected permutation sequence, and then is transmitted;
the transmitting end transmits the reference chaotic signal only in a first time slot, and other time slots are all used for transmitting the modulated information bearing signal;
at the receiving end, the reference chaotic signal is recovered firstly
And obtaining orthogonal permutation sequence by using walsh matrix same as that of transmitting end
Then all received information-bearing signals are combined with orthogonal permutation sequences
The inner product is correlated, the mapped bits are estimated with the index of the correlator with the largest amplitude output, and the output inner product value of the corresponding correlator is compared to a zero threshold to recover the modulated bits.
2. The PI-DCSK modulation and demodulation method based on Walsh codes as claimed in claim 1, wherein the transmitting end modulates data to be transmitted according to the following steps:
A1) the chaotic signal generator generates a reference chaotic signal w0And sending out in the first time slot;
A2) constructing a walsh matrix and generating an orthogonal permutation sequence by using the walsh matrix;
for the case that the quaternary M is 4, the length of the reference chaotic signal is beta, and two users are 2, the Walsh code is constructed by utilizing a Hadamard matrix, and the basic structure of the Hadamard matrix is W1＝[+1]Based on the fundamental matrix, a higher order Hadamard matrix can be obtained by equation (1):
wherein j is an integer greater than 0;
therefore, the formula (1) is given as follows:
the following equations (1) and (2) show:
for quaternary users, W is utilized4Generating four mutually orthogonal permutation sequences, which are respectively:
w1＝w0*[+1 +1 +1 +1] (4)
w2＝w0*[+1 -1 +1 -1] (5)
w3＝w0*[+1 +1 -1 -1] (6)
w4＝w0*[+1 -1 -1 +1] (7)
each user respectively selects two permutation sequences to respectively represent data '1' and '0' to be transmitted;
A3) the data bit stream to be transmitted is divided into blocks of (n +1) bits, and the ith bit block of the kth user is written as
Wherein
Is a vector of n mapping bits for selecting an orthogonal permutation sequence,
BPSK modulation is carried out for the modulation bits;
A4) formulating a mapping rule and modulating a sending signal;
by Log2M +1 indicates that the mapping bit of quaternary M + 4 is 1 bit, that is, n is 1, and the mapping rule is selected as follows:
user 1: 0-)>w1＝w0*[+1 +1 +1 +1]
1—>w2＝w0*[+1 -1 +1 -1]
And (4) a user 2: 0-)>w3＝w0*[+1 +1 -1 -1]
1—>w4＝w0*[+1 -1 -1 +1]
I.e. the sequence w for data "0" sent by user 11Permutation transmission, sequence w for transmitted data "12Carrying out permutation sending; sequence w for data "0" transmitted by user 23Permutation transmission, sequence w for transmitted data "14And (5) permutation sending.
3. The method as claimed in claim 2, wherein the Hadamard matrix W of different orders is generated by formula (1) for different orders M of two usersMM mutually orthogonal permutation sequences are formed.
4. The method as claimed in claim 2, wherein the Hadamard matrix W of different orders is generated by formula (1) for different orders M of single userM/2M/2 mutually orthogonal permutation sequences are formed.
5. The PI-DCSK modulation and demodulation method based on Walsh codes as claimed in claim 2, wherein the receiving end demodulates the received data according to the following steps:
B1) user 1 first recovers the reference chaotic signal
And receiving information bearing signals in sequence;
B2) receiving a reference chaotic signal
And walsh matrix W4Multiplying to obtain a correspondenceThe replacement sequence of (1):
the received signal
Except for reference chaotic signal
Each element except the other element is respectively associated with the obtained orthogonal permutation sequence
Solving an inner product;
B3) the mapping bits are estimated with the index of the correlator whose inner product absolute value is the largest, while the output inner product value of the corresponding correlator is compared with a zero threshold to recover the modulation bits.
6. A Walsh code based PI-DCSK modem system comprising a transmitting end and a receiving end, each comprising a memory, a processor and a computer program stored on the memory and executable on the processor, wherein the steps of the method according to any of claims 1-5 are performed when the computer program is executed by the processor.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110473102.5A CN113242198B (en) | 2021-04-29 | 2021-04-29 | PI-DCSK modulation and demodulation method and system based on Walsh codes |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110473102.5A CN113242198B (en) | 2021-04-29 | 2021-04-29 | PI-DCSK modulation and demodulation method and system based on Walsh codes |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113242198A true CN113242198A (en) | 2021-08-10 |
| CN113242198B CN113242198B (en) | 2022-06-21 |
Family
ID=77131358
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110473102.5A Active CN113242198B (en) | 2021-04-29 | 2021-04-29 | PI-DCSK modulation and demodulation method and system based on Walsh codes |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113242198B (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060198522A1 (en) * | 2005-03-07 | 2006-09-07 | Samsung Electronics Co., Ltd. | Wide band-DCSK modulation method, transmitting apparatus thereof, wide band-DCSK demodulation method, and receiving apparatus thereof |
| US20160352361A1 (en) * | 2015-05-27 | 2016-12-01 | John P. Fonseka | Constrained interleaving for 5G wireless and optical transport networks |
| CN108365945A (en) * | 2018-01-24 | 2018-08-03 | 南京邮电大学 | Difference chaotic shift keying modulation demodulator and method based on two-way index modulation |
| 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 |
-
2021
- 2021-04-29 CN CN202110473102.5A patent/CN113242198B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060198522A1 (en) * | 2005-03-07 | 2006-09-07 | Samsung Electronics Co., Ltd. | Wide band-DCSK modulation method, transmitting apparatus thereof, wide band-DCSK demodulation method, and receiving apparatus thereof |
| US20160352361A1 (en) * | 2015-05-27 | 2016-12-01 | John P. Fonseka | Constrained interleaving for 5G wireless and optical transport networks |
| CN108365945A (en) * | 2018-01-24 | 2018-08-03 | 南京邮电大学 | Difference chaotic shift keying modulation demodulator and method based on two-way index modulation |
| CN111988251A (en) * | 2019-05-21 | 2020-11-24 | 重庆邮电大学 | Improved orthogonal multi-user differential chaotic communication system |
| 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 (5)
| Title |
|---|
| F. TALEB等: "Very high efficiency Differential Chaos Shift Keying system with Walsh Hadamard codes", 《2016 5TH INTERNATIONAL CONFERENCE ON MULTIMEDIA COMPUTING AND SYSTEMS (ICMCS)》 * |
| M. HERCEG等: "Permutation Index DCSK Modulation Technique for Secure Multiuser High-Data-Rate Communication Systems", 《IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY》 * |
| W. M. TAM等: "A multiple access scheme for chaos-based digital communication systems utilizing transmitted reference", 《IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I: REGULAR PAPERS》 * |
| 张刚等: "基于频分复用的无信号内干扰多用户相关延迟键控通信系统", 《上海交通大学学报》 * |
| 张刚等: "改进型OMU-NRDCSK通信系统的设计与分析", 《西安电子科技大学学报》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113242198B (en) | 2022-06-21 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN100477566C (en) | Constant frame coding double quadrature modulation and demodulation device | |
| CN102340328B (en) | Signal transmitting and receiving method of multi-carrier MIMO (multiple input multiple output) system based on chip-level spread spectrum code of space-time-frequency three-dimensional complementary code | |
| CN105515713A (en) | Multi-user CDMA (Code Division Multiple Access) communication method and corresponding transmitter and receiver | |
| CN102394683B (en) | Double-antenna multi-carrier wave MIMO (multi-input and multi-output) system based on mutual complementing codes | |
| CN113890805B (en) | Multi-user multi-carrier CDSK chaotic communication method and system with high transmission rate | |
| CN104009834A (en) | MIMO secret communication method based on differential chaos shift keying | |
| Yang et al. | A high data rate solution for differential chaos shift keying based on carrier index modulation | |
| CN111770040A (en) | Improved multi-user DCSK chaotic communication system | |
| CN113114600A (en) | Difference chaos shift keying modulator and method for re-difference arrangement index | |
| CN113242198B (en) | PI-DCSK modulation and demodulation method and system based on Walsh codes | |
| CN111988128A (en) | Multi-input single-output multi-user orthogonal efficient DCSK communication scheme | |
| CN103269236A (en) | Method for spread spectrum modulation and demodulation of code element grouping time-shifting position | |
| CN101355373B (en) | Method for generating signal of non-interference quasi-synchronous CDMA communication system | |
| CN108768471A (en) | The MIMO-OFDM-CDMA spectrum spreading methods of Combination selection mapping | |
| CN112073156B (en) | High-dimensional non-orthogonal transmission method | |
| CN113114452A (en) | Multi-user secret communication method based on high-dimensional chaos | |
| Zhang et al. | Multi-user high rate security differential chaos shift keying | |
| Cheong et al. | Permutation-based M-ary chaotic-sequence spread-spectrum communication systems | |
| CN102664659B (en) | Multicarrier MISO (multiple input single output) system based on chip-level space-time coding | |
| CN105812310B (en) | Single carrier MIMO communication means and device based on ZCZ sequence and phase rotation | |
| CN116405055B (en) | Spread spectrum communication method, system and related device | |
| CN114666191B (en) | Communication method of orthogonal multi-user shift noise reduction DCSK chaotic communication system | |
| CN102684767B (en) | Multi-carrier MISO system based on three-dimensional mutual-complementing code | |
| Yang et al. | A Novel Multi-User Carrier Index Differential Chaos Shift Keying Modulation Scheme | |
| Chen et al. | Capacity of space–time block-coded CDMA systems: Comparison of unitary and complementary codes |
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 | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20231128 Address after: 361000 unit 1001, No.56, guanri Road, phase II, software park, Siming District, Xiamen City, Fujian Province Patentee after: Fujian Xingwang Intelligent Technology Co.,Ltd. Address before: Jinjiang science and Education Park, Fuzhou University, No.1 Shuicheng Road, Jinjing Town, Jinjiang City, Quanzhou City, Fujian Province Patentee before: FUZHOU University |
|
| TR01 | Transfer of patent right |