WO2019141281A1 - 信息处理方法和系统、发送装置及接收装置 - Google Patents

信息处理方法和系统、发送装置及接收装置 Download PDF

Info

Publication number
WO2019141281A1
WO2019141281A1 PCT/CN2019/072618 CN2019072618W WO2019141281A1 WO 2019141281 A1 WO2019141281 A1 WO 2019141281A1 CN 2019072618 W CN2019072618 W CN 2019072618W WO 2019141281 A1 WO2019141281 A1 WO 2019141281A1
Authority
WO
WIPO (PCT)
Prior art keywords
mapping
bit
mapping rule
constellation
rule
Prior art date
Application number
PCT/CN2019/072618
Other languages
English (en)
French (fr)
Inventor
费爱梅
周伟勤
蔡轶
Original Assignee
中兴通讯股份有限公司
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 中兴通讯股份有限公司 filed Critical 中兴通讯股份有限公司
Publication of WO2019141281A1 publication Critical patent/WO2019141281A1/zh

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B10/00—Transmission systems employing electromagnetic waves other than radio-waves, e.g. infrared, visible or ultraviolet light, or employing corpuscular radiation, e.g. quantum communication
    • H04B10/25—Arrangements specific to fibre transmission
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0041—Arrangements at the transmitter end
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0045—Arrangements at the receiver end
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L27/00—Modulated-carrier systems
    • H04L27/32—Carrier systems characterised by combinations of two or more of the types covered by groups H04L27/02, H04L27/10, H04L27/18 or H04L27/26
    • H04L27/34—Amplitude- and phase-modulated carrier systems, e.g. quadrature-amplitude modulated carrier systems
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L27/00—Modulated-carrier systems
    • H04L27/32—Carrier systems characterised by combinations of two or more of the types covered by groups H04L27/02, H04L27/10, H04L27/18 or H04L27/26
    • H04L27/34—Amplitude- and phase-modulated carrier systems, e.g. quadrature-amplitude modulated carrier systems
    • H04L27/3405—Modifications of the signal space to increase the efficiency of transmission, e.g. reduction of the bit error rate, bandwidth, or average power
    • H04L27/3444—Modifications of the signal space to increase the efficiency of transmission, e.g. reduction of the bit error rate, bandwidth, or average power by applying a certain rotation to regular constellations
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L27/00—Modulated-carrier systems
    • H04L27/32—Carrier systems characterised by combinations of two or more of the types covered by groups H04L27/02, H04L27/10, H04L27/18 or H04L27/26
    • H04L27/34—Amplitude- and phase-modulated carrier systems, e.g. quadrature-amplitude modulated carrier systems
    • H04L27/36—Modulator circuits; Transmitter circuits
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L27/00—Modulated-carrier systems
    • H04L27/32—Carrier systems characterised by combinations of two or more of the types covered by groups H04L27/02, H04L27/10, H04L27/18 or H04L27/26
    • H04L27/34—Amplitude- and phase-modulated carrier systems, e.g. quadrature-amplitude modulated carrier systems
    • H04L27/38—Demodulator circuits; Receiver circuits

