CN111756404B - Low-complexity ultrahigh-order code index modulation method - Google Patents

Low-complexity ultrahigh-order code index modulation method Download PDF

Info

Publication number
CN111756404B
CN111756404B CN202010433594.0A CN202010433594A CN111756404B CN 111756404 B CN111756404 B CN 111756404B CN 202010433594 A CN202010433594 A CN 202010433594A CN 111756404 B CN111756404 B CN 111756404B
Authority
CN
China
Prior art keywords
dimensional information
pseudo
information
code
pseudo code
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.)
Active
Application number
CN202010433594.0A
Other languages
Chinese (zh)
Other versions
CN111756404A (en
Inventor
刘芳
程莫文
冯永新
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Shenyang Ligong University
Original Assignee
Shenyang Ligong University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Shenyang Ligong University filed Critical Shenyang Ligong University
Priority to CN202010433594.0A priority Critical patent/CN111756404B/en
Publication of CN111756404A publication Critical patent/CN111756404A/en
Application granted granted Critical
Publication of CN111756404B publication Critical patent/CN111756404B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

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

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Dc Digital Transmission (AREA)

Abstract

A low-complexity ultra-high-order code index modulation method belongs to the novel modulation technical field of spread spectrum communication systems. The method aims to solve the problem that the transmission rate of high-order information is limited, multi-code set indexing is carried out through grouping of two-dimensional information, so that the number of channels is reduced, cyclic shift indexing is carried out through grouping of three-dimensional information, so that the transmission rate is greatly improved under the condition that the channels are not increased, and environmental influences are removed by utilizing the relationship between shift channels and non-shift channels. The method not only can effectively transmit multidimensional information, but also has greatly reduced complexity and obvious advantages in comprehensive performance compared with the existing method, can realize high-order and ultrahigh-order information transmission, has modulation order far exceeding 5 orders, and is suitable for an efficient spread spectrum communication system.

Description

Low-complexity ultrahigh-order code index modulation method
Technical Field
The invention belongs to the technical field of novel modulation of a spread spectrum communication system, in particular to a low-complexity ultrahigh-order code index modulation method, which is a novel index modulation method.
Background
The advantages of multipath resistance, interference resistance, multiple access multiplexing and the like of direct sequence spread spectrum are considered to be at the cost of widening the signal spectrum, so that the problems of low bandwidth utilization rate, limited information transmission rate and the like are caused. Therefore, in response to the increase of the application demand of high information transmission, a code index modulation technology is appeared, which can improve the information transmission rate, but because the code index modulation maps more information by the transformation of pseudo codes, the larger the modulation order is, the larger the pseudo code resource is, the more the related channels are, and the greater the system complexity is. When the complexity of the system is limited, the modulation order cannot be increased (the modulation order usually does not exceed 5), and therefore, the current code index modulation technique faces the problem that the increase of the high-order information transmission rate cannot be broken through. Therefore, the research on the high-order index modulation method with low complexity is particularly critical, and becomes a future development trend of the spread spectrum communication with high transmission rate.
Disclosure of Invention
The invention provides a low-complexity ultrahigh-order code index modulation method, which is characterized in that two-dimensional and three-dimensional information is added on the basis of the traditional direct-expansion one-dimensional information, and multi-code set indexing is carried out by grouping the two-dimensional information, so that the two-dimensional information is transmitted by a small number of channel indexes. And then carry on the index of cyclic shift through the grouping of the three-dimensional information, thus under not increasing the channel, the index transmits the three-dimensional information of the high order, further, utilize and shift the channel and not shifting the channel relation, remove the environmental impact. The invention can achieve information transmission of ultra-high order modulation orders (modulation orders far exceed 5 orders, such as 20 orders, 25 orders and even higher) with relatively low complexity.
The technical scheme is as follows:
in a low complexity ultra-high code index modulation method, the method comprising: the system comprises a signal sending end and a signal receiving end.
The signal sending end firstly calculates a two-dimensional modulation order by utilizing the relation between the two-dimensional information transmission rate and the one-dimensional information transmission rate, and calculates a three-dimensional modulation order by utilizing the relation between the three-dimensional information transmission rate and the one-dimensional information transmission rate. Then, 3 pseudo codes are selected by utilizing a two-dimensional information index, 2 pseudo code offsets are indexed by utilizing three-dimensional information, 2 pseudo codes in the 3 pseudo codes are circularly shifted to the right, then the 2 shifted pseudo codes and 1 un-shifted pseudo code are superposed to obtain a final spread spectrum pseudo code, and finally, the final spread spectrum pseudo code and one-dimensional information are spread to obtain a transmitting signal.
The signal receiving end firstly carries out front-end processing on a received signal, further carries out multichannel correlation operation and peak-to-average ratio calculation, then obtains 3 successful channels through the maximum channel calculation of the peak-to-average ratio, and further carries out conversion and splicing on the three successful channels to obtain analyzed two-dimensional information. Further, an offset difference value is calculated by using the 3 maximum peak positions, and the offset difference value is converted and spliced to obtain analyzed three-dimensional information. And finally, obtaining a pseudo code to be despread by utilizing the successful channel and the peak position, and obtaining final one-dimensional information through despreading processing and correction.
The advantages are that:
the modulation method aims to solve the problem that the information transmission rate is limited in a spread spectrum communication system, and particularly solves the problems that the improvement of the high-order information transmission rate of a code index modulation technology cannot break through and the complexity is huge. The invention not only can effectively transmit multidimensional information, but also has the following advantages compared with the prior method: the complexity is greatly reduced, the comprehensive performance has obvious advantages, the multi-code set index is carried out through grouping of two-dimensional information, the number of channels is reduced, the cyclic shift index is carried out through grouping of three-dimensional information, the transmission rate is greatly improved under the condition that the channels are not increased, the environmental influence is removed by utilizing the relationship between the shift channels and the non-shift channels, the high-order and ultra-high-order information transmission rate breakthrough can be realized, and the method is suitable for a high-efficiency spread spectrum communication system.
Drawings
Fig. 1 is a technical principle of a signal transmitting end of the present invention.
Fig. 2 is a partially enlarged left side view of fig. 1.
Fig. 3 is a partially enlarged right side view of fig. 1.
Fig. 4 is a technical principle of a signal receiving end of the present invention.
Fig. 5 is a partially enlarged left side view of fig. 3.
Fig. 6 is a partially enlarged right side view of fig. 3.
Detailed Description
The technical principle of the signal transmitting end is as follows:
step 1: information D with traditional direct sequence expansion1(n) is one-dimensional information with a rate R1Adding two-dimensional information D on the basis of the one-dimensional information2(n) and three-dimensional information D3(n) with transmission rates R2And R3. By means of R2And R1Calculating two-dimensional order k, using R3And R1Calculating the three-dimensional order mu:
Figure GDA0003258321080000021
Figure GDA0003258321080000022
step 2: k-bit two-dimensional information D can be indexed per slot2(n), in order to reduce the pseudo code resource, the k bit two-dimensional information of each time slot is divided into 3 groups, the bit number of the information of each group is kiE.g., formulas (3) and (4), wherein i is a variable, and i ∈ [13 ]]. Further, in each slot, k bits of information D2(n) sequentially grouping, the first group being the top k1Bit information. The second group being successive k2Bit information. The third group is the last k3Bit information, e.g. formula(5)。
Figure GDA0003258321080000023
Figure GDA0003258321080000024
Figure GDA0003258321080000025
Step 3: due to k bits of information D2(n) is divided into 3 groups, so 3 pseudo code sets C1, C2 and C3 are needed to be constructed, each code set is composed of a plurality of mutually orthogonal pseudo codes, and the number M of the pseudo codes in the ith pseudo code setiAs shown in equation (6), where i ∈ [13 ]]. Thus there is M in the set C11Pseudo code of a strip
Figure GDA0003258321080000026
j1∈[1M1]. In set C2, there is M2Pseudo code of a strip
Figure GDA0003258321080000027
j2∈[1 M2]. In set C3, there is M3Pseudo code of a strip
Figure GDA0003258321080000031
j3∈[1 M3]。
Figure GDA0003258321080000032
Step 4: k for each group in each time slotiBit information
Figure GDA0003258321080000033
A carry-over process is performed as shown in equation (7), thereby calculating the spread pseudo code channel J for each set of indicesiWherein bin2dec [ ·]The decimal processing function is converted to binary. By usingJiPseudo-code may be selected from the corresponding set
Figure GDA0003258321080000034
M in the set C1, for example when i ═ 11Bar-code pseudo code
Figure GDA0003258321080000035
Selected J1 ═ J1Pseudo code for a channel
Figure GDA0003258321080000036
Therefore, each time slot will index 3 pseudo codes from 3 sets, and then 3 spreading pseudo codes will be obtained
Figure GDA0003258321080000037
i∈[1 3]。
Figure GDA0003258321080000038
Step 5: three-dimensional information indexing is carried out on the basis that the two-dimensional information index is a pseudo code channel, and the three-dimensional information D with the indexable mu bit of each time slot can be obtained by combining the formula (2)3(n) of (a). And then mu bit D3(n) is divided into 2 groups, the number of information bits mu of each grouplIs equation (8). Three-dimensional information per time slot D3Information of the l-th group in (n)
Figure GDA0003258321080000039
Is formula (9) where l is a variable and l ∈ [12 ]]。
Figure GDA00032583210800000310
Figure GDA00032583210800000311
Figure GDA00032583210800000312
Step 6: μ l bit information per group in each time slot
Figure GDA00032583210800000313
Performing a binary conversion process to calculate an index value f of the l-th groupl：
Figure GDA00032583210800000314
Step 7: 3 pseudo codes based on two-dimensional information indexing
Figure GDA00032583210800000315
By substituting
Figure GDA00032583210800000316
And to the pseudo code corresponding to the l-th group
Figure GDA00032583210800000317
Perform cyclic right shift flBit obtaining
Figure GDA00032583210800000318
As shown in formula (11). Since l is ∈ [12 ]]And i ∈ [13 ]]Thus, 3 spreading pseudo codes
Figure GDA00032583210800000319
Item 3 pseudo code of
Figure GDA00032583210800000320
The cyclic shift process is not performed. Wherein the content of the first and second substances,
Figure GDA00032583210800000321
a processing function that shifts the fl bit to the right for the loop.
Figure GDA00032583210800000322
Step 8: superposing the 3 pseudo codes to obtain the final spread spectrum pseudo code C (n) of the current time slot:
Figure GDA00032583210800000323
step 9: the transmitting end utilizes C (n) to one-dimensional information D of the current time slot1(n) the spread spectrum processing is performed as in equation (13). And then modulated to obtain a transmission signal S' (n), as shown in equation (14).
Figure GDA00032583210800000324
S'(n)＝D1(n)C(n)cos(2πωn+θ) (14)。
The technical principle of the signal receiving end is as follows:
step 1: the received signal S' (n) is subjected to front-end processing such as frequency reduction and filtering, and the processed signal is denoted as S (n), as in equation (15). Because part of the parameters are known to the receiving end of the authorized user, the receiving end can calculate the two-dimensional order k and the three-dimensional order mu according to the rate of the information to be transmitted, and further can calculate the parameters ki and mul. Using the parameter kiPseudo-code sets C1, C2, and C3 may be selected, with M in the set C11Pseudo code of a strip
Figure GDA0003258321080000041
j1∈[1 M1]. In set C2, there is M2Pseudo code of a strip
Figure GDA0003258321080000042
j2∈[1 M2]. In set C3, there is M3Pseudo code of a strip
Figure GDA0003258321080000043
j3∈[1M3]。
S(n)≈D1(n)C(n) (15)。
Step 2: processed received signals S (n) and M1Bar-code pseudo code
Figure GDA0003258321080000044
M2Pseudo code of a strip
Figure GDA0003258321080000045
And M3Pseudo code of a strip
Figure GDA0003258321080000046
Performing parallel correlation operation to obtain M1Group correlation results
Figure GDA0003258321080000047
M2Group correlation results
Figure GDA0003258321080000048
And M3Group correlation results
Figure GDA0003258321080000049
Figure GDA00032583210800000410
Step 3: at the correlation result
Figure GDA00032583210800000411
In the calculation of the maximum peak-to-average ratio, i.e. M1Group of
Figure GDA00032583210800000412
The ratio of the maximum peak value to the average peak value of each group is calculated to obtain M in the same way2Group correlation results
Figure GDA00032583210800000413
Middle M2Peak to average ratio
Figure GDA00032583210800000414
And M3Group correlation results
Figure GDA00032583210800000415
Middle M3Peak to average ratio
Figure GDA00032583210800000416
Wherein PRA [ ·]A function is calculated for the maximum peak-to-average ratio.
Figure GDA00032583210800000417
Step 4: using M1Peak to average ratio
Figure GDA00032583210800000418
Calculating the maximum value channel H1In the same way, for M2An
Figure GDA00032583210800000419
And M3An
Figure GDA00032583210800000420
Maximum channel operation is also performed to obtain H2And H3Wherein, channel [ ·]A function is calculated for the maximum corresponding position.
Figure GDA00032583210800000421
Step 5: by means of H1、H2And H3Are converted to respectively obtain kiBinary information of bits
Figure GDA0003258321080000051
As in equation (19), where dec2bin [ ·]Binary functions are converted for decimal. And i sequentially from 1 to 3
Figure GDA0003258321080000052
Splicing to obtain analyzed final two-dimensional information E2(n) is as in equation (20).
Figure GDA0003258321080000053
Figure GDA0003258321080000054
Step 6: by means of H1、H2And H3Selecting from the correlation results
Figure GDA0003258321080000055
And
Figure GDA0003258321080000056
and separately calculate
Figure GDA0003258321080000057
And
Figure GDA0003258321080000058
position of medium maximum peak pi：
Figure GDA0003258321080000059
Step 7: considering that the peak value shift may be caused by environmental factors during signal transmission, the shift effects for all channels should be similar, and in combination with the third set of pseudo codes in equation (12), there is no index shift of three-dimensional information, so that, using ρiAnd performing offset difference calculation so as to eliminate the influence of environmental factors on peak offset.
Figure GDA00032583210800000510
Step 8: using Δ ρ1And Δ ρ2Carry out scale conversion to obtain analyzed three-dimensional information
Figure GDA00032583210800000511
And
Figure GDA00032583210800000512
as in equation (23), and further, l sequentially puts μ from 1 to 2lOf bits
Figure GDA00032583210800000513
Splicing is carried out to obtain analyzed final three-dimensional information E3(n) is as in equation (24).
Figure GDA00032583210800000514
Figure GDA00032583210800000515
Step 9: and despreading the one-dimensional information on the basis of analyzing the two-dimensional information and the three-dimensional information. By means of H1、H2And H3Pseudo code corresponding to 3 peak channels
Figure GDA00032583210800000516
And
Figure GDA00032583210800000517
are matched out and are paired
Figure GDA00032583210800000518
Make a cyclic left shift by Δ ρ1Bit processing, pair
Figure GDA00032583210800000519
Make a cyclic left shift by Δ ρ2And (6) processing bits.
Figure GDA00032583210800000520
Step 10: further, utilize
Figure GDA00032583210800000521
And
Figure GDA00032583210800000522
performs despreading processing with the processed received signal S (n) because of H1＝J1Thus, therefore, it is
Figure GDA00032583210800000523
And
Figure GDA00032583210800000524
there is a correlation for which D can be despread1(n) As in equation (26), the other channels can despread the corresponding D1(n) as in formulas (27) and (28).
Figure GDA0003258321080000061
Figure GDA0003258321080000062
Figure GDA0003258321080000063
Step 11: finally, one-dimensional information D for despreading three successful channels1(n) averaging and binarizing to obtain corrected one-dimensional information E1(n) is as in formula (29), wherein [. ]]binIs a binarization processing function.
Figure GDA0003258321080000064

