Disclosure of Invention
In view of the above, embodiments of the present invention provide a hybrid coding method based on sub-constellation space to obviate or ameliorate one or more of the disadvantages of the prior art.
An aspect of the present invention provides a hybrid coding method based on a sub-constellation space, the method comprising the steps of signal generation and signal reception demodulation:
The step of signal generation includes:
The method comprises the steps of generating bit information, adopting a bit distributor to separate the bit information into two paths of signals, respectively performing advanced FEC coding on the two paths of signals, namely adopting LDPC coding on bit data to form an X-polarized signal, adopting Polar coding on bit data to form a Y-polarized signal, and performing polarization multiplexing processing to obtain X-polarization and Y-polarization;
the step of signal reception demodulation includes:
the method comprises the steps of separating a signal into three parts of a 4D signal generated by X polarization, a 4D signal generated by Y polarization and a four-phase shift keying signal, carrying out hard judgment on the four-phase shift keying signal to obtain bit information of a carried mark bit, calculating the log likelihood ratio of each bit in the 4D signal generated by X polarization and the 4D signal generated by Y polarization, determining data of each bit based on the log likelihood ratio to obtain Y polarization of X polarization and amplitude translation, reducing the amplitude translation of the Y polarization of the amplitude translation based on the bit information obtained by demodulation of the four-phase shift keying signal to obtain Y polarization, demodulating and decoding the X polarization and the Y polarization, and outputting bit information.
By adopting the scheme, at a receiving end, the invention provides a multi-dimensional soft decision algorithm aiming at amplitude translation set segmentation, which is used for respectively carrying out bitwise decoding on data on X polarization and Y polarization. In the X polarization, the Euclidean distance can be directly calculated with a subset where a received symbol is located, namely constellation points in bit correlation dimension BRD, so as to obtain a log-likelihood ratio for decoding, in the Y polarization, each bit in two directions is decoded bit by bit according to the received sign bits in two directions of an in-phase component and a quadrature component, if the sign bit is 0, the decoding is carried out according to the log-likelihood ratio in the bit correlation dimension, and if the sign bit is 1, which bit is required to be changed according to Gray code mapping rules determined by a transmitting end, and the bit is reversed, so that the received signal point is translated back to the original position and then decoded in the bit correlation dimension. The algorithm has lower complexity, and has superior error rate performance due to the combination of probability amplitude shaping PAS and an integrated segmentation technology, and can be suitable for effectively decoding the translated encoded signal.
In some embodiments of the present invention, in the step of encoding two signals respectively and performing polarization multiplexing processing to obtain X-polarization and Y-polarization, LDPC encoding and Polar encoding are respectively applied to the two signals to compensate for the fact that the Y-polarization signal will have slightly worse effect than the X-polarization signal in subsequent processing.
In some embodiments of the present invention, the constellation points of the signals in each polarization are divided into a plurality of subsets, and in the step of performing constellation subset segmentation based on the signals of the X polarization and the Y polarization, the subsets to which the signals of the X polarization and the Y polarization belong are determined respectively. And combining the four subsets of each of the X polarization and the Y polarization according to the determined sub-family constraint condition to form a 4D sub-family.
In some embodiments of the present invention, in the step of determining whether to perform amplitude translation on the Y polarization based on the constellation segmentation result of the X polarization and the Y polarization, whether the sub-group formed by the subset of the X polarization and the Y polarization belongs to a combination corresponding to a preset sub-group constraint condition corresponding to the subset of the X polarization is determined based on the subset to which the X polarization belongs, if so, amplitude translation is not required, and if not, amplitude translation is performed on the Y polarization to a sub-group corresponding to the subset of the X polarization.
In some embodiments of the present invention, the output signal includes a quadrature phase shift keying signal, the Y polarization includes an in-phase component and a quadrature component (for the adopted 64QAM signal, each symbol carries 6 bits of information altogether, wherein the first 3 bits are in-phase component information and the last 3 bits are quadrature component information), in the step of outputting the output signal, if amplitude translation is not required, the bit information carried by the quadrature phase shift keying signal is 00, if amplitude translation is required and the in-phase component of the Y polarization is translated, the bit information carried by the quadrature phase shift keying signal is 10, if amplitude translation is required and the quadrature component of the Y polarization is translated, the bit information carried by the quadrature phase shift keying signal is 01, and if amplitude translation is required and the in-phase component and the quadrature component of the Y polarization are translated, the bit information carried by the quadrature phase shift keying signal is 11.
In some embodiments of the present invention, in the steps of calculating the log-likelihood ratio of each bit in the 4D signal generated by the X polarization and the 4D signal generated by the Y polarization, determining the data of each bit based on the log-likelihood ratio to obtain Y polarization of the X polarization and the amplitude translation, and restoring the amplitude translation of the Y polarization based on the bit data of the quadrature phase shift keying signal to obtain Y polarization, and further demodulating and decoding the X polarization and the Y polarization;
directly decoding to obtain bit information of a marker bit by adopting a hard decision mode when the quadrature phase shift keying signal is demodulated;
In the 4D signal generated by the X polarization, the Euclidean distance is directly calculated with the subset to obtain the log-likelihood ratio for decoding;
In the 4D signal generated by Y polarization, each bit in two directions is decoded bit by bit according to the received mark bits in two directions of the in-phase component and the quadrature component, namely, the two mark bits of the four-phase shift keying signal, if the mark bit is 0, the decoding is carried out according to the log likelihood ratio in the bit correlation dimension, and if the mark bit is 1, the bit which is changed in the symbol is determined according to the Gray code mapping rule determined by the transmitting end, and the bit is reversed and then decoded.
In some embodiments of the present invention, in the step of calculating the log likelihood ratio of each bit in the X-polarization generated 4D signal, the Y-polarization generated 4D signal, the log likelihood ratio of each bit is calculated according to the following formula:
Wherein, the Representing the log-likelihood ratio of the kth bit,Representing a standard constellation point with a k-th bit of 1,Represents a standard constellation point with a k-th bit of 0,Representing conditional probabilities.
In some embodiments of the present invention, in the step of calculating the log likelihood ratio of each bit in the X-polarization generated 4D signal and the Y-polarization generated 4D signal, the kth bit information in the received symbol is respectively calculated with a standard constellation point with the kth bit being 0) Comparing the Euclidean distance between them to obtain minimum value, and at the same time making them and standard constellation point whose k-th bit is 1#) Comparing the Euclidean distance between the two points, taking the minimum value, and calculating to obtainIn a gaussian channel, the formula for calculating the log-likelihood ratio is expressed as:
;
where y represents the received 4D signal, x represents the standard constellation point, Representing the log-likelihood ratio of the kth bit,Representing a standard constellation point with a k-th bit of 1,Represents a standard constellation point with a k-th bit of 0,Representing the variance characteristics of the gaussian channel itself,Representing the calculated total number of dimensions.
In some embodiments of the invention, the sub-family constraints are met due to the need to meet;
;
Wherein, the The sub-family constraint is represented by a sub-family constraint,Representing the dimensions j, y in the subfamily constraint, representing the received 4D signal, x representing the standard constellation point,Representation ofStandard constellation points with k-th bit i in each dimension,Representation ofStandard constellation points with k-th bit i satisfying the sub-family constraint in each dimension,Representation ofThe kth bit in the dimension that satisfies the j-th dimension subfamily constraint is the standard constellation point of i,Representing the sub-family, the subset to which the kth Bit belongs is referred to as the Bit-dependent dimension (Bit-RelatedDimension, BRD), m represents the dimension of the non-Bit-dependent dimension,Representing the calculated number of total dimensions,A 4D signal representing a non-bit dependent dimension,Standard constellation points representing non-bit dependent dimensions,A set of dimensions representing non-bit dependent dimensions,Representing the minimum euclidean distance in the bit dependent dimension.
In some embodiments of the present invention, the minimum Euclidean distance in the bit-dependent dimension is calculated according to the following formula:
When the dimension is the non-translated dimension or the case of tag bit=0 in the translated dimension, then:
When the dimension is the translation dimension and the sign bit=1, i.e. the symbol has amplitude translation, determining whether the bit is changed by using the gray coding rule determined by the transmitting end, if so, the data bit of the bit is opposite to the constellation point mapping bit, and consideration is needed at this timeAnd,Taking outAnd (3) withIs the minimum value of (2):
Wherein, the Is thatNot including
DerivingAfter that, in the same way,Can be expressed as:
Wherein the method comprises the steps of The set is:
Wherein, the Representing the minimum euclidean distance between the received signal and the standard constellation point for which the kth bit is i in the bit correlation dimension,Representing the minimum euclidean distance between the received signal and the standard constellation point for which k is 1-i in the bit correlation dimension,A set of dimensions representing bit-related dimensions in the SFC,A 4D signal representing the received bit-dependent dimension,Representing standard constellation points in the bit-dependent dimension.
The second aspect of the present invention also provides a hybrid codec device based on a sub-constellation space, the device comprising a computer apparatus comprising a processor and a memory, the memory having stored therein computer instructions for executing the computer instructions stored in the memory, the device implementing the steps of the method as described above when the computer instructions are executed by the processor.
The third aspect of the present invention also provides a computer readable storage medium having stored thereon a computer program which, when executed by a processor, performs the steps performed by the aforementioned hybrid coding method under sub-constellation space.
Additional advantages, objects, and features of the invention will be set forth in part in the description which follows and in part will become apparent to those having ordinary skill in the art upon examination of the following or may be learned from practice of the invention. The objectives and other advantages of the invention may be realized and attained by the structure particularly pointed out in the written description and drawings.
It will be appreciated by those skilled in the art that the objects and advantages that can be achieved with the present invention are not limited to the above-described specific ones, and that the above and other objects that can be achieved with the present invention will be more clearly understood from the following detailed description.
Detailed Description
The present invention will be described in further detail with reference to the following embodiments and the accompanying drawings, in order to make the objects, technical solutions and advantages of the present invention more apparent. The exemplary embodiments of the present invention and the descriptions thereof are used herein to explain the present invention, but are not intended to limit the invention.
It should be noted here that, in order to avoid obscuring the present invention due to unnecessary details, only structures and/or processing steps closely related to the solution according to the present invention are shown in the drawings, while other details not greatly related to the present invention are omitted.
In order to solve the above problems, as shown in fig. 1, the present invention proposes a hybrid coding and decoding method based on a sub-constellation space, and the steps of the method include step S100 signal generation and step S200 signal reception demodulation:
the step of generating the signal in the step S100 includes:
As shown in fig. 4, step S110 generates bit information, and the bit information is separated into two paths of signals by using a bit distributor;
the bit distributor takes odd bits of bit information as one path of signal and even bits as one path of signal.
Step S120, respectively encoding the two paths of signals and performing polarization multiplexing processing to obtain X polarization and Y polarization, namely respectively encoding the two paths of signals, namely adopting LDPC encoding to bit data to be formed into X polarization signals, adopting Polar encoding to bit data to be formed into Y polarization signals so as to compensate the situation that the effect of the Y polarization signals in subsequent processing is slightly worse than that of the X polarization signals, and performing polarization multiplexing processing to obtain X polarization and Y polarization;
step S130, constellation subset segmentation is carried out based on X polarized and Y polarized signals;
as shown in fig. 3, in an implementation, the constellation points of the signal in each polarization are divided into a plurality of subsets, including A, B, C and D four subsets.
And determining the sub-sets to which the signals of the X polarization and the Y polarization belong to complete constellation segmentation, and combining the four sub-sets of the X polarization and the Y polarization according to the determined sub-family constraint conditions to form a 4D sub-family.
Step S140, determining whether to carry out amplitude translation on Y polarization based on constellation segmentation results of X polarization and Y polarization, generating a four-phase shift keying signal based on the amplitude translation results of Y polarization, and outputting the signal;
in some embodiments of the present invention, in the step of determining whether to perform amplitude translation on the Y polarization based on the constellation segmentation result of the X polarization and the Y polarization, whether the sub-group formed by the subset of the X polarization and the Y polarization belongs to a combination corresponding to a preset sub-group constraint condition corresponding to the subset of the X polarization is determined based on the subset to which the X polarization belongs, if so, amplitude translation is not required, and if not, amplitude translation is performed on the Y polarization to a sub-group corresponding to the subset of the X polarization.
In a specific implementation process, the sub-families corresponding to the preset sub-family constraint conditions comprise A-D, B-C, C-B and D-A, wherein the first term corresponds to the subset of X polarization and the second term corresponds to the subset of Y polarization. If the sub-groups to which the actual X polarization and the Y polarization belong are A U C, amplitude translation is needed for the Y polarization, and the Y polarization is translated into the sub-group A U D corresponding to the sub-group constraint condition preset by the subset of the X polarization.
The step S200 of signal receiving demodulation includes:
As shown in fig. 5, step S210, separates the signal into three parts of a 4D signal generated by X polarization, a 4D signal generated by Y polarization, and a quadrature phase shift keying signal;
In a specific implementation process, the output signal includes a quadrature phase shift keying signal, the Y polarization includes an in-phase component and a quadrature component (for an adopted 64QAM signal, each symbol carries 6 bits of information altogether, wherein the first 3 bits are in-phase component information and the last 3 bits are quadrature component information), in the step of outputting the output signal, if amplitude translation is not required, the bit information carried by the quadrature phase shift keying signal is 00, if amplitude translation is required and the in-phase component of the Y polarization is translated, the bit information carried by the quadrature phase shift keying signal is 10, if amplitude translation is required and the quadrature component of the Y polarization is translated, the bit information carried by the quadrature phase shift keying signal is 10, and if amplitude translation is required and the in-phase component and the quadrature component of the Y polarization are translated, the bit information carried by the quadrature phase shift keying signal is 11.
Step S220, hard decision is carried out on the four-phase shift keying signal to obtain bit information of a mark bit;
Step S230, calculating the log likelihood ratio of each bit in the 4D signal generated by the X polarization and the 4D signal generated by the Y polarization;
And step S240, determining the data of each bit based on the log-likelihood ratio to obtain X polarization and Y polarization with amplitude translation, and restoring the amplitude translation of the Y polarization based on the bit data of the quadrature phase shift keying signal to obtain Y polarization, further demodulating and decoding the X polarization and the Y polarization, and outputting bit information.
By adopting the scheme, at a receiving end, the invention provides a multi-dimensional soft decision algorithm aiming at amplitude translation set segmentation, which is used for respectively carrying out bitwise decoding on data on X polarization and Y polarization. In the X polarization, the Euclidean distance can be directly calculated with a subset where a received symbol is located, namely constellation points in bit correlation dimension BRD, so as to obtain a log-likelihood ratio for decoding, in the Y polarization, each bit in two directions is decoded bit by bit according to the received sign bits in two directions of an in-phase component and a quadrature component, if the sign bit is 0, the decoding is carried out according to the log-likelihood ratio in the bit correlation dimension, and if the sign bit is 1, which bit is required to be changed according to Gray code mapping rules determined by a transmitting end, and the bit is reversed, so that the received signal point is translated back to the original position and then decoded in the bit correlation dimension. The algorithm has lower complexity, and has superior error rate performance due to the combination of probability amplitude shaping PAS and an integrated segmentation technology, and can be suitable for effectively decoding the translated encoded signal.
In some embodiments of the present invention, in the step of encoding two signals separately and performing polarization multiplexing processing to obtain X polarization and Y polarization, LDPC encoding and Polar encoding are respectively applied to the two signals.
In a specific application process, a convolutional code is generally adopted in a coding part of the TCM technology, the realization is simpler, the coding and decoding technology is mature, but the gain brought by the convolutional code is limited, so that a more efficient coding mode is cascaded before the TCM module, and the more efficient coding mode is an effective mode for obtaining higher coding gain. In the current advanced forward error correction coding (FEC), polar codes and LDPC codes have better bit error rate performance in the scenarios of short codes and long codes, and the decoding speed and decoding complexity of the Polar codes and the LDPC codes have great advantages, so that the Polar codes and the LDPC codes are used as coding modes adopted by control channels and data channels respectively in 5G scenarios. Therefore, combining Polar codes, LDPC codes with TCM can further improve the performance of the system.
By adopting the scheme, the binary bit stream input by the transmitting end is firstly distributed into two parts, and is respectively processed and then transmitted on two polarizations. One path of data is subjected to QC-LDPC coding and then transmitted on X polarization, the other path of data is subjected to Polar coding and then transmitted on Y polarization;
For the first path of data, the nature of LDPC coding is linear block codes, except that the check matrix is a sparse matrix, the code is indistinguishable from any other block codes, so that a construction mode of a common block code is directly adopted, firstly, a proper check matrix H is designed, then a generation matrix G is obtained according to dual, and then a complete code word is obtained by multiplying an information source code group and the generation matrix. Wherein the check matrix H can be obtained by a random construction method.
For Polar code coding adopted by the other path of data, the channel polarization phenomenon is mainly utilized, new sub-channel positions generated after the channel is combined and split are rearranged, information bits are placed in a perfect channel with the capacity close to 1, frozen bits are placed in a pure noise channel with the capacity close to 0, so that the Shannon limit is approximated, and the transmission rate as large as possible is achieved under the condition of minimizing the error rate. Due to the limitation of the encoder structure, the encoded code length is fixed asThe code length and the code rate have certain limitations, and the limitation can be solved by using a bit puncturing method. For the system Polar code, puncture positions are determined in the frozen bits according to the descending order of channel capacity after coding, namely, the position with higher channel level is selected as a known bit for puncture, data to be transmitted are put into the data bits and the puncture bits, and the rest frozen bits are input with 0. The known bit is deleted at the transmitting end, and then the known bit is inserted at the receiving end for decoding, so that the limitation of the code length can be solved, the transmission efficiency is improved, and the inserted known bit can be used for assisting in decoding at the receiving end, so that the error rate cannot be reduced.
In the implementation process, after the Polar codes are recombined and split, the binary memory-free channels are polarized, and two types of extreme channels are obtained under the condition that the sum capacity is kept unchanged, namely a good channel with the channel capacity approaching 1 and a bad channel with the channel capacity approaching 0, and the proportion of the good channel is approaching the capacity of the original channel more and more along with the increase of the code length N.
In the specific implementation process, in the step of performing Polar coding, bit puncturing is performed to obtain codeword lengthFor example, the process is as shown in fig. 2:
1. frozen bits and information bit positions are selected by using Ethernet density evolution or Gaussian approximation Information bits。
2. Calculating the channel capacity of the frozen bit by using the channel polarization, selecting the frozen bit with larger channel capacity as a fixed bit, and fixing the fixed bit asThe other two freeze bits input 0.
3. After unified coding of the system Polar codes, the channels are output。
4. Puncturing known bitsTransmitting the remaining signals。
5. Known bits are to be received at the receiving endInserted into the received data, and decoded.
In practical application, the performances of error rate, complexity and the like are comprehensively considered, and the corresponding known bits are increased when the middle-short code with the code length of hundreds of bits is selected. After coding and puncturing according to the method, the output data is subjected to probability amplitude shaping and signal set segmentation.
Two paths of codes enter a TCM module respectively, in the part, check bits are generated by adopting a convolution code or an exclusive OR mode, but firstly probability amplitude shaping is carried out, the check bits are not generated by information bits through exclusive OR, but are divided by constellation sets, the generated non-uniform 1D constellation amplitude sets are divided into two 1D subsets in an equally-spaced mode, at the moment, the minimum Euclidean distance of constellation points in each subset is twice as much as the original distance, then the set of each 1-dimensional component (i.e. in-phase and quadrature components) of a 2D constellation is formed into A, B, C, D2D subsets according to the 1D subsets, so that a ' subset constraint condition ' (SSC) ' of 2D signals in two polarization states is formed, the minimum Euclidean distance of constellation points in each 2D subset is 2 times that of the original 2D constellation, and finally the 1D subsets are combined into 4D subsets (A-U D, B-U C, C-U B, D-A), so that the ' subset constraint condition (SFC) ' where 4D signals are located is formed, and the minimum Euclidean distance of the 4D constellation points in each 2D subset is ensured. The division of the 64QAM signal constellation subset at each polarization is shown in fig. 3.
In the diversity mode, the 2D signals on the X polarization are kept unchanged, meanwhile, the subset corresponding to the 2D signals on the Y polarization is selected according to the 4D sub-family under the constraint of SFC completed in combination to judge, and the 2D signals are decomposed into 1D signals to analyze when judging. When one 1D signal on Y polarization does not meet the current SFC subgroup constraint condition, the 1D signal is shifted to the adjacent signal point of the whole 2D constellation (the shifting direction is consistent in the same system), namely, the 1D signal is shifted to the complementary 1D subset, and a binary marking bit 1 is generated and recorded asIf the 1D signal on Y polarization meets the SFC condition of 4D subfamily, binary mark bit 0 is generated. Each 4D signal produces two flag bits. In this module, the final 4D signal is split into two 2D signals for transmission on the X-polarization and the Y-polarization, formed by polarization multiplexing. It is understood that the in-phase component and the quadrature component, which are present in the two polarization directions respectively, together constitute a four-dimensional signal. The 4D-PS signal generated according to the above method can realize set division at the time of transmission. During signal generation, one 4D symbol generates two binary flag bits, and the bits of the part of flag bits can be directly mapped into a modulation format that is easier to demodulate, such as Quadrature Phase Shift Keying (QPSK), but is not limited to QPSK.
After the above mixed coding, polarization multiplexing, probability shaping and constellation set segmentation, the mixed FEC-4D-PS-64QAM signal is finally obtained, and the complete generation process is shown in figure 4. Loading the laser on the laser, and putting the laser into a fiber channel for transmission.
At the receiving end, the received signals are subjected to dispersion compensation, polarization equalization and the like, then polarization demultiplexing is carried out, judgment is carried out by combining two polarization states, whether the corresponding component on Y polarization needs to make reverse translation or not is determined according to whether the mark bit is 1, and then probability amplitude shaping is carried out for demodulation. The decoding algorithm is optimized, and a multi-dimensional soft decision algorithm aiming at amplitude translation set segmentation is provided.
After obtaining the bit data, performing corresponding LDPC decoding and Polar decoding. For decoding of LDPC, BP algorithm is generally used. For Polar codes, known bits obtained by puncturing during encoding are required to be inserted into data demodulated by a TCM, then corresponding Polar code decoding is carried out, a Serial Cancellation List (SCL) algorithm is adopted, likelihood ratio (LLR) information of a bit channel is calculated through iteration, a concept of Path Metric (PM) is introduced, iterative decoding is carried out through multiple paths, and finally the one with the largest transition probability is selected and output, namely a final decoding result is compared with original bit data, and the bit error rate is obtained.
In some embodiments of the present invention, in the steps of calculating the log-likelihood ratio of each bit in the 4D signal generated by the X-polarization and the 4D signal generated by the Y-polarization, determining data of each bit based on the log-likelihood ratio to obtain the Y-polarization of the X-polarization and the amplitude shift, and recovering the amplitude shift of the Y-polarization based on the bit data of the quadrature phase shift keying signal to obtain the Y-polarization, and demodulating and decoding the X-polarization and the Y-polarization further:
directly decoding to obtain bit information of a marker bit by adopting a hard decision mode when the quadrature phase shift keying signal is demodulated;
In the 4D signal generated by the X polarization, the Euclidean distance is directly calculated with the subset to obtain the log-likelihood ratio for decoding;
In the 4D signal generated by Y polarization, each bit in two directions is decoded bit by bit according to the received mark bits in two directions of the in-phase component and the quadrature component, namely the two mark bits carried by the four-phase shift keying signal, if the mark bit is 0, the decoding is carried out according to the log likelihood ratio in the bit correlation dimension, if the mark bit is 1, the bit which is changed in the symbol is determined according to the Gray code mapping rule determined by the transmitting end, the bit is reversed, and the signal is reversely translated back to the original position and then decoded.
In a specific implementation process, an original calculation formula of the log-likelihood ratio is as follows:
It can be approximated as:
Wherein, the Representing the log-likelihood ratio of the kth signal bit,Representing a standard constellation point with a k-th bit of 1,Represents a standard constellation point with a k-th bit of 0,Representing conditional probabilities.
In Gaussian channel, log-likelihood ratio can be further expressed as following formula, namely, the k bit information in the received symbol is respectively mixed with standard constellation point with k bit being 0) Comparing the Euclidean distance between them to obtain minimum value, and at the same time making them and standard constellation point whose k-th bit is 1#) Comparing the Euclidean distance between the two points, taking the minimum value, and calculating to obtain。
Where y represents the received 4D signal, x represents the standard constellation point,Representing the log-likelihood ratio of the kth bit,Representing a standard constellation point with a k-th bit of 1,Represents a standard constellation point with a k-th bit of 0,Representing the variance characteristics of the gaussian channel itself,Representing the calculated total number of dimensions.
In the case of N dimensions, the kth bit information in the received symbol needs to be respectively combined with the standard constellation point with the kth bit of 0 in the N dimensions) Comparing the Euclidean distance between them, taking minimum value, and also making them and standard constellation point whose k-th bit is 1 #) Comparing the Euclidean distance between the two points, taking the minimum value, and calculating to obtainCan be expressed as:
Since it has been determined, at the transmitting end, what number of 4D subsets each Bit belongs to in the constellation diversity, and the 4D subset to which the kth Bit belongs is called a Bit correlation dimension (Bit-RelatedDimension, BRD), it can be calculated in two parts, namely non-BRD and BRD:
after simplification, it can be seen that the log-likelihood ratio of the kth bit is related to BRD only, so that only the euclidean distance from each constellation point in BRD is calculated in the algorithm.
Restoring the amplitude-shifted signal, and providing a multi-dimensional soft decision algorithm aiming at amplitude shift set segmentation:
In some embodiments of the invention, the sub-family constraints are met due to the need to meet ;
;
Wherein, the The sub-family constraint is represented by a sub-family constraint,Representing the dimensions j, y in the subfamily constraint, representing the received 4D signal, x representing the standard constellation point,Representation ofStandard constellation points with k-th bit i in each dimension,Representation ofStandard constellation points with k-th bit i satisfying the sub-family constraint in each dimension,Representation ofThe kth bit in the dimension that satisfies the j-th dimension subfamily constraint is the standard constellation point of i,Representing the sub-family, the subset to which the kth bit belongs is referred to as the bit-dependent dimension, m represents the dimension of the non-bit-dependent dimension,Representing the calculated number of total dimensions,A 4D signal representing a dimension other than the bit-dependent dimension,Standard constellation points representing non-bit dependent dimensions,A set of dimensions representing non-bit dependent dimensions,Representing the minimum euclidean distance in the bit dependent dimension.
In some embodiments of the invention, when the dimension is the non-translated dimension or the dimension is the translated dimension but the flag bit = 0, thenAt this time:
When the dimension is the translation dimension and the sign bit=1, i.e. the symbol has amplitude translation, determining whether the bit is changed by using the gray coding rule determined by the transmitting end, if the bit is changed, the data bit of the bit is opposite to the constellation point mapping bit, and then consideration is needed AndIn both cases the number of the cases,Taking outAnd (3) withIs the minimum value of (2):
Wherein, the Is thatNot including
DerivingAfter that, in the same way,Can be expressed as:
Wherein the method comprises the steps of The set is:
Wherein, the Representing the minimum euclidean distance of the received signal and the standard constellation point for bit i in the bit correlation dimension,Representing the minimum euclidean distance between the received signal and the standard constellation point for which the kth bit is 1-i in the bit correlation dimension,Representing the bit-related dimensions in the SFC,A 4D signal representing the received bit-dependent dimension,Representing standard constellation points in the bit-dependent dimension.
Summarizing the above deductions, in any caseUnder S-dimensional SFC constraints, this can be expressed as:
in the specific implementation process, judging according to the obtained log-likelihood ratio, and demodulating PAS probability amplitude shaping;
LDPC decoding is carried out on the bit data in the X polarization direction obtained by demodulation, BP algorithm is adopted, polar decoding is carried out on the bit data in the Y polarization direction, and SCL algorithm is adopted. Note that before Polar decoding, the known bits of the digits punctured by the transmitting end are inserted into the multi-dimensional soft decision output bits on the Y polarization, and then decoding is performed;
and (5) after decoding, calculating the error rate.
The beneficial effects of the invention include:
1. The invention adopts the parallel coding of Polar codes and LDPC codes and combines the modes of Polarization Multiplexing (PM) technology, set Segmentation (SP) theory, probability Amplitude Shaping (PAS) technology and the like with TCM technology, realizes the mixed coding modulation of four-dimensional high-order signals under the space of sub-constellations, and optimizes the decoding algorithm;
When the PAS technology and the set segmentation technology adopted in the TCM are simultaneously applied to optical fiber communication, the problem that the PAS is not compatible occurs, namely, if PAS shaping is firstly carried out and then set segmentation is carried out, the shaped symbol distribution is disordered, and if the PAS shaping is firstly carried out and then set segmentation is carried out, the decoding of a receiving end is not facilitated. Therefore, the invention adopts an amplitude translation method, translates the amplitude of signals after PAS on Y polarization according to constraint conditions while segmenting the set, so as to obtain the mark bit (0 or 1) for auxiliary decoding, and solve the problem that the two signals cannot be compatible.
3. At a receiving end, the invention provides a multi-dimensional soft decision algorithm aiming at amplitude translation set segmentation, which respectively carries out bitwise decoding on data on X polarization and Y polarization. In the X polarization, the Euclidean distance can be directly calculated with constellation points in a subset (namely bit related dimension BRD) where a received symbol is located to obtain a log-likelihood ratio for decoding, in the Y polarization, each bit in two directions is decoded bit by bit according to the received sign bits in two directions of an in-phase component and a quadrature component respectively, if the sign bit is 0, the decoding is carried out in the BRD according to the log-likelihood ratio, if the sign bit is 1, which bit is required to be changed according to a Gray code mapping rule determined by a transmitting end, and the bit is reversed, so that the received signal point is translated back to the original position and then decoded in the BRD. The algorithm has lower complexity, and has superior bit error rate performance because PAS and the integrated segmentation technology can be combined.
The embodiment of the invention also provides a mixed coding and decoding device based on the sub-constellation space, which comprises a computer device, wherein the computer device comprises a processor and a memory, the memory is stored with computer instructions, the processor is used for executing the computer instructions stored in the memory, and the device realizes the steps realized by the method when the computer instructions are executed by the processor.
The embodiment of the invention also provides a computer readable storage medium, on which a computer program is stored, which when being executed by a processor, is configured to implement the steps implemented by the aforementioned hybrid coding and decoding method based on the sub-constellation space. The computer readable storage medium may be a tangible storage medium such as Random Access Memory (RAM), memory, read Only Memory (ROM), electrically programmable ROM, electrically erasable programmable ROM, registers, floppy disks, hard disk, a removable memory disk, a CD-ROM, or any other form of storage medium known in the art.
Those of ordinary skill in the art will appreciate that the various illustrative components, systems, and methods described in connection with the embodiments disclosed herein can be implemented as hardware, software, or a combination of both. The particular implementation is hardware or software dependent on the specific application of the solution and the design constraints. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present invention. When implemented in hardware, it may be, for example, an electronic circuit, an Application Specific Integrated Circuit (ASIC), suitable firmware, a plug-in, a function card, or the like. When implemented in software, the elements of the invention are the programs or code segments used to perform the required tasks. The program or code segments may be stored in a machine readable medium or transmitted over transmission media or communication links by a data signal carried in a carrier wave.
It should be understood that the invention is not limited to the particular arrangements and instrumentality described above and shown in the drawings. For the sake of brevity, a detailed description of known methods is omitted here. In the above embodiments, several specific steps are described and shown as examples. The method processes of the present invention are not limited to the specific steps described and shown, but various changes, modifications and additions, or the order between steps may be made by those skilled in the art after appreciating the spirit of the present invention.
In this disclosure, features that are described and/or illustrated with respect to one embodiment may be used in the same way or in a similar way in one or more other embodiments and/or in combination with or instead of the features of the other embodiments.
The above description is only of the preferred embodiments of the present invention and is not intended to limit the present invention, and various modifications and variations can be made to the embodiments of the present invention by those skilled in the art. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present invention should be included in the protection scope of the present invention.