Definitions

  • the present application relates to the field of optical fiber communication, for example, to an information processing method and system, a transmitting device, and a receiving device.
  • Distribution Matching is one of the key technologies of probabilistic shaping, which transforms uniformly distributed data into data of expected probability distribution.
  • Constant Composition Distribution Matching CCDM
  • CCDM Constant Composition Distribution Matching
  • CAP Cut and Paste
  • the CAP uses two different mapping rules.
  • the first mapping rule is a Gray mapping
  • the second mapping rule is a mapping rule that is completely reversely aligned with the power of the first mapping rule.
  • the second mapping rule is reverse-aligned, not Gray-mapped, so that when a signal is misjudged by adjacent symbols, multiple bit errors may occur, resulting in bit error diffusion.
  • the present application provides an information processing method and system, a transmitting device, and a receiving device, which can reduce bit error diffusion while maintaining power reverse alignment as much as possible.
  • the present application provides an information processing method, including:
  • the third bit sequence after the forward error correction coding is mapped by using the first mapping rule to obtain symbol information and sent;
  • the first mapping rule is a Gray mapping, and the multiple bits corresponding to the constellation points of the Gray mapping are first mapping bit information.
  • the present application provides an information processing method, including:
  • Determining the first bit sequence and outputting in response to the flag bit of the third bit sequence after the forward error correction decoding is the first flag bit; or the flag bit of the third bit sequence after the forward error correction decoding is As a result of the second flag bit, the symbol corresponding to the second bit sequence under the second mapping rule is demapped according to the first shot rule, and then output;
  • the first mapping rule is a Gray mapping
  • the plurality of bits corresponding to the constellation points of the Gray mapping are first mapping bit information
  • the multiple bits corresponding to the constellation points of the second mapping rule are second mapping bits.
  • the second mapping bit information is bit information corresponding to the first mapping bit information corresponding to all the constellation points in each quadrant of the constellation in the first mapping rule, and the bit information corresponding to the constellation point .
  • the present application provides a transmitting apparatus, including:
  • a first mapping module configured to map the first bit sequence by using a first mapping rule to obtain a first mapping symbol group
  • a second mapping module configured to map the second bit sequence by using the first mapping rule to obtain a second mapping symbol group
  • a selecting module configured to determine a third bit sequence according to the power of the first mapping symbol group or the power of the second mapping symbol group;
  • a forward error correction coding module configured to perform forward error correction coding on the third bit sequence
  • the third mapping module is configured to map the third bit sequence after the forward error correction coding by using the first mapping rule to obtain symbol information
  • a sending module configured to send the symbol information
  • the first mapping rule is a Gray mapping, and the multiple bits corresponding to the constellation points of the Gray mapping are first mapping bit information.
  • the present application provides a receiving apparatus, including:
  • a receiving module configured to receive symbol information
  • a first demapping module configured to demap the symbol information by using a first mapping rule to obtain a third bit sequence after forward error correction coding
  • a forward error correction decoding module configured to perform forward error correction decoding on the forward error correction encoded third bit sequence
  • the flag bit is the result of the second flag bit
  • the second demapping module is configured to output the symbols corresponding to the second mapping sequence under the second mapping rule according to the first mapping rule, and output the symbols;
  • the first mapping rule is a Gray mapping
  • the plurality of bits corresponding to the constellation points of the Gray mapping are first mapping bit information
  • the multiple bits corresponding to the constellation points of the second mapping rule are second mapping bits.
  • the second mapping bit information is bit information corresponding to the first mapping bit information corresponding to all the constellation points in each quadrant of the constellation in the first mapping rule, and the bit information corresponding to the constellation point .
  • the present application provides a transmitting apparatus including a processor and a computer readable storage medium having instructions stored therein, when the instructions are executed by the processor,
  • the information processing method described in any of the above embodiments is applied to the transmitting device side.
  • the present application provides a receiving apparatus including a processor and a computer readable storage medium having instructions stored therein, when the instructions are executed by the processor, implementing an application on a receiving device side
  • a receiving apparatus including a processor and a computer readable storage medium having instructions stored therein, when the instructions are executed by the processor, implementing an application on a receiving device side
  • the present application provides an information processing system, including the transmitting device according to any of the above embodiments, and the receiving device according to any of the above embodiments.
  • the present application provides a computer readable storage medium having stored thereon a computer program that, when executed by a processor, implements the information described in any of the above embodiments on a transmitting device side Approach.
  • the present application proposes a computer readable storage medium having stored thereon a computer program that, when executed by a processor, implements the information processing method described in any of the above embodiments on the receiving device side.
  • 1 is a first quadrant diagram of a constellation diagram under a first mapping rule of 64 64 Quadrature Amplitude Modulation (64QAM);
  • FIG. 2 is a schematic diagram of a first quadrant of a constellation diagram under a second mapping rule of the related art
  • FIG. 3 is a schematic structural diagram of a CAP coding system of the present application.
  • Figure 5 is a schematic view of a folding scheme in the present application.
  • Figure 6 is a schematic view of a folding solution in the present application after folding
  • FIG. 7 is a schematic view of another folding scheme in the present application.
  • Figure 8 is a schematic view of another folding solution in the present application after folding
  • Figure 9 is a schematic view of a rotation scheme in the present application.
  • Figure 10 is a schematic view of a rotation scheme of the present application after rotation
  • FIG. 11 is a schematic view of another rotation scheme in the present application.
  • Figure 12 is a schematic view showing another rotation scheme of the present application after rotation
  • FIG. 13 is a flowchart of another information processing method in the present application.
  • FIG. 14 is a schematic structural diagram of a transmitting apparatus in the present application.
  • FIG. 15 is a schematic structural diagram of a receiving device in the present application.
  • 16 is a schematic structural diagram of another transmitting apparatus in the present application.
  • FIG. 17 is a schematic structural diagram of another receiving apparatus in the present application.
  • 1 is a first quadrant diagram of a 64 Quadrature Amplitude Modulation (64QAM) constellation of the related art (the symbol bit 00 representing the quadrant position is omitted in the figure, and the symbol bits corresponding to the other quadrants are 01, 10, respectively. 11).
  • 64QAM Quadrature Amplitude Modulation
  • the horizontal axis represents the real part and the vertical axis represents the imaginary part.
  • bit position 00 is added in front of the bit information 0000 to obtain a bit sequence 000000, the corresponding symbol is at position 1+i, and the power is 2; the bit position 00 is added in front of the bit information 1100 to obtain a bit.
  • Sequence 001100 the corresponding symbol is at position 7+7i and the power is 98.
  • the power of the symbol corresponding to the bit sequence 000000 is small relative to the power of the symbol 001100.
  • the number of symbols corresponding to each constellation point on the constellation is substantially equal, so the total average power of the symbols at the time of transmission is substantially equal to the average power of all constellation points on the constellation.
  • the first mapping rule is Gray mapping, that is to say, there is only one bit difference between two adjacent symbols, as shown in Fig. 1, so that there is only one bit error when the signal is misjudged by adjacent symbols.
  • the second mapping rule is a mapping rule that is completely reversed from the power of the first mapping rule. Under the two mapping rules, the constellation points of the same symbol are located differently, and each of the symbols is mapped with a low power mapping rule. After adopting this method, the symbols near the origin of the coordinates are too large, and the symbols far from the origin of the coordinates are less, which is in line with the probability coding requirement.
  • the mapping rule shown in Figure 2 is the power reverse alignment of Figure 1.
  • Table 1 is a mapping rule of the first quadrant of 64QAM, and the other three quadrants Different from this table, the first two bits of the bit information bm1 and bm2 are different, and the last four bits are the same; the symbol coordinates after mapping M1 and M2 are respectively the coordinates in the corresponding quadrant, for example, the M1 coordinate of bm1 is 000000 is 1+ 1j; the M1 coordinate of bm1 is 100000 is 1-1j of the fourth quadrant, or -1+1j of the second quadrant; the M1 coordinate of bm1 is 110000 is -1-1j of the third quadrant.
  • the symbol information finally output will get the most suitable probability distribution, but since the second mapping rule and the first mapping rule are not the Gray mapping at this time, when the optical signal noise ratio (OSNR) is small, Bit error spread is more serious.
  • OSNR optical signal noise ratio
  • the first column is the first mapping bit information bm1
  • the second column is the symbol information corresponding to the first bit bit information bm1 in the first mapping rule M1
  • the third column is the power corresponding to the first mapping bit information
  • the fourth column is the second mapping bit information bm2
  • the fifth column is the symbol information corresponding to the second bit information bm2 under the first mapping rule
  • the sixth column is the symbol information corresponding to the second bit information bm2.
  • the CAP coding system includes a transmitting device and a receiving device.
  • the transmitting device includes a first mapping module, a second mapping module, a selecting module, a Forward Error Correction (FEC) encoding module, a third mapping module, and a sending module.
  • the receiving device includes a receiving module and a first demapping. Module, FEC decoding module, determining module, and second demapping module.
  • the input data bits are first grouped, and the number of data b0 bits of each group is (N ⁇ D-1), where D is the number of symbols of each group, D is at least 2; N is the number of bits corresponding to each symbol.
  • the first mapping module is configured to add an extra bit '0' before the input data bit sequence b0, and form N ⁇ D bits, which is called a first bit sequence b1, and perform mapping according to M1 to obtain D symbols, which are called The first mapping symbol group.
  • the second mapping module is configured to add an extra bit '1' before the input set of data bit sequence b0 to form N ⁇ D bits b0′, and perform Obtaining a second bit sequence b2;
  • a selection module configured to select, according to the first mapping rule, bit information with less power in the first bit information b1 and the second bit information b2 as the third bit sequence;
  • the FEC encoding module is configured to perform FEC encoding on the third bit sequence, and add a check digit in the FEC encoding process;
  • the first mapping module is configured to map the FEC encoded third bit sequence by using the first mapping rule M1 to obtain symbol information
  • the sending module is configured to perform digital signal processing (DSP) on the symbol information.
  • DSP digital signal processing
  • the receiving module is configured to receive a signal and perform DSP processing to obtain symbol information
  • a first demapping module configured to demap the symbol information by using the first mapping rule M1 to obtain a third bit sequence after FEC encoding
  • the FEC decoding module is configured to perform FEC decoding on the FEC encoded third bit sequence according to the check bit;
  • a determining module configured to determine, according to the extra bits in the third bit sequence, whether the third bit sequence is the first bit sequence b1 or the second bit sequence b2: if the first bit in the third bit sequence is '0', then the third The bit sequence is the first bit sequence b1, and the first extra bit of b1 is removed to obtain the original data sequence b0; if the first bit in the third bit sequence is '1', the third bit sequence is the second bit sequence b2 Transmitting the third bit sequence to the second demapping module;
  • the second demapping module is configured to first map the bit sequence with the second mapping rule, then perform demapping by using the first mapping rule, and finally remove the first extra bit to obtain the original data sequence b0.
  • the present application proposes an information processing method, including steps 400 to 430.
  • Step 400 Perform mapping on the first bit sequence by using a first mapping rule to obtain a first mapping symbol group.
  • the first mapping sequence is mapped by using the first mapping rule to obtain the first mapping symbol group, including:
  • Step 410 Perform mapping on the second bit sequence by using the first mapping rule to obtain a second mapping symbol group.
  • the second mapping sequence is mapped by using the first mapping rule to obtain a second mapping symbol group, including:
  • b0' is a sequence obtained by adding the second flag bit to the data bit group, where the M1 and the M2 are respectively mapped according to the first mapping rule and the second mapping rule, And said De-mapping is performed according to the first mapping rule and the second mapping rule respectively; the plurality of bits corresponding to the constellation points of the second mapping rule are second mapping bit information, and the second mapping bit information is The bit information corresponding to the constellation point after the first mapping bit information corresponding to all the constellation points of each of the quadrants in the first mapping rule is folded or rotated.
  • the first mapping bit information may be understood as a bit corresponding to each symbol (ie, each constellation point) in the first mapping symbol group.
  • the second mapping bit information can be understood as a bit corresponding to each symbol (ie, each constellation point) in the second mapping symbol group.
  • Mapping can be understood as mapping bits into symbols, and multiple symbols form a symbol group.
  • the input data bits are grouped, and the number of data b0 bits of each group is (N ⁇ D-1), where D is the number of symbols of each group, D is at least 2; N is each symbol The corresponding number of bits; minus 1 is the flag added by the marker mapping rule.
  • the flag bit can also be understood as an extra bit.
  • An input bit sequence b0 is preceded by an extra bit '0' to form an N ⁇ D bit, which is called a first bit sequence b1, and is mapped according to M1 to obtain D symbols, which are called a first mapping symbol group. .
  • the input data bit sequence b0 is preceded by an extra bit '1' to form N ⁇ D bits b0', and then A second bit sequence b2 is obtained. among them, B0' is first obtained according to the first mapping rule M1, and the bit information of the second mapping rule M2 corresponding to the symbol is searched (that is, the symbol is demapped according to the second mapping rule), and M1 and M2 are respectively according to the first mapping rule. Mapping rules and second mapping rules are mapped, De-mapping is performed according to the first mapping rule and the second mapping rule, respectively.
  • B2 is mapped according to M1 to obtain D symbols, which are called second mapping symbol groups.
  • the first mapping rule is a Gray mapping
  • a plurality of bits (bit information bm1) corresponding to the constellation points of the Gray mapping are first mapping bit information.
  • the plurality of bits (bit information bm2) corresponding to the constellation points of the second mapping rule are second mapping bit information, and the second mapping bit information is corresponding to all constellation points in each quadrant of the constellation diagram under the first mapping rule.
  • the bit information corresponding to the constellation point after the first mapping bit information is folded or rotated.
  • the second mapping bit information corresponding to the second mapping rule of the present application is obtained by folding or rotating the first mapping bit information corresponding to all the constellation points in each quadrant of the constellation in the first mapping rule, because the first mapping rule is obtained.
  • the second mapping rule does not change the adjacent relationship of the bit information corresponding to the constellation points under the first mapping rule, that is, each constellation point of the constellation diagram combined with the second mapping rule and the first mapping rule.
  • There is only one bit information difference between the adjacent constellation points so that even if the signal before the probability decoding has a bit error, then there is only one bit error after the probability decoding, and after the folding or rotation, the first
  • the second mapping rule is power reverse alignment. Therefore, the combination of the second mapping rule and the first mapping rule is also a Gray mapping, thereby reducing bit error diffusion while keeping power reverse alignment as much as possible.
  • the first mapping bit information corresponding to all the constellation points of each quadrant in the constellation diagram under the first mapping rule is folded in half, which refers to all constellation points in each quadrant of the constellation diagram under the first mapping rule.
  • the corresponding first mapping bit information is folded in half along the axis of symmetry, as shown in FIGS. 5 and 7. That is to say, the first mapping bit information corresponding to the two constellation points of the symmetry axis symmetry in each of the quadrants in the constellation diagram under the first mapping rule is interchanged.
  • the above symmetry axis may be square a first diagonal line, as shown in FIG. 5; wherein the first diagonal line is perpendicular to the second diagonal line, and the second diagonal line refers to the connection of the most powerful constellation point and the least power constellation point in the quadrant
  • the first quadrant of the constellation obtained after the line is folded is shown in Fig. 6.
  • the symmetry axis is a radius in the constellation diagram under the first mapping rule.
  • the corresponding circle is the dotted line shown in Figure 7.
  • Figure 7 shows an example where the minimum power has a radius of 1 and its power is p; the maximum power has a radius of 4 and its power is 16p, and the axis of symmetry is a circle with a radius of 2.5.
  • R 1 is a radius corresponding to a circle with the smallest power of all constellation points in the constellation diagram under the first mapping rule
  • R 2 is a circle corresponding to the largest power of all constellation points in the constellation diagram under the first mapping rule. radius.
  • the first quadrant of the constellation obtained after folding is as shown in Fig. 8, that is, the radius is The corresponding upper right part and the lower left part of the circle are symmetrically mapped, that is, each quadrant and the radius in the constellation diagram under the first mapping rule are Corresponding circularly symmetric two constellation points corresponding to the first mapping bit information are exchanged, such that the first mapping rule and the second mapping rule combination are still Gray mapping, and the power is reversely ordered, thereby reducing the power reverse ordering while reducing The bit error spread.
  • rotating the first mapping bit information corresponding to all the constellation points of each quadrant in the constellation diagram under the first mapping rule refers to all constellation points in each quadrant of the constellation diagram under the first mapping rule.
  • the corresponding first mapping bit information is rotated 180 degrees around the center of symmetry of the quadrant, as shown in FIGS. 9 and 11.
  • the symmetric center is square or positive.
  • the intersection of the diagonals of the polygons is as shown in Fig. 9.
  • the first quadrant of the constellation obtained after the rotation is as shown in Fig. 10.
  • the symmetric center is a radius in the constellation diagram under the first mapping rule.
  • the intersection of the corresponding circle and the preset line is as shown in FIG. 11; wherein, the angle between the preset line and the coordinate axis of the constellation is 45 degrees.
  • the first quadrant of the constellation obtained after the rotation is as shown in FIG.
  • the second mapping rule may be preset, and may be set in various manners, for example, in the form of a table as shown in Table 2 or Table 3.
  • Table 2 is a mapping relationship table under a folding scheme
  • Table 3 is a mapping relationship table under a rotation scheme.
  • Table 2 and Table 3 are both exemplified by 64QAM. Since the power is calculated according to the symbol information corresponding to the bit information, the power information may refer to symbol information corresponding to the bit information, or calculated according to the symbol information corresponding to the bit information. Power value.
  • Step 420 Determine a third bit sequence according to the power of the first mapping symbol group and the power of the second mapping symbol group, and perform FEC encoding on the third bit sequence.
  • the bit information with less power can be selected from the first mapping symbol group and the second mapping symbol group to obtain a third bit sequence, and the flag bit is used to mark whether the first bit sequence or the second bit sequence is selected. For example, a flag bit of 0 indicates that the first bit sequence is selected, and a value of 1 indicates that the second bit sequence is selected.
  • determining the third bit sequence according to the power of the first mapping symbol group and the power of the second mapping symbol group including:
  • the power of the first bit sequence b1 is smaller than the power of the second bit sequence b2, therefore, the first bit sequence b1 is selected as the third bit sequence, that is, the third bit information is 000011 000101, wherein the first bit 0 represents The first bit sequence is selected.
  • a check bit is added in the FEC encoding process for the third bit sequence, and the check bit is used by the receiving device to perform FEC decoding.
  • Step 430 Perform mapping on the FEC-encoded third bit sequence by using the first mapping rule to obtain symbol information and send the symbol information.
  • the symbol information may be first processed by the transmitting end DSP (such as filtering processing at the transmitting end, delay processing, nonlinear processing, etc.) and then transmitted, thereby compensating for the symbol information.
  • DSP such as filtering processing at the transmitting end, delay processing, nonlinear processing, etc.
  • the present application provides an information processing method, including:
  • Step 1300 Receive symbol information, and demap the symbol information by using a first mapping rule to obtain a third bit sequence after FEC encoding.
  • the received information may be subjected to DSP processing to obtain symbol information before the symbol information is demapped by using the first mapping rule.
  • Step 1310 Perform forward error correction decoding on the third bit sequence after forward error correction coding.
  • Step 1320 Determine, according to a result that the flag bit of the third bit sequence after the forward error correction decoding is the first flag bit, determine the first bit sequence and output; or respond to the third bit sequence after the forward error correction decoding
  • the flag bit is the result of the second flag bit, and the symbol corresponding to the second bit sequence under the second mapping rule is demapped according to the first mapping rule and output.
  • determining whether the sequence other than the flag bit in the third bit sequence is the first bit sequence or the second bit sequence according to the flag bit in the third bit sequence if the bit in the third bit sequence is other than the flag bit If the sequence is the first bit sequence, the first bit sequence is directly output; if the bit sequence other than the flag bit in the third bit sequence is the second bit sequence, the second bit sequence is first mapped by using the second mapping rule.
  • the first mapping rule is used for demapping and output.
  • the first mapping rule is a Gray mapping
  • the plurality of bits corresponding to the constellation points of the Gray mapping are the first mapping bit information
  • the multiple bits corresponding to the constellation points of the second mapping rule are the second mapping bit information
  • the second mapping bit information is bit information corresponding to the constellation point after the first mapping bit information corresponding to all the constellation points of each of the quadrants in the constellation in the first mapping rule is folded or rotated.
  • the second mapping rule of the present application is obtained by folding or rotating the first mapping bit information corresponding to all the constellation points in each quadrant of the constellation diagram under the first mapping rule, because the first mapping rule is a Gray mapping, and the second mapping The rule does not change the neighbor relationship of the bit information corresponding to the constellation point under the first mapping rule, that is, each constellation point of the constellation diagram combined with the second mapping rule and the first mapping rule and the adjacent constellation point Only one bit information is different between each other, so that even if the signal before the probability decoding has a bit error, there is only one bit error after the probability decoding, and the second mapping rule is reversed in power after the folding or rotation. Therefore, the combination of the second mapping rule and the first mapping rule is also a Gray mapping, thereby reducing bit error diffusion while keeping the power reversed as much as possible.
  • the first mapping bit information corresponding to all the constellation points of each quadrant in the constellation diagram under the first mapping rule is folded in half, which refers to all constellation points in each quadrant of the constellation diagram under the first mapping rule.
  • the corresponding first mapping bit information is folded in half along the axis of symmetry, as shown in FIGS. 5 and 7. That is to say, the first mapping bit information corresponding to the two constellation points of the symmetry axis symmetry in each of the quadrants in the constellation diagram under the first mapping rule is interchanged.
  • the above symmetry axis may be square a first diagonal line, as shown in FIG. 5; wherein the first diagonal line is perpendicular to the second diagonal line, and the second diagonal line refers to the connection of the most powerful constellation point and the least power constellation point in the quadrant
  • the first quadrant of the constellation obtained after the line is folded is shown in Fig. 6.
  • the symmetry axis is a radius in the constellation diagram under the first mapping rule.
  • the corresponding circle is the dotted line shown in Figure 7.
  • R 1 is the radius corresponding to the smallest circle of power of all constellation points in the constellation diagram under the first mapping rule
  • R 2 is the largest circle of power of all constellation points in the constellation diagram under the first mapping rule Corresponding radius.
  • the first quadrant of the constellation obtained after folding is as shown in Fig. 8, that is, the radius is The corresponding upper right part and the lower left part of the circle are symmetrically mapped, that is, each quadrant and the radius in the constellation diagram under the first mapping rule are Corresponding circularly symmetric two constellation points corresponding to the first mapping bit information are exchanged, such that the first mapping rule and the second mapping rule combination are still Gray mapping, and the power is reversely ordered, thereby reducing the power reverse ordering while reducing The bit error spread.
  • rotating the first mapping bit information corresponding to all the constellation points of each quadrant in the constellation diagram under the first mapping rule refers to all constellation points in each quadrant of the constellation diagram under the first mapping rule.
  • the corresponding first mapping bit information is rotated 180 degrees around the center of symmetry of the quadrant, as shown in FIGS. 9 and 11.
  • the symmetric center is square or positive.
  • the intersection of the diagonals of the polygons is as shown in Fig. 9.
  • the first quadrant of the constellation obtained after the rotation is as shown in Fig. 10.
  • the symmetric center is a radius in the constellation diagram under the first mapping rule.
  • the intersection of the corresponding circle and the preset line is as shown in FIG. 11; wherein, the angle between the preset line and the coordinate axis of the constellation is 45 degrees.
  • the first quadrant of the constellation obtained after the rotation is as shown in FIG.
  • the second mapping rule may be preset, and may be set in various manners, for example, in the form of a table as shown in Table 2 or Table 3.
  • Table 2 is a mapping relationship table under a folding scheme
  • Table 3 is a mapping relationship table under a rotation scheme.
  • Table 2 and Table 3 are both exemplified by 64QAM. Since the power is calculated according to the symbol information corresponding to the bit information, the power information may refer to symbol information corresponding to the bit information, or calculated according to the symbol information corresponding to the bit information. Power value.
  • the above method is applicable not only to square QAM but also to Amplitude Phase Shift Keying (APSK).
  • APSK Amplitude Phase Shift Keying
  • the 64QAM is taken as an example.
  • the first mapping rule M1 adopts the Gray mapping mode as shown in FIG. 1
  • the second mapping rule M2 adopts the folding mapping mode, that is, the diagonal line in FIG. 5 is used for folding. Along the diagonal, symmetrically map the upper right and lower left portions of the diagonal.
  • the combination of the first mapping rule and the second mapping rule is still a Gray mapping
  • the first mapping rule and the second mapping rule of the first quadrant are combined as shown in FIG. 6.
  • the first bit sequence bm1 input by the transmitting device is divided into two paths, one channel directly outputs the first bit sequence bm1, and the second channel uses the second mapping rule M2 as shown in Table 2 to convert the first bit sequence bm1 into the second mapping rule M2.
  • the original bit information is 00011 000101 (11 bits of information is because the flag will be increased by 1 bit later), one output bit is still 00011 000101, and the other output is 01111 000110, according to The power corresponds to Table 2.
  • the third bit information is FEC encoded, and the parity bit is added.
  • the FEC-encoded third bit sequence is mapped into symbol information according to the first mapping rule M1.
  • the symbol information is processed by the relevant DSP, and then transmitted through the optical fiber. .
  • the symbol information processed by the DSP is demapped using the first mapping rule M1, and each bit information obtains 6 bit information.
  • decoding is performed according to the check bit to obtain a third bit sequence.
  • Table 2 shows the power correspondence of different bit information in the first mapping rule M1 and the second mapping rule M2. Some of these points are shown in the table, although not full energy reverse ordering. However, it is ensured that the first mapping rule M1 and the second mapping rule M2 are combined into Gray coding. Assume that the source bit is 001101, the probability code is 000010 (that is, the selected bit information), and the bit error after the demapping before the probability decoding is judged as 000011, then the probability decoding is 001111, and there is still only one bit error. There is no bit error diffusion.
  • Table 4 shows the original scheme (using power completely in descending order), the error bit is increased by about 80% (increasing the number/bits before the probabilistic shaping decoding), and the rule 2 is obtained by using the bifurcation map. In the method, the bit error is only increased by about 2%, which greatly reduces the amount of bit error diffusion.
  • 64QAM is taken as an example.
  • the first mapping rule M1 adopts the Gray mapping mode as shown in FIG. 1
  • the second mapping rule M2 adopts the rotation mapping mode. All constellation points in each quadrant can form a square, with the intersection of the diagonals of the square as the center of the circle, rotated 180 degrees.
  • the combination of the first mapping rule and the second mapping rule is also a Gray mapping.
  • the first mapping rule and the second mapping rule of the first quadrant are combined as shown in FIG. 9. The figure can be found that the combination of the first mapping rule and the second mapping rule is Gray coding.
  • the first bit sequence bm1 input by the transmitting device is divided into two paths, one channel directly outputs the first bit sequence bm1, and the second channel uses the second mapping rule M2 as shown in Table 2 to convert the first bit sequence bm1 into the second mapping rule M2.
  • the flag is incremented to confirm which path is selected to obtain the third bit sequence; next, by comparing the power conditions of the two channels, the signal with the smaller power is selected.
  • the third bit sequence is FEC encoded, which increases the parity bit.
  • the FEC-encoded third bit sequence is mapped into symbol information according to the mapping rule M1.
  • the mapping rule M1 For 64QAM, every 6 bits form one symbol, and then the symbol information is subjected to relevant DSP processing, and then transmitted through an optical fiber or the like.
  • the symbol information processed by the DSP is demapped using the first mapping rule M1, and each symbol information obtains 6 bits.
  • decoding is performed according to the check bit to obtain a third bit sequence.
  • Table 3 shows the power correspondence of different bit information in the first mapping rule M1 and the second mapping rule M2. Similar to the second mapping rule M2 obtained by the folding method, the power is not completely reversed by energy.
  • the performance results are shown in Table 5.
  • the original scheme increases the bit error by about 80%, and the rotation mode increases the bit error to about 20%.
  • the present application provides a transmitting apparatus, including:
  • the first mapping module 1410 is configured to map the first bit sequence by using a first mapping rule to obtain a first mapping symbol group
  • the second mapping module 1420 is configured to map the second bit sequence by using the first mapping rule to obtain a second mapping symbol group
  • the selecting module 1430 is configured to determine a third bit sequence according to the power of the first mapping symbol group or the power of the second mapping symbol group;
  • the forward error correction coding module 1440 is configured to perform forward error correction coding on the third bit sequence.
  • the third mapping module 1450 is configured to map the third bit sequence after the forward error correction coding by using the first mapping rule to obtain symbol information
  • Sending module 1460 configured to send symbol information
  • the first mapping rule is a Gray mapping, and the plurality of bits corresponding to the constellation points of the Gray mapping are first mapping bit information.
  • the present application provides a receiving apparatus, including:
  • the receiving module 1510 is configured to receive symbol information
  • the first demapping module 1520 is configured to demap the symbol information by using the first mapping rule to obtain a third bit sequence after forward error correction coding;
  • the forward error correction decoding code module 1530 is configured to perform forward error correction decoding on the third error sequence after forward error correction coding
  • the determining module 1540 is configured to determine the first bit sequence and output in response to the flag bit of the third bit sequence after the forward error correction decoding is the first flag bit; or to decode the third bit in response to the forward error correction decoding
  • the flag bit of the bit sequence is the result of the second flag bit
  • the second demapping module 1550 is configured to output the symbols corresponding to the second mapping sequence under the second mapping rule according to the first mapping rule, and output the symbols;
  • the first mapping rule is a Gray mapping
  • the plurality of bits corresponding to the constellation points of the Gray mapping are first mapping bit information
  • the multiple bits corresponding to the constellation points of the second mapping rule are second mapping bits.
  • the second mapping bit information is bit information corresponding to the constellation point after the first mapping bit information corresponding to all the constellation points in each of the quadrants in the constellation in the first mapping rule is folded or rotated.
  • the present application provides a transmitting apparatus including a first processor 1610 and a first computer readable storage medium 1620.
  • the first computer readable storage medium 1620 stores a first instruction when the first instruction When executed by the first processor 1610, the information processing method described in the embodiment on the transmitting device side is implemented.
  • the present application provides a receiving apparatus including a second processor 1710 and a second computer readable storage medium 1720.
  • the second computer readable storage medium 1720 stores a second instruction when the second instruction When executed by the second processor 1710, the information processing method described in the embodiment on the receiving device side is implemented.
  • the present application proposes a computer readable storage medium having stored thereon a computer program that, when executed by a processor, implements the information processing method of any of the embodiments.
  • the first computer readable storage medium or the second computer readable storage medium includes at least one of the following: a flash memory, a hard disk, a multimedia card, a card type memory (for example, a Secure Digital Memory Card (SD card) or data) Register (Data Register, DX) memory, etc., Random Access Memory (RAM), Static Random Access Memory (SRAM), Read Only Memory (ROM), electrically erasable Electrically Erasable Programmable Read-Only Memory (EEPROM), Programmable Read-Only Memory (PROM), magnetic memory, magnetic disk, optical disk, and the like.
  • SD card Secure Digital Memory Card
  • DX Data Register
  • RAM Random Access Memory
  • SRAM Static Random Access Memory
  • ROM Read Only Memory
  • EEPROM Electrically erasable Electrically Erasable Programmable Read-Only Memory
  • PROM Programmable Read-Only Memory
  • the first processor or the second processor may be a Central Processing Unit (CPU), a controller, a microcontroller, a microprocessor, or other data processing chip or the like.
  • CPU Central Processing Unit
  • controller a controller
  • microcontroller a microprocessor
  • other data processing chip or the like may be a Central Processing Unit (CPU), a controller, a microcontroller, a microprocessor, or other data processing chip or the like.
  • the present application proposes an information processing system including any of the above-described transmitting devices and any of the above-described receiving devices.
  • the second mapping rule of the present application is obtained by folding or rotating the first mapping bit information corresponding to all the constellation points in each quadrant of the constellation diagram under the first mapping rule, because the first mapping rule is a Gray mapping, and the second mapping
  • the rule does not change the neighbor relationship of the bit information as a whole, and the second mapping rule is basically reversed in power after being folded or rotated. Therefore, the combination of the second mapping rule and the first mapping rule is also a Gray mapping, thereby maintaining as much as possible The power is reversely aligned while reducing bit error diffusion.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Physics & Mathematics (AREA)
  • Electromagnetism (AREA)
  • Digital Transmission Methods That Use Modulated Carrier Waves (AREA)

