CN115987745B - Low-complexity quadrature amplitude modulation cross constellation demapping method - Google Patents

Low-complexity quadrature amplitude modulation cross constellation demapping method Download PDF

Info

Publication number
CN115987745B
CN115987745B CN202211589513.1A CN202211589513A CN115987745B CN 115987745 B CN115987745 B CN 115987745B CN 202211589513 A CN202211589513 A CN 202211589513A CN 115987745 B CN115987745 B CN 115987745B
Authority
CN
China
Prior art keywords
constellation
region
llr
soft information
bit
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.)
Active
Application number
CN202211589513.1A
Other languages
Chinese (zh)
Other versions
CN115987745A (en
Inventor
刘荣科
卢正
田铠瑞
黄为豪
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beihang University
Original Assignee
Beihang University
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Beihang University filed Critical Beihang University
Priority to CN202211589513.1A priority Critical patent/CN115987745B/en
Publication of CN115987745A publication Critical patent/CN115987745A/en
Application granted granted Critical
Publication of CN115987745B publication Critical patent/CN115987745B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02DCLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00Reducing energy consumption in communication networks
    • Y02D30/70Reducing energy consumption in communication networks in wireless communication networks

Landscapes

  • Digital Transmission Methods That Use Modulated Carrier Waves (AREA)

Abstract

本发明提出一种低复杂度正交幅度调制十字星座解映射方法,此方法可以分为以下几个步骤:(1)星座图分割:依据星座点中各比特的0/1映射分布规律,将星座图分割为多个区域;(2)区域选择:对于接收调制符号中各比特的解调,仅选取星座图中的相关区域并使用符号的实部及虚部值计算软信息,极大缩小解映射星座点的选取范围;(3)近似拟合计算各比特的对数似然比:为了避免接收符号和标准星座点之间欧式距离的计算带来的高复杂度问题,采用线性函数分段拟合的方式计算各比特的软信息,保证性能损失可接受。本发明可有效降低硬件实现高阶QAM软解调的复杂度。

The present invention proposes a low-complexity orthogonal amplitude modulation cross constellation demapping method, which can be divided into the following steps: (1) constellation diagram segmentation: according to the 0/1 mapping distribution law of each bit in the constellation point, the constellation diagram is divided into multiple regions; (2) region selection: for the demodulation of each bit in the received modulation symbol, only the relevant region in the constellation diagram is selected and the real and imaginary values of the symbol are used to calculate the soft information, which greatly reduces the selection range of the demapping constellation point; (3) approximate fitting calculation of the log-likelihood ratio of each bit: in order to avoid the high complexity problem caused by the calculation of the Euclidean distance between the received symbol and the standard constellation point, the soft information of each bit is calculated by a linear function piecewise fitting method to ensure that the performance loss is acceptable. The present invention can effectively reduce the complexity of hardware implementation of high-order QAM soft demodulation.

Description

一种低复杂度正交幅度调制十字星座解映射方法A low-complexity quadrature amplitude modulation cross constellation demapping method

技术领域Technical Field

本发明属于通信技术领域,涉及一种正交幅度调制十字星座图的低复杂度解映射方法。The invention belongs to the technical field of communications and relates to a low-complexity demapping method for a quadrature amplitude modulation cross constellation diagram.

背景技术Background technique

高性能通信系统需要达到更高的信息传输速率和更低的功耗,有多种方式提升通信系统性能,其中数字调制技术可以使用有限的频带资源和较低的功耗提升信息传输速率。线性调制方式根据传输信号的变化要素分为振幅键控(ASK)、相移键控(PSK)和正交幅度调制(QAM),由于QAM可以使用更少的带宽实现更高的数据传输速率,所以高阶QAM广泛被现代通信标准采用,方形QAM星座图用于偶数阶QAM调制,共有2的偶数次方个星座点,十字QAM星座图用于奇数阶QAM调制,共有2的奇数次方个星座点,其中十字QAM是由长方形QAM星座图经部分旋转得到的,有更低的峰值和平均功率并且可以提高解调性能,但在解映射时相比于方形和长方形QAM却带来了计算复杂度的提升。当QAM采用较高阶调制时需要配合信道编译码技术减小信道噪声的影响,因此解映射的输出应为软信息值(一般采用对数似然比LLR)表征发送比特的可靠性度量,所以称之为软解调。High-performance communication systems need to achieve higher information transmission rates and lower power consumption. There are many ways to improve the performance of communication systems. Among them, digital modulation technology can use limited frequency band resources and lower power consumption to improve information transmission rates. Linear modulation methods are divided into amplitude keying (ASK), phase shift keying (PSK) and quadrature amplitude modulation (QAM) according to the changing elements of the transmission signal. Since QAM can use less bandwidth to achieve higher data transmission rates, high-order QAM is widely adopted by modern communication standards. The square QAM constellation diagram is used for even-order QAM modulation, with a total of 2 even-power constellation points. The cross QAM constellation diagram is used for odd-order QAM modulation, with a total of 2 odd-power constellation points. The cross QAM is obtained by partially rotating the rectangular QAM constellation diagram. It has lower peak and average power and can improve demodulation performance, but it brings an increase in computational complexity compared to square and rectangular QAM during demapping. When QAM uses higher-order modulation, it needs to cooperate with channel coding technology to reduce the impact of channel noise. Therefore, the output of demapping should be a soft information value (generally using log-likelihood ratio LLR) to represent the reliability metric of the transmitted bit, so it is called soft demodulation.

目前有多种针对QAM的软解调算法,传统的基于Max-Log-MAP的近似方法(文献[1]:Viterbi,A.J.,“An Intuitive Justification and a Simplified Implementationof the MAP Decoder for Convolutional Codes,”IEEE Journal on Selected Areas inCommunications,vol.16,No.2,pp260–264,Feb.1998)虽然将e指数和对数运算用最大值函数(max)替代,但需要的乘法运算次数高且复杂度为O(2m)。基于边界的QAM低复杂度解映射方法(文献[2]:F.Tosato,P.Bisaglia.”Simplified soft-output demapper forbinaryinterleaved COFDM with application to HIPERLAN/2”.Proc.IEEEICC,vol.2,pp.664-668,2002)将星座图分解为I路和Q路两个子集,在各子集内依据标准星座点的取值分别划界,用一维坐标之间的距离代替二维坐标点之间的距离,并在计算各比特的LLR时根据接收到的符号采用折线近似的方法,将Max-Log-MAP中非线性运算转换为线性运算,降低整实现体复杂度,但目前此方法只应用于方形QAM中。适用于G.HN的十字星座QAM解映射算法(文献[3]:徐娟,姚如贵,南花妮,高凡琪.G.HN标准中十字星座QAM低复杂度解映射算法[J].哈尔滨工业大学学报,2015,47(05):110-117.)用贡献权值衡量标准星座点对解映射的贡献,缩小解映射的搜索范围降低实现复杂度。There are currently a variety of soft demodulation algorithms for QAM. The traditional approximate method based on Max-Log-MAP (reference [1]: Viterbi, AJ, "An Intuitive Justification and a Simplified Implementation of the MAP Decoder for Convolutional Codes," IEEE Journal on Selected Areas in Communications, vol. 16, No. 2, pp 260–264, Feb. 1998) replaces the e-exponential and logarithmic operations with the maximum function (max), but requires a high number of multiplication operations and has a complexity of O(2 m ). The boundary-based low-complexity demapping method for QAM (reference [2]: F. Tosato, P. Bisaglia. "Simplified soft-output demapper for binary interleaved COFDM with application to HIPERLAN/2". Proc. IEEE ICC, vol. 2, pp. 664-668, 2002) decomposes the constellation diagram into two subsets, the I path and the Q path. Within each subset, boundaries are drawn according to the values of the standard constellation points. The distance between the two-dimensional coordinate points is replaced by the distance between the one-dimensional coordinates. When calculating the LLR of each bit, the broken line approximation method is used according to the received symbol. The nonlinear operation in Max-Log-MAP is converted into a linear operation to reduce the overall complexity. However, this method is currently only applied to square QAM. The cross constellation QAM demapping algorithm suitable for G.HN (Reference [3]: Xu Juan, Yao Rugui, Nan Hua Ni, Gao Fanqi. Low-complexity demapping algorithm for cross constellation QAM in G.HN standard [J]. Journal of Harbin Institute of Technology, 2015, 47(05): 110-117.) uses contribution weights to measure the contribution of standard constellation points to demapping, narrows the demapping search range and reduces the implementation complexity.

上述[1]需要较多乘法运算,不利于基于现场可编程门阵列电路(FPGA)或专用集成电路(ASIC)的硬件电路实现,[2]虽然极大简化了计算次数和复杂度,但没有在十字星座图上采用的先例,[3]可以达到与[1]一致的性能,但是需要根据信道噪声条件选取合适的搜索范围并多次进行乘法运算,对于低复杂度的硬件实现仍有一定难度。The above [1] requires a large number of multiplication operations, which is not conducive to hardware circuit implementation based on field programmable gate array circuits (FPGA) or application-specific integrated circuits (ASIC). Although [2] greatly simplifies the number and complexity of calculations, there is no precedent for its use on a cross constellation diagram. [3] can achieve the same performance as [1], but it is necessary to select a suitable search range according to the channel noise conditions and perform multiplication operations multiple times, which is still difficult for low-complexity hardware implementation.

发明内容Summary of the invention

本发明针对上述问题,提出了一种可用于正交幅度调制(QAM)十字星座软解调的低复杂度算法,此算法可以分为以下几个主要步骤:(1)星座图分割:依据星座点中各比特的0/1映射分布规律,将星座图分割为多个区域;(2)区域选择:对于接收调制符号中各比特的解调,仅选取星座图中的相关区域并使用符号的实部及虚部值计算软信息,极大缩小解映射星座点的选取范围;(3)近似拟合计算各比特的对数似然比:为了避免接收符号和标准星座点之间欧式距离的计算带来的高复杂度问题(在硬件设计中会引入较多复杂乘法操作),采用线性函数分段拟合的方式计算各比特的软信息,保证性能损失可接受。本发明可有效降低硬件实现高阶QAM软解调的复杂度。In view of the above problems, the present invention proposes a low-complexity algorithm that can be used for orthogonal amplitude modulation (QAM) cross constellation soft demodulation. The algorithm can be divided into the following main steps: (1) Constellation diagram segmentation: According to the 0/1 mapping distribution law of each bit in the constellation point, the constellation diagram is divided into multiple regions; (2) Region selection: For the demodulation of each bit in the received modulation symbol, only the relevant region in the constellation diagram is selected and the real and imaginary values of the symbol are used to calculate the soft information, which greatly reduces the selection range of the demapping constellation point; (3) Approximate fitting calculation of the log-likelihood ratio of each bit: In order to avoid the high complexity problem caused by the calculation of the Euclidean distance between the received symbol and the standard constellation point (more complex multiplication operations will be introduced in the hardware design), the soft information of each bit is calculated by using a linear function piecewise fitting method to ensure that the performance loss is acceptable. The present invention can effectively reduce the complexity of hardware implementation of high-order QAM soft demodulation.

本发明的具体步骤为:The specific steps of the present invention are:

步骤1:星座图分割,即依据星座图中每比特为0和1的分布规律,将所有星座点划分为多个子区域,每个子区域中计算软信息值的方法相同。Step 1: Constellation diagram segmentation, that is, according to the distribution law of 0 and 1 in each bit of the constellation diagram, all constellation points are divided into multiple sub-areas, and the method for calculating the soft information value in each sub-area is the same.

星座图中每个符号承载m比特信息的QAM调制表示为2m-ary QAM,本发明的考虑范畴是当m为奇数时的十字星座图,为增大汉明距离,标准星座图采用格雷(Gray)映射方式等间距排列在同相分量(I路)和正交分量(Q路)上,可分别得到标准星座图中每个比特位置的0和1分布规律。The QAM modulation in which each symbol in the constellation diagram carries m bits of information is represented as 2 m -ary QAM. The scope of consideration of the present invention is the cross constellation diagram when m is an odd number. In order to increase the Hamming distance, the standard constellation diagram adopts Gray mapping to arrange the in-phase component (I path) and the orthogonal component (Q path) at equal intervals, and the distribution rules of 0 and 1 of each bit position in the standard constellation diagram can be obtained respectively.

较为准确的软解调LLR计算采用MAP算法,计算第bi比特软信息的定义为:A more accurate soft demodulation LLR calculation uses the MAP algorithm, and the definition of calculating the b i- th bit soft information is:

其中,σ2为信道噪声方差,接收到的带噪符号Z=x+jy在复平面的坐标表示为(x,y),标准星座图中符号点为s=sx+jsy,其复平面上的坐标表示为(sx,sy),S0和S1分别代表当前bi比特位置在标准星座图中为0和1的点集合,即集合S0中的符号在bi比特位置上为0,S1中的符号在bi比特位置上为1,上式最后表明,计算bi位置的软信息,只需考虑接收符号与最相邻的0和1符号之间的欧氏距离即可,而不是标准星座图中所有的星座点。Among them, σ 2 is the channel noise variance, the coordinates of the received noisy symbol Z = x + jy in the complex plane are expressed as (x, y), the symbol point in the standard constellation diagram is s = s x + js y , and its coordinates on the complex plane are expressed as (s x , sy ), S 0 and S 1 represent the point sets whose current bi bit position is 0 and 1 in the standard constellation diagram, respectively, that is, the symbol in set S 0 is 0 at the bi bit position, and the symbol in set S 1 is 1 at the bi bit position. The above formula finally shows that to calculate the soft information of the bi position, it is only necessary to consider the Euclidean distance between the received symbol and the most adjacent 0 and 1 symbols, rather than all the constellation points in the standard constellation diagram.

步骤1.1:对于十字星座图解映射首先需要找到标准星座图中所有比特位置0和1之间的分界。Step 1.1: For the cross constellation mapping, we first need to find the boundaries between all bit positions 0 and 1 in the standard constellation.

步骤1.2:分别找到与接收符号中各比特位置距离最近的边界,判断接收符号到最近0和1符号的欧氏距离与同相分量或正交分量的关系。将有相同关系的位置集合划为同一区域,在区域内采用相同的运算计算软信息值。Step 1.2: Find the nearest boundary to each bit position in the received symbol, and determine the relationship between the Euclidean distance from the received symbol to the nearest 0 and 1 symbol and the in-phase component or orthogonal component. The set of positions with the same relationship is divided into the same area, and the same operation is used to calculate the soft information value in the area.

步骤2:区域选择,即根据接收到的带噪符号Z在星座图上的位置,将其划归到步骤1的子区域中。Step 2: Region selection, that is, classifying the received noisy symbol Z into the sub-region of step 1 according to its position on the constellation diagram.

接收符号坐标(x,y)由于包含噪声,相对于标准星座图中点的坐标(sx,sy)会产生一定偏移,sx∈{±A,±3A,±5A,±7A,±9A,...},同理sy∈{±A,±3A,±5A,±7A,±9A,...},其中A为归一化因子。对接收的符号Z软解调时,(x,y)可唯一确定并选择步骤1中的区域并进行步骤3中相应的运算,大部分区域的软信息计算只与同相分量或正交分量相关,极少数区域会与两种分量都相关。Since the received symbol coordinates (x, y) contain noise, they will have a certain offset relative to the coordinates of the points in the standard constellation diagram (s x , s y ), s x ∈{±A,±3A,±5A,±7A,±9A,...}, and similarly s y ∈{±A,±3A,±5A,±7A,±9A,...}, where A is the normalization factor. When the received symbol Z is soft-demodulated, (x, y) can uniquely determine and select the area in step 1 and perform the corresponding operation in step 3. The soft information calculation of most areas is only related to the in-phase component or the orthogonal component, and very few areas are related to both components.

步骤3:近似拟合计算各比特的对数似然比,即基于线性函数分段拟合的方法,对每个子区域各位置的LLR进行近似,使用拟合值替代精确值。Step 3: Approximate fitting is used to calculate the log-likelihood ratio of each bit, that is, based on the linear function piecewise fitting method, the LLR of each position in each sub-region is approximated, and the fitting value is used instead of the exact value.

公式(1)提供了较为精确的计算LLR的方法,但当某比特的软信息只与同相或正交分量相关时可以进一步简化,这里以同相分量的运算为例:Formula (1) provides a relatively accurate method for calculating LLR. However, it can be further simplified when the soft information of a certain bit is only related to the in-phase or orthogonal component. Here, the calculation of the in-phase component is taken as an example:

其中,x为接收符号的同相分量,sx1和sx0分别为集合S1和S0中与x距离最近的符号同相分量值,绝对数值为归一化因子A的整数倍,最后一个等号后系数在相同星座图和信道条件下始终为常数,对软解调性能没有影响,所以可以忽略。因为x所在区域变化时sx1和sx0也随之改变,所以需要使用一种硬件友好的方法根据接收的x值由式(2)计算出比特bi的软信息,这里采用基于线性函数分段拟合的方法近似精确LLR,即首先在步骤2的各区域中均匀选取各点计算式(2)的结果,之后用线性函数进行拟合替代,就可以将复杂的多比特乘法转换为加减操作,利于硬件实现。Where x is the in-phase component of the received symbol, sx1 and sx0 are the in-phase component values of the symbol closest to x in the sets S1 and S0 , respectively. The absolute value is an integer multiple of the normalization factor A. The coefficient after the last equal sign is Under the same constellation diagram and channel conditions, it is always a constant and has no effect on the soft demodulation performance, so it can be ignored. Because s x1 and s x0 also change when the region where x is located changes, a hardware-friendly method is needed to calculate the soft information of bit b i according to the received x value by equation (2). Here, a method based on piecewise fitting of a linear function is used to approximate the precise LLR, that is, first, each point is uniformly selected in each region of step 2 to calculate the result of equation (2), and then a linear function is used for fitting instead, so that the complex multi-bit multiplication can be converted into addition and subtraction operations, which is conducive to hardware implementation.

本发明的优点及有益效果在于:The advantages and beneficial effects of the present invention are:

本发明将近似拟合的方法应用于正交幅度调制(QAM)十字星座的解调上,依据星座图上各比特位置的软信息计算与同相分量或正交分量的关系,将标准星座图进行区域划分,并使用线性函数分段拟合的方法匹配相应的软信息运算,极大降低了由于计算精确欧氏距离和较大搜索范围引入的硬件复杂度。The present invention applies the approximate fitting method to the demodulation of the quadrature amplitude modulation (QAM) cross constellation, divides the standard constellation into regions according to the relationship between the soft information calculation of each bit position on the constellation diagram and the in-phase component or the orthogonal component, and uses the linear function piecewise fitting method to match the corresponding soft information operation, which greatly reduces the hardware complexity introduced by calculating the precise Euclidean distance and the large search range.

附图说明BRIEF DESCRIPTION OF THE DRAWINGS

图1为采用格雷映射的128-QAM十字星座图示意图。FIG1 is a schematic diagram of a 128-QAM cross constellation diagram using Gray mapping.

图2为128-QAM星座中b0比特(最高位比特)的星座图区域划分示意图。FIG2 is a schematic diagram of the constellation diagram area division of the b 0 bit (most significant bit) in the 128-QAM constellation.

图3为128-QAM星座中b0比特软信息近似拟合示意图。FIG3 is a schematic diagram of the approximate fitting of b 0- bit soft information in a 128-QAM constellation.

图4为128-QAM星座中b1比特的星座图区域划分示意图。FIG4 is a schematic diagram of the region division of the constellation diagram of b 1 bit in the 128-QAM constellation.

图5为128-QAM星座中b1比特软信息近似拟合示意图。(A区域)Figure 5 is a schematic diagram of the approximate fitting of b 1- bit soft information in the 128-QAM constellation. (Area A)

图6为128-QAM星座中b2比特的星座图区域划分示意图。FIG6 is a schematic diagram of the region division of the constellation diagram of b 2 bits in the 128-QAM constellation.

图7为128-QAM星座中b2比特D区域软信息平方项近似方法示意图。FIG7 is a schematic diagram of a method for approximating the square term of soft information in the b 2- bit D region in a 128-QAM constellation.

图8为128-QAM星座中b3比特的星座图区域划分示意图。FIG8 is a schematic diagram of the region division of the constellation diagram of b 3 bits in the 128-QAM constellation.

图9为128-QAM星座中b3比特软信息近似拟合示意图。FIG9 is a schematic diagram of the approximate fitting of b 3- bit soft information in a 128-QAM constellation.

图10为128-QAM星座中b4比特的星座图区域划分示意图。FIG10 is a schematic diagram of the region division of the constellation diagram of b 4 bits in the 128-QAM constellation.

图11为128-QAM星座中b4比特软信息近似拟合示意图。FIG11 is a schematic diagram showing the approximate fitting of b 4- bit soft information in a 128-QAM constellation.

图12为128-QAM星座中b5比特的星座图区域划分示意图。FIG12 is a schematic diagram showing the region division of the constellation diagram of b 5 bits in the 128-QAM constellation.

图13为128-QAM星座中b5比特软信息近似拟合示意图。(A区域)Figure 13 is a schematic diagram of the approximate fitting of b 5- bit soft information in the 128-QAM constellation. (Area A)

图14为128-QAM星座中b6比特(最低位比特)的星座图区域划分示意图。FIG14 is a schematic diagram showing the region division of the constellation diagram of b 6 bits (least significant bit) in the 128-QAM constellation.

图15为128-QAM星座中b6比特软信息近似拟合示意图。FIG15 is a schematic diagram showing the approximate fitting of b 6- bit soft information in a 128-QAM constellation.

具体实施方式Detailed ways

下面以128-QAM十字星座调制为例,结合附图和实施示例对本发明进行详细说明。The present invention is described in detail below by taking 128-QAM cross constellation modulation as an example in combination with the accompanying drawings and implementation examples.

图1是本实施例采用的格雷映射方式设计的128-QAM星座图,图中共128个星座点,每个星座点代表7bit信息为{b0,b1,…,b6},其中b0为最高有效位(MSB),b6为最低有效位(LSB),各星座点以十字形均匀排列,I路方向和Q路方向相邻星座点之间距离为2A。下面基于上述步骤1~3依次分析b0~b6各比特位置的星座图区域划分方法以及软信息近似拟合计算方法。FIG1 is a 128-QAM constellation diagram designed by the Gray mapping method adopted in this embodiment. There are 128 constellation points in total in the figure, each constellation point represents 7 bits of information {b 0 , b 1 , ..., b 6 }, where b 0 is the most significant bit (MSB), b 6 is the least significant bit (LSB), and each constellation point is evenly arranged in a cross shape, and the distance between adjacent constellation points in the I-path direction and the Q-path direction is 2A. Based on the above steps 1 to 3, the constellation diagram area division method and the soft information approximate fitting calculation method for each bit position of b 0 to b 6 are analyzed in turn below.

步骤1:星座图分割。仅关注b0的0和1情况时,图2为128-QAM星座中b0比特位置的星座图区域划分示意图,图中除4个顶点无星座点外,Q轴左侧深色区域b0=1,Q轴右侧浅色区域b0=0。Step 1: Constellation diagram segmentation. When only focusing on the 0 and 1 cases of b0 , FIG2 is a schematic diagram of the constellation diagram area division of the b0 bit position in the 128-QAM constellation. In the figure, except for the 4 vertices without constellation points, the dark area on the left side of the Q axis is b0 = 1, and the light area on the right side of the Q axis is b0 = 0.

步骤2:区域选择。可以看出当接收符号(x,y)时,b0比特的软信息只与同相分量x有关,将接收的x值和相应的sx1和sx0代入公式(2)中即可计算出准确的b0比特的LLR,但为了进一步简化,这里按照近似运算的类型将星座图进一步划分,如图中双实线所示划分为Aarea和B area两个区域且满足{Aarea:|y|≤8A∪|x|>|y|}和{Barea:|y|>8A∩|x|≤|y|},两区域的主要区别在于当|x|>8A时选择最近的sx1和sx0方式不同,具体两区域在不同的x范围下sx1和sx0选取及根据公式(2)的LLR计算值如表格1和2所示。但过多分段会带来硬件额外选择器及比较器的消耗,所以这里根据x取值范围区间和LLR的关系采用线性拟合的方法得到统一的计算表达式。Step 2: Region selection. It can be seen that when receiving the symbol (x, y), the soft information of the b0 bit is only related to the in-phase component x. Substituting the received x value and the corresponding sx1 and sx0 into formula (2) can calculate the accurate LLR of the b0 bit. However, in order to further simplify, the constellation diagram is further divided according to the type of approximate operation. As shown by the double solid lines in the figure, it is divided into two areas, Aarea and B area, and satisfies {Aarea:|y|≤8A∪|x|>|y|} and {Barea:|y|>8A∩|x|≤|y|}. The main difference between the two areas is that when |x|>8A, the nearest sx1 and sx0 are selected in different ways. The specific selection of sx1 and sx0 in different x ranges and the LLR calculation values according to formula (2) are shown in Tables 1 and 2. However, too many segments will lead to the consumption of additional hardware selectors and comparators. Therefore, a linear fitting method is used here to obtain a unified calculation expression based on the relationship between the x value range and LLR.

表1 A area各段LLR计算结果Table 1 LLR calculation results for each segment of A area

x范围区间x range interval sx1 s x1 sx0 x0 LLR(忽略系数项)LLR (ignore coefficient terms) x<-10Ax<-10A AA -11A-11A -6(x+5A)-6(x+5A) -10A≤x<-8A-10A≤x<-8A AA -9A-9A -5(x+4A)-5(x+4A) -8A≤x<-6A-8A≤x<-6A AA -7A-7A -4(x+3A)-4(x+3A) -6A≤x<-4A-6A≤x<-4A AA -5A-5A -3(x+2A)-3(x+2A) -4A≤x<-2A-4A≤x<-2A AA -3A-3A -2(x+A)-2(x+A) -2A≤x<0-2A≤x<0 AA -A-A -x-x 0≤x<2A0≤x<2A AA -A-A -x-x 2A≤x<4A2A≤x<4A 3A3A -A-A -2(x-A)-2(x-A) 4A≤x<6A4A≤x<6A 5A5A -A-A -3(x-2A)-3(x-2A) 6A≤x<8A6A≤x<8A 7A7A -A-A -4(x-3A)-4(x-3A) 8A≤x<10A8A≤x<10A 9A9A -A-A -5(x-4A)-5(x-4A) X≥10AX≥10A 11A11A -A-A -6(x-5A)-6(x-5A)

表2 B area各段LLR计算结果Table 2 LLR calculation results for each segment of B area

x范围区间x range interval sx1 s x1 sx0 x0 LLR(忽略系数项)LLR (ignore coefficient terms) x<-6Ax<-6A AA -7A-7A -4(x+3A)-4(x+3A) -6A≤x<-4A-6A≤x<-4A AA -5A-5A -3(x+2A)-3(x+2A) -4A≤x<-2A-4A≤x<-2A AA -3A-3A -2(x+A)-2(x+A) -2A≤x<0-2A≤x<0 AA -A-A -x-x 0≤x<2A0≤x<2A AA -A-A -x-x 2A≤x<4A2A≤x<4A 3A3A -A-A -2(x-A)-2(x-A) 4A≤x<6A4A≤x<6A 5A5A -A-A -3(x-2A)-3(x-2A) X≥6AX≥6A 7A7A -A-A -4(x-3A)-4(x-3A)

步骤3:近似拟合计算各比特的对数似然比。图3为b0比特各段软信息近似拟合示意图,图中横轴为接收符号同相分量x值除以归一化因子A后的度量,纵轴为软信息LLR的计算结果,圆圈代表当x位于区域A中对应表格1的LLR计算结果,菱形代表当x位于区域B中对应表格2的LLR计算结果,两者十分贴近并且在|x|较小时重合,所以可以考虑用相同的近似公式代表A和B两区域的LLR计算,如图3中虚线所示,近似表达式为:Step 3: Approximate fitting to calculate the log-likelihood ratio of each bit. Figure 3 is a schematic diagram of the approximate fitting of each segment of soft information of the b0 bit. The horizontal axis in the figure is the metric after the in-phase component x value of the received symbol is divided by the normalization factor A, and the vertical axis is the calculation result of the soft information LLR. The circle represents the LLR calculation result corresponding to Table 1 when x is located in area A, and the diamond represents the LLR calculation result corresponding to Table 2 when x is located in area B. The two are very close and overlap when |x| is small, so the same approximate formula can be considered to represent the LLR calculation of areas A and B, as shown by the dotted line in Figure 3. The approximate expression is:

LLR(b0)=-x(3)LLR(b 0 )=-x(3)

虽然当|x|较大时拟合结果与实际计算结果仍有一定差距,但仿真表明对解调性能并无较大损失。Although there is still a certain gap between the fitting results and the actual calculation results when |x| is large, the simulation shows that there is no significant loss in demodulation performance.

b1~b6比特位置分别采用相同的步骤1~3进行星座图划分、区域选择和拟合,下文不再重复阐述步骤本身,而是从不同比特位置的角度依次说明图划分和拟合结果:The same steps 1 to 3 are used for constellation diagram division, region selection and fitting at the bit positions b1 to b6 . The following will not repeat the steps themselves, but will explain the diagram division and fitting results from the perspective of different bit positions:

图4为128-QAM星座中b1比特位置的星座图区域划分示意图,此时中间64个星座点b1=1,其余b1=0。按照相同的处理思路,根据接收符号(x,y)所在位置,判断在计算LLR(b1)时与同相和正交分量的关系,将星座图划分为图中区域A和区域B,其中区域A分为上下两部分满足{Aarea:|x|≤|y|},接收符号与最相邻的sy1和sy0之间的距离仅与正交分量y有关,区域B分为左右两部分满足{Barea:|x|>|y|},接收符号与最相邻的sx1和sx0之间的距离仅与同相分量x有关,公式(2)可对应区域B的LLR计算方法,将x,sx1和sx0替换为y,sy1和sy0即可计算区域A的LLR。图5为A区域中b1比特软信息近似拟合示意图,圆圈为按照前述方法所得的区域A中各段LLR计算结果,拟合后可得分段函数|y|-8A如虚线所示,结合区域B中对同相分量的拟合计算,可得b1比特软信息计算方式为:FIG4 is a schematic diagram of the constellation region division at the b1 bit position in the 128-QAM constellation. At this time, the middle 64 constellation points b1 = 1, and the rest b1 = 0. According to the same processing idea, according to the position of the received symbol (x, y), the relationship with the in-phase and orthogonal components when calculating LLR ( b1 ) is determined, and the constellation is divided into region A and region B in the figure, where region A is divided into upper and lower parts to satisfy {Aarea:|x|≤|y|}, and the distance between the received symbol and the most adjacent sy1 and sy0 is only related to the orthogonal component y. Region B is divided into left and right parts to satisfy {Barea:|x|>|y|}, and the distance between the received symbol and the most adjacent sx1 and sx0 is only related to the in-phase component x. Formula (2) can correspond to the LLR calculation method of region B. Replace x, sx1 and sx0 with y, sy1 and sy0 to calculate the LLR of region A. FIG5 is a schematic diagram of the approximate fitting of b 1- bit soft information in region A. The circles are the LLR calculation results of each segment in region A obtained according to the above method. After fitting, the piecewise function |y|-8A can be obtained as shown by the dotted line. Combined with the fitting calculation of the in-phase component in region B, the calculation method of b 1- bit soft information can be obtained as follows:

图6为b2比特的星座图区域划分示意图,因为b2=0和b2=1的边界并未贯穿整个I轴或Q轴,所以区域的划分较为复杂,分为A~E共5个区域并且每个象限内的位置分布相同。对于接收到符号(x,y),星座图中心区域A的范围满足{Aarea:(|y|≤8A∩|y|≤(-|x|+12A))∪|y|≤4A},区域内中间星座点为b2=0,左右两侧星座点b2=1,所以此区域内的软信息只与同相分量相关。类似于b1比特软信息计算方法,b2比特区域A的软信息可近似为Figure 6 is a schematic diagram of the region division of the b2- bit constellation diagram. Because the boundary between b2 = 0 and b2 = 1 does not run through the entire I axis or Q axis, the region division is relatively complex. It is divided into 5 regions from A to E, and the position distribution in each quadrant is the same. For the received symbol (x, y), the range of the central region A of the constellation diagram satisfies {Aarea: (|y|≤8A∩|y|≤(-|x|+12A))∪|y|≤4A}, the middle constellation point in the region is b2 = 0, and the constellation points on the left and right sides are b2 = 1, so the soft information in this region is only related to the in-phase component. Similar to the b1- bit soft information calculation method, the soft information of the b2 - bit region A can be approximated as

LLR(b2_A)=-|y|+4A (5)LLR(b 2 _A)=-|y|+4A (5)

区域B关于I和Q轴对称分布,其范围满足{Barea:4A≤|x|≤8A∩|y|>(-|x|+12A)},软信息只与正交分量有关,所以b2比特区域B的软信息可近似为Region B is symmetrically distributed about the I and Q axes, and its range satisfies {Barea:4A≤|x|≤8A∩|y|>(-|x|+12A)}. The soft information is only related to the orthogonal component, so the soft information of b2 - bit region B can be approximated as

LLR(b2_B)=|y|-8A (6)LLR(b 2 _B)=|y|-8A (6)

区域C满足{Carea:|x|>8A∩4A<|y|≤8A},其特点是每个象限内4个点b2=1且它们最相邻b2=0的点在斜对角的区域B内,所以为了减小计算软信息的误差这里需要同时考虑同相分量和正交分量,将区域C进一步划分为C1,C2,C3,C4共4种情况分别对应4个b2=1的点所在区域,各区域分别满足条件:Region C satisfies {Carea:|x|>8A∩4A<|y|≤8A}, and its characteristics are that the 4 points in each quadrant have b 2 =1 and their most adjacent points with b 2 =0 are in the diagonally opposite region B. Therefore, in order to reduce the error in calculating soft information, it is necessary to consider both the in-phase component and the orthogonal component. Region C is further divided into 4 cases, C1, C2, C3, and C4, which correspond to the regions where the 4 points with b 2 =1 are located. Each region satisfies the following conditions:

{C1area:|x|>10A∩|y|>6A∩|y|≤8A}{C1area:|x|>10A∩|y|>6A∩|y|≤8A}

{C2area:|x|>8A∩|x|≤10A∩|y|>6A∩|y|≤8A}{C2area:|x|>8A∩|x|≤10A∩|y|>6A∩|y|≤8A}

{C3area:|x|>10A∩|y|>4A∩|y|≤6A}{C3area:|x|>10A∩|y|>4A∩|y|≤6A}

{C4area:|x|>8A∩|x|≤10A∩|y|>4A∩|y|≤6A} (7){C4area:|x|>8A∩|x|≤10A∩|y|>4A∩|y|≤6A} (7)

它们的LLR计算在公式(2)的基础上拓展,这里以C1区域为例说明LLR的计算方法:Their LLR calculation is expanded on the basis of formula (2). Here, the C1 area is taken as an example to illustrate the calculation method of LLR:

省略相同的常数项可得:Omitting the same constant term yields:

LLR(b2_C1)=-2|x|+|y|+10A (9)LLR( b2_C1 )=-2|x|+|y|+10A (9)

同理可得区域C2,C3,C4的LLR计算方法,同样省略常数项:Similarly, the LLR calculation method for regions C2, C3, and C4 can be obtained, and the constant term is also omitted:

LLR(b2_C2)=-|x|+|y| (10)LLR( b2_C2 )=-|x|+|y| (10)

LLR(b2_C3)=-2|x|+2|y|+4A (11)LLR( b2_C3 )=-2|x|+2|y|+4A (11)

LLR(b2_C4)=-|x|+2|y|-6A (12)LLR( b2_C4 )=-|x|+2|y|-6A (12)

区域D位于星座图四角满足{Darea:|x|>8A∩|y|>8A},区域内无有效星座点,当接收符号(x,y)在此区域范围内时距离最近的b2=1和b2=0的点(s1和s0)分别在区域C和区域B内,所以实际软信息与同相分量和正交分量都有关,但为了进一步简化计算复杂度,这里将(x,y)与s1的距离只近似为和正交分量y相关,(x,y)与s0的距离只近似为和同相分量x相关,具体软信息计算公式为:Region D is located at the four corners of the constellation diagram and satisfies {Darea:|x|>8A∩|y|>8A}. There is no valid constellation point in the region. When the received symbol (x, y) is within this region, the nearest points ( s1 and s0 ) with b2 =1 and b2 =0 are in regions C and B respectively. Therefore, the actual soft information is related to both the in-phase component and the orthogonal component. However, in order to further simplify the computational complexity, the distance between (x, y) and s1 is approximated as only related to the orthogonal component y, and the distance between (x, y) and s0 is approximated as only related to the in-phase component x. The specific soft information calculation formula is:

上式中包含了x和y的平方项,对于硬件实现很不友好,图7为b2比特D区域中平方项近似方法示意图,x∈[-12A,-8A]∪[8A,12A],圆圈代表x2,虚线代表3.0861*|x|-2.348,所以对平方项降次进行较准确拟合,将此结论运用于式(13)中,并忽略常数项可得:The above formula contains the square terms of x and y, which is not very friendly to hardware implementation. Figure 7 is a schematic diagram of the square term approximation method in the b 2- bit D region, x∈[-12A,-8A]∪[8A,12A], the circle represents x 2 , and the dotted line represents 3.0861*|x|-2.348, so a more accurate fitting is performed on the square term reduction. This conclusion is applied to formula (13), and the constant term is ignored to obtain:

区域E满足{Earea:|x|<4A∩|y|>8A},每个象限内包含4个b2=0的点且它们最相邻b2=1的点在斜对角的区域A内,其软信息值与同相和正交分量都相关,与区域C的处理方式类似,将区域E进一步划分为E1,E2,E3,E4共4种情况分别对应4个b2=0的点所在区域,各区域分别满足条件:Region E satisfies {Earea:|x|<4A∩|y|>8A}. Each quadrant contains 4 points with b 2 =0 and their most adjacent points with b 2 =1 are in the diagonally opposite region A. Its soft information value is related to both the in-phase and quadrature components. Similar to the processing method of region C, region E is further divided into 4 cases, E1, E2, E3, and E4, which correspond to the regions where the 4 points with b 2 =0 are located. Each region satisfies the following conditions:

{E1area:|x|>2A∩|x|<4∩A|y|>10A}{E1area:|x|>2A∩|x|<4∩A|y|>10A}

{E2area:|x|>2A∩|x|<4A∩|y|>8A∩|y|≤10A}{E2area:|x|>2A∩|x|<4A∩|y|>8A∩|y|≤10A}

{E3area:|x|≤2A∩|y|>10A}{E3area:|x|≤2A∩|y|>10A}

{E4area:|x|≤2A∩|y|>8A∩|y|≤10A} (15){E4area:|x|≤2A∩|y|>8A∩|y|≤10A} (15)

参考(8)式的推导方式,这里直接给出区域E1~E4中的LLR计算方法:Referring to the derivation of formula (8), the LLR calculation method in regions E1 to E4 is directly given here:

LLR(b2_E1)=-|x|+2|y|-14A (16)LLR( b2_E1 )=-|x|+2|y|-14A (16)

LLR(b2_E2)=-|x|+|y|-4A (17)LLR( b2_E2 )=-|x|+|y|-4A (17)

LLR(b2_E3)=-2|x|+2|y|-12A (18)LLR( b2_E3 )=-2|x|+2|y|-12A (18)

LLR(b2_E4)=-2|x|+|y|-2A (19)LLR( b2_E4 )=-2|x|+|y|-2A (19)

图8为星座中b3比特的星座图区域划分示意图,图中I轴方向上b3=1和b3=0的区域交替分布,根据接收符号(x,y)所在位置,将星座图划分为图中区域A和区域B,与b0比特的划分方式完全相同,A和B区域的主要不同在于当|x|>8A且|y|>8A时最相邻的b3=1和b3=0的星座点选取不同,为了硬件实现方便在计算LLR(b3)时可以只考虑同相分量x而忽略正交分量y。FIG8 is a schematic diagram of the regional division of the constellation diagram of the b 3 bit in the constellation. In the figure, the regions of b 3 =1 and b 3 =0 are alternately distributed in the I-axis direction. According to the position of the received symbol (x, y), the constellation diagram is divided into region A and region B in the figure, which is exactly the same as the division method of b 0 bit. The main difference between regions A and B is that when |x|>8A and |y|>8A, the most adjacent constellation points of b 3 =1 and b 3 =0 are selected differently. For the convenience of hardware implementation, only the in-phase component x can be considered when calculating LLR (b 3 ) and the orthogonal component y can be ignored.

图9为b3比特各段软信息近似拟合示意图,圆圈代表当x位于区域A中公式(2)的计算结果,菱形代表当x位于区域B中公式(2)的计算结果,可以看出当|x|≤8A时两区域的计算结果完全重合,而|x|>8A时有差异较大,所以采用不同的近似方式拟合两区域,图9中虚线和实线分别代表区域A和B的近似拟合结果,具体表达式为:FIG9 is a schematic diagram of the approximate fitting of each segment of the b 3- bit soft information. The circle represents the calculation result of formula (2) when x is located in region A, and the diamond represents the calculation result of formula (2) when x is located in region B. It can be seen that when |x|≤8A, the calculation results of the two regions completely overlap, while when |x|>8A, there is a large difference. Therefore, different approximate methods are used to fit the two regions. The dotted line and solid line in FIG9 represent the approximate fitting results of regions A and B respectively. The specific expression is:

图10为星座中b4比特的星座图区域划分示意图。图中除4个顶点无星座点外,I轴下方深色区域b4=1,I轴上方浅色区域b4=0,与b0比特的软信息计算恰好相反,b4比特的软信息只与正交分量y有关,所以相似的,按照图示分为A和B两个区域满足{Aarea:|x|≤8A∪|y|>|x|}和{Barea:|x|>8A∩|y|≤|x|},两区域的近似拟合示意图如图11所示,图中横轴为接收符号正交分量y值除以归一化因子A后的度量,纵轴为软信息LLR的计算结果,圆圈和菱形图例分别代表区域A和B使用公式(2)的计算结果,虚线为近似拟合的结果,拟合表达式为:FIG10 is a schematic diagram of the constellation diagram area division of b4 bits in the constellation. In the figure, except for the four vertices without constellation points, the dark area below the I axis is b4 = 1, and the light area above the I axis is b4 = 0. The calculation of the soft information of b0 bits is just the opposite. The soft information of b4 bits is only related to the orthogonal component y. Therefore, similarly, it is divided into two areas A and B according to the figure to satisfy {Aarea:|x|≤8A∪|y|>|x|} and {Barea:|x|>8A∩|y|≤|x|}. The schematic diagram of the approximate fitting of the two areas is shown in FIG11. In the figure, the horizontal axis is the metric after the orthogonal component y value of the received symbol is divided by the normalization factor A, and the vertical axis is the calculation result of the soft information LLR. The circle and diamond legends represent the calculation results of area A and B using formula (2), respectively. The dotted line is the result of the approximate fitting. The fitting expression is:

LLR(b4)=y (21)LLR(b 4 )=y (21)

图12为星座中b5比特的星座图区域划分示意图。依据接收符号(x,y)的位置,需要将整个星座图分为A,B,C三个区域,三个区域分别满足Figure 12 is a schematic diagram of the region division of the constellation diagram of b 5 bits in the constellation. According to the position of the received symbol (x, y), the entire constellation diagram needs to be divided into three regions: A, B, and C. The three regions meet

{Aarea:|x|<4A∩|y|≤-|x|+12A}{Aarea:|x|<4A∩|y|≤-|x|+12A}

{Barea:|x|≥4A∩(|y|≤8A∪|x|>|y|)}{Barea:|x|≥4A∩(|y|≤8A∪|x|>|y|)}

{Carea:|x|≤|y|∩|y|>-|x|+12A∩|y|>8A} (22){Carea:|x|≤|y|∩|y|>-|x|+12A∩|y|>8A} (22)

其中区域A和B的软信息计算仅与正交分量y相关,区域C的软信息计算仅与同相分量x相关。图13为b5比特区域A的软信息计算近似拟合示意图,图中横轴为接收符号正交分量y值除以归一化因子A后的度量,纵轴为软信息LLR的计算结果,圆圈代表使用公式(2)的计算结果,虚线为近似拟合的结果,区域A中的近似拟合表达式为:The soft information calculation of regions A and B is only related to the orthogonal component y, and the soft information calculation of region C is only related to the in-phase component x. Figure 13 is a schematic diagram of the approximate fitting of the soft information calculation of region A with 5 bits. The horizontal axis is the metric of the orthogonal component y value of the received symbol divided by the normalization factor A, and the vertical axis is the calculation result of the soft information LLR. The circles represent the calculation results using formula (2), and the dotted line is the result of the approximate fitting. The approximate fitting expression in region A is:

LLR(b5_A)=-||y|-6A|+2A (23)LLR(b 5 _A)=-||y|-6A|+2A (23)

同理省略证明可以得到区域B和C的近似拟合表达式为:Similarly, omitting the proof, we can get the approximate fitting expression of regions B and C as follows:

LLR(b5_B)=|y|-4A (24)LLR(b 5 _B)=|y|-4A (24)

LLR(b5_C)=|x|-4A (25)LLR(b 5 _C)=|x|-4A (25)

图14为128-QAM星座中b6比特(最低位比特)的星座图区域划分示意图。图中Q轴方向上b6=1和b6=0的区域交替分布,根据接收符号(x,y)所在位置,将星座图划分为图中区域A和区域B满足{Aarea:|x|≤8A∪|y|>|x|}和{Barea:|x|>8A∩|y|≤|x|},计算软信息时只需考虑正交分量y的值即可。图15为b6比特软信息近似拟合示意图,虚线和实线分别近似区域A和区域B的LLR计算结果,具体表达式为:FIG14 is a schematic diagram of the constellation region division of the b6 bit (least significant bit) in the 128-QAM constellation. In the figure, the regions with b6 = 1 and b6 = 0 in the Q-axis direction are alternately distributed. According to the location of the received symbol (x, y), the constellation is divided into regions A and B in the figure to satisfy {Aarea:|x|≤8A∪|y|>|x|} and {Barea:|x|>8A∩|y|≤|x|}. When calculating soft information, only the value of the orthogonal component y needs to be considered. FIG15 is a schematic diagram of the approximate fitting of the b6 bit soft information. The dotted line and the solid line respectively approximate the LLR calculation results of regions A and B. The specific expressions are:

Claims (7)

1. A128 quadrature amplitude modulation cross constellation demapping method is characterized by comprising the following specific steps:
Step 1: dividing the constellation diagram, namely dividing all constellation points into a plurality of subareas according to the distribution rule of 0 and 1 of each bit in the constellation diagram, wherein the method for calculating the soft information value in each subarea is the same;
step 2: region selection, namely classifying the received noisy symbols Z into the subregions of the step1 according to the positions of the noisy symbols Z on the constellation diagram;
Step 3: calculating soft information values of each bit by approximate fitting, namely, performing approximation on LLRs of each position of each sub-region based on a linear function piecewise fitting method, and replacing an accurate value by using a fitting value;
In step 1, the QAM modulation carried by m bits of information in each symbol in the constellation diagram is represented as 2 m -ary QAM, and when m is an odd number, the cross constellation diagram is used for increasing the hamming distance, the standard constellation diagram is arranged on the in-phase component I path and the quadrature component Q path at equal intervals in a Gray mapping mode, so as to obtain 0 and 1 distribution rules of each bit position in the standard constellation diagram;
The soft demodulation LLR calculation adopts MAP algorithm, and the definition of the soft information of the b i bit is calculated as follows:
Wherein σ 2 is the channel noise variance, the coordinates of the received noisy symbol z=x+jy on the complex plane are expressed as (x, y), the symbol points in the standard constellation are s=s x+jsy, the coordinates on the complex plane are expressed as (S x,sy),S0 and S 1 represent the point set of 0 and 1 in the standard constellation for the current b i bit position, respectively, i.e. the symbol in set S 0 is 0,S 1 at b i bit position and 1 at b i bit position, and the soft information at b i position is calculated by only considering the euclidean distance between the received symbol and the nearest 0 and 1 symbols, instead of all constellation points in the standard constellation;
In step 2, the received symbol coordinates (x, y) are offset by a certain amount from the coordinates (s x,sy) of the standard constellation points due to the noise, s x e { ±a, ±3A, ±5A, ±7A, ±9A,.+ -, and s y e { ±a, ±3A, ±5A, ±7A, ±9A,.} wherein a is a normalization factor; when the received symbol Z is in soft demodulation, (x, y) can uniquely determine and select the area in the step 1 and perform corresponding operation in the step 3, and soft information calculation of most areas is only related to in-phase components or quadrature components;
in step 3, when the soft information of a certain bit is related to only the in-phase or quadrature component, it is simplified as:
Wherein x is the in-phase component of the received symbol, S x1 and S x0 are the in-phase component values of the symbols closest to x in the sets S 1 and S 0, respectively, the absolute value is an integer multiple of the normalization factor A, and the last coefficient after the equal sign Constant is kept under the same constellation diagram and channel condition, and the soft demodulation performance is not influenced, so that the soft demodulation performance is ignored; because s x1 and s x0 also change when the area where x is located changes, soft information of bit b i needs to be calculated by equation (2) according to the received value of x, and a linear function piecewise fitting-based method is adopted to approximate accurate LLR, namely, firstly, the result of each point calculation equation (2) is uniformly selected in each area in step 2, then, linear function is used for approximate fitting substitution, complex multi-bit multiplication is converted into addition and subtraction operation, and hardware implementation is facilitated.
2. A 128 quadrature amplitude modulation cross constellation demapping method as in claim 1 wherein: the constellation region of b 1 bits is divided into: at this time, the middle 64 constellation points b 1 =1, and the rest b 1 =0; judging the relation between the received symbol (x, y) and the in-phase component and the quadrature component when calculating the LLR (B 1), dividing the constellation diagram into a region A and a region B, wherein the region A is divided into an upper part and a lower part to meet the requirements of { Aarea: |x|less than or equal to |y| } and the distance between the received symbol and the nearest s y1 and s y0 is only related to the quadrature component y, the region B is divided into a left part and a right part to meet the requirements of { Barea: |x| > |y| } and the distance between the received symbol and the nearest s x1 and s x0 is only related to the in-phase component x, and the LLR of the region A can be calculated by replacing x, s x1 and s x0 with y, s y1 and s y0; the segmentation function |y| -8A is obtained after approximate fitting, and the B 1 bit soft information is obtained by combining approximate fitting calculation of the in-phase component in the region B:
3. A 128 quadrature amplitude modulation cross constellation demapping method as in claim 1 wherein: the constellation region of b 2 bits is divided into: because the boundaries of b 2 =0 and b 2 =1 do not extend through the entire I-axis or Q-axis, the boundaries are divided into a to E total 5 areas and the position distribution in each quadrant is the same; for the received symbol (x, y), the range of the central area A of the constellation diagram satisfies { Aarea: (|y| is less than or equal to 8 A|y| is less than or equal to (- |x|+12A)) |y| is less than or equal to 4A }, the middle constellation point in the area is b 2 =0, the constellation points on the left and right sides are b 2 =1, so that the soft information in the area is only related to the in-phase component, and the soft information of the b 2 -bit area A is
LLR(b2_A)=-|x|+4A (5)
The region B is symmetrically distributed about the I and Q axes in a range of { Barea:4A.ltoreq.IxIΣ8AΣ.ltoreq.yI > (- |xI + 12A) }, the soft information is related to the orthogonal component only, so the soft information of the B 2 -bit region B is
LLR(b2_B)=|y|-8A (6)
The area C satisfies { Carea |x| > 8A n 4A < |y|.ltoreq.8A }, 4 points B 2 =1 in each quadrant and the points of the nearest neighbor B 2 =0 are in the diagonally opposite area B, the in-phase component and the quadrature component need to be considered simultaneously for reducing the error of calculating soft information, the area C is divided into areas where 4 points corresponding to 4B 2 =1 respectively in total 4 cases of C1, C2, C3 and C4 respectively satisfy the following conditions:
{C1area:|x|>10A∩|y|>6A∩|y|≤8A}
{C2area:|x|>8A∩|x|≤10A∩|y|>6A∩|y|≤8A}
{C3area:|x|>10A∩|y|>4A∩|y|≤6A}
{ C4area } (7) C1 region with |x| > 8 A|x|10 A|y| > 4 A|y|6A } (7) is:
Omitting the same constant term yields:
LLR(b2_C1)=-2|x|+|y|+10A (9)
the method for calculating LLR of C2, C3 and C4 also omits constant terms:
LLR(b2_C2)=-|x|+|y| (10)
LLR(b2_C3)=-2|x|+2|y|+4A (11)
LLR(b2_C4)=-|x|+2|y|-6A (12)
The area D is located at four corners of the constellation diagram and satisfies { Darea: |x| > 8A |y| > 8A }, no valid constellation points exist in the area, and when the received symbol (x, y) is within the area, the points (s 1 and s 0) of B 2 =1 and B 2 =0, which are closest to each other, are respectively in the area C and the area B, so that the actual soft information is related to both the in-phase component and the quadrature component, and in order to simplify the computational complexity, the distance between (x, y) and s 1 is only approximately related to the quadrature component y, and the distance between (x, y) and s 0 is only approximately related to the in-phase component x, and the specific soft information calculation formula is:
the square terms of x and y are contained in the formula, so that the method is not friendly to hardware implementation; fitting the square term reduction more accurately, applying the conclusion to the formula (13), and ignoring the constant term to obtain:
The area E satisfies { Earea |x| < 4A n|y| > 8A }, 4 points of b 2 =0 are contained in each quadrant, the points of the nearest neighboring b 2 =1 are in the diagonally opposite area A, the soft information value is related to in-phase and quadrature components, the area E is divided into areas where 4 points of b 2 =0 are respectively located in 4 cases of E1, E2, E3 and E4, and the conditions are respectively satisfied:
{E1area:|x|>2A∩|x|<4A∩|y|>10A}
{E2area:|x|>2A∩|x|<4A∩|y|>8A∩|y|≤10A}
{E3area:|x|≤2A∩|y|>10A}
{E4area:|x|≤2A∩|y|>8A∩|y|≤10A} (15)
referring to equation (8), the LLR calculation method in the regions E1 to E4 is directly given here:
LLR(b2_E1)=-|x|+2|y|-14A (16)
LLR(b2_E2)=-|x|+|y|-4A (17)
LLR(b2_E3)=-2|x|+2|y|-12A (18)
LLR(b2_E4)=-2|x|+|y|-2A (19)。
4. A 128 quadrature amplitude modulation cross constellation demapping method as in claim 1 wherein: the constellation region of b 3 bits is divided into: regions B 3 =1 and B 3 =0 in the I-axis direction are alternately distributed, a constellation diagram is divided into a region a and a region B according to the position of a received symbol (x, y), the division mode of the regions a and B is identical to that of the regions B 0 bits, the difference between the regions a and B is that when |x| >8A and |y| >8A, the constellation points of the nearest adjacent regions B 3 =1 and B 3 =0 are selected differently, and only the in-phase component x is considered and the quadrature component y is ignored when calculating an LLR (B 3) for hardware realization convenience;
when the value of the absolute value of x is less than or equal to 8A, the calculation results of the two areas are completely overlapped, and the difference of the absolute value of x is more than 8A, so that the two areas are fitted in different approximation modes, and the specific expression is as follows:
5. A 128 quadrature amplitude modulation cross constellation demapping method as in claim 1 wherein: the constellation region of b 4 bits is divided into: the region B 4 =1 below the I axis, the region B 4 =0 above the I axis, in contrast to the calculation of soft information of B 0 bits, the soft information of B 4 bits is related to the orthogonal component y only, and is divided into two regions A and B, which satisfy { Aarea: |x|less than or equal to 8 A|y| > |x| } and { Barea: |x| > 8 A|y|less than or equal to |x| } with the horizontal axis being the measurement of the division of the orthogonal component y value of the received symbol by the normalization factor A, and the vertical axis being the calculation result of the soft information LLR, the approximate fitting expression is:
LLR(b4)=y (21)。
6. A 128 quadrature amplitude modulation cross constellation demapping method as in claim 1 wherein: the constellation region of b 5 bits is divided into: according to the position of the received symbol (x, y), the whole constellation diagram needs to be divided into three areas A, B and C, and the three areas respectively satisfy the following conditions:
{Aarea:|x|<4A∩|y|≤-|x|+12A}
{Barea:|x|≥4A∩(|y|≤8A∪|x|>|y|)}
{Carea:|x|≤|y|∩|y|>-|x|+12A∩|y|>8A} (22)
Wherein the soft information computation of regions a and B is related to quadrature component y only, and the soft information computation of region C is related to in-phase component x only; the horizontal axis is the metric of the received symbol orthogonal component y divided by the normalization factor a, the vertical axis is the calculation result of the soft information LLR, and the approximate fit expression in the region a is:
LLR(b5_A)=-||y|-6A|+2A (23)
The approximate fit expression for regions B and C is:
LLR(b5_B)=|y|-4A (24)
LLR(b5_C)=|x|-4A (25)。
7. A 128 quadrature amplitude modulation cross constellation demapping method as in claim 1 wherein: the constellation region of b 6 bits is divided into: the regions B 6 =1 and B 6 =0 in the Q-axis direction are alternately distributed, and the constellation diagram is divided into the region a and the region B according to the position of the received symbol (x, y) so as to satisfy the following conditions
{ Aarea @ x @ is less than or equal to 8A @ y @ x @ and { Barea @ x @ is greater than 8A @ y @ x @ is less than or equal to 8A @ x @, the soft information is calculated by considering the value of the orthogonal component y; the specific expression of the LLR calculation result of the approximate region A and the region B is as follows:
CN202211589513.1A 2022-12-12 2022-12-12 Low-complexity quadrature amplitude modulation cross constellation demapping method Active CN115987745B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202211589513.1A CN115987745B (en) 2022-12-12 2022-12-12 Low-complexity quadrature amplitude modulation cross constellation demapping method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202211589513.1A CN115987745B (en) 2022-12-12 2022-12-12 Low-complexity quadrature amplitude modulation cross constellation demapping method

Publications (2)

Publication Number Publication Date
CN115987745A CN115987745A (en) 2023-04-18
CN115987745B true CN115987745B (en) 2024-05-28

Family

ID=85969161

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202211589513.1A Active CN115987745B (en) 2022-12-12 2022-12-12 Low-complexity quadrature amplitude modulation cross constellation demapping method

Country Status (1)

Country Link
CN (1) CN115987745B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116915570B (en) * 2023-08-03 2023-12-12 成都爱瑞无线科技有限公司 Soft demodulation method and device based on APSK modulation, communication equipment and storage medium

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2009135929A (en) * 2007-11-30 2009-06-18 Fujitsu Ltd Constellation simplification device, simplification method thereof and receiver
KR20110070682A (en) * 2009-12-18 2011-06-24 한국전자통신연구원 Soft-decision demapping method of digital signal
CN103701752A (en) * 2013-12-03 2014-04-02 长安大学 Low-complexity demapping algorithm for cross constellation QAM (Quadracture Amplitude Modulation) in G. HN (G. home Network) standard
US8718205B1 (en) * 2013-04-30 2014-05-06 Douglas Howard Morais Hard and soft bit demapping for QAM non-square constellations
CN105594175A (en) * 2014-08-20 2016-05-18 华为技术有限公司 Digital modulation method and device

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6834088B2 (en) * 2001-03-12 2004-12-21 Motorola, Inc. Method and apparatus for calculating bit log-likelihood ratios for QAM signals
GB2499270B (en) * 2012-06-07 2014-07-09 Imagination Tech Ltd Efficient demapping of constellations

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2009135929A (en) * 2007-11-30 2009-06-18 Fujitsu Ltd Constellation simplification device, simplification method thereof and receiver
KR20110070682A (en) * 2009-12-18 2011-06-24 한국전자통신연구원 Soft-decision demapping method of digital signal
US8718205B1 (en) * 2013-04-30 2014-05-06 Douglas Howard Morais Hard and soft bit demapping for QAM non-square constellations
CN103701752A (en) * 2013-12-03 2014-04-02 长安大学 Low-complexity demapping algorithm for cross constellation QAM (Quadracture Amplitude Modulation) in G. HN (G. home Network) standard
CN105594175A (en) * 2014-08-20 2016-05-18 华为技术有限公司 Digital modulation method and device
CN110266633A (en) * 2014-08-20 2019-09-20 华为技术有限公司 Digital modulation method and device

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
非方形QAM映射比特软信息计算方法;刘斌彬等;有线电视技术;20110620(第06期);第35-37页 *

Also Published As

Publication number Publication date
CN115987745A (en) 2023-04-18

Similar Documents

Publication Publication Date Title
Zöllner et al. Optimization of high-order non-uniform QAM constellations
WO2015125341A1 (en) Soft decision value generation apparatus and soft decision value generation method
ES2362759B1 (en) PROCEDURE AND DEVICE OF DIGITAL COMMUNICATIONS FOR THE RECEIPT OF DATA USING QAM SYMBOLS.
CN115987745B (en) Low-complexity quadrature amplitude modulation cross constellation demapping method
CN110995635B (en) A Simplified Demapping Method for High-Order APSK Modulation
CN110602012B (en) A low-complexity 16APSK demapping method and circuit
WO2018116411A1 (en) Modulation method, decoding method, modulation device and demodulation device
CN111277536A (en) DVB-S2X system soft demapping method, digital signal processing system
JP4497744B2 (en) Noise evaluation method and apparatus for turbo code and system using the same
US8503580B2 (en) Soft value generation using serial localization with indecision
US8457256B2 (en) Channel-adaptive likelihood determination
CN114465695B (en) Low-complexity soft demapping method suitable for irregular 128APSK
CN113364717B (en) 32APSK soft information calculation method suitable for DVBS2 modulation
CN117411596B (en) Demodulation method, demodulation device, storage medium and electronic equipment
CN111585698A (en) Multidimensional coding modulation method and decoding demodulation method
Hasan et al. Low complexity LLR metrics for polar coded QAM
Xue et al. √ M-best candidates based soft-demapper for rotated M-QAM constellation
CN110505359B (en) Non-uniform modulation and demodulation method, system, medium and terminal in wireless broadcast communication system
CN106101052B (en) Low-complexity 128APSK soft demapping method based on decision field
CN106534037A (en) Soft modulation method for high order modulation signals
Nguyen et al. Low complexity higher order QAM modulation for IDMA system
WO2017158725A1 (en) Log-likelihood ratio calculation circuit, reception apparatus, and log-likelihood ratio calculation method
CN111865867B (en) 256APSK modulation signal demodulation method, system and device
CN112104587A (en) 64QAM signal soft demodulation simplified algorithm
CN105162545B (en) Realize the QAM soft-decision system and methods of low complex degree high power efficiency

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