Claims (3)

1. A low complexity modulation method for super high level code index, comprising the steps of:
the signal sending terminal firstly calculates a two-dimensional modulation order by utilizing the relation between the two-dimensional information transmission rate and the one-dimensional information transmission rate, and calculates a three-dimensional modulation order by utilizing the relation between the three-dimensional information transmission rate and the one-dimensional information transmission rate; then, selecting 3 pseudo codes by using a two-dimensional information index, indexing 2 pseudo code offsets by using three-dimensional information, circularly right-shifting 2 pseudo codes in the 3 pseudo codes, further performing superposition processing on the 2 shifted pseudo codes and 1 unshifted pseudo code to obtain a final spread spectrum pseudo code, and finally performing spread spectrum processing with one-dimensional information to obtain a transmitting signal;
the signal receiving end firstly carries out front-end processing on a received signal, further carries out multichannel correlation operation and peak-to-average ratio calculation, then obtains 3 successful channels through the maximum channel calculation of the peak-to-average ratio, and further carries out conversion and splicing on the three successful channels to obtain analyzed two-dimensional information; further, calculating an offset difference value by using the 3 maximum peak positions, and converting and splicing the offset difference value to obtain analyzed three-dimensional information; and finally, obtaining a pseudo code to be despread by utilizing the successful channel and the peak position, and obtaining final one-dimensional information through despreading processing and correction.
2. A low complexity ultra-high code index modulation method according to claim 1, comprising the steps of: the working principle of the signal transmitting end comprises the following steps:
step1.1: information D with traditional direct sequence expansion1(n) is one-dimensional information with a rate R1Adding two-dimensional information D on the basis of the one-dimensional information2(n) and three-dimensional information D3(n) with transmission rates R2And R3(ii) a By means of R2And R1Calculating two-dimensional order k, using R3And R1Calculating the three-dimensional order mu:
Figure FDA0003258321070000011
Figure FDA0003258321070000012
step2.1: k-bit two-dimensional information D can be indexed per slot2(n) in order to reduce the pseudo code resource, the k bits of two-dimensional information of each time slot are divided into 3 groups again, and each group hasNumber of information bits kiEquation [3 ]]And [4 ]]Wherein i is a variable and i ∈ [13 ]](ii) a Further, in each slot, k bits of information D2(n) sequentially grouping, the first group being the top k1Bit information; the second group being successive k2Bit information; the third group is the last k3Bit information, formula [5 ]]；
Figure FDA0003258321070000013
Figure FDA0003258321070000014
Figure FDA0003258321070000015
Step3.1: 3 pseudo code sets C1, C2 and C3 are constructed, each code set is composed of a plurality of mutually orthogonal pseudo codes, and the number M of the pseudo codes in the ith pseudo code setiFormula [6]Shown, where i ∈ [13 ]](ii) a Thus there is M in the set C11Pseudo code of a strip
Figure FDA0003258321070000016
j1∈[1 M1](ii) a In set C2, there is M2Pseudo code of a strip
Figure FDA0003258321070000017
j2∈[1 M2](ii) a In set C3, there is M3Pseudo code of a strip
Figure FDA0003258321070000021
j3∈[1 M3]；
Figure FDA0003258321070000022
Step4.1: each time slotK in each groupiBit information
Figure FDA0003258321070000023
Carry out the system conversion process, formula [7]Shown, to calculate the spread-spectrum pseudo-code channel J for each set of indicesiWherein bin2dec [ ·]Converting the decimal processing function for binary; using JiSelecting pseudo-code from corresponding set
Figure FDA0003258321070000024
M in the set C1 when i is 11Bar-code pseudo code
Figure FDA0003258321070000025
Selected J1 ═ J1Pseudo code for a channel
Figure FDA0003258321070000026
Therefore, each time slot will index 3 pseudo codes from 3 sets, and then 3 spreading pseudo codes will be obtained
Figure FDA0003258321070000027
i∈[1 3]；
Figure FDA0003258321070000028
Step5.1: on the basis that the two-dimensional information index is a pseudo code channel, carrying out three-dimensional information index and combining a formula [2 ]]To obtain three-dimensional information D with each time slot capable of indexing mu bits3(n); and then mu bit D3(n) is divided into 2 groups, the number of information bits mu of each grouplIs a formula [8](ii) a Three-dimensional information per time slot D3Information of the l-th group in (n)
Figure FDA0003258321070000029
Is a formula [9]Where l is a variable and l ∈ [12 ]]；
Figure FDA00032583210700000210
Figure FDA00032583210700000211
Figure FDA00032583210700000212
Step6.1: mu of each group in each time slotlBit information
Figure FDA00032583210700000213
Performing a binary conversion process to calculate an index value f of the l-th groupl：
Figure FDA00032583210700000214
Step7.1: 3 pseudo codes based on two-dimensional information indexing
Figure FDA00032583210700000215
By substituting
Figure FDA00032583210700000216
And to the pseudo code corresponding to the l-th group
Figure FDA00032583210700000217
Perform cyclic right shift flBit obtaining
Figure FDA00032583210700000218
Formula [11](ii) a Since l is ∈ [12 ]]And i ∈ [13 ]]Thus, 3 spreading pseudo codes
Figure FDA00032583210700000219
Item 3 pseudo code of
Figure FDA00032583210700000220
The cyclic shift processing is not carried out; wherein the content of the first and second substances,
Figure FDA00032583210700000223
to move f to the right in a cyclelA processing function of the bits;
Figure FDA00032583210700000221
step8.1: superposing the 3 pseudo codes to obtain the final spread spectrum pseudo code C (n) of the current time slot:
Figure FDA00032583210700000222
step9.1: the transmitting end utilizes C (n) to one-dimensional information D of the current time slot1(n) performing a spreading process, formula [13 ]](ii) a Further modulating to obtain the transmitting signal S' (n), formula [14]；
Figure FDA0003258321070000031
S'(n)＝D1(n)C(n)cos(2πωn+θ) [14]。
3. A low complexity ultra-high code index modulation method according to claim 2, characterized by the steps of: the technical principle of the signal receiving end comprises the following steps: :
step1.2: the received signal S' (n) is processed by frequency reduction and filtering front end, and the processed signal is marked as S (n) and formula [15 ]](ii) a The receiving end calculates to obtain a two-dimensional order k and a three-dimensional order mu according to the rate of the information to be transmitted, and further calculates to obtain a parameter kiAnd mul(ii) a Using the parameter kiPseudo-code sets C1, C2 and C3 are selected, with M in the set C11Pseudo code of a strip
Figure FDA0003258321070000032
j1∈[1 M1](ii) a In set C2, there is M2Pseudo code of a strip
Figure FDA0003258321070000033
j2∈[1 M2](ii) a In set C3, there is M3Pseudo code of a strip
Figure FDA0003258321070000034
j3∈[1 M3]；
S(n)≈D1(n)C(n) [15]；
Step2.2: processed received signals S (n) and M1Bar-code pseudo code
Figure FDA0003258321070000035
M2Pseudo code of a strip
Figure FDA0003258321070000036
And M3Pseudo code of a strip
Figure FDA0003258321070000037
Performing parallel correlation operation to obtain M1Group correlation results
Figure FDA0003258321070000038
M2Group correlation results
Figure FDA0003258321070000039
And M3Group correlation results
Figure FDA00032583210700000310
Figure FDA00032583210700000311
Step3.2: at the correlation result
Figure FDA00032583210700000312
In the calculation of the maximum peak-to-average ratio, i.e. M1Group of
Figure FDA00032583210700000313
The ratio of the maximum peak value to the average peak value of each group is calculated to obtain M in the same way2Group correlation results
Figure FDA00032583210700000314
Middle M2Peak to average ratio
Figure FDA00032583210700000315
And M3Group correlation results
Figure FDA00032583210700000316
Middle M3Peak to average ratio
Figure FDA00032583210700000317
Wherein PRA [ ·]Calculating a function for the maximum peak-to-average ratio;
Figure FDA00032583210700000318
step4.2: using M1Peak to average ratio
Figure FDA00032583210700000319
Calculating the maximum value channel H1In the same way, for M2An
Figure FDA00032583210700000320
And M3An
Figure FDA00032583210700000321
Maximum channel operation is also performed to obtain H2And H3Wherein, channel [ ·]Calculating a function for the maximum corresponding position;
Figure FDA00032583210700000322
step5.2: by means of H1、H2And H3Are converted to respectively obtain kiBinary information of bits
Figure FDA00032583210700000323
Formula [19]Wherein dec2bin [ ·]Converting a binary function for the decimal; and i sequentially from 1 to 3
Figure FDA00032583210700000324
Splicing to obtain analyzed final two-dimensional information E2(n) formula [20]；
Figure FDA0003258321070000041
Figure FDA0003258321070000042
Step6.2: by means of H1、H2And H3Selecting from the correlation results
Figure FDA0003258321070000043
And
Figure FDA0003258321070000044
and separately calculate
Figure FDA0003258321070000045
And
Figure FDA0003258321070000046
medium maximum peak valuePosition rhoi：
Figure FDA0003258321070000047
Step7.2: considering the peak shift caused by environmental factors in signal transmission, the shift effects for all channels should be similar, and combine the formula [12 ]]The third pseudo code group has no index offset of three-dimensional information, so that rho is utilizediOffset difference calculation is carried out, so that the influence of environmental factors on peak offset is eliminated;
Figure FDA0003258321070000048
step8.2: using Δ ρ1And Δ ρ2Carry out scale conversion to obtain analyzed three-dimensional information
Figure FDA0003258321070000049
And
Figure FDA00032583210700000410
formula [23 ]]And further, l sequentially transfers μ from 1 to 2lOf bits
Figure FDA00032583210700000411
Splicing is carried out to obtain analyzed final three-dimensional information E3(n) formula [24]；
Figure FDA00032583210700000412
Figure FDA00032583210700000413
Step9.2: despreading the one-dimensional information on the basis of analyzing the two-dimensional information and the three-dimensional information; by means of H1、H2And H3Pseudo code corresponding to 3 peak channels
Figure FDA00032583210700000414
And
Figure FDA00032583210700000415
are matched out and are paired
Figure FDA00032583210700000416
Make a cyclic left shift by Δ ρ1Bit processing, pair
Figure FDA00032583210700000417
Make a cyclic left shift by Δ ρ2Processing bits;
Figure FDA00032583210700000418
step10.2: further, utilize
Figure FDA00032583210700000419
And
Figure FDA00032583210700000420
performs despreading processing with the processed received signal S (n) because of H1＝J1Thus, therefore, it is
Figure FDA00032583210700000421
And
Figure FDA00032583210700000422
there is a correlation for which despreading D1(n) formula [26]Other channels despread the corresponding D1(n) formula [27]And [28]；
Figure FDA0003258321070000051
Figure FDA0003258321070000052
Figure FDA0003258321070000053
Step11.2: finally, one-dimensional information D for despreading three successful channels1(n) averaging and binarizing to obtain corrected one-dimensional information E1(n) formula [29]Therein, []binIs a binarization processing function;
Figure FDA0003258321070000054
CN202010433594.0A 2020-05-21 2020-05-21 Low-complexity ultrahigh-order code index modulation method Active CN111756404B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010433594.0A CN111756404B (en) 2020-05-21 2020-05-21 Low-complexity ultrahigh-order code index modulation method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010433594.0A CN111756404B (en) 2020-05-21 2020-05-21 Low-complexity ultrahigh-order code index modulation method

