CN116566427A - High-dimensional index modulation spread spectrum communication method - Google Patents
High-dimensional index modulation spread spectrum communication method Download PDFInfo
- Publication number
- CN116566427A CN116566427A CN202310557829.0A CN202310557829A CN116566427A CN 116566427 A CN116566427 A CN 116566427A CN 202310557829 A CN202310557829 A CN 202310557829A CN 116566427 A CN116566427 A CN 116566427A
- Authority
- CN
- China
- Prior art keywords
- data
- index
- dimension
- security level
- user security
- 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.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 51
- 230000006854 communication Effects 0.000 title claims abstract description 36
- 238000004891 communication Methods 0.000 title claims abstract description 33
- 238000001228 spectrum Methods 0.000 title claims abstract description 31
- 238000012545 processing Methods 0.000 claims abstract description 48
- 230000000739 chaotic effect Effects 0.000 claims abstract description 35
- 230000005540 biological transmission Effects 0.000 claims abstract description 29
- 238000004364 calculation method Methods 0.000 claims abstract description 17
- 125000004122 cyclic group Chemical group 0.000 claims abstract description 14
- 238000013507 mapping Methods 0.000 claims description 21
- 238000004458 analytical method Methods 0.000 claims description 9
- 238000006243 chemical reaction Methods 0.000 claims description 7
- 238000007405 data analysis Methods 0.000 claims description 6
- NAWXUBYGYWOOIX-SFHVURJKSA-N (2s)-2-[[4-[2-(2,4-diaminoquinazolin-6-yl)ethyl]benzoyl]amino]-4-methylidenepentanedioic acid Chemical compound C1=CC2=NC(N)=NC(N)=C2C=C1CCC1=CC=C(C(=O)N[C@@H](CC(=C)C(O)=O)C(O)=O)C=C1 NAWXUBYGYWOOIX-SFHVURJKSA-N 0.000 claims description 3
- 238000001914 filtration Methods 0.000 claims description 3
- 238000004519 manufacturing process Methods 0.000 claims description 3
- 238000005070 sampling Methods 0.000 claims description 3
- 230000008569 process Effects 0.000 abstract description 4
- 230000007547 defect Effects 0.000 abstract description 2
- 230000008859 change Effects 0.000 description 3
- 230000000694 effects Effects 0.000 description 2
- 230000006872 improvement Effects 0.000 description 2
- 230000007480 spreading Effects 0.000 description 2
- 238000012360 testing method Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000005259 measurement Methods 0.000 description 1
- 238000011160 research Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B1/00—Details of transmission systems, not covered by a single one of groups H04B3/00 - H04B13/00; Details of transmission systems not characterised by the medium used for transmission
- H04B1/69—Spread spectrum techniques
- H04B1/707—Spread spectrum techniques using direct sequence modulation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L27/00—Modulated-carrier systems
- H04L27/26—Systems using multi-frequency codes
- H04L27/2601—Multicarrier modulation systems
- H04L27/2602—Signal structure
- H04L27/2605—Symbol extensions, e.g. Zero Tail, Unique Word [UW]
- H04L27/2607—Cyclic extensions
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L27/00—Modulated-carrier systems
- H04L27/26—Systems using multi-frequency codes
- H04L27/2601—Multicarrier modulation systems
- H04L27/2626—Arrangements specific to the transmitter only
- H04L27/2627—Modulators
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Compression, Expansion, Code Conversion, And Decoders (AREA)
Abstract
Aiming at the defects of the prior art, the invention designs a high-dimensional index modulation spread spectrum communication method which comprises the steps of firstly customizing user security level codes and transmission efficiency demand codes according to user demands, further carrying out dimension division, and then flexibly constructing an order index pool, an initial value index pool and a shift index pool according to the user security level codes; secondly, generating a Tent chaotic sequence by using the converted second dimension data index, performing spread spectrum processing by using the converted third dimension data index in a cyclic right shift way and combining a fixed pseudo code, and finally performing WFRFT processing by using the converted fourth dimension data index WFRFT order to generate a high dimension index modulation spread spectrum signal; the receiving end analyzes the second dimension, third dimension, fourth dimension data and despread first dimension data through corresponding multi-channel correlation, peak value and peak value channel calculation and other processes, and completes the high dimension index modulation spread spectrum signal reception; the invention is applied to the spread spectrum communication field, and achieves the purposes of improving the data rate and the frequency band utilization rate.
Description
Technical Field
The invention relates to the field of wireless communication, in particular to a high-dimensional index modulation spread spectrum communication method.
Background
The direct sequence spread spectrum has the advantages of wide spectrum, low working signal to noise ratio, easy realization of code division multiple access, strong confidentiality and anti-interference capability, and the like, and is widely applied to various fields, such as: global positioning system, measurement and control, satellite communication, etc. Conventional direct sequence spread spectrum communications, while having many advantages, do not meet the requirements for efficient transmission in channels with narrow bandwidth and high processing gain requirements because the advantages are at the expense of broadening the signal spectrum. Furthermore, index modulation direct-spread communication appears, and although the contradiction between the data transmission rate and the frequency band utilization rate of the traditional direct-spread communication can be improved, the method is based on the increase of pseudo code resources, so that the frequency spectrum utilization rate of a system is effectively improved, the information transmission rate is improved, a large amount of index code resources are consumed, the performance of the bit error rate is reduced, and the information transmission rate improvement rate is severely limited. Meanwhile, with the continuous improvement of communication requirements, the requirements of multi-level, multi-application and safer communication are also urgent, so that the research on a high-dimensional data index transmission method with higher safety becomes an important point at the present stage.
Disclosure of Invention
Aiming at the defects of the prior art, the invention designs a high-dimensional index modulation spread spectrum communication method which comprises the steps of firstly customizing a user security level code and a transmission efficiency demand code according to user demands, further carrying out dimension division, then flexibly constructing an order index pool, an initial value index pool and a shift index pool according to the user security level code, secondly, generating a Tent chaotic sequence by utilizing a converted two-dimensional data index, carrying out spread spectrum processing by utilizing a converted three-dimensional data index cyclic right shift quantity and combining a fixed pseudo code, and finally, carrying out WFRFT processing by utilizing a converted four-dimensional data index WFRFT order to generate a high-dimensional index modulation spread spectrum signal; the receiving end analyzes the multi-dimensional data and despreads the one-dimensional data through corresponding multi-channel correlation, peak value channel calculation and other processes, and completes the receiving of the high-dimensional index modulation spread spectrum signal; the invention is applied to the spread spectrum communication field, and achieves the purposes of improving the data rate and the frequency band utilization rate.
The high-dimensional index modulation spread spectrum communication method comprises two parts of data communication for a transmitting end and a receiving end;
the specific processing process of the transmitting end comprises the following steps:
step 1: setting the total data to be transmitted by a user as D (n), wherein the total data length of each period is L, and analyzing n E [1, L ] according to the requirements of the user on the security level and the transmission efficiency, and defining a three-bit user security level code A and a one-bit transmission efficiency requirement code R;
the user security level demands are divided into 8 levels, the lowest level is 0 level, the highest level is 7 level, and the higher the level is, the more security data are required to be transmitted; the user security level is determined by the ratio of the security data rate to the base data rate that the user needs to transmit;
the corresponding relation between the user security level requirement and the user security level code is specifically as follows: a=000 when the user security level is level 0; when the user security level is level 1, a=001; when the user security level is level 2, a=010; when the user security level is level 3, a=011; when the user security level is level 4, a=100; when the user security level is 5, a=101; when the user security level is level 6, a=110; when the user security level is 7, a=111;
the corresponding relation between the requirement of the user transmission efficiency and the transmission efficiency requirement code is specifically: when the user does not need a fast transmission, r=0; when a user needs a quick transmission, r=1;
step 2: defining a second dimension data length L according to the user security level code A and the transmission efficiency demand code R 2 Third dimension data length L 3 Further, as shown in formulas (1) and (2), the first dimension data length L is calculated 1 As shown in formula (3), the user security level code a is considered to be 3 bits at the same time, so that the fourth-dimensional data length is defined to be 3;
L 3 ＝bin2dec[A] (2)
where N is a period spread pseudo code length,as a function of the result of rounding down and raising down to an integer power of 2, bin2dec [ · ]]Converting a decimal processing function for binary;
step 3: using a first dimension data length L 1 Second dimension data Length L 2 And a third dimension data length L 3 Performing dimension division processing on total data D (n) with length L as shown in formula (4), and simultaneously, using the user security level code A as fourth dimension data D 4 (n) the dimension after division is 4;
step 4: after the data dimension is divided, the second dimension data D 2 (n), third dimensional data D 3 (n), fourth-dimensional data D 4 (n) performing data conversion processing as shown in a formula (5); due to the second dimension data D 2 (n), third dimensional data D 3 (n), fourth-dimensional data D 4 (n) the data length is L respectively 2 、L 3 And 3, therefore, the calculation range of γ is 0 to 7, and the calculation range of η isf is calculated to be +.>bin2dec[·]Converting binary into decimal function;
step 5: calculating an index pool of the data index by using f, eta and gamma obtained after conversion;
step 5.1: firstly, establishing an order index pool of WFRFT, wherein the size of the order index pool is 8 because gamma is 0-7; because the anti-scanning interval of the WFRFT is more than 0.01, and the anti-interception interval of the WFRFT is considered to be an interval with the order of 1.92-2, the establishment of an order index pool is shown in a formula (6), and the order index pool is disclosed in the communication process;
α γ ＝1.92+0.011γ (6)
step 5.2: then, the initial value index pool calculation of the pseudo code sequence is carried out, and the eta range isSo the initial value index pool size is +.>In order to improve the triple antibody capability of data communication, the pseudo code sequence selects a Tent mapping chaotic sequence, and as the initial value range of the Tent mapping is [ 01 ], an initial value index pool is established as follows:
β η ＝0.0078η (7)
step 5.3: finally, combining good correlation characteristics of the Tent mapping chaotic sequence, and establishing a shift index pool of the chaotic sequence, wherein the f range isThe shift index pool size is +.>The shift index pool is:
κ f ＝1000f (8)
step 6: based on the established initial value index pool, mapping initial value beta of chaotic sequence by utilizing eta index Tent η The method comprises the following steps:introducing a Tent mapping iterative equation to generate a chaotic sequence +.>As shown in formula (9), due to fractal parameter +.>When= 0.4997, the Kent chaotic sequence presents the best chaotic form, namely reaches the full mapping state, so the fractal parameterThe initial range of the Tent map is [ 01 ], for this purpose ]>Sequence values range also [0 1), based on the generationSequence, further pair->Binarizing the sequence to obtain +.>As shown in formula (10); wherein ave (·) is the calculated mean function;
step 7: based on the shift index pool established in the step 5, the shift parameters of the f index chaotic sequence are utilized, and kappa is used f For cyclic offset, for productionPerforming circular right shift kappa f Bit get->Wherein (1)>For cyclic right shift kappa f A processing function of the bits;
step 8: generation and all ofOrthogonal fixed pseudo-code E (n), i.e. E (n) and all +.>Is also orthogonal; further performing pseudo code sequence superposition processing to obtain +.>
Step 9: by means ofFor the first dimension data D 1 (n) performing spread spectrum processing to obtain a baseband signal y (n);
step 10: and (3) based on the order index pool established in the step (5), indexing the order index pool to obtain alpha by utilizing gamma converted by the data of the user security level code γ Further, the baseband signal y (n) is subjected to an order of alpha γ Obtaining a baseband modulation signal S' (n) by WFRFT processing of (a); wherein Y (n), Y (-n), Y (-n) are the results of 1, 2, 3 Fourier transforms on Y (n), respectively;
the specific processing procedure of the receiving end comprises the following steps:
step 1: front-end processing of down-conversion, sampling and filtering is carried out on the received signal S' (n), and the processed baseband is providedThe signal is denoted as S (N), where N 0 Weighting the processed various noise items;
step 2: for authorized users, the order index pool is public, so j traverses from 0 to 7, a local order index pool is generated as formula (16), and the order of 8 channels of the processed baseband signal S (n) is epsilon respectively j The WFRFT inverse of (2) as shown in equation (17);
ε j ＝1.92+0.011j (16)
step 3: generating a local fixed pseudo code E (n) and S for 8 channels j (n) respectively carrying out correlation operation with E (n) to obtain 8 channel correlation results X j (n); traversing j from 0 to 7, wherein j is a correlation operation symbol;
X j (n)＝S j (n)*E(n) (18)
step 4: for correlation result X j (n) peak processing, first, maximum peak-to-average ratio calculation is performed, i.e., 8 groups X are calculated j The ratio of the maximum peak to the average peak in each group of (n), where PRA [. Cndot.]Calculating a function for the maximum peak-to-average ratio; further select 8P j Maximum value of (2) to obtain P J Wherein max [. Cndot.]Calculating a function for the maximum value; j is the index of the largest channel, i.e., J equals P j Maximum value P of J Wherein max [. Cndot.] channel Calculating a function for the maximum value channel; then, calculate X J The peak position H of (n), wherein channel [. Cndot. ]]Calculating a function for the position corresponding to the maximum value;
P j ＝PRA[X j (n)] (19)
P J ＝max[P j ] (20)
J＝max[P j ] channel -1 (21)
H＝channel[X J (n)] (22)
step 5: resolving fourth dimension data D 'using maximum value channel J' 4 (n)；
D' 4 (n)＝dec2bin[J] (23)
Step 6: the fixed pseudo code E (n) is shifted right by H bits in a cyclic manner, and j=j is substituted into S j In (n), S is obtained J (n) and then S J (n) and E (n) are subjected to sequence multiplication operation to obtain a first-stage despread baseband signal R (n), wherein shift [. Cndot.] H A calculation function for circularly right shifting H bits;
R(n)＝S J (n)shift[E(n)] H (24)
step 7: calculating the number of secondary despreading channels to 2 using J J And further i ranges from 0 to (2 J -1) traversing the initial value index pool and combining with formula (25), calculating to obtain initial value parameter set beta' i The method comprises the steps of carrying out a first treatment on the surface of the Further, in combination with equation (26), respectively, in β' i Is the initial value to replaceStructure 2 J Group local Tent mapping chaotic sequence ++>And combining the binarization processing of the formula (27) to obtain 2 J Group local chaotic sequence->
β′ i ＝0.0078i (25)
Step 8: the baseband signals R (n) and 2 after the primary despreading J Of individual channelsPerforming parallel correlation operation to obtain 2 J Personal correlation results->
Step 9: for correlation resultsPerforming peak processing, firstly, calculating the maximum peak-to-average ratio, and further selecting 2 J Personal->The index of the maximum channel in (I) i.e. I equals +.>Beta of the medium maximum value i 'A'; then, calculate +.>Peak position H';
step 10: the data analysis processing is carried out by utilizing I, H and H', so as to obtain second-dimensional data and third-dimensional data after analysis;
step 10.1: converting the data of the index I of the maximum value channel to obtain third dimensional data D 'after analysis' 3 (n) wherein dec2bin [. Cndot.]Converting a binary function for decimal;
D' 3 (n)＝dec2bin[I] (32)
step 10.2: the peak positions H and H ' are utilized to conduct data analysis to obtain second dimension data D ' after analysis ' 2 (n) wherein round [. Cndot []Is a rounding function;
step 11: carry-over with I into beta' i I.e. i=β' i Selecting a local chaotic sequence C I (n) performing cyclic right shift of H 'bit, and performing sequential multiplication operation with R (n) to obtain second-level despread first-dimension data D' 1 (n); completing data communication;
D′ 1 (n)＝R(n)shift[C I (n)] H' (34)
the invention has the beneficial technical effects that:
the invention establishes a high-dimensional index modulation spread spectrum communication method, can improve the data rate without sacrificing the frequency band utilization, and the related complexity can be flexibly controlled by the user security level code, thereby greatly improving the limitations of high and fixed complexity of the traditional index modulation and providing a theoretical basis for the development of a new generation spread spectrum communication system.
Drawings
FIG. 1 is a schematic diagram of a high-dimensional index modulation spread spectrum communication method of the present invention;
FIG. 2 is a graph of the variation of gain with total data rate multiple increase in accordance with an embodiment of the present invention;
FIG. 3 is a graph of the change in the multiple of transmissible data rates with increasing complexity of the associated channels in accordance with an embodiment of the present invention.
Detailed Description
The invention will be further described with reference to the accompanying drawings and examples;
a high-dimensional index modulation spread spectrum communication method is shown in figure 1, and the specific content comprises two parts of data communication for a transmitting end and a receiving end;
the specific processing process of the transmitting end comprises the following steps:
step 1: setting the total data to be transmitted by a user as D (n), wherein the total data length of each period is L, and analyzing n E [1, L ] according to the requirements of the user on the security level and the transmission efficiency, and defining a three-bit user security level code A and a one-bit transmission efficiency requirement code R; specific explanations are shown in Table 1;
the user security level demands are divided into 8 levels, the lowest level is 0 level, the highest level is 7 level, and the higher the level is, the more security data are required to be transmitted; the user security level is determined by the ratio of the security data rate to the base data rate that the user needs to transmit; for example: when the secure data rate is 2 times the base data rate, then the user security level is 2.
TABLE 1 user Security class code A and Transmission efficiency requirement code R interpretation
Step 2: defining a second dimension data length L according to the user security level code A and the transmission efficiency demand code R 2 Third dimension data length L 3 Further, as shown in formulas (1) and (2), the first dimension data length L is calculated 1 As shown in formula (3), the user security level code a is considered to be 3 bits at the same time, so that the fourth-dimensional data length is defined to be 3;
L 3 ＝bin2dec[A] (2)
L 1 ＝L-L 2 -L 3 (3)
where N is a period spread pseudo code length,as a function of the result of rounding down and raising down to an integer power of 2, bin2dec [ · ]]Converting a decimal processing function for binary;
step 3: using a first dimension data length L 1 Second dimension data Length L 2 And a third dimension data length L 3 Performing dimension division processing on total data D (n) with length L as shown in formula (4), and simultaneously, using the user security level code A as fourth dimension data D 4 (n) the dimension after division is 4;
step 4: after the data dimension is divided, the second dimension data D 2 (n), third dimensional data D 3 (n), fourth-dimensional data D 4 (n) performing data conversion processing as shown in a formula (5); due to the second dimension data D 2 (n), third dimensional data D 3 (n), fourth-dimensional data D 4 (n) the data length is L respectively 2 、L 3 And 3, therefore, the calculation range of γ is 0 to 7, and the calculation range of η isf is calculated to be +.>bin2dec[·]Converting binary into decimal function;
step 5: calculating an index pool of the data index by using f, eta and gamma obtained after conversion;
step 5.1: firstly, establishing an order index pool of WFRFT, wherein the size of the order index pool is 8 because gamma is 0-7; because the anti-scanning interval of the WFRFT is more than 0.01, and the anti-interception interval of the WFRFT is considered to be an interval with the order of 1.92-2, the establishment of an order index pool is shown in a formula (6), and the order index pool is disclosed in the communication process;
α γ ＝1.92+0.011γ (6)
step 5.2: then, the initial value index pool calculation of the pseudo code sequence is carried out, and the eta range isSo the initial value index pool size is +.>In order to improve the triple antibody capability of data communication, the pseudo code sequence selects a Tent mapping chaotic sequence, and as the initial value range of the Tent mapping is [ 01 ], an initial value index pool is established as follows:
β η ＝0.0078η (7)
step 5.3: finally, combining good correlation characteristics of the Tent mapping chaotic sequence, and establishing a shift index pool of the chaotic sequence, wherein the f range isThe shift index pool size is +.>The shift index pool is:
κ f ＝1000f (8)
step 6: based on the established initial value index pool, mapping initial value beta of chaotic sequence by utilizing eta index Tent η The method comprises the following steps:introducing a Tent mapping iterative equation to generate a chaotic sequence +.>As shown in formula (9), due to fractal parameter +.>When= 0.4997, the Kent chaotic sequence presents the best chaotic form, namely reaches the full mapping state, so the fractal parameterThe initial range of the Tent map is [ 01 ], for this purpose ]>Sequence values range also [0 1), based on the generationSequence, further pair->Binarizing the sequence to obtain +.>As shown in formula (10); wherein ave (·) is the calculated mean function;
step 7: based on the shift index pool established in the step 5, the shift parameters of the f index chaotic sequence are utilized, and kappa is used f For cyclic offset, for productionPerforming circular right shift kappa f Bit get->Wherein (1)>For cyclic right shift kappa f A processing function of the bits;
step 8: generation and all ofOrthogonal fixed pseudo-code E (n), i.e. E (n) and all +.>Is also orthogonal; further performing pseudo code sequence superposition processing to obtain +.>
Step 9: by means ofFor the first dimension data D 1 (n) performing spread spectrum processing to obtain a baseband signal y (n);
step 10: based on the order index pool established in the step 5, utilizing the gamma converted by the data of the user security level code,index order index pool is carried out to obtain alpha γ Further, the baseband signal y (n) is subjected to an order of alpha γ Obtaining a baseband modulation signal S' (n) by WFRFT processing of (a); wherein Y (n), Y (-n), Y (-n) are the results of 1, 2, 3 Fourier transforms on Y (n), respectively;
the specific processing procedure of the receiving end comprises the following steps:
step 1: front-end processing of down-converting, sampling and filtering is performed on the received signal S' (N), and the processed baseband signal is denoted as S (N), where N 0 Weighting the processed various noise items;
step 2: for authorized users, the order index pool is public, so j traverses from 0 to 7, a local order index pool is generated as formula (16), and the order of 8 channels of the processed baseband signal S (n) is epsilon respectively j The WFRFT inverse of (2) as shown in equation (17);
ε j ＝1.92+0.011j (16)
step 3: generating a local fixed pseudo code E (n) and S for 8 channels j (n) respectively carrying out correlation operation with E (n) to obtain 8 channel correlation results X j (n); traversing j from 0 to 7, wherein j is a correlation operation symbol;
X j (n)＝S j (n)*E(n) (18)
step 4: for correlation result X j (n) peak processing, first, maximum peak-to-average ratio calculation is performed, i.e., 8 groups X are calculated j Maximum peak and average peak per group in (n)Ratio of values, where PRA [. Cndot.]Calculating a function for the maximum peak-to-average ratio; further select 8P j Maximum value of (2) to obtain P J Wherein max [. Cndot.]Calculating a function for the maximum value; j is the index of the largest channel, i.e., J equals P j Maximum value P of J Wherein max [. Cndot.] channel Calculating a function for the maximum value channel; then, calculate X J The peak position H of (n), wherein channel [. Cndot. ]]Calculating a function for the position corresponding to the maximum value;
P j ＝PRA[X j (n)] (19)
P J ＝max[P j ] (20)
H＝max[P j ] channel -1 (21)
H＝channel[X J (n)] (22)
step 5: resolving fourth dimension data D 'using maximum value channel J' 4 (n)；
D' 4 (n)＝dec2bin[J] (23)
Step 6: the fixed pseudo code E (n) is shifted right by H bits in a cyclic manner, and j=j is substituted into S j In (n), S is obtained J (n) and then S J (n) and E (n) are subjected to sequence multiplication operation to obtain a first-stage despread baseband signal R (n), wherein shift [. Cndot.] H A calculation function for circularly right shifting H bits;
R(n)＝S J (n)shift[E(n)] H (24)
step 7: calculating the number of secondary despreading channels to 2 using J J And further i ranges from 0 to (2 J -1) traversing the initial value index pool and combining with formula (25), calculating to obtain initial value parameter set beta' i The method comprises the steps of carrying out a first treatment on the surface of the Further, in combination with equation (26), respectively, in β' i Is the initial value to replaceStructure 2 J Group local Tent mapping chaotic sequence ++>And combining the binarization processing of the formula (27) to obtain 2 J Group local chaotic sequence->
β′ i ＝0.0078i (25)
Step 8: the baseband signals R (n) and 2 after the primary despreading J Of individual channelsPerforming parallel correlation operation to obtain 2 J Personal correlation results->
Step 9: for correlation resultsPerforming peak processing, firstly, calculating the maximum peak-to-average ratio, and further selecting 2 J Personal (S)The index of the maximum channel in (I) i.e. I equals +.>Beta 'of the medium maximum' i The method comprises the steps of carrying out a first treatment on the surface of the Then, calculate +.>Peak position H';
step 10: the data analysis processing is carried out by utilizing I, H and H', so as to obtain second-dimensional data and third-dimensional data after analysis;
step 10.1: converting the data of the index I of the maximum value channel to obtain third dimensional data D 'after analysis' 3 (n) wherein dec2bin [. Cndot.]Converting a binary function for decimal;
D' 3 (n)＝dec2bin[I] (32)
step 10.2: the peak positions H and H ' are utilized to conduct data analysis to obtain second dimension data D ' after analysis ' 2 (n) wherein round [. Cndot []Is a rounding function;
step 11: carry-over with I beta i ' i=β i ' selecting a local chaotic sequence C I (n) performing cyclic right shift of H' bit, and performing sequential multiplication operation with R (n) to obtain second-level despread first-dimension data D 1 ' s (n); completing data communication;
D 1 '(n)＝R(n)shift[C I (n)] H' (34)
in order to verify the technical effect of the invention, the method is tested and verified as follows:
to verify the innovativeness of the method of the present invention, it is compared with the existing Code Index Modulation (CIM) method; the parameters are set to 100bit/s for the base rate and-12 dB for the signal-to-noise ratio.
Test one: the complexity is fixed as the relevant channel 128 channel, and under the condition that the multiples B of the spreading sequence rate and the basic rate are 1000, 5000 and 9000 respectively, compared with the CIM method, the gain change result is shown in figure 2 along with the increase of the total data rate multiple (the multiple of the total data rate and the basic rate). It can be seen that the gain obtainable by the method of the present invention is 3dB-5dB greater than the gain obtainable by the CIM method under the same total data rate multiple and the same B, so that a better anti-interference capability can be obtained. Meanwhile, under the conditions of the same gain and the same B, the total rate of the transmission of the method is far greater than that of the CIM method, which shows that the method has stronger transmission capacity.
And II, testing: the gain is fixed to be 50dB, and in the cases that the multiples B of the spreading sequence rate and the base rate are 1000, 5000, 9000 respectively, the method of the present invention and the CIM method are compared, and as the complexity of the relevant channel increases, the result of the change of the multiple of the data rate (the multiple of the total data rate and the base rate) can be transmitted, as shown in fig. 3. It can be seen that, under the condition of the same complexity of the related channels, the data rate multiple of the method can be transmitted far greater than that of the CIM method, i.e. the method has stronger transmission capacity; meanwhile, under the condition of the same transmission data rate multiple, the complexity of the related channels of the method is far lower than that of the CIM method, namely the method has lower processing complexity and higher use value.
Claims (6)
1. A high-dimensional index modulation spread spectrum communication method is characterized in that the method specifically comprises two parts of data communication for a transmitting end and a receiving end.
2. The high-dimensional index modulation spread spectrum communication method according to claim 1, wherein the transmitting end specific processing procedure comprises:
step 1: setting the total data to be transmitted by a user as D (n), wherein the total data length of each period is L, and analyzing n E [1, L ] according to the requirements of the user on the security level and the transmission efficiency, and defining a three-bit user security level code A and a one-bit transmission efficiency requirement code R;
step 2: defining a second dimension data length L according to the user security level code A and the transmission efficiency demand code R 2 Third dimension data length L 3 Further, as shown in formulas (1) and (2), the first dimension data length L is calculated 1 As shown in formula (3), the user security level code a is considered to be 3 bits at the same time, so that the fourth-dimensional data length is defined to be 3;
L 3 ＝bin2dec[A] (2)
L 1 ＝L-L 2 -L 3 (3)
where N is a period spread pseudo code length,as a function of the result of rounding down and raising down to an integer power of 2, bin2dec [ · ]]Converting a decimal processing function for binary;
step 3: using a first dimension data length L 1 Second dimension data Length L 2 And a third dimension data length L 3 Performing dimension division processing on total data D (n) with length L as shown in formula (4), and simultaneously, using the user security level code A as fourth dimension data D 4 (n) the dimension after division is 4;
step 4: after the data dimension is divided, the second dimension data D 2 (n), third dimensional data D 3 (n), fourth-dimensional data D 4 (n) performing data conversion processing as shown in a formula (5); from the following componentsIn the second dimension data D 2 (n), third dimensional data D 3 (n), fourth-dimensional data D 4 (n) the data length is L respectively 2 、L 3 And 3, therefore, the calculation range of γ is 0 to 7, and the calculation range of η isf is calculated to be +.>bin2dec[·]Converting binary into decimal function;
step 5: calculating an index pool of the data index by using f, eta and gamma obtained after conversion;
step 6: based on the established initial value index pool, mapping initial value beta of chaotic sequence by utilizing eta index Tent η The method comprises the following steps:introducing a Tent mapping iterative equation to generate a chaotic sequence +.>As shown in formula (9), due to fractal parameter +.> When the Kent chaotic sequence shows the best chaotic form, namely, the full mapping state is reached, so that the fractal parameterThe initial range of the Tent map is [ 01 ], for this purpose ]>Sequence values range also [0 1), based on the generationSequence, further pair->Binarizing the sequence to obtain +.>As shown in formula (10); wherein ave (·) is the calculated mean function;
step 7: based on the shift index pool established in the step 5, the shift parameters of the f index chaotic sequence are utilized, and kappa is used f For cyclic offset, for productionPerforming circular right shift kappa f Bit get->Wherein (1)>For cyclic right shift kappa f A processing function of the bits;
step 8: generation and all ofOrthogonal fixed pseudo-code E (n), i.e. E (n) and all +.>Is also orthogonal; further performing pseudo code sequence superposition processing to obtain +.>
Step 9: by means ofFor the first dimension data D 1 (n) performing spread spectrum processing to obtain a baseband signal y (n);
step 10: and (3) based on the order index pool established in the step (5), indexing the order index pool to obtain alpha by utilizing gamma converted by the data of the user security level code γ Further, the baseband signal y (n) is subjected to an order of alpha γ Obtaining a baseband modulation signal S' (n) by WFRFT processing of (a); wherein Y (n), Y (-n), Y (-n) are the results of 1, 2, 3 Fourier transforms on Y (n), respectively;
3. the method of claim 2, wherein the user security level requirements in step 1 are divided into 8 levels, the lowest level is 0 level, the highest level is 7 level, and the higher the level, the more security data is required to be transmitted; the user security level is determined by the ratio of the security data rate to the base data rate that the user needs to transmit;
the corresponding relation between the user security level requirement and the user security level code is specifically as follows: a=000 when the user security level is level 0; when the user security level is level 1, a=001; when the user security level is level 2, a=010; when the user security level is level 3, a=011; when the user security level is level 4, a=100; when the user security level is 5, a=101; when the user security level is level 6, a=110; when the user security level is 7, a=111;
the corresponding relation between the requirement of the user transmission efficiency and the transmission efficiency requirement code is specifically: when the user does not need a fast transmission, r=0; when the user needs a fast transmission, r=1.
4. The high-dimensional index modulation spread spectrum communication method according to claim 2, wherein step 5 specifically comprises:
step 5.1: firstly, establishing an order index pool of WFRFT, wherein the size of the order index pool is 8 because gamma is 0-7; because the anti-scanning interval of the WFRFT is more than 0.01, and the anti-interception interval of the WFRFT is considered to be an interval with the order of 1.92-2, the establishment of an order index pool is shown in a formula (6), and the order index pool is disclosed in the communication process;
α γ ＝1.92+0.011γ (6)
step 5.2: then, the initial value index pool calculation of the pseudo code sequence is carried out, and the eta range isSo the initial value index pool size is +.>For the purpose ofThe three-antibody capability of data communication is improved, the pseudo code sequence selects a Tent mapping chaotic sequence, and as the initial value range of the Tent mapping is [ 01 ], an initial value index pool is established as follows:
β η ＝0.0078η (7)
step 5.3: finally, combining good correlation characteristics of the Tent mapping chaotic sequence, and establishing a shift index pool of the chaotic sequence, wherein the f range isThe shift index pool size is +.>The shift index pool is:
κ f ＝1000f (8)。
5. the method for high-dimensional index modulation spread spectrum communication according to claim 1, wherein the specific processing procedure of the receiving end comprises:
step 1: front-end processing of down-converting, sampling and filtering is performed on the received signal S' (N), and the processed baseband signal is denoted as S (N), where N 0 Weighting the processed various noise items;
S(n)≈ω 0 (α γ )y(n)+ω 1 (α γ )Y(n)+ω 2 (α γ )y(-n)+ω 3 (α γ )Y(-n)+N 0 (15)
step 2: for authorized users, the order index pool is public, so j traverses from 0 to 7, a local order index pool is generated as formula (16), and the order of 8 channels of the processed baseband signal S (n) is epsilon respectively j The WFRFT inverse of (2) as shown in equation (17);
ε j ＝1.92+0.011j (16)
step 3: generating a local fixed pseudo code E (n) and S for 8 channels j (n) respectively carrying out correlation operation with E (n) to obtain 8 channel correlation results X j (n); traversing j from 0 to 7, wherein j is a correlation operation symbol;
X j (n)＝S j (n)*E(n) (18)
step 4: for correlation result X j (n) peak processing, first, maximum peak-to-average ratio calculation is performed, i.e., 8 groups X are calculated j The ratio of the maximum peak to the average peak in each group of (n), where PRA [. Cndot.]Calculating a function for the maximum peak-to-average ratio; further select 8P j Maximum value of (2) to obtain P J Wherein max [. Cndot.]Calculating a function for the maximum value; j is the index of the largest channel, i.e., J equals P j Maximum value P of J Wherein max [. Cndot.] channel Calculating a function for the maximum value channel; then, calculate X J The peak position H of (n), wherein channel [. Cndot. ]]Calculating a function for the position corresponding to the maximum value;
P j ＝PRA[X j (n)] (19)
P J ＝max[P j ] (20)
J＝max[P j ] channel -1 (21)
H＝channel[X J (n)] (22)
step 5: resolving fourth dimension data D 'using maximum value channel J' 4 (n)；
D' 4 (n)＝dec2bin[J] (23)
Step 6: the fixed pseudo code E (n) is shifted right by H bits in a cyclic manner, and j=j is substituted into S j In (n), S is obtained J (n) and then S J (n) and E (n) are subjected to sequence multiplication operation to obtain a first-stage despread baseband signal R (n), wherein shift [. Cndot.] H A calculation function for circularly right shifting H bits;
R(n)＝S J (n)shift[E(n)] H (24)
step 7: calculating the number of secondary despreading channels to 2 using J J And further i ranges from 0 to (2 J -1) traversing the initial value index pool and combining with formula (25), calculating to obtain initial value parameter set beta' i The method comprises the steps of carrying out a first treatment on the surface of the Further, in combination with equation (26), respectively, in β' i Is the initial value to replaceStructure 2 J Group local Tent mapping chaotic sequence ++>And combining the binarization processing of the formula (27) to obtain 2 J Group local chaotic sequence->
β′ i ＝0.0078i (25)
Step 8: the baseband signals R (n) and 2 after the primary despreading J Of individual channelsPerforming parallel correlation operation to obtain 2 J Personal correlation results->
Step 9: for correlation resultsPerforming peak processing, firstly, calculating the maximum peak-to-average ratio, and further selecting 2 J Personal->The index of the maximum channel in (I) i.e. I equals +.>Beta 'of maximum value' i The method comprises the steps of carrying out a first treatment on the surface of the Then, calculate +.>Peak position H';
step 10: the data analysis processing is carried out by utilizing I, H and H', so as to obtain second-dimensional data and third-dimensional data after analysis;
step 11: carry-over with I into beta' i I.e. i=β' i Selecting a local chaotic sequence C I (n) performing cyclic right shift of H 'bit, and performing sequential multiplication operation with R (n) to obtain second-level despread first-dimension data D' 1 (n); completing data communication;
D′ 1 (n)＝R(n)shift[C I (n)] H' (34)。
6. the method of high-dimensional index modulation spread spectrum communication according to claim 5, wherein step 10 specifically comprises:
step 10.1: converting the data of the index I of the maximum value channel to obtain third dimensional data D 'after analysis' 3 (n) wherein dec2bin [. Cndot.]Converting a binary function for decimal;
D' 3 (n)＝dec2bin[I] (32)
step 10.2: the peak positions H and H ' are utilized to conduct data analysis to obtain second dimension data D ' after analysis ' 2 (n) wherein round [. Cndot []Is a rounding function;
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310557829.0A CN116566427A (en) | 2023-05-17 | 2023-05-17 | High-dimensional index modulation spread spectrum communication method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310557829.0A CN116566427A (en) | 2023-05-17 | 2023-05-17 | High-dimensional index modulation spread spectrum communication method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN116566427A true CN116566427A (en) | 2023-08-08 |
Family
ID=87501583
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310557829.0A Pending CN116566427A (en) | 2023-05-17 | 2023-05-17 | High-dimensional index modulation spread spectrum communication method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116566427A (en) |
-
2023
- 2023-05-17 CN CN202310557829.0A patent/CN116566427A/en active Pending
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11075669B2 (en) | M-ary differential chaos shift keying method based on chaotic shape-forming filter | |
| CN1211366A (en) | Method and apparatus for symbol decoding using a variable number of survivor paths | |
| CN104468451B (en) | A kind of multiple stage circulation shift keying modulation demodulation method based on transform-domain communication | |
| CN103997395B (en) | Change system decoding method based on MIMO radar communicating integral signal | |
| CN104980389A (en) | Differential new user selection access method applicable to non-orthogonal multi-access system | |
| CN1219058A (en) | Strong anti-jamming digit modulating and demodulating plan for radio communication with fade | |
| CN112003805A (en) | Joint time-frequency index modulation multimode differential chaos shift keying modulation and demodulation method | |
| CN101621348B (en) | OC-CDMA spread spectrum system and OC-CDMA spread spectrum method based on oblique projection | |
| CN109067678B (en) | WFRFT signal cascade modulation identification method based on high-order cumulant and wireless communication system | |
| CN101383794B (en) | Method and apparatus lowering peak average ratio | |
| CN116566427A (en) | High-dimensional index modulation spread spectrum communication method | |
| CN1252959C (en) | Method for testing DS. CDMA system multi-user developed based on weighting | |
| US20070153939A1 (en) | Method of differential-phase/absolute-amplitude qam | |
| CN116545471A (en) | Demodulation method of UWB communication system | |
| Chandra et al. | Optimizing information efficiency in a direct-sequence mobile packet radio network | |
| CN101662304B (en) | Method for designing zero correlation zone sequence on quadrature amplitude modulation constellation | |
| CN114006630B (en) | Spread spectrum code capture method and system for mixed carrier direct sequence spread spectrum signal | |
| US20070183536A1 (en) | Method of differential-phase/absolute-amplitude polar qam | |
| CN108737305B (en) | Frequency difference UNB communication transmission method with overlapped secondary phase coupling | |
| Jitsumatsu et al. | Prolate spheroidal wave functions induce Gaussian chip waveforms | |
| US7440527B2 (en) | Method of differential-phase/absolute-amplitude QAM | |
| CN113794492A (en) | Space-time shift keying method based on code index modulation | |
| CN102811189A (en) | Probability control-based anti-interference method for cognitive code division multiple access (CDMA) communication system | |
| CN113067671A (en) | Transmitting system and receiving system based on pseudorandom phase sequence spread spectrum | |
| CN1260652A (en) | Method for limiting dynamic range of CDMA signals |
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 |