An Index Modulation Mapping Method
A technology of index modulation and mapping method, which is applied in the direction of modulation carrier system, digital transmission system, electrical components, etc., can solve the problems of bit error rate performance loss, etc., and achieve the effect of reducing bit error rate and reducing Hamming distance
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0054] An indexed modulation mapping method such as figure 1 shown, including:
[0055] (1) Obtain all N under the index modulation parameter all index combination, and construct a graph theory model with the index combination as the vertex; in the graph theory model, if and only if the number of different elements in the two index combinations is n err , there is an edge between the corresponding two vertices;
[0056] The index modulation mapping method provided by the embodiment of the present invention is applicable to index modulation technologies in any domain; in index modulation, n indices are selected from m indices to activate transmission information, where the total number of indices m and the selected index number n are is the index modulation parameter; according to the index parameters m and n, a total of index combinations, the number of elements in each index combination is n, and the elements are integers between 1 and m;
[0057] figure 2 Shown is a s...
Embodiment 2
[0094] An index modulation mapping method, this embodiment is similar to the first embodiment above, the difference is that in this embodiment, N groups of bit information are matched to the N vertices of the target subgraph, and the N vertices in the target subgraph are Edge weighting, so that the sum of the weights of all edges in the target subgraph is minimum, and its specific method is based on the first embodiment, and also includes:
[0095] (W1) After sequentially matching the initial bit information to N vertices in the target subgraph, execute steps (T3) to (T8) to obtain N matching schemes in total;
[0096] Each time the start bit information is matched to a vertex, all vertices in the target subgraph are initialized to an unmatched state;
[0097] (W2) Select the matching scheme that minimizes the sum of edge weights in the target subgraph from the N matching schemes, as a candidate matching scheme, and initialize the variable n err '=n err ;
[0098] (W3) If t...
Embodiment 3
[0105] A computer-readable storage medium, where the computer-readable storage medium includes a stored computer program, wherein, when the computer program is run by a processor, the device where the computer-readable storage medium is located is controlled to execute the index modulation mapping method provided in any of the above-mentioned embodiments .
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