Publications (2)

Publication Number Publication Date
CN111756404A CN111756404A (en) 2020-10-09
CN111756404B true CN111756404B (en) 2021-11-09

Family

ID=72674053

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010433594.0A Active CN111756404B (en) 2020-05-21 2020-05-21 Low-complexity ultrahigh-order code index modulation method

Country Status (1)

Country Link
CN (1) CN111756404B (en)

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103580788A (en) * 2012-07-27 2014-02-12 电信科学技术研究院 Method and device for transmitting MCS instructing information
CN108347258B (en) * 2018-02-02 2020-02-07 沈阳理工大学 KS-CSS modulation method
CN108736948B (en) * 2018-04-03 2021-05-28 重庆临菲电子科技有限公司 Space-frequency-code three-dimensional index modulation wireless communication method

Also Published As

Publication number Publication date
CN111756404A (en) 2020-10-09

Similar Documents

Publication Publication Date Title
CN101958764B (en) Transmitting device, signal generating apparatus and transmitting method
KR100488431B1 (en) Constant amplitude coded bi-orthogonal coding and decoding apparatus
CN1064494C (en) Rake receiver combining all the useful multipath components of a spread spectrum signal
CN103812816A (en) Efficient physical layer preamble format
US20130100965A1 (en) System and method for spread spectrum communication
CN102217215A (en) Optical electric field transmitter and optical transmission system
IL151895A (en) Efficient spreader for spread spectrum communication systems
CN112003805B (en) Joint time-frequency index modulation multimode differential chaos shift keying modulation and demodulation method
CN111756404B (en) Low-complexity ultrahigh-order code index modulation method
CN103312405A (en) Time-frequency coding diversity MT-CDMA (multiple tone-code division multiple access) system transmitting and receiving method
CN101534276B (en) Enhanced method for demodulating constant-amplitude multi-code biorthogonal modulation signals
KR101219663B1 (en) System for visible light communications with multi-carrier modulation and method thereof
CN1487688A (en) Apparatus and method for increasing channel capacity of mobile communication system
CN114884785B (en) Differential chaotic phase shift keying communication method and system
CN115001929B (en) Low-complexity SCMA codebook design method for fiber channel
CN101827050B (en) Novel CDMA downlink communication method and system
CN108900458B (en) The compound qpsk modulation signal optimization method of ranging/communication under non-ideal quadrature carrier
CN113574814A (en) Spectrum-efficient orthogonal code generation and implementation method and device for wireless communication
CN1886958B (en) Reception device and transmission device
CN113904907B (en) Orthogonal multi-subset spread spectrum OFDM modulation demodulation method based on phase discrimination phase contrast
CN100359896C (en) Transmission apparatus and transmission method
Kumar et al. CTH01-5: A novel optical CDMA modulation scheme: Code cycle modulation
Matsumoto et al. Theoretical analysis of BER performance in ASK-SS and M-ary/ASK-SS systems using compact matched filter bank for an optical ZCZ code over AWGN channels
CN116938339A (en) Detection method and system for efficiently realizing polarization recovery
CN105264794A (en) Information processing method and device

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