Constellation mapping method and related apparatus
By constructing a QAM constellation diagram that satisfies Gray's properties and combining a mapping method between high-order and low-order bits, the problem of poor demodulation bit error rate in set-segmented constellation mapping is solved, thereby improving the decoding performance and signal transmission efficiency of the system.
Patent Information
- Application Number
- CN202311778149.8
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2023-12-21
- Publication Date
- 2026-07-28
- Estimated Expiration
- 2043-12-21
AI Technical Summary
Existing set segmentation constellation mapping technology results in poor demodulation error rate performance, and symbols near the origin are more likely to be selected, affecting the system's decoding performance.
A QAM constellation diagram that satisfies Gray properties is constructed by dividing the bits to be transmitted into high-order bits and low-order bits. By combining Gray mapping and shaped bits, symbol bits and shaped bits are selected to achieve constellation mapping.
It improves the demodulation error rate performance of lattice-shaped symbols, reduces the average energy of symbols, and enhances LDPC decoding performance and overall system performance.
Smart Images
Figure CN117938612B_ABST
Abstract
Description
Technical Field
[0001] This application relates to the field of communication technology, and in particular to a constellation mapping method and related equipment. Background Technology
[0002] During channel transmission, constellation shaping technology is used to transform the originally uniformly transmitted signal into a non-uniform signal, reducing the average symbol energy during signal transmission and thus increasing the system transmission capacity, making the transmission capacity closer to the Shannon limit.
[0003] In related technologies, set-partitioned constellations are used for constellation mapping. The characteristic of set-partitioned constellations is that the first two bits in each quadrant are used to represent the constellation point symbol; the last few bits in each quadrant represent the mapping position. This allows constellation points with the same mapping position but different energy values to be obtained by adjusting the constellation point symbol, thereby reducing the average energy of constellation points.
[0004] However, the bit difference between the constellation points at the boundaries of sub-constellations in the set-segment constellation is two bits, resulting in a certain gap in demodulation error rate performance compared to the Gray constellation. Furthermore, the shaping process increases the probability of selecting symbols closer to the origin (i.e., symbols closer to the coordinate axes are selected more often than those farther away), further amplifying the difference in demodulation performance. Summary of the Invention
[0005] In view of this, the purpose of this application is to solve the technical problems raised in the background art and to propose a constellation mapping method and related equipment.
[0006] To achieve the above objectives, this application provides a constellation mapping method, comprising:
[0007] Constructing a constellation of order 2 M The QAM constellation diagram; the constellation points on the QAM constellation diagram are composed of sign bits and shaped bits, and the constellation points satisfy the Gray property; M is an even number;
[0008] The bits to be transmitted are divided into multiple bit sequences of size M-1; the bit sequence includes the high-order bits of the first bit and the low-order bits excluding the first bit.
[0009] The bit sequence is sequentially mapped to constellation symbols to obtain the constellation mapping diagram corresponding to the bit to be transmitted; wherein the low-order bits and the shaped bits satisfy Gray mapping, and the high-order bits correspond to the symbol bits.
[0010] Optionally, the constellation order is 2. M The QAM constellation chart includes:
[0011] Build 2 M-2A sub-QAM constellation diagram of a certain size; each constellation point in the sub-QAM constellation diagram is a shaped bit, and the shaped bit satisfies the Gray property;
[0012] Flipping the sub-QAM constellation diagram along the boundary yields 2 M A QAM constellation diagram of a certain size; the QAM constellation diagram comprises 16 sub-regions;
[0013] Each subregion of the QAM constellation diagram is assigned a symbol bit; the symbol bits are symmetrical along the axis.
[0014] Optionally, it also includes:
[0015] Establish a coordinate system along the axes of the QAM constellation diagram;
[0016] Calculate the Euclidean distance from each constellation point in the QAM constellation diagram to the origin;
[0017] The Euclidean distance is used as the energy value of the constellation point.
[0018] Optionally, mapping the bit sequence to constellation symbols includes:
[0019] Based on the least significant bits in the bit sequence, determine the shaped bits that satisfy the Gray mapping;
[0020] Based on the high-order bits and pre-coding in the bit sequence, multiple pre-symbol bits are obtained using the following formula;
[0021] x=u(H -1 ) T +vG;
[0022] Where u represents the high-order bit, (H -1 ) T represents the checksum, v represents the precoding, and G represents the channel coding;
[0023] The pre-symbol bits are combined with the shaped bits to determine multiple pre-constellation points;
[0024] The pre-constellation point with the lowest energy value is taken as the target constellation point, and the corresponding pre-coded value is determined as the target input value;
[0025] The bit sequence is mapped to constellation symbols based on the target constellation points.
[0026] Optionally, it also includes:
[0027] Based on the constellation mapping diagram, the channel decoding is obtained using the following formula;
[0028] u e =(u(H) -1 ) T+vG+e)H T
[0029] Where G represents channel coding, (H -1 ) T represents the checksum, v represents the target input value, and e represents the equivalent noise.
[0030] Optionally, the expression for the channel coding includes:
[0031] G = [1 + D] 2 1+D+D 2 ];
[0032] The expression for the checksum includes:
[0033] H -1 = [D 1+D];
[0034] Where D represents a register.
[0035] Optionally, the expression for the channel coding includes:
[0036] G = [D 1+D 2 ];
[0037] The expression for the checksum includes:
[0038] H -1 (D) = [1 D];
[0039] Where D represents a register.
[0040] Based on the same inventive concept, one or more embodiments of this application also provide a constellation mapping device, including:
[0041] The QAM constellation diagram building module is configured to build constellations of order 2. M The QAM constellation diagram; the constellation points on the QAM constellation diagram are composed of sign bits and shaped bits, and the constellation points satisfy the Gray property; M is an even number;
[0042] A bit sequence construction module is configured to divide the bits to be transmitted into multiple groups of bit sequences of size M-1; the bit sequence includes the high-order bits of the first bit and the low-order bits excluding the first bit.
[0043] The mapping module is configured to sequentially map the bit sequence to constellation symbols to obtain a constellation mapping diagram corresponding to the bit to be transmitted; wherein the low-order bits and the shaped bits satisfy Gray mapping, and the high-order bits correspond to the symbol bits.
[0044] Based on the same inventive concept, one or more embodiments of this application also provide an electronic device, including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the program to implement the constellation mapping method as described in any of the above.
[0045] Based on the same inventive concept, one or more embodiments of this application also provide a non-transitory computer-readable storage medium storing computer instructions for causing the computer to execute any of the constellation mapping methods described above.
[0046] As can be seen from the above, the constellation mapping method provided in this application constructs a constellation of order 2. M A QAM constellation diagram is obtained; constellation points on the QAM constellation diagram consist of symbol bits and shaped bits; M is an even number; the bit to be transmitted is divided into multiple groups of bit sequences of size M-1; the bit sequence includes the high-order bits of the first bit and the low-order bits excluding the first bit; the bit sequences are sequentially mapped to constellation symbols to obtain the constellation mapping diagram corresponding to the bit to be transmitted; wherein the low-order bits and the shaped bits satisfy Gray mapping, and the high-order bits correspond to the symbol bits.
[0047] The constellation mapping method provided in this application, based on a QAM constellation diagram satisfying Gray's property, searches for the sequence with the lowest symbol energy in a given sequence set of convolutional codes at the transmitting end using a search algorithm to achieve constellation mapping. The aforementioned QAM constellation diagram construction method is simple and applicable to different QAM modulation orders, suitable for trellis-shaped QAM modulation schemes. The method proposed in this application can improve the bit error rate performance of trellis-shaped symbols during demodulation without increasing the encoding and decoding complexity of trellis-shaped codes. Furthermore, when trellis-shaped codes are concatenated with LDPC codes, the output of the shaped decoding becomes more reliable, thereby improving the decoding performance of LDPC and enhancing the overall system performance.
[0048] The constellation mapping device, electronic device, and computer-readable storage medium provided in this application can all implement the steps of the constellation mapping method described above, and therefore also have the beneficial effects of the constellation mapping method described above. Attached Figure Description
[0049] To more clearly illustrate the technical solutions in this application or related technologies, the drawings used in the description of the embodiments or related technologies will be briefly introduced below. Obviously, the drawings described below are only embodiments of this application. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.
[0050] Figure 1 This is a flowchart illustrating one or more embodiments of the constellation mapping method of this application;
[0051] Figure 2 This is a schematic diagram of the constellation mapping device according to one or more embodiments of this application;
[0052] Figure 3 A diagram illustrating the construction process of a 64-QAM constellation diagram for this application;
[0053] Figure 4 A diagram illustrating the construction process of a 64-QAM constellation diagram for this application;
[0054] Figure 5 This application provides a 64-QAM constellation diagram;
[0055] Figure 6 This application provides a schematic diagram of the energy values of constellation points in the second quadrant of a 64-QAM constellation chart.
[0056] Figure 7 This is a schematic diagram of the encoding and mapping process at the sending end of this application;
[0057] Figure 8 For this application, a 16-QAM constellation diagram is provided;
[0058] Figure 9 This is a schematic diagram of the probability distribution of constellation points in a mesh forming code based on a 64-QAM constellation diagram in this application;
[0059] Figure 10 This application includes a demodulation performance comparison chart;
[0060] Figure 11 This is a schematic diagram of the structure of an electronic device according to one or more embodiments of this application. Detailed Implementation
[0061] To make the objectives, technical solutions, and advantages of this application clearer, the following detailed description is provided in conjunction with specific embodiments and the accompanying drawings.
[0062] It should be noted that, unless otherwise defined, the technical or scientific terms used in the embodiments of this application should have the ordinary meaning understood by one of ordinary skill in the art to which this application pertains. The terms "first," "second," and similar terms used in the embodiments of this application do not indicate any order, quantity, or importance, but are merely used to distinguish different components. Terms such as "comprising" or "including" mean that the element or object preceding the word encompasses the elements or objects listed after the word and their equivalents, without excluding other elements or objects. Terms such as "connected" or "linked" are not limited to physical or mechanical connections, but can include electrical connections, whether direct or indirect. Terms such as "upper," "lower," "left," and "right" are only used to indicate relative positional relationships; when the absolute position of the described object changes, the relative positional relationship may also change accordingly.
[0063] As described in the background section, using constellation mapping technology at the transmitting end to encode the bits to be transmitted according to the constellation mapping can make the encoded bits non-uniformly distributed during constellation modulation, thereby reducing the average symbol energy.
[0064] Mesh shaping is a type of constellation probabilistic shaping technique. Related techniques utilize set-partitioned constellations for constellation mapping. However, while set-partitioned constellations can provide mapping points with different energy values for the bits to be transmitted, their non-Gray characteristics lead to poor bit error rate performance at the demodulation end, resulting in degraded decoding performance in cascaded LDPC systems.
[0065] Therefore, this application proposes a constellation mapping method to construct a QAM constellation diagram that satisfies various characteristics, and to perform constellation mapping based on the QAM constellation diagram in order to improve the decoding performance of the system.
[0066] Quadrature Amplitude Modulation (QAM) is a commonly used digital signal modulation method in Wi-Fi, combining phase modulation and amplitude modulation. In digital signal modulation, a QAM constellation diagram is typically used to represent a two-dimensional QAM modulation pattern. Each point on the constellation diagram represents a symbol.
[0067] The technical solutions of one or more embodiments of this application will be described in detail below through specific examples.
[0068] refer to Figure 1 The constellation mapping method of one or more embodiments of this application includes the following steps:
[0069] Step S101: Construct a constellation of order 2 MThe QAM constellation diagram; the constellation points on the above QAM constellation diagram are composed of sign bits and shaped bits, and the above constellation points satisfy the Gray property; M is an even number.
[0070] Gray code is a binary number system that sorts two consecutive values by only one bit. In this application, constellation points satisfy the Gray property, meaning that the bit sequences of two adjacent constellation points differ by only one bit.
[0071] The constellation points in this application consist of symbol bits and shaped bits. The symbol bits and shaped bits differ in their construction and mapping methods.
[0072] Specifically, in this application, the sign bit is set to 2 bits, and the shaping bit is set to M-2 bits. In some embodiments, the constellation order is 2. M The QAM constellation chart includes the following steps:
[0073] First, construct 2 M-2 The size of the sub-QAM constellation diagram; each constellation point in the above sub-QAM constellation diagram is a shaped bit, and the above shaped bit satisfies the Gray property.
[0074] It is understandable that the values of each constellation point in the above sub-QAM constellation diagram are different, and the values of adjacent constellation points differ by only one bit.
[0075] Then, the above sub-QAM constellation diagram is flipped along the boundary to obtain 2. M The QAM constellation diagram of the above size; the QAM constellation diagram includes 16 sub-regions. This step can be understood as dividing the above sub-QAM constellation diagram into 4 sub-regions of the same size, and flipping each sub-region along the boundary of the sub-QAM constellation diagram to obtain 2 M QAM constellation chart of varying sizes.
[0076] In some embodiments, the flip can be performed first along any two opposite boundaries, and then along the other two boundaries.
[0077] It is understandable that if the above QAM constellation diagram is divided into 16 sub-regions of the same size, and these sub-regions are further divided into 4 groups, then the QAM constellation constructed by this application can satisfy the requirement that the 4 sub-regions in each group contain constellation points with the same value, and can also ensure that the constellation points in the QAM constellation satisfy the Gray property.
[0078] Finally, each sub-region of the QAM constellation diagram is assigned a symbol bit; these symbol bits are symmetrical along the axis.
[0079] As described above, the QAM constellation diagram can be divided into 16 equal-sized sub-regions, which can be further divided into 4 groups. Assigning sign bits to each of the 4 sub-regions in each group ensures that a set of shaped bits can correspond to all sign bits. To ensure that the constellation points still satisfy the Gray property after assigning sign bits, the sign bits are symmetrical along the axis.
[0080] The construction of the above QAM constellation can also be understood in the following way:
[0081] First, establish a 2 M A QAM constellation diagram of order is generated, a coordinate system is established along the axis of the QAM constellation diagram, and the QAM constellation diagram is divided into 16 sub-regions.
[0082] Next, shape bits are assigned to the constellation points in the QAM constellation diagram. In this step, shape bits are first assigned to the constellation points in the four sub-regions closest to the origin. These constellation points satisfy the Gray property, meaning that the values of adjacent constellation points differ by only one bit. It can be understood that the constellation points in the four sub-regions are all different. Then, the four sub-regions are symmetrically flipped along their boundaries. Each constellation point in the flipped QAM constellation is assigned a shape bit, and the Gray property is satisfied. It can be understood that although the constellation points in the sub-regions of each quadrant are arranged in different orders, their assigned values are the same.
[0083] Finally, sign bits are assigned to the constellation points in the QAM constellation diagram. The assignment of sign bits requires that each adjacent sub-region be different and symmetrical along the coordinate axis.
[0084] It can be understood that, after assigning sign bits to constellation points, each shaped bit can correspond to four sign bits. Furthermore, at the boundaries of different sub-regions of sign bits, the shaped bits corresponding to constellation points are the same, which ensures that the entire constellation diagram satisfies the Gray property.
[0085] The following example illustrates the construction process of a specific 64-QAM constellation. In a 64-QAM constellation, each constellation point uses 2 bits as the sign bit and 4 bits as the shaping bit.
[0086] In this process, firstly, as Figure 3 As shown, the 64-QAM constellation is divided into 16 sub-regions, and a coordinate system is established along the axis. Then, shaped bits are assigned to the constellation points in the four sub-regions surrounding the origin. For example... Figure 3 As shown, the shaped bits of each sub-region are different.
[0087] Then, the above four sub-regions are flipped along the boundaries, and shaped bits are assigned to all constellation points, resulting in the following: Figure 4 The constellation diagram shown illustrates that the current constellation point satisfies Gray's property.
[0088] Finally, assigning sign bits to the constellation points yields, as follows: Figure 5 The QAM constellation diagram shown is illustrated. Each sub-region has the same symbol bits, while adjacent sub-regions have different symbol bits, and the symbol bits are symmetrical along the coordinate axes. It can be understood that each shaped bit corresponds to 4 symbol bits, and all constellation points satisfy the Gray property.
[0089] Figure 6 The constellation points in the second quadrant of the 64-QAM constellation diagram above are shown. Constellation points with the same pattern correspond to constellation points with the same shaped bit. It can be seen that the same shaped bit corresponds to four choices of symbol bits, which in turn correspond to four choices of energy values. When performing Viterbi decoding at the transmitting end based on the energy value, constellation points with lower energy can be selected as much as possible to reduce the average energy of the transmitted signal.
[0090] Step S102: Divide the bits to be transmitted into multiple groups of bit sequences of size M-1; the bit sequences include the high-order bits of the first bit and the low-order bits excluding the first bit.
[0091] As described in step S101, there is a difference between the mapping method for low-order bits and formed bits and the mapping method for high-order bits and sign bits.
[0092] In this application, the above-mentioned bit sequence to be transmitted is encoded based on the grid-forming encoding principle.
[0093] First, the bits to be sent are divided into multiple bit sequences of size M-1.
[0094] Since in the subsequent mapping process, the low-order bits need to be mapped to shaped bits of the same number of bits, and the 1-bit high-order bits need to be mapped to 2-bit sign bits, the bits to be transmitted need to be divided into a bit sequence of size M-1 according to the order of the QAM constellation diagram.
[0095] Step S103: Map the bit sequence to constellation symbols in sequence to obtain the constellation mapping diagram corresponding to the bit to be sent; wherein the low-order bits and the shaped bits satisfy Gray mapping, and the high-order bits correspond to the symbol bits.
[0096] In this step, the low-order bits and high-order bits are mapped separately to obtain the sign bit and the shaped bit. The shaped bit can be obtained from the low-order bits using a pre-defined Gray mapping algorithm.
[0097] The high-order bits are calculated using the formula: x = u(H) -1 ) T +vG yields the transmission sequence. In some embodiments, G = [D 1+D] 2 ], H -1(D)=[1 D],H(D)=[1+D 2 D).
[0098] For Viterbi decoding at the beginning, the only factor affecting the decoding process is the energy of the constellation points of different symbol bits corresponding to the same shaped bit. That is, the state measurement of the decoding process is only related to the energy of the constellation points, not their specific positions. Therefore, in this application, the precoding value with the smallest vG value can be selected using the Viterbi decoding method. Specifically, the symbol bits with precoding values of 0 or 1 can be calculated, and the constellation point with the smallest energy value after combining different symbol bits with the determined shaped bits can be determined. Finally, the precoding value is determined in reverse. The precoding value also affects the calculation of symbol bits in the next bit sequence.
[0099] In other words, in this application, the high-order bits are searched for the constellation point with the lowest energy value on the convolutional code using the Viterbi decoding algorithm as the target constellation point. Thus, at the receiving end, decoding can be performed using the constellation mapping diagram and the selected precoded values to eliminate the redundant bits added at the transmitting end and recover the original bit sequence. That is, at the receiving end, it can be done according to the formula: yH T =(u(H) -1 ) T +vG+e)H T =u e Decode the code. vG+e can be considered as equivalent noise.
[0100] like Figure 7 As shown, in one embodiment of this application, when performing constellation mapping, the bits to be transmitted are first divided into multiple bit sequences, each bit sequence including high-order bits and low-order bits. Figure 7 The bit sequence shown includes one high-order bit q1 and two low-order bits q2 and q3. Based on the bit sequence [q1, q2, q3], the encoded sequence [w1, w2, q2, q3] can be obtained and mapped onto the QAM constellation diagram to obtain the constellation symbol.
[0101] When calculating w1 and w2, u(H) -1 ) T It can be determined using t1t2. However, w1 and w2 still need to be adjusted using compensation sequences c1 and c2. The process of determining c1 and c2 is as follows: combining the precoding sequence t = u(H -1 ) T The calculation yields four possible values: w1w2 = c1c2 + t1t2. Then, the energy of the constellation point corresponding to w1w2 is ||x. iThe c1 and c2 paths are used as inputs to the Viterbi decoding algorithm to find the path with the lowest sum of weights, i.e., the path with the lowest total energy of the constellation points. In other words, the selection principle for c1 and c2 is to use the energy of the four constellation points as the state metric in Viterbi decoding, selecting the point with the lowest energy.
[0102] In this implementation, t1 is equal to q1, t2 is the value in the third register, c1 is the value in the first register, and c2 is the precoded value plus the value in the second register.
[0103] During the encoding and mapping process, the constellation points mapped to q2 and q3 are first determined, and the Gray mapping is satisfied between q2, q3 and the constellation points. Then, the multiple sets of w1 and w2 obtained from the grid encoding are combined with q2 and q3, and the v corresponding to w1 and w2 when w1, w2, q2, and q3 can be mapped to the constellation point with the lowest energy value is determined.
[0104] Taking the calculation of a bit sequence of length 3 in this application as an example, such as Figure 8 The diagram shows the corresponding 16-QAM constellation. Given that q2 and q3 correspond to constellation points with a shaping bit of 10, four corresponding constellation points can be determined: 1110, 0110, 1010, and 0010, with corresponding energy values of ||x1||, ||x2||, ||x3||, and ||x4||, respectively. Calculations show that ||x1|| has the smallest value, and 1110 is the final constellation symbol, corresponding to the target input value v. The receiver can then perform decoding based on the constellation symbol and the target input value.
[0105] In other embodiments, G = [1 + D] 2 1+D+D 2 ], H -1 = [D 1+D], H T =[1+D+D 2 1+D] T Where D represents the register value, u represents the high-order bit value, and v represents the precoded value.
[0106] Any convolutional code encoding method that can implement the technical solution of this application is within the scope of protection of this application.
[0107] The Viterbi decoding method searches for the output sequence corresponding to the lowest symbol energy and path on the convolutional code, and finally finds the corresponding input compensation sequence. This method increases the probability of selecting low-energy constellation points, creating a non-uniform distribution characteristic, thus reducing the overall energy and achieving shaping gain. For 2... M -QAM constellation, with a grid-shaped code rate of (M-1) / M.
[0108] In some embodiments, the energy value of a constellation point is determined based on the Euclidean distance from the constellation point to the origin.
[0109] like Figure 9 As shown, the shaping code rate of the technical solution in this application is 5 / 6. When the minimum distance between constellation points in a QAM constellation is 2, the average energy of the constellation points obtained after shaping is E{||x i || 2}=17.22. Based on set-segmentation constellation techniques, under the same conditions, the average energy of constellation points is E{||x i || 2 =17.23, the energy obtained from forming is almost the same.
[0110] like Figure 10 As shown in the figure below, under the condition of consistent forming energy gain, the demodulation performance of the Gray constellation is compared. Under the same BER, the demodulation performance of the Gray constellation is about 0.5-1dB higher than that of the set-segment constellation.
[0111] It should be noted that the method in this embodiment can be executed by a single device, such as a computer or server. The method can also be applied in a distributed scenario, where multiple devices cooperate to complete the task. In such a distributed scenario, one of these devices may execute only one or more steps of the method in this embodiment, and the multiple devices will interact with each other to complete the method described.
[0112] It should be noted that the above description describes some embodiments of this application. Other embodiments are within the scope of the appended claims. In some cases, the actions or steps recorded in the claims can be performed in a different order than that shown in the above embodiments and still achieve the desired result. Furthermore, the processes depicted in the drawings do not necessarily require a specific or sequential order to achieve the desired result. In some embodiments, multitasking and parallel processing are also possible or may be advantageous.
[0113] Based on the same inventive concept, corresponding to any of the above-described embodiments, this application also provides a constellation mapping device.
[0114] refer to Figure 2 The constellation mapping device includes:
[0115] QAM constellation diagram construction module 11 is configured to construct constellations of order 2. M The QAM constellation diagram; the constellation points on the QAM constellation diagram are composed of sign bits and shaped bits, and the constellation points satisfy the Gray property; M is an even number;
[0116] The bit sequence construction module 12 is configured to divide the bits to be transmitted into multiple groups of bit sequences of size M-1; the bit sequence includes the high-order bits of the first bit and the low-order bits excluding the first bit.
[0117] The mapping module 13 is configured to sequentially map the bit sequence to constellation symbols to obtain a constellation mapping diagram corresponding to the bit to be transmitted; wherein the low-order bits and the shaped bits satisfy Gray mapping, and the high-order bits correspond to the symbol bits.
[0118] For ease of description, the above devices are described in terms of function, divided into various modules. Of course, in implementing this application, the functions of each module can be implemented in one or more software and / or hardware.
[0119] The apparatus of the above embodiments is used to implement the corresponding constellation mapping method in any of the foregoing embodiments, and has the beneficial effects of the corresponding method embodiments, which will not be repeated here.
[0120] Based on the same inventive concept, corresponding to any of the above embodiments, this application also provides an electronic device, including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the program to implement the constellation mapping method described in any of the above embodiments.
[0121] Figure 11 This embodiment illustrates a more specific hardware structure of an electronic device, which may include a processor 1010, a memory 1020, an input / output interface 1030, a communication interface 1040, and a bus 1050. The processor 1010, memory 1020, input / output interface 1030, and communication interface 1040 are interconnected internally via the bus 1050.
[0122] The processor 1010 can be implemented using a general-purpose CPU (Central Processing Unit), microprocessor, application-specific integrated circuit (ASIC), or one or more integrated circuits, and is used to execute relevant programs to implement the technical solutions provided in the embodiments of this specification.
[0123] The memory 1020 can be implemented in the form of ROM (Read Only Memory), RAM (Random Access Memory), static storage device, dynamic storage device, etc. The memory 1020 can store the operating system and other applications. When the technical solutions provided in the embodiments of this specification are implemented by software or firmware, the relevant program code is stored in the memory 1020 and is called and executed by the processor 1010.
[0124] The input / output interface 1030 is used to connect input / output modules to realize information input and output. Input / output modules can be configured as components within the device (not shown in the figure) or externally connected to the device to provide corresponding functions. Input devices may include keyboards, mice, touchscreens, microphones, various sensors, etc., while output devices may include displays, speakers, vibrators, indicator lights, etc.
[0125] The communication interface 1040 is used to connect a communication module (not shown in the figure) to enable communication between this device and other devices. The communication module can communicate via wired means (such as USB, Ethernet cable, etc.) or wireless means (such as mobile network, WIFI, Bluetooth, etc.).
[0126] Bus 1050 includes a pathway for transmitting information between various components of the device, such as processor 1010, memory 1020, input / output interface 1030, and communication interface 1040.
[0127] It should be noted that although the above-described device only shows the processor 1010, memory 1020, input / output interface 1030, communication interface 1040, and bus 1050, in specific implementations, the device may also include other components necessary for normal operation. Furthermore, those skilled in the art will understand that the above-described device may only include the components necessary for implementing the embodiments of this specification, and not necessarily all the components shown in the figures.
[0128] The electronic devices described above are used to implement the corresponding constellation mapping methods in any of the foregoing embodiments and have the beneficial effects of the corresponding method embodiments, which will not be repeated here.
[0129] Based on the same inventive concept, corresponding to the methods of any of the above embodiments, this application also provides a non-transitory computer-readable storage medium storing computer instructions for causing the computer to execute the constellation mapping method as described in any of the above embodiments.
[0130] The computer-readable medium of this embodiment includes permanent and non-permanent, removable and non-removable media, and information storage can be implemented by any method or technology. Information can be computer-readable instructions, data structures, program modules, or other data. Examples of computer storage media include, but are not limited to, phase-change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technologies, CD-ROM, digital versatile optical disc (DVD) or other optical storage, magnetic tape, magnetic magnetic disk storage or other magnetic storage devices, or any other non-transfer medium that can be used to store information accessible by a computing device.
[0131] The computer instructions stored in the storage medium of the above embodiments are used to cause the computer to execute the constellation mapping method as described in any of the above embodiments, and have the beneficial effects of the corresponding method embodiments, which will not be repeated here.
[0132] Those skilled in the art should understand that the discussion of any of the above embodiments is merely exemplary and is not intended to imply that the scope of this application (including the claims) is limited to these examples; within the framework of this application, the technical features of the above embodiments or different embodiments can also be combined, the steps can be implemented in any order, and there are many other variations of different aspects of the embodiments of this application as described above, which are not provided in the details for the sake of brevity.
[0133] Additionally, to simplify the description and discussion, and to avoid obscuring the embodiments of this application, the well-known power / ground connections to integrated circuit (IC) chips and other components may or may not be shown in the provided drawings. Furthermore, the apparatus may be shown in block diagram form to avoid obscuring the embodiments of this application, and this also takes into account the fact that the details of the implementation of these block diagram apparatuses are highly dependent on the platform on which the embodiments of this application will be implemented (i.e., these details should be fully understood by those skilled in the art). While specific details (e.g., circuits) have been set forth to describe exemplary embodiments of this application, it will be apparent to those skilled in the art that the embodiments of this application can be implemented without these specific details or with variations thereof. Therefore, these descriptions should be considered illustrative rather than restrictive.
[0134] Although this application has been described in conjunction with specific embodiments thereof, many substitutions, modifications, and variations of these embodiments will be apparent to those skilled in the art from the foregoing description. For example, other memory architectures (e.g., dynamic RAM (DRAM)) may be used with the embodiments discussed.
[0135] The embodiments of this application are intended to cover all such substitutions, modifications, and variations that fall within the broad scope of the appended claims. Therefore, any omissions, modifications, equivalent substitutions, improvements, etc., made within the spirit and principles of the embodiments of this application should be included within the protection scope of this application.
Claims
1. A constellation mapping method, characterized in that, include: Constructing a constellation of order 2 M QAM constellation chart; The constellation points on the QAM constellation diagram consist of sign bits and shaped bits, and the constellation points satisfy the Gray property; M is an even number. The bits to be transmitted are divided into multiple bit sequences of size M-1; the bit sequence includes the high-order bits of the first bit and the low-order bits excluding the first bit. The bit sequence is sequentially mapped to constellation symbols to obtain the constellation mapping diagram corresponding to the bit to be transmitted; wherein, the low-order bits and the shaped bits satisfy the Gray mapping, and the high-order bits correspond to the symbol bits; The step of mapping the bit sequence to constellation symbols includes: Based on the least significant bits in the bit sequence, determine the shaped bits that satisfy the Gray mapping; Based on the high-order bits and pre-coding in the bit sequence, multiple pre-symbol bits are obtained using the following formula; ； in, This refers to the high-order bits. This represents the checksum. Indicates precoding, Indicates channel coding; The pre-symbol bits are combined with the shaped bits to determine multiple pre-constellation points; The pre-constellation point with the lowest energy value is taken as the target constellation point, and the corresponding pre-coded value is determined as the target input value; The bit sequence is mapped to constellation symbols based on the target constellation points.
2. The method according to claim 1, characterized in that, The constellation order is 2. M The QAM constellation chart includes: Build 2 M-2 A sub-QAM constellation diagram of a certain size; each constellation point in the sub-QAM constellation diagram is a shaped bit, and the shaped bit satisfies the Gray property; Flipping the sub-QAM constellation diagram along the boundary yields 2 M A QAM constellation diagram of a certain size; the QAM constellation diagram comprises 16 sub-regions; Each subregion of the QAM constellation diagram is assigned a symbol bit; the symbol bits are symmetrical along the axis.
3. The method according to claim 2, characterized in that, Also includes: Establish a coordinate system along the axes of the QAM constellation diagram; Calculate the Euclidean distance from each constellation point in the QAM constellation diagram to the origin; The Euclidean distance is used as the energy value of the constellation point.
4. The method according to claim 1, characterized in that, Also includes: Based on the constellation mapping diagram, the shaped decoding result is obtained using the following formula; in, Indicates precoding, This represents the equivalent noise.
5. The method according to claim 1, characterized in that, The channel coding expression includes: ； The expression for the checksum includes: ； Where D represents a register.
6. The method according to claim 1, characterized in that, The channel coding expression includes: ； The expression for the checksum includes: ； Where D represents a register.
7. A constellation mapping device, characterized in that, include: The QAM constellation diagram building module is configured to build constellations of order 2. M QAM constellation chart; The constellation points on the QAM constellation diagram consist of sign bits and shaped bits, and the constellation points satisfy the Gray property; M is an even number. A bit sequence construction module is configured to divide the bits to be transmitted into multiple bit sequences of size M-1; the bit sequence includes the high-order bits of the first bit and the low-order bits excluding the first bit. The mapping module is configured to sequentially map the bit sequence to constellation symbols to obtain a constellation mapping diagram corresponding to the bit to be transmitted; wherein the low-order bits and the shaped bits satisfy Gray mapping, and the high-order bits correspond to the symbol bits; Specifically, the mapping module is configured as follows: Based on the least significant bits in the bit sequence, determine the shaped bits that satisfy the Gray mapping; Based on the high-order bits and pre-coding in the bit sequence, multiple pre-symbol bits are obtained using the following formula; ； in, This refers to the high-order bits. This represents the checksum. Indicates precoding, Indicates channel coding; The pre-symbol bits are combined with the shaped bits to determine multiple pre-constellation points; The pre-constellation point with the lowest energy value is taken as the target constellation point, and the corresponding pre-coded value is determined as the target input value; The bit sequence is mapped to constellation symbols based on the target constellation points.
8. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that, When the processor executes the program, it implements the method as described in any one of claims 1 to 6.
9. A non-transitory computer-readable storage medium storing computer instructions, characterized in that, The computer instructions are used to cause the computer to perform the method according to any one of claims 1 to 6.