Abstract

本文公开了一种信息处理方法，包括：采用第一映射规则对第一比特序列进行映射得到第一映射符号组；采用所述第一映射规则对第二比特序列进行映射得到第二映射符号组；根据第一映射符号组的功率和第二映射符号组的功率确定第三比特序列，并对第三比特序列进行前向纠错编码；采用第一映射规则对前向纠错编码后的第三比特序列进行映射得到符号信息并发送。本文还公开了发送装置、接收装置、信息处理系统以及存储介质。

Description

信息处理方法和系统、发送装置及接收装置
本申请要求在2018年01月22日提交中国专利局、申请号为201810059531.6的中国专利申请的优先权，该申请的全部内容通过引用结合在本申请中。
技术领域
本申请涉及光纤通信领域，例如涉及一种信息处理方法和系统、发送装置及接收装置。
背景技术
概率整形不仅使系统性能更接近香农极限，也可以灵活调整概率，满足多种场景的应用需求。分布匹配(Distribution Matching，DM)是概率整形的关键技术之一，它将均匀分布的数据转变成预期概率分布的数据。均匀成分分布匹配(Constant Composition Distribution Matching，CCDM)是一种有效的DM技术，适用于多种调制格式，它通过一种简单的信源编码(即算术编码)来实现，实现方式相对简单，但是存在误码扩散的问题。剪切粘贴(Cut and Paste，CAP)技术是一种更加简单的DM技术，通过两种不同映射(Mapping)规则，按照多个符号总功率最小的原则选择对应的Mapping，从而实现概率整形。
CAP采用了两种不同的映射规则，第一个映射规则是格雷映射，第二个映射规则是完全与第一个映射规则的功率逆向排列的映射规则。实际系统中第二个映射规则由于功率是逆向排列，并不是格雷映射，这样当信号发生相邻符号误判时可能会导致多个误比特的发生，从而导致误比特扩散。
发明内容
本申请提供了一种信息处理方法和系统、发送装置及接收装置，能够在尽量保持功率逆向排列的同时降低误比特扩散。
在一实施例中，本申请提供了一种信息处理方法，包括：
采用第一映射规则对第一比特序列进行映射得到第一映射符号组；
采用所述第一映射规则对第二比特序列进行映射得到第二映射符号组；
根据所述第一映射符号组的功率和所述第二映射符号组的功率确定第三比特序列，并对所述第三比特序列进行前向纠错编码；
采用所述第一映射规则对所述前向纠错编码后的第三比特序列进行映射得到符号信息并发送；
其中，所述第一映射规则为格雷映射，所述格雷映射的星座点对应的多个比特为第一映射比特信息。
在一实施例中，本申请提出了一种信息处理方法，包括：
接收符号信息，采用第一映射规则对所述符号信息进行解映射得到前向纠错编码后的第三比特序列；
对所述前向纠错编码后的比特序列进行前向纠错解码；
响应于前向纠错解码后的第三比特序列的标志位是第一标志位的结果，确定第一比特序列并输出；或响应于前向纠错解码后的第三比特序列的标志位是第二标志位的结果，对第二比特序列在所述第二映射规则下对应的符号按照第一射规则进行解映射后输出；
其中，所述第一映射规则为格雷映射，所述格雷映射的星座点对应的多个比特为第一映射比特信息；所述第二映射规则的星座点对应的多个比特为第二映射比特信息，所述第二映射比特信息为将所述第一映射规则下的星座图中每一个象限的所有星座点对应的第一映射比特信息进行对折或旋转后，所述星座点对应的比特信息。
在一实施例中，本申请提出了一种发送装置，包括：
第一映射模块，设置为采用第一映射规则对第一比特序列进行映射得到第一映射符号组；
第二映射模块，设置为采用所述第一映射规则对第二比特序列进行映射得到第二映射符号组；
选择模块，设置为根据所述第一映射符号组的功率或所述第二映射符号组 的功率确定第三比特序列；
前向纠错编码模块，设置为对所述第三比特序列进行前向纠错编码；
第三映射模块，设置为采用所述第一映射规则对所述前向纠错编码后的第三比特序列进行映射得到符号信息；
发送模块，设置为发送所述符号信息；
其中，所述第一映射规则为格雷映射，所述格雷映射的星座点对应的多个比特为第一映射比特信息。
在一实施例中，本申请提出了一种接收装置，包括：
接收模块，设置为接收符号信息；
第一解映射模块，设置为采用第一映射规则对所述符号信息进行解映射得到前向纠错编码后的第三比特序列；
前向纠错解码模块，设置为对所述前向纠错编码后的第三比特序列进行前向纠错解码；
确定模块，响应于前向纠错解码后的第三比特序列的标志位是第一标志位的结果，确定第一比特序列并输出；或响应于前向纠错解码后的第三比特序列的标志位是第二标志位的结果；
第二解映射模块，设置为对第二比特序列在所述第二映射规则下对应的符号按照第一映射规则进行解映射后输出；
其中，所述第一映射规则为格雷映射，所述格雷映射的星座点对应的多个比特为第一映射比特信息；所述第二映射规则的星座点对应的多个比特为第二映射比特信息，所述第二映射比特信息为将所述第一映射规则下的星座图中每一个象限的所有星座点对应的第一映射比特信息进行对折或旋转后，所述星座点对应的比特信息。
在一实施例中，本申请提出了一种发送装置，包括处理器和计算机可读存储介质，所述计算机可读存储介质中存储有指令，当所述指令被所述处理器执行时，实现应用在发送装置侧的上述任一实施例所述的信息处理方法。
本申请提出了一种接收装置，包括处理器和计算机可读存储介质，所述计 算机可读存储介质中存储有指令，当所述指令被所述处理器执行时，实现应用在接收装置侧的上述任一实施例所述的信息处理方法。
在一实施例中，本申请提出了一种信息处理系统，包括上述任一实施例所述的发送装置以及上述任一实施例所述的接收装置。
在一实施例中，本申请提出了一种计算机可读存储介质，其上存储有计算机程序，所述计算机程序被处理器执行时实现应用在发送装置侧的上述任一实施例所述的信息处理方法。
本申请提出了一种计算机可读存储介质，其上存储有计算机程序，所述计算机程序被处理器执行时实现应用在接收装置侧的上述任一实施例所述的信息处理方法。
附图说明
图1为相关技术64正交振幅调制(64Quadrature Amplitude Modulation，64QAM)第一映射规则下的星座图的第一象限示意图；
图2为相关技术第二映射规则下的星座图的第一象限示意图；
图3为本申请的CAP编码系统的结构组成示意图；
图4为本申请中的一种信息处理方法的流程图；
图5为本申请中的一种对折方案的示意图；
图6为本申请中的一种对折方案对折后的示意图；
图7为本申请中的另一种对折方案的示意图；
图8为本申请中的另一种对折方案对折后的示意图；
图9为本申请中的一种旋转方案的示意图；
图10为本申请中的一种请旋转方案旋转后的示意图；
图11为本申请中的另一种旋转方案的示意图；
图12为本申请中的另一种旋转方案旋转后的示意图；
图13为本申请中的另一种信息处理方法的流程图；
图14为本申请中的一种发送装置的结构组成示意图；
图15为本申请中的一种接收装置的结构组成示意图；
图16为本申请中的另一种发送装置的结构组成示意图；
图17为本申请中的另一种接收装置的结构组成示意图。
具体实施方式
下文中将结合附图对本申请的实施例进行说明。在不冲突的情况下，本申请中的实施例及实施例中的特征可以相互任意组合。
在附图的流程图示出的步骤可以在诸如一组计算机可执行指令的计算机系统中执行。并且，虽然在流程图中示出了逻辑顺序，但是在一些情况下，可以以不同于此处的顺序执行所示出或描述的步骤。
一般情况下，映射规则确定后，星座点位置对应的符号就确定了。靠近零坐标点的功率偏小，远离零坐标点的功率偏大。图1为相关技术64正交振幅调制(64 Quadrature Amplitude Modulation，64QAM)星座图的第一象限示意图(图中省去代表象限位置的符号位00，其他象限对应的符号位分别为01，10，11)。在星座图中，横轴代表实部，纵轴代表虚部。如图1所示，在比特信息0000的前面加上符号位00，得到比特序列000000，对应的符号在位置1+i，功率为2；在比特信息1100的前面加上符号位00，得到比特序列001100，对应的符号在位置7+7i，功率为98。比特序列000000对应的符号的功率相对于符号001100的功率小。对于均匀编码的信号而言，星座图上每一个星座点对应的符号数量基本相等，所以传输时符号的总平均功率和星座图上所有星座点的平均功率基本相等。
第一个映射规则是格雷映射，也就是说相邻两个符号之间只有一个比特不同，如图1所示，这样信号发生相邻符号的误判时也只有一个比特的误码。第二个映射规则是完全与第一个映射规则的功率逆向排列的映射规则。两种映射规则下，同一个符号所在的星座点位置不同，每个符号映射时选取功率小的映射规则。采用这种方法后，在坐标原点附近的符号偏多，远离坐标原点的符号偏少，符合概率编码需求。
如图2所示的映射规则就是图1的功率逆向排列。
第一映射规则采用的是格雷映射，第二映射规则选择和第一映射规则的功率逆向排列时，如表1和图2所示，表1是64QAM第一象限的映射规则，另外三个象限与此表不同的是，比特信息bm1、bm2的前两位不同，后四位相同；映射M1、M2后的符号坐标分别为对应象限内的坐标，例如，bm1为000000的M1坐标为1+1j；bm1为100000的M1坐标为第四象限的1-1j，或者为第二象限的-1+1j；bm1为110000的M1坐标为第三象限的-1-1j。最终输出的符号信息会得到最符合要求的概率分布，但由于此时第二映射规则和第一映射规则结合并不是格雷映射，所以在光信噪比(Optical Signal Noise Ratio，OSNR)较小时，误比特扩散比较严重。
表1
Figure PCTCN2019072618-appb-000001
表1中，第一列为第一映射比特信息bm1，第二列为第一映射规则M1下第一比特比特信息bm1对应的符号信息，第三列为第一映射比特信息对应的功率， 第四列为第二映射比特信息bm2，第五列为第一映射规则下第二比特信息bm2对应的符号信息，第六列为第二比特信息bm2对应的符号信息。
图3为本申请的CAP编码系统框图。如图3所示，CAP编码系统包括发送装置和接收装置。
其中，发送装置包括第一映射模块、第二映射模块、选择模块、前向纠错(Forward Error Correction，FEC)编码模块、第三映射模块、发送模块；接收装置包括接收模块、第一解映射模块、FEC解码模块、确定模块、第二解映射模块。
先将输入的数据比特分组，每组的数据b0比特个数为(N×D-1)，其中D是每组的符号数，D至少为2；N是每符号对应的比特数。
第一映射模块设置为输入的一组数据比特序列b0之前加额外比特‘0’，组成N×D个比特，称为第一比特序列b1，并按照M1进行映射，得到D个符号，称为第一映射符号组。
第二映射模块，设置为在输入的一组数据比特序列b0之前加额外比特‘1’，组成N×D个比特b0’，并进行
Figure PCTCN2019072618-appb-000002
得到第二比特序列b2；
选择模块，设置为按照第一映射规则，选择第一比特信息b1和第二比特信息b2中功率较小的比特信息，作为第三比特序列；
FEC编码模块，设置为对第三比特序列进行FEC编码，并在FEC编码过程中增加校验位；
第一映射模块，设置为采用第一映射规则M1对FEC编码后的第三比特序列进行映射得到符号信息；
发送模块，设置为对符号信息进行数字信号处理(Digital Signal Processing，DSP)。
其中，接收模块，设置为接收信号并进行DSP处理得到符号信息；
第一解映射模块，设置为采用第一映射规则M1对符号信息进行解映射得到FEC编码后的第三比特序列；
FEC解码模块，设置为根据校验位对FEC编码后的第三比特序列进行FEC 解码；
确定模块，设置为根据第三比特序列中的额外比特确定第三比特序列是第一比特序列b1还是第二比特序列b2：如果第三比特序列中的第一比特是‘0’，则第三比特序列是第一比特序列b1，去掉b1的第一个额外比特即得到原始数据序列b0；如果第三比特序列中的第一比特是‘1’，则第三比特序列是第二比特序列b2，将第三比特序列发送给第二解映射模块；
第二解映射模块，设置为先用第二映射规则对比特序列进行映射，再用第一映射规则进行解映射，最后去掉第一个额外比特即得到原始数据序列b0。
参见图4，本申请提出了一种信息处理方法，包括步骤400至步骤430。
步骤400、采用第一映射规则对第一比特序列进行映射得到第一映射符号组。
在一实施例中，采用第一映射规则对第一比特序列进行映射得到第一映射符号组，包括：
基于数据比特组加上第一标志位，得到所述第一比特序列；
采用所述第一映射规则对所述第一比特序列进行映射得到所述第一映射符号组。
步骤410、采用所述第一映射规则对第二比特序列进行映射得到第二映射符号组。
在一实施例中，采用所述第一映射规则对第二比特序列进行映射得到第二映射符号组，包括：
基于数据比特组加上第二标志位后，再进行
Figure PCTCN2019072618-appb-000003
得到所述第二比特序列；
采用所述第一映射规则对所述第二比特序列进行映射得到所述第二映射符号组；
其中，b0’是基于所述数据比特组加上所述第二标志位后得到的序列，所述M1和所述M2是分别按照所述第一映射规则和第二映射规则进行映射，所述
Figure PCTCN2019072618-appb-000004
和所述
Figure PCTCN2019072618-appb-000005
是分别按照所述第一映射规则和所述第二映射规则进行解映射；所述第二映射规则的星座点对应的多个比特为第二映射比特信息，所述第二映射比 特信息为将所述第一映射规则下的星座图中每一个象限的所有星座点对应的第一映射比特信息进行对折或旋转后，所述星座点对应的比特信息。
在一实施例中，第一映射比特信息可以理解为第一映射符号组中每个符号(即每个星座点)对应的比特。第二映射比特信息可以理解为第二映射符号组中每个符号(即每个星座点)对应的比特。映射，可以理解为将比特映射为符号，多个符号组成了符号组。
在一实施例中，将输入的数据比特分组，每组的数据b0比特个数为(N×D-1)，其中，D是每组的符号数，D至少为2；N是每个符号对应的比特数；减1是减去标记映射规则所增加的标志位。在一实施例中，标志位也可以理解为额外比特。
采用输入的一组数据比特序列b0之前加额外比特‘0’，组成N×D个比特，称为第一比特序列b1，并按照M1进行映射，得到D个符号，称为第一映射符号组。
输入的一组数据比特序列b0之前加额外比特‘1’，组成N×D个比特b0’，再进行
Figure PCTCN2019072618-appb-000006
得到第二比特序列b2。其中，
Figure PCTCN2019072618-appb-000007
是将b0’先按照第一映射规则M1得到符号，查找该符号对应的第二映射规则M2的比特信息(即对该符号按照第二映射规则进行解映射)，M1、M2是分别按照第一映射规则和第二映射规则进行映射，
Figure PCTCN2019072618-appb-000008
是分别按照第一映射规则和第二映射规则进行解映射。
将b2按照M1进行映射，得到D个符号，称为第二映射符号组。
本申请中，第一映射规则为格雷映射，所述格雷映射的星座点对应的多个比特(比特信息bm1)为第一映射比特信息。第二映射规则的星座点对应的多个比特(比特信息bm2)为第二映射比特信息，所述第二映射比特信息为将第一映射规则下的星座图中每一个象限的所有星座点对应的第一映射比特信息进行对折或旋转后，星座点对应的比特信息。
本申请第二映射规则对应的第二映射比特信息通过将第一映射规则下的星座图中每一个象限的所有星座点对应的第一映射比特信息进行对折或旋转后得到，由于第一映射规则为格雷映射，第二映射规则总体上并没有改变第一映射规则下的星座点对应的比特信息的相邻关系，即第二映射规则和第一映射规则 结合下的星座图的每一个星座点与相邻的星座点之间均只有一个比特信息不同，这样，即使概率译码前的信号发生一个比特的错误，那么概率译码后也就只有一个比特的错误，并且对折或旋转后使得第二映射规则为功率逆向排列，因此，第二映射规则和第一映射规则结合也是格雷映射，从而在尽量保持功率逆向排列的同时降低了误比特扩散。
本申请中，将第一映射规则下的星座图中每一个象限的所有星座点对应的第一映射比特信息进行对折，是指将第一映射规则下的星座图中每一个象限的所有星座点对应的第一映射比特信息沿着对称轴进行对折，如图5和图7所示。也就是说，将第一映射规则下的星座图中每一个象限中与对称轴对称的两个星座点对应的第一映射比特信息互换。
在一实施例中，如果第一映射规则下的星座图中每一个象限的所有星座点构成一个正方形或正多边形(如正六边形、正八边形等)，那么，上述对称轴可以是正方形的第一对角线，如图5所示；其中，第一对角线与第二对角线垂直，第二对角线是指该象限中功率最大的星座点和功率最小的星座点的连线，对折后得到的星座图的第一象限如图6所示。也就是说，将第一对角线右上部分和左下部分进行对称映射，即将第一映射规则下的星座图中每一个象限中与第一对角线对称的两个星座点对应的第一映射比特信息互换，这样第一映射规则和第二映射规则结合仍然是格雷映射，并且保持功率逆向排序，从而在保持功率逆向排序的同时降低了误比特扩散。
在一实施例中，如果第一映射规则下的星座图的所有星座点构成一个圆形，那么，上述对称轴为第一映射规则下的星座图中半径为
Figure PCTCN2019072618-appb-000009
对应的圆，如图7所示的虚线。图7为例，最小功率的半径为1，其功率为p；最大功率的半径为4，其功率为16p，对称轴是半径为2.5的圆。
其中，R 1为第一映射规则下的星座图中的所有星座点的功率最小的圆对应的半径，R 2为第一映射规则下的星座图中的所有星座点的功率最大的圆对应的半径。
对折后得到的星座图的第一象限如图8所示，也就是说，将半径为
Figure PCTCN2019072618-appb-000010
对应的圆右上部分和左下部分进行对称映射，即将第一映射规则下的星座图中每 一个象限中与半径为
Figure PCTCN2019072618-appb-000011
对应的圆对称的两个星座点对应的第一映射比特信息互换，这样第一映射规则和第二映射规则结合仍然是格雷映射，并且保持功率逆向排序，从而在保持功率逆向排序的同时降低了误比特扩散。
本申请中，将第一映射规则下的星座图中每一个象限的所有星座点对应的第一映射比特信息进行旋转，是指将第一映射规则下的星座图中每一个象限的所有星座点对应的第一映射比特信息绕象限的对称中心旋转180度，如图9和图11所示。
在一实施例中，如果第一映射规则下的星座图中每一个象限的所有星座点构成一个正方形或正多边形(如正六边形、正八边形等)，那么，上述对称中心为正方形或正多边形的对角线的交点，如图9所示，旋转后得到的星座图的第一象限如图10所示。
在一实施例中，如果第一映射规则下的星座图的所有星座点构成一个圆形，那么，上述对称中心为第一映射规则下的星座图中半径为
Figure PCTCN2019072618-appb-000012
对应的圆与预设直线的交点，如图11所示；其中，预设直线与星座图的坐标轴的夹角为45度。旋转后得到的星座图的第一象限如图12所示。
本申请中，可以预先设置第二映射规则，可以采用多种方式进行设置，例如，采用如表2或表3所示的表格形式。其中，表2为对折方案下的映射关系表，表3为旋转方案下的映射关系表。表2和表3均以64QAM为例示出，由于功率是根据比特信息对应的符号信息计算得到，因此，功率信息可以是指比特信息对应的符号信息，或者根据比特信息对应的符号信息计算得到的功率值。
表2
Figure PCTCN2019072618-appb-000013
Figure PCTCN2019072618-appb-000014
表3
Figure PCTCN2019072618-appb-000015
步骤420、根据第一映射符号组的功率和第二映射符号组的功率确定第三比特序列，并对第三比特序列进行FEC编码。
本申请中，可以从第一映射符号组和第二映射符号组中选择功率较小的比特信息，得到第三比特序列，标志位用于标记选择的是第一比特序列还是第二比特序列，例如标志位采用0表示选择的是第一比特序列，采用1表示选择的是第二比特序列。
在一实施例中，根据所述第一映射符号组的功率和所述第二映射符号组的功率确定第三比特序列，包括：
计算所述第一映射符号组中每个符号的功率，将所述第一映射符号组中每个符号的功率相加后得到所述第一映射符号组的总功率；
计算所述第二映射符号组中每个符号的功率，将所述第二映射符号组中每个符号的功率相加后得到所述第二映射符号组的总功率；
选取所述第一映射符号组的总功率和所述第二映射符号组的总功率中功率小的符号组对应的比特序列，作为所述第三比特序列。
例如，对于64QAM，设原始数据比特分组为2个符号，即D＝2，假设一组原始数据比特b0为00011 000101，则加额外比特‘0’得到第一比特序列b1为000011 000101，如果采用对折方案，加额外比特‘1’得到第二比特序列b2为101111 000110，则从表2中查找得到第一比特序列b1的功率为18+26＝44，第二比特序列b2的功率为50+58＝108，第一比特序列b1的功率小于第二比特序列b2的功率，因此，选择第一比特序列b1作为第三比特序列，即第三比特信息为000011 000101，其中，第一位0表示选择的是第一比特序列。
本申请中，在对第三比特序列进行FEC编码过程中增加校验位，该校验位用于接收装置进行FEC解码。
步骤430、采用所述第一映射规则对FEC编码后的第三比特序列进行映射得到符号信息并发送。
本申请中，可以先对符号信息进行发射端DSP处理(如发射端滤波处理、延时处理、非线性处理等)后再发送，从而对符号信息进行补偿。
在一实施例中，参见图13，本申请提出了一种信息处理方法，包括：
步骤1300、接收符号信息，采用第一映射规则对符号信息进行解映射得到FEC编码后的第三比特序列。
本申请中，在采用第一映射规则对符号信息进行解映射之前还可以对接收的信息进行DSP处理得到符号信息。
步骤1310、对前向纠错编码后的第三比特序列进行前向纠错解码。
步骤1320、响应于前向纠错解码后的第三比特序列的标志位是第一标志位的结果，确定第一比特序列并输出；或响应于前向纠错解码后的第三比特序列的标志位是第二标志位的结果，对第二比特序列在所述第二映射规则下对应的符号按照第一映射规则进行解映射后并输出。
根据所述第三比特序列的标志位(即第一个额外比特)是‘0’还是‘1’，确定是否要用第二映射规则进行解映射：如果第一个额外比特是‘0’，则比特序列不改变；如果第一个额外比特是‘1’，则把对应的M1符号按照M2进行解映射。
本申请中，根据第三比特序列中的标志位判断第三比特序列中除标志位之外的序列是第一比特序列还是第二比特序列，如果第三比特序列中除标志位之外的比特序列是第一比特序列，则直接输出第一比特序列；如果第三比特序列中除标志位之外的比特序列是第二比特序列，则先用第二映射规则对第二比特序列进行映射，再用第一映射规则进行解映射后输出。
本申请中，第一映射规则为格雷映射，所述格雷映射的星座点对应的多个比特为第一映射比特信息；第二映射规则的星座点对应的多个比特为第二映射比特信息，所述第二映射比特信息为将第一映射规则下的星座图中每一个象限的所有星座点对应的第一映射比特信息进行对折或旋转后，星座点对应的比特信息。
本申请第二映射规则通过将第一映射规则下的星座图中每一个象限的所有星座点对应的第一映射比特信息进行对折或旋转后得到，由于第一映射规则为格雷映射，第二映射规则总体上并没有改变第一映射规则下的星座点对应的比特信息的相邻关系，即第二映射规则和第一映射规则结合下的星座图的每一个星座点与相邻的星座点之间均只有一个比特信息不同，这样，即使概率译码前的信号发生一个比特的错误，那么概率译码后也就只有一个比特的错误，并且 对折或旋转后使得第二映射规则为功率逆向排列，因此，第二映射规则和第一映射规则结合也是格雷映射，从而在尽量保持功率逆向排列的同时降低了误比特扩散。
本申请中，将第一映射规则下的星座图中每一个象限的所有星座点对应的第一映射比特信息进行对折，是指将第一映射规则下的星座图中每一个象限的所有星座点对应的第一映射比特信息沿着对称轴进行对折，如图5和图7所示。也就是说，将第一映射规则下的星座图中每一个象限中与对称轴对称的两个星座点对应的第一映射比特信息互换。
在一实施例中，如果第一映射规则下的星座图中每一个象限的所有星座点构成一个正方形或正多边形(如正六边形、正八边形等)，那么，上述对称轴可以是正方形的第一对角线，如图5所示；其中，第一对角线与第二对角线垂直，第二对角线是指该象限中功率最大的星座点和功率最小的星座点的连线，对折后得到的星座图的第一象限如图6所示。也就是说，将第一对角线右上部分和左下部分进行对称映射，即将第一映射规则下的星座图中每一个象限中与第一对角线对称的两个星座点对应的第一映射比特信息互换，这样第一映射规则和第二映射规则结合仍然是格雷映射，并且保持功率逆向排序，从而在保持功率逆向排序的同时降低了误比特扩散。
在一实施例中，如果第一映射规则下的星座图的所有星座点构成一个圆形，那么，上述对称轴为第一映射规则下的星座图中半径为
Figure PCTCN2019072618-appb-000016
对应的圆，如图7所示的虚线。
其中，R 1为第一映射规则下的星座图中的所有星座点的功率的最小的圆对应的半径，R 2为第一映射规则下的星座图中的所有星座点的功率的最大的圆对应的半径。
对折后得到的星座图的第一象限如图8所示，也就是说，将半径为
Figure PCTCN2019072618-appb-000017
对应的圆右上部分和左下部分进行对称映射，即将第一映射规则下的星座图中每一个象限中与半径为
Figure PCTCN2019072618-appb-000018
对应的圆对称的两个星座点对应的第一映射比特信息互换，这样第一映射规则和第二映射规则结合仍然是格雷映射，并且保持功率逆向排序，从而在保持功率逆向排序的同时降低了误比特扩散。
本申请中，将第一映射规则下的星座图中每一个象限的所有星座点对应的第一映射比特信息进行旋转，是指将第一映射规则下的星座图中每一个象限的所有星座点对应的第一映射比特信息绕象限的对称中心旋转180度，如图9和图11所示。
在一实施例中，如果第一映射规则下的星座图中每一个象限的所有星座点构成一个正方形或正多边形(如正六边形、正八边形等)，那么，上述对称中心为正方形或正多边形的对角线的交点，如图9所示，旋转后得到的星座图的第一象限如图10所示。
在一实施例中，如果第一映射规则下的星座图的所有星座点构成一个圆形，那么，上述对称中心为第一映射规则下的星座图中半径为
Figure PCTCN2019072618-appb-000019
对应的圆与预设直线的交点，如图11所示；其中，预设直线与星座图的坐标轴的夹角为45度。旋转后得到的星座图的第一象限如图12所示。
本申请中，可以预先设置第二映射规则，可以采用多种方式进行设置，例如，采用如表2或表3所示的表格形式。其中，表2为对折方案下的映射关系表，表3为旋转方案下的映射关系表。表2和表3均以64QAM为例示出，由于功率是根据比特信息对应的符号信息计算得到，因此，功率信息可以是指比特信息对应的符号信息，或者根据比特信息对应的符号信息计算得到的功率值。
上述方法不仅适用于方形QAM，也适用圆形振幅移相键控(Amplitude Phase Shift Keying，APSK)。
下面通过实例说明本申请的方法。
第一实例
本实施例以64QAM为例进行说明，第一映射规则M1采用如图1所示的格雷映射方式，第二映射规则M2采用对折映射方式，也就是使用图5中的对角线进行对折。沿着对角线，将对角线右上部分和左下部分进行对称映射。这样第一映射规则和第二映射规则结合仍然是格雷映射，第一象限的第一映射规则和第二映射规则结合如图6所示。
本实施例信息处理过程如下：
在发送装置输入的第一比特序列bm1分成两路，一路直接输出第一比特序 列bm1，第二路采用第二映射规则M2如表2将第一比特序列bm1转换成第二映射规则M2下的第二比特序列bm2，如将000011转换成映射规则2下的001111；
增加标志位来确认选择的是哪路，比如原始比特信息是00011 000101(11个比特信息是因为后面会增加1比特的标志位)，一路输出比特仍为00011 000101，另一路输出01111 000110，根据功率对应表2，接下来通过比较两路的功率情况，选择功率较小的那路信号，一路的功率为18+26＝44，另一路的功率为50+58＝108，选择功率较小的那路，也就是00011 000101，通过标志位，比如0表示选择上面一路的比特，1表示选择下面一路的比特，输出第三比特序列000011 000101。
接下来将第三比特信息进行FEC编码，会增加校验位。
接下来将FEC编码后的第三比特序列根据第一映射规则M1映射成符号信息，对于64QAM而言，每6个比特组成一个符号，接下来对符号信息进行相关DSP处理，进而过光纤等传输。
在接收装置将接收到的符号信息进行DSP处理后，将DSP处理后的符号信息使用第一映射规则M1进行解映射，每个符号信息获得6个比特信息。获得比特信息后根据校验位进行解码获取第三比特序列。
接下来分为两路，一路直接输出第一比特序列，另一路根据第一映射规则M1和第二映射规则M2的比特功率对应表如表2，将第三比特序列中除标志位外的比特序列先按第二映射规则M2映射成符号，再按第一映射规则M1解映射。
接下来通过通道选择，根据发射装置增加的标志位来确定选择哪一路，获得最终比特序列。
表2给出了不同比特信息在第一映射规则M1、第二映射规则M2的功率对应情况。表中显示其中的某些点虽然不是完全能量逆向排序。但保证了第一映射规则M1和第二映射规则M2结合为格雷编码。假设信源比特为001101，概率编码之后为000010(即选择的比特信息)，而概率译码前解映射后的发生误比特，判断为000011，那么概率译码之后为001111，仍然只有一个误比特，没有发生误比特扩散。
性能结果见表4，表4显示原始方案(采用功率完全按降序排列)，误比特 增加80％左右(增加个数/概率整形译码前误比特个数)，而采用对折映射获得规则2的方法中，误比特只增加了2％左右，大大降低误比特扩散量。
表4
Figure PCTCN2019072618-appb-000020
第二实例
本实施例以64QAM为例进行说明，第一映射规则M1采用如图1所示的格雷映射方式，第二映射规则M2采用旋转映射方式。每个象限的所有星座点可以组成一个正方形，以正方形的对角线的交点为圆心，旋转180度。这样第一映射规则和第二映射规则结合也是格雷映射，第一象限的第一映射规则和第二映射规则结合如图9所示，由图可以发现第一映射规则和第二映射规则结合是格雷编码。
本实施例信息处理过程如下：
在发送装置输入的第一比特序列bm1分成两路，一路直接输出第一比特序列bm1，第二路采用第二映射规则M2如表2将第一比特序列bm1转换成第二映射规则M2下的第二比特序列bm2。
增加标志位来确认选择的是哪路得到第三比特序列；接下来通过比较两路的功率情况，选择功率较小的那路信号。
接下来将第三比特序列进行FEC编码，会增加校验位。
接下来将FEC编码后的第三比特序列根据映射规则M1映射成符号信息，对于64QAM而言，每6个比特组成一个符号，接下来对符号信息进行相关DSP处理，进而过光纤等传输。
在接收装置将接收到的符号信息进行DSP处理后，将DSP处理后的符号信息使用第一映射规则M1进行解映射，每个符号信息获得6个比特。获得比特信息后根据校验位进行解码获取第三比特序列。
接下来分为两路，一路直接输出第一比特序列，另一路根据第一映射规则M1和第二映射规则M2的比特功率对应表如表2，将第三比特序列中除标志位外的比特序列从第二映射规则M2下解映射。
接下来通过通道选择，根据发射装置增加的标志位来确定选择哪一路，获得最终比特序列。
表3给出了不同比特信息在第一映射规则M1、第二映射规则M2的功率对应情况。和对折方式获得第二映射规则M2类似，功率不完全按能量逆向排序。
性能结果见表5，原始方案增加误比特为80％左右，旋转方式增加误比特为20％左右。
表5
Figure PCTCN2019072618-appb-000021
参见图14，本申请提出了一种发送装置，包括：
第一映射模块1410，设置为采用第一映射规则对第一比特序列进行映射得到第一映射符号组；
第二映射模块1420，设置为采用所述第一映射规则对第二比特序列进行映射得到第二映射符号组；
选择模块1430，设置为根据第一映射符号组的功率或第二映射符号组的功率确定第三比特序列；
前向纠错编码模块1440，设置为对第三比特序列进行前向纠错编码；
第三映射模块1450，设置为采用所述第一映射规则对前向纠错编码后的第三比特序列进行映射得到符号信息；
发送模块1460，设置为发送符号信息；
其中，第一映射规则为格雷映射，所述格雷映射的星座点对应的多个比特为第一映射比特信息。
参见图15，本申请提出了一种接收装置，包括：
接收模块1510，设置为接收符号信息；
第一解映射模块1520，设置为采用第一映射规则对符号信息进行解映射得到前向纠错编码后的第三比特序列；
前向纠错解码码模块1530，设置为对前向纠错编码后的第三比特序列进行前向纠错解码；
确定模块1540，设置为响应于前向纠错解码后的第三比特序列的标志位是第一标志位的结果，确定第一比特序列并输出；或响应于前向纠错解码后的第三比特序列的标志位是第二标志位的结果；
第二解映射模块1550，设置为对第二比特序列在所述第二映射规则下对应的符号按照第一映射规则进行解映射后输出；
其中，所述第一映射规则为格雷映射，所述格雷映射的星座点对应的多个比特为第一映射比特信息；所述第二映射规则的星座点对应的多个比特为第二映射比特信息，所述第二映射比特信息为将所述第一映射规则下的星座图中每一个象限的所有星座点对应的第一映射比特信息进行对折或旋转后，星座点对 应的比特信息。
参见图16，本申请提出了一种发送装置，包括第一处理器1610和第一计算机可读存储介质1620，第一计算机可读存储介质1620中存储有第一指令，当所述第一指令被第一处理器1610执行时，实现上述发送装置侧的实施例所述的信息处理方法。
参见图17，本申请提出了一种接收装置，包括第二处理器1710和第二计算机可读存储介质1720，第二计算机可读存储介质1720中存储有第二指令，当所述第二指令被第二处理器1710执行时，实现上述接收装置侧的实施例所述的信息处理方法。
本申请提出了一种计算机可读存储介质，其上存储有计算机程序，所述计算机程序被处理器执行时实现任一实施例所述的信息处理方法。
其中，第一计算机可读存储介质或第二计算机可读存储介质包括以下至少一种：闪存、硬盘、多媒体卡、卡型存储器(例如，安全数码卡(Secure Digital Memory Card，SD卡)或数据寄存器(Data Register，DX)存储器等)、随机访问存储器(Random Access Memory，RAM)、静态随机访问存储器(Static Random Access Memory，SRAM)、只读存储器(Read Only Memory，ROM)、电可擦除可编程只读存储器(Electrically Erasable Programmable Read-Only Memory，EEPROM)、可编程只读存储器(Programmable Read-Only Memory，PROM)、磁性存储器、磁盘、光盘等。
第一处理器或第二处理器可以是中央处理器(Central Processing Unit，CPU)、控制器、微控制器、微处理器、或其他数据处理芯片等。
本申请提出了一种信息处理系统，包括上述任一种发送装置和上述任一种接收装置。
本申请第二映射规则通过将第一映射规则下的星座图中每一个象限的所有星座点对应的第一映射比特信息进行对折或旋转后得到，由于第一映射规则为格雷映射，第二映射规则总体上并没有改变比特信息的相邻关系，并且对折或旋转后使得第二映射规则基本上为功率逆向排列，因此，第二映射规则和第一映射规则结合也是格雷映射，从而在尽量保持功率逆向排列的同时降低了误比特扩散。

