Soft Solution Preprocessing Method and Soft Solution Method of Constellation Mapping
A technology of constellation mapping and preprocessing, applied in the field of soft solution preprocessing of constellation mapping, can solve the problems of large amount of calculation, high cost of hardware implementation, and many system resources, etc.
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0046] Such as figure 1 As shown, the soft solution preprocessing method of constellation mapping in this embodiment includes the following steps:
[0047] According to the constellation mapping adopted, the signal space containing 16 constellation points is divided into 4 regions; each region is distinguished by different shading, and the number in the center of each region represents the number of the region, and each region contains 4 constellation points; each information symbol contains 4 bits;
[0048] Construct table B; the constellation point set S used for logarithmic likelihood ratio calculation in area i is recorded in table B i ; i is an integer not greater than 4, i.e. i is 1, 2, 3 or 4; specifically as figure 1 Area 1, Area 2, Area 3 and Area 4 as described in;
[0049] in,
[0050] The S i Constellation Points Subset Included and the constellation point subset
[0051] said Contains the constellation point whose k-th bit is 0 and is the closest to th...
Embodiment 2
[0061] On the basis of the previous embodiment, the soft solution preprocessing method of constellation mapping in this embodiment provides two methods for obtaining the constellation point set,
[0062] The constellation point set S i The constellation points in are calculated by Monte Carlo algorithm or greedy algorithm.
[0063] Method 1: Monte Carlo algorithm to obtain:
[0064] Based on statistics and probability, the constellation point set is obtained through repeated verification;
[0065] Method 2: Greedy algorithm to obtain:
[0066] A: Define the distance from a point in the information symbol signal space to region i,
[0067] B: Then calculate as well as n is the nth bit of the information symbol, and n is not greater than log 2 The distance from all points in M (M is the mapping order of the constellation map) to the area i, take the shortest several points as Represented as the i-th area, u represents the u-th bit of the received information symbol; ...
no. 1 example
[0074] The soft solution method for constellation mapping in this embodiment is applied after the preprocessing performed by the soft solution preprocessing method for constellation mapping above, and specifically includes the following steps:
[0075] Receive the information symbol and determine the area i to which the information symbol belongs;
[0076] Obtain the constellation point set S for the logarithmic likelihood ratio calculation of the region i to which the information symbol belongs from table B i , and according to the preset method for information symbols and S i The log-likelihood ratio is calculated for the constellation points in .
[0077] In the soft solution method of constellation mapping in this embodiment, table B for log likelihood ratio calculation is obtained through the soft solution preprocessing method of constellation mapping as described in embodiment 1 or embodiment 2, and table B The number of constellation points recorded in is much smaller...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 