CN111917678A - Index modulation mapping method - Google Patents
Index modulation mapping method Download PDFInfo
- Publication number
- CN111917678A CN111917678A CN202010724272.1A CN202010724272A CN111917678A CN 111917678 A CN111917678 A CN 111917678A CN 202010724272 A CN202010724272 A CN 202010724272A CN 111917678 A CN111917678 A CN 111917678A
- Authority
- CN
- China
- Prior art keywords
- vertex
- subgraph
- bit information
- matching
- edges
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000013507 mapping Methods 0.000 title claims abstract description 57
- 238000000034 method Methods 0.000 title claims abstract description 39
- 239000011159 matrix material Substances 0.000 claims description 14
- 238000004590 computer program Methods 0.000 claims description 6
- 238000012216 screening Methods 0.000 claims description 6
- 238000004891 communication Methods 0.000 abstract description 9
- 230000005540 biological transmission Effects 0.000 description 11
- 238000005516 engineering process Methods 0.000 description 9
- 238000010295 mobile communication Methods 0.000 description 5
- 238000010586 diagram Methods 0.000 description 4
- 238000011161 development Methods 0.000 description 3
- 230000008901 benefit Effects 0.000 description 2
- 238000004364 calculation method Methods 0.000 description 2
- 230000006872 improvement Effects 0.000 description 2
- 238000001228 spectrum Methods 0.000 description 2
- UIQMVEYFGZJHCZ-SSTWWWIQSA-N Nalorphine Chemical compound C([C@@H](N(CC1)CC=C)[C@@H]2C=C[C@@H]3O)C4=CC=C(O)C5=C4[C@@]21[C@H]3O5 UIQMVEYFGZJHCZ-SSTWWWIQSA-N 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 150000001875 compounds Chemical class 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005265 energy consumption Methods 0.000 description 1
- 238000002474 experimental method Methods 0.000 description 1
- 230000010354 integration Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000008569 process Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L27/00—Modulated-carrier systems
- H04L27/26—Systems using multi-frequency codes
- H04L27/2601—Multicarrier modulation systems
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Error Detection And Correction (AREA)
Abstract
The invention discloses an index modulation mapping method, which belongs to the field of wireless communication modulation and comprises the following steps: obtaining all N under index modulation parametersallThe index combination is used as a vertex to construct a graph theory model; in the graph theory model, if and only if the number of different elements in two index combinations is nerrWhen the vertex is in a straight line, a side exists between two corresponding vertexes; obtaining a subgraph containing N vertexes in the graph theory model as a target subgraph,
matching N groups of bit information to N vertexes of a target subgraph, and giving weight values to edges in the target subgraph to ensure that the sum of the weights of all the edges in the target subgraph is minimum, and determining the matching relation between the bit information and the index combination at the moment as a final index modulation mapping relation; the more the number of different elements in the two groups of bit information matched by the two vertexes is, the larger the weight of the edge between the two corresponding vertexes is. The invention can minimize the Hamming distance between the original index modulation signalsAnd the bit error rate of the original signal estimator is effectively reduced.
Description
Technical Field
The invention belongs to the field of wireless communication modulation, and particularly relates to an index modulation mapping method.
Background
With the pursuit of speed and capacity, mobile communication technology has experienced the development from the first generation mobile communication to the fifth generation mobile communication. On one hand, the fifth generation mobile communication increases the transmission information quantity by expanding the space dimension and adopting a large-scale multi-antenna MIMO (multiple input multiple output) technology; on the other hand, the communication bandwidth is increased by expanding spectrum resources and adopting millimeter wave communication. Research on the sixth generation mobile communication technology is started, and the vision of the next generation wireless communication is integration of the sky, the ground and the sea, so that the interconnection of everything is realized. In the future, wireless communication channel environments are more complex, the number of mobile users is larger and differentiated, and time domain, frequency domain and space domain resources are limited, so that development of a novel communication technology and development of a new dimension for transmitting information are urgently needed. In recent years, a new technology of expanding the index dimension to modulate information, index modulation technology, has attracted attention of a wide range of scholars. Specifically, it is first applied to antenna domain named spatial modulation, which is mainly used to transmit information additionally through activated antenna index, and then the concept is widely applied to other fields of wireless communication such as carrier domain index modulation, code domain index modulation, beam domain index modulation, etc. Index modulation can effectively improve spectrum efficiency, save energy resources, reduce energy consumption and radio frequency implementation cost, and is a physical layer transmission technology with great prospect in future wireless communication.
In index modulation, information is transmitted mainly using an activated index combination. In particular, n elements are selected from m elements (i.e., indices) to activate transmission of information, for a total of
And combining the indexes. For mapping of bit to index combinations, from NallIn selection
An index combination wherein
Is a rounded down function; therefore, there are in total
And selecting one index combination set as an active set to transmit information. In the valid index combination set, N index combinations will match N different sets of bit information, for a total of N! And (6) matching. The receiving end detects the transmissionAfter the index combination of the information, the bit information transmitted by the index combination can be obtained by utilizing the mapping table. In index modulation, there is a total
N! And mapping the table. The optimal mapping table is
N! Selecting one of the mapping tables to optimize transmission error rate performance, thereby having a complexity of
At a transmission rate of 4 bits/channel, the complexity is O (10)17) And at a transmission rate of 7 bits/channel, the complexity is O (10)279) And thus it is impractical to select the optimal mapping by traversing all mapping tables.
In order to realize index modulation, a conventional scheme adopts a random selection effective index combination set and matches bit information for the index combination, and the scheme can effectively reduce the realization complexity, however, the error rate performance of the scheme cannot be guaranteed, and the index modulation performance advantage cannot be maximally played.
Disclosure of Invention
Aiming at the defects and improvement requirements of the prior art, the invention provides an index modulation mapping method, aiming at solving the technical problem of bit error rate performance loss caused by randomly selecting an effective index combination set and randomly matching bit information for the index combination in the prior index modulation technology.
To achieve the above object, according to an aspect of the present invention, there is provided an index modulation mapping method, including:
obtaining all N under index modulation parametersallThe index combination is used as a vertex to construct a graph theory model; in the graph theory model, if and only if the number of different elements in two index combinations is nerrWhen the vertex is in a straight line, a side exists between two corresponding vertexes;
obtaining a subgraph containing N vertexes in the graph theory model as a target subgraph,
matching N groups of bit information to N vertexes of a target subgraph, and giving weight values to edges in the target subgraph to ensure that the sum of the weights of all the edges in the target subgraph is minimum, and determining the matching relation between the bit information and the index combination at the moment as a final index modulation mapping relation; the more the number of different elements in the two groups of bit information matched by the two vertexes is, the larger the weight of the edge between the two corresponding vertexes is;
wherein n iserrIs a preset positive integer, and is a preset positive integer,
representing a rounding-down function, each set of bit information having a length L-log2N。
The invention utilizes graph theory knowledge to convert the selected index combination into vertexes in a graph theory model, weights are assigned to edges between corresponding vertexes according to the number of different elements between bit information, namely Hamming distance, and the Hamming distance between original index modulation signals is minimized after the bit information is mapped to the index combination by minimizing the sum of the weights of the edges in the graph, thereby effectively reducing the bit error rate of the original signal estimator.
Further, the target subgraph is the subgraph of the graph theory model with the smallest sum of degrees of the vertexes in all subgraphs containing N vertexes.
The index combination corresponding to N vertexes in the target subgraph selected by the invention forms an index combination set in the index modulation process, and the subgraph which comprises the N vertexes and has the minimum sum of degrees of the vertexes is selected as the target subgraph, so that the sum of weights of edges in the subgraph can be further reduced after bit information is matched to the vertexes, the Hamming distance between original index modulation signals is further reduced, and the bit error rate of the original signal estimator is reduced.
Further, the method for acquiring the target subgraph comprises the following steps:
(S1) from graph theorySelecting a vertex from the model, removing the selected vertex and the associated edges from the graph theory model to obtain a graph theory model containing NallSub graph of 1 vertex, to contain Nall-1 vertex subgraph as the subgraph to be processed and going to step (S2);
(S2) if the number of the top points in the subgraph to be processed is N, taking the subgraph to be processed as a target subgraph, and turning to the step (S4); otherwise, selecting a vertex with the maximum degree from the subgraph to be processed, and removing the selected vertex and the associated edges from the subgraph to be processed to obtain a new subgraph;
(S3) taking the new sub-graph as a sub-graph to be processed, and turning to the step (S2);
(S4) the acquisition is ended.
According to the invention, the vertex and the edge in the graph theory model are sequentially removed by adopting the criterion of preferentially removing the vertex with the maximum degree and the edge related to the vertex with the maximum degree, and the subgraph which comprises N vertexes and has the minimum sum of degrees of the vertexes can be accurately and efficiently obtained.
Further, matching the N groups of bit information to N vertices of the target sub-graph, and assigning weights to the edges in the target sub-graph, so that the sum of the weights of all the edges in the target sub-graph is minimum, including the following steps:
(T1) allocating a unique vertex number to each vertex in the target subgraph, and establishing an adjacent matrix of the target subgraph; in the adjacent matrix, each row element corresponds to a vertex and represents the vertex number adjacent to the vertex;
(T2) selecting a set of bit information from the N sets of bit information as start bit information, and matching the start bit information to one of the vertices in the target sub-graph;
(T3) selecting a vertex number from a row of elements corresponding to matched vertices in the adjacent matrix, and taking the corresponding vertex as a vertex to be matched;
(T4) sequentially matching the residual unmatched bit information to the top points to be matched, correspondingly assigning weights to the edges in the target subgraph, and calculating the sum of the weights of all the edges in the target subgraph, wherein the weight of the edge associated with the top points of the unmatched bit information is 0;
(T5) keeping the matching relation between a group of bit information and the current vertex to be matched when the sum of the weights of all edges in the target subgraph is minimum, and turning to the step (T6);
(T6) if all the vertices in the target subgraph match, then go to step (T8); otherwise, acquiring a matched vertex number set in the target subgraph, and turning to the step (T7);
(T7) respectively obtaining the number of the same elements contained in each row of elements and the vertex number set in the adjacent matrix, so as to select the vertex corresponding to the row of elements with the most same elements in the vertex number set as a new vertex to be matched, and turning to the step (T4);
(T8) the matching ends.
According to the matching method, each group of bit information is matched to the vertex corresponding to one index combination, the minimum weight of the edge associated with the matched vertex is ensured, and therefore the matching method which enables the sum of the weights of all edges in the target subgraph to be minimum can be accurately and efficiently obtained.
Further, matching the N groups of bit information to N vertices of the target sub-graph, and assigning weights to the edges in the target sub-graph, so that the sum of the weights of all the edges in the target sub-graph is minimum, further comprising:
(W1) after the initial bit information is sequentially matched with N vertexes in the target subgraph, executing the steps (T3) to (T8) to obtain N matching schemes;
initializing all vertexes in the target subgraph to be in an unmatched state when the initial bit information is matched to the vertexes each time;
(W2) screening out a matching scheme which enables the sum of the weights of the edges in the target subgraph to be minimum from the N matching schemes to serve as a candidate matching scheme, and initializing a variable Nerr′＝nerr；
(W3) if the number of candidate matching solutions is not 1, then n is countederr′＝nerr' +1 update variable nerrAfter that, proceed to step (W4); otherwise, go to step (W6);
(W4) updating the target subgraph so that it is correct and only correct for different elements in the two index combinationsThe number of elements is nerrWhen the target sub-graph is updated, one edge exists between two corresponding vertexes to obtain an updated target sub-graph;
(W5) weighting values of the edges in the updated target subgraph according to the candidate matching schemes, correspondingly calculating the sum of the weights of the edges in the updated target subgraph, screening out the matching scheme which enables the sum of the weights of the edges in the updated target subgraph to be the minimum, taking the matching scheme as a new candidate matching scheme, and turning to the step (W3);
(W6) determining the screened unique matching scheme as a matching scheme of the final bit information and index combination.
When a plurality of matching schemes are available, the sum of the weights of all edges in the target sub-graph can be minimized, the matching schemes are gradually screened by updating the structure of the edges in the target sub-graph until a unique matching scheme is obtained, and therefore the finally obtained matching scheme can still be optimal when the conditions are changed.
Further, the weight of the edge is the hamming distance between two sets of bit information corresponding to two vertices connecting the edge.
The invention directly takes the Hamming distance between bit information as the weight of the edge between the matched vertexes, and can simplify the calculation while finding the optimal matching scheme.
Further, the index modulation mapping method provided by the present invention further includes: and drawing an index modulation mapping table from the bit information to the index combination according to the determined matching relation between the bit information and the index combination.
The invention draws the index modulation mapping table from the bit information to the index combination based on the determined matching relation between the bit information and the index combination, and can facilitate the receiving end to obtain the bit information transmitted by the index combination by looking up the mapping table after detecting the index combination of the transmitted information.
According to another aspect of the present invention, a computer-readable storage medium is provided, which includes a stored computer program, wherein when the computer program is executed by a processor, the apparatus where the computer-readable storage medium is located is controlled to execute the index modulation mapping method provided by the present invention.
Generally, by the above technical solution conceived by the present invention, the following beneficial effects can be obtained:
(1) the invention utilizes graph theory knowledge to convert the selected index combination into vertexes in a graph theory model, weights are assigned to edges between corresponding vertexes according to the number of different elements between bit information, namely Hamming distance, and the Hamming distance between original index modulation signals is minimized after the bit information is mapped to the index combination by minimizing the sum of the weights of the edges in the graph, thereby effectively reducing the bit error rate of the original signal estimator.
(2) The invention selects the subgraph which comprises N vertexes and has the minimum sum of degrees of the vertexes as the target subgraph, so that the sum of weights of edges in the subgraph can be further reduced after the bit information is matched to the vertexes, the Hamming distance between the original index modulation signals is further reduced, and the bit error rate of the original signal estimator is reduced.
(3) Experiments show that the complexity of index modulation transmission by using an index modulation mapping table drawn by the index modulation mapping method provided by the invention is the same as that of the traditional random mapping method, so that the index modulation mapping method provided by the invention is an efficient index modulation mapping method.
Drawings
Fig. 1 is a flowchart of an index modulation mapping method according to an embodiment of the present invention;
FIG. 2 is a diagram theoretical model diagram constructed according to index combinations according to an embodiment of the present invention;
fig. 3 is a schematic diagram illustrating a comparison between the index modulation mapping method provided by the embodiment of the present invention and the conventional random mapping method.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention is described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention. In addition, the technical features involved in the embodiments of the present invention described below may be combined with each other as long as they do not conflict with each other.
In the present application, the terms "first," "second," and the like (if any) in the description and the drawings are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order.
The first embodiment is as follows:
an index modulation mapping method, as shown in fig. 1, includes:
(1) obtaining all N under index modulation parametersallThe index combination is used as a vertex to construct a graph theory model; in the graph theory model, if and only if the number of different elements in two index combinations is nerrWhen the vertex is in a straight line, a side exists between two corresponding vertexes;
the index modulation mapping method provided by the embodiment of the invention is suitable for index modulation technology of any domain; in index modulation, n indexes are selected from m indexes to activate transmission information, wherein the total number m of the indexes and the number n of the selected indexes are index modulation parameters; according to index parameters m and n, obtaining
The number of elements in each index combination is n, and the elements are integers from 1 to m;
fig. 2 is a schematic diagram of the graph-theory model constructed in the embodiment, wherein each index combination corresponds to a vertex in the graph-theory model,
i.e. all NallThe index combines the corresponding vertexes;
nerris a preset positive integer for measuring the number of different elements in the two index combinations, and n is a preset positive integer in the embodiment without loss of generality err1 is ═ 1; correspondingly, if and only if the number of different elements in two index combinations is 1, there is an edge between the corresponding two vertices which are adjacent vertices；
(2) Obtaining a subgraph containing N vertexes in the graph theory model as a target subgraph,
index combinations corresponding to N vertexes in the selected target subgraph are index combinations used for mapping bit information in index modulation;
(3) matching N groups of bit information to N vertexes of a target subgraph, assigning weights to edges in the target subgraph to enable the sum of the weights of all the edges in the target subgraph to be minimum, and determining the matching relation between the bit information and the index combination at the moment as a final index modulation mapping relation; the more the number of different elements in the two groups of bit information matched by the two vertexes is, the larger the weight of the edge between the two corresponding vertexes is;
in order to simplify the calculation, in this embodiment, the weight of an edge is directly set as the hamming distance between two sets of bit information corresponding to two vertices connecting the edge, i.e., the number of different elements between the bit information; it should be noted that the setting manner of the side weight is not limited to this, as long as the set weight can accurately measure the hamming distance between bit information;
as shown in FIG. 2, wherein di,jRepresents a vertex IiAnd IjThe weight of the edges between, the following table representing the vertex number to which the edge is connected, and, correspondingly, d1,iRepresents a vertex I1And IiWeight of the middle edge, d1,NRepresents a vertex I1And INThe weights of the edges between the two groups are analogized in the same way;
wherein,
representing a rounding-down function, each set of bit information having a length L-log2N。
In this embodiment, the selected index combination is converted into vertices in the graph theory model by using graph theory knowledge, weights are assigned to edges between corresponding vertices according to the number of different elements between bit information, that is, hamming distances, and the hamming distances between original index modulation signals are minimized after the bit information is mapped to the index combination by minimizing the sum of the weights of the edges in the graph, thereby effectively reducing the bit error rate of the original signal estimator.
As a preferred implementation, in this embodiment, the target subgraph is a subgraph of the graph theory model that includes all subgraphs including N vertices, where the sum of degrees of the vertices is the minimum;
optionally, the present embodiment obtains the target subgraph by the following steps:
(S1) selecting a vertex from the graph theory model, and removing the selected vertex and the associated edges from the graph theory model to obtain a graph model containing NallSub graph of 1 vertex, to contain Nall-1 vertex subgraph as the subgraph to be processed and going to step (S2);
due to the fact that the N is originally constructedallIn the individual vertex graph theory model, the degrees of each vertex are consistent and are all
Thus, to obtain a compound having Nall-1 vertex subgraph, randomly selecting a vertex from the graph theory model, and removing the selected vertex and the associated edge from the graph theory model;
(S2) if the number of the top points in the subgraph to be processed is N, taking the subgraph to be processed as a target subgraph, and turning to the step (S4); otherwise, selecting a vertex with the maximum degree from the subgraph to be processed, and removing the selected vertex and the associated edges from the subgraph to be processed to obtain a new subgraph;
in the embodiment, the vertex with the maximum degree is preferentially selected for removal each time, so that the number of edges in the obtained new sub-graph is minimized after the vertex and the associated edge are removed each time;
it should be noted that in the subgraph to be processed, there may be a plurality of vertices with the maximum degree, and without loss of generality, at this time, one vertex is randomly selected, and the vertex and its associated edge are removed;
(S3) taking the new sub-graph as a sub-graph to be processed, and turning to the step (S2);
(S4) the acquisition is ended;
in the embodiment, the subgraph which comprises N vertexes and has the minimum sum of degrees of the vertexes is selected as the target subgraph, so that the sum of weights of edges in the subgraph can be further reduced after bit information is matched to the vertexes, the hamming distance between original index modulation signals is further reduced, and the bit error rate of the original signal estimator is reduced; meanwhile, the embodiment adopts the criterion of preferentially removing the vertex with the maximum degree and the associated edge thereof to sequentially remove the vertex and the edge in the graph theory model, so that the subgraph which comprises N vertexes and has the minimum sum of degrees of the vertexes can be accurately and efficiently obtained;
it should be noted that the description of the selection of the target subgraph and the corresponding acquisition mode is only a preferred embodiment of the invention, and should not be construed as the only limitation of the invention.
As a preferred implementation manner, in this embodiment, matching N groups of bit information to N vertices of a target sub-graph, and assigning weights to edges in the target sub-graph, so that a sum of the weights of all the edges in the target sub-graph is minimum, includes the following steps:
(T1) allocating a unique vertex number to each vertex in the target subgraph, and establishing an adjacent matrix of the target subgraph; in the adjacent matrix, each row element corresponds to a vertex and represents the vertex number adjacent to the vertex;
(T2) selecting a set of bit information from the N sets of bit information as start bit information, and matching the start bit information to one of the vertices in the target sub-graph;
(T3) selecting a vertex number from a row of elements corresponding to matched vertices in the adjacent matrix, and taking the corresponding vertex as a vertex to be matched;
(T4) sequentially matching the residual unmatched bit information to the top points to be matched, correspondingly assigning weights to the edges in the target subgraph, and calculating the sum of the weights of all the edges in the target subgraph, wherein the weight of the edge associated with the top points of the unmatched bit information is 0;
(T5) keeping the matching relation between a group of bit information and the current vertex to be matched when the sum of the weights of all edges in the target subgraph is minimum, and turning to the step (T6);
it should be noted that after the unmatched bit information is sequentially matched to the vertex to be matched, a plurality of matching relations with the smallest sum of weights of all edges may exist in the target subgraph, and no generality is lost, and at this time, the matching relation between one bit information and the vertex to be matched is randomly selected;
(T6) if all the vertices in the target subgraph match, then go to step (T8); otherwise, acquiring a matched vertex number set in the target subgraph, and turning to the step (T7);
(T7) respectively obtaining the number of the same elements contained in each row of elements and the vertex number set in the adjacent matrix, so as to select the vertex corresponding to the row of elements with the most same elements in the vertex number set as a new vertex to be matched, and turning to the step (T4);
similarly, it should be noted that, in the adjacent matrix, there may be a plurality of matrix rows having the most same elements as the vertex number set, but not generally, at this time, a row of elements is randomly selected, and the vertex corresponding to the row of elements is taken as a new vertex to be matched;
(T8) the matching ends.
In this embodiment, each group of bit information is matched to a vertex corresponding to one index combination, the minimum weight of the edge associated with the matched vertex is ensured, and thus, a matching method for minimizing the sum of the weights of all edges in the target subgraph can be accurately and efficiently obtained;
it should be noted that the obtaining manner of the optimal matching scheme is only a preferred embodiment of the present invention, and should not be construed as the only limitation to the present invention, and other methods for mapping bit information to a vertex, which can minimize the sum of the weights of all edges in the target subgraph, may also be applied to the present invention.
As an optional implementation manner, this embodiment further includes: drawing an index modulation mapping table from the bit information to the index combination according to the determined matching relation between the bit information and the index combination;
the embodiment draws the index modulation mapping table from the bit information to the index combination based on the determined matching relationship between the bit information and the index combination, and can facilitate the receiving end to obtain the bit information transmitted by the index combination by looking up the mapping table after detecting the index combination of the transmission information.
In the following, the advantageous effect of the index modulation mapping method provided by the present embodiment with respect to the prior art is further verified by taking a conventional mapping scheme, i.e., a random mapping method, as a comparison. Specifically, in the antenna domain index, the total index number m is set to be 8 and kept unchanged, and when the selected index number n is 2, 3, and 4, index modulation mapping and index modulation transmission are performed by using the present embodiment and the conventional mapping scheme, respectively, and bit error rates and SNRs (Signal Noise ratios) of different index modulation mapping methods under different index parameters are shown in fig. 3. According to the results shown in fig. 3, after the index modulation mapping table is obtained by using the index modulation mapping method proposed by the present invention under the same index parameters, the complexity of index modulation transmission using the mapping table is the same as that of the conventional scheme, but the error rate performance can be effectively improved.
Example two:
an index modulation mapping method, similar to the above embodiments, is different in that in this embodiment, N groups of bit information are matched to N vertices of a target subgraph, and a weight value is assigned to an edge in the target subgraph, so that a sum of weights of all edges in the target subgraph is minimum, and a specific method thereof is based on the first embodiment, and further includes:
(W1) after the initial bit information is sequentially matched with N vertexes in the target subgraph, executing the steps (T3) to (T8) to obtain N matching schemes;
initializing all vertexes in the target subgraph to be in an unmatched state when the initial bit information is matched to the vertexes each time;
(W2) screening the matching scheme which enables the sum of the weights of the edges in the target subgraph to be minimum from the N matching schemes, and taking the matching scheme as the matching schemeCandidate matching scheme and initializing variable nerr′＝nerr；
(W3) if the number of candidate matching solutions is not 1, then n is countederr′＝nerr' +1 update variable nerrAfter that, proceed to step (W4); otherwise, go to step (W6);
(W4) updating the target subgraph so that the number of different elements in the two index combinations is nerrWhen the target sub-graph is updated, one edge exists between two corresponding vertexes to obtain an updated target sub-graph;
it should be understood that, before and after the update of the target sub-graph, the vertex of the target sub-graph remains unchanged, only the judgment criteria of the adjacent vertex changes, and accordingly, the connection condition of the edges of the target sub-graph changes before and after the update;
(W5) weighting values of the edges in the updated target subgraph according to the candidate matching schemes, correspondingly calculating the sum of the weights of the edges in the updated target subgraph, screening out the matching scheme which enables the sum of the weights of the edges in the updated target subgraph to be the minimum, taking the matching scheme as a new candidate matching scheme, and turning to the step (W3);
(W6) determining the screened unique matching scheme as a matching scheme of the final bit information and index combination;
in this embodiment, when there are multiple matching schemes that can minimize the sum of the weights of all edges in the target sub-graph, the matching schemes are gradually screened by updating the structure of the edges in the target sub-graph until a unique matching scheme is obtained, so that the finally obtained matching scheme is still optimal when the conditions change.
Example three:
a computer-readable storage medium comprising a stored computer program, wherein when the computer program is executed by a processor, the apparatus on which the computer-readable storage medium is located is controlled to execute the index modulation mapping method provided in any of the above embodiments.
It will be understood by those skilled in the art that the foregoing is only a preferred embodiment of the present invention, and is not intended to limit the invention, and that any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention should be included in the scope of the present invention.
Claims (8)
1. An index modulation mapping method, comprising:
obtaining all N under index modulation parametersallThe index combination is used as a vertex to construct a graph theory model; in the graph theory model, if and only if the number of different elements in two index combinations is nerrWhen the vertex is in a straight line, a side exists between two corresponding vertexes;
acquiring a subgraph containing N vertexes in the graph theory model as a target subgraph,
matching N groups of bit information to N vertexes of the target subgraph, assigning weights to edges in the target subgraph to enable the sum of the weights of all the edges in the target subgraph to be minimum, and determining the matching relation between the bit information and the index combination at the moment as a final index modulation mapping relation; the more the number of different elements in the two groups of bit information matched by the two vertexes is, the larger the weight of the edge between the two corresponding vertexes is;
wherein n iserrIs a preset positive integer, and is a preset positive integer,
representing a rounding-down function, each set of bit information having a length L-log2N。
2. The index modulation mapping method of claim 1 wherein the target subgraph is the subgraph of the graph theory model with the smallest sum of degrees of vertices among all subgraphs of N vertices.
3. The index modulation mapping method of claim 2, wherein the method of obtaining the target subgraph comprises the steps of:
(S1) selecting a vertex from the graph theory model, and removing the selected vertex and the associated edges from the graph theory model to obtain a graph model containing Nall-1 vertex subgraph, including Nall-1 vertex subgraph as the subgraph to be processed and going to step (S2);
(S2) if the number of the top points in the subgraph to be processed is N, taking the subgraph to be processed as the target subgraph, and turning to the step (S4); otherwise, selecting a vertex with the maximum degree from the subgraph to be processed, and removing the selected vertex and the associated edges from the subgraph to be processed to obtain a new subgraph;
(S3) taking the new subgraph as a subgraph to be processed, and turning to the step (S2);
(S4) the acquisition is ended.
4. The index modulation mapping method of any one of claims 1-3, wherein matching N groups of bit information to N vertices of the target sub-graph and weighting edges in the target sub-graph such that the sum of the weights of all edges in the target sub-graph is minimized, comprises the steps of:
(T1) assigning a unique vertex number to each vertex in the target sub-graph, and building an adjacent matrix of the target sub-graph; in the adjacent matrix, each row element corresponds to a vertex and represents a vertex number adjacent to the vertex;
(T2) selecting a set of bit information from the N sets of bit information as start bit information, and matching the start bit information to one of the vertices in the target sub-graph;
(T3) selecting a vertex number from a row of elements corresponding to matched vertices in the adjacent matrix, and taking the corresponding vertex as a vertex to be matched;
(T4) sequentially matching the residual unmatched bit information to the vertex to be matched, correspondingly assigning weights to the edges in the target subgraph, and calculating the sum of the weights of all the edges in the target subgraph, wherein the weight of the edge associated with the vertex not matched with the bit information is 0;
(T5) keeping the matching relationship between a set of bit information and the current vertex to be matched when the sum of the weights of all edges in the target sub-graph is minimum, and proceeding to step (T6);
(T6) if all vertices in the target subgraph match, then go to step (T8); otherwise, acquiring the matched vertex number set in the target subgraph, and turning to the step (T7);
(T7) obtaining the number of the same elements included in each row of elements in the adjacent matrix and the vertex number set, respectively, to select the vertex corresponding to the row of elements having the most same elements as the vertex number set, as a new vertex to be matched, and proceeding to step (T4);
(T8) the matching ends.
5. The index modulation mapping method of claim 4, wherein matching N groups of bit information to N vertices of the target sub-graph and weighting edges in the target sub-graph such that a sum of weights of all edges in the target sub-graph is minimal, further comprises:
(W1) after sequentially matching the start bit information to N vertices in the target subgraph, performing steps (T3) to (T8) to obtain N matching schemes;
initializing all vertexes in the target subgraph to be in an unmatched state every time the starting bit information is matched to the vertexes;
(W2) screening out the matching scheme which enables the sum of the weights of the edges in the target subgraph to be minimum from the N matching schemes to serve as a candidate matching scheme, and initializing a variable Nerr′＝nerr；
(W3) if the number of candidate matching solutions is not 1, then n is countederr′＝nerr' +1 update variable nerrAfter that, proceed to step (W4); otherwise, go to step (W6);
(W4) updating the target subgraph so that the number of different elements in two index combinations is nerrAt time, two tops are respectivelyOne edge exists between the points to obtain an updated target subgraph;
(W5) weighting the edges in the updated target subgraph according to each candidate matching scheme, correspondingly calculating the sum of the weights of the edges in the updated target subgraph, screening out the matching scheme which enables the sum of the weights of the edges in the updated target subgraph to be the minimum, taking the matching scheme as a new candidate matching scheme, and turning to the step (W3);
(W6) determining the screened unique matching scheme as a matching scheme of the final bit information and index combination.
6. The index modulation mapping method of claim 4, wherein the weight of the edge is a Hamming distance between two sets of bit information corresponding to two vertices connecting the edge.
7. The index modulation mapping method of claim 4, further comprising: and drawing an index modulation mapping table from the bit information to the index combination according to the determined matching relation between the bit information and the index combination.
8. A computer-readable storage medium, comprising a stored computer program, wherein the computer program, when executed by a processor, controls an apparatus in which the computer-readable storage medium is located to perform the index modulation mapping method according to any one of claims 1-7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010724272.1A CN111917678B (en) | 2020-07-24 | 2020-07-24 | Index modulation mapping method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010724272.1A CN111917678B (en) | 2020-07-24 | 2020-07-24 | Index modulation mapping method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111917678A true CN111917678A (en) | 2020-11-10 |
| CN111917678B CN111917678B (en) | 2021-06-11 |
Family
ID=73281771
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010724272.1A Active CN111917678B (en) | 2020-07-24 | 2020-07-24 | Index modulation mapping method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111917678B (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20180309481A1 (en) * | 2017-04-21 | 2018-10-25 | National Taiwan University | Methods of beam-indexed spatial modulation |
| CN108900456A (en) * | 2018-07-03 | 2018-11-27 | 北京理工大学 | A kind of double mode index modulation Mapping Design method |
| CN110213194A (en) * | 2019-05-20 | 2019-09-06 | 重庆邮电大学 | A kind of spatial modulation bit mapping method of low complex degree |
| CN110830089A (en) * | 2019-11-26 | 2020-02-21 | 电子科技大学 | Space frequency index modulation transmission method |
| CN111431617A (en) * | 2020-04-14 | 2020-07-17 | 兰州理工大学 | Asymmetric amplitude limiting light OFDM-IM modulation method for wireless optical communication |
-
2020
- 2020-07-24 CN CN202010724272.1A patent/CN111917678B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20180309481A1 (en) * | 2017-04-21 | 2018-10-25 | National Taiwan University | Methods of beam-indexed spatial modulation |
| CN108900456A (en) * | 2018-07-03 | 2018-11-27 | 北京理工大学 | A kind of double mode index modulation Mapping Design method |
| CN110213194A (en) * | 2019-05-20 | 2019-09-06 | 重庆邮电大学 | A kind of spatial modulation bit mapping method of low complex degree |
| CN110830089A (en) * | 2019-11-26 | 2020-02-21 | 电子科技大学 | Space frequency index modulation transmission method |
| CN111431617A (en) * | 2020-04-14 | 2020-07-17 | 兰州理工大学 | Asymmetric amplitude limiting light OFDM-IM modulation method for wireless optical communication |
Non-Patent Citations (2)
| Title |
|---|
| JONG YOON HYUN: "Weighted Posets and Digraphs Admitting the Extended Hamming Code to be a Perfect Code", 《IEEE》 * |
| 牛晓珂: "空频联合索引调制***的子载波优化与检测算法研究", 《中国优秀硕士学位论文全文数据库（电子期刊）》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111917678B (en) | 2021-06-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN112105062B (en) | Mobile edge computing network energy consumption minimization strategy method under time-sensitive condition | |
| Yoshida et al. | MAB-based client selection for federated learning with uncertain resources in mobile networks | |
| CN112533274B (en) | Indoor terahertz BWP and power scheduling method and device | |
| CN105721123B (en) | A kind of user pairing and power distribution method and device | |
| CN113708804B (en) | Whale algorithm-based user scheduling and simulated beam selection optimization method | |
| CN110856268B (en) | Dynamic multichannel access method for wireless network | |
| CN101867402A (en) | MIMO system and application method thereof for adaptive antenna selection | |
| CN108156617B (en) | Graph theory-based cooperative caching method in fog wireless access network | |
| CN113596785A (en) | D2D-NOMA communication system resource allocation method based on deep Q network | |
| CN111835401B (en) | Method for joint optimization of wireless resources and paths in unmanned aerial vehicle communication network | |
| CN116321299A (en) | Internet of vehicles task unloading and resource allocation method based on MEC under information age constraint | |
| CN110191476B (en) | Reconfigurable antenna array-based non-orthogonal multiple access method | |
| CN111917678B (en) | Index modulation mapping method | |
| CN109067678B (en) | WFRFT signal cascade modulation identification method based on high-order cumulant and wireless communication system | |
| CN108650710A (en) | The resource allocation methods of wireless energy supply communication network based on mixing multiple access access | |
| WO2012103716A1 (en) | Detecting method and system for multiple-input multiple-output system | |
| CN114980216B (en) | Dependency task unloading system and method based on mobile edge calculation | |
| CN116367310A (en) | Maximum gain oriented channel allocation method for mobile edge calculation | |
| CN116582893A (en) | Neural network model segmentation and resource allocation method in wireless energy supply edge intelligent scene | |
| CN109586848A (en) | A kind of message-passing decoding algorithm in SCMA system | |
| CN114745032A (en) | Non-cellular large-scale MIMO intelligent distributed beam selection method | |
| Du et al. | Energy-efficient user clustering and resource management for NOMA based MEC systems | |
| CN107979397B (en) | Antenna port selection method of distributed antenna system | |
| CN113986532B (en) | Low-orbit satellite Internet of things distributed task cooperation processing method | |
| Jiang et al. | ASPFL: Efficient Personalized federated learning for edge based on adaptive sparse training |
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 |