Claims (24)

  1. 一种信息处理方法，包括：
    采用第一映射规则对第一比特序列进行映射得到第一映射符号组；
    采用所述第一映射规则对第二比特序列进行映射得到第二映射符号组；
    根据所述第一映射符号组的功率和所述第二映射符号组的功率确定第三比特序列，并对所述第三比特序列进行前向纠错编码；
    采用所述第一映射规则对所述前向纠错编码后的第三比特序列进行映射得到符号信息并发送；
    其中，所述第一映射规则为格雷映射，所述格雷映射的星座点对应的多个比特为第一映射比特信息。
  2. 根据权利要求1所述的方法，其中，采用第一映射规则对第一比特序列进行映射得到第一映射符号组，包括：
    基于数据比特组加上第一标志位，得到所述第一比特序列；
    采用所述第一映射规则对所述第一比特序列进行映射得到所述第一映射符号组。
  3. 根据权利要求1所述的方法，其中，采用所述第一映射规则对第二比特序列进行映射得到第二映射符号组，包括：
    基于数据比特组加上第二标志位后，再进行
    Figure PCTCN2019072618-appb-100001
    得到所述第二比特序列；
    采用所述第一映射规则对所述第二比特序列进行映射得到所述第二映射符号组；
    其中，b0’是基于所述数据比特组加上所述第二标志位后得到的序列，所述M1和所述M2是分别按照所述第一映射规则和第二映射规则进行映射，所述
    Figure PCTCN2019072618-appb-100002
    和所述
    Figure PCTCN2019072618-appb-100003
    是分别按照所述第一映射规则和所述第二映射规则进行解映射；所述第二映射规则的星座点对应的多个比特为第二映射比特信息，所述第二映射比特信息为将所述第一映射规则下的星座图中每一个象限的所有星座点对应的第一映射比特信息进行对折或旋转后，所述星座点对应的比特信息。
  4. 根据权利要求1-3任一项所述的方法，其中，根据所述第一映射符号组的功率和所述第二映射符号组的功率确定第三比特序列，包括：
    计算所述第一映射符号组中每个符号的功率，将所述第一映射符号组中每个符号的功率相加后得到所述第一映射符号组的总功率；
    计算所述第二映射符号组中每个符号的功率，将所述第二映射符号组中每个符号的功率相加后得到所述第二映射符号组的总功率；
    选取所述第一映射符号组的总功率和所述第二映射符号组的总功率中功率小的符号组对应的比特序列，作为所述第三比特序列。
  5. 根据权利要求3所述的方法，其中，所述将所述第一映射规则下的星座图中每一个象限的所有星座点对应的第一映射比特信息进行对折包括：
    将所述第一映射规则下的星座图中每一个象限的所有星座点对应的第一映射比特信息沿着对称轴进行对折。
  6. 根据权利要求5所述的方法，其中，所述第一映射规则下的星座图中每一个象限的所有星座点构成一个正方形或正多边形；
    所述对称轴为第一对角线；其中，所述第一对角线与第二对角线垂直，所述第二对角线为所述象限中功率最大的星座点和功率最小的星座点的连线。
  7. 根据权利要求5所述的方法，其中，所述第一映射规则下的星座图中的所有星座点构成一个圆形；
    所述对称轴为所述第一映射规则下的星座图中半径为
    Figure PCTCN2019072618-appb-100004
    对应的圆；
    其中，R 1为所述第一映射规则下的星座图中的所有星座点的功率最小的圆对应的半径，R 2为所述第一映射规则下的星座图中的所有星座点的功率最大的圆对应的半径。
  8. 根据权利要求3所述的方法，其中，所述将所述第一映射规则下的星座图中每一个象限的所有星座点对应的第一映射比特信息进行旋转包括：
    将所述第一映射规则下的星座图中每一个象限的所有星座点对应的第一映射比特信息绕所述象限的对称中心旋转180度。
  9. 根据权利要求8所述的方法，其中，所述第一映射规则下的星座图中每 一个象限的所有星座点构成一个正方形或正多边形；
    所述对称中心为所述正方形或正多边形的对角线的交点。
  10. 根据权利要求8所述的方法，其中，所述第一映射规则下的星座图中的所有星座点构成一个圆形；
    所述对称中心为所述第一映射规则下的星座图中半径为
    Figure PCTCN2019072618-appb-100005
    对应的圆与预设直线的交点；其中，R 1为所述第一映射规则下的星座图中的所有星座点的功率最小的圆对应的半径，R 2为所述第一映射规则下的星座图中的所有星座点的功率的最大的圆对应的半径，预设直线与星座图的坐标轴的夹角为45度。
  11. 根据权利要求2或3所述的方法，在采用第一映射规则对第一比特序列进行映射得到第一映射符号组之前，还包括：
    对原始数据比特进行分组，得到多个所述数据比特组。
  12. 一种信息处理方法，包括：
    接收符号信息，采用第一映射规则对所述符号信息进行解映射得到前向纠错编码后的第三比特序列；
    对所述前向纠错编码后的第三比特序列进行前向纠错解码；
    响应于前向纠错解码后的第三比特序列的标志位是第一标志位的结果，确定第一比特序列并输出；或响应于前向纠错解码后的第三比特序列的标志位是第二标志位的结果，对第二比特序列在所述第二映射规则下对应的符号按照第一映射规则进行解映射后输出；
    其中，所述第一映射规则为格雷映射，所述格雷映射的星座点对应的多个比特为第一映射比特信息；所述第二映射规则的星座点对应的多个比特为第二映射比特信息，所述第二映射比特信息为将所述第一映射规则下的星座图中每一个象限的所有星座点对应的第一映射比特信息进行对折或旋转后，所述星座点对应的比特信息。
  13. 根据权利要求12所述的方法，其中，所述将所述第一映射规则下的星座图中每一个象限的所有星座点对应的第一映射比特信息进行对折包括：
    将所述第一映射规则下的星座图中每一个象限的所有星座点对应的第一映 射比特信息沿着对称轴进行对折。
  14. 根据权利要求13所述的方法，其中，所述第一映射规则下的星座图中每一个象限的所有星座点构成一个正方形或正多边形；
    所述对称轴为第一对角线；其中，所述第一对角线与第二对角线垂直，所述第二对角线为所述象限中功率最大的星座点和功率最小的星座点的连线。
  15. 根据权利要求13所述的方法，其中，所述第一映射规则下的星座图中的所有星座点构成一个圆形；
    所述对称轴为所述第一映射规则下的星座图中半径为
    Figure PCTCN2019072618-appb-100006
    对应的圆；
    其中，R 1为所述第一映射规则下的星座图中的所有星座点的功率最小的圆对应的半径，R 2为所述第一映射规则下的星座图中的所有星座点的功率最大的圆对应的半径。
  16. 根据权利要求12所述的方法，其中，所述将所述第一映射规则下的星座图中每一个象限的所有星座点对应的第一映射比特信息进行旋转包括：
    将所述第一映射规则下的星座图中每一个象限的所有星座点对应的第一映射比特信息绕所述象限的对称中心旋转180度。
  17. 根据权利要求16所述的方法，其中，所述第一映射规则下的星座图中每一个象限的所有星座点构成一个正方形或正多边形；
    所述对称中心为所述正方形或正多边形的对角线的交点。
  18. 根据权利要求16所述的方法，其中，所述第一映射规则下的星座图中的所有星座点构成一个圆形；
    所述对称中心为所述第一映射规则下的星座图中半径为
    Figure PCTCN2019072618-appb-100007
    对应的圆与预设直线的交点；其中，R 1为所述第一映射规则下的星座图中的所有星座点的功率最小的圆对应的半径，R 2为所述第一映射规则下的星座图中的所有星座点的功率最大的圆对应的半径，预设直线与星座图的坐标轴的夹角为45度。
  19. 一种发送装置，包括：
    第一映射模块，设置为采用第一映射规则对第一比特序列进行映射得到第 一映射符号组；第二映射模块，设置为采用所述第一映射规则对第二比特序列进行映射得到第二映射符号组；
    选择模块，设置为根据所述第一映射符号组的功率或所述第二映射符号组的功率确定第三比特序列；
    前向纠错编码模块，设置为对所述第三比特序列进行前向纠错编码；
    第三映射模块，设置为采用所述第一映射规则对所述前向纠错编码后的第三比特序列进行映射得到符号信息；
    发送模块，设置为发送所述符号信息；
    其中，所述第一映射规则为格雷映射，所述格雷映射的星座点对应的多个比特为第一映射比特信息。
  20. 一种接收装置，包括：
    接收模块，设置为接收符号信息；
    第一解映射模块，设置为采用第一映射规则对所述符号信息进行解映射得到前向纠错编码后的第三比特序列；
    前向纠错解码模块，设置为对所述前向纠错编码后的第三比特序列进行前向纠错解码；
    确定模块，设置为响应于前向纠错解码后的第三比特序列的标志位是第一标志位的结果，确定第一比特序列并输出；或响应于前向纠错解码后的第三比特序列的标志位是第二标志位的结果；
    第二解映射模块，设置为对第二比特序列在所述第二映射规则下对应的符号按照第一映射规则进行解映射后输出；
    其中，所述第一映射规则为格雷映射，所述格雷映射的星座点对应的多个比特为第一映射比特信息；所述第二映射规则的星座点对应的多个比特为第二映射比特信息，所述第二映射比特信息为将所述第一映射规则下的星座图中每一个象限的所有星座点对应的第一映射比特信息进行对折或旋转后，所述星座点对应的比特信息。
  21. 一种发送装置，包括处理器和计算机可读存储介质，所述计算机可读 存储介质中存储有指令，当所述指令被所述处理器执行时，实现如权利要求1～11任一项所述的方法。
  22. 一种接收装置，包括处理器和计算机可读存储介质，所述计算机可读存储介质中存储有指令，当所述指令被所述处理器执行时，实现如权利要求12～18任一项所述的方法。
  23. 一种信息处理系统，包括权19或21所述的发送装置，以及权20或22所述的接收装置。
  24. 一种计算机可读存储介质，其上存储有计算机程序，所述计算机程序被处理器执行时实现如权利要求1～11或12～18中任一项所述的方法。
