CN117560041A - Two mapping algorithm designs in differential spatial modulation system - Google Patents
Two mapping algorithm designs in differential spatial modulation system Download PDFInfo
- Publication number
- CN117560041A CN117560041A CN202311511039.5A CN202311511039A CN117560041A CN 117560041 A CN117560041 A CN 117560041A CN 202311511039 A CN202311511039 A CN 202311511039A CN 117560041 A CN117560041 A CN 117560041A
- Authority
- CN
- China
- Prior art keywords
- mapping
- mapping algorithm
- algorithm
- transmitting
- sequence
- 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
- 238000013507 mapping Methods 0.000 title claims abstract description 114
- 238000013461 design Methods 0.000 title claims abstract description 16
- 208000019244 fetal lower urinary tract obstruction Diseases 0.000 claims abstract description 29
- 239000011159 matrix material Substances 0.000 claims abstract description 20
- 238000000034 method Methods 0.000 claims description 36
- 230000005540 biological transmission Effects 0.000 claims description 18
- 230000004913 activation Effects 0.000 claims description 10
- 238000006243 chemical reaction Methods 0.000 claims description 9
- 238000001514 detection method Methods 0.000 claims description 7
- 238000006467 substitution reaction Methods 0.000 claims description 7
- 238000012545 processing Methods 0.000 claims description 6
- 238000005562 fading Methods 0.000 claims description 5
- 238000010276 construction Methods 0.000 claims description 4
- 238000005516 engineering process Methods 0.000 description 3
- 238000004088 simulation Methods 0.000 description 3
- 238000004891 communication Methods 0.000 description 2
- 235000003801 Castanea crenata Nutrition 0.000 description 1
- 244000209117 Castanea crenata Species 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 229910002056 binary alloy Inorganic materials 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000002474 experimental method Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000011056 performance test Methods 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 238000012360 testing method Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B7/00—Radio transmission systems, i.e. using radiation field
- H04B7/02—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
- H04B7/04—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
- H04B7/0404—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas the mobile station comprising multiple antennas, e.g. to provide uplink diversity
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B7/00—Radio transmission systems, i.e. using radiation field
- H04B7/02—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
- H04B7/04—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
- H04B7/06—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the transmitting station
- H04B7/0602—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the transmitting station using antenna switching
- H04B7/0608—Antenna selection according to transmission parameters
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B7/00—Radio transmission systems, i.e. using radiation field
- H04B7/02—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
- H04B7/04—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
- H04B7/08—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the receiving station
- H04B7/0802—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the receiving station using antenna selection
- H04B7/0817—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the receiving station using antenna selection with multiple receivers and antenna path selection
-
- 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)
- Radio Transmission System (AREA)
Abstract
The invention discloses a differential space modulation system, which comprises two mapping schemes when the number of transmitting antennas is different: look-up table sequential mapping (LUTO) and Permutation Mapping (PM), for look-up table sequential mapping, the implementation steps are as follows: predefining an antenna combination mapping table; determining an antenna grouping mode; at the transmitting end, the corresponding group is selected according to the bit sequence, and the antenna combination is selected according to the sequence in the group. The invention determines the number of transmitting antennas and the modulation sequence according to the need, selects proper mapping algorithm in the mapping of the lookup table and the permutation and replacement mapping, designs the mapping table according to the number of transmitting antennas for the mapping algorithm of the lookup table, and directly maps the input bit stream into a signal matrix for the permutation and mapping algorithm, so that a user can select the most suitable mapping mode according to specific needs.
Description
Technical Field
The present invention relates to the field of wireless communications, and in particular, to two mapping algorithm designs in a differential spatial modulation system.
Background
In the current wireless communication system, a multi-antenna technology is widely used, mainly for improving a transmission rate and system performance, and a Spatial Modulation (SM) technology is one of the technologies having potential, which uses conventional amplitude and phase modulation and uses only one transmitting antenna per slot, and achieves a higher transmission rate by introducing an index of the transmitting antenna as additional transmission information.
However, conventional spatial modulation techniques face challenges in high-speed channel transmission, channel estimation becomes particularly complex due to fast fading of the channel, and the introduction of Differential Spatial Modulation (DSM) techniques can avoid the problem of channel estimation; however, it is not easy for the conventional spatial modulation technique to directly introduce differential modulation in the spatial domain, so that in order to overcome these problems, the DSM technique introduces differential modulation in the time domain, and activates one transmitting antenna in each time slot, so that channel estimation can be avoided, and the DSM system includes a differential mapping coding of a transmitting end and a demodulation process of a receiving end, so that in order to improve system performance, current research is mainly focused on a mapping algorithm of an activation sequence of the transmitting antenna and an efficient detection algorithm of the receiving end;
the present document proposes a differential spatial modulation detector with low complexity and suitable for a small number of transmitting antennas, however, in case of a large number of transmitting antennas, the difficulty of designing a mapping table increases, so that the existing differential spatial modulation detector is inconvenient to meet the application requirement when the number of transmitting antennas is large, and aiming at the problem, the present invention focuses on a mapping algorithm of a DSM, and aims at a look-up table sequential mapping (LUTO) algorithm to design a mapping table according to the number of transmitting antennas; aiming at the permutation and Permutation (PM) method, the design thought of directly mapping the input bit stream into a signal matrix is adopted, and a searching process is not needed, so that lower complexity can be realized.
Disclosure of Invention
The invention aims to solve the defects in the prior art and provides two mapping algorithm designs in a differential spatial modulation system.
In order to achieve the above purpose, the invention adopts the following technical scheme: two mapping algorithm designs in a differential spatial modulation system, including: a lookup table mapping (LUTO) and an arrangement mapping method (PM), wherein the number of transmitting antennas and a modulation sequence can be determined according to the requirement, and then a proper mapping algorithm is selected;
the whole realization of the differential spatial modulation system and the mapping algorithm comprises the following steps:
step 1: constructing a differential spatial modulation system;
the concrete construction method comprises the following steps:
s1, configuring a plurality of transmitting antennas and receiving antennas, and connecting and setting according to system requirements;
s2, at a transmitting end, a mapping algorithm is selected, an activation sequence of a transmitting antenna is determined, and data symbols are mapped into antenna combinations;
s3, demodulating the received signal at the receiving end to recover the original data symbol;
step 2: realizing a mapping algorithm;
step 3: and processing a signal at a receiving end.
Preferably, the step 1 includes: n (N) T Root transmit antenna and N R A root receiving antenna, at the transmitting end, the information bits are divided into each of log 2 (N T ！)+N T log 2 (M) bits, where M represents a modulation factor, the transmission block will be at N T Transmitting on a time slot, the number of transmitting antennas and the length of the transmitting block being equal to N T ；
In the t-th transmission time, the transmission matrixIs S t ＝S t-1 X t Wherein->Is an information matrix, and is determined by information bits;
is provided withRepresents N R ×N T Is a channel matrix of the received signal matrix->Can be expressed as:
Y t ＝H t S t +N t ；
assuming that the channel is a flat rayleigh fading channel, the channel is unchanged over two time intervals, i.e., H t ＝H t-1 Then there is
Y t ＝Y t-1 X t -N t-1 X t +N t .；
According to ML rule detection, the estimation of the detection signal can be expressed as:
further deriving the best-available detector as
Wherein R is M Representing a set of all active information matrices by demapping the estimated antenna activation order and thenAnd demodulating the transmitted signal to recover the information bits.
Preferably, the implementation of the mapping algorithm in the step 2 comprises two choices of a LUTO mapping algorithm and a PM algorithm;
the LUTO mapping algorithm maps the input data symbols into antenna combinations according to the selected mapping table;
the PM algorithm maps the input bit stream to a corresponding signal matrix according to a predefined mapping rule.
Preferably, the LUTO mapping algorithm specifically includes the following steps:
a1: predefining an antenna combination mapping table corresponding to each data symbol;
a2: converting the input data symbols into the required antenna combinations;
a3: transmitting data symbols by mapping antenna combinations to respective antennas;
creating a table for the transmit antennas, the number of rows of the table created for any number of transmit antennas beingThe total number of generated mapping schemes is N T The following is carried out Rows, therefore, have some mapping schemes discarded, the number of discarded mapping schemes being
The columns of the creation table are related to the selected modulation factor M, which is determined as follows:
b1: generating a bit value to be input;
b2: based on the input bit values, deriving a maximum binary number for the bit sequence;
b3: converting the maximum binary number into a decimal number;
b4: the decimal number is incremented by one to obtain the size of the table column.
Preferably, the PM algorithm is implemented by combining N R The order of the digits is permuted to form a point-to-point mapping, mapping the integer m to a sequenceA set of permutations is formed 1, N R For a particular N } R Arbitrary m E [0, N R ！-1]Can be expressed as a length of N R Sequence a of (2) (m) The method comprises the following specific steps:
c1: obtaining an integer m from the input sequence;
c2: converting integer m into a sequenceThe conversion method is->
Maximum is takenSatisfy->Continue to take the maximum +.>Satisfy the following requirementsSequentially calculating all b m Elements of (a) and (b);
and C3: will factorize sequence b m Mapping to permutation a (m) Here, Θ= (1, 2, …, N) R ) Is an ordered list with the index of the first element being 0 and the leftmost element a (m) Is thatWill b m Conversion to a (m) The conversion process is as follows
Element(s)Will be removed from list 1, this new list will also start with a zero index, and so on, obtaining a (m) Is included in the set of elements.
Preferably, the specific processing steps of the step 3 are as follows: reverse process of transmitting end substitution method is used at receiving end, a is carried out (m) The mapping is used as an input sequence, and the process corresponds to the process of the transmitting end substitution method.
Compared with the prior art, the invention has the following beneficial effects:
(1) Two mapping algorithms (LUTO and PM) are provided, suitable for different numbers of transmit antennas and modulation methods.
(2) The invention determines the number of transmitting antennas and the modulation sequence according to the need, selects proper mapping algorithm in the lookup table mapping (LUTO) and the Permutation Mapping (PM), designs the mapping table according to the number of transmitting antennas for the lookup table mapping algorithm, directly maps the input bit stream into a signal matrix for the permutation mapping algorithm, and further, the user can select the most suitable mapping mode according to specific needs.
Drawings
Fig. 1 is a diagram of a differential spatial modulation system structure according to the present invention.
FIG. 2 shows the present invention when N T Mapping table of LUTO algorithm when=3.
FIG. 3 shows the present invention when N is under BPSK modulation T DSM differential transmission scheme=3, including the construction of transmission matrix and data transmission process.
FIG. 4 shows the case of the present invention when the input D is 00, the BPSK modulation scheme is adopted, N T Signal matrix transmitted when=3.
FIG. 5 shows N when LUTO algorithm is used in BPSK modulation according to the invention T Case=3.
FIG. 6 shows N when LUTO algorithm is used under BPSK modulation T Case=4.
FIG. 7 shows N when LUTO algorithm is used in BPSK modulation according to the invention T Case=5.
FIG. 8 is a graph comparing N according to the present invention T Simulation results and theoretical results of the LUTO algorithm at=4, and contains N R Case=4.
Fig. 9 shows the PM algorithm and the LUTO algorithm of the DSM system, and the bit error rate performance under BPSK modulation provides a reference for the performance comparison of different algorithms.
Fig. 10 presents simulation and theoretical results of the system under different modulation modes for different DSM transmit antennas and receive antennas, verifying the applicability and performance differences of the proposed scheme.
Detailed Description
The following description is presented to enable one of ordinary skill in the art to make and use the invention. The preferred embodiments in the following description are by way of example only and other obvious variations will occur to those skilled in the art.
Two mapping algorithm designs in the differential spatial modulation system as shown in fig. 1 to 10, including: a lookup table mapping (LUTO) and an arrangement mapping method (PM), wherein the number of transmitting antennas and a modulation sequence can be determined according to the requirement, and then a proper mapping algorithm is selected;
the whole realization of the differential spatial modulation system and the mapping algorithm comprises the following steps:
step 1: constructing a differential spatial modulation system;
the concrete construction method comprises the following steps:
s, 1, configuring a plurality of transmitting antennas and receiving antennas, and connecting and setting according to system requirements;
s2, at a transmitting end, a mapping algorithm is selected, an activation sequence of a transmitting antenna is determined, and data symbols are mapped into antenna combinations;
s3, demodulating the received signal at the receiving end to recover the original data symbol;
step 2: realizing a mapping algorithm;
step 3: and processing a signal at a receiving end.
As an embodiment of the present invention, step 1 further includes: n (N) T Root transmit antenna and N R A root receiving antenna, at the transmitter end, the information bits are divided into each of log 2 (N T ！)+N T log 2 (M) bits, where M represents a modulation factor, the transmission block will be at N T Transmitting on a time slot, the number of transmitting antennas and the length of the transmitting block being equal to N T ；
In the t-th transmission time, the transmission matrixIs S t ＝S t-1 X t Wherein->Is an information matrix, and is determined by information bits;
is provided withRepresents N R ×N T Is a channel matrix of the received signal matrix->Can be expressed as:
Y t ＝H t S t +N t ．；
assuming that the channel is a flat rayleigh fading channel, the channel is unchanged over two time intervals, i.e., H t ＝H t-1 Then there is
Y t ＝Y t-1 X t -N t-1 X t +N t .；
According to ML rule detection, the estimation of the detection signal can be expressed as:
further deriving the best-available detector as
Wherein R is M Representing a set of active information matrices by demapping the estimated antenna activation order and thenMedium to transmit signalsAnd row demodulation, recovering the information bits.
As an embodiment of the present invention, the implementation of the mapping algorithm in step 2 includes two options, namely, LUTO mapping algorithm and PM algorithm;
the LUTO mapping algorithm maps the input data symbols into antenna combinations according to the selected mapping table;
the PM algorithm maps the input bit stream to a corresponding signal matrix according to a predefined mapping rule.
As an embodiment of the present invention, the LUTO mapping algorithm specifically includes the following steps:
a1, predefining an antenna combination mapping table corresponding to each data symbol;
a2, converting the input data symbols into required antenna combinations;
a3, transmitting the data symbols by mapping the antenna combinations to the corresponding antennas.
By predefining an antenna combination mapping table corresponding to each data symbol and converting the input data symbol into a desired antenna combination and then transmitting the data symbol by mapping the antenna combination to a corresponding antenna, fig. 3 shows that BPSK modulation is performed under N T The DSM differential transmission process when=3, for further refinement, fig. 4 details the use of BPSK modulation when input D is 00, at N T The signal matrix transmitted when=3, fig. 5 shows when N T When=3, the mapping table of the LUTO algorithm is usually created for the transmitting antennas, and the number of rows of the created table for any number of transmitting antennas isThe total number of generated mapping schemes is N T The following is carried out Rows, therefore, have some mapping schemes discarded, the number of discarded mapping schemes being
The columns of the creation table are related to the selected modulation factor M, which is determined as follows:
b1, generating a bit value to be input;
b2, obtaining the maximum binary number of the bit sequence based on the input bit value;
b3, converting the maximum binary number into a decimal number;
and B4, adding one to the decimal number to obtain the size of the list.
When the number of antennas is N T When=4, there is N in total T The following is carried out =4-! =24 antenna activation sequences, according to the formulaIt can be seen that, in the 24 antenna activation sequences, 8 antenna selection schemes are not selected, and in general, the last 8 of the 24 schemes are discarded, and the binary number corresponding to the number of columns of the table has a length of N T log 2 (M)＝4log 2 (2) =4, column size of the table is 2 4 =16, all modulation symbol mapping schemes are denoted by set U:
i.e., U= { (-1, -1, -1), (-1, -1, -1, +1), (-1, -1, -1), (-1, +1, -1, (+1, -1, -1), (-1, -1, +1), (-1, +1, -1, +1), (+1, -1, +1), (-1, +1), (+1, +1), (+1, -1), (+1, -1, +1), (+1, -1, +1), (+1, -1, -1), (+1, -1, +1, -1), (+1, -1, -1, -1) };
when N is T =5, then set s= { S0, S1, … S63}: { (1, 2,3,4, 5), (1,2,3,5,4), (1,2,4,3,5), (1,2,4,5,3), (1,2,5,3,4), (1,2,5,4,3), (1,3,2,4,5), (1,3,2,5,4), (1,3,4,2,5), (1,3,4,5,2), (1,3,5,2,4), (1,3,5,4,2), (1,4,2,3,5), (1,4,2,5,3), (1,4,3,2,5), (1,4,3,5,2), (1,4,5,2,3), (1,4,5,3,2), (1,5,2,3,4), (1,5,2,4,3), (1,5,3,2,4), (1,5,3,4,2), (1,5,4,2,3), (1,5,4,3,2), (2,1,3,4,5), (2,1,3,4,5), (2,1,3,5,4), (2,1,4,3,5), (2,1,4,5,3), (2,1,5,3,4), (2,1,5,4,3), (2,3,1,4,5), (2, 3,1,5, 4), (2,3,4,1,5), (2,3,4,5,1) (2,3,5,1,4), (2,3,5,4,1), (2,4,1,3,5), (2,4,1,5,3), (2,4,3,1,5), (2,4,3,5,1), (2,4,5,1,3), (2,4,5,1,3), (2,4,5,1,3), (2, 5,1,3, 4), (2,4,5,1,3), (2,4,5,1,3), (2,4,5,1,3), (2,4,5,1,3), (2,4,5,1,3), (2,4,5,1,3), (2,4,5,1,3), (2,4,5,1,3), (2,4,5,1,3), (2,4,5,1,3););
according to the formulaIt is known that 56 antenna schemes are not selected in 120 antenna activation sequences, and the last 56 in the binary system is discarded in common practice;
the set T= { (-1, -1, -1, +1), (-1, -1, -1, +1, -1, (-1, -1, -1, +1), (-1, -1, +1, -1, -1), (-1, +1, -1, -1, -1, (-1, -1, -1, -1) 1, (-1, -1, -1, +1), (-1, -1, +1, (-1, -1, +1) and, (+1, -1, -1, -1, -1), +1), (-1, -1, +1, -1), (-1, +1, -1, -1), (-1, +1, -1), (-1, -1, +1), (-1, +1), +1), (+1, -1, -1, +1), (-1, +1, -1), (-1, +1, +1), (+1, +1, -1), (+1,+1,+1, -1,+1), (+1,+1, -1,+1,+1), (+1, -1,+1,+1,+1), (+1,+1,+1, -1, -1), (+1,+1, -1,+1, -1), (+1, -1,+1,+1, -1), (+1,+1, -1, -1,+1), (+1, -1, -1,+1,+1), (+1, -1,+1, -1,+1), (+1,+1, -1, -1, -1), (+1, -1,+1, -1, -1), (+1, -1, -1, -1, -1) }.
According to FIGS. 6 and 7, when N T When=4, the table size is 16×16=256; when N is T When=5, the table size is 32×64=2048, each information block carries 8 and 11 data bits, respectively, and the number N of transmitting antennas is increased T And the modulation order increases, the transmission efficiency increases, however, the size of the table increases exponentially with the number of transmitting antennas, so that when the number of transmitting antennas is small, the table look-up method is very simple and effective, but as the number of transmitting antennas increases, the size of the table becomes very large, and the PM substitution method can be considered at this time.
As one embodiment of the invention, the PM algorithm is implemented by combining N R The order of the digits is permuted to form a point-to-point mapping, mapping the integer m to a sequenceA set of permutations is formed 1, N R }. For a specific N R Arbitrary m E [0, N R ！-1]Can be expressed as a length of N R Sequence a of (2) (m) The method comprises the following specific steps:
c1, obtaining an integer m from an input sequence;
c2 converting integer m into sequenceThe conversion method is->
Maximum is takenSatisfy->Continue to take the maximum +.>Satisfy the following requirementsThen sequentially calculating b m Elements of (a) and (b);
and C3: will factorize sequence b m Mapping to permutation a (m) Here, Θ= (1, 2,.. R ) Is an ordered list with the index of the first element being 0 and the leftmost element a (m) Is thatWill b m Conversion to a (m) The conversion process is as follows
Element(s)Will be removed from list 1, this new list will also start with a zero index, and so on, obtaining a (m) Is included in the set of elements.
As an embodiment of the present invention, the specific processing steps of step 3 are: using transmitting-side substitution at the receiving sideReverse process, will a (m) The mapping is used as an input sequence, and the process corresponds to the process of the transmitting end substitution method.
Description of experimental data:
in this section, the DSM will be simulated and evaluated for Bit Error Rate (BER) performance, using a quasi-static rayleigh flat fading channel in the experiment;
the experimental platform is an operating system Windows10, and the programming environment is matlab2016b. The CPU used was Intel Kuri 9-13900 with the configuration shown in Table 1:
TABLE1 configuration of test hosts
Experimental results and analysis:
FIG. 8 shows the theoretical and simulation results of LUTO under BPSK, QPSK and 8PSK modulation in a differential spatial modulation system, it can be seen that when N T ＝4，N R When=4, the differential spatial modulation system using a higher modulation order is poor in performance, because the higher the symbol modulation order is, the higher the rate at which the differential spatial modulation system transmits data is, resulting in a higher bit error rate;
FIG. 9 shows N under BPSK modulation T =4, 5 and N R Error rate performance comparison result of PM and LUTO under conditions of=1, 2,3,4,5, at ber=10 -1 When it can be seen that for N R ＝1、N T =4 and N T The signal-to-noise ratio gain of PM is slightly better than LUTO, and gradually increases with the increase of the number of receiving antennas;
FIG. 10 shows the position at N T ＝3、4、5，N R Under the condition of=3, the error rates of PM and LUTO under different modulation modes are equal to N T ＝4，BER＝10 -3 When compared with QPSK, the 8PSK modulation constraint has a 5.9dB signal-to-noise ratio loss when N T When=5, QPSK has about 2.4dB of signal-to-noise ratio loss compared to BPSK modulation, because in the spatial domain, the number of modulation bits increases with the number of modulation symbols and the number of antennas, whichThe feature plays a very important role in selecting the number of transmit antennas in differential spatial modulation, which also suggests that by reasonably selecting the number of antennas and modulation order, a trade-off and trade-off can be made between the loss of data rate and diversity gain.
Table1 Performance test results
| Modulation and antenna arrangement | PM run time(s) | LUTO runtime(s) |
| BPSK N T ＝3 N R ＝1 | 6.76 | 4.47 |
| BPSK N T ＝3 N R ＝2 | 112.95 | 30.45 |
| BPSK N T ＝3 N R ＝3 | 213.68 | 67.37 |
| QPSK N T ＝3 N R ＝1 | 15.01 | 5.47 |
| QPSK N T ＝3 N R ＝2 | 363.52 | 46.82 |
| QPSK N T ＝3 N R ＝3 | 816.58 | 89.67 |
| 8PSK N T ＝3 N R ＝1 | 44.54 | 11.59 |
| 8PSK N T ＝3 N R ＝2 | 370.16 | 41.83 |
| 8PSK N T ＝3 N R ＝3 | 1969.85 | 375.57 |
| BPSK N T ＝4 N R ＝1 | 24.26 | 20.51 |
| BPSK N T ＝4 N R ＝2 | 472.79 | 249.37 |
| BPSK N T ＝4 N R ＝3 | 962.76 | 334.52 |
| BPSK N T ＝4 N R ＝4 | 1145.05 | 481.76 |
| QPSK N T ＝4 N R ＝1 | 249.45 | 173.50 |
| 8PSK N T ＝4 N R ＝1 | 1323.63 | 625.83 |
| BPSK N T ＝5 N R ＝1 | 127.07 | 96.36 |
| QPSK N T ＝5 N R ＝1 | 1981.00 | 896.64 |
| 8PSK N T ＝5 N R ＝1 | 56551.78 | 15637.95 |
Table1 compares the program run times of the PM and LUTO algorithms under different conditions, and it can be seen from the table that the LUTO algorithm is superior to the PM algorithm in terms of run time, which advantage becomes more pronounced as the number of antennas and modulation order increases, because the LUTO algorithm does not require additional time complexity when the number of transmit antennas is small, however, as the number of antennas increases, the spatial complexity required by the LUTO algorithm increases, the PM algorithm maps the input bit stream to a signal matrix, without a look-up table, which greatly reduces the spatial complexity, however, as the number of antennas increases, the computation amount of the PM algorithm gradually increases.
The foregoing has shown and described the basic principles, principal features and advantages of the invention. It will be understood by those skilled in the art that the present invention is not limited to the embodiments described above, and that the above embodiments and descriptions are merely illustrative of the principles of the present invention, and various changes and modifications may be made therein without departing from the spirit and scope of the invention, which is defined by the appended claims.
Claims (6)
1. Two mapping algorithm designs in a differential spatial modulation system are characterized by comprising: look-up table mapping (LUTO) and Permutation Mapping (PM), determining the number of transmitting antennas and modulation sequence according to the need, selecting proper mapping algorithm, for the look-up table mapping algorithm, designing mapping table according to the number of transmitting antennas, for the permutation mapping algorithm, directly mapping the input bit stream into signal matrix;
the whole realization of the differential spatial modulation system and the mapping algorithm comprises the following steps:
step 1: constructing a differential spatial modulation system;
the concrete construction method comprises the following steps:
s1, configuring a plurality of transmitting antennas and receiving antennas, and connecting and setting according to system requirements;
s2, at a transmitting end, a mapping algorithm is selected, an activation sequence of a transmitting antenna is determined, and data symbols are mapped into antenna combinations;
s3, demodulating the received signal at the receiving end to recover the original data symbol;
step 2: realizing a mapping algorithm;
step 3: and processing a signal at a receiving end.
2. The two mapping algorithm designs in a differential spatial modulation system according to claim 1, wherein the step 1 further comprises: n (N) T Root transmit antenna and N R A root receiving antenna, at the transmitting end, the information bits are divided into each of log 2 (N T ！)+N T log 2 (M) bits, where M represents a modulation factor, a transmission blockThe shot block will be at N T Transmitting on a time slot, the number of transmitting antennas and the length of the transmitting block being equal to N T ；
In the t-th transmission time, the transmission matrixIs S t ＝S t-1 X t Wherein->Is an information matrix, and is determined by information bits;
is provided withRepresents N R ×N T Is a channel matrix of the received signal matrix->Can be expressed as:
Y t ＝H t S t +N t .；
assuming that the channel is a flat rayleigh fading channel, the channel is unchanged over two time intervals, i.e., H t ＝H t-1 Then there is
Y t ＝Y t-1 X t -N t-1 X t +N t. ；
According to ML rule detection, the estimation of the detection signal can be expressed as:
further deriving the detector as
Wherein R is M Representing a set of all active information matrices by estimating the antenna activation orderDemapping and thenAnd demodulating the transmitted signal to recover the information bits.
3. The two mapping algorithm designs in the differential spatial modulation system according to claim 1, wherein the implementation of the mapping algorithm of step 2 includes two choices of a lookup table mapping algorithm and a permutation mapping algorithm;
the lookup table mapping algorithm maps the input data symbols into antenna combinations according to the selected mapping table;
the permutation mapping algorithm maps the input bit stream to a corresponding signal matrix according to a predefined mapping rule.
4. A design of two mapping algorithms in a differential spatial modulation system according to claim 3, wherein the look-up table mapping algorithm comprises the following specific steps:
a1, predefining an antenna combination mapping table corresponding to each data symbol;
a2, converting the input data symbols into required antenna combinations;
a3, transmitting data symbols by mapping antenna combinations to corresponding antennas;
creating a table for the transmit antennas, the number of rows of the table created for any number of transmit antennas beingThe total number of generated mapping schemes is N T The following is carried out Rows, therefore, have some mapping schemes discarded, the number of discarded mapping schemes being
The columns of the creation table are related to the selected modulation factor M, which is determined as follows:
b1, generating a bit value to be input;
b2, obtaining the maximum binary number of the bit sequence based on the input bit value;
b3, converting the maximum binary number into a decimal number;
and B4, adding one to the decimal number to obtain the size of the list.
5. Two mapping algorithm designs in a differential spatial modulation system according to claim 3 characterized in that the permutation mapping method is implemented by combining N R The order of the digits is permuted to form a point-to-point mapping, mapping the integer m to a sequenceA set of permutations is formed 1, N R For a particular N } R Arbitrary m E [0, N R ！-1]Can be expressed as a length of N R Sequence a of (2) (m) The method comprises the following specific steps:
c1, obtaining an integer m from an input sequence;
c2 converting integer m into sequenceThe conversion method is->
Maximum is takenSatisfy->Continue to take the maximum +.>Satisfy the following requirementsSequentially calculating all b m Elements of (a) and (b);
and C3: will factorize sequence b m Mapping to permutation a (m) Here, Θ= (1, 2,.. R ) Is an ordered list with the index of the first element being 0 and the leftmost element a (m) Is thatWill b m Conversion to a (m) The conversion process is as follows
Element(s)Will be removed from list 1, this new list will also start with a zero index, and so on, obtaining a (m) Is included in the set of elements.
6. The two mapping algorithm designs in the differential spatial modulation system according to claim 3, wherein the specific processing steps in step 3 are: reverse process of transmitting end substitution method is used at receiving end, a is carried out (m) The mapping is used as an input sequence, and the process corresponds to the process of the transmitting end substitution method.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311511039.5A CN117560041A (en) | 2023-11-14 | 2023-11-14 | Two mapping algorithm designs in differential spatial modulation system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311511039.5A CN117560041A (en) | 2023-11-14 | 2023-11-14 | Two mapping algorithm designs in differential spatial modulation system |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN117560041A true CN117560041A (en) | 2024-02-13 |
Family
ID=89819806
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311511039.5A Pending CN117560041A (en) | 2023-11-14 | 2023-11-14 | Two mapping algorithm designs in differential spatial modulation system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117560041A (en) |
-
2023
- 2023-11-14 CN CN202311511039.5A patent/CN117560041A/en active Pending
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Wen et al. | Generalized multiple-mode OFDM with index modulation | |
| CN101611552B (en) | Method of matching codeword size and transmitter thereof in mobile communications system | |
| CN102075487B (en) | Multidimensional constellation mapping based coding and modulating method, demodulating and decoding method and system | |
| Fan et al. | Orthogonal frequency division multiplexing with generalized index modulation | |
| CN109150275B (en) | Generalized spatial modulation method based on antenna combination and constellation map joint mapping | |
| US20090245432A1 (en) | Communication system | |
| CN112290957B (en) | Orthogonal time-frequency expansion tail biting Turbo coding and decoding communication method | |
| Wang et al. | Exploring smart pilot for wireless rate adaptation | |
| CN106788626A (en) | A kind of improvement orthogonal intersection space modulation transmission method for being obtained in that second order transmitting diversity | |
| CN100591065C (en) | Differential west space-time modulation constellation mapping method in multiple antenna orthogonal frequency division multiplexing | |
| US20050220203A1 (en) | System & method for spreading on fading channels | |
| US7310391B2 (en) | De-modulation of MOK(M-ary orthogonal modulation) | |
| CN117560041A (en) | Two mapping algorithm designs in differential spatial modulation system | |
| US7526047B2 (en) | Method for encoding a message into geometrically uniform space-time trellis codes | |
| US7433423B2 (en) | Multiple trellis coded differential unitary space-time modulation | |
| Cheng et al. | Joint source-channel coded multidimensional modulation for variable-length codes | |
| Wang et al. | Orthogonal space-time coding for CPM system with fast decoding | |
| CN114257343B (en) | Constellation forming linear coding method based on physical layer network coding | |
| CN113141232B (en) | Rate-free IoT uplink transmission system and method based on 16QAM modulation | |
| CN1540895A (en) | Method of self-adapting sub band Turbo encoding modulation in use for OFDM | |
| Li et al. | Bit-interleaved trellis coded unitary space-time modulation with iterative decoding | |
| CN116800379A (en) | Low-complexity decoding method for quasi-orthogonal space-time coding space modulation system | |
| Gu et al. | A novel efficient soft output demodulation algorithm for high order modulation | |
| CN117749326A (en) | Polarization coding modulation scheme for neural network optimization | |
| Lu et al. | Optimized design pattern matrix of PDMA based on binary particle swarm optimization for 5G |
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 |