PCT/CN2019/072618 2018-01-22 2019-01-22 信息处理方法和系统、发送装置及接收装置 WO2019141281A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201810059531.6A CN110071894B (zh) 2018-01-22 2018-01-22 一种信息处理方法和系统、发送装置及接收装置
CN201810059531.6 2018-01-22

Publications (1)

Publication Number Publication Date
WO2019141281A1 true WO2019141281A1 (zh) 2019-07-25

Family

ID=67301679

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2019/072618 WO2019141281A1 (zh) 2018-01-22 2019-01-22 信息处理方法和系统、发送装置及接收装置

Country Status (2)

Country Link
CN (1) CN110071894B (zh)
WO (1) WO2019141281A1 (zh)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114050958A (zh) * 2021-11-10 2022-02-15 北京邮电大学 基于Lorenz超混沌模型的概率成型方法及系统

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6078626A (en) * 1997-09-24 2000-06-20 Ericsson Inc. Methods and systems for communicating information using separable modulation constellations
CN101018105A (zh) * 2006-10-22 2007-08-15 北京创毅视讯科技有限公司 一种分级调制移动数字多媒体广播信号传输系统和方法
CN105634654A (zh) * 2014-10-27 2016-06-01 中兴通讯股份有限公司 多用户信息传输的叠加编码、解调方法及装置
WO2017161006A1 (en) * 2016-03-16 2017-09-21 Muhammad Ahsan Naim Selective mapping of coded multi-channel transmission
CN107566312A (zh) * 2017-09-13 2018-01-09 北京邮电大学 一种基于循环迭代编码的正交振幅调制方法及装置

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104737510B (zh) * 2012-12-14 2018-02-13 三菱电机株式会社 Qam调制通信系统的多级差分解码装置和方法
CN106301589B (zh) * 2015-05-15 2019-06-04 中兴通讯股份有限公司 一种正交振幅调制信号的相位模糊处理方法及装置
US9998229B2 (en) * 2015-12-31 2018-06-12 Infinera Corporation Optimized star-8QAM performance for binary encoding

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6078626A (en) * 1997-09-24 2000-06-20 Ericsson Inc. Methods and systems for communicating information using separable modulation constellations
CN101018105A (zh) * 2006-10-22 2007-08-15 北京创毅视讯科技有限公司 一种分级调制移动数字多媒体广播信号传输系统和方法
CN105634654A (zh) * 2014-10-27 2016-06-01 中兴通讯股份有限公司 多用户信息传输的叠加编码、解调方法及装置
WO2017161006A1 (en) * 2016-03-16 2017-09-21 Muhammad Ahsan Naim Selective mapping of coded multi-channel transmission
CN107566312A (zh) * 2017-09-13 2018-01-09 北京邮电大学 一种基于循环迭代编码的正交振幅调制方法及装置

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114050958A (zh) * 2021-11-10 2022-02-15 北京邮电大学 基于Lorenz超混沌模型的概率成型方法及系统
CN114050958B (zh) * 2021-11-10 2023-04-07 北京邮电大学 基于Lorenz超混沌模型的概率成型方法及系统

Also Published As

Publication number Publication date
CN110071894B (zh) 2022-05-06
CN110071894A (zh) 2019-07-30

Similar Documents

Publication Publication Date Title
ES2633186T3 (es) Método de decodificación, aparato de decodificación y sistema de comunicaciones
JP5955481B2 (ja) 軟判定値生成装置及び軟判定値生成方法
US8675771B2 (en) Log likelihood ratio arithmetic circuit, transmission apparatus, log likelihood ratio arithmetic method, and program
US9787518B2 (en) Digital modulation method and apparatus
US9106470B2 (en) Enhanced decoding and demapping method and apparatus for QAM data signals
RU2008114338A (ru) Способ модуляции и демодуляции, устройство модуляции и устройство демодуляции
WO2019141281A1 (zh) 信息处理方法和系统、发送装置及接收装置
JP5976252B2 (ja) 尤度生成装置およびその方法
WO2018112891A1 (zh) 一种传输信号的方法、装置及设备
EP2334022B1 (en) Radio transmitter and modulation method
JP5113897B2 (ja) データワードから１６ｑａｍコンスタレーションの変調シンボルへのマッピングを生成する方法および装置、ならびにこれを実行させる命令を格納するコンピュータ可読媒体
CN117981228A (zh) 用于多维多级前向纠错编码和解码的系统和方法
EP4175185A1 (en) Modulation and encoding method and apparatus, demodulation and decoding method and apparatus, device, and communication system
US9819423B2 (en) Low-complexity multi-symbol log-likelihood ratio (LLR) calculation
US20190089375A1 (en) Convolutional ldpc decoding method and apparatus, decoder, and system
WO2022089137A1 (zh) 一种编码方法、解码方法、相关设备以及存储介质
US20230065454A1 (en) Communication method and apparatus
US9602326B2 (en) Apparatus and method for transmitting signal, apparatus and method for receiving signal
CN110506401B (zh) 用于延迟比特交织编码调制的发送器和接收器
EP3188451B1 (en) Coding and modulation method and device which support robust channel (rc)
WO2019003301A1 (ja) 尤度生成装置
CN112448769A (zh) 基于高维调制的光通信方法、系统及存储介质
KR100903876B1 (ko) 비트 대칭 그레이 코드를 이용하여 위상 편이 방식으로변조된 수신 심볼 신호를 비트 정보로 분할하는 방법 및 그장치
Morelos-Zaragoza et al. Multilevel Coded Modulation for Unequal Error Protection and Multistage Decoding-Part I: Symmetric Constellations

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 19741278

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

32PN Ep: public notification in the ep bulletin as address of the adressee cannot be established

Free format text: NOTING OF LOSS OF RIGHTS PURSUANT TO RULE 112(1) EPC (EPO FORM 1205 DATED 24/11/2020)

122 Ep: pct application non-entry in european phase

Ref document number: 19741278

Country of ref document: EP

Kind code of ref document: A1