Data processing method and data processing apparatus

MYPI2025005141A0Undetermined Publication Date: 2024-08-25HUAWEI TECH CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
MYPI2025005141
Authority / Receiving Office
MY · MY
Patent Type
Applications
Current Assignee / Owner
Priority Date
2023-08-18
Filing Date
2024-02-22
Publication Date
2024-08-25

AI Technical Summary

Technical Problem

Existing data processing methods using open FEC codes cannot adapt to probabilistic constellation shaping technology during the transmission process, resulting in limited system transmission performance and inability to meet the needs of longer transmission distances in the future.

Method used

Using FEC coding combined with probabilistic constellation shaping technology, by introducing a new interleaver before the symbol mapping operation, the distribution of bits in the modulation symbols becomes non-uniform, thereby improving system performance and meeting the needs of longer transmission distances.

Benefits of technology

It realizes simpler, lower complexity and lower power consumption data processing operations, significantly improves the overall performance, and is suitable for future metro telecommunication transmission and metro DCI interconnection scenarios.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure PI2025005141_DRAWING_001
    Figure PI2025005141_DRAWING_001
  • Figure PI2025005141_DRAWING_002
    Figure PI2025005141_DRAWING_002
  • Figure PI2025005141_DRAWING_003
    Figure PI2025005141_DRAWING_003
Patent Text Reader

Abstract

Embodiments of this application provide a data processing method and a data processing apparatus, to use FEC encoding in combination with a PCS technology to satisfy a requirement for a longer transmission distance. Specifically, PCS processing is performed on a first bit set in k bits, to obtain a second bit set, where k is an integer greater than 1. FEC encoding is performed on the second bit set and a third bit set in the k bits excluding the first bit set, to obtain a fourth bit set. The fourth bit set includes m_0 first bit subsets, each of the first bit subsets includes F_0 bits, m_0 is an integer greater than 1, and F_0 is an even number greater than 1. First interleaving processing is performed on the fourth bit set to obtain a fifth bit set. The fifth bit set includes m_0 second bit subsets, each of the second bit subsets includes F_0 bits, F_0 / 2 bits in each of the second bit subsets are from the second bit set, and the other F_0 / 2 bits in each of the second bit subsets are from the third bit set and / or parity bits of the FEC encoding.
Need to check novelty before this filing date? Find Prior Art

Description

Data processing method and data processing device

[0001] This application claims priority to the Chinese patent application with application number 202310206681.6, filed with the State Intellectual Property Office on February 25, 2023, and entitled “A data processing method and data processing device”, the Chinese patent application with application number 202310359894.2, filed with the State Intellectual Property Office on March 28, 2023, and entitled “A data processing method and data processing device”, the Chinese patent application with application number 202310491179.4, filed with the State Intellectual Property Office on April 28, 2023, and entitled “A data processing method and data processing device”, and the Chinese patent application with application number 202311055979.8, filed with the State Intellectual Property Office on August 18, 2023, and entitled “A data processing method and data processing device”, the entire contents of which are incorporated herein by reference. Technical Field

[0002] The present application relates to the field of communications, and in particular to a data processing method and a data processing device. Background Art

[0003] Driven by 5G, cloud computing, big data, and artificial intelligence, high-speed optical transmission networks are developing towards large capacity, packetization, and intelligence. Coherent optical communication systems use the amplitude, phase, polarization, and frequency of light waves to carry information. To combat optical signal distortion caused by dispersion, polarization-related impairments, noise, nonlinear effects, and other factors during transmission and maintain long-distance transmission, coherent optical communication systems typically require the use of efficient forward error correction (FEC) codes to combat optical impairments during optical transmission and maintain a sufficiently low bit error rate over long distances. For example, the open FEC code (OpenFEC), also referred to as OFEC code, currently adopted by 400ZR+ and 800ZR, has an overhead (OH) of 15.3%. When soft-decision decoding is used, the performance is approximately 2.0E-2 before correction.

[0004] In order to improve spectrum efficiency, multi-level Quadrature Amplitude Modulation (QAM) is usually used, such as 16QAM, 32QAM, 64QAM and even higher-order QAM. Each constellation point on the signal constellation diagram corresponding to traditional QAM modulation appears with the same probability. Probabilistic Constellation Shaping (PCS) technology changes the probability of the constellation points appearing while keeping the constellation point positions unchanged, making them non-uniformly distributed, thereby improving system transmission performance. As a modulation format optimization technology, PCS technology has the advantages of approaching the Shannon limit and being flexible and variable, and has been widely studied and applied. The existing data processing and transmission methods using OFEC coding mainly use traditional QAM modulation, which cannot be applied to scenarios where PCS technology will be used in the future. This is a problem that needs to be solved urgently in the future.

[0005] Summary of the Invention

[0006] The embodiments of the present application provide a data processing method and a data processing device, which adopt FEC coding and combine PCS technology to meet longer transmission distances, and make the overall data processing operation simpler, less complex, and with lower power consumption, thereby improving overall performance.

[0007] In a first aspect, an embodiment of the present application provides a data processing method, which includes the following steps. PCS processing is performed on a first bit set of k bits to obtain a second bit set, where k is an integer greater than 1. FEC encoding is performed on the second bit set and a third bit set of the k bits other than the first bit set to obtain a fourth bit set. The fourth bit set includes m0 first bit subsets, each of which includes F0 bits, where m0 is an integer greater than 1 and F0 is an even number greater than 1. A first interleaving process is performed on the fourth bit set to obtain a fifth bit set. The fifth bit set includes m0 second bit subsets, each of which includes F0 bits, where F0 / 2 bits of each second bit subset come from the second bit set, and the other F0 / 2 bits of each second bit subset come from the third bit set and / or the parity bits of the FEC encoding.

[0008] In this implementation, FEC coding combined with PCS technology will be used for future metropolitan area telecommunications transmission and metropolitan area DCI interconnection scenarios to meet longer transmission distances. The introduction of PCS processing requires that during symbol mapping, the sign bits mapped to a modulation symbol are equally likely to be 0 or 1, and the amplitude bits mapped to a modulation symbol are unequally likely to be 0 or 1. Taking OFEC coding as an example, to minimize the impact on existing OFEC coding and OFEC interleaving, a new interleaver is introduced after OFEC coding and before symbol mapping. This allows the unequally likely 0 and 1 bits obtained through PCS processing to be mapped to the amplitude bits of the modulation symbol. This achieves the goal of changing the probability of constellation points while maintaining their positions, resulting in a non-uniform distribution and improving overall performance to meet future requirements for longer transmission distances. Furthermore, the implementation is simple, low-complexity, and low-power.

[0009] In some possible embodiments, the F0 bits in each of the second bit subsets are distributed as F1 rows and F1 columns, F1 / 2 bits of the F1 bits in each row of the second bit subset come from the second bit set, the second bit set includes m0×F0 / 2 bits, and the other F1 / 2 bits of the F1 bits in each row of the second bit subset come from the third bit set and / or the check bits of the FEC code.

[0010] In some possible implementations, F0=256, F1=16, and in the second bit subset, the first bit in the i2th row is The bits of the column come from the second bit set, 0≤i2<16, 0≤j2<8. Alternatively, the bits of the i2th row and (j2×2-i2%2+1)th column in the second bit subset come from the second bit set, 0≤i2<16, 0≤j2<8. means rounding a down to the nearest integer, and b%c means taking the modulus of b to c.

[0011] In some possible implementations, F0=256, m1 of the first bit subsets in the fourth bit set, totaling m1×256 bits, come from the second bit set, and m0=m1×2.

[0012] In some possible implementations, F0=256, the m0×256 bits in the fourth bit set are distributed as 32 rows and m0×8 columns, the m0×256 bits in the fifth bit set are distributed as 32 rows and m0×8 columns, the m0×8 bits in the r1-th row of the fifth bit set come from the m0×8 bits in the r0-th row of the fourth bit set, where 0≤r0<32, 0≤r1<32.

[0013] In some possible implementations, the m0 first bit subsets are distributed into 2 rows and m1 columns, wherein the first bit subset in the 0th row and the m2th column is and the first bit subset of row 1, column m2 From the second bit set, 0≤m2<m1 / 2.

[0014] In some possible implementations, the first bit of the m0×8 bits in the r1th row of the fifth bit set is bits are from the 0th bit to the (m0×4-1)th bit in the r0th row of the fourth bit set, where means rounding a down to the nearest integer, and b%c means taking the modulus of b to c.

[0015] In some possible implementations, the c1th bit in the m0×8 bits in the r1th row in the fifth bit set comes from the c0th bit in the m0×8 bits in the r0th row in the fourth bit set;

[0016] Among them, 0≤c0<(m0×8), 0≤c1<(m0×8), θ is an integer multiple of 4, and m0×8 is divisible by θ, Δ is an integer, and β is an integer multiple of 4.

[0017] In some possible implementations, the c1th bit in the m0×8 bits in the r1th row in the fifth bit set comes from the c0th bit in the m0×8 bits in the r0th row in the fourth bit set;

[0018] Among them, 0≤c0<(m0×8), 0≤c1<(m0×8), θ is an integer multiple of 4, and m0×8 is divisible by θ, Δ is an integer, and β is an integer multiple of 4.

[0019] In some possible implementations, the c1th bit in the m0×8 bits in the r1th row in the fifth bit set comes from the c0th bit in the m0×8 bits in the r0th row in the fourth bit set;

[0020] Among them, 0≤c0<(m0×8), 0≤c1<(m0×8), θ is an integer multiple of 4, and m0×8 is divisible by θ, Δ is an integer, and β is an integer multiple of 4.

[0021] In some possible implementations, the c1th bit in the m0×8 bits in the r1th row in the fifth bit set comes from the c0th bit in the m0×8 bits in the r0th row in the fourth bit set;

[0022] Among them, 0≤c0<(m0×8), 0≤c1<(m0×8), θ is an integer multiple of 4, and m0×8 is divisible by θ, Δ is an integer, and β is an integer multiple of 4.

[0023] In some possible implementations, the first bit of the m0×8 bits in the r1th row of the fifth bit set is bits are from the 0th bit to the (m0×4-1)th bit in the r0th row of the fourth bit set, where

[0024] In some possible implementations, the c1th bit in the m0×8 bits in the r1th row in the fifth bit set comes from the c0th bit in the m0×8 bits in the r0th row in the fourth bit set;

[0025] Among them, 0≤c0<(m0×8), 0≤c1<(m0×8), θ is an integer multiple of 4, and m0×8 is divisible by θ, Δ is an integer, and β is an integer multiple of 2.

[0026] In some possible implementations, the c1th bit in the m0×8 bits in the r1th row in the fifth bit set comes from the c0th bit in the m0×8 bits in the r0th row in the fourth bit set;

[0027] Among them, 0≤c0<(m0×8), 0≤c1<(m0×8), θ is an integer multiple of 4, and m0×8 is divisible by θ, Δ is an integer, and β is an integer multiple of 2.

[0028] In some possible implementations, the c1th bit in the m0×8 bits in the r1th row in the fifth bit set comes from the c0th bit in the m0×8 bits in the r0th row in the fourth bit set;

[0029] Among them, 0≤c0<(m0×8), 0≤c1<(m0×8), θ is an integer multiple of 4, and m0×8 is divisible by θ, Δ is an integer, and β is an integer multiple of 2.

[0030] In some possible implementations, the c1th bit in the m0×8 bits in the r1th row in the fifth bit set comes from the c0th bit in the m0×8 bits in the r0th row in the fourth bit set;

[0031] Among them, 0≤c0<(m0×8), 0≤c1<(m0×8), θ is an integer multiple of 4, and m0×8 is divisible by θ, Δ is an integer, and β is an integer multiple of 2.

[0032] In some possible implementations, performing FEC encoding on the second bit set and a third bit set excluding the first bit set among the k bits to obtain a fourth bit set includes: performing pre-encoding interleaving on the second bit set and the third bit set to obtain a sixth bit set, the number of bits in the sixth bit set being equal to the sum of the number of bits in the second bit set and the number of bits in the third bit set, the sixth bit set including m3 third bit subsets, the m3 third bit subsets being distributed in 2 rows and m4 columns, m3=2×m4, m3 being an integer greater than 1 and less than m0, each third bit subset in a portion of the third bit subsets including F0 bits, each third bit subset in another portion of the third bit subsets including F2 bits, F2 being an even number greater than 1 and less than F0. Performing FEC encoding on the sixth bit set to obtain the fourth bit set.

[0033] In some possible embodiments, m3=14, m4=7, F0=256, F2=240, each third bit subset of columns 0 to 5 includes 16 rows and 16 columns of bits, each third bit subset of column 6 includes 16 rows and 15 columns of bits, the bits in the third bit subset of column 0, the third bit subset of column 1, the third bit subset of column 4, and the third bit subset of column 5 are from the second bit set, and the bits in the third bit subset of column 2, the third bit subset of column 3, and the third bit subset of column 6 are from the third bit set.

[0034] In some possible implementations, the m0 first bit subsets are distributed into 2 rows and m1 columns, m0=16, m1=8, and the first bit subset B in row 0 and column 0 is 0,0 , the first bit subset B at row 0 and column 1 0,1 , the first bit subset B at row 0 and column 4 0,4 , the first bit subset B at row 0 and column 5 0,5 , the first bit subset B at row 1, column 0 1,0 , the first bit subset B at row 1 and column 1 1,1 , the first bit subset B at row 1 and column 4 1,4and the first bit subset B at row 1 and column 5 1,5 From the second set of bits.

[0035] In some possible implementations, the first bit of the 128 bits in the r1th row of the fifth bit set is bits are from one of the bits 0 to 31 or the bits 64 to 95 in the r0th row in the fourth bit set, wherein, means rounding a down to the nearest integer, and b%c means taking the modulus of b to c.

[0036] In some possible implementations, the c1th bit in the 128 bits in the r1th row in the fifth bit set comes from the c0th bit in the 128 bits in the r0th row in the fourth bit set;

[0037] Among them, 0≤c0<128, 0≤c1<128, θ is an integer multiple of 4, and m0×8 is divisible by θ, Δ is an integer, β is an integer multiple of 4,

[0038] In some possible implementations, the c1th bit in the 128 bits in the r1th row in the fifth bit set comes from the c0th bit in the 128 bits in the r0th row in the fourth bit set;

[0039] Among them, 0≤c0<128, 0≤c1<128, θ is an integer multiple of 4, and m0×8 is divisible by θ, Δ is an integer, β is an integer multiple of 4, In some possible implementations, the c1th bit in the 128 bits in the r1th row in the fifth bit set comes from the c0th bit in the 128 bits in the r0th row in the fourth bit set;

[0040] Among them, 0≤c0<128, 0≤c1<128, θ is an integer multiple of 4, and m0×8 is divisible by θ, Δ is an integer, β is an integer multiple of 4,

[0041] In some possible implementations, the c1th bit in the 128 bits in the r1th row in the fifth bit set comes from the c0th bit in the 128 bits in the r0th row in the fourth bit set;

[0042] Among them, 0≤c0<128, 0≤c1<128, θ is an integer multiple of 4, and m0×8 is divisible by θ, Δ is an integer, β is an integer multiple of 4,

[0043] In some possible implementations, the first bit in the 128 bits of the r1th row in the fifth bit set is bits are from one of the bits 0 to 31 or the bits 64 to 95 in the r0th row of the fourth bit set, where

[0044] In some possible implementations, the c1th bit in the 128 bits in the r1th row in the fifth bit set comes from the c0th bit in the 128 bits in the r0th row in the fourth bit set;

[0045] Among them, 0≤c0<128, 0≤c1<128, θ is an integer multiple of 4, and m0×8 is divisible by θ, Δ is an integer, and β is an integer multiple of 2.

[0046] In some possible implementations, the c1th bit in the 128 bits in the r1th row in the fifth bit set comes from the c0th bit in the 128 bits in the r0th row in the fourth bit set;

[0047] Among them, 0≤c0<128, 0≤c1<128, θ is an integer multiple of 4, and m0×8 is divisible by θ, Δ is an integer, and β is an integer multiple of 2.

[0048] In some possible implementations, the c1th bit in the 128 bits in the r1th row in the fifth bit set comes from the c0th bit in the 128 bits in the r0th row in the fourth bit set;

[0049] Among them, 0≤c0<128, 0≤c1<128, θ is an integer multiple of 4, and m0×8 is divisible by θ, Δ is an integer, and β is an integer multiple of 2.

[0050] In some possible implementations, the c1th bit in the 128 bits in the r1th row in the fifth bit set comes from the c0th bit in the 128 bits in the r0th row in the fourth bit set;

[0051] Among them, 0≤c0<128, 0≤c1<128, θ is an integer multiple of 4, and m0×8 is divisible by θ, Δ is an integer, and β is an integer multiple of 2.

[0052] In some possible embodiments, m3=14, m4=7, F0=256, F2=240, each third bit subset of columns 0 to 5 includes 16 rows and 16 columns of bits, each third bit subset of column 6 includes 16 rows and 15 columns of bits, F0 / 2 bits of each third bit subset of columns 0 to 3 come from the second bit set, another F0 / 2 bits of each third bit subset of columns 0 to 3 come from the third bit set, F0 bits of each third bit subset of columns 4 to 5 come from the second bit set, and F2 bits of each third bit subset of column 6 come from the third bit set.

[0053] In some possible implementations, the third bit subset of the i0th row and j0th column is the i1th row and j0th column. The bits of the column are from the second bit set. Alternatively, the bits of the third bit subset of the i0th row and j0th column and the (j1×2)th column are from the second bit set. Where 0≤i0<2, 0≤j0<4, 0≤i1<16, 0≤j1<8, means rounding a down to the nearest integer, and b%c means taking the modulus of b to c.

[0054] In some possible embodiments, the m0 first bit subsets are distributed into 2 rows and m1 columns, m0=16, m1=8, F0 / 2 bits in each first bit subset in columns 0 to 3 come from the second bit set, another F0 / 2 bits in each first bit subset in columns 0 to 3 come from the third bit set, F0 bits in each first bit subset in columns 4 to 5 come from the second bit set, and F0 bits in each first bit subset in columns 6 to 7 come from the third bit set and / or the check bits of the FEC code.

[0055] In some possible implementations, performing a first interleaving process on the fourth bit set to obtain a fifth bit set includes: performing a first interleaving process on a first bit subset of columns 4 to 7 in the fourth bit set to obtain a corresponding second bit subset of columns 4 to 7 in the fifth bit set.

[0056] In some possible implementations, the first bit of the 128 bits in the r1th row of the fifth bit set is bits are from one of the 64th to 95th bits in the r0th row of the fourth bit set, wherein, means rounding a down to the nearest integer, and b%c means taking the modulus of b to c.

[0057] In some possible implementations, when 0≤c1<64, the c1th bit in the 128 bits in the r1th row of the fifth bit set comes from the c1th bit in the 128 bits in the r0th row of the fourth bit set; when 64≤c1<128, the c1th bit in the 128 bits in the r1th row of the fifth bit set comes from the c0th bit in the 128 bits in the r0th row of the fourth bit set;

[0058] Among them, 64≤c0<128, 64≤c1<128, θ is an integer multiple of 4, and m0×4 is divisible by θ, Δ is an integer, and β is an integer multiple of 4.

[0059] or,

[0060] When 0≤c1<64, the c1th bit in the 128 bits in the r1th row of the fifth bit set comes from the c1th bit in the 128 bits in the r0th row of the fourth bit set; when 64≤c1<128, the c1th bit in the 128 bits in the r1th row of the fifth bit set comes from the c0th bit in the 128 bits in the r0th row of the fourth bit set;

[0061] Among them, 64≤c0<128, 64≤c1<128, θ is an integer multiple of 4, and m0×4 is divisible by θ, Δ is an integer, and β is an integer multiple of 4.

[0062] or,

[0063] When 0≤c1<64, the c1th bit in the 128 bits in the r1th row of the fifth bit set comes from the c1th bit in the 128 bits in the r0th row of the fourth bit set; when 64≤c1<128, the c1th bit in the 128 bits in the r1th row of the fifth bit set comes from the c0th bit in the 128 bits in the r0th row of the fourth bit set;

[0064] Among them, 64≤c0<128, 64≤c1<128, θ is an integer multiple of 4, and m0×4 is divisible by θ, Δ is an integer, and β is an integer multiple of 4.

[0065] or,

[0066] When 0≤c1<64, the c1th bit in the 128 bits in the r1th row of the fifth bit set comes from the c1th bit in the 128 bits in the r0th row of the fourth bit set; when 64≤c1<128, the c1th bit in the 128 bits in the r1th row of the fifth bit set comes from the c0th bit in the 128 bits in the r0th row of the fourth bit set;

[0067] Among them, 64≤c0<128, 64≤c1<128, θ is an integer multiple of 4, and m0×4 is divisible by θ, Δ is an integer, and β is an integer multiple of 4.

[0068] In some possible implementations, m3=14, m4=7, F0=256, F2=240, each third bit subset of columns 0 to 5 includes 16 rows and 16 columns of bits, each third bit subset of column 6 includes 16 rows and 15 columns of bits, F0 / 2 bits of each third bit subset of columns 0 to 4 come from the second bit set, another F0 / 2 bits of each third bit subset of columns 0 to 4 come from the third bit set, and the third bit subset I of row 0 and column 5 is 16 rows and 15 columns of bits. 0,5 , the third bit subset I of row 1 and column 5 1,5 , the third bit subset I of row 0 and column 6 0,6 The bits in columns 0 to 7 and the third bit subset I in row 1 and column 6 1,6 The bits in columns 0 to 7 are from the second bit set, and the bits in row 0 and column 6 are from the third bit subset I 0,6 The bits in columns 8 to 14 and the third bit subset I in row 1 and column 6 1,6 The bits in columns 8 to 14 in are from the third bit set.

[0069] In some possible implementations, the third bit subset of the i0th row and j0th column is the i1th row and j0th column. The bits of the column are from the second bit set. Alternatively, the bits of the third bit subset of the i0th row and j0th column and the (j1×2)th column are from the second bit set. Where 0≤i0<2, 0≤j0<5, 0≤i1<16, 0≤j1<8, means rounding a down to the nearest integer, and b%c means taking the modulus of b to c.

[0070] In some possible implementations, the m0 first bit subsets are distributed into 2 rows and m1 columns, m0=16, m1=8, F0 / 2 bits in each first bit subset in columns 0 to 4 come from the second bit set, and the other F0 / 2 bits in each first bit subset in columns 0 to 4 come from the third bit set. First bit subset B in row 0 and column 5 0,5 , the first bit subset B in row 1 and column 5 1,5 , the first bit subset B at row 0 and column 6 0,6 The 8×8 bits in rows 0 to 7 and columns 0 to 7, the first bit subset B in row 0 and column 6 0,6 The 8×8 bits in rows 8 to 15 and columns 8 to 15, the first bit subset B in row 1 and column 6 1,6 The 8×8 bits in rows 0 to 7 and columns 0 to 7 and the first bit subset B in row 1 and column 6 1,6 The 8×8 bits in rows 8 to 15 and columns 8 to 15 in the first bit subset B are from the second bit set. 0,7 , the first bit subset B at row 1, column 7 1,7 , the first bit subset B at row 0 and column 6 0,6 The 8×8 bits in rows 0 to 7 and columns 8 to 15, the first bit subset B in row 0 and column 6 0,6 The 8×8 bits in rows 8 to 15 and columns 0 to 7, and the first bit subset B in row 1 and column 6 1,6 The 8×8 bits in rows 0 to 7 and columns 8 to 15 and the first bit subset B in row 1 and column 6 1,6 The 8×8 bits in rows 8 to 15 and columns 0 to 7 in the byte data are from the third bit set and / or the parity bits of the FEC code.

[0071] In some possible implementations, performing a first interleaving process on the fourth bit set to obtain a fifth bit set includes: performing a first interleaving process on a first bit subset of columns 5 to 7 in the fourth bit set to obtain a corresponding second bit subset of columns 5 to 7 in the fifth bit set.

[0072] In some possible implementations, when When the r1th row of the fifth bit set has the 128 bits bits are from the 80th to 103rd bits in the r0th row of the fourth bit set. When the r1th row of the fifth bit set has the 128 bits bits are from one of the 80th to 95th bits and the 104th to 111th bits in the r0th row of the fourth bit set. means rounding a down to the nearest integer, and b%c means taking the modulus of b to c.

[0073] In some possible implementations, when 0≤c1<80, the c1th bit in the 128 bits in the r1th row of the fifth bit set comes from the c1th bit in the 128 bits in the r0th row of the fourth bit set; when 80≤c1<128, the c1th bit in the 128 bits in the r1th row of the fifth bit set comes from the 80+c0th bit in the 128 bits in the r0th row of the fourth bit set;

[0074] Among them, 0≤c0<48, 80≤c1<128, θ is an integer multiple of 4, and 48 is divisible by θ, Δ is an integer, and β is an integer multiple of 4.

[0075] or,

[0076] When 0≤c1<80, the c1th bit in the 128 bits in the r1th row of the fifth bit set comes from the c1th bit in the 128 bits in the r0th row of the fourth bit set; when 80≤c1<128, the c1th bit in the 128 bits in the r1th row of the fifth bit set comes from the 80+c0th bit in the 128 bits in the r0th row of the fourth bit set;

[0077] Where, 0≤c0<48, 80≤c1<128, θ is an integer multiple of 4, and 48 is divisible by θ, Δ is an integer, and β is an integer of 4.

[0078] In some possible implementations, m3=14, m4=7, F0=256, and F2=240. Each third bit subset of columns 0 through 5 includes 16 rows and 16 columns of bits, and each third bit subset of column 6 includes 16 rows and 15 columns of bits. F0 / 2 bits in each third bit subset of columns 0 through 4 are from the second bit set, and another F0 / 2 bits in each third bit subset of columns 0 through 4 are from the third bit set. 9 bits in each row of each third bit subset of column 5 are from the second bit set, and another 7 bits in each row of each third bit subset of column 5 are from the third bit set. F2 bits in each third bit subset of column 6 are from the second bit set.

[0079] In some possible implementations, the m0 first bit subsets are distributed into 2 rows and m1 columns, where m0 = 16 and m1 = 8. F0 / 2 bits in each first bit subset in columns 0 to 4 come from the second bit set, and another F0 / 2 bits in each first bit subset in columns 0 to 4 come from the third bit set. Nine bits in each row of each first bit subset in column 5 come from the second bit set, and another 7 bits in each row of each first bit subset in column 5 come from the third bit set. The bits in row i1, columns 15-i1 of each first bit subset in column 6 come from the parity bits of the FEC code, and all bits in each first bit subset in column 6, except for the bits in row i1, columns 15-i1, come from the second bit set, where 0≤i1≤15. F0 bits in each first bit subset in column 7 come from the parity bits of the FEC code.

[0080] In some possible implementations, performing a first interleaving process on the fourth bit set to obtain a fifth bit set includes: performing a first interleaving process on the first bit subset B at row 0 and column 5 0,5 The first bit subset B of columns C to 15, row 1, column 5 1,5 The first bit subset B of columns C to 15, row 0, column 6 0,6 , the first bit subset B at row 0 and column 7 0,7 , the first bit subset B in row 1 and column 6 1,6 and the first bit subset B at row 1, column 6 1,6 Perform the first interleaving process to obtain the corresponding second bit subset T at row 0 and column 5 0, The second bit subset T of columns C to 15, row 1 and column 5 1,5 The second bit subset T of columns C to 15, row 0 and column 6 0,6 , the second bit subset T at row 0 and column 7 0,7 , the second bit subset T in row 1 and column 6 1,6 and the second bit subset T at row 1, column 6 1,6 . Among them, 0≤C≤15.

[0081] In some possible implementations, r0=r1.

[0082] In some possible implementations, the F0 bits in each of the second bit subsets are distributed into F1 rows and F1 columns, and the F1 bits in each row of the second bit subset come from two of the first bit subsets.

[0083] In some possible embodiments, the F0 bits in each of the first bit subsets are distributed as F1 rows and F1 columns, F1 / 2 bits of the F1 bits in each row of the second bit subset come from one row of one of the first bit subsets, and the other F1 / 2 bits of the F1 bits in each row of the second bit subset come from one row of another first bit subset.

[0084] In some possible implementations, F0=256, the m0×256 bits in the fourth bit set are distributed as 32 rows and m0×8 columns, the m0×256 bits in the fifth bit set are distributed as 32 rows and m0×8 columns, and the 32 bits in each column of the fifth bit set come from 2 of the first bit subsets.

[0085] In some possible embodiments, the 256 bits in each of the first bit subsets are distributed into 16 rows and 16 columns, 16 bits of the 32 bits in each column of the fifth bit set come from one column of one of the first bit subsets, and the other 16 bits of the 32 bits in each column of the fifth bit set come from one column of another first bit subset.

[0086] In some possible embodiments, 16 bits of the 32 bits in each column of the fifth bit set come from the c1%16th column of one of the first bit subsets, and the other 16 bits of the 32 bits in each column of the fifth bit set come from the c1%16th column of another first bit subset, where 0≤c1<(m0×8).

[0087] In some possible implementations, m0=16, and the 16 second bit subsets are distributed into 2 rows and 8 columns;

[0088] The second bit subset T at row 0 and column 0 0,0 and the second bit subset T at row 1, column 0 1,0 A total of 512 bits come from the first bit subset B at row 0 and column 0 0,0 and the first bit subset B at row 0 and column 4 0,4 A total of 512 bits,

[0089] The second bit subset T of row 0 and column 1 0,1 and the second bit subset T at row 1, column 1 1,1 A total of 512 bits come from the first bit subset B in row 1, column 0 1,0 and the first bit subset B at row 1, column 4 1,4 A total of 512 bits,

[0090] The second bit subset T at row 0 and column 2 0,2 and the second bit subset T at row 1, column 21,2 A total of 512 bits come from the first bit subset B at row 0 and column 1 0,1 and the first bit subset B at row 0 and column 5 0,5 A total of 512 bits,

[0091] The second bit subset T of row 0 and column 3 0,3 and the second bit subset T at row 1, column 3 1,3 A total of 512 bits come from the first bit subset B in row 1 and column 1 1,1 and the first bit subset B at row 1 and column 5 1,5 A total of 512 bits,

[0092] The second bit subset T of row 0 and column 4 0,4 and the second bit subset T at row 1, column 4 1,4 A total of 512 bits come from the first bit subset B at row 0 and column 2 0,2 and the first bit subset B at row 0 and column 6 0,6 A total of 512 bits,

[0093] The second bit subset T at row 0 and column 5 0,5 and the second bit subset T at row 1, column 5 1,5 A total of 512 bits come from the first bit subset B in row 1, column 2 1,2 and the first bit subset B at row 1, column 6 1,6 A total of 512 bits,

[0094] The second bit subset T at row 0 and column 6 0,6 and the second bit subset T at row 1, column 6 1,6 A total of 512 bits come from the first bit subset B at row 0 and column 3 0,3 and the first bit subset B at row 0 and column 7 0,7 A total of 512 bits,

[0095] The second bit subset T at row 0 and column 7 0,7 and the second bit subset T at row 1, column 7 1,7 A total of 512 bits come from the first bit subset B in row 1, column 3 1,3 and the first bit subset B at row 1, column 7 1,7 A total of 512 bits.

[0096] In some possible implementations, m0=16, and the 16 second bit subsets are distributed into 2 rows and 8 columns;

[0097] The second bit subset T at row 0 and column 0 0,0 and the second bit subset T at row 1, column 01,0 A total of 512 bits come from the first bit subset B at row 0 and column 0 0,0 and the first bit subset B at row 0 and column 4 0,4 A total of 512 bits,

[0098] The second bit subset T of row 0 and column 1 0,1 and the second bit subset T at row 1, column 1 1,1 A total of 512 bits come from the first bit subset B at row 0 and column 1 0,1 and the first bit subset B at row 0 and column 5 0,5 A total of 512 bits,

[0099] The second bit subset T at row 0 and column 2 0,2 and the second bit subset T at row 1, column 2 1,2 A total of 512 bits come from the first bit subset B at row 0 and column 2 0,2 and the first bit subset B at row 0 and column 6 0,6 A total of 512 bits,

[0100] The second bit subset T of row 0 and column 3 0,3 and the second bit subset T at row 1, column 3 1,3 A total of 512 bits come from the first bit subset B at row 0 and column 3 0,3 and the first bit subset B at row 0 and column 7 0,7 A total of 512 bits,

[0101] The second bit subset T of row 0 and column 4 0,4 and the second bit subset T at row 1, column 4 1,4 A total of 512 bits come from the first bit subset B in row 1, column 0 1,0 and the first bit subset B at row 1, column 4 1,4 A total of 512 bits,

[0102] The second bit subset T at row 0 and column 5 0,5 and the second bit subset T at row 1, column 5 1,5 A total of 512 bits come from the first bit subset B in row 1 and column 1 1,1 and the first bit subset B at row 1 and column 5 1,5 A total of 512 bits,

[0103] The second bit subset T at row 0 and column 6 0,6 and the second bit subset T at row 1, column 6 1,6 A total of 512 bits come from the first bit subset B in row 1, column 2 1,2 and the first bit subset B at row 1, column 61,6 A total of 512 bits,

[0104] The second bit subset T at row 0 and column 7 0,7 and the second bit subset T at row 1, column 7 1,7 A total of 512 bits come from the first bit subset B in row 1, column 3 1,3 and the first bit subset B at row 1, column 7 1,7 A total of 512 bits.

[0105] In some possible implementations, m0=16, and the 16 second bit subsets are distributed into 2 rows and 8 columns;

[0106] The second bit subset T at row 0 and column 0 0,0 and the second bit subset T at row 0 and column 1 0,1 A total of 512 bits come from the first bit subset B at row 0 and column 0 0,0 and the first bit subset B at row 0 and column 4 0,4 A total of 512 bits,

[0107] The second bit subset T at row 0 and column 2 0,2 and the second bit subset T at row 0 and column 3 0,3 A total of 512 bits come from the first bit subset B at row 0 and column 1 0,1 and the first bit subset B at row 0 and column 5 0,5 A total of 512 bits,

[0108] The second bit subset T of row 0 and column 4 0,4 and the second bit subset T at row 0 and column 5 0,5 A total of 512 bits come from the first bit subset B at row 0 and column 2 0,2 and the first bit subset B at row 0 and column 6 0,6 A total of 512 bits,

[0109] The second bit subset T at row 0 and column 6 0,6 and the second bit subset T at row 0 and column 7 0,7 A total of 512 bits come from the first bit subset B at row 0 and column 3 0,3 and the first bit subset B at row 0 and column 7 0,7 A total of 512 bits,

[0110] The second bit subset T of row 1 and column 0 1,0 and the second bit subset T at row 1, column 1 1,1 A total of 512 bits come from the first bit subset B in row 1, column 0 1,0 and the first bit subset B at row 1, column 41,4 A total of 512 bits,

[0111] The second bit subset T of row 1 and column 2 1,2 and the second bit subset T at row 1, column 3 1,3 A total of 512 bits come from the first bit subset B in row 1 and column 1 1,1 and the first bit subset B at row 1 and column 5 1,5 A total of 512 bits,

[0112] The second bit subset T of row 1 and column 4 1,4 and the second bit subset T at row 1, column 5 1,5 A total of 512 bits come from the first bit subset B in row 1, column 2 1,2 and the first bit subset B at row 1, column 6 1,6 A total of 512 bits,

[0113] The second bit subset T of row 1 and column 6 1,6 and the second bit subset T at row 1, column 7 1,7 A total of 512 bits come from the first bit subset B in row 1, column 3 1,3 and the first bit subset B at row 1, column 7 1,7 A total of 512 bits.

[0114] In some possible implementations, the 16 second bit subsets are distributed into 2 rows and 8 columns;

[0115] The second bit subset T at row 0 and column 0 0,0 and the second bit subset T at row 1, column 0 1,0 A total of 512 bits come from the first bit subset B at row 0 and column 0 0,0 and the first bit subset B at row 0 and column 2 0,2 A total of 512 bits,

[0116] The second bit subset T of row 0 and column 1 0,1 and the second bit subset T at row 1, column 1 1,1 A total of 512 bits come from the first bit subset B in row 1, column 0 1,0 and the first bit subset B at row 1, column 2 1,2 A total of 512 bits,

[0117] The second bit subset T at row 0 and column 2 0,2 and the second bit subset T at row 1, column 2 1,2 A total of 512 bits come from the first bit subset B at row 0 and column 1 0,1 and the first bit subset B at row 0 and column 3 0,3A total of 512 bits,

[0118] The second bit subset T of row 0 and column 3 0,3 and the second bit subset T at row 1, column 3 1,3 A total of 512 bits come from the first bit subset B in row 1 and column 1 1,1 and the first bit subset B at row 1, column 3 1,3 A total of 512 bits,

[0119] The second bit subset T of row 0 and column 4 0,4 and the second bit subset T at row 1, column 4 1,4 A total of 512 bits come from the first bit subset B at row 0 and column 4 0,4 and the first bit subset B at row 0 and column 6 0,6 A total of 512 bits,

[0120] The second bit subset T at row 0 and column 5 0,5 and the second bit subset T at row 1, column 5 1,5 A total of 512 bits come from the first bit subset B in row 1 and column 4 1,4 and the first bit subset B at row 1, column 6 1,6 A total of 512 bits,

[0121] The second bit subset T at row 0 and column 6 0,6 and the second bit subset T at row 1, column 6 1,6 A total of 512 bits come from the first bit subset B at row 0 and column 5 0,5 and the first bit subset B at row 0 and column 7 0,7 A total of 512 bits,

[0122] The second bit subset T at row 0 and column 7 0,7 and the second bit subset T at row 1, column 7 1,7 A total of 512 bits come from the first bit subset B in row 1 and column 5 1,5 and the first bit subset B at row 1, column 7 1,7 A total of 512 bits.

[0123] In some possible implementations, the 16 second bit subsets are distributed into 2 rows and 8 columns;

[0124] The second bit subset T at row 0 and column 0 0,0 and the second bit subset T at row 1, column 0 1,0 A total of 512 bits come from the first bit subset B at row 0 and column 0 0,0 and the first bit subset B at row 0 and column 2 0,2 A total of 512 bits,

[0125] The second bit subset T of row 0 and column 1 0,1 and the second bit subset T at row 1, column 1 1,1 A total of 512 bits come from the first bit subset B at row 0 and column 1 0,1 and the first bit subset B at row 0 and column 3 0,3 A total of 512 bits,

[0126] The second bit subset T at row 0 and column 2 0,2 and the second bit subset T at row 1, column 2 1,2 A total of 512 bits come from the first bit subset B at row 0 and column 4 0,4 and the first bit subset B at row 0 and column 6 0,6 A total of 512 bits,

[0127] The second bit subset T of row 0 and column 3 0,3 and the second bit subset T at row 1, column 3 1,3 A total of 512 bits come from the first bit subset B at row 0 and column 5 0,5 and the first bit subset B at row 0 and column 7 0,7 A total of 512 bits,

[0128] The second bit subset T of row 0 and column 4 0,4 and the second bit subset T at row 1, column 4 1,4 A total of 512 bits come from the first bit subset B in row 1, column 0 1,0 and the first bit subset B at row 1, column 2 1,2 A total of 512 bits,

[0129] The second bit subset T at row 0 and column 5 0,5 and the second bit subset T at row 1, column 5 1,5 A total of 512 bits come from the first bit subset B in row 1 and column 1 1,1 and the first bit subset B at row 1, column 3 1,3 A total of 512 bits,

[0130] The second bit subset T at row 0 and column 6 0,6 and the second bit subset T at row 1, column 6 1,6 A total of 512 bits come from the first bit subset B in row 1 and column 4 1,4 and the first bit subset B at row 1, column 6 1,6 A total of 512 bits,

[0131] The second bit subset T at row 0 and column 7 0,7 and the second bit subset T at row 1, column 71,7 A total of 512 bits come from the first bit subset B in row 1 and column 5 1,5 and the first bit subset B at row 1, column 7 1,7 A total of 512 bits.

[0132] In some possible implementations, m0=16, and the 16 second bit subsets are distributed into 2 rows and 8 columns;

[0133] The second bit subset T at row 0 and column 0 0,0 and the second bit subset T at row 0 and column 1 0,1 A total of 512 bits come from the first bit subset B at row 0 and column 0 0,0 and the first bit subset B at row 0 and column 2 0,2 A total of 512 bits,

[0134] The second bit subset T at row 0 and column 2 0,2 and the second bit subset T at row 0 and column 3 0,3 A total of 512 bits come from the first bit subset B at row 0 and column 1 0,1 and the first bit subset B at row 0 and column 3 0,3 A total of 512 bits,

[0135] The second bit subset T of row 0 and column 4 0,4 and the second bit subset T at row 0 and column 5 0,5 A total of 512 bits come from the first bit subset B at row 0 and column 4 0,4 and the first bit subset B at row 0 and column 6 0,6 A total of 512 bits,

[0136] The second bit subset T at row 0 and column 6 0,6 and the second bit subset T at row 0 and column 7 0,7 A total of 512 bits come from the first bit subset B at row 0 and column 5 0,5 and the first bit subset B at row 0 and column 7 0,7 A total of 512 bits,

[0137] The second bit subset T of row 1 and column 0 1,0 and the second bit subset T at row 1, column 1 1,1 A total of 512 bits come from the first bit subset B in row 1, column 0 1,0 and the first bit subset B at row 1, column 2 1,2 A total of 512 bits,

[0138] The second bit subset T of row 1 and column 2 1,2 and the second bit subset T at row 1, column 31,3 A total of 512 bits come from the first bit subset B in row 1 and column 1 1,1 and the first bit subset B at row 1, column 3 1,3 A total of 512 bits,

[0139] The second bit subset T of row 1 and column 4 1,4 and the second bit subset T at row 1, column 5 1,5 A total of 512 bits come from the first bit subset B in row 1 and column 4 1,4 and the first bit subset B at row 1, column 6 1,6 A total of 512 bits,

[0140] The second bit subset T of row 1 and column 6 1,6 and the second bit subset T at row 1, column 7 1,7 A total of 512 bits come from the first bit subset B in row 1 and column 5 1,5 and the first bit subset B at row 1, column 7 1,7 A total of 512 bits.

[0141] In some possible implementations, m0=12 or 16.

[0142] In some possible implementations, after interleaving the fourth bit set to obtain the fifth bit set, the method further includes: performing a second interleaving process on every two first bit streams in the L first bit streams to obtain a total of L / 2 second bit streams, each first bit stream including a plurality of the fifth bit sets, where L is an even integer greater than 0. Performing symbol mapping and polarization division on the L / 2 second bit streams to obtain a dual-polarization symbol stream, wherein the symbol mapping and polarization division map t bits into one dual-polarization symbol, where t is an integer greater than 0. Performing digital signal processing (DSP) framing on the dual-polarization symbol stream.

[0143] In some possible implementations, the amplitude bits in the dual-polarization symbol come from the second bit set.

[0144] In some possible implementations, t=8, and the dual-polarization symbol is a dual-polarization DP-16QAM symbol.

[0145] In some possible implementations, performing DSP framing on the dual-polarization symbol stream includes: performing framing processing on every 172,032 dual-polarization DP-16QAM symbols to obtain a DSP superframe, where the superframe includes 175,104 dual-polarization symbols.

[0146] In a second aspect, the present application provides a data processing method, the data processing method comprising the following steps: obtaining first data from a data frame, the first data comprising r rows and q columns of bits, wherein r is an integer greater than 0, and q is an integer greater than 0; performing a cyclic redundancy check (CRC) on the first data and / or inserting padding bits to obtain second data, the second data comprising d bits for which CRC insertion is performed; CRC parity bits and / or d PAD Filling bits, d CRC is an integer greater than or equal to 0, d PAD is an integer greater than or equal to 0. The second data is scrambled to obtain third data, and the number of bits of the third data is d scr =r×q+d CP , d CP =d CRC +d PAD Get k bits of the third data, where k is an integer greater than 1, d scr is an integer multiple of k. PCS processing is performed on a first bit set of the k bits to obtain a second bit set. FEC encoding is performed on the second bit set and a third bit set of the k bits excluding the first bit set to obtain a fourth bit set.

[0147] In this implementation, FEC encoding combined with PCS technology will be used for future metropolitan area telecom transmission and metropolitan area DCI interconnection scenarios to achieve longer transmission distances. The introduction of PCS processing reduces the information bit length required for PCS processing and FEC encoding from 3552 to a smaller value. This requires redesigning the number of rows retrieved from the data frame, the number of CRC checks performed, and the number of padding bits inserted, resulting in simpler overall data processing operations, reduced complexity, and lower power consumption.

[0148] In some possible implementations, performing FEC encoding on the second bit set and a third bit set excluding the first bit set among the k bits to obtain a fourth bit set includes: performing pre-encoding interleaving on the second bit set and the third bit set to obtain a sixth bit set, the number of bits in the sixth bit set being equal to the sum of the number of bits in the second bit set and the number of bits in the third bit set, the sixth bit set including m3 third bit subsets, the m3 third bit subsets being distributed in 2 rows and m4 columns, m3=2×m4, m3 being an integer greater than 1 and less than m0, each third bit subset in a portion of the third bit subsets including F0 bits, each third bit subset in another portion of the third bit subsets including F2 bits, F2 being an even number greater than 1 and less than F0. Performing FEC encoding on the sixth bit set to obtain the fourth bit set.

[0149] In some possible implementations, the number of bits in the first bit set is an integer multiple of 2, 4, 8, or 16, the second bit set includes 2048 bits, the third bit set includes 1504 bits, and the fourth bit set includes 4096 bits.

[0150] In some possible implementations, d scr It is an integer multiple of 4×k, q=10280.

[0151] In some possible implementations, the redundancy of performing CRC and / or inserting padding bits is (d CRC +d PAD ) / (r×q),(d CRC +d PAD ) / (r×q)≤0.001.

[0152] In some possible implementations, r=79, d CP =328, k=3224;

[0153] Or, r = 83, d CP =32, k=3386;

[0154] Or, r = 83, d CP =536, k=3388;

[0155] Or, r = 87, d CP =72, k=2662;

[0156] Or, r = 87, d CP =744, k=2664;

[0157] Or, r = 87, d CP =3432, k=2672;

[0158] Or, r = 104, d CP =704, k=3184;

[0159] Or, r = 104, d CP =3392, k=3192;

[0160] Or, r = 105, d CP =504, k=3214;

[0161] Or, r = 105, d CP =1176, k=3216;

[0162] Or, r = 109, d CP =40, k=2668;

[0163] Or, r = 109, d CP =880, k=2670;

[0164] Or, r = 110, d CP =176, k=3366;

[0165] Or, r = 110, d CP =848, k=3368;

[0166] Or, r = 110, d CP =3536, k=3376;

[0167] Or, r = 111, d CP =648, k=3398;

[0168] Or, r = 131, d CP =8, k=2672;

[0169] Or, r = 131, d CP =1016, k=2674;

[0170] Or, r = 131, d CP =680, k=3208;

[0171] Or, r = 132, d CP =480, k=3232;

[0172] Or, r = 132, d CP =1320, k=3234;

[0173] Or, r = 137, d CP =320, k=3354;

[0174] Or, r = 137, d CP =1160, k=3356;

[0175] Or, r = 138, d CP =120, k=3378;

[0176] Or, r = 138, d CP =960, k=3380;

[0177] Or, r = 152, d CP =344, k=2658;

[0178] Or, r = 152, d CP =1520, k=2660;

[0179] Or, r = 153, dCP =648, k=2676;

[0180] Or, r = 157, d CP =856, k=3204;

[0181] Or, r = 158, d CP =656, k=3224;

[0182] Or, r = 165, d CP =264, k=3366;

[0183] Or, r = 165, d CP =1272, k=3368;

[0184] Or, r = 166, d CP =64, k=3386;

[0185] Or, r = 166, d CP =1072, k=3388;

[0186] Or, r = 174, d CP =144, k=2662;

[0187] Or, r = 174, d CP =1488, k=2664;

[0188] Or, r = 175, d CP =616, k=2678;

[0189] Or, r = 183, d CP =360, k=3200;

[0190] Or, r = 183, d CP =1536, k=3202;

[0191] Or, r = 184, d CP =664, k=3218;

[0192] Or, r = 184, d CP =1840, k=3220;

[0193] Or, r = 185, d CP =968, k=3236;

[0194] Or, r = 192, d CP =744, k=3358;

[0195] Or, r = 192, d CP=1920, k=3360;

[0196] Or, r = 193, d CP =1048, k=3376;

[0197] Or, r = 194, d CP =176, k=3392;

[0198] Or, r = 194, d CP =1352, k=3394;

[0199] Or, r = 196, d CP =616, k=2666;

[0200] Or, r = 209, d CP =536, k=3198;

[0201] Or, r = 209, d CP =1880, k=3200;

[0202] Or, r = 210, d CP =1008, k=3214;

[0203] Or, r = 211, d CP =136, k=3228;

[0204] Or, r = 211, d CP =1480, k=3230;

[0205] Or, r = 217, d CP =280, k=2656;

[0206] Or, r = 217, d CP =1960, k=2658;

[0207] Or, r = 218, d CP =80, k=2668;

[0208] Or, r = 218, d CP =1760, k=2670;

[0209] Or, r = 219, d CP =1224, k=3352;

[0210] Or, r = 220, d CP =352, k=3366;

[0211] Or, r = 220, d CP =1696, k=3368;

[0212] Or, r = 221, d CP =824, k=3382;

[0213] Or, r = 221, d CP =2168, k=3384;

[0214] Or, r = 222, d CP =1296, k=3398;

[0215] Or, r = 235, d CP =376, k=3196;

[0216] Or, r = 235, d CP =1888, k=3198;

[0217] Or, r = 236, d CP =680, k=3210;

[0218] Or, r = 236, d CP =2192, k=3212;

[0219] Or, r = 237, d CP =984, k=3224;

[0220] Or, r = 238, d CP =1288, k=3238;

[0221] Or, r = 239, d CP =920, k=2660;

[0222] Or, r = 240, d CP =1728, k=2672;

[0223] Or, r = 247, d CP =1000, k=3360;

[0224] Or, r = 247, d CP =2512, k=3362;

[0225] Or, r = 248, d CP =1304, k=3374;

[0226] Or, r = 249, d CP =96, k=3386;

[0227] Or, r = 249, d CP =1608, k=3388;

[0228] Or, r = 250, d CP =400, k=3400;

[0229] Or, r = 250, d CP =1912, k=3402;

[0230] Or, r = 261, d CP =216, k=2662;

[0231] Or, r = 261, d CP =2232, k=2664;

[0232] Or, r = 261, d CP =1560, k=3196;

[0233] Or, r = 262, d CP =16, k=2672;

[0234] Or, r = 262, d CP =2032, k=2674;

[0235] Or, r = 262, d CP =1360, k=3208;

[0236] Or, r = 263, d CP =1160, k=3220;

[0237] Or, r = 264, d CP =960, k=3232;

[0238] Or, r = 264, d CP =2640, k=3234;

[0239] Or, r = 274, d CP =640, k=3354;

[0240] Or, r = 274, d CP =2320, k=3356;

[0241] Or, r = 275, d CP =440, k=3366;

[0242] Or, r = 275, d CP =2120, k=3368;

[0243] Or, r = 276, d CP =240, k=3378;

[0244] Or, r = 276, d CP =1920, k=3380;

[0245] Or, r = 277, d CP =40, k=3390;

[0246] Or, r = 277, d CP =1720, k=3392;

[0247] Or, r = 283, d CP =2032, k=2666;

[0248] Or, r = 284, d CP =488, k=2674;

[0249] Or, r = 284, d CP =2672, k=2676;

[0250] Or, r = 287, d CP =896, k=3194;

[0251] Or, r = 287, d CP =2744, k=3196;

[0252] Or, r = 288, d CP =1704, k=3206;

[0253] Or, r = 289, d CP =664, k=3216;

[0254] Or, r = 289, d CP =2512, k=3218;

[0255] Or, r = 290, d CP =1472, k=3228;

[0256] Or, r = 291, d CP =432, k=3238;

[0257] Or, r = 291, d CP =2280, k=3240;

[0258] Or, r = 302, d CP =80, k=3360;

[0259] Or, r = 302, d CP =1928, k=3362;

[0260] Or, r = 303, dCP =888, k=3372;

[0261] Or, r = 303, d CP =2736, k=3374;

[0262] Or, r = 304, d CP =688, k=2658;

[0263] Or, r = 304, d CP =3040, k=2660;

[0264] Or, r = 304, d CP =1696, k=3384;

[0265] Or, r = 305, d CP =2168, k=2668;

[0266] Or, r = 305, d CP =656, k=3394;

[0267] Or, r = 305, d CP =2504, k=3396;

[0268] Or, r = 306, d CP =1296, k=2676;

[0269] Or, r = 313, d CP =1912, k=3194;

[0270] Or, r = 314, d CP =1712, k=3204;

[0271] Or, r = 315, d CP =1512, k=3214;

[0272] Or, r = 316, d CP =1312, k=3224;

[0273] Or, r = 317, d CP =1112, k=3234;

[0274] Or, r = 317, d CP =3128, k=3236;

[0275] Or, r = 326, d CP =320, k=2660;

[0276] Or, r = 326, d CP=2840, k=2662;

[0277] Or, r = 327, d CP =120, k=2668;

[0278] Or, r = 327, d CP =2640, k=2670;

[0279] Or, r = 328, d CP =2440, k=2678;

[0280] Or, r = 329, d CP =728, k=3356;

[0281] Or, r = 329, d CP =2744, k=3358;

[0282] Or, r = 330, d CP =528, k=3366;

[0283] Or, r = 330, d CP =2544, k=3368;

[0284] Or, r = 331, d CP =328, k=3376;

[0285] Or, r = 331, d CP =2344, k=3378;

[0286] Or, r = 332, d CP =128, k=3386;

[0287] Or, r = 332, d CP =2144, k=3388;

[0288] Or, r = 333, d CP =1944, k=3398;

[0289] Or, r = 339, d CP =744, k=3192;

[0290] Or, r = 339, d CP =2928, k=3194;

[0291] Or, r = 340, d CP =1384, k=3202;

[0292] Or, r = 341, d CP =2024, k=3212;

[0293] Or, r = 342, d CP =480, k=3220;

[0294] Or, r = 342, d CP =2664, k=3222;

[0295] Or, r = 343, d CP =1120, k=3230;

[0296] Or, r = 343, d CP =3304, k=3232;

[0297] Or, r = 344, d CP =1760, k=3240;

[0298] Or, r = 348, d CP =288, k=2662;

[0299] Or, r = 348, d CP =2976, k=2664;

[0300] Or, r = 349, d CP =760, k=2670;

[0301] Or, r = 349, d CP =3448, k=2672;

[0302] Or, r = 350, d CP =1232, k=2678;

[0303] Or, r = 356, d CP =704, k=3352;

[0304] Or, r = 356, d CP =2888, k=3354;

[0305] Or, r = 357, d CP =1344, k=3362;

[0306] Or, r = 357, d CP =3528, k=3364;

[0307] Or, r = 358, d CP =1984, k=3372;

[0308] Or, r = 359, d CP =440, k=3380;

[0309] Or, r = 359, d CP =2624, k=3382;

[0310] Or, r = 360, d CP =1080, k=3390;

[0311] Or, r = 360, d CP =3264, k=3392;

[0312] Or, r = 361, d CP =1720, k=3400;

[0313] Or, r = 365, d CP =1592, k=3192;

[0314] Or, r = 366, d CP =720, k=3200;

[0315] Or, r = 366, d CP =3072, k=3202;

[0316] Or, r = 367, d CP =2200, k=3210;

[0317] Or, r = 368, d CP =1328, k=3218;

[0318] Or, r = 368, d CP =3680, k=3220;

[0319] Or, r = 369, d CP =2304, k=2658;

[0320] Or, r = 369, d CP =456, k=3226;

[0321] Or, r = 369, d CP =2808, k=3228;

[0322] Or, r = 370, d CP =592, k=2664;

[0323] Or, r = 370, d CP =3448, k=2666;

[0324] Or, r = 370, d CP =1936, k=3236;

[0325] Or, r = 371, d CP =1736, k=2672;

[0326] Or, r = 384, d CP =1488, k=3358;

[0327] Or, r = 384, d CP =3840, k=3360;

[0328] Or, r = 385, d CP =616, k=3366;

[0329] Or, r = 385, d CP =2968, k=3368;

[0330] Or, r = 386, d CP =2096, k=3376;

[0331] Or, r = 387, d CP =1224, k=3384;

[0332] Or, r = 387, d CP =3576, k=3386;

[0333] Or, r = 388, d CP =352, k=3392;

[0334] Or, r = 388, d CP =2704, k=3394;

[0335] Or, r = 389, d CP =1832, k=3402;

[0336] Or, r = 391, d CP =2440, k=2660;

[0337] Or, r = 392, d CP =1232, k=2666;

[0338] Or, r = 392, d CP =2240, k=3200;

[0339] Or, r = 393, d CP =24, k=2672;

[0340] Or, r = 393, d CP =3048, k=2674;

[0341] Or, r = 393, dCP =2040, k=3208;

[0342] Or, r = 394, d CP =1840, k=3216;

[0343] Or, r = 395, d CP =1640, k=3224;

[0344] Or, r = 396, d CP =1440, k=3232;

[0345] Or, r = 396, d CP =3960, k=3234;

[0346] Or, r = 397, d CP =1240, k=3240;

[0347] Or, r = 397, d CP =3760, k=3242;

[0348] Or, r = 411, d CP =960, k=3354;

[0349] Or, r = 411, d CP =3480, k=3356;

[0350] Or, r = 412, d CP =760, k=3362;

[0351] Or, r = 412, d CP =3280, k=3364;

[0352] Or, r = 413, d CP =2912, k=2662;

[0353] Or, r = 413, d CP =560, k=3370;

[0354] Or, r = 413, d CP =3080, k=3372;

[0355] Or, r = 414, d CP =2208, k=2668;

[0356] Or, r = 414, d CP =360, k=3378;

[0357] Or, r = 414, d CP=2880, k=3380;

[0358] Or, r = 415, d CP =1504, k=2674;

[0359] Or, r = 415, d CP =160, k=3386;

[0360] Or, r = 415, d CP =2680, k=3388;

[0361] Or, r = 416, d CP =2480, k=3396;

[0362] Or, r = 418, d CP =1072, k=3198;

[0363] Or, r = 418, d CP =3760, k=3200;

[0364] Or, r = 419, d CP =1544, k=3206;

[0365] Or, r = 419, d CP =4232, k=3208;

[0366] Or, r = 420, d CP =2016, k=3214;

[0367] Or, r = 421, d CP =2488, k=3222;

[0368] Or, r = 422, d CP =272, k=3228;

[0369] Or, r = 422, d CP =2960, k=3230;

[0370] Or, r = 423, d CP =744, k=3236;

[0371] Or, r = 423, d CP =3432, k=3238;

[0372] Or, r = 434, d CP =560, k=2656;

[0373] Or, r = 434, d CP =3920, k=2658;

[0374] Or, r = 435, d CP =360, k=2662;

[0375] Or, r = 435, d CP =3720, k=2664;

[0376] Or, r = 436, d CP =160, k=2668;

[0377] Or, r = 436, d CP =3520, k=2670;

[0378] Or, r = 437, d CP =3320, k=2676;

[0379] Or, r = 438, d CP =2448, k=3352;

[0380] Or, r = 439, d CP =232, k=3358;

[0381] Or, r = 439, d CP =2920, k=3360;

[0382] Or, r = 440, d CP =704, k=3366;

[0383] Or, r = 440, d CP =3392, k=3368;

[0384] Or, r = 441, d CP =1176, k=3374;

[0385] Or, r = 441, d CP =3864, k=3376;

[0386] Or, r = 442, d CP =1648, k=3382;

[0387] Or, r = 442, d CP =4336, k=3384;

[0388] Or, r = 443, d CP =2120, k=3390;

[0389] Or, r = 444, d CP =2424, k=3198;

[0390] Or, r = 444, d CP =2592, k=3398;

[0391] Or, r = 445, d CP =712, k=3204;

[0392] Or, r = 445, d CP =3568, k=3206;

[0393] Or, r = 446, d CP =1856, k=3212;

[0394] Or, r = 447, d CP =144, k=3218;

[0395] Or, r = 447, d CP =3000, k=3220;

[0396] Or, r = 448, d CP =1288, k=3226;

[0397] Or, r = 448, d CP =4144, k=3228;

[0398] Or, r = 449, d CP =2432, k=3234;

[0399] Or, r = 456, d CP =1032, k=2658;

[0400] Or, r = 456, d CP =4560, k=2660;

[0401] Or, r = 457, d CP =1336, k=2664;

[0402] Or, r = 458, d CP =1640, k=2670;

[0403] Or, r = 459, d CP =1944, k=2676;

[0404] Or, r = 466, d CP =1888, k=3356;

[0405] Or, r = 466, d CP =4744, k=3358;

[0406] Or, r = 467, d CP =176, k=3362;

[0407] Or, r = 467, d CP =3032, k=3364;

[0408] Or, r = 468, d CP =1320, k=3370;

[0409] Or, r = 468, d CP =4176, k=3372;

[0410] Or, r = 469, d CP =2464, k=3378;

[0411] Or, r = 470, d CP =752, k=3196;

[0412] Or, r = 470, d CP =3776, k=3198;

[0413] Or, r = 470, d CP =752, k=3384;

[0414] Or, r = 470, d CP =3608, k=3386;

[0415] Or, r = 471, d CP =2568, k=3204;

[0416] Or, r = 471, d CP =1896, k=3392;

[0417] Or, r = 471, d CP =4752, k=3394;

[0418] Or, r = 472, d CP =1360, k=3210;

[0419] Or, r = 472, d CP =4384, k=3212;

[0420] Or, r = 472, d CP =184, k=3398;

[0421] Or, r = 472, d CP =3040, k=3400;

[0422] Or, r = 473, dCP =152, k=3216;

[0423] Or, r = 473, d CP =3176, k=3218;

[0424] Or, r = 474, d CP =1968, k=3224;

[0425] Or, r = 475, d CP =760, k=3230;

[0426] Or, r = 475, d CP =3784, k=3232;

[0427] Or, r = 476, d CP =2576, k=3238;

[0428] Or, r = 478, d CP =1840, k=2660;

[0429] Or, r = 479, d CP =2648, k=2666;

[0430] Or, r = 480, d CP =3456, k=2672;

[0431] Or, r = 481, d CP =568, k=2676;

[0432] Or, r = 481, d CP =4264, k=2678;

[0433] Or, r = 493, d CP =184, k=3352;

[0434] Or, r = 493, d CP =3208, k=3354;

[0435] Or, r = 494, d CP =2000, k=3360;

[0436] Or, r = 494, d CP =5024, k=3362;

[0437] Or, r = 495, d CP =792, k=3366;

[0438] Or, r = 495, d CP=3816, k=3368;

[0439] Or, r = 496, d CP =1936, k=3196;

[0440] Or, r = 496, d CP =2608, k=3374;

[0441] Or, r = 497, d CP =1232, k=3202;

[0442] Or, r = 497, d CP =4424, k=3204;

[0443] Or, r = 497, d CP =1400, k=3380;

[0444] Or, r = 497, d CP =4424, k=3382;

[0445] Or, r = 498, d CP =528, k=3208;

[0446] Or, r = 498, d CP =3720, k=3210;

[0447] Or, r = 498, d CP =192, k=3386;

[0448] Or, r = 498, d CP =3216, k=3388;

[0449] Or, r = 499, d CP =1672, k=2656;

[0450] Or, r = 499, d CP =3016, k=3216;

[0451] Or, r = 499, d CP =2008, k=3394;

[0452] Or, r = 499, d CP =5032, k=3396;

[0453] Or, r = 500, d CP =2984, k=2662;

[0454] Or, r = 500, d CP=2312, k=3222;

[0455] Or, r = 500, d CP =800, k=3400;

[0456] Or, r = 500, d CP =3824, k=3402;

[0457] Or, r = 501, d CP =432, k=2666;

[0458] Or, r = 501, d CP =4296, k=2668;

[0459] Or, r = 501, d CP =1608, k=3228;

[0460] Or, r = 501, d CP =4800, k=3230;

[0461] Or, r = 502, d CP =1744, k=2672;

[0462] Or, r = 502, d CP =904, k=3234;

[0463] Or, r = 502, d CP =4096, k=3236;

[0464] Or, r = 503, d CP =3056, k=2678.

[0465] In some possible implementations, d scr =336×k.

[0466] In some possible implementations, performing CRC on the first data includes:

[0467] Perform CRC-32 check on a total of r×q / p bits in each r / p rows of the first data to add a check bit with a length of 32 bits, d CRC =32×p, r is divisible by p, and p is an integer greater than 1.

[0468] or,

[0469] For the first r in the first data F0 ×(p-1) rows of each r F0 Rows total q×r F0The CRC-32 check is performed on the first data to add a check bit with a length of 32 bits, and the last r F1 Rows total q×r F1 bits to perform CRC-32 check to add a check bit with a length of 32 bits, where d CRC =32×p, r cannot be divided by p, p is an integer greater than 1, r F0 ×(p-1)+r F1 =r, r F0 >r F1 , Indicates that a is rounded down.

[0470] In some possible implementations, q×r F0 =41120.

[0471] In some possible implementations, q=2056.

[0472] In some possible implementations, performing CRC on the first data includes: performing CRC on the first r F0 ×(p-1) rows of each r F0 Rows total q×r F0 The CRC-32 check is performed on the first data to add a check bit with a length of 32 bits, and the last r F1 Rows total q×r F1 CRC-32 check is performed on the bits to add a check bit with a length of 32 bits. CRC =32×p, r cannot be divided by p, p is an integer greater than 1, r F0 ×(p-1)+r F1 =r, integer r F0 Greater than an integer r F1 , Indicates that a is rounded down.

[0473] In some possible implementations, r=435.

[0474] In some possible implementations, p=22, r F0 =20, r F1 =15, performing CRC on the first data includes: performing CRC-32 check on every 20 rows of the first 420 rows (a total of 41120 bits) in the first data to add check bits with a length of 32 bits, and performing CRC-32 check on the last 15 rows (a total of 30840 bits) in the first data to add check bits with a length of 32 bits.

[0475] In some possible implementations, d CP=3432, k=2672, or, d CP =744, k=2664.

[0476] In some possible implementations, r=546, d CP =1008, k=3344;

[0477] Or, r = 546, d CP =3696, k=3352;

[0478] Or, r = 547, d CP =1640, k=3352;

[0479] Or, r = 547, d CP =4328, k=3360;

[0480] Or, r = 548, d CP =2272, k=3360;

[0481] Or, r = 548, d CP =4960, k=3368;

[0482] Or, r = 549, d CP =216, k=3360;

[0483] Or, r = 549, d CP =2904, k=3368;

[0484] Or, r = 549, d CP =5592, k=3376;

[0485] Or, r = 550, d CP =848, k=3368;

[0486] Or, r = 550, d CP =3536, k=3376;

[0487] Or, r = 551, d CP =1480, k=3376;

[0488] Or, r = 551, d CP =4168, k=3384;

[0489] Or, r = 552, d CP =2112, k=3384;

[0490] Or, r = 552, d CP =4800, k=3392;

[0491] Or, r = 553, d CP =56, k=3384;

[0492] Or, r = 553, d CP =2744, k=3392;

[0493] Or, r = 553, d CP =5432, k=3400;

[0494] Or, r = 554, d CP =688, k=3392;

[0495] Or, r = 554, d CP =3376, k=3400;

[0496] Or, r = 555, d CP =1320, k=3400;

[0497] Or, r = 555, d CP =4008, k=3408;

[0498] Or, r = 556, d CP =1952, k=3408;

[0499] Or, r = 556, d CP =4640, k=3416;

[0500] Or, r = 557, d CP =2584, k=3416;

[0501] Or, r = 557, d CP =5272, k=3424;

[0502] Or, r = 558, d CP =528, k=3416;

[0503] Or, r = 558, d CP =3216, k=3424;

[0504] Or, r = 559, d CP =1160, k=3424;

[0505] Or, r = 559, d CP =3848, k=3432;

[0506] Or, r = 560, d CP =1792, k=3432;

[0507] Or, r = 560, d CP =4480, k=3440;

[0508] Or, r = 561, d CP =2424, k=3440;

[0509] Or, r = 561, d CP =5112, k=3448;

[0510] Or, r = 562, d CP =368, k=3440;

[0511] Or, r = 562, d CP =3056, k=3448;

[0512] Or, r = 562, d CP =5744, k=3456.

[0513] In some possible implementations, r=520, d CP =704, k=3184;

[0514] Or, r = 520, d CP =3392, k=3192;

[0515] Or, r = 520, d CP =6080, k=3200;

[0516] Or, r = 521, d CP =1336, k=3192;

[0517] Or, r = 521, d CP =4024, k=3200;

[0518] Or, r = 522, d CP =1968, k=3200;

[0519] Or, r = 522, d CP =4656, k=3208;

[0520] Or, r = 523, d CP =2600, k=3208;

[0521] Or, r = 523, d CP =5288, k=3216;

[0522] Or, r = 524, d CP =544, k=3208;

[0523] Or, r = 524, d CP =3232, k=3216;

[0524] Or, r = 525, d CP =1176, k=3216;

[0525] Or, r = 525, d CP =3864, k=3224;

[0526] Or, r = 526, d CP =1808, k=3224;

[0527] Or, r = 526, d CP =4496, k=3232;

[0528] Or, r = 527, d CP =2440, k=3232;

[0529] Or, r = 527, d CP =5128, k=3240;

[0530] Or, r = 528, d CP =384, k=3232;

[0531] Or, r = 528, d CP =3072, k=3240;

[0532] Or, r = 528, d CP =5760, k=3248;

[0533] Or, r = 529, d CP =1016, k=3240;

[0534] Or, r = 529, d CP =3704, k=3248;

[0535] Or, r = 530, d CP =1648, k=3248;

[0536] Or, r = 530, d CP =4336, k=3256;

[0537] Or, r = 531, d CP =2280, k=3256;

[0538] Or, r = 531, d CP =4968, k=3264;

[0539] Or, r = 532, dCP =2912, k=3264;

[0540] Or, r = 532, d CP =224, k=3256;

[0541] Or, r = 533, d CP =856, k=3264;

[0542] Or, r = 533, d CP =3544, k=3272;

[0543] Or, r = 534, d CP =1488, k=3272;

[0544] Or, r = 534, d CP =4176, k=3280;

[0545] Or, r = 535, d CP =2120, k=3280;

[0546] Or, r = 535, d CP =4808, k=3288.

[0547] In some possible implementations, after performing FEC encoding on the second bit set and the third bit set to obtain a fourth bit set, the method further includes: performing a first interleaving process on the fourth bit set to obtain a fifth bit set, the fifth bit set comprising m0 second bit subsets, each second bit subset comprising 256 bits, 128 bits of each second bit subset comprising from the second bit set, and the remaining 128 bits of each second bit subset comprising from the third bit set and / or parity bits of the FEC encoding. Performing a second interleaving process on every two of the L first bit streams to obtain a total of L / 2 second bit streams, each of the first bit streams comprising multiple fifth bit sets, where L is an even integer greater than 0. Performing symbol mapping and polarization division on the L / 2 second bit streams to obtain a dual-polarization symbol stream, wherein the symbol mapping and polarization division map t bits into one dual-polarization symbol, where t is an integer greater than 0. Performing DSP framing on the dual-polarization symbol stream.

[0548] In some possible implementations, the amplitude bits in the dual-polarization symbol come from the second bit set.

[0549] In some possible implementations, t=8, and the dual-polarization symbol is a dual-polarization DP-16QAM symbol.

[0550] In some possible implementations, performing DSP framing on the dual-polarization symbol stream includes: performing framing processing on every 172,032 dual-polarization DP-16QAM symbols to obtain a DSP superframe, where the superframe includes 175,104 dual-polarization symbols.

[0551] In some possible implementations, obtaining the first data from the data frame includes: obtaining F from the data frame Frame The first data to get F Frame ×r×q bits, F Frame Is an integer greater than 0. d scr ×F Frame =336×k×F DSP Among them, F DSP Indicates the number of DSP superframes, F DSP A DSP superframe consists of F Frame The first data is processed and F DSP An integer greater than 0.

[0552] In some possible embodiments, F DSP >1, the F DSP A plurality of continuous symbols in the first DSP superframe in the DSP superframe is a first identifier, and the F DSP A plurality of consecutive symbols in each DSP superframe in the DSP superframes except the first DSP superframe are the second identifiers.

[0553] In a third aspect, an embodiment of the present application provides a data processing method, comprising the following steps: performing a first PCS process on a first bit set in a first group of k bits to obtain a second bit set, the second bit set comprising m0×128 bits, where k is an integer greater than 1 and m0 is an integer greater than 1; performing a first FEC encoding on the second bit set and a third bit set in the first group of k bits other than the first bit set to obtain a fourth bit set, the fourth bit set comprising m0 first bit matrices, each of which comprises 256 bits distributed in 16 rows and 16 columns; performing a second PCS process on a fifth bit set in the second group of k bits to obtain a sixth bit set; performing a second FEC encoding on the sixth bit set and a seventh bit set in the second group of k bits other than the fifth bit set to obtain an eighth bit set, the eighth bit set comprising m0 second bit matrices, each of which comprises 256 bits distributed in 16 rows and 16 columns; and inputting 21 of the fourth bit sets and 21 of the eighth bit sets into an interleaving buffer. The interleaving buffer includes 84×m1 cache cells arranged in 84 rows and m1 columns, where m0 = m1×2. Each cache cell is used to cache 16 rows and 16 columns, totaling 256 bits. 42×m1 first bit matrices are input into the even-numbered rows of the interleaving buffer, and 42×m1 second bit matrices are input into the odd-numbered rows of the interleaving buffer. The interleaving buffer includes a first cache subset and a second cache subset. The first cache subset includes 42×m1 cache cells, and the second cache subset includes 42×m1 cache cells. The bits input into the first cache subset come from the second bit set and the sixth bit set, while the bits input into the second cache subset come from the third bit set, the seventh bit set, the parity bits of the first FEC code, and the parity bits of the second FEC code. Symbol mapping and polarization division are performed on every 8 bits in the interleaving buffer to obtain a dual-polarization DP-16QAM symbol. Two amplitude bits of the four bits corresponding to the 16QAM symbol of the DP-16QAM symbol in the target polarization direction come from a column in the first cache unit of the first cache subset, and two symbol bits of the four bits corresponding to the 16QAM symbol of the DP-16QAM symbol in the target polarization direction come from a column in the second cache unit of the second cache subset.

[0554] In this embodiment, the data processing method provided in the third aspect of the present application provides a third interleaving process of similar complexity to the second interleaving process in the first aspect, compared to the data processing method described in the first aspect. The third interleaving process is implemented by the third aspect using an interleaving buffer, and the buffer size used for the third interleaving process is similar to or the same as that used for the second interleaving process. This is equivalent to the third interleaving process replacing the first and second interleaving processes in the first aspect, achieving an effect similar to that of the first aspect, so that bits with unequal probabilities of 0 and 1 obtained through PCS processing can be mapped to the amplitude bits of the modulation symbol, achieving the change in the probability of occurrence of constellation points while keeping the constellation point positions unchanged, resulting in a non-uniform distribution, and improving overall performance to meet future requirements for longer transmission distances. In addition, the data processing method provided in the third aspect has lower complexity.

[0555] In some possible implementations, 4 of the 8 bits come from a column of a first cache unit in the first cache subset, and the other 4 of the 8 bits come from a column of a second cache unit in the second cache subset.

[0556] In some possible embodiments, the m0 first bit matrixes are distributed into 2 rows and m1 columns, wherein the first bit matrix in the 0th row and m2th column and the first bit matrix in the 1st row and m2th column are from the second bit set, and the m0 second bit matrixes are distributed into 2 rows and m1 columns, wherein the second bit matrix in the 0th row and m2th column and the second bit matrix in the 1st row and m2th column are from the sixth bit set, 0≤m2<m1 / 2.

[0557] In some possible implementations, m0=16, the first cache subset includes 336 cache cells in columns 0, 1, 2, and 3 of the interleaved cache, and the second cache subset includes 336 cache cells in columns 4, 5, 6, and 7 of the interleaved cache. Alternatively, m0=12, the first cache subset includes 252 cache cells in columns 0, 1, and 2 of the interleaved cache, and the second cache subset includes 252 cache cells in columns 3, 4, and 5 of the interleaved cache.

[0558] In some possible implementations, m0=16, m1=8. The m0 first bit matrices are distributed into 2 rows and m1 columns, and the first bit matrix in row 0 and column 0, the first bit matrix in row 0 and column 1, the first bit matrix in row 0 and column 4, the first bit matrix in row 0 and column 5, the first bit matrix in row 1 and column 0, the first bit matrix in row 1 and column 1, the first bit matrix in row 1 and column 4, and the first bit matrix in row 1 and column 5 are from the second bit set. The m0 second bit matrices are distributed into 2 rows and m1 columns, and the second bit matrix in row 0 and column 0, the second bit matrix in row 0 and column 1, the second bit matrix in row 0 and column 4, the second bit matrix in row 0 and column 5, the second bit matrix in row 1 and column 0, the second bit matrix in row 1 and column 1, the second bit matrix in row 1 and column 4, and the second bit matrix in row 1 and column 5 are from the sixth bit set.

[0559] In some possible implementations, the first cache subset includes a total of 336 cache units in columns 0, 1, 4, and 5 of the interleaved cache, and the second cache subset includes a total of 336 cache units in columns 2, 3, 6, and 7 of the interleaved cache.

[0560] In a fourth aspect, an embodiment of the present application provides a data processing device, comprising: a PCS unit, an FEC encoding unit, and a first interleaving unit. The PCS unit is configured to perform PCS processing on a first bit set of k bits to obtain a second bit set, where k is an integer greater than 1. The FEC unit is configured to perform FEC encoding on the second bit set and a third bit set of the k bits, excluding the first bit set, to obtain a fourth bit set, the fourth bit set comprising m0 first bit subsets, each first bit subset comprising F0 bits, m0 being an integer greater than 1, and F0 being an even number greater than 1. The first interleaving unit is configured to perform a first interleaving process on the fourth bit set to obtain a fifth bit set, the fifth bit set comprising m0 second bit subsets, each second bit subset comprising F0 bits, F0 / 2 bits of each second bit subset being from the second bit set, and the remaining F0 / 2 bits of each second bit subset being from the third bit set and / or parity bits of the FEC encoding.

[0561] In some possible embodiments, the F0 bits in each of the second bit subsets are distributed as F1 rows and F1 columns, F1 / 2 bits of the F1 bits in each row of the second bit subset come from the second bit set, the second bit set includes m0×F0 / 2 bits, and the other F1 / 2 bits of the F1 bits in each row of the second bit subset come from the third bit set and / or the check bits of the FEC code.

[0562] In some possible implementations, F0=256, F1=16, and in the second bit subset, the first bit in the i2th row is The bits of the column come from the second bit set, 0≤i2<16, 0≤j2<8. Alternatively, the bits of the i2th row and (j2×2-i2%2+1)th column in the second bit subset come from the second bit set, 0≤i2<16, 0≤j2<8. means rounding a down to the nearest integer, and b%c means taking the modulus of b to c.

[0563] In some possible implementations, F0=256, m1 of the first bit subsets in the fourth bit set, totaling m1×256 bits, come from the second bit set, and m0=m1×2.

[0564] In some possible implementations, F0=256, the m0×256 bits in the fourth bit set are distributed as 32 rows and m0×8 columns, the m0×256 bits in the fifth bit set are distributed as 32 rows and m0×8 columns, the m0×8 bits in the r1-th row of the fifth bit set come from the m0×8 bits in the r0-th row of the fourth bit set, where 0≤r0<32, 0≤r1<32.

[0565] In some possible implementations, the m0 first bit subsets are distributed into 2 rows and m1 columns, wherein the first bit subset in the 0th row and the m2th column is and the first bit subset of row 1, column m2 From the second bit set, 0≤m2<m1 / 2.

[0566] In some possible implementations, the first bit of the m0×8 bits in the r1th row of the fifth bit set is bits are from the 0th bit to the (m0×4-1)th bit in the r0th row of the fourth bit set, where means rounding a down to the nearest integer, and b%c means taking the modulus of b to c.

[0567] In some possible implementations, the c1th bit in the m0×8 bits in the r1th row in the fifth bit set comes from the c0th bit in the m0×8 bits in the r0th row in the fourth bit set;

[0568] Among them, 0≤c0<(m0×8), 0≤c1<(m0×8), θ is an integer multiple of 4, and m0×8 is divisible by θ, Δ is an integer, and β is an integer multiple of 4.

[0569] In some possible implementations, the c1th bit in the m0×8 bits in the r1th row in the fifth bit set comes from the c0th bit in the m0×8 bits in the r0th row in the fourth bit set;

[0570] Among them, 0≤c0<(m0×8), 0≤c1<(m0×8), θ is an integer multiple of 4, and m0×8 is divisible by θ, Δ is an integer, and β is an integer multiple of 4.

[0571] In some possible implementations, the c1th bit in the m0×8 bits in the r1th row in the fifth bit set comes from the c0th bit in the m0×8 bits in the r0th row in the fourth bit set;

[0572] Among them, 0≤c0<(m0×8), 0≤c1<(m0×8), θ is an integer multiple of 4, and m0×8 is divisible by θ, Δ is an integer, and β is an integer multiple of 4.

[0573] In some possible implementations, the c1th bit in the m0×8 bits in the r1th row in the fifth bit set comes from the c0th bit in the m0×8 bits in the r0th row in the fourth bit set;

[0574] Among them, 0≤c0<(m0×8), 0≤c1<(m0×8), θ is an integer multiple of 4, and m0×8 is divisible by θ, Δ is an integer, and β is an integer multiple of 4.

[0575] In some possible implementations, the first bit of the m0×8 bits in the r1th row of the fifth bit set is bits are from the 0th bit to the (m0×4-1)th bit in the r0th row of the fourth bit set, where

[0576] In some possible implementations, the c1th bit in the m0×8 bits in the r1th row in the fifth bit set comes from the c0th bit in the m0×8 bits in the r0th row in the fourth bit set;

[0577] Among them, 0≤c0<(m0×8), 0≤c1<(m0×8), θ is an integer multiple of 4, and m0×8 is divisible by θ, Δ is an integer, and β is an integer multiple of 2.

[0578] In some possible implementations, the c1th bit in the m0×8 bits in the r1th row in the fifth bit set comes from the c0th bit in the m0×8 bits in the r0th row in the fourth bit set;

[0579] Among them, 0≤c0<(m0×8), 0≤c1<(m0×8), θ is an integer multiple of 4, and m0×8 is divisible by θ, Δ is an integer, and β is an integer multiple of 2.

[0580] In some possible implementations, the c1th bit in the m0×8 bits in the r1th row in the fifth bit set comes from the c0th bit in the m0×8 bits in the r0th row in the fourth bit set;

[0581] Among them, 0≤c0<(m0×8), 0≤c1<(m0×8), θ is an integer multiple of 4, and m0×8 is divisible by θ, Δ is an integer, and β is an integer multiple of 2.

[0582] In some possible implementations, the c1th bit in the m0×8 bits in the r1th row in the fifth bit set comes from the c0th bit in the m0×8 bits in the r0th row in the fourth bit set;

[0583] Among them, 0≤c0<(m0×8), 0≤c1<(m0×8), θ is an integer multiple of 4, and m0×8 is divisible by θ, Δ is an integer, and β is an integer multiple of 2.

[0584] In some possible implementations, the data processing apparatus further includes a pre-coding interleaving unit. The pre-coding interleaving unit is configured to perform pre-coding interleaving on the second bit set and the third bit set to obtain a sixth bit set, where the number of bits in the sixth bit set is equal to the sum of the number of bits in the second bit set and the number of bits in the third bit set. The sixth bit set includes m3 third bit subsets, the m3 third bit subsets being distributed in 2 rows and m4 columns, where m3 = 2 × m4, and m3 is an integer greater than 1 and less than m0. Each third bit subset in a portion of the third bit subsets includes F0 bits, and each third bit subset in another portion of the third bit subsets includes F2 bits, where F2 is an even number greater than 1 and less than F0. The FEC unit is configured to perform FEC encoding on the sixth bit set to obtain the fourth bit set.

[0585] In some possible embodiments, m3=14, m4=7, F0=256, F2=240, each third bit subset of columns 0 to 5 includes 16 rows and 16 columns of bits, each third bit subset of column 6 includes 16 rows and 15 columns of bits, the bits in the third bit subset of column 0, the third bit subset of column 1, the third bit subset of column 4, and the third bit subset of column 5 are from the second bit set, and the bits in the third bit subset of column 2, the third bit subset of column 3, and the third bit subset of column 6 are from the third bit set.

[0586] In some possible implementations, the m0 first bit subsets are distributed into 2 rows and m1 columns, m0=16, m1=8, and the first bit subset B in row 0 and column 0 is 0,0 , the first bit subset B at row 0 and column 1 0,1 , the first bit subset B at row 0 and column 4 0,4 , the first bit subset B at row 0 and column 5 0,5 , the first bit subset B at row 1, column 0 1,0 , the first bit subset B at row 1 and column 1 1,1 , the first bit subset B at row 1 and column 4 1,4 and the first bit subset B at row 1 and column 5 1,5 From the second set of bits.

[0587] In some possible implementations, the first bit of the 128 bits in the r1th row of the fifth bit set is bits are from one of the bits 0 to 31 or the bits 64 to 95 in the r0th row in the fourth bit set, wherein, means rounding a down to the nearest integer, and b%c means taking the modulus of b to c.

[0588] In some possible implementations, the c1th bit in the 128 bits in the r1th row in the fifth bit set comes from the c0th bit in the 128 bits in the r0th row in the fourth bit set;

[0589] Among them, 0≤c0<128, 0≤c1<128, θ is an integer multiple of 4, and m0×8 is divisible by θ, Δ is an integer, β is an integer multiple of 4,

[0590] In some possible implementations, the c1th bit in the 128 bits in the r1th row in the fifth bit set comes from the c0th bit in the 128 bits in the r0th row in the fourth bit set;

[0591] Among them, 0≤c0<128, 0≤c1<128, θ is an integer multiple of 4, and m0×8 is divisible by θ, Δ is an integer, β is an integer multiple of 4,

[0592] In some possible implementations, the c1th bit in the 128 bits in the r1th row in the fifth bit set comes from the c0th bit in the 128 bits in the r0th row in the fourth bit set;

[0593] Among them, 0≤c0<128, 0≤c1<128, θ is an integer multiple of 4, and m0×8 is divisible by θ, Δ is an integer, β is an integer multiple of 4,

[0594] In some possible implementations, the c1th bit in the 128 bits in the r1th row in the fifth bit set comes from the c0th bit in the 128 bits in the r0th row in the fourth bit set;

[0595] Among them, 0≤c0<128, 0≤c1<128, θ is an integer multiple of 4, and m0×8 is divisible by θ, Δ is an integer, β is an integer multiple of 4,

[0596] In some possible implementations, the first bit in the 128 bits of the r1th row in the fifth bit set is bits are from one of the bits 0 to 31 or the bits 64 to 95 in the r0th row of the fourth bit set, where

[0597] In some possible implementations, the c1th bit in the 128 bits in the r1th row in the fifth bit set comes from the c0th bit in the 128 bits in the r0th row in the fourth bit set;

[0598] Among them, 0≤c0<128, 0≤c1<128, θ is an integer multiple of 4, and m0×8 is divisible by θ, Δ is an integer, and β is an integer multiple of 2.

[0599] In some possible implementations, the c1th bit in the 128 bits in the r1th row in the fifth bit set comes from the c0th bit in the 128 bits in the r0th row in the fourth bit set;

[0600] Among them, 0≤c0<128, 0≤c1<128, θ is an integer multiple of 4, and m0×8 is divisible by θ, Δ is an integer, and β is an integer multiple of 2.

[0601] In some possible implementations, the c1th bit in the 128 bits in the r1th row in the fifth bit set comes from the c0th bit in the 128 bits in the r0th row in the fourth bit set;

[0602] Among them, 0≤c0<128, 0≤c1<128, θ is an integer multiple of 4, and m0×8 is divisible by θ, Δ is an integer, and β is an integer multiple of 2.

[0603] In some possible implementations, the c1th bit in the 128 bits in the r1th row in the fifth bit set comes from the c0th bit in the 128 bits in the r0th row in the fourth bit set;

[0604] Among them, 0≤c0<128, 0≤c1<128, θ is an integer multiple of 4, and m0×8 is divisible by θ, Δ is an integer, and β is an integer multiple of 2.

[0605] In some possible embodiments, m3=14, m4=7, F0=256, F2=240, each third bit subset of columns 0 to 5 includes 16 rows and 16 columns of bits, each third bit subset of column 6 includes 16 rows and 15 columns of bits, F0 / 2 bits of each third bit subset of columns 0 to 3 come from the second bit set, another F0 / 2 bits of each third bit subset of columns 0 to 3 come from the third bit set, F0 bits of each third bit subset of columns 4 to 5 come from the second bit set, and F2 bits of each third bit subset of column 6 come from the third bit set.

[0606] In some possible implementations, the third bit subset of the i0th row and j0th column is the i1th row and j0th column. The bits of the column are from the second bit set. Alternatively, the bits of the third bit subset of the i0th row and j0th column and the (j1×2)th column are from the second bit set. Where 0≤i0<2, 0≤j0<4, 0≤i1<16, 0≤j1<8, means rounding a down to the nearest integer, and b%c means taking the modulus of b to c.

[0607] In some possible embodiments, the m0 first bit subsets are distributed into 2 rows and m1 columns, m0=16, m1=8, F0 / 2 bits in each first bit subset in columns 0 to 3 come from the second bit set, another F0 / 2 bits in each first bit subset in columns 0 to 3 come from the third bit set, F0 bits in each first bit subset in columns 4 to 5 come from the second bit set, and F0 bits in each first bit subset in columns 6 to 7 come from the third bit set and / or the check bits of the FEC code.

[0608] In some possible implementations, the first interleaving processing unit is specifically configured to perform a first interleaving process on a first bit subset of columns 4 to 7 in the fourth bit set to obtain a corresponding second bit subset of columns 4 to 7 in the fifth bit set.

[0609] In some possible implementations, the first bit of the 128 bits in the r1th row of the fifth bit set is bits are from one of the 64th to 95th bits in the r0th row of the fourth bit set, wherein, means rounding a down to the nearest integer, and b%c means taking the modulus of b to c.

[0610] In some possible implementations, when 0≤c1<64, the c1th bit in the 128 bits in the r1th row of the fifth bit set comes from the c1th bit in the 128 bits in the r0th row of the fourth bit set; when 64≤c1<128, the c1th bit in the 128 bits in the r1th row of the fifth bit set comes from the c0th bit in the 128 bits in the r0th row of the fourth bit set;

[0611] Among them, 64≤c0<128, 64≤c1<128, θ is an integer multiple of 4, and m0×4 is divisible by θ, Δ is an integer, and β is an integer multiple of 4.

[0612] or,

[0613] When 0≤c1<64, the c1th bit in the 128 bits in the r1th row of the fifth bit set comes from the c1th bit in the 128 bits in the r0th row of the fourth bit set; when 64≤c1<128, the c1th bit in the 128 bits in the r1th row of the fifth bit set comes from the c0th bit in the 128 bits in the r0th row of the fourth bit set;

[0614] Among them, 64≤c0<128, 64≤c1<128, θ is an integer multiple of 4, and m0×4 is divisible by θ, Δ is an integer, and β is an integer multiple of 4.

[0615] or,

[0616] When 0≤c1<64, the c1th bit in the 128 bits in the r1th row of the fifth bit set comes from the c1th bit in the 128 bits in the r0th row of the fourth bit set; when 64≤c1<128, the c1th bit in the 128 bits in the r1th row of the fifth bit set comes from the c0th bit in the 128 bits in the r0th row of the fourth bit set;

[0617] Among them, 64≤c0<128, 64≤c1<128, θ is an integer multiple of 4, and m0×4 is divisible by θ, Δ is an integer, and β is an integer multiple of 4.

[0618] or,

[0619] When 0≤c1<64, the c1th bit in the 128 bits in the r1th row of the fifth bit set comes from the c1th bit in the 128 bits in the r0th row of the fourth bit set; when 64≤c1<128, the c1th bit in the 128 bits in the r1th row of the fifth bit set comes from the c0th bit in the 128 bits in the r0th row of the fourth bit set;

[0620] Among them, 64≤c0<128, 64≤c1<128, θ is an integer multiple of 4, and m0×4 is divisible by θ, Δ is an integer, and β is an integer multiple of 4.

[0621] In some possible implementations, m3=14, m4=7, F0=256, F2=240, each third bit subset of columns 0 to 5 includes 16 rows and 16 columns of bits, each third bit subset of column 6 includes 16 rows and 15 columns of bits, F0 / 2 bits of each third bit subset of columns 0 to 4 come from the second bit set, another F0 / 2 bits of each third bit subset of columns 0 to 4 come from the third bit set, and the third bit subset I of row 0 and column 5 is 16 rows and 15 columns of bits. 0,5 , the third bit subset I of row 1 and column 5 1,5 , the third bit subset I of row 0 and column 6 0,6 The bits in columns 0 to 7 and the third bit subset I in row 1 and column 6 1,6 The bits in columns 0 to 7 are from the second bit set, and the bits in row 0 and column 6 are from the third bit subset I 0,6 The bits in columns 8 to 14 and the third bit subset I in row 1 and column 6 1,6 The bits in columns 8 to 14 in are from the third bit set.

[0622] In some possible implementations, the third bit subset of the i0th row and j0th column is the i1th row and j0th column. The bits of the column are from the second set of bits;

[0623] Alternatively, the bits in the i1th row and the (j1×2)th column of the third bit subset in the i0th row and the j0th column are from the second bit set;

[0624] Among them, 0≤i0<2, 0≤j0<5, 0≤i1<16, 0≤j1<8, means rounding a down to the nearest integer, and b%c means taking the modulus of b to c.

[0625] In some possible implementations, the m0 first bit subsets are distributed into 2 rows and m1 columns, m0=16, m1=8, F0 / 2 bits in each first bit subset in columns 0 to 4 come from the second bit set, and the other F0 / 2 bits in each first bit subset in columns 0 to 4 come from the third bit set. First bit subset B in row 0 and column 5 0,5 , the first bit subset B in row 1 and column 5 1,5 , the first bit subset B at row 0 and column 6 0,6 The 8×8 bits in rows 0 to 7 and columns 0 to 7, the first bit subset B in row 0 and column 6 0,6 The 8×8 bits in rows 8 to 15 and columns 8 to 15, the first bit subset B in row 1 and column 6 1,6 The 8×8 bits in rows 0 to 7 and columns 0 to 7 and the first bit subset B in row 1 and column 6 1,6 The 8×8 bits in rows 8 to 15 and columns 8 to 15 in the first bit subset B are from the second bit set. 0,7 , the first bit subset B at row 1, column 7 1,7 , the first bit subset B at row 0 and column 6 0,6 The 8×8 bits in rows 0 to 7 and columns 8 to 15, the first bit subset B in row 0 and column 6 0,6 The 8×8 bits in rows 8 to 15 and columns 0 to 7, and the first bit subset B in row 1 and column 6 1,6 The 8×8 bits in rows 0 to 7 and columns 8 to 15 and the first bit subset B in row 1 and column 6 1,6 The 8×8 bits in rows 8 to 15 and columns 0 to 7 in the byte data are from the third bit set and / or the parity bits of the FEC code.

[0626] In some possible implementations, the first interleaving processing unit is specifically configured to perform a first interleaving process on a first bit subset of columns 5 to 7 in the fourth bit set to obtain a corresponding second bit subset of columns 5 to 7 in the fifth bit set.

[0627] In some possible implementations, when When the r1th row of the fifth bit set has the 128 bits bits are from the 80th to 103rd bits in the r0th row of the fourth bit set. When the r1th row of the fifth bit set has the 128 bits bits are from one of the 80th to 95th bits and the 104th to 111th bits in the r0th row of the fourth bit set. means rounding a down to the nearest integer, and b%c means taking the modulus of b to c.

[0628] In some possible implementations, when 0≤c1<80, the c1th bit in the 128 bits in the r1th row of the fifth bit set comes from the c1th bit in the 128 bits in the r0th row of the fourth bit set; when 80≤c1<128, the c1th bit in the 128 bits in the r1th row of the fifth bit set comes from the 80+c0th bit in the 128 bits in the r0th row of the fourth bit set;

[0629] Among them, 0≤c0<48, 80≤c1<128, θ is an integer multiple of 4, and 48 is divisible by θ, Δ is an integer, and β is an integer multiple of 4.

[0630] or,

[0631] When 0≤c1<80, the c1th bit in the 128 bits in the r1th row of the fifth bit set comes from the c1th bit in the 128 bits in the r0th row of the fourth bit set; when 80≤c1<128, the c1th bit in the 128 bits in the r1th row of the fifth bit set comes from the 80+c0th bit in the 128 bits in the r0th row of the fourth bit set;

[0632] Where, 0≤c0<48, 80≤c1<128, θ is an integer multiple of 4, and 48 is divisible by θ, Δ is an integer, and β is an integer of 4.

[0633] In some possible implementations, m3=14, m4=7, F0=256, and F2=240. Each third bit subset of columns 0 to 5 includes 16 rows and 16 columns of bits, and each third bit subset of column 6 includes 16 rows and 15 columns of bits. F0 / 2 bits in each third bit subset of columns 0 to 4 are from the second bit set, another F0 / 2 bits in each third bit subset of columns 0 to 4 are from the third bit set, 9 bits in each row of each third bit subset of column 5 are from the second bit set, another 7 bits in each row of each third bit subset of column 5 are from the third bit set, and F2 bits in each third bit subset of column 6 are from the second bit set.

[0634] In some possible implementations, the m0 first bit subsets are distributed into 2 rows and m1 columns, where m0 = 16 and m1 = 8. F0 / 2 bits in each first bit subset in columns 0 to 4 come from the second bit set, and another F0 / 2 bits in each first bit subset in columns 0 to 4 come from the third bit set. Nine bits in each row of each first bit subset in column 5 come from the second bit set, and another 7 bits in each row of each first bit subset in column 5 come from the third bit set. The bits in row i1, columns 15-i1 of each first bit subset in column 6 come from the parity bits of the FEC code, and all bits in each first bit subset in column 6, except for the bits in row i1, columns 15-i1, come from the second bit set, where 0≤i1≤15. F0 bits in each first bit subset in column 7 come from the parity bits of the FEC code.

[0635] In some possible implementations, the first interleaving processing unit is specifically configured to: 0,5 The first bit subset B of columns C to 15, row 1, column 5 1,5 The first bit subset B of columns C to 15, row 0, column 6 0,6 , the first bit subset B at row 0 and column 7 0,7 , the first bit subset B in row 1 and column 6 1,6 and the first bit subset B at row 1, column 6 1,6 Perform the first interleaving process to obtain the corresponding second bit subset T at row 0 and column 5 0,5 The second bit subset T of columns C to 15, row 1 and column 5 1,5 The second bit subset T of columns C to 15, row 0 and column 6 0,6 , the second bit subset T at row 0 and column 7 0,7 , the second bit subset T in row 1 and column 6 1,6 and the second bit subset T at row 1, column 6 1,6 . Among them, 0≤C≤15.

[0636] In some possible implementations, r0=r1.

[0637] In some possible implementations, the F0 bits in each of the second bit subsets are distributed into F1 rows and F1 columns, and the F1 bits in each row of the second bit subset come from two of the first bit subsets.

[0638] In some possible embodiments, the F0 bits in each of the first bit subsets are distributed as F1 rows and F1 columns, F1 / 2 bits of the F1 bits in each row of the second bit subset come from one row of one of the first bit subsets, and the other F1 / 2 bits of the F1 bits in each row of the second bit subset come from one row of another first bit subset.

[0639] In some possible implementations, F0=256, the m0×256 bits in the fourth bit set are distributed as 32 rows and m0×8 columns, the m0×256 bits in the fifth bit set are distributed as 32 rows and m0×8 columns, and the 32 bits in each column of the fifth bit set come from 2 of the first bit subsets.

[0640] In some possible embodiments, the 256 bits in each of the first bit subsets are distributed into 16 rows and 16 columns, 16 bits of the 32 bits in each column of the fifth bit set come from one column of one of the first bit subsets, and the other 16 bits of the 32 bits in each column of the fifth bit set come from one column of another first bit subset.

[0641] In some possible embodiments, 16 bits of the 32 bits in each column of the fifth bit set come from the c1%16th column of one of the first bit subsets, and the other 16 bits of the 32 bits in each column of the fifth bit set come from the c1%16th column of another first bit subset, where 0≤c1<(m0×8).

[0642] In some possible implementations, m0=16, and the 16 second bit subsets are distributed into 2 rows and 8 columns;

[0643] The second bit subset T at row 0 and column 0 0,0 and the second bit subset T at row 1, column 0 1,0 A total of 512 bits come from the first bit subset B at row 0 and column 0 0,0 and the first bit subset B at row 0 and column 4 0,4 A total of 512 bits,

[0644] The second bit subset T of row 0 and column 1 0,1 and the second bit subset T at row 1, column 1 1,1 A total of 512 bits come from the first bit subset B in row 1, column 0 1,0 and the first bit subset B at row 1, column 4 1,4 A total of 512 bits,

[0645] The second bit subset T at row 0 and column 2 0,2 and the second bit subset T at row 1, column 21,2 A total of 512 bits come from the first bit subset B at row 0 and column 1 0,1 and the first bit subset B at row 0 and column 5 0,5 A total of 512 bits,

[0646] The second bit subset T of row 0 and column 3 0,3 and the second bit subset T at row 1, column 3 1,3 A total of 512 bits come from the first bit subset B in row 1 and column 1 1,1 and the first bit subset B at row 1 and column 5 1,5 A total of 512 bits,

[0647] The second bit subset T of row 0 and column 4 0,4 and the second bit subset T at row 1, column 4 1,4 A total of 512 bits come from the first bit subset B at row 0 and column 2 0,2 and the first bit subset B at row 0 and column 6 0,6 A total of 512 bits,

[0648] The second bit subset T at row 0 and column 5 0,5 and the second bit subset T at row 1, column 5 1,5 A total of 512 bits come from the first bit subset B in row 1, column 2 1,2 and the first bit subset B at row 1, column 6 1,6 A total of 512 bits,

[0649] The second bit subset T at row 0 and column 6 0,6 and the second bit subset T at row 1, column 6 1,6 A total of 512 bits come from the first bit subset B at row 0 and column 3 0,3 and the first bit subset B at row 0 and column 7 0,7 A total of 512 bits,

[0650] The second bit subset T at row 0 and column 7 0,7 and the second bit subset T at row 1, column 7 1,7 A total of 512 bits come from the first bit subset B in row 1, column 3 1,3 and the first bit subset B at row 1, column 7 1,7 A total of 512 bits.

[0651] In some possible implementations, m0=16, and the 16 second bit subsets are distributed into 2 rows and 8 columns;

[0652] The second bit subset T at row 0 and column 0 0,0 and the second bit subset T at row 1, column 01,0 A total of 512 bits come from the first bit subset B at row 0 and column 0 0,0 and the first bit subset B at row 0 and column 4 0,4 A total of 512 bits,

[0653] The second bit subset T of row 0 and column 1 0,1 and the second bit subset T at row 1, column 1 1,1 A total of 512 bits come from the first bit subset B at row 0 and column 1 0,1 and the first bit subset B at row 0 and column 5 0,5 A total of 512 bits,

[0654] The second bit subset T at row 0 and column 2 0,2 and the second bit subset T at row 1, column 2 1,2 A total of 512 bits come from the first bit subset B at row 0 and column 2 0,2 and the first bit subset B at row 0 and column 6 0,6 A total of 512 bits,

[0655] The second bit subset T of row 0 and column 3 0,3 and the second bit subset T at row 1, column 3 1,3 A total of 512 bits come from the first bit subset B at row 0 and column 3 0,3 and the first bit subset B at row 0 and column 7 0,7 A total of 512 bits,

[0656] The second bit subset T of row 0 and column 4 0,4 and the second bit subset T at row 1, column 4 1,4 A total of 512 bits come from the first bit subset B in row 1, column 0 1,0 and the first bit subset B at row 1, column 4 1,4 A total of 512 bits,

[0657] The second bit subset T at row 0 and column 5 0,5 and the second bit subset T at row 1, column 5 1,5 A total of 512 bits come from the first bit subset B in row 1 and column 1 1,1 and the first bit subset B at row 1 and column 5 1,5 A total of 512 bits,

[0658] The second bit subset T at row 0 and column 6 0,6 and the second bit subset T at row 1, column 6 1,6 A total of 512 bits come from the first bit subset B in row 1, column 2 1,2 and the first bit subset B at row 1, column 61,6 A total of 512 bits,

[0659] The second bit subset T at row 0 and column 7 0,7 and the second bit subset T at row 1, column 7 1,7 A total of 512 bits come from the first bit subset B in row 1, column 3 1,3 and the first bit subset B at row 1, column 7 1,7 A total of 512 bits.

[0660] In some possible implementations, m0=16, and the 16 second bit subsets are distributed into 2 rows and 8 columns;

[0661] The second bit subset T at row 0 and column 0 0,0 and the second bit subset T at row 0 and column 1 0,1 A total of 512 bits come from the first bit subset B at row 0 and column 0 0,0 and the first bit subset B at row 0 and column 4 0,4 A total of 512 bits,

[0662] The second bit subset T at row 0 and column 2 0,2 and the second bit subset T at row 0 and column 3 0,3 A total of 512 bits come from the first bit subset B at row 0 and column 1 0,1 and the first bit subset B at row 0 and column 5 0,5 A total of 512 bits,

[0663] The second bit subset T of row 0 and column 4 0,4 and the second bit subset T at row 0 and column 5 0,5 A total of 512 bits come from the first bit subset B at row 0 and column 2 0,2 and the first bit subset B at row 0 and column 6 0,6 A total of 512 bits,

[0664] The second bit subset T at row 0 and column 6 0,6 and the second bit subset T at row 0 and column 7 0,7 A total of 512 bits come from the first bit subset B at row 0 and column 3 0,3 and the first bit subset B at row 0 and column 7 0,7 A total of 512 bits,

[0665] The second bit subset T of row 1 and column 0 1,0 and the second bit subset T at row 1, column 1 1,1 A total of 512 bits come from the first bit subset B in row 1, column 0 1,0 and the first bit subset B at row 1, column 41,4 A total of 512 bits,

[0666] The second bit subset T of row 1 and column 2 1,2 and the second bit subset T at row 1, column 3 1,3 A total of 512 bits come from the first bit subset B in row 1 and column 1 1,1 and the first bit subset B at row 1 and column 5 1,5 A total of 512 bits,

[0667] The second bit subset T of row 1 and column 4 1,4 and the second bit subset T at row 1, column 5 1,5 A total of 512 bits come from the first bit subset B in row 1, column 2 1,2 and the first bit subset B at row 1, column 6 1,6 A total of 512 bits,

[0668] The second bit subset T of row 1 and column 6 1,6 and the second bit subset T at row 1, column 7 1,7 A total of 512 bits come from the first bit subset B in row 1, column 3 1,3 and the first bit subset B at row 1, column 7 1,7 A total of 512 bits.

[0669] In some possible implementations, the 16 second bit subsets are distributed into 2 rows and 8 columns;

[0670] The second bit subset T at row 0 and column 0 0,0 and the second bit subset T at row 1, column 0 1,0 A total of 512 bits come from the first bit subset B at row 0 and column 0 0,0 and the first bit subset B at row 0 and column 2 0,2 A total of 512 bits,

[0671] The second bit subset T of row 0 and column 1 0,1 and the second bit subset T at row 1, column 1 1,1 A total of 512 bits come from the first bit subset B in row 1, column 0 1,0 and the first bit subset B at row 1, column 2 1,2 A total of 512 bits,

[0672] The second bit subset T at row 0 and column 2 0,2 and the second bit subset T at row 1, column 2 1,2 A total of 512 bits come from the first bit subset B at row 0 and column 1 0,1 and the first bit subset B at row 0 and column 3 0,3A total of 512 bits,

[0673] The second bit subset T of row 0 and column 3 0,3 and the second bit subset T at row 1, column 3 1,3 A total of 512 bits come from the first bit subset B in row 1 and column 1 1,1 and the first bit subset B at row 1, column 3 1,3 A total of 512 bits,

[0674] The second bit subset T of row 0 and column 4 0,4 and the second bit subset T at row 1, column 4 1,4 A total of 512 bits come from the first bit subset B at row 0 and column 4 0,4 and the first bit subset B at row 0 and column 6 0,6 A total of 512 bits,

[0675] The second bit subset T at row 0 and column 5 0,5 and the second bit subset T at row 1, column 5 1,5 A total of 512 bits come from the first bit subset B in row 1 and column 4 1,4 and the first bit subset B at row 1, column 6 1,6 A total of 512 bits,

[0676] The second bit subset T at row 0 and column 6 0,6 and the second bit subset T at row 1, column 6 1,6 A total of 512 bits come from the first bit subset B at row 0 and column 5 0,5 and the first bit subset B at row 0 and column 7 0,7 A total of 512 bits,

[0677] The second bit subset T at row 0 and column 7 0,7 and the second bit subset T at row 1, column 7 1,7 A total of 512 bits come from the first bit subset B in row 1 and column 5 1,5 and the first bit subset B at row 1, column 7 1,7 A total of 512 bits.

[0678] In some possible implementations, the 16 second bit subsets are distributed into 2 rows and 8 columns;

[0679] The second bit subset T at row 0 and column 0 0,0 and the second bit subset T at row 1, column 0 1,0 A total of 512 bits come from the first bit subset B at row 0 and column 0 0,0 and the first bit subset B at row 0 and column 2 0,2 A total of 512 bits,

[0680] The second bit subset T of row 0 and column 1 0,1 and the second bit subset T at row 1, column 1 1,1 A total of 512 bits come from the first bit subset B at row 0 and column 1 0,1 and the first bit subset B at row 0 and column 3 0,3 A total of 512 bits,

[0681] The second bit subset T at row 0 and column 2 0,2 and the second bit subset T at row 1, column 2 1,2 A total of 512 bits come from the first bit subset B at row 0 and column 4 0,4 and the first bit subset B at row 0 and column 6 0,6 A total of 512 bits,

[0682] The second bit subset T of row 0 and column 3 0,3 and the second bit subset T at row 1, column 3 1,3 A total of 512 bits come from the first bit subset B at row 0 and column 5 0,5 and the first bit subset B at row 0 and column 7 0,7 A total of 512 bits,

[0683] The second bit subset T of row 0 and column 4 0,4 and the second bit subset T at row 1, column 4 1,4 A total of 512 bits come from the first bit subset B in row 1, column 0 1,0 and the first bit subset B at row 1, column 2 1,2 A total of 512 bits,

[0684] The second bit subset T at row 0 and column 5 0,5 and the second bit subset T at row 1, column 5 1,5 A total of 512 bits come from the first bit subset B in row 1 and column 1 1,1 and the first bit subset B at row 1, column 3 1,3 A total of 512 bits,

[0685] The second bit subset T at row 0 and column 6 0,6 and the second bit subset T at row 1, column 6 1,6 A total of 512 bits come from the first bit subset B in row 1 and column 4 1,4 and the first bit subset B at row 1, column 6 1,6 A total of 512 bits,

[0686] The second bit subset T at row 0 and column 7 0,7 and the second bit subset T at row 1, column 71,7 A total of 512 bits come from the first bit subset B in row 1 and column 5 1,5 and the first bit subset B at row 1, column 7 1,7 A total of 512 bits.

[0687] In some possible implementations, m0=16, and the 16 second bit subsets are distributed into 2 rows and 8 columns;

[0688] The second bit subset T at row 0 and column 0 0,0 and the second bit subset T at row 0 and column 1 0,1 A total of 512 bits come from the first bit subset B at row 0 and column 0 0,0 and the first bit subset B at row 0 and column 2 0,2 A total of 512 bits,

[0689] The second bit subset T at row 0 and column 2 0,2 and the second bit subset T at row 0 and column 3 0,3 A total of 512 bits come from the first bit subset B at row 0 and column 1 0,1 and the first bit subset B at row 0 and column 3 0,3 A total of 512 bits,

[0690] The second bit subset T of row 0 and column 4 0,4 and the second bit subset T at row 0 and column 5 0,5 A total of 512 bits come from the first bit subset B at row 0 and column 4 0,4 and the first bit subset B at row 0 and column 6 0,6 A total of 512 bits,

[0691] The second bit subset T at row 0 and column 6 0,6 and the second bit subset T at row 0 and column 7 0,7 A total of 512 bits come from the first bit subset B at row 0 and column 5 0,5 and the first bit subset B at row 0 and column 7 0,7 A total of 512 bits,

[0692] The second bit subset T of row 1 and column 0 1,0 and the second bit subset T at row 1, column 1 1,1 A total of 512 bits come from the first bit subset B in row 1, column 0 1,0 and the first bit subset B at row 1, column 2 1,2 A total of 512 bits,

[0693] The second bit subset T of row 1 and column 2 1,2 and the second bit subset T at row 1, column 31,3 A total of 512 bits come from the first bit subset B in row 1 and column 1 1,1 and the first bit subset B at row 1, column 3 1,3 A total of 512 bits,

[0694] The second bit subset T of row 1 and column 4 1,4 and the second bit subset T at row 1, column 5 1,5 A total of 512 bits come from the first bit subset B in row 1 and column 4 1,4 and the first bit subset B at row 1, column 6 1,6 A total of 512 bits,

[0695] The second bit subset T of row 1 and column 6 1,6 and the second bit subset T at row 1, column 7 1,7 A total of 512 bits come from the first bit subset B in row 1 and column 5 1,5 and the first bit subset B at row 1, column 7 1,7 A total of 512 bits.

[0696] In some possible implementations, m0=12 or 16.

[0697] In some possible implementations, the data processing device further includes a second interleaving unit, a symbol mapping unit, a polarization division unit, and a DSP framing unit. The second interleaving unit is configured to perform a second interleaving process on every two first bit streams in the L first bit streams to obtain a total of L / 2 second bit streams, each of which includes multiple fifth bit sets, where L is an even number greater than 0. The symbol mapping unit and the polarization division unit are configured to perform symbol mapping and polarization division on the L / 2 second bit streams to obtain a dual-polarization symbol stream, wherein the symbol mapping and polarization division map t bits into one dual-polarization symbol, where t is an integer greater than 0. The DSP framing unit is configured to perform DSP framing on the dual-polarization symbol stream.

[0698] In some possible implementations, the amplitude bits in the dual-polarization symbol come from the second bit set.

[0699] In some possible implementations, t=8, and the dual-polarization symbol is a dual-polarization DP-16QAM symbol.

[0700] In some possible implementations, the DSP framing unit is specifically configured to: perform framing processing on every 172032 dual-polarization DP-16QAM symbols to obtain a DSP superframe, where the superframe includes 175104 dual-polarization symbols.

[0701] In a fifth aspect, an embodiment of the present application provides a data processing device, which includes: a first processing unit, a second processing unit, a scrambling unit, a third processing unit, a PCS unit, and an FEC encoding unit. The first processing unit is used to: obtain first data from a data frame, the first data including r rows and q columns of bits, where r is an integer greater than 0, and q is an integer greater than 0. The second processing unit is used to: perform a cyclic redundancy check CRC on the first data and / or insert padding bits to obtain second data, the second data including d bits for CRC insertion. CRC parity bits and / or d PAD Filling bits, d CRC is an integer greater than or equal to 0, d PAD is an integer greater than or equal to 0. The scrambling unit is used to scramble the second data to obtain third data, and the number of bits of the third data is d scr =r×q+d CP , d CP =d CRC +d PAD The third processing unit is used to obtain k bits of the third data, where k is an integer greater than 1, d scr is an integer multiple of k. The PCS unit is configured to perform PCS processing on a first bit set of the k bits to obtain a second bit set. The FEC unit is configured to perform FEC encoding on the second bit set and a third bit set of the k bits excluding the first bit set to obtain a fourth bit set.

[0702] In some possible implementations, the data processing apparatus further includes a pre-coding interleaving unit configured to perform pre-coding interleaving on the second bit set and the third bit set to obtain a sixth bit set, where the number of bits in the sixth bit set is equal to the sum of the number of bits in the second bit set and the number of bits in the third bit set, the sixth bit set including m3 third bit subsets, the m3 third bit subsets being distributed in 2 rows and m4 columns, where m3=2×m4, m3 being an integer greater than 1 and less than m0, each third bit subset in a portion of the third bit subsets including F0 bits, and each third bit subset in another portion of the third bit subsets including F2 bits, where F2 is an even number greater than 1 and less than F0. The FEC unit is configured to perform FEC encoding on the sixth bit set to obtain the fourth bit set.

[0703] In some possible implementations, the number of bits in the first bit set is an integer multiple of 2, 4, 8, or 16, the second bit set includes 2048 bits, the third bit set includes 1504 bits, and the fourth bit set includes 4096 bits.

[0704] In some possible implementations, d scr It is an integer multiple of 4×k, q=10280.

[0705] In some possible implementations, the redundancy of performing CRC and / or inserting padding bits is (d CRC +d PAD ) / (r×q), (d CRC +d PAD ) / (r×q)≤0.001.

[0706] In some possible implementations, r=79, d CP =328, k=3224;

[0707] Or, r = 83, d CP =32, k=3386;

[0708] Or, r = 83, d CP =536, k=3388;

[0709] Or, r = 87, d CP =72, k=2662;

[0710] Or, r = 87, d CP =744, k=2664;

[0711] Or, r = 87, d CP =3432, k=2672;

[0712] Or, r = 104, d CP =704, k=3184;

[0713] Or, r = 104, d CP =3392, k=3192;

[0714] Or, r = 105, d CP =504, k=3214;

[0715] Or, r = 105, d CP =1176, k=3216;

[0716] Or, r = 109, d CP =40, k=2668;

[0717] Or, r = 109, d CP =880, k=2670;

[0718] Or, r = 110, d CP =176, k=3366;

[0719] Or, r = 110, d CP =848, k=3368;

[0720] Or, r = 110, d CP =3536, k=3376;

[0721] Or, r = 111, d CP =648, k=3398;

[0722] Or, r = 131, d CP =8, k=2672;

[0723] Or, r = 131, d CP =1016, k=2674;

[0724] Or, r = 131, d CP =680, k=3208;

[0725] Or, r = 132, d CP =480, k=3232;

[0726] Or, r = 132, d CP =1320, k=3234;

[0727] Or, r = 137, d CP =320, k=3354;

[0728] Or, r = 137, d CP =1160, k=3356;

[0729] Or, r = 138, d CP =120, k=3378;

[0730] Or, r = 138, d CP =960, k=3380;

[0731] Or, r = 152, d CP =344, k=2658;

[0732] Or, r = 152, d CP =1520, k=2660;

[0733] Or, r = 153, dCP =648, k=2676;

[0734] Or, r = 157, d CP =856, k=3204;

[0735] Or, r = 158, d CP =656, k=3224;

[0736] Or, r = 165, d CP =264, k=3366;

[0737] Or, r = 165, d CP =1272, k=3368;

[0738] Or, r = 166, d CP =64, k=3386;

[0739] Or, r = 166, d CP =1072, k=3388;

[0740] Or, r = 174, d CP =144, k=2662;

[0741] Or, r = 174, d CP =1488, k=2664;

[0742] Or, r = 175, d CP =616, k=2678;

[0743] Or, r = 183, d CP =360, k=3200;

[0744] Or, r = 183, d CP =1536, k=3202;

[0745] Or, r = 184, d CP =664, k=3218;

[0746] Or, r = 184, d CP =1840, k=3220;

[0747] Or, r = 185, d CP =968, k=3236;

[0748] Or, r = 192, d CP =744, k=3358;

[0749] Or, r = 192, d CP=1920, k=3360;

[0750] Or, r = 193, d CP =1048, k=3376;

[0751] Or, r = 194, d CP =176, k=3392;

[0752] Or, r = 194, d CP =1352, k=3394;

[0753] Or, r = 196, d CP =616, k=2666;

[0754] Or, r = 209, d CP =536, k=3198;

[0755] Or, r = 209, d CP =1880, k=3200;

[0756] Or, r = 210, d CP =1008, k=3214;

[0757] Or, r = 211, d CP =136, k=3228;

[0758] Or, r = 211, d CP =1480, k=3230;

[0759] Or, r = 217, d CP =280, k=2656;

[0760] Or, r = 217, d CP =1960, k=2658;

[0761] Or, r = 218, d CP =80, k=2668;

[0762] Or, r = 218, d CP =1760, k=2670;

[0763] Or, r = 219, d CP =1224, k=3352;

[0764] Or, r = 220, d CP =352, k=3366;

[0765] Or, r = 220, d CP =1696, k=3368;

[0766] Or, r = 221, d CP =824, k=3382;

[0767] Or, r = 221, d CP =2168, k=3384;

[0768] Or, r = 222, d CP =1296, k=3398;

[0769] Or, r = 235, d CP =376, k=3196;

[0770] Or, r = 235, d CP =1888, k=3198;

[0771] Or, r = 236, d CP =680, k=3210;

[0772] Or, r = 236, d CP =2192, k=3212;

[0773] Or, r = 237, d CP =984, k=3224;

[0774] Or, r = 238, d CP =1288, k=3238;

[0775] Or, r = 239, d CP =920, k=2660;

[0776] Or, r = 240, d CP =1728, k=2672;

[0777] Or, r = 247, d CP =1000, k=3360;

[0778] Or, r = 247, d CP =2512, k=3362;

[0779] Or, r = 248, d CP =1304, k=3374;

[0780] Or, r = 249, d CP =96, k=3386;

[0781] Or, r = 249, d CP =1608, k=3388;

[0782] Or, r = 250, d CP =400, k=3400;

[0783] Or, r = 250, d CP =1912, k=3402;

[0784] Or, r = 261, d CP =216, k=2662;

[0785] Or, r = 261, d CP =2232, k=2664;

[0786] Or, r = 261, d CP =1560, k=3196;

[0787] Or, r = 262, d CP =16, k=2672;

[0788] Or, r = 262, d CP =2032, k=2674;

[0789] Or, r = 262, d CP =1360, k=3208;

[0790] Or, r = 263, d CP =1160, k=3220;

[0791] Or, r = 264, d CP =960, k=3232;

[0792] Or, r = 264, d CP =2640, k=3234;

[0793] Or, r = 274, d CP =640, k=3354;

[0794] Or, r = 274, d CP =2320, k=3356;

[0795] Or, r = 275, d CP =440, k=3366;

[0796] Or, r = 275, d CP =2120, k=3368;

[0797] Or, r = 276, d CP =240, k=3378;

[0798] Or, r = 276, d CP =1920, k=3380;

[0799] Or, r = 277, d CP =40, k=3390;

[0800] Or, r = 277, d CP =1720, k=3392;

[0801] Or, r = 283, d CP =2032, k=2666;

[0802] Or, r = 284, d CP =488, k=2674;

[0803] Or, r = 284, d CP =2672, k=2676;

[0804] Or, r = 287, d CP =896, k=3194;

[0805] Or, r = 287, d CP =2744, k=3196;

[0806] Or, r = 288, d CP =1704, k=3206;

[0807] Or, r = 289, d CP =664, k=3216;

[0808] Or, r = 289, d CP =2512, k=3218;

[0809] Or, r = 290, d CP =1472, k=3228;

[0810] Or, r = 291, d CP =432, k=3238;

[0811] Or, r = 291, d CP =2280, k=3240;

[0812] Or, r = 302, d CP =80, k=3360;

[0813] Or, r = 302, d CP =1928, k=3362;

[0814] Or, r = 303, dCP =888, k=3372;

[0815] Or, r = 303, d CP =2736, k=3374;

[0816] Or, r = 304, d CP =688, k=2658;

[0817] Or, r = 304, d CP =3040, k=2660;

[0818] Or, r = 304, d CP =1696, k=3384;

[0819] Or, r = 305, d CP =2168, k=2668;

[0820] Or, r = 305, d CP =656, k=3394;

[0821] Or, r = 305, d CP =2504, k=3396;

[0822] Or, r = 306, d CP =1296, k=2676;

[0823] Or, r = 313, d CP =1912, k=3194;

[0824] Or, r = 314, d CP =1712, k=3204;

[0825] Or, r = 315, d CP =1512, k=3214;

[0826] Or, r = 316, d CP =1312, k=3224;

[0827] Or, r = 317, d CP =1112, k=3234;

[0828] Or, r = 317, d CP =3128, k=3236;

[0829] Or, r = 326, d CP =320, k=2660;

[0830] Or, r = 326, d CP=2840, k=2662;

[0831] Or, r = 327, d CP =120, k=2668;

[0832] Or, r = 327, d CP =2640, k=2670;

[0833] Or, r = 328, d CP =2440, k=2678;

[0834] Or, r = 329, d CP =728, k=3356;

[0835] Or, r = 329, d CP =2744, k=3358;

[0836] Or, r = 330, d CP =528, k=3366;

[0837] Or, r = 330, d CP =2544, k=3368;

[0838] Or, r = 331, d CP =328, k=3376;

[0839] Or, r = 331, d CP =2344, k=3378;

[0840] Or, r = 332, d CP =128, k=3386;

[0841] Or, r = 332, d CP =2144, k=3388;

[0842] Or, r = 333, d CP =1944, k=3398;

[0843] Or, r = 339, d CP =744, k=3192;

[0844] Or, r = 339, d CP =2928, k=3194;

[0845] Or, r = 340, d CP =1384, k=3202;

[0846] Or, r = 341, d CP =2024, k=3212;

[0847] Or, r = 342, d CP =480, k=3220;

[0848] Or, r = 342, d CP =2664, k=3222;

[0849] Or, r = 343, d CP =1120, k=3230;

[0850] Or, r = 343, d CP =3304, k=3232;

[0851] Or, r = 344, d CP =1760, k=3240;

[0852] Or, r = 348, d CP =288, k=2662;

[0853] Or, r = 348, d CP =2976, k=2664;

[0854] Or, r = 349, d CP =760, k=2670;

[0855] Or, r = 349, d CP =3448, k=2672;

[0856] Or, r = 350, d CP =1232, k=2678;

[0857] Or, r = 356, d CP =704, k=3352;

[0858] Or, r = 356, d CP =2888, k=3354;

[0859] Or, r = 357, d CP =1344, k=3362;

[0860] Or, r = 357, d CP =3528, k=3364;

[0861] Or, r = 358, d CP =1984, k=3372;

[0862] Or, r = 359, d CP =440, k=3380;

[0863] Or, r = 359, d CP =2624, k=3382;

[0864] Or, r = 360, d CP =1080, k=3390;

[0865] Or, r = 360, d CP =3264, k=3392;

[0866] Or, r = 361, d CP =1720, k=3400;

[0867] Or, r = 365, d CP =1592, k=3192;

[0868] Or, r = 366, d CP =720, k=3200;

[0869] Or, r = 366, d CP =3072, k=3202;

[0870] Or, r = 367, d CP =2200, k=3210;

[0871] Or, r = 368, d CP =1328, k=3218;

[0872] Or, r = 368, d CP =3680, k=3220;

[0873] Or, r = 369, d CP =2304, k=2658;

[0874] Or, r = 369, d CP =456, k=3226;

[0875] Or, r = 369, d CP =2808, k=3228;

[0876] Or, r = 370, d CP =592, k=2664;

[0877] Or, r = 370, d CP =3448, k=2666;

[0878] Or, r = 370, d CP =1936, k=3236;

[0879] Or, r = 371, d CP =1736, k=2672;

[0880] Or, r = 384, d CP =1488, k=3358;

[0881] Or, r = 384, d CP =3840, k=3360;

[0882] Or, r = 385, d CP =616, k=3366;

[0883] Or, r = 385, d CP =2968, k=3368;

[0884] Or, r = 386, d CP =2096, k=3376;

[0885] Or, r = 387, d CP =1224, k=3384;

[0886] Or, r = 387, d CP =3576, k=3386;

[0887] Or, r = 388, d CP =352, k=3392;

[0888] Or, r = 388, d CP =2704, k=3394;

[0889] Or, r = 389, d CP =1832, k=3402;

[0890] Or, r = 391, d CP =2440, k=2660;

[0891] Or, r = 392, d CP =1232, k=2666;

[0892] Or, r = 392, d CP =2240, k=3200;

[0893] Or, r = 393, d CP =24, k=2672;

[0894] Or, r = 393, d CP =3048, k=2674;

[0895] Or, r = 393, dCP =2040, k=3208;

[0896] Or, r = 394, d CP =1840, k=3216;

[0897] Or, r = 395, d CP =1640, k=3224;

[0898] Or, r = 396, d CP =1440, k=3232;

[0899] Or, r = 396, d CP =3960, k=3234;

[0900] Or, r = 397, d CP =1240, k=3240;

[0901] Or, r = 397, d CP =3760, k=3242;

[0902] Or, r = 411, d CP =960, k=3354;

[0903] Or, r = 411, d CP =3480, k=3356;

[0904] Or, r = 412, d CP =760, k=3362;

[0905] Or, r = 412, d CP =3280, k=3364;

[0906] Or, r = 413, d CP =2912, k=2662;

[0907] Or, r = 413, d CP =560, k=3370;

[0908] Or, r = 413, d CP =3080, k=3372;

[0909] Or, r = 414, d CP =2208, k=2668;

[0910] Or, r = 414, d CP =360, k=3378;

[0911] Or, r = 414, d CP=2880, k=3380;

[0912] Or, r = 415, d CP =1504, k=2674;

[0913] Or, r = 415, d CP =160, k=3386;

[0914] Or, r = 415, d CP =2680, k=3388;

[0915] Or, r = 416, d CP =2480, k=3396;

[0916] Or, r = 418, d CP =1072, k=3198;

[0917] Or, r = 418, d CP =3760, k=3200;

[0918] Or, r = 419, d CP =1544, k=3206;

[0919] Or, r = 419, d CP =4232, k=3208;

[0920] Or, r = 420, d CP =2016, k=3214;

[0921] Or, r = 421, d CP =2488, k=3222;

[0922] Or, r = 422, d CP =272, k=3228;

[0923] Or, r = 422, d CP =2960, k=3230;

[0924] Or, r = 423, d CP =744, k=3236;

[0925] Or, r = 423, d CP =3432, k=3238;

[0926] Or, r = 434, d CP =560, k=2656;

[0927] Or, r = 434, d CP =3920, k=2658;

[0928] Or, r = 435, d CP =360, k=2662;

[0929] Or, r = 435, d CP =3720, k=2664;

[0930] Or, r = 436, d CP =160, k=2668;

[0931] Or, r = 436, d CP =3520, k=2670;

[0932] Or, r = 437, d CP =3320, k=2676;

[0933] Or, r = 438, d CP =2448, k=3352;

[0934] Or, r = 439, d CP =232, k=3358;

[0935] Or, r = 439, d CP =2920, k=3360;

[0936] Or, r = 440, d CP =704, k=3366;

[0937] Or, r = 440, d CP =3392, k=3368;

[0938] Or, r = 441, d CP =1176, k=3374;

[0939] Or, r = 441, d CP =3864, k=3376;

[0940] Or, r = 442, d CP =1648, k=3382;

[0941] Or, r = 442, d CP =4336, k=3384;

[0942] Or, r = 443, d CP =2120, k=3390;

[0943] Or, r = 444, d CP =2424, k=3198;

[0944] Or, r = 444, d CP =2592, k=3398;

[0945] Or, r = 445, d CP =712, k=3204;

[0946] Or, r = 445, d CP =3568, k=3206;

[0947] Or, r = 446, d CP =1856, k=3212;

[0948] Or, r = 447, d CP =144, k=3218;

[0949] Or, r = 447, d CP =3000, k=3220;

[0950] Or, r = 448, d CP =1288, k=3226;

[0951] Or, r = 448, d CP =4144, k=3228;

[0952] Or, r = 449, d CP =2432, k=3234;

[0953] Or, r = 456, d CP =1032, k=2658;

[0954] Or, r = 456, d CP =4560, k=2660;

[0955] Or, r = 457, d CP =1336, k=2664;

[0956] Or, r = 458, d CP =1640, k=2670;

[0957] Or, r = 459, d CP =1944, k=2676;

[0958] Or, r = 466, d CP =1888, k=3356;

[0959] Or, r = 466, d CP =4744, k=3358;

[0960] Or, r = 467, d CP =176, k=3362;

[0961] Or, r = 467, d CP =3032, k=3364;

[0962] Or, r = 468, d CP =1320, k=3370;

[0963] Or, r = 468, d CP =4176, k=3372;

[0964] Or, r = 469, d CP =2464, k=3378;

[0965] Or, r = 470, d CP =752, k=3196;

[0966] Or, r = 470, d CP =3776, k=3198;

[0967] Or, r = 470, d CP =752, k=3384;

[0968] Or, r = 470, d CP =3608, k=3386;

[0969] Or, r = 471, d CP =2568, k=3204;

[0970] Or, r = 471, d CP =1896, k=3392;

[0971] Or, r = 471, d CP =4752, k=3394;

[0972] Or, r = 472, d CP =1360, k=3210;

[0973] Or, r = 472, d CP =4384, k=3212;

[0974] Or, r = 472, d CP =184, k=3398;

[0975] Or, r = 472, d CP =3040, k=3400;

[0976] Or, r = 473, dCP =152, k=3216;

[0977] Or, r = 473, d CP =3176, k=3218;

[0978] Or, r = 474, d CP =1968, k=3224;

[0979] Or, r = 475, d CP =760, k=3230;

[0980] Or, r = 475, d CP =3784, k=3232;

[0981] Or, r = 476, d CP =2576, k=3238;

[0982] Or, r = 478, d CP =1840, k=2660;

[0983] Or, r = 479, d CP =2648, k=2666;

[0984] Or, r = 480, d CP =3456, k=2672;

[0985] Or, r = 481, d CP =568, k=2676;

[0986] Or, r = 481, d CP =4264, k=2678;

[0987] Or, r = 493, d CP =184, k=3352;

[0988] Or, r = 493, d CP =3208, k=3354;

[0989] Or, r = 494, d CP =2000, k=3360;

[0990] Or, r = 494, d CP =5024, k=3362;

[0991] Or, r = 495, d CP =792, k=3366;

[0992] Or, r = 495, d CP=3816, k=3368;

[0993] Or, r = 496, d CP =1936, k=3196;

[0994] Or, r = 496, d CP =2608, k=3374;

[0995] Or, r = 497, d CP =1232, k=3202;

[0996] Or, r = 497, d CP =4424, k=3204;

[0997] Or, r = 497, d CP =1400, k=3380;

[0998] Or, r = 497, d CP =4424, k=3382;

[0999] Or, r = 498, d CP =528, k=3208;

[1000] Or, r = 498, d CP =3720, k=3210;

[1001] Or, r = 498, d CP =192, k=3386;

[1002] Or, r = 498, d CP =3216, k=3388;

[1003] Or, r = 499, d CP =1672, k=2656;

[1004] Or, r = 499, d CP =3016, k=3216;

[1005] Or, r = 499, d CP =2008, k=3394;

[1006] Or, r = 499, d CP =5032, k=3396;

[1007] Or, r = 500, d CP =2984, k=2662;

[1008] Or, r = 500, d CP=2312, k=3222;

[1009] Or, r = 500, d CP =800, k=3400;

[1010] Or, r = 500, d CP =3824, k=3402;

[1011] Or, r = 501, d CP =432, k=2666;

[1012] Or, r = 501, d CP =4296, k=2668;

[1013] Or, r = 501, d CP =1608, k=3228;

[1014] Or, r = 501, d CP =4800, k=3230;

[1015] Or, r = 502, d CP =1744, k=2672;

[1016] Or, r = 502, d CP =904, k=3234;

[1017] Or, r = 502, d CP =4096, k=3236;

[1018] Or, r = 503, d CP =3056, k=2678.

[1019] In some possible implementations, d scr =336×k.

[1020] In some possible implementations, the second data processing unit is specifically configured to: perform CRC-32 check on a total of r×q / p bits in each r / p rows of the first data to add a check bit with a length of 32 bits, d CRC =32×p, r is divisible by p, and p is an integer greater than 1. Alternatively, for the first r in the first data F0 ×(p-1) rows of each r F0 Rows total q×r F0 The CRC-32 check is performed on the first data to add a check bit with a length of 32 bits, and the last r F1 Rows total q×r F1 bits to perform CRC-32 check to add a check bit with a length of 32 bits, where dCRC =32×p, r cannot be divided by p, p is an integer greater than 1, r F0 ×(p-1)+r F1 =r, r F0 >r F1 , Indicates that a is rounded down.

[1021] In some possible implementations, q×r F0 =41120.

[1022] In some possible implementations, q=2056.

[1023] In some possible implementations, the second data processing unit is specifically configured to: process the first r F0 ×(p-1) rows of each r F0 Rows total q×r F0 The CRC-32 check is performed on the first data to add a check bit with a length of 32 bits, and the last r F1 Rows total q×r F1 CRC-32 check is performed on the bits to add a check bit with a length of 32 bits. CRC =32×p, r cannot be divided by p, p is an integer greater than 1, r F0 ×(p-1)+r F1 =r, integer r F0 Greater than an integer r F1 , Indicates that a is rounded down.

[1024] In some possible implementations, r=435.

[1025] In some possible implementations, p=22, r F0 =20, r F1 =15, the second data processing unit is specifically used to: perform a CRC-32 check on each 20 lines of the first 420 lines of the first data, totaling 41,120 bits, to add a check bit with a length of 32 bits, and perform a CRC-32 check on the last 15 lines of the first data, totaling 30,840 bits, to add a check bit with a length of 32 bits.

[1026] In some possible implementations, d CP =3432, k=2672, or, d CP =744, k=2664.

[1027] In some possible implementations, r=546, d CP =1008, k=3344;

[1028] Or, r = 546, d CP =3696, k=3352;

[1029] Or, r = 547, d CP =1640, k=3352;

[1030] Or, r = 547, d CP =4328, k=3360;

[1031] Or, r = 548, d CP =2272, k=3360;

[1032] Or, r = 548, d CP =4960, k=3368;

[1033] Or, r = 549, d CP =216, k=3360;

[1034] Or, r = 549, d CP =2904, k=3368;

[1035] Or, r = 549, d CP =5592, k=3376;

[1036] Or, r = 550, d CP =848, k=3368;

[1037] Or, r = 550, d CP =3536, k=3376;

[1038] Or, r = 551, d CP =1480, k=3376;

[1039] Or, r = 551, d CP =4168, k=3384;

[1040] Or, r = 552, d CP =2112, k=3384;

[1041] Or, r = 552, d CP =4800, k=3392;

[1042] Or, r = 553, d CP =56, k=3384;

[1043] Or, r = 553, d CP =2744, k=3392;

[1044] Or, r = 553, d CP =5432, k=3400;

[1045] Or, r = 554, d CP =688, k=3392;

[1046] Or, r = 554, d CP =3376, k=3400;

[1047] Or, r = 555, d CP =1320, k=3400;

[1048] Or, r = 555, d CP =4008, k=3408;

[1049] Or, r = 556, d CP =1952, k=3408;

[1050] Or, r = 556, d CP =4640, k=3416;

[1051] Or, r = 557, d CP =2584, k=3416;

[1052] Or, r = 557, d CP =5272, k=3424;

[1053] Or, r = 558, d CP =528, k=3416;

[1054] Or, r = 558, d CP =3216, k=3424;

[1055] Or, r = 559, d CP =1160, k=3424;

[1056] Or, r = 559, d CP =3848, k=3432;

[1057] Or, r = 560, d CP =1792, k=3432;

[1058] Or, r = 560, d CP =4480, k=3440;

[1059] Or, r = 561, d CP =2424, k=3440;

[1060] Or, r = 561, d CP =5112, k=3448;

[1061] Or, r = 562, d CP =368, k=3440;

[1062] Or, r = 562, d CP =3056, k=3448;

[1063] Or, r = 562, d CP =5744, k=3456.

[1064] In some possible implementations, r=520, d CP =704, k=3184;

[1065] Or, r = 520, d CP =3392, k=3192;

[1066] Or, r = 520, d CP =6080, k=3200;

[1067] Or, r = 521, d CP =1336, k=3192;

[1068] Or, r = 521, d CP =4024, k=3200;

[1069] Or, r = 522, d CP =1968, k=3200;

[1070] Or, r = 522, d CP =4656, k=3208;

[1071] Or, r = 523, d CP =2600, k=3208;

[1072] Or, r = 523, d CP =5288, k=3216;

[1073] Or, r = 524, d CP =544, k=3208;

[1074] Or, r = 524, d CP =3232, k=3216;

[1075] Or, r = 525, d CP =1176, k=3216;

[1076] Or, r = 525, d CP =3864, k=3224;

[1077] Or, r = 526, d CP =1808, k=3224;

[1078] Or, r = 526, d CP =4496, k=3232;

[1079] Or, r = 527, d CP =2440, k=3232;

[1080] Or, r = 527, d CP =5128, k=3240;

[1081] Or, r = 528, d CP =384, k=3232;

[1082] Or, r = 528, d CP =3072, k=3240;

[1083] Or, r = 528, d CP =5760, k=3248;

[1084] Or, r = 529, d CP =1016, k=3240;

[1085] Or, r = 529, d CP =3704, k=3248;

[1086] Or, r = 530, d CP =1648, k=3248;

[1087] Or, r = 530, d CP =4336, k=3256;

[1088] Or, r = 531, d CP =2280, k=3256;

[1089] Or, r = 531, d CP =4968, k=3264;

[1090] Or, r = 532, d CP =2912, k=3264;

[1091] Or, r = 532, d CP =224, k=3256;

[1092] Or, r = 533, dCP =856, k=3264;

[1093] Or, r = 533, d CP =3544, k=3272;

[1094] Or, r = 534, d CP =1488, k=3272;

[1095] Or, r = 534, d CP =4176, k=3280;

[1096] Or, r = 535, d CP =2120, k=3280;

[1097] Or, r = 535, d CP =4808, k=3288.

[1098] In some possible implementations, the data processing apparatus further includes a first interleaving unit, a second interleaving unit, a symbol mapping unit, a polarization division unit, and a DSP framing unit. The first interleaving unit is configured to perform a first interleaving process on the fourth bit set to obtain a fifth bit set, the fifth bit set comprising m0 second bit subsets, each second bit subset comprising 256 bits, 128 bits of each second bit subset being from the second bit set, and the remaining 128 bits of each second bit subset being from the third bit set and / or the FEC-encoded parity bits. The second interleaving unit is configured to perform a second interleaving process on every two of the L first bit streams to obtain a total of L / 2 second bit streams, each first bit stream comprising multiple fifth bit sets, where L is an even number greater than 0. The symbol mapping unit and the polarization division unit are configured to perform symbol mapping and polarization division on the L / 2 second bit streams to obtain a dual-polarization symbol stream, wherein the symbol mapping and polarization division map t bits into one dual-polarization symbol, where t is an integer greater than 0. The DSP framing unit is configured to perform DSP framing on the dual-polarization symbol stream.

[1099] In some possible implementations, the amplitude bits in the dual-polarization symbol come from the second bit set.

[1100] In some possible implementations, t=8, and the dual-polarization symbol is a dual-polarization DP-16QAM symbol.

[1101] In some possible implementations, the DSP framing unit is specifically configured to: perform framing processing on every 172032 dual-polarization DP-16QAM symbols to obtain a DSP superframe, where the superframe includes 175104 dual-polarization symbols.

[1102] In some possible implementations, the first processing unit is specifically configured to: obtain F from the data frame Frame The first data to get F Frame ×r×q bits, F Frame Is an integer greater than 0. d scr ×F Frame =336×k×F DSP , where F DSP Indicates the number of DSP superframes, F DSP A DSP superframe consists of F Frame The first data is processed and F DSP An integer greater than 0.

[1103] In some possible embodiments, F DSP >1, the F DSP A plurality of continuous symbols in the first DSP superframe in the DSP superframe is a first identifier, and the F DSP A plurality of consecutive symbols in each DSP superframe in the DSP superframes except the first DSP superframe are the second identifiers.

[1104] In a sixth aspect, an embodiment of the present application provides a data processing device, comprising: a first PCS unit, a first FEC encoding unit, a second PCS unit, a second FEC unit, an interleaving processing unit, a symbol mapping unit, and a polarization division unit. The first PCS unit is configured to perform a first PCS process on a first bit set in a first group of k bits to obtain a second bit set, wherein the second bit set includes m0×128 bits, k is an integer greater than 1, and m0 is an integer greater than 1. The first FEC encoding unit is configured to perform a first forward error correction (FEC) encoding on the second bit set and a third bit set in the first group of k bits other than the first bit set to obtain a fourth bit set, wherein the fourth bit set includes m0 first bit matrices, each of which includes 256 bits distributed in 16 rows and 16 columns. The second PCS unit is configured to perform a second PCS process on a fifth bit set in the second group of k bits to obtain a sixth bit set. The second FEC encoding unit is used to perform second FEC encoding on the sixth bit set and the seventh bit set in the second group of k bits except the fifth bit set to obtain an eighth bit set, where the eighth bit set includes m0 second bit matrixes, and each second bit matrix includes a total of 256 bits distributed in 16 rows and 16 columns. The interleaving processing unit is configured to: input 21 of the fourth bit sets and 21 of the eighth bit sets into an interleaving buffer, wherein the interleaving buffer includes 84×m1 cache units distributed as 84 rows and m1 columns, m0=m1×2, each cache unit is used to cache 16 rows and 16 columns, totaling 256 bits, 42×m1 first bit matrices are input into the even rows of the interleaving buffer, and 42×m1 second bit matrices are input into the odd rows of the interleaving buffer. The interleaving buffer includes a first cache subset and a second cache subset, the first cache subset includes 42×m1 cache units, and the second cache subset includes 42×m1 cache units. The bits input into the first cache subset come from the second bit set and the sixth bit set, and the bits input into the second cache subset come from the third bit set, the seventh bit set, the parity bits of the first FEC code, and the parity bits of the second FEC code. The symbol mapping unit and the polarization division unit are used to perform symbol mapping and polarization division on every 8 bits in the interleaved buffer to obtain a dual-polarization DP-16QAM symbol, wherein 2 amplitude bits of the 4 bits corresponding to the 16QAM symbol of the DP-16QAM symbol in the target polarization direction come from a column of the first cache unit of the first cache subset, and 2 symbol bits of the 4 bits corresponding to the 16QAM symbol of the DP-16QAM symbol in the target polarization direction come from a column of the second cache unit of the second cache subset.

[1105] In some possible implementations, 4 of the 8 bits come from a column of a first cache unit in the first cache subset, and the other 4 of the 8 bits come from a column of a second cache unit in the second cache subset.

[1106] In some possible embodiments, the m0 first bit matrixes are distributed into 2 rows and m1 columns, wherein the first bit matrix in the 0th row and m2th column and the first bit matrix in the 1st row and m2th column are from the second bit set, and the m0 second bit matrixes are distributed into 2 rows and m1 columns, wherein the second bit matrix in the 0th row and m2th column and the second bit matrix in the 1st row and m2th column are from the sixth bit set, 0≤m2<m1 / 2.

[1107] In some possible implementations, m0=16, the first cache subset includes 336 cache cells in columns 0, 1, 2, and 3 of the interleaved cache, and the second cache subset includes 336 cache cells in columns 4, 5, 6, and 7 of the interleaved cache. Alternatively, m0=12, the first cache subset includes 252 cache cells in columns 0, 1, and 2 of the interleaved cache, and the second cache subset includes 252 cache cells in columns 3, 4, and 5 of the interleaved cache.

[1108] In some possible implementations, m0=16, m1=8. The m0 first bit matrices are distributed into 2 rows and m1 columns, and the first bit matrix in row 0 and column 0, the first bit matrix in row 0 and column 1, the first bit matrix in row 0 and column 4, the first bit matrix in row 0 and column 5, the first bit matrix in row 1 and column 0, the first bit matrix in row 1 and column 1, the first bit matrix in row 1 and column 4, and the first bit matrix in row 1 and column 5 are from the second bit set. The m0 second bit matrices are distributed into 2 rows and m1 columns, and the second bit matrix in row 0 and column 0, the second bit matrix in row 0 and column 1, the second bit matrix in row 0 and column 4, the second bit matrix in row 0 and column 5, the second bit matrix in row 1 and column 0, the second bit matrix in row 1 and column 1, the second bit matrix in row 1 and column 4, and the second bit matrix in row 1 and column 5 are from the sixth bit set.

[1109] In some possible implementations, the first cache subset includes a total of 336 cache units in columns 0, 1, 4, and 5 of the interleaved cache, and the second cache subset includes a total of 336 cache units in columns 2, 3, 6, and 7 of the interleaved cache. BRIEF DESCRIPTION OF THE DRAWINGS

[1110] FIG1 is a schematic diagram of a communication system used in an embodiment of the present application;

[1111] FIG2 is a schematic diagram of the structure of a data frame;

[1112] FIG3 is a schematic diagram of an embodiment of the first data processing in an embodiment of the present application;

[1113] FIG4 is a schematic diagram of an embodiment of the second data processing in an embodiment of the present application;

[1114] FIG5 is a schematic diagram of an embodiment of PCS and OFEC encoding in an embodiment of the present application;

[1115] FIG6 is a schematic diagram of a fourth bit set in an embodiment of the present application;

[1116] FIG7 is a schematic diagram of a first bit subset in an embodiment of the present application;

[1117] FIG8 is a schematic diagram of a fifth bit set in an embodiment of the present application;

[1118] FIG9( a ) is a schematic diagram of a second bit subset according to an embodiment of the present application;

[1119] FIG9( b ) is another schematic diagram of the second bit subset according to an embodiment of the present application;

[1120] FIG10 is a schematic diagram of a first implementation of the first interleaving process in an embodiment of the present application;

[1121] FIG11( a ) is a schematic diagram showing a distribution of multiple first bit subsets in an embodiment of the present application;

[1122] FIG11( b ) is another schematic diagram of the distribution of multiple first bit subsets in an embodiment of the present application;

[1123] FIG11( c ) is a schematic diagram showing another distribution of multiple first bit subsets in an embodiment of the present application;

[1124] FIG11( d ) is another schematic diagram of distribution of multiple first bit subsets in an embodiment of the present application;

[1125] FIG11( e ) is another schematic diagram of the distribution of multiple first bit subsets in an embodiment of the present application;

[1126] FIG12 is a schematic diagram of a second implementation of the first interleaving process in an embodiment of the present application;

[1127] FIG13 is a schematic diagram of a third implementation of the first interleaving process in an embodiment of the present application;

[1128] FIG14 is a schematic diagram of interweaving within a square matrix according to an embodiment of the present application;

[1129] FIG15 is a schematic diagram of inter-matrix interleaving according to an embodiment of the present application;

[1130] FIG16 is another schematic diagram of interweaving within a square matrix according to an embodiment of the present application;

[1131] FIG17( a ) is a schematic diagram of an implementation method of performing CRC on a data frame in an embodiment of the present application;

[1132] FIG17( b ) is a schematic diagram of another implementation method of performing CRC on a data frame in an embodiment of the present application;

[1133] FIG17( c ) is a schematic diagram of another implementation method of performing CRC on a data frame in an embodiment of the present application;

[1134] FIG18 is a schematic diagram of an embodiment of the third data processing in the embodiment of the present application;

[1135] FIG19 is a schematic diagram of a distribution of interleaved buffers in an embodiment of the present application;

[1136] FIG20 is a schematic diagram of another distribution of interleaved buffers in an embodiment of the present application;

[1137] FIG21 is a schematic diagram of another embodiment of PCS and FEC encoding in an embodiment of the present application;

[1138] FIG22 is a schematic diagram of a sixth bit set in an embodiment of the present application;

[1139] FIG23( a ) is a schematic diagram of a first distribution of the sixth bit set in an embodiment of the present application;

[1140] FIG23( b ) is a schematic diagram of a second distribution of the sixth bit set in an embodiment of the present application;

[1141] FIG23( c ) is a schematic diagram of a third distribution of the sixth bit set in an embodiment of the present application;

[1142] FIG23( d ) is a schematic diagram of a fourth distribution of the sixth bit set in an embodiment of the present application;

[1143] FIG24( a ) is a schematic diagram of a third bit subset according to an embodiment of the present application;

[1144] FIG24( b ) is another schematic diagram of the third bit subset according to an embodiment of the present application;

[1145] FIG25 is a schematic diagram of a first structural example of a data processing device according to an embodiment of the present application;

[1146] FIG26 is a schematic diagram of a second structure of a data processing device according to an embodiment of the present application;

[1147] FIG27 is a schematic diagram of a third structural embodiment of a data processing device according to the present application;

[1148] FIG28 is a schematic diagram of a fourth structure of a data processing device according to an embodiment of the present application;

[1149] FIG29( a ) is a schematic diagram of a third bit subset according to an embodiment of the present application;

[1150] FIG29( b ) is a schematic diagram of the third bit subset in an embodiment of the present application;

[1151] FIG29( c ) is a schematic diagram of the third bit subset according to an embodiment of the present application;

[1152] FIG29( d ) is a schematic diagram of the third bit subset according to an embodiment of the present application;

[1153] FIG29( e ) is a schematic diagram of the third bit subset according to an embodiment of the present application;

[1154] FIG29( f ) is a schematic diagram of a third bit subset according to an embodiment of the present application;

[1155] FIG30( a ) is a schematic diagram of a first bit subset according to an embodiment of the present application;

[1156] FIG30( b ) is a schematic diagram of the first bit subset in an embodiment of the present application;

[1157] FIG30( c ) is a schematic diagram of the first bit subset in an embodiment of the present application;

[1158] FIG30( d ) is a schematic diagram of the first bit subset according to an embodiment of the present application;

[1159] FIG30( e ) is a schematic diagram of the first bit subset according to an embodiment of the present application;

[1160] Figure 30(f) is a schematic diagram of the first bit subset in an embodiment of the present application. DETAILED DESCRIPTION

[1161] The embodiments of the present application provide a data processing method and a data processing device, which adopt FEC coding and combine PCS technology to meet longer transmission distances, and make the overall data processing operation simpler, less complex, and with lower power consumption, thereby improving overall performance.

[1162] It should be noted that the terms "first", "second", etc. in the specification and claims of this application and the above-mentioned drawings are used to distinguish similar objects, rather than to limit a specific order or precedence. It should be understood that the above terms can be interchangeable where appropriate so that the embodiments described in this application can be implemented in a sequence other than that described in this application. In addition, the terms "including" and "having" and any variations thereof are intended to cover non-exclusive inclusions. For example, a process, method, system, product or device that includes a series of steps or units is not necessarily limited to those steps or units clearly listed, but may include other steps or units that are not clearly listed or inherent to these processes, methods, products or devices.

[1163] FIG1 is a schematic diagram of a communication system used in an embodiment of the present application. As shown in FIG1 , at the transmitting end, the information source provides a data stream to be transmitted, and the transmitting end data processor receives the data stream. The transmitting end data processor first performs data processing including encoding, interleaving, modulation, and DSP framing to obtain a symbol data stream, which is then sent to the transmitting end signal processor for signal processing, and then transmitted through the channel to the receiving device. After the receiving device receives the distorted signal caused by noise or other damage in the channel, it is sent to the receiving end signal processor for dispersion compensation, synchronization, phase recovery and other operations, and then sent to the receiving end data processor for demodulation, deinterleaving, decoding and other processing to recover the original data, and then the recovered data is sent to the destination.

[1164] It should be noted that some of the operation symbols appearing in the formulas involved in the embodiments of this application, Operation, which means rounding a down to an integer. For example, The b%c operation in the embodiments of this application represents the modulo operation of b with respect to c. When b is non-negative, the value of b%c is the remainder of b divided by c. For example, 8%3 = 2, and 2%3 = 3. When b is negative, the value of b%c is the modulo operation of b plus an integer multiple of a to obtain a positive integer. For example, -9%16 = 7, and -10%3 = 2. It should be noted that OFEC coding is used as a specific implementation of FEC coding in the following description.

[1165] It should be noted that the concepts of bit sets and bit subsets in this specification and claims are merely introduced for ease of description. In practical applications, the data stream is a whole and not divided. Each bit set or bit subset can be considered as one or more bits in the data stream. It should be understood that the bit sets and bit subsets can also be presented in the form of matrices, arrays, etc., which are not specifically limited here.

[1166] Figure 2 is a schematic diagram of the structure of a data frame. As shown in Figure 2, the data frame includes multiple rows of bits, and each row includes q bits, for example, q = 10280. It should be understood that the present application does not limit the specific type of data frame. As an example, an 800ZR frame or a FlexO-8 frame or a FlexO-8e frame contains 512 rows, each row contains 10280 bits. As another example, a FlexO-6 frame or a FlexO-6e frame contains 384 rows, each row contains 10280 bits. In some specific applications, the integer q is an integer multiple of 257; typically, q is 10280, 8224, 4112, or 2056, etc.

[1167] It should be noted that the data processing method provided in this application can be divided into three parts, respectively referred to as "first data processing," "second data processing," and "third data processing." In one possible implementation, the first data processing can be performed first, followed by the second data processing. In another possible implementation, the first data processing can also be performed first, followed by the third data processing. The "first data processing," "second data processing," and "third data processing" are described in detail below.

[1168] FIG3 is a schematic diagram of an embodiment of the first data processing in an embodiment of the present application. As shown in FIG3 , the first data processing includes a cyclic redundancy check (CRC), pad insertion, and scrambling. In practical applications, at least one of the CRC and pad insertion operations can be performed. Specifically, the first data is obtained from the data frame, and the first data includes r rows and q columns of bits, where r is an integer greater than 0 and q is an integer greater than 0. In order to facilitate the distinction from r0 and r1 below, r is used uniformly in the following text. Frame To indicate that the first data includes r rows.

[1169] Taking q=10280 as an example, the total number of d in =10280×r Frame bits. Then, CRC is performed on the first data and / or padding bits are inserted to obtain the second data. In the CRC operation, d CRC CRC check bits are inserted during the padding operation. PAD Then, the second data is scrambled to obtain the third data, and the number of bits of the third data is d scr =10280×r Frame +d CRC +d PAD scrambled bits. CRC is an integer greater than or equal to 0, dPAD is an integer greater than or equal to 0, which can be expressed as d CP =d CRC +d PAD At this time, the redundancy corresponding to the CRC checksum and inserted padding bits is

[1170] As an example, when d PAD = 0, the 10280×r after CRC check Frame +d CRC As another example, in order to achieve lower latency and lower complexity, the CRC check is bypassed and replaced with padding bits. CRC =0.

[1171] It should be noted that in some specific application scenarios, CRC check uses CRC-32. In this case, d CRC =32×p, where p is an integer greater than 1 and the integer r Frame More specifically, for r obtained from the data frame Frame Row data, each r Frame / p line total 10280×r Frame / p bits perform CRC-32 to add 32-bit check bits, repeat CRC-32 p times to add a total of d CRC =32×p bits of CRC check bits.

[1172] It should be noted that in some other specific application scenarios, CRC check uses CRC-32. In this case, d CRC =32×p, where p is an integer greater than 1 and the integer r Frame is not divisible by p. Consider r F0 ×(p-1)+r F1 =r Frame , where the integer r F0 Greater than an integer r F1 In some implementations, the integer integer r F1 =r Frame -r F0 ×(p-1), and r F0 >r F1 More specifically, for the r obtained from the data frame Frame Row data, the first r F0 ×(p-1) rows of each r F0 Rows total q×r F0The bits are CRC-32 and the parity bits of length 32 bits are added to obtain a total of 32×(p-1) bits of CRC parity bits. F1 Rows total q×r F1 The bits are CRC-32 added with a 32-bit check bit, and the total is d CRC =32×p bits of CRC check bits. It should be noted that in some specific implementations, q×r F0 =41120, its value for r Frame The first row of data F0 ×(p-1) rows of each r F0 Rows total q×r F0 The CRC-32 encoding and detection operations can directly adopt the CRC-32 operation in the existing 800GZR, wherein the CRC-32 operation is performed on 4×10280=41120 bits of data in 4 rows and 10280 columns.

[1173] Figure 4 is a schematic diagram of an embodiment of the second data processing in an embodiment of the present application. As shown in Figure 4, multiple bits are obtained from the third data output after the first data processing and are round-robinly fed into L PCS and FEC codes, where L is an even integer greater than 0. In the example of Figure 4, L = 4. For ease of explanation, the following description uses the example of k bits input for each PCS and FEC code, where k is an integer greater than 1. That is, the PCS and FEC codes are processed in groups of k bits each time. In practical applications, each PCS and FEC code can also input 2×k bits or 4×k bits, etc., without limitation here. Specifically, each k bits are first subjected to PCS and FEC coding, and then to a first interleaving process, resulting in L first bit streams. The FEC code can specifically be OFEC coding. Subsequently, a second interleaving process is performed on each of the L first bit streams to obtain a total of L / 2 second bit streams. The second interleaving process can specifically be OFEC interleaving. The second interleaving process will be described below using OFEC interleaving as an example. Next, symbol mapping and polarization distribution are performed on the L / 2 second bit streams to obtain a dual-polarization symbol stream. For example, the symbol mapping and polarization distribution process maps t bits into one dual-polarization symbol, where t is an integer greater than 0. For example, when t = 8, the dual-polarization symbol is a dual-polarization DP-16QAM symbol. Furthermore, digital signal processing (DSP) framing is performed on the dual-polarization symbol stream. For example, DSP framing processes every 172,032 dual-polarization DP-16QAM symbols to obtain a DSP superframe containing 175,104 dual-polarization symbols.

[1174] It should be noted that the second data processing may also include 6 PCS and OFEC codes. In this case, the corresponding second data processing includes 6 first interleaving processes and 3 second interleaving processes. The output of each PCS and OFEC code is sent to one first interleaving process, every two outputs of the first interleaving processes are sent to one second interleaving process, and the outputs of the three second interleaving processes are sent to symbol mapping for symbol modulation mapping. It should also be noted that the second data processing may also include 8 PCS and OFEC codes. In this case, the corresponding second data processing includes 8 first interleaving processes and 4 second interleaving processes. The output of each PCS and OFEC code is sent to one first interleaving process, every two outputs of the first interleaving processes are sent to one second interleaving process, and the outputs of the four second interleaving processes are sent to symbol mapping for symbol modulation mapping.

[1175] The following is a detailed introduction to each operation of the second data processing.

[1176] (1) PCS and FEC encoding:

[1177] FIG5 is a schematic diagram of an embodiment of PCS and FEC coding in an embodiment of the present application. As shown in FIG5 , k bits of one input are taken as an example for introduction. PCS processing is performed on the first bit set of the k bits to obtain a second bit set. OFEC coding is performed on the second bit set and the third bit set of the k bits except the first bit set to obtain a fourth bit set. Among them, the fourth bit set includes m0 first bit subsets, each first bit subset includes F0 bits, m0 is an integer greater than 1, and F0 is an even number greater than 1. For example, m0 can be 12 or 16, and F0 can be 256. It should be noted that the number of bits in the second bit set is m0×F0 / 2, and the number of bits in the fourth bit set is m0×F0. It should be noted that the amplitude bits in the above-mentioned dual-polarization symbol come from the second bit set. For the sake of convenience, the following description will be based on F0=256 as an example.

[1178] In one possible implementation, m0 = 16, the number of bits in the first bit set is k - 1504, the number of bits in the second bit set is 2048, the number of bits in the third bit set is 1504, and the number of bits in the fourth bit set is 4096. That is, k - 1504 bits are sent to PCS processing to obtain 2048 bits. Combined with the remaining 1504 bits from the k bits after PCS processing, a total of 2048 + 1504 = 3552 bits are sent to OFEC encoding. 544 OFEC parity bits are added, resulting in a total of 4096 OFEC-encoded bits. In this case, the coding redundancy of the OFEC coding is 4096 / 3552 - 1 = 15.3%.

[1179] In another possible implementation, m0 = 12, the number of bits in the first bit set is k-992, the number of bits in the second bit set is 1536, the number of bits in the third bit set is 992, and the number of bits in the fourth bit set is 3072. That is, k-992 bits are sent to PCS processing to obtain 1536 bits. Combined with the remaining 992 bits of k bits after removing the PCS processing, a total of 1536 + 992 = 2528 bits are sent to FEC encoding for encoding, and 544 FEC parity bits are added, resulting in a total of 3072 FEC-encoded bits. In this case, the coding redundancy of the FEC code is 3072 / 2528-1 = 21.5%. A specific FEC code can be the 21.5% OH FEC code obtained by shortening the 15.3% OH OFEC code. In some scenarios, the shortened OFEC code is also referred to as the OFEC code.

[1180] It should be noted that the number of bits of the third data output by the first data processing d scr is an integer multiple of L×k. At this time, the first data processing output d scr bits, and then one or more second data processing operations can complete the d scr The processing of each bit does not require any additional processing such as caching, making the specific hardware implementation of the entire data processing simpler and the power consumption lower.

[1181] It should be noted that when m0=16, the number of input bits corresponding to PCS processing is k PCS = k-1504 is an integer multiple of 2, 4, 8, or 16. Considering that the number of output bits corresponding to PCS processing is 2048. Usually, PCS processing uses a lookup table (LUT) to convert the input k LUT The bits are mapped and the corresponding n is output LUT The number of output bits processed by the PCS is n. LUT It cannot be too small, otherwise it will cause performance loss in the overall PCS processing. The number of output bits processed by the PCS is n LUT It cannot be too large, otherwise it will be difficult to implement in hardware. LUT is 128, 256, 512, or 1024. For n LUT =128, PCS processes the input k LUT =(k-1504) / 16 bits for LUT mapping and output of corresponding n LUT= 128 bits. After 16 consecutive LUT mapping operations, a total of k-1504 bits are LUT mapped and the corresponding 2048 bits are output. In some specific applications, the LUT processing of the lookup table can be implemented by including multiple sub-lookup tables. The number of input bits of the sub-lookup tables can be different, and the number of output bits can also be different. In this application, the specific implementation of the lookup table is not limited.

[1182] For n LUT = 256, PCS processes the input k LUT =(k-1504) / 8 bits for LUT mapping and output of corresponding n LUT = 256 bits, and after 8 consecutive operations of the above LUT mapping, a total of k-1504 bits are LUT mapped and the corresponding 2048 bits are output. LUT =512, PCS processes the input k LUT =(k-1504) / 4 bits for LUT mapping and output of corresponding n LUT = 128 bits, and after four consecutive LUT mapping operations, a total of k-1504 bits are LUT mapped and the corresponding 2048 bits are output. LUT =1024, PCS processes the input k LUT =(k-1504) / 2 bits for LUT mapping and output of corresponding n LUT = 1024 bits. After two consecutive LUT mapping operations, a total of k-1504 bits are LUT-mapped and the corresponding 2048 bits are output. Therefore, when m0 = 16, to facilitate hardware implementation or achieve better performance, the number of input bits k-1504 corresponding to PCS processing is an integer multiple of 2, 4, 8, or 16.

[1183] It should be noted that when m0=12, the number of input bits corresponding to PCS processing is k PCS = k-992 is an integer multiple of 2, 3, 4, 6, 8, 12 or 16. Considering that the number of output bits corresponding to PCS processing is 1536. Usually, PCS processing uses a lookup table (LUT) to convert the input k LUT The bits are mapped and the corresponding n is output LUT The number of output bits processed by the PCS is n. LUT It cannot be too small, otherwise it will cause performance loss in the overall PCS processing. The number of output bits processed by the PCS is n LUT It cannot be too large, otherwise it will be difficult to implement in hardware. LUT is 96, 128, 192, 256, 384, 512, or 768.LUT =96, PCS processes the input k LUT =(k-992) / 16 bits for LUT mapping and output of corresponding n LUT = 96 bits, and after 16 consecutive operations of the above LUT mapping, a total of k-992 bits are LUT mapped and the corresponding 1536 bits are output. LUT =128, PCS processes the input k LUT =(k-992) / 12 bits for LUT mapping and output of corresponding n LUT = 128 bits, and after 12 consecutive operations of the above LUT mapping, a total of k-992 bits are LUT mapped and the corresponding 1536 bits are output. LUT =192, PCS processes the input k LUT =(k-992) / 8 bits for LUT mapping and output of corresponding n LUT = 192 bits, and after 8 consecutive LUT mapping operations, a total of k-992 bits are LUT mapped and the corresponding 1536 bits are output. LUT = 256, PCS processes the input k LUT =(k-992) / 6 bits for LUT mapping and output of corresponding n LUT = 256 bits, and after 6 consecutive operations of the above LUT mapping, a total of k-992 bits are LUT mapped and the corresponding 1536 bits are output. LUT =384, PCS processes the input k LUT =(k-992) / 4 bits for LUT mapping and output of corresponding n LUY = 384 bits, and after four consecutive LUT mapping operations, a total of k-992 bits are LUT mapped and the corresponding 1536 bits are output. LUT =512, PCS processes the input k LUT =(k-992) / 3 bits for LUT mapping and output of corresponding n LUT = 512 bits, and after three consecutive LUT mapping operations, a total of k-992 bits are LUT mapped and the corresponding 1536 bits are output. LUT =768, PCS processes the input k LUT =(k-992) / 2 bits for LUT mapping and output of corresponding n LUT= 768 bits. After continuously operating the above LUT mapping twice, a total of k - 992 bits will be subjected to LUT mapping to output the corresponding 1536 bits. Therefore, when m0 = 12, for the convenience of hardware implementation or to achieve better performance, the number of input bits k - 992 corresponding to PCS processing is an integer multiple of 2, 3, 4, 6, 8, 12, or 16.

[1184] FIG. 6 is a schematic diagram of a fourth bit set in an embodiment of the present application. As shown in FIG. 6, in some application scenarios, the m0 first bit subsets in the above fourth bit set may specifically be presented in the form of a square block, and the square block may also be simply referred to as a block. Each first bit subset may be called a bit square block B. For example, as shown in FIG. 6, m0 = 16 bit square blocks B are distributed in 2 rows and 8 columns. The square block in the i0-th row and j0-th column contains 256 bits out of 4096 OFEC-encoded bits, where 0 ≤ i0 < 2 and 0 ≤ j0 < 8. Another example, m0 = 12 bit square blocks B are distributed in 2 rows and 6 columns. The square block in the i0-th row and j0-th column contains 256 bits out of 3072 FEC-encoded bits, where 0 ≤ i0 < 2 and 0 ≤ j0 < 6. Further, the 256 bits in each bit square block B may be distributed in F1 rows and F1 columns. Hereinafter, F1 = 16 will be taken as an example for introduction. For simplicity of description, represents the bit square block B in the i0-th row and j0-th column.

[1185] It should be understood that the above 2 rows and m1 columns of bit square blocks B are also referred to as the output blocks of the FEC encoding in some specific scenarios, where m0 = 2 × m1. It should also be understood that the above 2 rows and m1 columns of bit square blocks B can also be regarded as a 32-row and m0 × 8-column bit matrix, which contains 32 rows, and each row contains m0 × 8 bits. Then, the bit in the r0-th row and c0-th column of the bit matrix corresponds to the bit in the i1-th row and j1-th column of where i1 = r0 % 16, j1 = c0 % 16, and 0 ≤ r0 < 32, 0 ≤ c0 < m0 × 8, 0 ≤ i0 < 2, 0 ≤ j0 < 8, 0 ≤ i1 < 16, and 0 ≤ j1 < 16. In the present application, in some cases, one row represents 8 bit square blocks, in some cases, one row represents a total of 16 bits in one row of a bit square block, and in some cases, one row represents a total of m0 × 8 bits in one row of a set composed of m0 bit square blocks. It can be understood according to the context to distinguish specific situations.

[1186] In some specific applications, as shown in FIG. 6, the square block in the i0-th row and j0-th column (0 ≤ i0 < 2 and 0 ≤ j0 < 8) Contains bits 512×j0+256×i0 to 512×j0+256×i0+255 in the fourth bit set. For example, the square matrix B with row i0=0 and column j0=0 0,0 Contains bits 0 to 255 in the fourth bit set. For another example, the square matrix B with row i0=1 and column j0=7 1,7 Contains bits 3840 to 4095 of the fourth bit set.

[1187] FIG7 is a schematic diagram of the first bit subset in an embodiment of the present application. As shown in FIG7 , each bit matrix contains 16 rows and 16 columns for a total of 256 bits, and the bit in the i1th row and j1th column (0≤i1<16 and 0≤j1<16) in the bit matrix corresponds to the 16×i1+j1th bit in the 256 bits. For example, the bit in the i1=1th row and j1=0th column in the bit matrix corresponds to the 16th bit in the 256 bits. For another example, the bit in the i1=2th row and j1=3th column in the bit matrix corresponds to the 35th bit in the 256 bits.

[1188] More specifically, the bit matrix at row i0 and column j0 (0≤i0<2 and 0≤j0<8) The bit in row i1 and column j1 (0≤i1<16 and 0≤j1<16) Corresponding to the 512×j0+256×i0+16×i1+j1th bit in the fourth bit set. For example, the bit matrix B with the i0=0th row and j0=0th column 0,0 Bit B at row i1=1 and column j1=0 0,0 (1, 0) corresponds to the 16th bit in the fourth bit set. For another example, the bit matrix B with row i0=1 and column j0=7 1,7 Bit B at row i1=2 and column j1=3 1,7 (3, 3) corresponds to the 3875th bit in the fourth bit set.

[1189] (2) First interleaving process:

[1190] A first interleaving process is performed on the fourth bit set after PCS processing and FEC encoding to obtain a fifth bit set. Specifically, the first interleaving process reorders the order of the bits in the fourth bit set. The fifth bit set includes m0 second bit subsets, each of which includes 256 bits. It should be understood that, as shown in FIG4 , each first bit stream fed into the second interleaving process may include multiple fifth bit sets.

[1191] FIG. 8 is a schematic diagram of the fifth bit set in an embodiment of the present application. As shown in FIG. 8, taking m0 = 16 as an example, similar to the 16 first bit subsets in the above fourth bit set, the 16 second bit subsets in the fifth bit set can also be presented in the form of a square block. Each second bit subset can be called a bit square matrix T. The 256 bits in each bit square matrix T are distributed in 16 rows and 16 columns. For example, the 16 bit square matrices T are distributed in 2 rows and 8 columns. The square matrix in the i0-th row and j0-th column contains 256 bits out of 4096 first interleaved bits, where 0 ≤ i0 < 2 and 0 ≤ j0 < 8. For simplicity of description, represents the square matrix in the i0-th row and j0-th column. Similarly, the above 2 rows and m1 columns of bit square matrices T can also be regarded as a 32-row and m0×8-column bit matrix, which contains 32 rows, and each row contains m0×8 bits. Then the bit in the r1-th row and c1-th column of the bit matrix corresponds to the bit in the i1-th row and j1-th column of the bit square matrix where i1 = r1 % 16, j1 = c1 % 16, and 0 ≤ r1 < 32, 0 ≤ c1 < m0×8, 0 ≤ i0 < 2, 0 ≤ j0 < 8, 0 ≤ i1 < 16 and 0 ≤ j1 < 16. It should be understood that the 2 rows and 8 columns of bit square matrices T output by the first interleaving process are also called the output blocks of the first interleaving process in some specific scenarios.

[1192] It should be noted that 128 bits in each second bit subset come from the second bit set, and the other 128 bits in each second bit subset come from the third bit set and / or the parity bits of the OFEC encoding. As an example, 2048 bits after PCS processing, after OFEC encoding and the first interleaving process, are distributed in 16 bit square matrices T, and 128 bits are distributed to each bit square matrix T containing 256 bits.

[1193] In some specific applications, 8 bits out of the 16 bits in each row of the second bit subset come from the second bit set, and the other 8 bits in each row of the second bit subset come from the third bit set and / or the parity bits of the OFEC encoding.

[1194] FIG. 9(a) is a schematic diagram of the second bit subset in an embodiment of the present application. As shown in FIG. 9(a), in a possible implementation manner, in the second bit subset, the i 2nd row and the The bits of the column come from the second bit set, 0≤i2<16, 0≤j2<8, that is, the bits in the shaded portion in Figure 9(a) come from one of the 2048 bits in the second bit set. Figure 9(b) is another schematic diagram of the second bit subset in an embodiment of the present application. As shown in Figure 9(b), in another possible implementation, the bits in the i2th row and the (j2×2-i2%2+1)th column in the second bit subset come from the second bit set, 0≤i2<16, 0≤j2<8, that is, the bits in the shaded portion in Figure 9(b) come from one of the 2048 bits in the second bit set.

[1195] It should be noted that the m1 first bit subsets in the fourth bit set, totaling m1×256 bits, come from the second bit set, where m0 = 2×m1. Referring to Figure 6 , taking m0 = 16 and m1 = 8 as an example, 8 of the 16-bit square matrix B, consisting of 2 rows and 8 columns, come from the 2048 bits of the second bit set. Furthermore, bits 0 through 2047 of the 4096 bits in the fourth bit set come from the 2048 bits of the second bit set.

[1196] In one possible implementation, the m0×256 bits in the fourth bit set are distributed as 32 rows and m0×8 columns, the m0×256 bits in the fifth bit set are distributed as 32 rows and m0×8 columns, and the m0×8 bits in the r1th row of the fifth bit set come from the m0×8 bits in the r0th row of the fourth bit set, where 0≤r0<32, 0≤r1<32.

[1197] FIG10 is a schematic diagram of a first implementation of the first interleaving process in an embodiment of the present application. As shown in FIG10 , the 4096 bits in the fourth bit set (including the 16-bit matrix B) are distributed into 32 rows and 128 columns, and the 4096 bits in the fifth bit set (including the 16-bit matrix T) are distributed into 32 rows and 128 columns. The 128 bits in row r1 of the fifth bit set come from the 128 bits in row r0 of the fourth bit set. More specifically, when r1%4=0, bits 2, 3, 6, 7, 10, 11, 14, 15, ..., 114, 115, 118, 119, 122, 123, 126, and 127 of the 128 bits in row r1 of the fifth bit set, totaling 64 bits, come from the 64 bits in row r0 of the 128 bits in the fourth bit set that have undergone PCS processing. When r1%4=1, bits 0, 3, 4, 7, 8, 11, 12, 15, ..., 112, 115, 116, 119, 120, 123, 124, and 127, a total of 64 bits, of the 128 bits in the r1-th row of the fifth bit set come from the 64 bits in the r0-th row of the fourth bit set that have been processed by the PCS. When r1%4=2, bits 0, 1, 4, 5, 8, 9, 12, 13, ..., 112, 113, 116, 117, 120, 121, 124, and 125, a total of 64 bits, of the 128 bits in the r1-th row of the fifth bit set come from the 64 bits in the r0-th row of the fourth bit set that have been processed by the PCS. When r1%4=3, bits 1, 2, 5, 6, 9, 10, 13, 14, ..., 113, 114, 117, 118, 121, 122, 125, and 126, a total of 64 bits, of the 128 bits in the r0 row in the fifth bit set come from the 64 bits processed by PCS in the r0 row in the fourth bit set.

[1198] As an example, m0 first bit subsets are distributed into 2 rows and m1 columns, wherein the first bit subset in row 0 and column m2 is and the first bit subset of row 1, column m2 From the second bit set, 0≤m2<m1 / 2.

[1199] FIG11(a) is a schematic diagram of a distribution of multiple first bit subsets in an embodiment of the present application. As shown in FIG11(a), taking m0=16 as an example, the bit matrix B with 8 shadow backgrounds is 0,0 、B 0,1 、B 0,2 、B 0,3 、B 1,0 、B 1,1 、B 1,2 、B 1,32048 bits from the second bit set, 8 bit squares without shadow background B 0,4 、B 0,5 、B 0,6 、B 0,7 、B 1,4 、B 1,5 、B 1,6 、B 1,7 The first 64 bits of the 128 bits in row r0 are 64 bits from the 2048 bits in the second bit set, where 0≤r0<32.

[1200] Taking FIG11(a) as an example, a specific interleaving rule of the first interleaving process is as follows: the first bit of the m0×8 bits in the r1th row of the fifth bit set (including the m0 bit matrix T) is bits come from the 0th bit to the (m0×4-1)th bit in the r0th row of the fourth bit set (including m0 bit matrix B), where, Several more specific examples are provided below.

[1201] Example 1: the c1th bit in the m0×8 bits in the r1th row in the fifth bit set comes from the c0th bit in the m0×8 bits in the r0th row in the fourth bit set;

[1202] Among them, 0≤c0<(m0×8), 0≤c1<(m0×8), θ is an integer multiple of 4, and m0×8 is divisible by θ, Δ is an integer, and β is an integer multiple of 4.

[1203] Example 2: the c1th bit in the m0×8 bits in the r1th row in the fifth bit set comes from the c0th bit in the m0×8 bits in the r0th row in the fourth bit set;

[1204] Among them, 0≤c0<(m0×8), 0≤c1<(m0×8), θ is an integer multiple of 4, and m0×8 is divisible by θ, Δ is an integer, and β is an integer multiple of 4.

[1205] Example 3: The c1th bit in the m0×8 bits in the r1th row in the fifth bit set comes from the c0th bit in the m0×8 bits in the r0th row in the fourth bit set;

[1206] Among them, 0≤c0<(m0×8), 0≤c1<(m0×8), θ is an integer multiple of 4, and m0×8 is divisible by θ, Δ is an integer, and β is an integer multiple of 4.

[1207] Example 4: the c1th bit in the m0×8 bits in the r1th row in the fifth bit set comes from the c0th bit in the m0×8 bits in the r0th row in the fourth bit set;

[1208] Among them, 0≤c0<(m0×8), 0≤c1<(m0×8), θ is an integer multiple of 4, and m0×8 is divisible by θ, Δ is an integer, and β is an integer multiple of 4.

[1209] Taking FIG11(a) as an example, another specific interleaving rule of the first interleaving process is as follows: the first bit of the m0×8 bits in the r1th row of the fifth bit set (including the m0 bit matrix T) is bits come from the 0th bit to the (m0×4-1)th bit in the r0th row of the fourth bit set (including m0 bit matrix B), where Several more specific examples are provided below.

[1210] Example 5: The c1th bit in the m0×8 bits in the r1th row in the fifth bit set comes from the c0th bit in the m0×8 bits in the r0th row in the fourth bit set;

[1211] Among them, 0≤c0<(m0×8), 0≤c1<(m0×8), θ is an integer multiple of 4, and m0×8 is divisible by θ, Δ is an integer, and β is an integer multiple of 2.

[1212] Example 6: the c1th bit in the m0×8 bits in the r1th row in the fifth bit set comes from the c0th bit in the m0×8 bits in the r0th row in the fourth bit set;

[1213] Among them, 0≤c0<(m0×8), 0≤c1<(m0×8), θ is an integer multiple of 4, and m0×8 is divisible by θ, Δ is an integer, and β is an integer multiple of 2.

[1214] Example 7: the c1th bit in the m0×8 bits in the r1th row in the fifth bit set comes from the c0th bit in the m0×8 bits in the r0th row in the fourth bit set;

[1215] Among them, 0≤c0<(m0×8), 0≤c1<(m0×8), θ is an integer multiple of 4, and m0×8 is divisible by θ, Δ is an integer, and β is an integer multiple of 2.

[1216] Example 8: The c1th bit in the m0×8 bits in the r1th row in the fifth bit set comes from the c0th bit in the m0×8 bits in the r0th row in the fourth bit set;

[1217] Among them, 0≤c0<(m0×8), 0≤c1<(m0×8), θ is an integer multiple of 4, and m0×8 is divisible by θ, Δ is an integer, and β is an integer multiple of 2.

[1218] Taking FIG. 11( a ) as an example, in one possible implementation, the following conditions are met:

[1219] The second bit subset T at row 0 and column 0 0,0 and the second bit subset T at row 1, column 0 1,0 A total of 512 bits come from the first bit subset B at row 0 and column 0 0,0 and the first bit subset B at row 0 and column 4 0,4 A total of 512 bits.

[1220] The second bit subset T of row 0 and column 1 0,1 and the second bit subset T at row 1, column 1 1,1 A total of 512 bits come from the first bit subset B in row 1, column 0 1,0 and the first bit subset B at row 1, column 4 1,4 A total of 512 bits.

[1221] The second bit subset T at row 0 and column 2 0,2 and the second bit subset T at row 1, column 2 1,2 A total of 512 bits come from the first bit subset B at row 0 and column 1 0,1 and the first bit subset B at row 0 and column 5 0,5 A total of 512 bits.

[1222] The second bit subset T of row 0 and column 3 0,3 and the second bit subset T at row 1, column 3 1,3 A total of 512 bits come from the first bit subset B in row 1 and column 1 1,1 and the first bit subset B at row 1 and column 5 1,5 A total of 512 bits.

[1223] The second bit subset T of row 0 and column 4 0,4and the second bit subset T at row 1, column 4 1,4 A total of 512 bits come from the first bit subset B at row 0 and column 2 0,2 and the first bit subset B at row 0 and column 6 0,6 A total of 512 bits.

[1224] The second bit subset T at row 0 and column 5 0,5 and the second bit subset T at row 1, column 5 1,5 A total of 512 bits come from the first bit subset B in row 1, column 2 1,2 and the first bit subset B at row 1, column 6 1,6 A total of 512 bits.

[1225] The second bit subset T at row 0 and column 6 0,6 and the second bit subset T at row 1, column 6 1,6 A total of 512 bits come from the first bit subset B at row 0 and column 3 0,3 and the first bit subset B at row 0 and column 7 0,7 A total of 512 bits.

[1226] The second bit subset T at row 0 and column 7 0,7 and the second bit subset T at row 1, column 7 1,7 A total of 512 bits come from the first bit subset B in row 1, column 3 1,3 and the first bit subset B at row 1, column 7 1,7 A total of 512 bits.

[1227] Taking FIG. 11( a ) as an example, in another possible implementation, the following conditions are met:

[1228] The second bit subset T at row 0 and column 0 0,0 and the second bit subset T at row 1, column 0 1,0 A total of 512 bits come from the first bit subset B at row 0 and column 0 0,0 and the first bit subset B at row 0 and column 4 0,4 A total of 512 bits.

[1229] The second bit subset T of row 0 and column 1 0,1 and the second bit subset T at row 1, column 1 1,1 A total of 512 bits come from the first bit subset B at row 0 and column 1 0,1 and the first bit subset B at row 0 and column 5 0,5 A total of 512 bits.

[1230] The second bit subset T at row 0 and column 2 0,2 and the second bit subset T at row 1, column 21,2 A total of 512 bits come from the first bit subset B at row 0 and column 2 0,2 and the first bit subset B at row 0 and column 6 0,6 A total of 512 bits.

[1231] The second bit subset T of row 0 and column 3 0,3 and the second bit subset T at row 1, column 3 1,3 A total of 512 bits come from the first bit subset B at row 0 and column 3 0,3 and the first bit subset B at row 0 and column 7 0,7 A total of 512 bits.

[1232] The second bit subset T of row 0 and column 4 0,4 and the second bit subset T at row 1, column 4 1,4 A total of 512 bits come from the first bit subset B in row 1, column 0 1,0 and the first bit subset B at row 1, column 4 1,4 A total of 512 bits.

[1233] The second bit subset T at row 0 and column 5 0,5 and the second bit subset T at row 1, column 5 1,5 A total of 512 bits come from the first bit subset B in row 1 and column 1 1,1 and the first bit subset B at row 1 and column 5 1,5 A total of 512 bits.

[1234] The second bit subset T at row 0 and column 6 0,6 and the second bit subset T at row 1, column 6 1,6 A total of 512 bits come from the first bit subset B in row 1, column 2 1,2 and the first bit subset B at row 1, column 6 1,6 A total of 512 bits.

[1235] The second bit subset T at row 0 and column 7 0,7 and the second bit subset T at row 1, column 7 1,7 A total of 512 bits come from the first bit subset B in row 1, column 3 1,3 and the first bit subset B at row 1, column 7 1,7 A total of 512 bits.

[1236] Taking FIG. 11( a ) as an example, in another possible implementation, the following conditions are met:

[1237] The second bit subset T at row 0 and column 0 0,0 and the second bit subset T at row 0 and column 1 0,1A total of 512 bits come from the first bit subset B at row 0 and column 0 0,0 and the first bit subset B at row 0 and column 4 0,4 A total of 512 bits,

[1238] The second bit subset T at row 0 and column 2 0,2 and the second bit subset T at row 0 and column 3 0,3 A total of 512 bits come from the first bit subset B at row 0 and column 1 0,1 and the first bit subset B at row 0 and column 5 0,5 A total of 512 bits,

[1239] The second bit subset T of row 0 and column 4 0,4 and the second bit subset T at row 0 and column 5 0,5 A total of 512 bits come from the first bit subset B at row 0 and column 2 0,2 and the first bit subset B at row 0 and column 6 0,6 A total of 512 bits,

[1240] The second bit subset T at row 0 and column 6 0,6 and the second bit subset T at row 0 and column 7 0,7 A total of 512 bits come from the first bit subset B at row 0 and column 3 0,3 and the first bit subset B at row 0 and column 7 0,7 A total of 512 bits,

[1241] The second bit subset T of row 1 and column 0 1,0 and the second bit subset T at row 1, column 1 1,1 A total of 512 bits come from the first bit subset B in row 1, column 0 1,0 and the first bit subset B at row 1, column 4 1,4 A total of 512 bits,

[1242] The second bit subset T of row 1 and column 2 1,2 and the second bit subset T at row 1, column 3 1,3 A total of 512 bits come from the first bit subset B in row 1 and column 1 1,1 and the first bit subset B at row 1 and column 5 1,5 A total of 512 bits,

[1243] The second bit subset T of row 1 and column 4 1,4 and the second bit subset T at row 1, column 5 1,5 A total of 512 bits come from the first bit subset B in row 1, column 2 1,2 and the first bit subset B at row 1, column 6 1,6A total of 512 bits,

[1244] The second bit subset T of row 1 and column 6 1,6 and the second bit subset T at row 1, column 7 1,7 A total of 512 bits come from the first bit subset B in row 1, column 3 1,3 and the first bit subset B at row 1, column 7 1,7 A total of 512 bits.

[1245] FIG11(b) is another schematic diagram of the distribution of multiple first bit subsets in an embodiment of the present application. As shown in FIG11(b), taking m0=16 as an example, the bit matrix B with 8 shadow backgrounds is 0,0 、B 0,1 、B 0,4 、B 0,5 、B 1,0 、B 1,1 、B 1,4 、B 1,5 2048 bits from the second bit set, 8 bit squares without shadow background B 0,2 、B 0,3 、B 0,6 、B 0,7 、B 1,2 、B 1,3 、B 1,6 、B 1,7 1504 bits and 544 OFEC check bits are derived from the unprocessed PCS. Taking the 16-bit matrix B as a whole, bits 0 to 31 and bits 64 to 95 in the 128 bits in row r0 are 64 bits from the 2048 bits in the second bit set, where 0 ≤ r0 < 32.

[1246] Taking FIG11(b) as an example, a specific interleaving rule of the first interleaving process is as follows: the first bit of the 128 bits in the r1th row of the fifth bit set (including the m0 bit matrix T) is bits come from one of the bits 0 to 31 or the bits 64 to 95 in the r0th row in the fourth bit set (including m0 bit matrix B), where Several more specific examples are provided below.

[1247] Example 9: The c1th bit in the 128 bits in the r1th row in the fifth bit set comes from the c0th bit in the 128 bits in the r0th row in the fourth bit set;

[1248] Among them, 0≤c0<128, 0≤c1<128, θ is an integer multiple of 4, and m0×8 is divisible by θ, Δ is an integer, β is an integer multiple of 4,

[1249] Example 10: The c1th bit in the 128 bits in the r1th row in the fifth bit set comes from the c0th bit in the 128 bits in the r0th row in the fourth bit set;

[1250] Among them, 0≤c0<128, 0≤c1<128, θ is an integer multiple of 4, and m0×8 is divisible by θ, Δ is an integer, β is an integer multiple of 4,

[1251] Example 11: The c1th bit in the 128 bits in the r1th row in the fifth bit set comes from the c0th bit in the 128 bits in the r0th row in the fourth bit set;

[1252] Among them, 0≤c0<128, 0≤c1<128, θ is an integer multiple of 4, and m0×8 is divisible by θ, Δ is an integer, β is an integer multiple of 4,

[1253] Example 12: The c1th bit in the 128 bits in the r1th row in the fifth bit set comes from the c0th bit in the 128 bits in the r0th row in the fourth bit set;

[1254] Among them, 0≤c0<128, 0≤c1<128, θ is an integer multiple of 4, and m0×8 is divisible by θ, Δ is an integer, β is an integer multiple of 4,

[1255] Taking FIG11(b) as an example, a specific interleaving rule of the first interleaving process is as follows: the first bit of the 128 bits in the r1th row of the fifth bit set (including the m0 bit matrix T) is bits come from one of the bits 0 to 31 or the bits 64 to 95 in the r0th row in the fourth bit set (including m0 bit matrix B), where Several more specific examples are provided below.

[1256] Example 13: The c1th bit in the 128 bits in the r1th row in the fifth bit set comes from the c0th bit in the 128 bits in the r0th row in the fourth bit set;

[1257] Among them, 0≤c0<128, 0≤c1<128, θ is an integer multiple of 4, and m0×8 is divisible by θ, Δ is an integer, and β is an integer multiple of 2.

[1258] Example 14: The c1th bit in the 128 bits in the r1th row in the fifth bit set comes from the c0th bit in the 128 bits in the r0th row in the fourth bit set;

[1259] Among them, 0≤c0<127, 0≤c1<128, θ is an integer multiple of 4, and m0×8 is divisible by θ, Δ is an integer, and β is an integer multiple of 2.

[1260] Example 15: The c1th bit in the 128 bits in the r1th row in the fifth bit set comes from the c0th bit in the 128 bits in the r0th row in the fourth bit set;

[1261] Among them, 0≤c0<128, 0≤c1<128, θ is an integer multiple of 4, and m0×8 is divisible by θ, Δ is an integer, and β is an integer multiple of 2.

[1262] Example 16: The c1th bit in the 128 bits in the r1th row in the fifth bit set comes from the c0th bit in the 128 bits in the r0th row in the fourth bit set;

[1263] Among them, 0≤c0<128, 0≤c1<128, θ is an integer multiple of 4, and m0×8 is divisible by θ, Δ is an integer, and β is an integer multiple of 2.

[1264] Taking FIG. 11( b ) as an example, in one possible implementation, the following conditions are met:

[1265] The second bit subset T at row 0 and column 0 0,0 and the second bit subset T at row 1, column 0 1,0 A total of 512 bits come from the first bit subset B at row 0 and column 0 0,0 and the first bit subset B at row 0 and column 2 0,2 A total of 512 bits.

[1266] The second bit subset T of row 0 and column 1 0,1 and the second bit subset T at row 1, column 1 1,1 A total of 512 bits come from the first bit subset B in row 1, column 0 1,0 and the first bit subset B at row 1, column 2 1,2 A total of 512 bits.

[1267] The second bit subset T at row 0 and column 2 0,2 and the second bit subset T at row 1, column 2 1,2A total of 512 bits come from the first bit subset B at row 0 and column 1 0,1 and the first bit subset B at row 0 and column 3 0,3 A total of 512 bits.

[1268] The second bit subset T of row 0 and column 3 0,3 and the second bit subset T at row 1, column 3 1,3 A total of 512 bits come from the first bit subset B in row 1 and column 1 1,1 and the first bit subset B at row 1, column 3 1,3 A total of 512 bits.

[1269] The second bit subset T of row 0 and column 4 0,4 and the second bit subset T at row 1, column 4 1,4 A total of 512 bits come from the first bit subset B at row 0 and column 4 0,4 and the first bit subset B at row 0 and column 6 0,6 A total of 512 bits.

[1270] The second bit subset T at row 0 and column 5 0,5 and the second bit subset T at row 1, column 5 1,5 A total of 512 bits come from the first bit subset B in row 1 and column 4 1,4 and the first bit subset B at row 1, column 6 1,6 A total of 512 bits.

[1271] The second bit subset T at row 0 and column 6 0,6 and the second bit subset T at row 1, column 6 1,6 A total of 512 bits come from the first bit subset B at row 0 and column 5 0,5 and the first bit subset B at row 0 and column 7 0,7 A total of 512 bits.

[1272] The second bit subset T at row 0 and column 7 0,7 and the second bit subset T at row 1, column 7 1,7 A total of 512 bits come from the first bit subset B in row 1 and column 5 1,5 and the first bit subset B at row 1, column 7 1,7 A total of 512 bits.

[1273] Taking FIG. 11( b ) as an example, in another possible implementation, the following conditions are met:

[1274] The second bit subset T at row 0 and column 0 0,0 and the second bit subset T at row 1, column 0 1,0A total of 512 bits come from the first bit subset B at row 0 and column 0 0,0 and the first bit subset B at row 0 and column 2 0,2 A total of 512 bits.

[1275] The second bit subset T of row 0 and column 1 0,1 and the second bit subset T at row 1, column 1 1,1 A total of 512 bits come from the first bit subset B at row 0 and column 1 0,1 and the first bit subset B at row 0 and column 3 0,3 A total of 512 bits.

[1276] The second bit subset T at row 0 and column 2 0,2 and the second bit subset T at row 1, column 2 1,2 A total of 512 bits come from the first bit subset B at row 0 and column 4 0,4 and the first bit subset B at row 0 and column 6 0,6 A total of 512 bits.

[1277] The second bit subset T of row 0 and column 3 0,3 and the second bit subset T at row 1, column 3 1,3 A total of 512 bits come from the first bit subset B at row 0 and column 5 0,5 and the first bit subset B at row 0 and column 7 0,7 A total of 512 bits.

[1278] The second bit subset T of row 0 and column 4 0,4 and the second bit subset T at row 1, column 4 1,4 A total of 512 bits come from the first bit subset B in row 1, column 0 1,0 and the first bit subset B at row 1, column 2 1,2 A total of 512 bits.

[1279] The second bit subset T at row 0 and column 5 0,5 and the second bit subset T at row 1, column 5 1,5 A total of 512 bits come from the first bit subset B in row 1 and column 1 1,1 and the first bit subset B at row 1, column 3 1,3 A total of 512 bits.

[1280] The second bit subset T at row 0 and column 6 0,6 and the second bit subset T at row 1, column 6 1,6 A total of 512 bits come from the first bit subset B in row 1 and column 4 1,4 and the first bit subset B at row 1, column 6 1,6A total of 512 bits.

[1281] The second bit subset T at row 0 and column 7 0,7 and the second bit subset T at row 1, column 7 1,7 A total of 512 bits come from the first bit subset B in row 1 and column 5 1,5 and the first bit subset B at row 1, column 7 1,7 A total of 512 bits.

[1282] Taking FIG. 11( b ) as an example, in another possible implementation, the following conditions are met:

[1283] The second bit subset T at row 0 and column 0 0,0 and the second bit subset T at row 0 and column 1 0,1 A total of 512 bits come from the first bit subset B at row 0 and column 0 0,0 and the first bit subset B at row 0 and column 2 0,2 A total of 512 bits,

[1284] The second bit subset T at row 0 and column 2 0,2 and the second bit subset T at row 0 and column 3 0,3 A total of 512 bits come from the first bit subset B at row 0 and column 1 0,1 and the first bit subset B at row 0 and column 3 0,3 A total of 512 bits,

[1285] The second bit subset T of row 0 and column 4 0,4 and the second bit subset T at row 0 and column 5 0,5 A total of 512 bits come from the first bit subset B at row 0 and column 4 0,4 and the first bit subset B at row 0 and column 6 0,6 A total of 512 bits,

[1286] The second bit subset T at row 0 and column 6 0,6 and the second bit subset T at row 0 and column 7 0,7 A total of 512 bits come from the first bit subset B at row 0 and column 5 0,5 and the first bit subset B at row 0 and column 7 0,7 A total of 512 bits,

[1287] The second bit subset T of row 1 and column 0 1,0 and the second bit subset T at row 1, column 1 1,1 A total of 512 bits come from the first bit subset B in row 1, column 0 1,0 and the first bit subset B at row 1, column 2 1,2 A total of 512 bits,

[1288] The second bit subset T of row 1 and column 2 1,2 and the second bit subset T at row 1, column 3 1,3 A total of 512 bits come from the first bit subset B in row 1 and column 1 1,1 and the first bit subset B at row 1, column 3 1,3 A total of 512 bits,

[1289] The second bit subset T of row 1 and column 4 1,4 and the second bit subset T at row 1, column 5 1,5 A total of 512 bits come from the first bit subset B in row 1 and column 4 1,4 and the first bit subset B at row 1, column 6 1,6 A total of 512 bits,

[1290] The second bit subset T of row 1 and column 6 1,6 and the second bit subset T at row 1, column 7 1,7 A total of 512 bits come from the first bit subset B in row 1 and column 5 1,5 and the first bit subset B at row 1, column 7 1,7 A total of 512 bits.

[1291] It should be noted that, as shown in Figure 11(b), the bit matrix B with 8 shadow backgrounds 0,0 、B 0,1 、B 0,4 、B 0,5 、B 1,0 、B 1,1 、B 1,4 、B 1,5 2048 bits from the second bit set. In conjunction with Figure 5, as shown in Figure 11(b), the 2048 bits from the second bit set are discontinuous in the FEC-encoded codeword. At this point, the second bit set and the third bit set are also interleaved before being sent to the FEC codeword to disrupt their order, so that the 3552 bits before encoding are arranged in the following order: first, 1024 consecutive bits from the second bit set, followed by 1024 consecutive bits from the third bit set, then 1024 consecutive bits from the second bit set, and finally 480 consecutive bits from the third bit set.

[1292] It should be noted that the pre-coding interleaving process is optional, but the first interleaving process is indispensable. For example, as shown in Figure 11(a), the second and third bit sets do not undergo pre-coding interleaving, but the encoded fourth bit set still needs to be sent to the first interleaving process; for example, as shown in Figure 11(b), the second and third bit sets undergo pre-coding interleaving, and the encoded fourth bit set needs to be sent to the first interleaving process for scrambling.

[1293] It should be noted that, in some specific applications, the second bit set and the third bit set undergo pre-coding interleaving, and the encoded fourth bit set is also sent to the first interleaving process for scrambling. When certain first bit subsets in the encoded fourth bit set already satisfy the pattern shown in Figure 9(a) or Figure 9(b), the first interleaving process may only scramble the order of the remaining first bit subsets that do not satisfy the pattern shown in Figure 9(a) or Figure 9(b), so that all second bit subsets in the fifth bit set after the encoded fourth bit set undergoes the first interleaving process satisfy the pattern shown in Figure 9(a) or Figure 9(b). In other words, the first interleaving process may interleave some of the bits in the fourth bit set, which is not specifically limited here. Optionally, in some scenarios, if certain first bit subsets in the encoded fourth bit set already satisfy the pattern shown in Figure 9(a) or Figure 9(b), the first interleaving process may still be performed on all first bit subsets, as long as all second bit subsets in the fifth bit set after the first interleaving process satisfy the pattern shown in Figure 9(a) or Figure 9(b).

[1294] Several implementation schemes of pre-coding interleaving and corresponding first interleaving are given below.

[1295] Figure 21 is a schematic diagram of another embodiment of PCS and FEC encoding in an embodiment of the present application. As shown in Figure 21, the second bit set and the third bit set are first interleaved before encoding to obtain the sixth bit set, and then the sixth bit set is FEC encoded to obtain the fourth bit set. The sixth bit set includes m3 third bit subsets, and the m3 third bit subsets are distributed in 2 rows and m4 columns, where m3 = 2×m4, and m3 is an integer greater than 1 and less than m0. Each third bit subset in a portion of the third bit subsets includes F0 bits, and each third bit subset in another portion of the third bit subsets includes F2 bits, where F2 is an even number greater than 1 and less than F0.

[1296] It should be understood that the concept of "the sixth bit set includes m3 third-bit subsets, and the m3 third-bit subsets are distributed in 2 rows and m4 columns" is introduced for the convenience of description. In actual applications, the sixth bit set is a whole and there is no distribution of "2 rows and m4 columns". Each third-bit subset can be regarded as multiple bits in the sixth bit set.

[1297] FIG. 22 is a schematic diagram of the sixth bit set in an embodiment of the present application. As an example, the sixth bit set includes m3 = 14 third-bit subsets. In some application scenarios, the m3 third-bit subsets in the above sixth bit set may specifically be presented in the form of a bit square block, and the bit square block may also be simply referred to as a square block. Each third-bit subset can be called a bit square block I. As shown in FIG. 22 for example, m3 = 14 bit square blocks I are distributed in 2 rows and 7 columns. For simplicity of description, represents the bit square block I at the i0-th row and j0-th column of the sixth bit set. When 0 ≤ i0 < 2 and 0 ≤ j0 < 6, contains F0 = 256 bits, arranged in 16 rows and 16 columns, while I 0,6 and I 1,6 respectively contain F2 = 240 bits, arranged in 16 rows and 15 columns.

[1298] It should be understood that the above 2 rows and m4 columns of bit square blocks I are also called the input blocks of the FEC encoding in some specific scenarios, where m3 = 2 × m4. It should also be understood that the above 2 rows and m4 columns of bit square blocks I can also be considered as a bit matrix with 32 rows and m3 × 8 - 1 columns. It contains 32 rows, and each row contains m3 × 8 - 1 bits. Then the bit at the r0-th row and c0-th column of the bit matrix corresponds to the bit at the i1-th row and j1-th column of the bit square block where i1 = r0 % 16, j1 = c0 % 16, 0 ≤ r0 < 32, 0 ≤ c0 < m2 × 8 - 1, 0 ≤ i0 < 2, 0 ≤ j0 < 7, 0 ≤ i1 < 16, 0 ≤ j1 < 16. In the present application, in some cases, one row represents 8 bit square blocks, in some cases, one row represents a total of 16 bits in one row of the bit square block, and in some cases, one row represents a total of m3 × 8 - 1 bits in one row of the set composed of m3 bit square blocks. It can be understood according to the context to distinguish specific situations.

[1299] In some specific applications, as shown in FIG. 22, the square block at the i0-th row and j0-th column (0 ≤ i0 < 2 and 0 ≤ j0 < 6) Contains bits 512×j0+256×i0 to 512×j0+256×i0+255 in the sixth bit set. 0,0 Contains bits 0 to 255 in the sixth bit set. For another example, the matrix I 1,0 Contains the 256th to 511th bits in the sixth bit set. 0,6 and Matrix I 1,6 Both have 16 rows and 15 columns, and contain the 3072th bit to the 3311th bit in the sixth bit set and the 3312th bit to the 3551st bit in the sixth bit set respectively.

[1300] FIG23(a) is a schematic diagram of the first distribution of the sixth bit set in the embodiment of the present application. As shown in FIG23(a), taking m2=14 as an example, the bit matrix I in the sixth bit set is 0,0 , I 0,1 , I 0,4 , I 0,5 , I 1,0 , I 1,1 , I 1,4 , I 1,5 A total of 2048 bits come from the second bit set. Bit matrix I 0,2 , I 0,3 , I 0,6 , I 1,2 , I 1,3 , I 0,6 All bits come from the third bit set. The sixth bit set is then FEC-encoded to obtain the fourth bit set. The corresponding fourth bit set distribution is shown in Figure 11(b). In this scenario, the first interleaving can be performed according to any of the schemes in Examples 9-12 to obtain the fifth bit set, and any second bit subset in the fifth bit set is shown in Figure 9(a). Alternatively, the first interleaving can be performed according to any of the schemes in Examples 13-16 to obtain the fifth bit set, and any second bit subset in the fifth bit set is shown in Figure 9(b).

[1301] FIG23( b ) is a schematic diagram of the second distribution of the sixth bit set in the embodiment of the present application. As shown in FIG23( b ), taking m2=14 as an example, the bit matrix I in the sixth bit set is 0,0 , I 0,1 , I 0,2 , I 0,3 , I 1,0 , I 1,1 , I 1,2 , I 1,3Half of the bits (128 bits) in each bit matrix in comes from the second bit set, and the other half of the bits (128 bits) come from the third bit set that has not been processed by PCS. 0,4 , I 0,5 , I 1,4 , I 1,5 All bits come from the second bit set. Bit matrix I 0,6 , I 1,6 From the third set of bits that have not been PCS processed.

[1302] FIG24(a) is a schematic diagram of the third bit subset in the embodiment of the present application. FIG24(b) is another schematic diagram of the third bit subset in the embodiment of the present application. Based on the sixth bit set shown in FIG23(b), further, the bit matrix I 0,0 , I 0,1 , I 0,2 , I 0,3 , I 1,0 , I 1,1 , I 1,2 , I 1,3 Satisfies the pattern shown in Figure 24(a), that is, the bit matrix Row i1 The column bits come from the second bit set shown, and the bit matrix The other bits of come from the third bit set that has not been processed by PCS, 0≤i0<2, 0≤j0<4, 0≤i1<16, 0≤j1<8;. Or, the bit matrix I 0,0 , I 0,1 , I 0,2 , I 0,3 , I 1,0 , I 1,1 , I 1,2 , I 1,3 Satisfies the pattern shown in Figure 24(b), that is, the bit matrix The bit in row i1 and column (j1×2) comes from the second bit set shown, and the bit matrix The other bits of come from the third bit set that has not been processed by PCS, 0≤i0<2, 0≤j0<4, 0≤i1<16, 0≤j1<8.

[1303] FIG11(c) is another schematic diagram of the distribution of multiple first bit subsets in the embodiment of the present application. Based on the sixth bit set shown in FIG23(b), the fourth bit set is obtained by FEC coding, and the corresponding fourth bit set distribution is shown in FIG11(c). Specifically, the bit matrix B 0,0 、B 0,1 、B 0,2 、B 0,3 、B 1,0、B 1,1 、B 1,2 、B 1,3 Half of the bits (128 bits) in each bit matrix in B come from the second bit set, and the other half of the bits (128 bits) come from the third bit set that has not been processed by PCS. 0,4 、B 0,5 、B 1,4 、B 1,5 All bits come from the second bit set. Bit matrix B 0,6 、B 0,7 、B 1,6 、B 1,7 The third bit set and / or OFEC check bits are from the third bit set that has not been processed by PCS. Further, the bit matrix B in the fourth bit set 0,0 、B 0,1 、B 0,2 、B 0,3 、B 1,0 、B 1,1 、B 1,2 、B 1,3 The bit arrangement of satisfies FIG9 (a) or FIG9 (b). Specifically, when the bit matrix I of the sixth bit set 0,0 , I 0,1 , I 0,2 , I 0,3 , I 1,0 , I 1,0 , I 1,2 , I 1,3 As shown in Figure 24(a), the bit matrix B of the fourth bit set is 0,0 、B 0,1 、B 0,2 、B 0,3 、B 1,0 、B 1,1 、B 1,2 、B 1,3 As shown in Figure 9(a). When the bit matrix I of the sixth bit set 0,0 , I 0,1 , I 0,2 , I 0,3 , I 1,0 , I 1,1 , I 1,2 , I 1,3 As shown in Figure 24(b), the bit matrix B of the fourth bit set is 0,0 、B 0,1 、B 0,2 、B 0,3 、B 1,0 、B 1,1 、B 1,2 、B 1,3As shown in Figure 9(b). In this scenario, the first interleaving only needs to be done on the bit matrix B in the fourth bit set. 0,4 、B 0,5 、B 0,6 、B 0,7 、B 1,4 、B 1,5 、B 1,6 、B 1,7 A total of 8 bit matrices are interleaved for the first time to obtain the bit matrix T in the fifth bit set 0,4 、T 0,5 、T 0,6 、T 0,7 、T 1,4 、T 1,5 、T 1,6 、T 1,7 , and B 0,0 、B 0,1 、B 0,2 、B 0,3 、B 1,0 、B 1,1 、B 1,2 、B 1,3 Output the bit matrix B in the fifth bit set in the original order 0,0 、B 0,1 、B 0,2 、B 0,3 、B 1,0 、B 1,1 、B 1,2 、B 1,3 .

[1304] Take Figure 11(c) as an example, and the bit matrix B of the fourth bit set 0,0 、B 0,1 、B 0,2 、B 0,3 、B 1,0 、B 1,1 、B 1,2 、B 1,3 As shown in FIG9(a), a specific interleaving rule of the first interleaving process is as follows: bits 0 to 63 of the 128 bits in the r1th row of the fifth bit set (including m0 bit matrix T) correspond one-to-one with bits 0 to 63 of the r0th row of the fourth bit set. And bits 1 to 63 of the 128 bits in the r1th row of the fifth bit set correspond one-to-one with bits 1 to 63 of the r0th row of the fourth bit set. The bit is from the 64th to 95th bit in the r0th row of the fourth bit set (including m0 bit matrix B), where Several more specific examples are provided below.

[1305] Example 17: When 0≤c1<64, the c1th bit in the 128 bits in the r1th row of the fifth bit set comes from the c1th bit in the 128 bits in the r0th row of the fourth bit set. When 64≤c1<128, the c1th bit in the 128 bits in the r1th row of the fifth bit set comes from the c0th bit in the 128 bits in the r0th row of the fourth bit set.

[1306] Among them, 64≤c0<128, 64≤c1<128, θ is an integer multiple of 4, and m0×4 is divisible by θ, Δ is an integer, and β is an integer multiple of 4.

[1307] Example 18: When 0≤c1<64, the c1th bit in the 128 bits in the r1th row of the fifth bit set comes from the c1th bit in the 128 bits in the r0th row of the fourth bit set. When 64≤c1<128, the c1th bit in the 128 bits in the r1th row of the fifth bit set comes from the c0th bit in the 128 bits in the r0th row of the fourth bit set.

[1308] Among them, 64≤c0<128, 64≤c1<128, θ is an integer multiple of 4, and m0×4 is divisible by θ, Δ is an integer, and β is an integer multiple of 4.

[1309] Example 19: When 0≤c1<64, the c1th bit in the 128 bits in the r1th row of the fifth bit set comes from the c1th bit in the 128 bits in the r0th row of the fourth bit set. When 64≤c1<128, the c1th bit in the 128 bits in the r1th row of the fifth bit set comes from the c0th bit in the 128 bits in the r0th row of the fourth bit set.

[1310] Among them, 64≤c0<128, 64≤c1<128, θ is an integer multiple of 4, and m0×4 is divisible by θ, Δ is an integer, and β is an integer multiple of 4.

[1311] Example 20: When 0≤c1<64, the c1th bit in the 128 bits in the r1th row in the fifth bit set comes from the c1th bit in the 128 bits in the r0th row in the fourth bit set; when 64≤c1<1285, the c1th bit in the 128 bits in the r1th row in the fifth bit set comes from the c0th bit in the 128 bits in the r0th row in the fourth bit set.

[1312] Among them, 64≤c0<128, 64≤c1<128, θ is an integer multiple of 4, and m0×4 is divisible by θ, Δ is an integer, and β is an integer multiple of 4.

[1313] FIG23( c ) is a schematic diagram of the third distribution of the sixth bit set in the embodiment of the present application. As shown in FIG23( c ), the bit matrix I in the sixth bit set 0,0 , I 0,1 , I 0,2 , I 0,3 , I 0,4 , I 1,0 , I 1,1 , I 1,2 , I 1,3 , I 1,4 Half of the bits (128 bits) in each bit matrix in comes from the second bit set, and the other half of the bits (128 bits) come from the third bit set that has not been processed by PCS. 0,5 , bit matrix I 1,5 , bit matrix I 0,6 Columns 0 to 7 and bit matrix I 1,6 All bits from column 0 to column 7 of come from the second bit set. Bit matrix I 0,6 Columns 8 to 14 and bit matrix I 1,6 The bits shown in the 8th to 14th columns of are from the third bit set that has not been processed by PCS. 0,0 , I 0,1 , I 0,2 , I 0,3 , I 0,4 , I 1,0 , I 1,1 , I 1,2 , I 1,3 , I 1,4 All of them satisfy the pattern shown in Figure 24(a), that is, the bit matrix Row i1 The column bits come from the second bit set shown, and the bit matrix The other bits of the bit matrix I are from the third bit set processed by PCS, 0≤i0<2, 0≤j0<5, 0≤i1<16, 0≤j1<8;. 0,0 , I 0,1 , I 0,2 , I 0,3 , I 0,4 , I 1,0 , I 1,1 , I 1,2 , I 1,3, I 1,4 All of them satisfy the pattern shown in Figure 24(b), that is, the bit matrix The bit in row i1 and column (j1×2) comes from the second bit set shown, and the bit matrix The other bits of come from the third bit set processed by PCS, 0≤i0<2, 0≤j0<5, 0≤i1<16, 0≤j1<8.

[1314] Figure 11(d) is another schematic diagram of the distribution of multiple first bit subsets in the embodiment of the present application. Based on the sixth bit set shown in Figure 23(c), the fourth bit set is obtained through FEC coding. The corresponding fourth bit set distribution is shown in Figure 11(d), specifically, the bit matrix B in the fourth bit set 0,0 、B 0,1 、B 0,2 、B 0,3 、B 0,4 、B 1,0 、B 1,1 、B 1,2 、B 1,3 、B 1,4 Half of the bits (128 bits) in each bit matrix in B come from the second bit set, and the other half of the bits (128 bits) come from the third bit set that has not been processed by PCS. 0,5 , bit matrix B 1,5 and bit matrix B 0,6 , bit matrix B 1,6 All the shaded bits in are from the second bit set. 0,5 , bit matrix B 0,6 The non-shaded bits and bit matrix B 0,7 , bit matrix B 1,7 All bits of come from the third bit set and / or OFEC check bits that have not been processed by PCS. Further, the bit matrix B in the fourth bit set 0,0 、B 0,1 、B 0,2 、B 0,3 、B 0,4 、B 1,0 、B 1,1 、B 1,2 、B 1,3 、B 1,4 The arrangement of the bits from the second bit set and the bits from the third bit set that have not been processed by PCS satisfies the arrangement shown in FIG9(a) or FIG9(b). Specifically, when the bit matrix I of the sixth bit set 0,0 , I 0,1 , I 0,2 , I 0,3 , I0,4 , I 1,0 , I 1,1 , I 1,2 , I 1,3 , I 1,4 As shown in Figure 24(a), the bit matrix B of the fourth bit set is 0,0 、B 0,1 、B 0,2 、B 0,3 、B 0,4 、B 1,0 、B 1,1 、B 1,2 、B 1,3 、B 1,4 As shown in Figure 9(a). When the bit matrix I of the sixth bit set 0,0 , I 0,1 , I 0,2 , I 0,2 , I 0,4 , I 1,0 , I 1,1 , I 1,2 , I 1,3 , I 1,4 As shown in Figure 24(b), the bit matrix B of the fourth bit set is 0,0 、B 0,1 、B 0,2 、B 0,3 、B 0,4 、B 1,0 、B 1,1 、B 1,2 、B 1,3 、B 1,4 As shown in Figure 9(b). In this scenario, the first interleaving only needs to be done on the fourth bit set B 0,5 、B 0,6 、B 0,7 、B 1,5 、B 1,6 、B 1,7 A total of 6 bit matrices are interleaved for the first time to obtain the fifth bit set T 0,5 、T 0,6 、T 0,7 、T 1,5 、T 1,6 、T 1,7 , and B 0,0 、B 0,1 、B 0,2 、B 0,3 、B 0,4 、B 1,0 、B 1,1 、B 1,2 、B 1,3 、B 1,4Output the bit matrix T in the fifth bit set in the original order 0,0 、T 0,1 、 T 0,2 、B 0,3 、T 0,4 、T 1,0 、T 1,1 、T 1,2 、T 1,3 、T 1,4 .

[1315] Take Figure 11(d) as an example, and the bit matrix B of the fourth bit set 0,0 、B 0,1 、B 0,2 、B 0,3 、B 0,4 、B 1,0 、B 1,1 、B 1,2 、B 1,3 、B 1,4 As shown in FIG9(a), a specific interleaving rule of the first interleaving process is as follows: bits 0 to 79 of the 128 bits in the r1th row of the fifth bit set (including m0 bit matrix T) correspond one-to-one with bits 0 to 79 of the r0th row of the fourth bit set (including m0 bit matrix B). When the fifth bit set (including m0 bit matrix T) has the 128 bits in the r1th row, The bit comes from any one of the bits from bit 80 to bit 103 in row r0 of the fourth bit set (including m0 bit matrix B). When the fifth bit set (including m0 bit matrix T) has the 128 bits in the r1th row, The bit comes from any one of the 80th to 95th bits and the 104th to 111th bits in the r0th row of the fourth bit set (including m0 bit matrix B). Several more specific examples are provided below.

[1316] Example 21: When 0≤c1<80, the c1th bit in the 128 bits in the r1th row of the fifth bit set comes from the c1th bit in the 128 bits in the r0th row of the fourth bit set. When 80≤c1<128, the c1th bit in the 128 bits in the r1th row of the fifth bit set comes from the 80+c0th bit in the 128 bits in the r0th row of the fourth bit set. Wherein, 0≤c0<48, 80≤c1<128, θ is an integer multiple of 4, 48 is divisible by θ, Δ is an integer, and β is an integer multiple of 4.

[1317] Example 22: When 0≤c1<80, the c1th bit in the 128 bits in the r1th row in the fifth bit set comes from the c1th bit in the 128 bits in the r0th row in the fourth bit set; when 80≤c1<128, the c1th bit in the 128 bits in the r1th row in the fifth bit set comes from the 80+c0th bit in the 128 bits in the r0th row in the fourth bit set. Where, 0≤c0<48, 80≤c1<127, θ is an integer multiple of 4, and 48 is divisible by θ, Δ is an integer, and β is an integer of 4.

[1318] FIG23( d ) is a schematic diagram of the fourth distribution of the sixth bit set in the embodiment of the present application. As shown in FIG23( d ), the bit matrix I in the sixth bit set 0,0 , I 0,1 , I 0,2 , I 0,3 , I 0,4 , I 1,0 , I 1,1 , I 1,2 , I 1,3 , I 1,4 Half of the bits (128 bits) in each bit matrix come from the second bit set, and the other half of the bits (128 bits) come from the third bit set that has not been processed by PCS. 0,5 and I 1,5 Each row has 9 bits from the second bit set that has been processed by PCS, and the other 7 bits in each row come from the third bit set that has not been processed by PCS. 0,6 and I 1,6 All bits in are from the second set of bits processed by PCS.

[1319] FIG11(e) is another schematic diagram of the distribution of multiple first bit subsets in an embodiment of the present application. Based on the sixth bit set shown in FIG23(d), the fourth bit set is obtained through FEC coding, and the corresponding fourth bit set distribution is shown in FIG11(e). Specifically, the bit matrix B in the fourth bit set is 0,0 、B 0,1 、B 0,2 、B 0,3 、B 0,4 、B 1,0 、B 1,1 、B 1,2 、B 1,3 、B 1,4Half of the bits (128 bits) in each bit matrix come from the second bit set, and the other half of the bits (128 bits) come from the third bit set that has not been processed by PCS. 0,5 and B 1,5 Each row has 9 bits from the second bit set that has been processed by PCS, and the other 7 bits in each row come from the third bit set that has not been processed by PCS. 0,6 and B 1,6 The bits in row i1 and column 15-i1 of each column are from OFEC check bits, 0≤i1≤15, that is, the bit matrix B 0,6 and B 1,6 The bits on the off-diagonal come from OFEC check bits, while the other bits come from the second bit set processed by PCS. 0,7 and B 1,7 All bits of come from OFEC check bits.

[1320] Furthermore, the bit matrix B in the fourth bit set shown in FIG11(e) 0,0 、B 0,1 、B 0,2 、B 0,3 、B 0,4 、B 1,0 、B 1,1 、B 1,2 、B 1,3 、B 1,4 The arrangement of the bits from the second bit set and the bits from the third bit set in FIG11(a) or FIG11(b) is shown in FIG11(e). 0,5 and B 1,5 The bits from the second bit set and the bits from the third bit set in columns 0 to C-1 are arranged as shown in columns 0 to C-1 of FIG. 9( a ) or columns 0 to C-1 of FIG. 9( b ). In this case, for B in the fourth bit set 0,5 Columns C to 15, B 0,6 、B 0,7 、B 1,5 Columns C to 15, B 1,6 and B 1,7 Perform the first interleaving to obtain T in the fifth bit set 0,5 Columns C to 15 of T 0,6 、T 0,7 、T 1,5 Columns C to 15 of T 1,6 and T 1,7 , where 0≤C≤15. Several specific first interleaving schemes are introduced below.

[1321] In a possible implementation, based on the sixth bit set shown in FIG. 23( d ), if the bit matrix I of the sixth bit set is 0,0 , I 0,1 , I 0,2 , I 0,3 , I 0,4 , I 1,0 , I 1,1 , I 1,2 , I 1,3 , I 1,4 As shown in Figure 24(a), the bit matrix B of the fourth bit set is 0,0 、B 0,1 、B 0,2 、B 0,3 、B 0,4 、B 1,0 、B 1,1 、B 1,2 、B 1,3 、B 1,4 As shown in Figure 9(a). If the bit matrix I of the sixth bit set 0,5 and I 1,5 As shown in Figure 29(a), the bit matrix B in the fourth bit set is 0,5 、B 1,5 As shown in Figure 30(a), the four shaded areas marked in Figure 29(a) are all 4×4 bit matrices. Three bits in each row of each 4×4 bit matrix come from the second bit set that has undergone PCS processing, and the remaining bit in each row comes from the third bit set that has not undergone PCS processing. The shaded areas marked in Figure 30(a) are the 16-row, 4-column bit matrix from columns 12 to 15. Three bits in each row of this 16-row, 4-column bit matrix come from the second bit set that has undergone PCS processing, and the remaining bit in each row comes from the third bit set that has not undergone PCS processing.

[1322] Furthermore, if the bit matrix I of the sixth bit set 0,5 and I 1,5 As shown in FIG29(b), FIG29(c), or FIG29(d) or FIG29(e), the bit matrix B in the fourth bit set is 0,5 and B 1,5 The corresponding figures are shown in FIG30( b ), FIG30( c ), FIG30( d ) or FIG30( e ) respectively.

[1323] In the above scenario, for the fourth bit set B 0,5 Columns 12 to 15 of B 0,5 、B 0,7 、B 1,5 Columns 12 to 15 of B 1,6 and B 1,7Perform the first interleaving to obtain T in the fifth bit set 0,5 Columns 12 to 15 of T 0,6 、T 0,7 、T 1,5 Columns 12 to 15 of T 1,6 and T 1,7 . And in the fourth bit set B 0,0 、B 0,1 、B 0,2 、B 0,3 、B 0,4 、B 1,0 、B 1,1 、B 1,2 、B 1,3 and B 1,4 Output in the original order to obtain the fifth bit set T 0,0 、T 0,5 、T 0,2 、T 0,3 、T 0,4 、T 1,0 、T 1,1 、T 1,2 、T 1,3 and T 1,4 The bit matrix B in the fourth bit set 0,5 Columns 0 to 11 and the bit matrix B 1,5 The 0th to 11th columns of the bit matrix T in the fifth bit set are output in the original order. 0,5 Columns 0 to 11 and the bit matrix T 1,5 Column 0 to Column 11 of the 5th bit set. After the first interleaving, each bit matrix of the 5th bit set is shown in FIG9(a), that is, the i2th row and the i2th column of each bit matrix of the 5th bit set are The bits of the column come from the second bit set, 0≤i²<16, 0≤j²<8. A specific interleaving rule for the corresponding first interleaving is as follows: bits 92 through 127 of the 128 bits in the r1th row of the fifth bit set of the m0 bit matrix T come from bits 92 through 127 of the r0th row of the fourth bit set of the m0 bit matrix B. In addition, there are many other specific interleaving rules for the first interleaving, which are not listed here one by one.

[1324] In another possible implementation, based on the sixth bit set shown in FIG. 23( d ), if the bit matrix I of the sixth bit set is 0,0 , I 0,1 , I 0,2 , I 0,3 , I 0,4 , I 1,0 , I 1,1, I 1,2 , I 1,3 , I 1,4 As shown in Figure 24(b), the bit matrix B of the fourth bit set is 0,0 、B 0,1 、B 0,2 、B 0,3 、B 0,4 、B 1,0 、B 1,1 、B 1,2 、B 1,3 、B 1,4 As shown in Figure 9(b). If the bit matrix I of the sixth bit set 0,5 and I 1,5 As shown in Figure 29(f), the bit matrix B in the fourth bit set is 0,5 and B 1,5 As shown in Figure 30(f). In this scenario, for the fourth bit set B 0,5 Columns 14 to 15, B 0,6 、B 0,7 、B 1,5 Columns 14 to 15, B 1,6 and B 1,7 Perform the first interleaving to obtain T in the fifth bit set 0,5 Columns 14 to 15 of T 0,6 、T 0,7 、T 1,5 Columns 14 to 15 of T 1,6 and T 1,7 . And in the fourth bit set B 0,0 、B 0,1 、B 0,2 、B 0,3 、B 0,4 、B 1,0 、B 1,1 、B 1,2 、B 1,3 and B 1,4 Output the bit matrix T in the fifth bit set in the original order 0,0 、T 0,1 、T 0,2 、B 0,3 、T 0,4 、T 1,0 、T 1,1 、T 1,2 、T 1,3 and T 1,4 The bit matrix B in the fourth bit set 0,5 Columns 0 to 13 and the bit matrix B 1,5 The 0th to 13th columns are output in the original order to obtain the special square matrix T in the fifth bit set.0,5 Columns 0 to 13 and the bit matrix T 1,5 Columns 0 to 13 of . After the first interleaving, each bit matrix of the fifth bit set is shown in FIG9( b ), that is, the bits in the i2-th row and the (j2×2-i2%2+1)-th column of each bit matrix come from the second bit set, 0≤i2<16, 0≤j2<8. At this time, a specific interleaving rule of the corresponding first interleaving is as follows: bits 94 to 127 of the 128 bits in the r1-th row of the fifth bit set including m0 bit matrix T come from bits 94 to 127 of the r0-th row of the fourth bit set including m0 bit matrix B. In addition, there are many other specific interleaving rules for the first interleaving, which are not listed here one by one.

[1325] It should be noted that in some specific scenarios, r0=r1 may be satisfied.

[1326] Figure 12 is a schematic diagram of a second implementation of the first interleaving process in an embodiment of the present application. As shown in Figure 12, in one possible implementation, the 16 bits per row in the second bit subset come from two first bit subsets. Furthermore, 8 of the 16 bits per row in the second bit subset come from one row of one of the first bit subsets, and the remaining 8 of the 16 bits per row in the second bit subset come from one row of the other first bit subset.

[1327] FIG13 is a schematic diagram of a third implementation of the first interleaving process in an embodiment of the present application. As shown in FIG13 , in one possible implementation, the m0×256 bits in the fourth bit set are distributed as 32 rows and m0×8 columns, the m0×256 bits in the fifth bit set are distributed as 32 rows and m0×8 columns, and the 32 bits in each column of the fifth bit set come from two first bit subsets. More specifically, 16 of the 32 bits in each column of the fifth bit set come from one column of one of the first bit subsets, and the other 16 of the 32 bits in each column of the fifth bit set come from one column of another first bit subset. Further, 16 of the 32 bits in each column of the fifth bit set come from the c1%16th column of one of the first bit subsets, and the other 16 of the 32 bits in each column of the fifth bit set come from the c1%16th column of another first bit subset, where 0≤c1<(m0×8).

[1328] (3) Second interleaving process:

[1329] Specifically, taking the OFEC interleaving as an example, the OFEC interleaver receives bits output by two first interleaving processors and performs intra-block interleaving and inter-block interleaving.

[1330] Figure 14 is a schematic diagram of intra-block interleaving in an embodiment of the present application. As shown in Figure 14, the OFEC interleaver first performs "intra-block interleaving" on each received matrix, that is, each input matrix of 16 rows and 16 columns is interleaved and disrupted in order according to the interleaving rules shown in Figure 14 to obtain an output matrix of 16 rows and 16 columns. The element of the i1th row and j1th column (0≤i1<16 and 0≤j1<16) in Figure 14 is (a, b), which means that the bits of the i1th row and j1th column in the output matrix after "intra-block interleaving" come from the bits of the ath row and bth column in the input matrix. For example, the element of the 1st row and 0th column in Figure 14 is (14,15), then the bits of the 1st row and 0th column in the output matrix after "intra-block interleaving" come from the bits of the 14th row and 15th column in the input matrix.

[1331] After the intra-block interleaving process, the bits undergo inter-block interleaving to improve overall burst resistance. The inter-block interleaving operation is described below.

[1332] Figure 15 is a schematic diagram of inter-matrix interleaving in an embodiment of the present application. As shown in Figure 15, inter-matrix interleaving includes an interleaver buffer M with 84 rows and 8 columns, each row includes 8 matrices, and each matrice includes 16 rows and 16 columns, totaling 256 bits. The interleaving buffer size of inter-matrix interleaving is 84×8×256=172032 bits, corresponding to 172032 / 4096=42 output packets of the first interleaving processors, of which 21 output packets come from the output packets of one of the first interleaving processors and are located in the even rows of the interleaving buffer M, and the other 21 output packets come from the output packets of another first interleaving processor and are located in the odd rows of the interleaving buffer M. Here, the output packet of each first interleaving processor is a set of 2 rows and 8 columns of matrices, totaling 4096 bits. The interleaving buffer M for interleaving between square matrices can be divided into four sets, as shown in Figure 15. The 0th set contains the square matrices of rows 0, 2, 4, ..., 40 in the interleaving buffer M, totaling 21×16×128=43008 bits. The first set contains the square matrices of rows 1, 3, 5, ..., 41 in the interleaving buffer M, totaling 43008 bits. The second set contains the square matrices of rows 42, 44, 46, ..., 82 in the interleaving buffer M, totaling 43008 bits. The third set contains the square matrices of rows 43, 45, 47, ..., 83 in the interleaving buffer M, totaling 43008 bits.

[1333] From the interleaved buffer M, with a granularity of 8 bits, polling is performed to read the bits in each column from each set. After reading all the bits in each column, the bits in the next column are read. First, the first group of 8 bits are read from the 0th set from top to bottom, and then the first 8 bits are read from the 1st set, the 2nd set, and the 3rd set from top to bottom, respectively. A total of 32 bits are read in one cycle. Then, the next cycle reads the next group of 8 bits from the 0th set, the 1st set, the 2nd set, and the 3rd set from top to bottom, respectively, for a total of 32 bits. After a total of 42 cycles, the 1344 bits of the current column are read out. For reading the bits in each column from each set, the specific operations are as follows:

[1334] First, read 8 bits from the 0th row of the interleaved buffer M from top to bottom (bit rows 0-7 in the matrix).

[1335] Read 8 bits from the first row of the matrix in the interleaving buffer M from top to bottom (bit rows 0-7 in the matrix),

[1336] Read 8 bits from the 42nd row of the matrix in the interleaving buffer M from top to bottom (bit rows 0-7 in the matrix),

[1337] Read 8 bits from the 43rd row of the matrix in the interleaving buffer M from top to bottom (bit rows 0-7 in the matrix),

[1338] Then read 8 bits from the 0th row of the matrix in the interleaving buffer M from top to bottom (the 8th to 15th bit rows in the matrix),

[1339] Read 8 bits from the first row of the matrix in the interleaving buffer M from top to bottom (bit rows 8-15 in the matrix),

[1340] Read 8 bits from the 42nd row of the matrix in the interleaving buffer M from top to bottom (bit rows 8-15 in the matrix),

[1341] Read 8 bits from the 43rd row of the interleaving buffer M from top to bottom (bit rows 8-15 in the matrix),

[1342] Then read 8 bits from the second row of the matrix in the interleaving buffer M from top to bottom (bit rows 0-7 in the matrix),

[1343] ..., until a total of 1344 bits in the current bit column in the interleaving buffer M are completely read out.

[1344] (4) Symbol mapping and polarization division:

[1345] The bit data output by OFEC interleaving is sent to symbol mapping and polarization division to obtain dual polarization symbols. As shown in Figure 4, two OFEC interleavers, OFEC interleaver 0 and OFEC interleaver 1, take 8 bits as a group and poll them into symbol mapping. For dual polarization 16QAM modulation (DP-16QAM), symbol mapping and polarization division divide every 8 bits (b0, b1, b2, b3, b4, b 5, b6, b7) are mapped to obtain one DP-16QAM symbol. Consider the following first symbol mapping scheme: (b0, b2) is mapped to the in-phase component of the DP-16QAM symbol on the X polarization, denoted as XI; (b4, b6) is mapped to the quadrature-phase component of the DP-16QAM symbol on the X polarization, denoted as XQ; (b1, b3) is mapped to the in-phase component of the DP-16QAM symbol on the Y polarization, denoted as YI; (b5, b7) is mapped to the quadrature-phase component of the DP-16QAM symbol on the Y polarization, denoted as YQ. For each signaling dimension XI / XQ / YI / YQ, two bits are mapped to the corresponding symbol amplitude using the following mapping: (0, 0) → -3, (0, 1) → -1, (1, 1) → +1, (1, 0) → +3

[1346] At this time, b0 and b4 of the 8 bits (b0, b1, b2, b3, b4, b5, b6, b7) are two sign bits (sign bits) in the 16QAM in the X polarization direction, b2 and b6 are two amplitude bits (amplitude bits) in the 16QAM in the X polarization direction; b1 and b5 are two sign bits (sign bits) in the 16QAM in the Y polarization direction, b3 and b7 are two amplitude bits (amplitude bits) in the 16QAM in the Y polarization direction.

[1347] It should be noted that, using the first interleaving process shown in FIG9(a), any one of the 2-row and 8-column bit matrix sets T outputted contains 256 bits. In row i2, The bit of the column (ie, the bit with a shaded background in FIG9( a )) is one bit from the 2048 third bits obtained after PCS processing, where 0≤i 2 <16 and 0≤j 2 <8.

[1348] FIG16 is another schematic diagram of interweaving in a square matrix according to an embodiment of the present application. As shown in FIG16 , a square matrix is ​​provided. After the intra-square interleaving, the intra-square interleaved matrix is ​​obtained. After the intra-square interleaving in OFEC interleaving, in any 16-row, 16-column square matrix output by the first interleaving process, the 16 bits in each of the 2nd, 3rd, 6th, 7th, 10th, 11th, 14th, and 15th rows are all from the 2048 third bits obtained by PCS processing.

[1349] Because inter-matrix interleaving does not disrupt the bit order within the matrix, after OFEC interleaving, the 16 bits in the second, third, sixth, seventh, tenth, eleventh, fourteenth, or fifteenth rows of any 16-row, x 16-column matrix output are all derived from the 2048 third bits obtained through PCS processing. Furthermore, the aforementioned first symbol mapping and polarization division can change the probability of constellation point occurrence while maintaining the constellation point position, resulting in a non-uniform distribution, thereby implementing PCS and improving system transmission performance.

[1350] It should be noted that, in some specific embodiments, the symbol mapping and polarization division map every 8 bits (b0, b1, b2, b3, b4, b5, b6, b7) to obtain one DP-16QAM symbol. Consider the following second symbol mapping scheme: (b0, b1) is mapped to the I-phase component (in-phase component) of the DP-16QAM symbol on the X polarization, denoted as XI; (b2, b3) is mapped to the Q-phase component (quadrature-phase component) of the DP-16QAM symbol on the X polarization, denoted as XQ; (b4, b5) is mapped to the I-phase component (in-phase component) of the DP-16QAM symbol on the Y polarization, denoted as YI; (b6, b7) is mapped to the Q-phase component (quadrature-phase component) of the DP-16QAM symbol on the Y polarization, denoted as YQ. For each signaling dimension XI / XQ / YI / YQ, two bits are mapped to the corresponding symbol amplitude using the following mapping: (0, 0) → -3, (0, 1) → -1, (1, 1) → +1, (1, 0) → +3

[1351] At this time, b0 and b2 of the 8 bits (b0, b1, b2, b3, b4, b5, b6, b7) are two sign bits (sign bits) in the 16QAM in the X polarization direction, b1 and b3 are two amplitude bits (amplitude bits) in the 16QAM in the X polarization direction; b4 and b6 are two sign bits (sign bits) in the 16QAM in the Y polarization direction, and b5 and b7 are two amplitude bits (amplitude bits) in the 16QAM in the Y polarization direction.

[1352] It should be noted that, using the first interleaving process shown in FIG9( b ), any one of the 2-row and 8-column bit matrix sets T outputted contains 256 bits. The bit at row i2 and column (j2×2-i2%2+1) in the matrix (i.e., the bit with shaded background in Figure 9(b)) is one of the 2048 third bits obtained after PCS processing, where 0≤i2<16 and 0≤j2<8. After the "intra-square interleaving", the interleaved matrix is ​​obtained. After the "intra-square interleaving" in OFEC interleaving, in any 16-row 16-column square matrix output by the first interleaving process, the 16 bits in each row of the 1st, 3rd, 5th, 7th, 9th, 11th, 13th and 15th rows are all from the 2048 third squares obtained by PCS processing.

[1353] Because "inter-matrix interleaving" does not disrupt the bit order within the matrix, after OFEC interleaving, in any 16-row, 16-column matrix output, the 16 bits in rows 1, 3, 5, 7, 9, 11, 13, and 15 all come from the 2048 third bits obtained after PCS processing. Furthermore, the above-mentioned second symbol mapping and polarization division can change the probability of constellation point occurrence while maintaining the constellation point position, making it non-uniformly distributed, thereby implementing PCS to improve system transmission performance.

[1354] (5) DSP framing:

[1355] The dual-polarization symbol stream after symbol mapping and polarization division respectively inserts X-polarization and Y-polarization symbols into FAW, TS, RES, and PS for DSP framing to obtain a dual-polarization symbol stream to be transmitted.

[1356] Typical DSP framing involves framing every 172,032 dual-polarization symbols to obtain 175,104 dual-polarization symbols. 175,104 dual-polarization symbols are also called a superframe, and their redundancy is

[1357] It should be noted that in some specific applications, the above-mentioned "the bit data output by OFEC interleaving is sent to symbol mapping and polarization division to obtain dual-polarization symbols; the dual-polarization symbol stream after symbol mapping and polarization division respectively inserts the X-polarization and Y-polarization symbols into FAW, TS, RES and PS for DSP framing to obtain the dual-polarization symbol stream to be transmitted" can adopt the following equivalent operation: first insert the bit data output by OFEC interleaving into the bit sequence corresponding to the FAW frame alignment symbol, TS training symbol, RES reserved symbol and PS pilot symbol before modulation mapping, and then perform symbol mapping and polarization division to obtain the same dual-polarization symbol stream to be transmitted. Its specific operation will not be further elaborated in this application.

[1358] It should be noted that the rate of a given data frame is W bitGbit / s, after the first data processing, CRC check is performed on the r rows of data obtained from the data frame, and / or padding bits are inserted, and then scrambling is performed to obtain 10280×r Frame +d CRC+PAD scrambled bits, and the corresponding scrambled rate is W×(10280×r Frame +d CP ) / (10280×r Frame )Gbit / s. The scrambled bit data undergoes PCS and OFEC encoding, first interleaving, OFEC interleaving, 16QAM symbol mapping, and polarization division, and redundancy is performed. After the second data processing of DSP framing, the baud rate obtained is W baud =W bit ×(10280×r Frame +d CP ) / (10280×r Frame )×(4096 / k)×(57 / 56) / 8Gbaud. Table 1 shows various data frame types and their corresponding nominal bit rates.

[1359] Table 1

[1360] Since the highest baud rate of typical low-power devices in the current industry is about 131Gbaud, we consider W baud Tables 2 and 3 show various parameter combinations, including the number of data rows r obtained from the data frame each time, the total number of CRC check bits and the total number of padding bits d inserted. CP , PCS processing and OFEC encoding input bit number k, PCS processing input bit number k PCS , CRC check and inserting the redundant OH corresponding to the padding bits CP , using the baud rate corresponding to the FlexO-6e, FlexO-6, FlexO-8e, and FlexO-8 data frame types. Among them, for any parameter combination given in Table 2, the baud rate corresponding to the FlexO-6e, FlexO-6, FlexO-8e, and FlexO-8 data frame types is less than 132Gbaud for at least one data frame type, and the CRC checksum and the redundant OH corresponding to the inserted padding bits are CP No more than 0.1% so that it does not affect the overall system transmission efficiency.

[1361] The number of scrambled bits output by the first data processing scr =10280×r Frame +d CPIt is an integer multiple of 4×k, which makes the specific hardware implementation of the entire data processing simpler and has lower power consumption; the number of input bits corresponding to PCS processing is k PCS =k-1504 is an integer multiple of 2, making PCS processing easy to implement in hardware and having better performance. scr The scrambled bits are processed by PCS and encoded by OFEC. scr / k×4096 OFEC coded bits, d scr / k×4096 is an integer multiple of the total size of the two OFEC interleavers (172032×2=344064), which makes the specific hardware implementation of the entire data processing simpler and lowers the power consumption.

[1362] It should be noted that, given a set of parameter combinations, that is, r in a row in Table 2 or Table 3 below Frame d CP , k, the baud rate of the corresponding FlexO-6e, FlexO-6, FlexO-8e, and FlexO-8 data frame types may be greater than 132Gbaud, indicating that the parameter combination is not suitable for the data frame type, which is marked with background shading in the table. It should be noted that for a given set of parameter combinations, that is, r in a row in Table 2 below, Frame d CP , k, the baud rate of the corresponding FlexO-6e, FlexO-6, FlexO-8e, and FlexO-8 data frame types may be less than 110Gbaud, indicating that the parameter combination is not suitable for the data frame type, which is marked with background shadow in the table. For example, for the parameter combination with sequence number 1 {r Frame =79,d CP =328, k=3224}, the baud rates of FlexO-6e, FlexO-6, FlexO-8e, and FlexO-8 data frame types are 97.6 Gbaud, 103.5 Gbaud, 130.2 Gbaud, and 136.7 Gbaud, respectively. The baud rates of FlexO-6e and FlexO-6 data frame types are less than 110 Gbaud, indicating that this parameter combination is not applicable to the FlexO-6e and FlexO-6 data frame types, which are marked with background shading in the table; the baud rate of FlexO-8 data frame type is greater than 132 Gbaud, indicating that this group of parameters is not applicable to the FlexO-8 data frame type, which are marked with background shading in the table; the baud rate of FlexO-8e data frame type is greater than 110 Gbaud and less than 132 Gbaud, indicating that this group of parameters is applicable to the FlexO-8e data frame type. For another example, for the parameter combination numbered 4 in Table 2, {r Frame=87,d CP =72, k=2662}, the baud rates of the FlexO-6e, FlexO-6, FlexO-8e, and FlexO-8 data frame types are 118.2 Gbaud, 124.1 Gbaud, 157.6 Gbaud, and 165.5 Gbaud, respectively. The baud rates of the FlexO-8e and FlexO-8 data frame types are greater than 132 Gbaud, indicating that this group of parameters is not applicable to the FlexO-8e and FlexO-8 data frame types, which are marked with background shading in the table; the baud rates of the FlexO-6e and FlexO-6 data frame types are greater than 110 Gbaud and less than 132 Gbaud, indicating that this group of parameters is applicable to the FlexO-6e and FlexO-6 data frame types.

[1363] Table 2

[1364] Table 3

[1365] It should be noted that when d scr =336×k, d scr The scrambled bits are processed by PCS and OFEC, and after the first interleaving process, we get The bits processed by the first interleaving process are exactly 172032 dual-polarization symbols after DP-16QAM symbol mapping and polarization division, and exactly one superframe is obtained after DSP framing. That is, when d scr =336×k, one superframe corresponds to r rows of data obtained from the data frame each time by the first data processing, which simplifies the data processing. scr ≠336×k, by changing F DSP superframes as a combination, so that F DSP Superframes correspond to F Frame The first data processing output d scr ×F Frame Bit, now there is d scr ×F Frame =336×k×F DSP , where F Frame and F DSP By designing the RES reserved symbol inserted in each superframe, the receiving end can identify F DSP superframes to identify F FrameThe first data processing output d scr ×F Frame The bit corresponds to the boundary.

[1366] From the above introduction to the first and second data processing, it can be seen that for future metropolitan area telecommunication transmission and metropolitan area DCI interconnection scenarios, FEC coding will be adopted in combination with PCS technology to meet longer transmission distances. The introduction of PCS processing requires that during the symbol mapping operation, the sign bits mapped to a modulation symbol are equally likely to be 0 or 1, and the amplitude bits mapped to a modulation symbol are unequally likely to be 0 or 1. Taking OFEC coding as an example, in order to minimize the impact on existing OFEC coding and OFEC interleaving, it is necessary to introduce a new interleaver after OFEC coding and before symbol mapping operations. This allows the unequally likely 0 and 1 bits obtained through PCS processing to be mapped to the amplitude bits of the modulation symbol. This achieves the goal of changing the probability of constellation points while keeping their positions unchanged, making them unevenly distributed, improving overall performance, and meeting the requirements of longer transmission distances in the future. Moreover, with the introduction of PCS processing, the information bit length for PCS processing and FEC encoding is no longer 3552, but a smaller value. At this time, it is necessary to redesign the number of rows for obtaining data from the data frame, the number of CRC checks and the number of padding bits inserted to make the overall data processing operation simpler, less complex, and lower power consumption.

[1367] The following describes several specific embodiments in combination with the above description of the first data processing and the second data processing.

[1368] Example 1:

[1369] Considering a data frame with an 800G rate, a data frame contains 512 rows, each row contains 10280 bits. Consider the 10th parameter combination {r Frame =110,d CP =848, k=3368}. The first data processing obtains r from the data frame Frame = 110 rows of data, a total of d in =10280×r Frame = 1130800 bits. Consider p = 22.

[1370] FIG17(a) is a schematic diagram of an implementation method of performing CRC on a data frame in an embodiment of the present application. As shown in FIG17(a), each OK bits for CRC-32 check, adding a total of d CRC =22×32=704 CRC check bits; then insert d PAD= 144 padding (Pad) bits, then scrambled to get d scr =10280×r Frame +d CRC +d PAD =1131648 scrambled bits. The redundancy corresponding to the CRC checksum and inserted padding bits is

[1371] As shown in Figure 4, the second data processing obtains multiple bits from the bit data stream output by the first data processing, and polls and feeds them into L = 4 PCS and OFEC codes for PCS processing and OFEC coding. As shown in Figure 5, PCS and OFEC coding converts k of the input k = 3368 bits into PCS = k-1504 = 1864 bits are sent to PCS for processing to obtain 2048 bits. k = 3368 bits including k PCS =k-1504=1864 bits and 1504 bits.

[1372] PCS processing uses LUT lookup table, each time the input K LUT = 233 bits for LUT mapping and output of corresponding n LUT = 256 bits. After the above LUT mapping is performed 8 times in succession, a total of k-1504=1864 bits are LUT mapped and the corresponding 2048 bits are output.

[1373] The 2048 bits output by the PCS processing are combined with the 1504 bits, for a total of 2048 + 1504 = 3552 bits, which are then fed into the OFEC coder for encoding and inserting 544 OFEC check bits, resulting in a total of 4096 OFEC-encoded bits, i.e., the fourth bit set. The 4096 bits are represented by a square matrix set as shown in Figure 11(a), where the 2048 bits processed by the PCS correspond to the 8-bit square matrix B shown in Figure 11(a). 0,0 、B 0,1 、B 0,2 、B 0,3 、B 1,0 、B 1,1 、B 1,2 、B 1,3 .

[1374] Perform the first interleaving process on the fourth bit set (4096 bits) to obtain the interleaved fifth bit set. The c1th bit in the 128 bits in the r1th row of the interleaved fifth bit set comes from the c0th bit in the 128 bits in the r0th row of the fourth bit set. Where 0≤c0<128, 0≤c1<128, θ is an integer multiple of 4, and m0×8 is divisible by θ, Δ is an integer, β is an integer multiple of 4,

[1375] Here r0=r1. Using the first interleaving process, any bit matrix in the fifth bit set after interleaving is obtained (0≤i0<2 and 0≤j0<8) in the i2th row The bit of the column is 1 bit from the second bit set (2048 bits) obtained after PCS processing, where 0≤i2<16 and 0≤j2<8.

[1376] d scr = 1131648 scrambled bits are processed by PCS, OFEC, and the first interleaving process to obtain bits that have undergone the first interleaving process. They are sent to the OFEC interleaver for "intra-matrix interleaving" and "inter-matrix interleaving". The block size of the OFEC interleaver is 172032 bits. The bit length after the first interleaving process is an integer multiple of 172032, which is conducive to hardware implementation. The 1376256 bits output by the OFEC interleaving are sent to the DP-16QAM symbol mapping and polarization division to obtain 172032 dual-polarization symbols, and DSP framing is performed, that is, FAW, TS, RES and PS are inserted into the X-polarization and Y-polarization symbols to obtain a superframe containing 175104 dual-polarization symbols, which is then sent.

[1377] Given a data frame rate of W bit Gbit / s, the corresponding baud rate is W baud =W bit ×(10280×r Frame +d CP ) / (10280×r Frame )×(4096 / k)×(57 / 56) / 8 Gbaud. For FlexO-8e and FlexO-8 data frame types, the corresponding baud rates are 124.7 Gbaud and 130.9 Gbaud, respectively.

[1378] Example 2:

[1379] Considering a data frame with a 600G rate, a data frame contains 384 rows, each row contains 10280 bits. Considering the fifth group of parameter combinations {r Frame =87,d CP =744, k=2664}. The first data processing obtains r=87 rows of data from the data frame, and obtains a total of d in =10280×r Frame = 894360 bits. Consider p = 3. First, for each OK bits for CRC-32 check, adding a total of d CRC =3×32=63 CRC check bits; then insert d PAD = 648 padding (Pad) bits, then scrambled to get d scr =10280×r+d CRC +d PAD =895104 scrambled bits. The redundancy corresponding to the CRC checksum and inserted padding bits is

[1380] As shown in Figure 4, the second data processing obtains multiple bits from the bit data stream output by the first data processing, and polls and feeds them into L = 4 PCS and OFEC codes for PCS processing and OFEC coding. As shown in Figure 5, PCS and OFEC coding converts k of the input k = 2664 bits into PCS = k-1504 = 1160 bits are sent to PCS for processing to obtain 2048 bits. k = 2664 bits including k PCS =k-1504=1160 bits and 1504 bits.

[1381] PCS processing uses a LUT lookup table to input k LUT =145 bits for LUT mapping output corresponding to n LUT = 256 bits. After the above LUT mapping is performed 8 times in succession, a total of k-1504=1160 bits are LUT mapped and the corresponding 2048 bits are output.

[1382] The 2048 bits output by the PCS processing are combined with the 1504 bits, totaling 2048 + 1504 = 3552 bits, which are then fed into the OFEC coder for encoding. 544 OFEC check bits are inserted, resulting in a total of 4096 OFEC-encoded bits, i.e., the fourth bit set. The 4096 bits are represented by the square matrix set shown in Figure 11(a), where the 2048 bits processed by the PCS correspond to the 8-bit square matrix B shown in Figure 11(a). 0,0 、B 0,1 、B 0,2 、B 0,3 、B 1,0 、B 1,1 、B 1,2 、B 1,3 .

[1383] The first interleaving process is performed on the fourth bit set to obtain an interleaved fifth bit set. The c1th bit in the 128 bits in the r1th row of the interleaved fifth bit set comes from the c0th bit in the 128 bits in the r0th row of the fourth bit set. Where 0≤c0<128, 0≤c1<128, θ is an integer multiple of 4, and m0×8 is divisible by θ, Δ is an integer, β is an integer multiple of 4,

[1384] Here r0=r1. Using the first interleaving process, any square matrix in the fifth bit set is obtained (0≤i0<2 and 0≤j0<8) in the i2th row The bit of the column is 1 bit from the second bit set (2048 bits) obtained after PCS processing, where 0≤i2<16 and 0≤j2<8.

[1385] d scr = 895104 scrambled bits are processed by PCS, OFEC, and the first interleaving process to obtain bits that have undergone the first interleaving process. They are sent to the OFEC interleaver for "intra-matrix interleaving" and "inter-matrix interleaving". The block size of the OFEC interleaver is 172032 bits. The bit length after the first interleaving process is an integer multiple of 172032, which is conducive to hardware implementation. The 1376256 bits output by the OFEC interleaving are sent to the DP-16QAM symbol mapping and polarization division to obtain 172032 dual-polarization symbols, and DSP framing is performed, that is, FAW, TS, RES and PS are inserted into the X-polarization and Y-polarization symbols to obtain a superframe containing 175104 dual-polarization symbols, which is then sent.

[1386] Given a data frame rate of W bit Gbit / s, the corresponding baud rate is W baud =W bit ×(10280×r Frame +d CP ) / (10280×r Frame )×(4096 / k)×(57 / 56) / 8 Gbaud. For FlexO-6e and FlexO-6 data frame types, the corresponding baud rates are 118.2 Gbaud and 124.1 Gbaud, respectively.

[1387] Example 3:

[1388] Considering a data frame with a 600G rate, a data frame contains 384 rows, each row contains 10280 bits. Consider the sixth group of parameter combinations {r Frame =105,d CP =504, k=3214}. The first data processing obtains r from the data frame Frame = 105 rows of data, a total of d in=10280×r Frame = 1079400 bits. Consider p = 15. First, for each OK bits for CRC-32 check, adding a total of d CRC =15×32=480 CRC check bits; then insert d PAD = 24 padding (Pad) bits, then scrambled to get d scr =10280×r Frame +d CRC +d PAD =1079904 bits. The redundancy corresponding to the CRC checksum and inserted padding bits is

[1389] As shown in Figure 4, the second data processing obtains multiple bits from the bit data stream output by the first data processing, and polls and feeds them into L = 4 PCS and OFEC codes for PCS processing and OFEC coding. As shown in Figure 5, PCS and OFEC coding converts k of the input k = 3214 bits into PCS = k-1504 = 1710 bits are sent to PCS for processing to obtain 2048 bits. k = 3214 bits including k PCS =k-1504=1710 bits and 1504 bits.

[1390] PCS processing uses a LUT lookup table to input k LUT =855 bits for LUT mapping and output corresponding to n LUT =1024 bits. After the above LUT mapping is performed twice in succession, a total of k-1504=1710 bits are LUT mapped and the corresponding 2048 bits are output.

[1391] The 2048 bits output by the PCS processing are combined with the 1504 bits, totaling 2048 + 1504 = 3552 bits, which are then fed into the OFEC coder for encoding. 544 OFEC check bits are inserted, resulting in a total of 4096 OFEC-encoded bits, i.e., the fourth bit set. The 4096 bits are represented by a square matrix set as shown in Figure 11(b), where the 2048 bits processed by the PCS correspond to the 8-bit square matrix B shown in Figure 11(b). 0,0 、B 0,1 、B 0,4 、B 0,5 、B 1,0 、B 1,1 、B 1,4 、B 1,5 .

[1392] The first interleaving process is performed on the fourth bit set to obtain an interleaved fifth bit set. The c1th bit in the 128 bits in the r1th row of the interleaved fifth bit set comes from the c0th bit in the 128 bits in the r0th row of the fourth bit set. Where 0≤c0<128, 0≤c1<128, θ is an integer multiple of 4, and m0×8 is divisible by θ, Δ is an integer, β is an integer multiple of 4,

[1393] Here r0=r1. The first interleaving process is used to obtain any square matrix in the interleaved square matrix set. (0≤i0<2 and 0≤j0<8) in the i2th row The bit of the column is 1 bit from the 2048 bits obtained after PCS processing, where 0≤i2<16 and 0≤j2<8.

[1394] d scr = 1079904 scrambled bits are processed by PCS, OFEC, and the first interleaving process to obtain bits that have undergone the first interleaving process. They are sent to the OFEC interleaver for "intra-matrix interleaving" and "inter-matrix interleaving". The block size of the OFEC interleaver is 172032 bits. The bit length after the first interleaving process is an integer multiple of 172032, which is conducive to hardware implementation. The 1376256 bits output by the OFEC interleaving are sent to the DP-16QAM symbol mapping and polarization division to obtain 172032 dual-polarization symbols, and DSP framing is performed, that is, FAW, TS, RES and PS are inserted into the X-polarization and Y-polarization symbols to obtain a superframe containing 175104 dual-polarization symbols, which is then sent.

[1395] Given a data frame rate of W bit Gbit / s, the corresponding baud rate is W baud =W bit ×(10280×r Frame +d CP ) / (10280×r Frame )×(4096 / k)×(57 / 56) / 8 Gbaud. For the FlexO-6e data frame type, the corresponding baud rate is 130.6 Gbaud.

[1396] Example 4:

[1397] Considering a data frame with a 600G rate, a data frame contains 384 rows, each row contains 10280 bits. Considering the second group of parameter combinations {r Frame =261,d CP=2232, k=2664}. The first data processing obtains r from the data frame Frame = 261 rows of data, a total of d in =10280×r Frame = 2683080 bits. Consider p = 29. First, for each Row of 10280× bits for CRC-32 check, adding a total of d CRC =29×32=928 CRC check bits; then insert d PAD = 1304 padding (Pad) bits, then scrambled to get d scr =10280×r Frame +d CRC +d PAD = 2685312 bits. The redundancy corresponding to the CRC checksum and inserted padding bits is

[1398] As shown in Figure 4, the second data processing obtains multiple bits from the bit data stream output by the first data processing, and polls and feeds them into L = 4 PCS and OFEC codes for PCS processing and OFEC coding. As shown in Figure 5, PCS and OFEC coding converts k of the input k = 2664 bits into PCS = k-1504 = 1160 bits are sent to PCS for processing to obtain 2048 bits. k = 2664 bits including k PCS =k-1504=1160 bits and 1504 bits.

[1399] PCS processing uses a LUT lookup table to input k LUT = 290 bits for LUT mapping output corresponding to n LUT = 512 bits, and after the above LUT mapping is performed 4 times continuously, a total of k-1504=1160 bits are LUT mapped and the corresponding 2048 bits are output. It should be noted that, in other specific embodiments, the PCS processing uses the LUT lookup table to convert the input k bits into 2048 bits each time. LUT =145 bits for LUT mapping output corresponding to n LUT = 256 bits. After the above LUT mapping is performed 8 times in succession, a total of k-1504=1160 bits are LUT mapped and the corresponding 2048 bits are output.

[1400] The 2048 bits output by the PCS processing are combined with the 1504 bits, totaling 2048 + 1504 = 3552 bits, which are then fed into the OFEC coder for encoding. 544 OFEC check bits are inserted, resulting in a total of 4096 OFEC-encoded bits, i.e., the fourth bit set. The 4096 bits are represented by a square matrix set as shown in Figure 11(b), where the 2048 bits processed by the PCS correspond to the 8-bit square matrix B shown in Figure 11(b). 0,0 、B 0,1 、B 0,4 、B 0,5 、B 1,0 、B 1,1 、B 1,4 、B 1,5 .

[1401] The first interleaving process is performed on the fourth bit set to obtain an interleaved fifth bit set. The c1th bit in the 128 bits in the r1th row of the interleaved fifth bit set comes from the c0th bit in the 128 bits in the r0th row of the fourth bit set. Where 0≤c0<128, 0≤c1<128, θ is an integer multiple of 4, and m0×8 is divisible by θ, Δ is an integer, β is an integer multiple of 4,

[1402] Here r0=r1. The first interleaving process is used to obtain any square matrix in the interleaved square matrix set. (0≤i0<2 and 0≤j0<8) in the i2th row The bit of the column is 1 bit from the 2048 bits obtained after PCS processing, where 0≤i2<16 and 0≤j2<8.

[1403] d scr = 2685312 scrambled bits are processed by PCS, OFEC, and the first interleaving process to obtain bits that have undergone the first interleaving process. They are sent to the OFEC interleaver for "intra-matrix interleaving" and "inter-matrix interleaving". The block size of the OFEC interleaver is 172032 bits. The bit length after the first interleaving process is an integer multiple of 172032, which is conducive to hardware implementation. The 4128768 bits output by the OFEC interleaver are sent to the DP-16QAM symbol mapping and polarization division to obtain 516096=172032×3 dual-polarization symbols. DSP framing is performed on every 172032 dual-polarization symbols of the 516096=172032×3 dual-polarization symbols, that is, FAW frame alignment symbols, TS training symbols, RES reserved symbols and PS pilot symbols are inserted into the X-polarization and Y-polarization symbols to obtain a superframe containing 175104 dual-polarization symbols, and a total of 3 superframes are obtained, which are then sent. Typically, 74 RES reserved symbols are included in the superframe.

[1404] It should be noted that the d scr ≠336×k, considering d scr ×F Frame =336×k×F DSP , where F Frame =1 and F DSP =3, the above F DSP = 3 superframes as a combination, so that F DSP Superframes correspond to F Frame = 1 d output by the first data processing scr ×F Frame = 4128768 bits. By designing the RES reserved symbol inserted in each superframe, the receiving end can identify F DSP = 3 superframes to identify F Frame = 1 d output by the first data processing scr ×F Frame =The boundary corresponding to 4128768 bits.

[1405] It should be noted that a specific implementation of the “design of the RES reserved symbol inserted in each superframe” is as follows: DSP =3 superframes, the 22 consecutive RES reserved symbols in the 0th superframe are a specific first identification sequence (also called the first identification symbol), and the 22 consecutive RES reserved symbols in the 1st and 2nd superframes are a specific second identification sequence (also called the second identification symbol), and the first identification sequence and the second identification sequence are different; after performing DSP superframe alignment, the receiving end can obtain the F by identifying the first identification sequence and the second identification sequence. DSP =3 superframes, a combined boundary. The first identifier and the second identifier may also be referred to as the F DSPSuperframe alignment flag (F DSP superframe alignment signal). At this time, the RES reserved symbols remaining after removing the first identifier or the second identifier are also called fixed stuff (FS). In some specific implementations, the specific values ​​of the first identifier sequence and the second identifier sequence are shown in Table 4 below, and the corresponding 16QAM symbols in the two polarization directions can be obtained by performing 16QAM symbol mapping on the sequence.

[1406] Table 4

[1407] Given a data frame rate of W bit Gbit / s, the corresponding baud rate is W baud =W bit ×(10280×r Frame +d CP ) / (10280×r Frame )×(4096 / k)×(57 / 56) / 8 Gbaud. For the FlexO-6e data frame type, the corresponding baud rate is 118.203 Gbaud. For the FlexO-6 data frame type, the corresponding baud rate is 124.102 Gbaud.

[1408] It should be noted that, in some specific scenarios, the superframe containing 172032 dual-polarization symbols is also called a multi-frame, and the F containing 172032×3 dual-polarization symbols is also called a multi-frame. DSP =3 multiframes are also called 1 superframe.

[1409] Example 5:

[1410] Considering a data frame with an 800G rate, a data frame contains 512 rows, each row contains 10280 bits. Considering the third group of parameter combinations {r Frame =261,d CP =1560, k=3196}. The first data processing obtains r from the data frame Frame = 261 rows of data, a total of d in =10280×r Frame =2683080 bits.

[1411] Consider p = 29. First, for each OK bits for CRC-32 check, adding a total of d CRC =29×32=928 CRC check bits; then insert d PAD= 632 padding (Pad) bits, and then scrambled to get d scr =10280×r Frame +d CRC +d PAD = 2684640 bits. The redundancy corresponding to the CRC checksum and inserted padding bits is

[1412] As shown in Figure 4, the second data processing obtains multiple bits from the bit data stream output by the first data processing, and polls and feeds them into L = 4 PCS and OFEC codes for PCS processing and OFEC coding. As shown in Figure 5, PCS and OFEC coding converts k of the input k = 3196 bits into PCS = k-1504 = 1692 bits are sent to PCS for processing to obtain 2048 bits. k = 3196 bits including k PCS =k-1504=1692 bits and 1504 bits.

[1413] PCS processing uses a LUT lookup table to input k LUT =423 bits for LUT mapping and output of corresponding n LUT =512 bits. After the above LUT mapping operation is performed four times in succession, a total of k-1504=1692 bits are LUT mapped and the corresponding 2048 bits are output.

[1414] The 2048 bits output by the PCS processing are combined with the 1504 bits, for a total of 2048 + 1504 = 3552 bits, which are then fed into the OFEC coder for encoding and inserting 544 OFEC check bits, resulting in a total of 4096 OFEC-encoded bits, i.e., the fourth bit set. The 4096 bits are represented by a square matrix set as shown in Figure 11(a), where the 2048 bits processed by the PCS correspond to the 8-bit square matrix B shown in Figure 11(a). 0,0 、B 0,1 、B 0,2 、B 0,3 、B 1,0 、B 1,1 、B 1,2 、B 1,3 .

[1415] Perform the first interleaving process on the fourth bit set (4096 bits) to obtain the interleaved fifth bit set. The c1th bit in the 128 bits in the r1th row of the interleaved fifth bit set comes from the c0th bit in the 128 bits in the r0th row of the fourth bit set. Where 0≤c0<128, 0≤c0<128, θ is an integer multiple of 4, and m0×8 is divisible by θ, Δ is an integer, β is an integer multiple of 4,

[1416] Here r0=r1. Using the first interleaving process, any bit matrix in the fifth bit set after interleaving is obtained (0≤i0<2 and 0≤j0<8) in the i2th row The bit of the column is 1 bit from the second bit set (2048 bits) obtained after PCS processing, where 0≤i2<16 and 0≤j2<8.

[1417] d scr = 2684640 scrambled bits are processed by PCS, OFEC, and the first interleaving process to obtain The first interleaved bits are fed into the OFEC interleaver for intra- and inter-matrix interleaving. The OFEC interleaver's block size is 172,032 bits. The bit length after the first interleaving is an integer multiple of 172,032, which facilitates hardware implementation. The 3,440,640 bits output by the OFEC interleaver are fed into DP-16QAM symbol mapping and polarization division to produce 430,080 dual-polarization symbols.

[1418] It should be noted that the d scr ≠336×k, considering d scr ×F Frame =336×k×F DSP , where F Frame =2 and F DSP =5. That is, F Frame = d of the 2 first data processing outputs scr ×F Frame = 5369280 bits, corresponding to 860160 dual-polarization symbols. DSP framing is performed on each of the 860160 = 172032 × 5 dual-polarization symbols. This involves inserting FAW frame alignment symbols, TS training symbols, RES reserved symbols, and PS pilot symbols into the X- and Y-polarization symbols, resulting in a superframe containing 175104 dual-polarization symbols. Five superframes are then transmitted. Typically, each superframe contains 74 RES reserved symbols.

[1419] The above F DSP = 5 superframes as a combination, so that F DSP =5 superframes corresponding to F Frame = d of the 2 first data processing outputs scr ×F Frame = 5369280 bits. By designing the RES reserved symbol inserted in each superframe, the receiving end can identify F DSP= 5 superframes to identify F Frame = d of the 2 first data processing outputs scr ×F Frame =The boundary corresponding to 5369280 bits.

[1420] It should be noted that a specific implementation of the “design of the RES reserved symbol inserted in each superframe” is as follows: DSP =5 superframes, the 22 consecutive RES reserved symbols in the 0th superframe are a specific first identification sequence, and the 22 consecutive RES reserved symbols in the 1st to 4th superframes are a specific second identification sequence, and the first identification sequence and the second identification sequence are different; after performing DSP superframe alignment, the receiving end can obtain the F by identifying the first identification sequence and the second identification sequence. DSP =5 superframes a combined boundary. Another specific implementation of the "design of the RES reserved symbol inserted in each superframe" is as follows: DSP =5 superframes, the 22 consecutive RES reserved symbols in the 0th and 1st superframes are a specific first identification sequence (also called the first identification symbol), and the 22 consecutive RES reserved symbols in the 2nd to 4th superframes are a specific second identification sequence (also called the second identification symbol), and the first identification sequence and the second identification sequence are different; after performing DSP superframe alignment, the receiving end can obtain the F by identifying the first identification sequence and the second identification sequence. DSP =5 superframes, a combined boundary. The first identifier and the second identifier may also be referred to as the F DSP Superframe alignment flag (F DSP In this case, the RES reserved symbol remaining after removing the first identifier or the second identifier is also called fixed stuff (FS). In some specific implementations, the specific values ​​of the first identifier and the second identifier are shown in Table 5.

[1421] Table 5

[1422] Given a data frame rate of W bit Gbit / s, the corresponding baud rate is W baud =W bit ×(10280×r Frame +d CP ) / (10280×r Frame)×(4096 / k)×(57 / 56) / 8 Gbaud. For the FlexO-8e data frame type, the corresponding baud rate is 131.337 Gbaud.

[1423] It should be noted that, in some specific scenarios, the superframe containing 175104 dual-polarization symbols is also called a multi-frame, and the F containing 175104×5 dual-polarization symbols is also called a multi-frame. DSP =5 superframes is also called 1 superframe.

[1424] Example 6:

[1425] Considering a 600G data frame, each row of a data frame contains q bits. The first data processing step is to obtain r from the data frame. Frame The data of the row is d in =q×r Frame bits. Then, CRC is performed on the first data and / or padding bits are inserted to obtain the second data. In the CRC operation, d CRC CRC check bits are inserted during the padding operation. PAD Then, the second data is scrambled to obtain the third data, and the number of bits of the third data is d scr =q×r Frame +d CP scrambled bits, where d CP =d CRC +d PAD The scrambled bit data undergoes PCS and OFEC encoding, first interleaving, OFEC interleaving, 16QAM symbol mapping, and polarization division to obtain a dual-polarization symbol containing 172032, and performs redundancy as The DSP framing of the signal is used to obtain a superframe containing 175104 dual-polarization symbols, which is given by the following formula 1: scr =q×r Frame +d CP =336×k

[1426] The baud rate corresponding to the data processing is W baud =W bit ×(q×r Frame +d CP ) / (q×r Frame )×(4096 / k)×(57 / 56) / 8Gbaud, where W bit is the specific bit rate value corresponding to the 600G data frame. In this embodiment, in the 600G rate scenario using PCS, the corresponding baud rate W baud Similar to the existing 800G ZR baud rate scenario, the following formula 2 is used:

[1427] Combining formula 1 and formula 2, we have

[1428] That is, the following formula 3:

[1429] Consider that a data frame at 600G rate contains 512 rows, each row contains q=10280 bits. In this case, we have:

[1430] It should be noted that, in this embodiment, the first data processing obtains d from the data frame. in =q×r Frame =894360 bits of first data, the first data includes Each row contains q bits. In this embodiment, each row contains q = 10280 bits. The value of q used can also be other integers that are multiples of 257, such as q = 2056. When q = 2056,

[1431] Considering the CRC checksum and the redundancy corresponding to the inserted padding bits, There is q×r Frame +d CP >q×r Frame Combining Formula 1 and Formula 3, we have 336×k>894360, that is, the integer k≥2662.

[1432] PCS processing uses a lookup table (LUT) to convert the input k LUT The bits are mapped and the corresponding n is output LUT For the number of output bits n processed by PCS LUT It cannot be too small, otherwise it will cause performance loss in the overall PCS processing. The number of output bits processed by the PCS is n LUT It cannot be too large, otherwise it will be difficult to implement in hardware. LUT =128 or 256. When n LUT = 128, the PCS process continuously operates 2048 / 128 = 16 times, and then performs LUT mapping on a total of k-1504 bits (the first bit set) to output the corresponding 2048 bits (corresponding to the second bit set). There is an integer k-1504 that is an integer multiple of 16. LUT= 256, the PCS performs the above LUT mapping operation 2048 / 256 = 8 times in succession, and then performs LUT mapping on a total of k-1504 bits (the first bit set) and outputs the corresponding 2048 bits (corresponding to the second bit set). There is an integer k-1504 that is an integer multiple of 8. Therefore, there is an integer k-1504 that is an integer multiple of 8.

[1433] Since the redundancy is The larger the integer k is, the more redundant OH CP Typically, redundant OH CP A smaller value is chosen to improve system effectiveness. Furthermore, considering that the integer k ≥ 2662 and the integer k - 1504 is an integer multiple of 8, the typical value of the integer k can be 2664 or 2672. The corresponding typical parameter combinations are shown in Table 6.

[1434] It should be noted that the parameter combination of sequence number 1 in Table 6 {r Frame =87,d CP =744, k=2664}, the number of output bits of the lookup table used in PCS processing is n LUT The minimum value is 256, and the CRC and PAD redundancy OH CP =0.083%. The parameter combination of sequence number 2 in Table 6 {r Frame =87,d CP =3432, k=2672}, the number of output bits of the lookup table used in PCS processing is n LUT The minimum value is 128, and the CRC and PAD redundancy OH CP =0.384%. Under the two parameter combinations, the PCS lookup table corresponding to sequence number 1 has a higher implementation complexity, but the CRC and PAD redundancy OH CP The PCS lookup table corresponding to sequence number 2 has a lower implementation complexity, but the CRC and PAD redundancy OH CP Higher. You can select the parameter combination of sequence number 1 or sequence number 2 to implement it according to the specific application scenario.

[1435] Table 6

[1436] It should be noted that for the parameter combination of sequence number 2 in Table 6 {r Frame =87,d CP =3432, k=2672}, select parameter p=29. Correspondingly, the first data processing obtains r from the data frame Frame = 87 rows of data, a total of d in =10280×r Frame = 894360 bits. OK bits for CRC-32 check, adding a total of d CRC =29×32=928 CRC check bits; then insert d PAD = 2504 padding (Pad) bits, then scrambled to get d scr =10280×r Frame +d CRC +d PAD =897792 scrambled bits.

[1437] As shown in Figure 4, the second data processing obtains multiple bits from the bit data stream output by the first data processing, and polls and feeds them into L = 4 PCS and OFEC codes for PCS processing and OFEC coding. As shown in Figure 5, PCS and OFEC coding converts k of the input k = 2672 bits into PCS = k-1504 = 1168 bits are sent to PCS for processing to obtain 2048 bits. k = 2672 bits including k PCS = k - 1504 = 1168 bits sent to PCS processing and the remaining 1504 bits.

[1438] PCS processing uses a LUT lookup table to input k LUT =73 bits for LUT mapping output corresponding to n LUT =128 bits. After the above LUT mapping is performed 16 times continuously, a total of k-1504=1168 bits are LUT mapped and the corresponding 2048 bits are output.

[1439] The 2048 bits output by the PCS processing are combined with the 1504 bits, for a total of 2048 + 1504 = 3552 bits, which are then fed into the OFEC coder for encoding. 544 OFEC check bits are inserted, resulting in a total of 4096 OFEC-encoded bits, the fourth bit set. The 4096 bits are represented by a square matrix set as shown in Figure 11(b), where the 2048 bits processed by the PCS correspond to the 8-bit square matrix B shown in Figure 11(b). 0,0 、B 0,1 、B 0,4 、B 0,5 、B 1,0 、B 1,1 、B 1,4 、B 1,5 .

[1440] The 2048 bits from the second bit set are not positioned consecutively in the FEC-encoded codeword. The second bit set and the third bit set are interleaved before being sent to the FEC codeword to disrupt their order. The 3552 bits before encoding are arranged in the following order: first, 1024 consecutive bits from the second bit set, then 1024 consecutive bits from the third bit set, then 1024 consecutive bits from the second bit set, and finally, 480 consecutive bits from the third bit set.

[1441] The first interleaving process is performed on the fourth bit set to obtain an interleaved fifth bit set. The c1th bit in the 128 bits in the r1th row of the interleaved fifth bit set comes from the c0th bit in the 128 bits in the r0th row of the fourth bit set. Where 0≤c0<128, 0≤c1<128, θ is an integer multiple of 4, and m0×8 is divisible by θ, Δ is an integer, β is an integer multiple of 4,

[1442] Here r0=r1. The first interleaving process is used to obtain any square matrix in the interleaved square matrix set. (0≤i0<2 and 0≤j0<8) in the i2th row The bit of the column is 1 bit from the 2048 bits obtained after PCS processing, where 0≤i2<16 and 0≤j2<8.

[1443] d scr = 897792 scrambled bits are processed by PCS, OFEC, and the first interleaving process to obtain bits that have undergone the first interleaving process. They are sent to the OFEC interleaver for "intra-matrix interleaving" and "inter-matrix interleaving". The block size of the OFEC interleaver is 172032 bits. The bit length after the first interleaving process is an integer multiple of 172032, which is conducive to hardware implementation. The 1376256 bits output by the OFEC interleaving are sent to the DP-16QAM symbol mapping and polarization division to obtain 172032 dual-polarization symbols, and DSP framing is performed, that is, FAW, TS, RES and PS are inserted into the X-polarization and Y-polarization symbols to obtain a superframe containing 175104 dual-polarization symbols, which is then sent.

[1444] Given a data frame rate of W bit Gbit / s, the corresponding baud rate is W baud =W bit ×(10280×r Frame +d CP) / (10280×r Frame )×(4096 / k)×(57 / 56) / 8 Gbaud. For the FlexO-6e data frame type, the corresponding baud rate is 118.203 Gbaud, the same as the baud rate in 800ZR.

[1445] Example 7:

[1446] FIG17( b ) is a schematic diagram of another implementation method of performing CRC on a data frame in an embodiment of the present application. Based on Example 6, consider the parameter combination {r Frame =87,d CP =3432, k=2672}, and select parameter p=18, refer to Figure 17(b) for understanding. Correspondingly, the first data processing obtains r from the data frame Frame = 87 rows of data, a total of d in =10280×r Frame = 894360 bits. Consider the integer integer r F1 =r Frame -r F0 ×(p-1)=87-5×17=2. For r obtained from the data frame Frame = 87 rows of data, the first r F0 ×(p-1)=85 rows of each r F0 =5 lines total 10280×r F0 = 51400 bits, perform CRC-32 and add 32-bit check bits to get 32×(p-1)=544 bits of CRC check bits. F1 =2 lines total 10280×r F1 = 20560 bits to perform CRC-32 and add 32-bit check bits, and the total is d CRC =32×p=576 bits of CRC check bits. Then insert d PAD = 2856 padding (Pad) bits, then scrambled to get d scr =10280×r Frame +d CRC +d PAD =897792 scrambled bits.

[1447] Example 8:

[1448] FIG17(c) is a schematic diagram of another implementation method of performing CRC on a data frame in an embodiment of the present application. Based on Example 6, consider the parameter combination {r Frame =87,d CP=3432, k=2672}, and select parameter p=22, refer to Figure 17(c) for understanding. Correspondingly, the first data processing obtains r from the data frame Frame = 87 rows of data, a total of d in =10280×r Frame = 894360 bits. Consider the integer integer r F1 =r Frame -r F0 ×(p-1)=87-4×21=3. For r obtained from the data frame Frame = 87 rows of data, the first r F0 ×(p-1)=each r in 84 rows F0 =4 lines total 10280×r F0 =41120 bits, perform CRC-32 and add 32-bit check bits to get 32×(p-1)=672 bits of CRC check bits. F1 =3 lines total 10280×r F1 =30840 bits to perform CRC-32 and add 32-bit check bits, and the total amount is d CRC =32×p=704 bits of CRC check bits. Then insert d PAD = 2728 padding (Pad) bits, and then scrambled to get d scr =10280×r Frame +d CRC +d PAD =897792 scrambled bits. It should be noted that the Frame = The first r in the 87 rows of data F0 ×(p-1)=each r in 84 rows F0 =4 lines total q×r F0 =41120 bits are subjected to CRC-32. The CRC-32 encoding and detection operations can directly adopt the CRC-32 operation in the existing 800GZR, wherein the existing 800GZR performs a CRC-32 operation on 4×10280=41120 bits of data in 4 rows and 10280 columns.

[1449] It should be noted that the above scenario considers that each row of the data frame contains q=10280 bits. In other possible scenarios, each row of the data frame contains q=2056 bits. As an example, consider the parameter combination {q=2056, r Frame =435,d CP =3432, k=2672}, and select parameter p=22. At this time, the first data processing obtains r from the data frame Frame=435 rows of data, a total of d in =q×r Frame = 894360 bits. Consider the integer integer r F1 =r Frame -r F0 ×(p-1)=435-20×21=15. For r obtained from the data frame Frame = 435 rows of data, among which the first r F0 ×(p-1)=420 rows per r F0 =20 rows total q×r F0 =41120 bits, perform CRC-32 and add 32-bit check bits to get 32×(p-1)=672 bits of CRC check bits, and then add the last r F1 =15 rows total q×r F1 =30840 bits to perform CRC-32 and add 32-bit check bits, and the total amount is d CRC =32×p=704 bits of CRC check bits. Then, insert d PAD = 2728 padding (Pad) bits, and then scrambled to get d scr =q×r Frame +d CRC +d PAD =897792 scrambled bits.

[1450] It should be noted that for the parameter combination of sequence number 1 in Table 6 {r Frame =87,d CP =744, k=2664}, which is applied to the scenario where each row of the data frame contains q=10280 bits. For the scenario where each row of the data frame contains q=2056 bits, consider the parameter combination {q=2056, r Frame =435,d CP =744, k=2664}, and select parameter p=22. At this time, the first data processing obtains r from the data frame Frame =435 rows of data, a total of d in =q×r Frame = 894360 bits. Consider the integer integer r F1 =r Frame -r F0 ×(p-1)=435-20×21=15. For r obtained from the data frame Frame = 435 rows of data, among which the first r F0 ×(p-1) = each r in 420 rows F0=20 rows total q×r F0 =41120 bits, perform CRC-32 and add 32-bit check bits to get 32×(p-1)=672 bits of CRC check bits, and then add the last r F1 =15 rows total q×r F1 =30840 bits to perform CRC-32 and add a 32-bit check bit, and the total is d CRC =32×p=704 bits of CRC check bits. Then, insert d PAD = 40 padding (Pad) bits, and then scrambled to get d scr =q×r Frame +d CRC +d PAD =895104 scrambled bits.

[1451] It should be noted that, in the Frame = the first r in the 435 rows of data F0 ×(p-1) = each r in 420 rows F0 =20 rows total q×r F0 = 41120 bits, the CRC-32 encoding and detection operations can directly adopt the CRC-32 operations in the existing 800GZR. The difference is that the existing 800GZR performs the CRC-32 operation on 4×10280=41120 bits in 4 rows and 10280 columns. It should be understood that when r Frame = the last r in the 435th row of data F1 =15 rows total q×r F1 In the scenario where the CRC-32 operation is performed on 30840 bits, the CRC-32 encoding and detection operation can also adopt the CRC-32 operation similar to that in 800GZR, except that the number of input bits is different.

[1452] Example 9:

[1453] Considering a data frame with an 800G rate, each row of a data frame contains q = 10280 bits. The first data processing step is to obtain r from the data frame. Frame The data of the row is d in =q×r Frame bits. Then, CRC is performed on the first data and / or padding bits are inserted to obtain the second data. In the CRC operation, d CRC CRC check bits are inserted during the padding operation. PAD Then, the second data is scrambled to obtain the third data, and the number of bits of the third data is d scr =q×r Frame+d CP scrambled bits, where d CP =d CRC +d PAD The scrambled bit data undergoes PCS and OFEC encoding, first interleaving, OFEC interleaving, 16QAM symbol mapping, and polarization division to obtain a dual-polarization symbol containing 172032, and performs redundancy as The DSP framing method obtains a superframe containing 175104 dual-polarization symbols, which is: scr =10280×r Frame +d CP =336×k

[1454] The baud rate corresponding to the data processing is Where W bit is the specific bit rate value corresponding to the 800G data frame. In this embodiment, considering the FlexO-8 data frame, its bit rate is approximately W bit ≈845.1481Gbit / s, baud rate W baud The frequency used is about 131GBaud. Considering that the integer k-1504 is an integer multiple of 8, it is considered that the integer k can be 3360, 3368 or 3376.

[1455] For k = 3360, d scr =336×k=1128960; due to There is d CP =d scr -10280×r Frame =8440. At this time, the baud rate is Since the highest baud rate corresponding to typical low-power devices in the current industry is about 131 Gbaud, the value of k = 3360 is not suitable for application scenarios requiring lower power consumption.

[1456] For k = 3368, d scr =336×k=1131648; due to There is d CP =d scr -10280× Frame =1131648-1130800=848. At this time, the baud rate is

[1457] For k = 3376, d scr =336×k=1134336; due to There is d CP=d scr -10280× Frame =1134336-1130800=3536. At this time, the specific value of the baud rate is

[1458] Therefore, the typical value of the integer k can be 3368 or 3376. The corresponding typical parameter combinations are shown in Table 7.

[1459] It should be noted that the parameter combination of sequence number 1 in Table 7 { Frame =110,d CP =848, k=3368}, the number of output bits of the lookup table used in PCS processing is n LUT The minimum value is 256, and the CRC and PAD redundancy OH CP =0.075%. The parameter combination of sequence number 2 in Table 7 { Frame =110,d CP =3536, k=3376}, the number of output bits of the lookup table used in PCS processing is n LUT The minimum value is 128, and the CRC and PAD redundancy OH CP =0.313%. Under the two parameter combinations, the PCS lookup table corresponding to sequence number 1 has a higher implementation complexity, but the CRC and PAD redundancy OH CP Smaller; the PCS lookup table corresponding to sequence number 2 has a lower implementation complexity, but the CRC and PAD redundancy OH CP Higher. You can select the parameter combination of sequence number 1 or sequence number 2 to implement it according to the specific application scenario.

[1460] Table 7

[1461] It should be noted that for the parameter combination of sequence number 1 in Table 7 {r Frame =110,d CP =848, k=3368}, select parameter p=22, and its specific implementation can refer to Example 1. For the parameter combination of sequence number 1 in Table 7 {r Frame =110,d CP =3536, k=3376}, select parameter p=22, correspondingly, the first data processing obtains from the data frame Frame = 110 rows of data, a total of d in =10280× Frame =1130800 bits. OK bits for CRC-32 check, adding a total of d CRC=22×32=704 CRC check bits; then insert d PAD = 2832 padding (Pad) bits, then scrambled to get d scr =10280× Frame +d CRC +d PAD =1134336 scrambled bits.

[1462] Example 10:

[1463] Based on Example 9, consider the FlexO-8e data frame, whose bit rate is about W bit ≈804.9795Gbit / s, baud rate W baud The frequency used is about 131GBaud. Considering that the integer k-1504 is an integer multiple of 8, it is considered that the integer k may be 3184, 3192, 3200, 3208, or 3216.

[1464] For k = 3184, d scr =336×k=1069824; due to There is d CP =d scr -10280× Frame =1069824-1069120=704. At this time, the CRC and PAD redundancy is 0.066%, and the baud rate is specifically set to

[1465] For k = 3192, d scr =336×k=1072512; due to There is d CP =d scr -10280× Frame =1072512-1069120=3392. At this time, the CRC and PAD redundancy is 0.317%, and the baud rate is specifically set to

[1466] For k = 3200, d scr =336×k=1075200; due to There is d CP =d scr -10280× Frame =1077888-1069120=6080. At this time, the CRC and PAD redundancy is 0.569%, which is relatively large.

[1467] For k = 3208, d scr =336×k=1077888; due to There is d CP =d scr -10280× Frame =1077888-1069120=8768. At this time, the CRC and PAD redundancy is 0.82%, which is relatively large.

[1468] For k = 3216, d scr =336×k=1080576; due to There is d CP =d scr -10280× Frame =1080576-1079400=1176. At this time, the CRC and PAD redundancy is 0.109%, and the baud rate is specifically set to

[1469] Therefore, the typical value of the integer k can be 3184, 3192, or 3216. The corresponding typical parameter combinations are shown in Table 8.

[1470] Table 8

[1471] It should be noted that the parameter combination of sequence number 1 in Table 8 { Frame =104,d CP =704, k=3184}, the number of output bits n of the lookup table used in PCS processing LUT The minimum value is 128, and the CRC and PAD redundancy OH CP =0.066%. The parameter p can be selected as 13. Correspondingly, the first data processing obtains from the data frame Frame =104 rows of data, a total of d in =10280× Frame =1069120 bits. OK bits for CRC-32 check, adding a total of d CRC =13×32=416 CRC check bits; then insert d PAD = 288 padding bits, then scrambled to get d scr =10280×r Frame +d CRC +d PAD =1069824 scrambled bits.

[1472] The parameter combination of sequence number 2 in Table 8 {r Frame =104,d CP =3392, k=3192}, the number of output bits of the lookup table used in PCS processing is n LUTThe minimum value is 256. The implementation complexity of the PCS lookup table is relatively high, and the CRC and PAD redundancy OH CP Therefore, the parameter combination of sequence number 1 is preferred at the baud rate of 131.842 GBaud.

[1473] The parameter combination of sequence number 3 in Table 8 { Frame =105,d CP =1176, k=3216}, the number of output bits n of the lookup table used in PCS processing LUT The minimum value is 128, and the CRC and PAD redundancy OH CP =0.109%. The corresponding PCS lookup table has a low implementation complexity. In addition, the selected parameter p=21, correspondingly, the first data processing obtains Frame = 105 rows of data, a total of d in =10280× Frame =1079400 bits. OK bits for CRC-32 check, adding a total of d CRC =21×32=672 CRC check bits; then insert d PAD = 504 padding (Pad) bits, then scrambled to get d scr =10280×r Frame +d CRC +d PAD =1080576 scrambled bits.

[1474] Example 11:

[1475] Considering a data frame with an 800G rate, a data frame contains 512 rows, each row contains 10280 bits. Consider the 10th parameter combination in Table 2 { Frame =110,d CP =848, k=3368}. The first data processing obtains Frame = 110 rows of data, a total of d in =10280× Frame = 1130800 bits. Consider p = 22.

[1476] FIG17(a) is a schematic diagram of an implementation method of performing CRC on a data frame in an embodiment of the present application. As shown in FIG17(a), each OK bits for CRC-32 check, adding a total of d CRC =22×32=704 CRC check bits; then insert d PAD= 144 padding (Pad) bits, then scrambled to get d scr =10280× Frame +d CRC +d PAD =1131648 scrambled bits. The redundancy corresponding to the CRC checksum and inserted padding bits is

[1477] As shown in Figure 4, the second data processing obtains multiple bits from the bit data stream output by the first data processing, and polls and feeds L=4 PCS and OFEC codes for PCS processing and OFEC coding. As shown in Figure 5, k of the input k=3368 bits are PCS = k-1504 = 1864 bits are sent to PCS for processing to obtain 2048 bits. k = 3368 bits including k PCS =k-1504=1864 bits and 1504 bits not processed by PCS.

[1478] PCS processing uses a LUT lookup table to input k LUT = 233 bits for LUT mapping and output of corresponding n LUT = 256 bits. After the above LUT mapping is performed 8 times in succession, a total of k-1504=1864 bits are LUT mapped and the corresponding 2048 bits are output.

[1479] The 2048 bits output by PCS processing are combined with the 1504 bits that are not processed by PCS, a total of 2048 + 1504 = 3552 bits are sent to the interleaving before encoding to obtain the sixth bit set, which contains 3552 bits. The sixth bit set is represented by the square matrix set shown in Figure 23 (b), and the bit matrix I 0,0 , I 0,1 , I 0,2 , I 0,3 , I 1,0 , I 1,1 , I 1,2 , I 1,3 The i1th row and the The bits of the column (0≤i1<16, 0≤j1<8) and the bit matrix I 0,4 , I 0,5 , I 1,4 , I 1,5 A total of 2048 bits come from the second bit set after PCS processing. The sixth bit set is OFEC-encoded and 544 OFEC check bits are inserted, resulting in a total of 4096 OFEC-encoded bits, i.e., the fourth bit set. The bits of the fourth bit set are represented by a square matrix set as shown in Figure 11(c), where the bit matrix B 0,0 、B0,1 、B 0,2 、B 0,3 、B 1,0 、B 1,1 、B 1,2 、B 1,3 The i1th row and the Column bits (0≤i1<16, 0≤j1<8) and bit matrix B 0,4 、B 0,5 、B 1,4 、B 1,5 A total of 2048 bits are from the second set of bits processed by PCS.

[1480] For the bit matrix B in the fourth bit set 0,4 、B 0,5 、B 0,6 、B 0,7 、B 1,4 、B 1,5 、B 1,6 、B 1,7 Perform the first interleaving process to obtain the bit matrix T in the fifth bit set 0,4 、T 0,5 、T 0,6 、T 0,7 、T 1,4 、T 1,5 、T 1,6 、B 1,7 ; and the bit matrix B 0,0 、B 0,1 、B 0,2 、B 0,3 、B 1,0 、B 1,1 、B 1,2 、B 1,3 Directly output the bit matrix T in the fifth bit set 0,0 、T 0,1 、T 0,2 、T 0,3 、T 1,0 、T 1,1 、T 1,2 、T 1,3 After the first interleaving, when 0≤c1<64, the c1th bit in the 128 bits in the r1th row of the fifth bit set comes from the c1th bit in the 128 bits in the r0th row of the fourth bit set. When 64≤c1<128, the c1th bit in the 128 bits in the r1th row of the fifth bit set comes from the c0th bit in the 128 bits in the r0th row of the fourth bit set. Among them, 64≤c0<128, 64≤c1<128, θ is an integer multiple of 4, and m0×4 is divisible by θ, Δ is an integer, and β is an integer multiple of 4.

[1481] Here r0 = c1. Using the pre-coding ...

Claims

1. A data processing method, characterized in that: include: Performing PCS processing on a first bit set of k bits to obtain a second bit set, where k is an integer greater than 1; Performing forward error correction (FEC) encoding on the second bit set and a third bit set among the k bits except the first bit set to obtain a fourth bit set, where the fourth bit set includes m0 first bit subsets, each of the first bit subsets includes F0 bits, where m0 is an integer greater than 1, and F0 is an even number greater than 1; A first interleaving process is performed on the fourth bit set to obtain a fifth bit set, the fifth bit set including m0 second bit subsets, each of the second bit subsets including F0 bits, F0 / 2 bits in each of the second bit subsets coming from the second bit set, and another F0 / 2 bits in each of the second bit subsets coming from the third bit set and / or the check bits of the FEC code.

2. The method according to claim 1, characterized in that The fifth bit set includes m0×F0 bits, and each of the second bit subsets includes consecutive F0 bits.

3. The method according to claim 1, characterized in that: Each of the second bit subsets is presented as a square matrix.

4. The method according to any one of claims 1 to 3, characterized in that The F0 bits in each of the second bit subsets are distributed as F1 rows and F1 columns, F1 / 2 bits of the F1 bits in each row of the second bit subset come from the second bit set, the second bit set includes m0×F0 / 2 bits, and the other F1 / 2 bits of the F1 bits in each row of the second bit subset come from the third bit set and / or the check bits of the FEC encoding.

5. The method according to claim 4, characterized in that F0=256, F1=16.

6. The method according to claim 4 or 5, characterized in that: F0=256, F1=16, the i2th row and the The bits of the column are from the second bit set, 0≤i2<16, 0≤j2<8; Alternatively, the bit in the i2th row and the (j2×2-i2%2+1)th column in the second bit subset is from the second bit set, 0≤i2<16, 0≤j2<8; in, It means rounding a down, and b%c means taking the modulus of b over c.

7. The method according to claim 4 or 5, characterized in that: F0=256, F1=16, the bits in the second bit subset satisfy one or more of the following: The bits in row 0 and columns 2, 3, 6, 7, 10, 11, 14, and 15 of the second bit subset are from the second bit set; The bits in row 1 and columns 0, 3, 4, 7, 8, 11, 12, and 15 of the second bit subset are from the second bit set; The bits in the second row and columns 0, 1, 4, 5, 8, 9, 12, and 13 in the second bit subset are from the second bit set; The bits in the third row and the first, second, fifth, sixth, ninth, tenth, third, and fourth columns of the second bit subset are from the second bit set; The bits in the 4th row and the 2nd, 3rd, 6th, 7th, 10th, 11th, 14th, and 15th columns of the second bit subset are from the second bit set; The bits in row 5 and columns 0, 3, 4, 7, 8, 11, 12, and 15 of the second bit subset are from the second bit set; The bits in row 6 and columns 0, 1, 4, 5, 8, 9, 12, and 13 in the second bit subset are from the second bit set; The bits in row 7 and columns 1, 2, 5, 6, 9, 10, 13, and 14 of the second bit subset are from the second bit set; The bits in row 8 and columns 2, 3, 6, 7, 10, 11, 14, and 15 in the second bit subset are from the second bit set; The bits in row 9 and columns 0, 3, 4, 7, 8, 11, 12, and 15 of the second bit subset are from the second bit set; The bits in the 10th row and the 0th, 1st, 4th, 5th, 8th, 9th, 12th, and 13th columns of the second bit subset are from the second bit set; The bits in the 11th row and the 1st, 2nd, 5th, 6th, 9th, 10th, 13th and 14th columns of the second bit subset are from the second bit set; The bits in the 12th row and the 2nd, 3rd, 6th, 7th, 10th, 11th, 14th, and 15th columns of the second bit subset are from the second bit set; The bits in row 13 and columns 0, 3, 4, 7, 8, 11, 12, and 15 of the second bit subset are from the second bit set; The bits in row 14 and columns 0, 1, 4, 5, 8, 9, 12, and 13 in the second bit subset are from the second bit set; The bits in row 15 and columns 1, 2, 5, 6, 9, 10, 13, and 14 in the second bit subset are from the second bit set.

8. The method according to any one of claims 1 to 7, characterized in that F0=256, m1 of the first bit subsets in the fourth bit set, a total of m1×256 bits, come from the second bit set, and m0=m1×2.

9. The method according to any one of claims 1 to 8, characterized in that F0=256, the m0×256 bits in the fourth bit set are distributed as 32 rows and m0×8 columns, the m0×256 bits in the fifth bit set are distributed as 32 rows and m0×8 columns, the m0×8 bits in the r1th row in the fifth bit set come from the m0×8 bits in the r0th row in the fourth bit set, wherein 0≤r0<32, 0≤r1<32.

10. The method according to any one of claims 1 to 9, characterized in that Performing FEC encoding on the second bit set and a third bit set of the k bits except the first bit set to obtain a fourth bit set includes: Performing pre-coding interleaving processing on the second bit set and the third bit set to obtain a sixth bit set, the number of bits in the sixth bit set being equal to the sum of the number of bits in the second bit set and the number of bits in the third bit set, the sixth bit set comprising m3 third bit subsets, the m3 third bit subsets being distributed in 2 rows and m4 columns, m3=2×m4, m3 being an integer greater than 1 and less than m0, wherein each third bit subset in a part of the third bit subsets comprises F0 bits, wherein each third bit subset in another part of the third bit subsets comprises F2 bits, and F2 is an even number greater than 1 and less than F0; Perform FEC encoding on the sixth bit set to obtain the fourth bit set.

11. The method according to claim 10, characterized in that m3=14, m4=7, F0=256, F2=240, each third bit subset of columns 0 to 5 includes 16 rows and 16 columns of bits, each third bit subset of column 6 includes 16 rows and 15 columns of bits, F0 / 2 bits of each third bit subset of columns 0 to 4 come from the second bit set, another F0 / 2 bits of each third bit subset of columns 0 to 4 come from the third bit set, 9 bits of each row in each third bit subset of column 5 come from the second bit set, another 7 bits of each row in each third bit subset of column 5 come from the third bit set, and F2 bits of each third bit subset of column 6 come from the second bit set.

12. The method according to any one of claims 9 to 11, characterized in that r0=r1。 13. The method according to any one of claims 1 to 12, characterized in that m0=12 or 16.

14. The method according to any one of claims 1 to 13, characterized in that After performing interleaving processing on the fourth bit set to obtain a fifth bit set, the method further includes: Performing a second interleaving process on every two first bit streams among the L first bit streams to obtain a total of L / 2 second bit streams, each of the first bit streams includes a plurality of the fifth bit sets, and L is an even number greater than 0; Performing symbol mapping and polarization division on L / 2 of the second bit streams to obtain a dual-polarization symbol stream, wherein the symbol mapping and the polarization division map t bits into one dual-polarization symbol, where t is an integer greater than 0; The dual-polarization symbol stream is subjected to digital signal processing (DSP) framing.

15. The method according to claim 14, characterized in that The amplitude bits in the dual-polarization symbol are from the second bit set.

16. The method according to claim 15, characterized in that t=8, the dual-polarization symbol is a dual-polarization DP-16QAM symbol.

17. The method according to claim 16, characterized in that Performing DSP framing on the dual-polarization symbol stream includes: Every 172032 dual-polarization DP-16QAM symbols are framed to obtain a DSP superframe, and the superframe contains 175104 dual-polarization symbols.

18. The method according to any one of claims 1 to 17, characterized in that The number of bits in the first bit set is an integer multiple of 2, 4, 8, or 16, the second bit set includes 2048 bits, the third bit set includes 1504 bits, and the fourth bit set includes 4096 bits.

19. A data processing method, characterized in that: include: Acquire first data from a data frame, where the first data includes r rows and q columns of bits, where r is an integer greater than 0, and q is an integer greater than 0; Performing a cyclic redundancy check CRC on the first data and / or inserting padding bits to obtain second data, wherein the second data includes d CRC parity bits and / or d PAD Filling bits, d CRC is an integer greater than or equal to 0, d PAD is an integer greater than or equal to 0; The second data is scrambled to obtain third data, the number of bits of the third data is d scr =r×q+d CP , d CP =d CRC +d PAD ; Get k bits of the third data, where k is an integer greater than 1, d scr is an integer multiple of k; Performing PCS processing on a first bit set of the k bits to obtain a second bit set; Perform forward error correction FEC encoding on the second bit set and a third bit set of the k bits except the first bit set The code obtains a fourth bit set.

20. The method according to claim 19, characterized in that The fourth bit set includes m0 first bit subsets, each of the first bit subsets includes F0 bits, the m0 is an integer greater than 1, the F0 is an even number greater than 1, and the second bit set and a third bit set among the k bits except the first bit set are FEC-encoded to obtain a fourth bit set, including: Performing pre-coding interleaving processing on the second bit set and the third bit set to obtain a sixth bit set, the number of bits in the sixth bit set being equal to the sum of the number of bits in the second bit set and the number of bits in the third bit set, the sixth bit set comprising m3 third bit subsets, the m3 third bit subsets being distributed in 2 rows and m4 columns, m3=2×m4, m3 being an integer greater than 1 and less than m0, wherein each third bit subset in a part of the third bit subsets comprises F0 bits, wherein each third bit subset in another part of the third bit subsets comprises F2 bits, and F2 is an even number greater than 1 and less than F0; Perform FEC encoding on the sixth bit set to obtain the fourth bit set.

21. The method according to claim 19 or 20, characterized in that The number of bits in the first bit set is an integer multiple of 2, 4, 8, or 16, the second bit set includes 2048 bits, the third bit set includes 1504 bits, and the fourth bit set includes 4096 bits.

22. The method according to any one of claims 19 to 21, characterized in that d scr It is an integer multiple of 4×k, q=10280.

23. The method according to any one of claims 19 to 22, characterized in that r=79,d CP =328,k=3224; Or, r = 83, d CP =32, k=3386; Or, r = 83, d CP =536, k=3388; Or, r = 87, d CP =72, k=2662; Or, r = 87, d CP =744, k=2664; Or, r = 87, d CP =3432, k=2672; Or, r = 104, d CP =704, k=3184; Or, r = 104, d CP =3392, k=3192; Or, r = 105, d CP =504, k=3214; Or, r = 105, d CP =1176, k=3216; Or, r = 109, d CP =40, k=2668; Or, r = 109, d CP =880, k=2670; Or, r = 110, d CP =176, k=3366; Or, r = 110, d CP =848, k=3368; Or, r = 110, d CP =3536, k=3376; Or, r = 111, d CP =648, k=3398; Or, r = 131, d CP =8, k=2672; Or, r = 131, d CP =1016, k=2674; Or, r = 131, d CP =680, k=3208; Or, r = 132, d CP =480, k=3232; Or, r = 132, d CP =1320, k=3234; Or, r = 137, d CP =320, k=3354; Or, r = 137, d CP =1160, k=3356; Or, r = 138, d CP =120, k=3378; Or, r = 138, d CP =960, k=3380; Or, r = 152, d CP =344, k=2658; Or, r = 152, d CP =1520, k=2660; Or, r = 153, d CP =648, k=2676; Or, r = 157, d CP =856, k=3204; Or, r = 158, d CP =656, k=3224; Or, r = 165, d CP =264, k=3366; Or, r = 165, d CP =1272, k=3368; Or, r = 166, d CP =64, k=3386; Or, r = 166, d CP =1072, k=3388; Or, r = 174, d CP =144, k=2662; Or, r = 174, d CP =1488, k=2664; Or, r = 175, d CP =616, k=2678; Or, r = 183, d CP =360, k=3200; Or, r = 183, d CP =1536, k=3202; Or, r = 184, d CP =664, k=3218; Or, r = 184, d CP =1840, k=3220; Or, r = 185, d CP =968, k=3236; Or, r = 192, d CP =744, k=3358; Or, r = 192, d CP =1920, k=3360; Or, r = 193, d CP =1048, k=3376; Or, r = 194, d CP =176, k=3392; Or, r = 194, d CP =1352, k=3394; Or, r = 196, d CP =616, k=2666; Or, r = 209, d CP =536, k=3198; Or, r = 209, d CP =1880, k=3200; Or, r = 210, d CP =1008, k=3214; Or, r = 211, d CP =136, k=3228; Or, r = 211, d CP =1480, k=3230; Or, r = 217, d CP =280, k=2656; Or, r = 217, d CP =1960, k=2658; Or, r = 218, d CP =80, k=2668; Or, r = 218, d CP =1760, k=2670; Or, r = 219, d CP =1224, k=3352; Or, r = 220, d CP =352, k=3366; Or, r = 220, d CP =1696, k=3368; Or, r = 221, d CP =824, k=3382; Or, r = 221, d CP =2168, k=3384; Or, r = 222, d CP =1296, k=3398; Or, r = 235, d CP =376, k=3196; Or, r = 235, d CP =1888, k=3198; Or, r = 236, d CP =680, k=3210; Or, r = 236, d CP =2192, k=3212; Or, r = 237, d CP =984, k=3224; Or, r = 238, d CP =1288, k=3238; Or, r = 239, d CP =920, k=2660; Or, r = 240, d CP =1728, k=2672; Or, r = 247, d CP =1000, k=3360; Or, r = 247, d CP =2512, k=3362; Or, r = 248, d CP =1304, k=3374; Or, r = 249, d CP =96, k=3386; Or, r = 249, d CP =1608, k=3388; Or, r = 250, d CP =400, k=3400; Or, r = 250, d CP =1912, k=3402; Or, r = 261, d CP =216, k=2662; Or, r = 261, d CP =2232, k=2664; Or, r = 261, d CP =1560, k=3196; Or, r = 262, d CP =16, k=2672; Or, r = 262, d CP =2032, k=2674; Or, r = 262, d CP =1360, k=3208; Or, r = 263, d CP =1160, k=3220; Or, r = 264, d CP =960, k=3232; Or, r = 264, d CP =2640, k=3234; Or, r = 274, d CP =640, k=3354; Or, r = 274, d CP =2320, k=3356; Or, r = 275, d CP =440, k=3366; Or, r = 275, d CP =2120, k=3368; Or, r = 276, d CP =240, k=3378; Or, r = 276, d CP =1920, k=3380; Or, r = 277, d CP =40, k=3390; Or, r = 277, d CP =1720, k=3392; Or, r = 283, d CP =2032, k=2666; Or, r = 284, d CP =488, k=2674; Or, r = 284, d CP =2672, k=2676; Or, r = 287, d CP =896, k=3194; Or, r = 287, d CP =2744, k=3196; Or, r = 288, d CP =1704, k=3206; Or, r = 289, d CP =664, k=3216; Or, r = 289, d CP =2512, k=3218; Or, r = 290, d CP =1472, k=3228; Or, r = 291, d CP =432, k=3238; Or, r = 291, d CP =2280, k=3240; Or, r = 302, d CP =80, k=3360; Or, r = 302, d CP =1928, k=3362; Or, r = 303, d CP =888, k=3372; Or, r = 303, d CP =2736, k=3374; Or, r = 304, d CP =688, k=2658; Or, r = 304, d CP =3040, k=2660; Or, r = 304, d CP =1696, k=3384; Or, r = 305, d CP =2168, k=2668; Or, r = 305, d CP =656, k=3394; Or, r = 305, d CP =2504, k=3396; Or, r = 306, d CP =1296, k=2676; Or, r = 313, d CP =1912, k=3194; Or, r = 314, d CP =1712, k=3204; Or, r = 315, d CP =1512, k=3214; Or, r = 316, d CP =1312, k=3224; Or, r = 317, d CP =1112, k=3234; Or, r = 317, d CP =3128, k=3236; Or, r = 326, d CP =320, k=2660; Or, r = 326, d CP =2840, k=2662; Or, r = 327, d CP =120, k=2668; Or, r = 327, d CP =2640, k=2670; Or, r = 328, d CP =2440, k=2678; Or, r = 329, d CP =728, k=3356; Or, r = 329, d CP =2744, k=3358; Or, r = 330, d CP =528, k=3366; Or, r = 330, d CP =2544, k=3368; Or, r = 331, d CP =328, k=3376; Or, r = 331, d CP =2344, k=3378; Or, r = 332, d CP =128, k=3386; Or, r = 332, d CP =2144, k=3388; Or, r = 333, d CP =1944, k=3398; Or, r = 339, d CP =744, k=3192; Or, r = 339, d CP =2928, k=3194; Or, r = 340, d CP =1384, k=3202; Or, r = 341, d CP =2024, k=3212; Or, r = 342, d CP =480, k=3220; Or, r = 342, d CP =2664, k=3222; Or, r = 343, d CP =1120, k=3230; Or, r = 343, d CP =3304, k=3232; Or, r = 344, d CP =1760, k=3240; Or, r = 348, d CP =288, k=2662; Or, r = 348, d CP =2976, k=2664; Or, r = 349, d CP =760, k=2670; Or, r = 349, d CP =3448, k=2672; Or, r = 350, d CP =1232, k=2678; Or, r = 356, d CP =704, k=3352; Or, r = 356, d CP =2888, k=3354; Or, r = 357, d CP =1344, k=3362; Or, r = 357, d CP =3528, k=3364; Or, r = 358, d CP =1984, k=3372; Or, r = 359, d CP =440, k=3380; Or, r = 359, d CP =2624, k=3382; Or, r = 360, d CP =1080, k=3390; Or, r = 360, d CP =3264, k=3392; Or, r = 361, d CP =1720, k=3400; Or, r = 365, d CP =1592, k=3192; Or, r = 366, d CP =720, k=3200; Or, r = 366, d CP =3072, k=3202; Or, r = 367, d CP =2200, k=3210; Or, r = 368, d CP =1328, k=3218; Or, r = 368, d CP =3680, k=3220; Or, r = 369, d CP =2304, k=2658; Or, r = 369, d CP =456, k=3226; Or, r = 369, d CP =2808, k=3228; Or, r = 370, d CP =592, k=2664; Or, r = 370, d CP =3448, k=2666; Or, r = 370, d CP =1936, k=3236; Or, r = 371, d CP =1736, k=2672; Or, r = 384, d CP =1488, k=3358; Or, r = 384, d CP =3840, k=3360; Or, r = 385, d CP =616, k=3366; Or, r = 385, d CP =2968, k=3368; Or, r = 386, d CP =2096, k=3376; Or, r = 387, d CP =1224, k=3384; Or, r = 387, d CP =3576, k=3386; Or, r = 388, d CP =352, k=3392; Or, r = 388, d CP =2704, k=3394; Or, r = 389, d CP =1832, k=3402; Or, r = 391, d CP =2440, k=2660; Or, r = 392, d CP =1232, k=2666; Or, r = 392, d CP =2240, k=3200; Or, r = 393, d CP =24, k=2672; Or, r = 393, d CP =3048, k=2674; Or, r = 393, d CP =2040, k=3208; Or, r = 394, d CP =1840, k=3216; Or, r = 395, d CP =1640, k=3224; Or, r = 396, d CP =1440, k=3232; Or, r = 396, d CP =3960, k=3234; Or, r = 397, d CP =1240, k=3240; Or, r = 397, d CP =3760, k=3242; Or, r = 411, d CP =960, k=3354; Or, r = 411, d CP =3480, k=3356; Or, r = 412, d CP =760, k=3362; Or, r = 412, d CP =3280, k=3364; Or, r = 413, d CP =2912, k=2662; Or, r = 413, d CP =560, k=3370; Or, r = 413, d CP =3080, k=3372; Or, r = 414, d CP =2208, k=2668; Or, r = 414, d CP =360, k=3378; Or, r = 414, d CP =2880, k=3380; Or, r = 415, d CP =1504, k=2674; Or, r = 415, d CP =160, k=3386; Or, r = 415, d CP =2680, k=3388; Or, r = 416, d CP =2480, k=3396; Or, r = 418, d CP =1072, k=3198; Or, r = 418, d CP =3760, k=3200; Or, r = 419, d CP =1544, k=3206; Or, r = 419, d CP =4232, k=3208; Or, r = 420, d CP =2016, k=3214; Or, r = 421, d CP =2488, k=3222; Or, r = 422, d CP =272, k=3228; Or, r = 422, d CP =2960, k=3230; Or, r = 423, d CP =744, k=3236; Or, r = 423, d CP =3432, k=3238; Or, r = 434, d CP =560, k=2656; Or, r = 434, d CP =3920, k=2658; Or, r = 435, d CP =360, k=2662; Or, r = 435, d CP =3720, k=2664; Or, r = 436, d CP =160, k=2668; Or, r = 436, d CP =3520, k=2670; Or, r = 437, d CP =3320, k=2676; Or, r = 438, d CP =2448, k=3352; Or, r = 439, d CP =232, k=3358; Or, r = 439, d CP =2920, k=3360; Or, r = 440, d CP =704, k=3366; Or, r = 440, d CP =3392, k=3368; Or, r = 441, d CP =1176, k=3374; Or, r = 441, d CP =3864, k=3376; Or, r = 442, d CP =1648, k=3382; Or, r = 442, d CP =4336, k=3384; Or, r = 443, d CP =2120, k=3390; Or, r = 444, d CP =2424, k=3198; Or, r = 444, d CP =2592, k=3398; Or, r = 445, d CP =712, k=3204; Or, r = 445, d CP =3568, k=3206; Or, r = 446, d CP =1856, k=3212; Or, r = 447, d CP =144, k=3218; Or, r = 447, d CP =3000, k=3220; Or, r = 448, d CP =1288, k=3226; Or, r = 448, d CP =4144, k=3228; Or, r = 449, d CP =2432, k=3234; Or, r = 456, d CP =1032, k=2658; Or, r = 456, d CP =4560, k=2660; Or, r = 457, d CP =1336, k=2664; Or, r = 458, d CP =1640, k=2670; Or, r = 459, d CP =1944, k=2676; Or, r = 466, d CP =1888, k=3356; Or, r = 466, d CP =4744, k=3358; Or, r = 467, d CP =176, k=3362; Or, r = 467, d CP =3032, k=3364; Or, r = 468, d CP =1320, k=3370; Or, r = 468, d CP =4176, k=3372; Or, r = 469, d CP =2464, k=3378; Or, r = 470, d CP =752, k=3196; Or, r = 470, d CP =3776, k=3198; Or, r = 470, d CP =752, k=3384; Or, r = 470, d CP =3608, k=3386; Or, r = 471, d CP =2568, k=3204; Or, r = 471, d CP =1896, k=3392; Or, r = 471, d CP =4752, k=3394; Or, r = 472, d CP =1360, k=3210; Or, r = 472, d CP =4384, k=3212; Or, r = 472, d CP =184, k=3398; Or, r = 472, d CP =3040, k=3400; Or, r = 473, d CP =152, k=3216; Or, r = 473, d CP =3176, k=3218; Or, r = 474, d CP =1968, k=3224; Or, r = 475, d CP =760, k=3230; Or, r = 475, d CP =3784, k=3232; Or, r = 476, d CP =2576, k=3238; Or, r = 478, d CP =1840, k=2660; Or, r = 479, d CP =2648, k=2666; Or, r = 480, d CP =3456, k=2672; Or, r = 481, d CP =568, k=2676; Or, r = 481, d CP =4264, k=2678; Or, r = 493, d CP =184, k=3352; Or, r = 493, d CP =3208, k=3354; Or, r = 494, d CP =2000, k=3360; Or, r = 494, d CP =5024, k=3362; Or, r = 495, d CP =792, k=3366; Or, r = 495, d CP =3816, k=3368; Or, r = 496, d CP =1936, k=3196; Or, r = 496, d CP =2608, k=3374; Or, r = 497, d CP =1232, k=3202; Or, r = 497, d CP =4424, k=3204; Or, r = 497, d CP =1400, k=3380; Or, r = 497, d CP =4424, k=3382; Or, r = 498, d CP =528, k=3208; Or, r = 498, d CP =3720, k=3210; Or, r = 498, d CP =192, k=3386; Or, r = 498, d CP =3216, k=3388; Or, r = 499, d CP =1672, k=2656; Or, r = 499, d CP =3016, k=3216; Or, r = 499, d CP =2008, k=3394; Or, r = 499, d CP =5032, k=3396; Or, r = 500, d CP =2984, k=2662; Or, r = 500, d CP =2312, k=3222; Or, r = 500, d CP =800, k=3400; Or, r = 500, d CP =3824, k=3402; Or, r = 501, d CP =432, k=2666; Or, r = 501, d CP =4296, k=2668; Or, r = 501, d CP =1608, k=3228; Or, r = 501, d CP =4800, k=3230; Or, r = 502, d CP =1744, k=2672; Or, r = 502, d CP =904, k=3234; Or, r = 502, d CP =4096, k=3236; Or, r = 503, d CP =3056, k=2678.

24. The method according to any one of claims 19 to 23, characterized in that d scr =336×k。 25. The method according to any one of claims 19 to 24, characterized in that Performing CRC on the first data includes: Perform CRC-32 check on a total of r×q / p bits in each r / p rows of the first data to add a check bit with a length of 32 bits, d cRC =32×p, r is divisible by p, and p is an integer greater than 1; or, For the first data, the first r F0 ×(p-1) rows of each r F0 Rows total q×r F0 The CRC-32 check is performed on the last r bits of the first data to add a check bit with a length of 32 bits. F1 Rows total q×r F1 bits are CRC-32 checked to add a check bit with a length of 32 bits, where d CRC =32×p, r cannot be divided by p, p is an integer greater than 1, r F0 ×(p-1)+r F1 = r, integer r F0 Greater than integer r F1 .

26. The method according to any one of claims 19 to 25, characterized in that q=2056。 27. The method according to claim 26, characterized in that Performing CRC on the first data includes: For the first data, the first r F0 ×(p-1) rows of each r F0 Rows total q×r F0 The CRC-32 check is performed on the last r bits of the first data to add a check bit with a length of 32 bits. F1 Rows total q×r F1 bits are CRC-32 checked to add a check bit with a length of 32 bits, where d CRC =32×p, r cannot be divided by p, p is an integer greater than 1, r F0 ×(p-1)+r F1 = r, integer r F0 Greater than integer r F1 .

28. The method according to claim 26 or 27, characterized in that r=435。 29. The method according to claim 28, characterized in that p=22,r F0 =20, r F1 =15, performing CRC on the first data includes: A CRC-32 check is performed on every 20 rows of the first 420 rows in the first data, totaling 41,120 bits, to add a check bit with a length of 32 bits, and a CRC-32 check is performed on the last 15 rows of the first data, totaling 30,840 bits, to add a check bit with a length of 32 bits.

30. The method according to claim 28 or 29, characterized in that d CP =3432, k = 2672, or, d CP =744, k=2664.

31. The method according to claim 26 or 27, characterized in that r=546,d CP =1008,k=3344; Or, r = 546, d CP =3696, k=3352; Or, r = 547, d CP =1640, k=3352; Or, r = 547, d CP =4328, k=3360; Or, r = 548, d CP =2272, k=3360; Or, r = 548, d CP =4960, k=3368; Or, r = 549, d CP =216, k=3360; Or, r = 549, d CP =2904, k=3368; Or, r = 549, d CP =5592, k=3376; Or, r = 550, d CP =848, k=3368; Or, r = 550, d CP =3536, k=3376; Or, r = 551, d CP =1480, k=3376; Or, r = 551, d CP =4168, k=3384; Or, r = 552, d CP =2112, k=3384; Or, r = 552, d CP =4800, k=3392; Or, r = 553, d CP =56, k=3384; Or, r = 553, d CP =2744, k=3392; Or, r = 553, d CP =5432, k=3400; Or, r = 554, d CP =688, k=3392; Or, r = 554, d CP =3376, k=3400; Or, r = 555, d CP =1320, k=3400; Or, r = 555, d CP =4008, k=3408; Or, r = 556, d CP =1952, k=3408; Or, r = 556, d CP =4640, k=3416; Or, r = 557, d CP =2584, k=3416; Or, r = 557, d CP =5272, k=3424; Or, r = 558, d CP =528, k=3416; Or, r = 558, d CP =3216, k=3424; Or, r = 559, d CP =1160, k=3424; Or, r = 559, d CP =3848, k=3432; Or, r = 560, d CP =1792, k=3432; Or, r = 560, d CP =4480, k=3440; Or, r = 561, d CP =2424, k=3440; Or, r = 561, d CP =5112, k=3448; Or, r = 562, d CP =368, k=3440; Or, r = 562, d CP =3056, k=3448; Or, r = 562, d CP =5744, k=3456.

32. The method according to claim 26 or 27, characterized in that r=520,d CP =704,k=3184; Or, r = 520, d CP =3392, k=3192; Or, r = 520, d CP =6080, k=3200; Or, r = 521, d CP =1336, k=3192; Or, r = 521, d CP =4024, k=3200; Or, r = 522, d CP =1968, k=3200; Or, r = 522, d CP =4656, k=3208; Or, r = 523, d CP =2600, k=3208; Or, r = 523, d CP =5288, k=3216; Or, r = 524, d CP =544, k=3208; Or, r = 524, d CP =3232, k=3216; Or, r = 525, d CP =1176, k=3216; Or, r = 525, d CP =3864, k=3224; Or, r = 526, d CP =1808, k=3224; Or, r = 526, d CP =4496, k=3232; Or, r = 527, d CP =2440, k=3232; Or, r = 527, d CP =5128, k=3240; Or, r = 528, d CP =384, k=3232; Or, r = 528, d CP =3072, k=3240; Or, r = 528, d CP =5760, k=3248; Or, r = 529, d CP =1016, k=3240; Or, r = 529, d CP =3704, k=3248; Or, r = 530, d CP =1648, k=3248; Or, r = 530, d CP =4336, k=3256; Or, r = 531, d CP =2280, k=3256; Or, r = 531, d CP =4968, k=3264; Or, r = 532, d CP =2912, k=3264; Or, r = 532, d CP =224, k=3256; Or, r = 533, d CP =856, k=3264; Or, r = 533, d CP =3544, k=3272; Or, r = 534, d CP =1488, k=3272; Or, r = 534, d CP =4176, k=3280; Or, r = 535, d CP =2120, k=3280; Or, r = 535, d CP =4808, k=3288.

33. The method according to any one of claims 19 to 32, characterized in that The fourth bit set includes m0 first bit subsets, where m0 is an integer greater than 1, and after performing the FEC encoding on the second bit set and the third bit set to obtain the fourth bit set, the method further includes: A first interleaving process is performed on the fourth bit set to obtain a fifth bit set, the fifth bit set including m0 second bit subsets, each of the second bit subsets including 256 bits, 128 bits of each of the second bit subsets coming from the second bit set, and the other 128 bits of each of the second bit subsets coming from the third bit set and / or the check bits of the FEC code.

34. The method according to claim 33, characterized in that Each of the second bit subsets includes consecutive 256 bits.

35. The method according to claim 33, characterized in that Each of the second bit subsets is presented as a square matrix.

36. The method according to any one of claims 33 to 35, characterized in that The 256 bits of the second bit subset are distributed into 16 rows and 16 columns, and the bits in the second bit subset satisfy one or more of the following: The bits in row 0 and columns 2, 3, 6, 7, 10, 11, 14, and 15 of the second bit subset are from the second bit set; The bits in row 1 and columns 0, 3, 4, 7, 8, 11, 12, and 15 of the second bit subset are from the second bit set; The bits in the second row and columns 0, 1, 4, 5, 8, 9, 12, and 13 in the second bit subset are from the second bit set; The bits in the third row and the first, second, fifth, sixth, ninth, tenth, third, and fourth columns of the second bit subset are from the second bit set; The bits in the 4th row and the 2nd, 3rd, 6th, 7th, 10th, 11th, 14th, and 15th columns of the second bit subset are from the second bit set; The bits in row 5 and columns 0, 3, 4, 7, 8, 11, 12, and 15 of the second bit subset are from the second bit set; The bits in row 6 and columns 0, 1, 4, 5, 8, 9, 12, and 13 in the second bit subset are from the second bit set; The bits in row 7 and columns 1, 2, 5, 6, 9, 10, 13, and 14 of the second bit subset are from the second bit set; The bits in row 8 and columns 2, 3, 6, 7, 10, 11, 14, and 15 in the second bit subset are from the second bit set; The bits in row 9 and columns 0, 3, 4, 7, 8, 11, 12, and 15 of the second bit subset are from the second bit set; The bits in the 10th row and the 0th, 1st, 4th, 5th, 8th, 9th, 12th, and 13th columns of the second bit subset are from the second bit set; The bits in the 11th row and the 1st, 2nd, 5th, 6th, 9th, 10th, 13th and 14th columns of the second bit subset are from the second bit set; The bits in the 12th row and the 2nd, 3rd, 6th, 7th, 10th, 11th, 14th, and 15th columns of the second bit subset are from the second bit set; The bits in row 13 and columns 0, 3, 4, 7, 8, 11, 12, and 15 of the second bit subset are from the second bit set; The bits in row 14 and columns 0, 1, 4, 5, 8, 9, 12, and 13 in the second bit subset are from the second bit set; The bits in row 15 and columns 1, 2, 5, 6, 9, 10, 13, and 14 in the second bit subset are from the second bit set.

37. The method according to any one of claims 33 to 36, characterized in that The m0×256 bits in the fourth bit set are distributed as 32 rows and m0×8 columns, the m0×256 bits in the fifth bit set are distributed as 32 rows and m0×8 columns, the m0×8 bits in the r1th row in the fifth bit set come from the m0×8 bits in the r0th row in the fourth bit set, wherein 0≤r0<32, 0≤r1<32.

38. The method according to claim 37, characterized in that r0=r1。 39. The method according to any one of claims 19 to 38, characterized in that The fourth bit set includes m0 first bit subsets, where m0=12 or 16.

40. The method according to any one of claims 33 to 39, characterized in that After performing the first interleaving process on the fourth bit set to obtain a fifth bit set, the method further includes: Performing a second interleaving process on every two first bit streams among the L first bit streams to obtain a total of L / 2 second bit streams, each of the first bit streams includes a plurality of the fifth bit sets, and L is an even number greater than 0; Performing symbol mapping and polarization division on L / 2 of the second bit streams to obtain a dual-polarization symbol stream, wherein the symbol mapping and The polarization division maps t bits into one dual-polarization symbol, where t is an integer greater than 0; The dual-polarization symbol stream is subjected to digital signal processing (DSP) framing.

41. The method according to claim 40, characterized in that The amplitude bits in the dual-polarization symbol are from the second bit set.

42. The method according to claim 41, characterized in that t=8, the dual-polarization symbol is a dual-polarization DP-16QAM symbol.

43. The method according to claim 42, characterized in that Performing DSP framing on the dual-polarization symbol stream includes: Every 172032 dual-polarization DP-16QAM symbols are framed to obtain a DSP superframe, and the superframe contains 175104 dual-polarization symbols.

44. The method according to claim 43, characterized in that Obtaining the first data from the data frame includes: Get F from the data frame Frame The first data to get F Frame ×r×q bits, F Frame is an integer greater than 0; d scr ×F Frame =336×k×F DSP ; Among them, F DSP represents the number of DSP superframes, F DSP A DSP superframe consists of F Frame The first data is processed and F DSP An integer greater than 0.

45. The method according to claim 44, characterized in that F DSP >1, the F DSP A plurality of continuous symbols in the first DSP superframe in the DSP superframes are the first identifier, and the F DSP A plurality of consecutive symbols in each DSP superframe in a DSP superframe except the first DSP superframe are the second identifier.

46. ​​A data processing method, characterized in that: include: Performing a first probability constellation shaping PCS process on a first bit set in the first group of k bits to obtain a second bit set, where the second bit set includes m0×128 bits, k is an integer greater than 1, and m0 is an integer greater than 1; Performing a first forward error correction (FEC) encoding on the second bit set and a third bit set in the first group of k bits except the first bit set to obtain a fourth bit set, wherein the fourth bit set includes m0 first bit squares, and each of the first bit squares includes 256 bits distributed in 16 rows and 16 columns; Performing a second PCS process on a fifth bit set in the second group of k bits to obtain a sixth bit set; Performing second FEC encoding on the sixth bit set and the seventh bit set in the second group of k bits except the fifth bit set to obtain an eighth bit set, wherein the eighth bit set includes m0 second bit square matrices, each of which includes 256 bits distributed in 16 rows and 16 columns; Input 21 of the fourth bit sets and 21 of the eighth bit sets into an interleaving buffer, wherein the interleaving buffer comprises 84×m1 buffer units distributed as 84 rows and m1 columns, m0=m1×2, each of the buffer units is used to buffer 16 rows and 16 columns, a total of 256 bits, 42×m1 of the first bit squares are input into the even rows of the interleaving buffer, 42×m1 of the second bit squares are input into the odd rows of the interleaving buffer, the interleaving buffer comprises a first buffer subset and a second buffer subset, the first buffer subset comprises 42×m1 of the buffer units, the second buffer subset comprises 42×m1 of the buffer units, the bits input into the first buffer subset come from the second bit set and the sixth bit set, the bits input into the second buffer subset come from the third bit set, the seventh bit set, the check bits of the first FEC code, and the check bits of the second FEC code; Symbol mapping and polarization division are performed on every 8 bits in the interleaved cache to obtain a dual-polarization DP-16QAM symbol, and 2 amplitude bits of the 4 bits corresponding to the 16QAM symbol of the DP-16QAM symbol in the target polarization direction come from a column in the first cache unit of the first cache subset, and 2 sign bits of the 4 bits corresponding to the 16QAM symbol of the DP-16QAM symbol in the target polarization direction come from a column in the second cache unit of the second cache subset.

47. The method according to claim 46, characterized in that Four bits of the eight bits come from a column of a first cache unit of the first cache subset, and another four bits of the eight bits come from a column of a second cache unit of the second cache subset.

48. The method according to claim 46 or 47, characterized in that The m0 first bit matrixes are distributed into 2 rows and m1 columns, wherein the first bit matrix at the 0th row and m2th column and the first bit matrix at the 1st row and m2th column are from the second bit set, and the m0 second bit matrixes are distributed into 2 rows and m1 columns, wherein the second bit matrix at the 0th row and m2th column and the second bit matrix at the 1st row and m2th column are from the sixth bit set, 0≤m2<m1 / 2.

49. The method according to claim 48, characterized in that m0=16, the first cache subset includes 336 cache units in columns 0, 1, 2, and 3 of the interleaved cache, and the second cache subset includes 336 cache units in columns 4, 5, 6, and 7 of the interleaved cache; Alternatively, m0=12, the first cache subset includes a total of 252 cache units in columns 0, 1, and 2 of the interleaved cache, and the second cache subset includes a total of 252 cache units in columns 3, 4, and 5 of the interleaved cache.

50. The method according to claim 46 or 47, characterized in that m0=16,m1=8; The m0 first bit squares are distributed into 2 rows and m1 columns, and the first bit square in the 0th row and 0th column, the first bit square in the 0th row and 1st column, the first bit square in the 0th row and 4th column, the first bit square in the 0th row and 5th column, the first bit square in the 1st row and 0th column, the first bit square in the 1st row and 1st column, the first bit square in the 1st row and 4th column, and the first bit square in the 1st row and 5th column are from the second bit set; The m0 second bit matrixes are distributed as 2 rows and m1 columns, and the second bit matrix at row 0 and column 0, the second bit matrix at row 0 and column 1, the second bit matrix at row 0 and column 4, the second bit matrix at row 0 and column 5, the second bit matrix at row 1 and column 0, the second bit matrix at row 1 and column 1, the second bit matrix at row 1 and column 4 and the second bit matrix at row 1 and column 5 are from the sixth bit set.

51. The method according to claim 50, characterized in that The first cache subset includes 336 cache units in columns 0, 1, 4 and 5 of the interleaved cache, and the second cache subset includes 336 cache units in columns 2, 3, 6 and 7 of the interleaved cache.

52. A data processing device, characterized in that: include: A probability constellation shaping PCS unit, a forward error correction FEC encoding unit and a first interleaving processing unit; The PCS unit is used to: perform PCS processing on a first bit set of k bits to obtain a second bit set, where k is an integer greater than 1; The FEC unit is used to: perform FEC encoding on the second bit set and a third bit set of the k bits except the first bit set to obtain a fourth bit set, wherein the fourth bit set includes m0 first bit subsets, each of the first bit subsets includes F0 bits, m0 is an integer greater than 1, and F0 is an even number greater than 1; The first interleaving processing unit is used to: perform a first interleaving process on the fourth bit set to obtain a fifth bit set, the fifth bit set includes m0 second bit subsets, each of the second bit subsets includes F0 bits, F0 / 2 bits in each of the second bit subsets come from the second bit set, and the other F0 / 2 bits in each of the second bit subsets come from the third bit set and / or the check bits of the FEC code.

53. The data processing device according to claim 52, characterized in that: The fifth bit set includes m0×F0 bits, and each of the second bit subsets includes consecutive F0 bits.

54. The data processing device according to claim 52, characterized in that: Each of the second bit subsets is presented as a square matrix.

55. The data processing device according to any one of claims 52 to 54, characterized in that: The F0 bits in each of the second bit subsets are distributed as F1 rows and F1 columns, F1 / 2 bits of the F1 bits in each row of the second bit subset come from the second bit set, the second bit set includes m0×F0 / 2 bits, and the other F1 / 2 bits of the F1 bits in each row of the second bit subset come from the third bit set and / or the check bits of the FEC encoding.

56. The data processing device according to claim 55, characterized in that: F0=256, F1=16.

57. The data processing device according to claim 55 or 56, characterized in that: F0=256, F1=16, the i2th row and the The bits of the column are from the second bit set, 0≤i2<16, 0≤j2<8; Alternatively, the bit in the i2th row and the (j2×2-i2%2+1)th column in the second bit subset is from the second bit set, 0≤i2<16, 0≤j2<8; in, It means rounding a down, and b%c means taking the modulus of b over c.

58. The data processing device according to claim 55 or 56, characterized in that: F0=256, F1=16, the bits in the second bit subset satisfy one or more of the following: The bits in row 0 and columns 2, 3, 6, 7, 10, 11, 14, and 15 of the second bit subset are from the second bit set; The bits in row 1 and columns 0, 3, 4, 7, 8, 11, 12, and 15 of the second bit subset are from the second bit set; The bits in the second row and columns 0, 1, 4, 5, 8, 9, 12, and 13 in the second bit subset are from the second bit set; The bits in the third row and the first, second, fifth, sixth, ninth, tenth, third, and fourth columns of the second bit subset are from the second bit set; The bits in the 4th row and the 2nd, 3rd, 6th, 7th, 10th, 11th, 14th, and 15th columns of the second bit subset are from the second bit set; The bits in row 5 and columns 0, 3, 4, 7, 8, 11, 12, and 15 of the second bit subset are from the second bit set; The bits in row 6 and columns 0, 1, 4, 5, 8, 9, 12, and 13 in the second bit subset are from the second bit set; The bits in row 7 and columns 1, 2, 5, 6, 9, 10, 13, and 14 of the second bit subset are from the second bit set; The bits in row 8 and columns 2, 3, 6, 7, 10, 11, 14, and 15 in the second bit subset are from the second bit set; The bits in row 9 and columns 0, 3, 4, 7, 8, 11, 12, and 15 of the second bit subset are from the second bit set; The bits in the 10th row and the 0th, 1st, 4th, 5th, 8th, 9th, 12th, and 13th columns of the second bit subset are from the second bit set; The bits in the 11th row and the 1st, 2nd, 5th, 6th, 9th, 10th, 13th and 14th columns of the second bit subset are from the second bit set; The bits in the 12th row and the 2nd, 3rd, 6th, 7th, 10th, 11th, 14th, and 15th columns of the second bit subset are from the second bit set; The bits in row 13 and columns 0, 3, 4, 7, 8, 11, 12, and 15 of the second bit subset are from the second bit set; The bits in row 14 and columns 0, 1, 4, 5, 8, 9, 12, and 13 in the second bit subset are from the second bit set; The bits in row 15 and columns 1, 2, 5, 6, 9, 10, 13, and 14 in the second bit subset are from the second bit set.

59. The data processing device according to any one of claims 52 to 58, characterized in that: F0=256, m1 of the first bit subsets in the fourth bit set, a total of m1×256 bits, come from the second bit set, and m0=m1×2.

60. The data processing device according to any one of claims 52 to 59, characterized in that: F0=256, the m0×256 bits in the fourth bit set are distributed as 32 rows and m0×8 columns, the m0×256 bits in the fifth bit set are distributed as 32 rows and m0×8 columns, the m0×8 bits in the r1th row in the fifth bit set come from the m0×8 bits in the r0th row in the fourth bit set, wherein 0≤r0<32, 0≤r1<32.

61. The data processing device according to any one of claims 52 to 60, characterized in that: The data processing device also includes a pre-coding interleaving unit; The pre-coding interleaving unit is used to: perform pre-coding interleaving processing on the second bit set and the third bit set to obtain a sixth bit set, the number of bits in the sixth bit set is equal to the sum of the number of bits in the second bit set and the number of bits in the third bit set, the sixth bit set includes m3 third bit subsets, the m3 third bit subsets are distributed in 2 rows and m4 columns, m3=2×m4, m3 is an integer greater than 1 and less than m0, each third bit subset in a part of the third bit subsets includes F0 bits, each third bit subset in another part of the third bit subsets includes F2 bits, and F2 is an even number greater than 1 and less than F0; The FEC unit is used to: perform FEC encoding on the sixth bit set to obtain the fourth bit set.

62. The data processing device according to claim 61, characterized in that: m3=14, m4=7, F0=256, F2=240, each third bit subset of columns 0 to 5 includes 16 rows and 16 columns of bits, each third bit subset of column 6 includes 16 rows and 15 columns of bits, F0 / 2 bits of each third bit subset of columns 0 to 4 come from the second bit set, another F0 / 2 bits of each third bit subset of columns 0 to 4 come from the third bit set, 9 bits of each row in each third bit subset of column 5 come from the second bit set, another 7 bits of each row in each third bit subset of column 5 come from the third bit set, and F2 bits of each third bit subset of column 6 come from the second bit set.

63. The data processing device according to any one of claims 60 to 62, characterized in that: r0=r1。 64. The data processing device according to any one of claims 52 to 63, characterized in that: m0=12 or 16.

65. The data processing device according to any one of claims 52 to 64, characterized in that: The data processing device also includes a second interleaving processing unit, a symbol mapping unit, a polarization division unit and a digital signal processing DSP framing unit; The second interleaving processing unit is used to: perform second interleaving processing on every two first bit streams among the L first bit streams to obtain a total of L / 2 second bit streams, each of the first bit streams includes a plurality of the fifth bit sets, and L is an even number greater than 0; The symbol mapping unit and the polarization division unit are used to: perform symbol mapping and polarization division on L / 2 second bit streams to obtain a dual-polarization symbol stream, wherein the symbol mapping and the polarization division map t bits into 1 dual-polarization symbol, and t is an integer greater than 0; The DSP framing unit is used to perform DSP framing on the dual-polarization symbol stream.

66. The data processing device according to claim 65, characterized in that The amplitude bits in the dual-polarization symbol are from the second bit set.

67. The data processing device according to claim 66, characterized in that: t=8, the dual-polarization symbol is a dual-polarization DP-16QAM symbol.

68. The data processing device according to claim 67, characterized in that: The DSP framing unit is specifically used for: performing framing processing on every 172032 dual-polarization DP-16QAM symbols to obtain a DSP superframe, and the superframe contains 175104 dual-polarization symbols.

69. The data processing device according to any one of claims 52 to 68, characterized in that: The number of bits in the first bit set is an integer multiple of 2, 4, 8, or 16, the second bit set includes 2048 bits, the third bit set includes 1504 bits, and the fourth bit set includes 4096 bits.

70. A data processing device, characterized in that: include: A first processing unit, a second processing unit, a scrambling unit, a third processing unit, a probabilistic constellation shaping PCS unit and a forward error correction FEC encoding unit; The first processing unit is used to: obtain first data from a data frame, the first data including r rows and q columns of bits, where r is an integer greater than 0, and q is an integer greater than 0; The second processing unit is used to: perform a cyclic redundancy check CRC on the first data and / or insert padding bits to obtain second data, wherein the second data includes d CRC parity bits and / or d PAD Filling bits, d CRC is an integer greater than or equal to 0, d PAD is an integer greater than or equal to 0; The scrambling unit is used to: scramble the second data to obtain third data, the number of bits of the third data is d scr =r×q+d CP , d CP =d CRC +d PAD ; The third processing unit is used to: obtain k bits of the third data, where k is an integer greater than 1, scr is an integer multiple of k; The PCS unit is used to: perform PCS processing on a first bit set among the k bits to obtain a second bit set; The FEC unit is used to perform FEC encoding on the second bit set and a third bit set of the k bits except the first bit set to obtain a fourth bit set.

71. The data processing device according to claim 70, characterized in that: The fourth bit set includes m0 first bit subsets, each of which includes F0 bits, m0 is an integer greater than 1, and F0 is an even number greater than 1. The data processing device also includes a pre-coding interleaving unit, which is used to: Performing pre-coding interleaving processing on the second bit set and the third bit set to obtain a sixth bit set, the number of bits in the sixth bit set being equal to the sum of the number of bits in the second bit set and the number of bits in the third bit set, the sixth bit set comprising m3 third bit subsets, the m3 third bit subsets being distributed in 2 rows and m4 columns, m3=2×m4, m3 being an integer greater than 1 and less than m0, wherein each third bit subset in a part of the third bit subsets comprises F0 bits, wherein each third bit subset in another part of the third bit subsets comprises F2 bits, and F2 is an even number greater than 1 and less than F0; The FEC unit is used to: perform FEC encoding on the sixth bit set to obtain the fourth bit set.

72. The data processing device according to claim 70 or 71, characterized in that: The number of bits in the first bit set is an integer multiple of 2, 4, 8, or 16, the second bit set includes 2048 bits, the third bit set includes 1504 bits, and the fourth bit set includes 4096 bits.

73. The data processing device according to any one of claims 70 to 72, characterized in that: d scr It is an integer multiple of 4×k, q=10280.

74. The data processing device according to any one of claims 70 to 73, characterized in that: r=79,d CP =328,k=3224; Or, r = 83, d CP =32, k=3386; Or, r = 83, d CP =536, k=3388; Or, r = 87, d CP =72, k=2662; Or, r = 87, d CP =744, k=2664; Or, r = 87, d CP =3432, k=2672; Or, r = 104, d CP =704, k=3184; Or, r = 104, d CP =3392, k=3192; Or, r = 105, d CP =504, k=3214; Or, r = 105, d CP =1176, k=3216; Or, r = 109, d CP =40, k=2668; Or, r = 109, d CP =880, k=2670; Or, r = 110, d CP =176, k=3366; Or, r = 110, d CP =848, k=3368; Or, r = 110, d CP =3536, k=3376; Or, r = 111, d CP =648, k=3398; Or, r = 131, d CP =8, k=2672; Or, r = 131, d CP =1016, k=2674; Or, r = 131, d CP =680, k=3208; Or, r = 132, d CP =480, k=3232; Or, r = 132, d CP =1320, k=3234; Or, r = 137, d CP =320, k=3354; Or, r = 137, d CP =1160, k=3356; Or, r = 138, d CP =120, k=3378; Or, r = 138, d CP =960, k=3380; Or, r = 152, d CP =344, k=2658; Or, r = 152, d CP =1520, k=2660; Or, r = 153, d CP =648, k=2676; Or, r = 157, d CP =856, k=3204; Or, r = 158, d CP =656, k=3224; Or, r = 165, d CP =264, k=3366; Or, r = 165, d CP =1272, k=3368; Or, r = 166, d CP =64, k=3386; Or, r = 166, d CP =1072, k=3388; Or, r = 174, d CP =144, k=2662; Or, r = 174, d CP =1488, k=2664; Or, r = 175, d CP =616, k=2678; Or, r = 183, d CP =360, k=3200; Or, r = 183, d CP =1536, k=3202; Or, r = 184, d CP =664, k=3218; Or, r = 184, d CP =1840, k=3220; Or, r = 185, d CP =968, k=3236; Or, r = 192, d CP =744, k=3358; Or, r = 192, d CP =1920, k=3360; Or, r = 193, d CP =1048, k=3376; Or, r = 194, d CP =176, k=3392; Or, r = 194, d CP =1352, k=3394; Or, r = 196, d CP =616, k=2666; Or, r = 209, d CP =536, k=3198; Or, r = 209, d CP =1880, k=3200; Or, r = 210, d CP =1008, k=3214; Or, r = 211, d CP =136, k=3228; Or, r = 211, d CP =1480, k=3230; Or, r = 217, d CP =280, k=2656; Or, r = 217, d CP =1960, k=2658; Or, r = 218, d CP =80, k=2668; Or, r = 218, d CP =1760, k=2670; Or, r = 219, d CP =1224, k=3352; Or, r = 220, d CP =352, k=3366; Or, r = 220, d CP =1696, k=3368; Or, r = 221, d CP =824, k=3382; Or, r = 221, d CP =2168, k=3384; Or, r = 222, d CP =1296, k=3398; Or, r = 235, d CP =376, k=3196; Or, r = 235, d CP =1888, k=3198; Or, r = 236, d CP =680, k=3210; Or, r = 236, d CP =2192, k=3212; Or, r = 237, d CP =984, k=3224; Or, r = 238, d CP =1288, k=3238; Or, r = 239, d CP =920, k=2660; Or, r = 240, d CP =1728, k=2672; Or, r = 247, d CP =1000, k=3360; Or, r = 247, d CP =2512, k=3362; Or, r = 248, d CP =1304, k=3374; Or, r = 249, d CP =96, k=3386; Or, r = 249, d CP =1608, k=3388; Or, r = 250, d CP =400, k=3400; Or, r = 250, d CP =1912, k=3402; Or, r = 261, d CP =216, k=2662; Or, r = 261, d CP =2232, k=2664; Or, r = 261, d CP =1560, k=3196; Or, r = 262, d CP =16, k=2672; Or, r = 262, d CP =2032, k=2674; Or, r = 262, d CP =1360, k=3208; Or, r = 263, d CP =1160, k=3220; Or, r = 264, d CP =960, k=3232; Or, r = 264, d CP =2640, k=3234; Or, r = 274, d CP =640, k=3354; Or, r = 274, d CP =2320, k=3356; Or, r = 275, d CP =440, k=3366; Or, r = 275, d CP =2120, k=3368; Or, r = 276, d CP =240, k=3378; Or, r = 276, d CP =1920, k=3380; Or, r = 277, d CP =40, k=3390; Or, r = 277, d CP =1720, k=3392; Or, r = 283, d CP =2032, k=2666; Or, r = 284, d CP =488, k=2674; Or, r = 284, d CP =2672, k=2676; Or, r = 287, d CP =896, k=3194; Or, r = 287, d CP =2744, k=3196; Or, r = 288, d CP =1704, k=3206; Or, r = 289, d CP =664, k=3216; Or, r = 289, d CP =2512, k=3218; Or, r = 290, d CP =1472, k=3228; Or, r = 291, d CP =432, k=3238; Or, r = 291, d CP =2280, k=3240; Or, r = 302, d CP =80, k=3360; Or, r = 302, d CP =1928, k=3362; Or, r = 303, d CP =888, k=3372; Or, r = 303, d CP =2736, k=3374; Or, r = 304, d CP =688, k=2658; Or, r = 304, d CP =3040, k=2660; Or, r = 304, d CP =1696, k=3384; Or, r = 305, d CP =2168, k=2668; Or, r = 305, d CP =656, k=3394; Or, r = 305, d CP =2504, k=3396; Or, r = 306, d CP =1296, k=2676; Or, r = 313, d CP =1912, k=3194; Or, r = 314, d CP =1712, k=3204; Or, r = 315, d CP =1512, k=3214; Or, r = 316, d CP =1312, k=3224; Or, r = 317, d CP =1112, k=3234; Or, r = 317, d CP =3128, k=3236; Or, r = 326, d CP =320, k=2660; Or, r = 326, d CP =2840, k=2662; Or, r = 327, d CP =120, k=2668; Or, r = 327, d CP =2640, k=2670; Or, r = 328, d CP =2440, k=2678; Or, r = 329, d CP =728, k=3356; Or, r = 329, d CP =2744, k=3358; Or, r = 330, d CP =528, k=3366; Or, r = 330, d CP =2544, k=3368; Or, r = 331, d CP =328, k=3376; Or, r = 331, d CP =2344, k=3378; Or, r = 332, d CP =128, k=3386; Or, r = 332, d CP =2144, k=3388; Or, r = 333, d CP =1944, k=3398; Or, r = 339, d CP =744, k=3192; Or, r = 339, d CP =2928, k=3194; Or, r = 340, d CP =1384, k=3202; Or, r = 341, d CP =2024, k=3212; Or, r = 342, d CP =480, k=3220; Or, r = 342, d CP =2664, k=3222; Or, r = 343, d CP =1120, k=3230; Or, r = 343, d CP =3304, k=3232; Or, r = 344, d CP =1760, k=3240; Or, r = 348, d CP =288, k=2662; Or, r = 348, d CP =2976, k=2664; Or, r = 349, d CP =760, k=2670; Or, r = 349, d CP =3448, k=2672; Or, r = 350, d CP =1232, k=2678; Or, r = 356, d CP =704, k=3352; Or, r = 356, d CP =2888, k=3354; Or, r = 357, d CP =1344, k=3362; Or, r = 357, d CP =3528, k=3364; Or, r = 358, d CP =1984, k=3372; Or, r = 359, d CP =440, k=3380; Or, r = 359, d CP =2624, k=3382; Or, r = 360, d CP =1080, k=3390; Or, r = 360, d CP =3264, k=3392; Or, r = 361, d CP =1720, k=3400; Or, r = 365, d CP =1592, k=3192; Or, r = 366, d CP =720, k=3200; Or, r = 366, d CP =3072, k=3202; Or, r = 367, d CP =2200, k=3210; Or, r = 368, d CP =1328, k=3218; Or, r = 368, d CP =3680, k=3220; Or, r = 369, d CP =2304, k=2658; Or, r = 369, d CP =456, k=3226; Or, r = 369, d CP =2808, k=3228; Or, r = 370, d CP =592, k=2664; Or, r = 370, d CP =3448, k=2666; Or, r = 370, d CP =1936, k=3236; Or, r = 371, d CP =1736, k=2672; Or, r = 384, d CP =1488, k=3358; Or, r = 384, d CP =3840, k=3360; Or, r = 385, d CP =616, k=3366; Or, r = 385, d CP =2968, k=3368; Or, r = 386, d CP =2096, k=3376; Or, r = 387, d CP =1224, k=3384; Or, r = 387, d CP =3576, k=3386; Or, r = 388, d CP =352, k=3392; Or, r = 388, d CP =2704, k=3394; Or, r = 389, d CP =1832, k=3402; Or, r = 391, d CP =2440, k=2660; Or, r = 392, d CP =1232, k=2666; Or, r = 392, d CP =2240, k=3200; Or, r = 393, d CP =24, k=2672; Or, r = 393, d CP =3048, k=2674; Or, r = 393, d CP =2040, k=3208; Or, r = 394, d CP =1840, k=3216; Or, r = 395, d CP =1640, k=3224; Or, r = 396, d CP =1440, k=3232; Or, r = 396, d CP =3960, k=3234; Or, r = 397, d CP =1240, k=3240; Or, r = 397, d CP =3760, k=3242; Or, r = 411, d CP =960, k=3354; Or, r = 411, d CP =3480, k=3356; Or, r = 412, d CP =760, k=3362; Or, r = 412, d CP =3280, k=3364; Or, r = 413, d CP =2912, k=2662; Or, r = 413, d CP =560, k=3370; Or, r = 413, d CP =3080, k=3372; Or, r = 414, d CP =2208, k=2668; Or, r = 414, d CP =360, k=3378; Or, r = 414, d CP =2880, k=3380; Or, r = 415, d CP =1504, k=2674; Or, r = 415, d CP =160, k=3386; Or, r = 415, d CP =2680, k=3388; Or, r = 416, d CP =2480, k=3396; Or, r = 418, d CP =1072, k=3198; Or, r = 418, d CP =3760, k=3200; Or, r = 419, d CP =1544, k=3206; Or, r = 419, d CP =4232, k=3208; Or, r = 420, d CP =2016, k=3214; Or, r = 421, d CP =2488, k=3222; Or, r = 422, d CP =272, k=3228; Or, r = 422, d CP =2960, k=3230; Or, r = 423, d CP =744, k=3236; Or, r = 423, d CP =3432, k=3238; Or, r = 434, d CP =560, k=2656; Or, r = 434, d CP =3920, k=2658; Or, r = 435, d CP =360, k=2662; Or, r = 435, d CP =3720, k=2664; Or, r = 436, d CP =160, k=2668; Or, r = 436, d CP =3520, k=2670; Or, r = 437, d CP =3320, k=2676; Or, r = 438, d CP =2448, k=3352; Or, r = 439, d CP =232, k=3358; Or, r = 439, d CP =2920, k=3360; Or, r = 440, d CP =704, k=3366; Or, r = 440, d CP =3392, k=3368; Or, r = 441, d CP =1176, k=3374; Or, r = 441, d CP =3864, k=3376; Or, r = 442, d CP =1648, k=3382; Or, r = 442, d CP =4336, k=3384; Or, r = 443, d CP =2120, k=3390; Or, r = 444, d CP =2424, k=3198; Or, r = 444, d CP =2592, k=3398; Or, r = 445, d CP =712, k=3204; Or, r = 445, d CP =3568, k=3206; Or, r = 446, d CP =1856, k=3212; Or, r = 447, d CP =144, k=3218; Or, r = 447, d CP =3000, k=3220; Or, r = 448, d CP =1288, k=3226; Or, r = 448, d CP =4144, k=3228; Or, r = 449, d CP =2432, k=3234; Or, r = 456, d CP =1032, k=2658; Or, r = 456, d CP =4560, k=2660; Or, r = 457, d CP =1336, k=2664; Or, r = 458, d CP =1640, k=2670; Or, r = 459, d CP =1944, k=2676; Or, r = 466, d CP =1888, k=3356; Or, r = 466, d CP =4744, k=3358; Or, r = 467, d CP =176, k=3362; Or, r = 467, d CP =3032, k=3364; Or, r = 468, d CP =1320, k=3370; Or, r = 468, d CP =4176, k=3372; Or, r = 469, d CP =2464, k=3378; Or, r = 470, d CP =752, k=3196; Or, r = 470, d CP =3776, k=3198; Or, r = 470, d CP =752, k=3384; Or, r = 470, d CP =3608, k=3386; Or, r = 471, d CP =2568, k=3204; Or, r = 471, d CP =1896, k=3392; Or, r = 471, d CP =4752, k=3394; Or, r = 472, d CP =1360, k=3210; Or, r = 472, d CP =4384, k=3212; Or, r = 472, d CP =184, k=3398; Or, r = 472, d CP =3040, k=3400; Or, r = 473, d CP =152, k=3216; Or, r = 473, d CP =3176, k=3218; Or, r = 474, d CP =1968, k=3224; Or, r = 475, d CP =760, k=3230; Or, r = 475, d CP =3784, k=3232; Or, r = 476, d CP =2576, k=3238; Or, r = 478, d CP =1840, k=2660; Or, r = 479, d CP =2648, k=2666; Or, r = 480, d CP =3456, k=2672; Or, r = 481, d CP =568, k=2676; Or, r = 481, d CP =4264, k=2678; Or, r = 493, d CP =184, k=3352; Or, r = 493, d CP =3208, k=3354; Or, r = 494, d CP =2000, k=3360; Or, r = 494, d CP =5024, k=3362; Or, r = 495, d CP =792, k=3366; Or, r = 495, d CP =3816, k=3368; Or, r = 496, d CP =1936, k=3196; Or, r = 496, d CP =2608, k=3374; Or, r = 497, d CP =1232, k=3202; Or, r = 497, d CP =4424, k=3204; Or, r = 497, d CP =1400, k=3380; Or, r = 497, d CP =4424, k=3382; Or, r = 498, d CP =528, k=3208; Or, r = 498, d CP =3720, k=3210; Or, r = 498, d CP =192, k=3386; Or, r = 498, d CP =3216, k=3388; Or, r = 499, d CP =1672, k=2656; Or, r = 499, d CP =3016, k=3216; Or, r = 499, d CP =2008, k=3394; Or, r = 499, d CP =5032, k=3396; Or, r = 500, d CP =2984, k=2662; Or, r = 500, d CP =2312, k=3222; Or, r = 500, d CP =800, k=3400; Or, r = 500, d CP =3824, k=3402; Or, r = 501, d CP =432, k=2666; Or, r = 501, d CP =4296, k=2668; Or, r = 501, d CP =1608, k=3228; Or, r = 501, d CP =4800, k=3230; Or, r = 502, d CP =1744, k=2672; Or, r = 502, d CP =904, k=3234; Or, r = 502, d CP =4096, k=3236; Or, r = 503, d CP =3056, k=2678.

75. The data processing device according to any one of claims 70 to 74, characterized in that: d scr =336×k。 76. The data processing device according to any one of claims 70 to 75, characterized in that The second data processing unit is specifically used for: Perform CRC-32 check on a total of r×q / p bits in each r / p rows of the first data to add a check bit with a length of 32 bits, d CRC =32×p, r is divisible by p, and p is an integer greater than 1; or, For the first data, the first r F0 ×(p-1) rows of each r F0 Rows total q×r F0 The CRC-32 check is performed on the last r bits of the first data to add a check bit with a length of 32 bits. F1 Rows total q×r F1 bits are CRC-32 checked to add a check bit with a length of 32 bits, where d CRC =32×p, r cannot be divided by p, p is an integer greater than 1, r F0 ×(p-1)+r F1 = r, integer r F0 Greater than integer r F1 .

77. The data processing device according to any one of claims 70 to 76, characterized in that: q=2056。 78. The data processing device according to claim 77, characterized in that: The second data processing unit is specifically used for: For the first data, the first r F0 ×(p-1) rows of each r F0 Rows total q×r F0 The CRC-32 check is performed on the last r bits of the first data to add a check bit with a length of 32 bits. F1 Rows total q×r F1 bits are CRC-32 checked to add a check bit with a length of 32 bits, where d CRC =32×p, r cannot be divided by p, p is an integer greater than 1, r F0 ×(p-1)+r F1 = r, integer r F0 Greater than integer r F1 .

79. The data processing device according to claim 77 or 78, characterized in that: r=435。 80. The data processing device according to claim 79, characterized in that: p=22,r F0 =20, r F1 =15, the second data processing unit is specifically used for: A CRC-32 check is performed on every 20 rows of the first 420 rows in the first data, totaling 41,120 bits, to add a check bit with a length of 32 bits, and a CRC-32 check is performed on the last 15 rows of the first data, totaling 30,840 bits, to add a check bit with a length of 32 bits.

81. The data processing device according to claim 79 or 80, characterized in that: d CP =3432, k = 2672, or, d CP =744, k=2664.

82. The data processing device according to claim 77 or 78, characterized in that: r=546,d CP =1008,k=3344; Or, r = 546, d CP =3696, k=3352; Or, r = 547, d CP =1640, k=3352; Or, r = 547, d CP =4328, k=3360; Or, r = 548, d CP =2272, k=3360; Or, r = 548, d CP =4960, k=3368; Or, r = 549, d CP =216, k=3360; Or, r = 549, d CP =2904, k=3368; Or, r = 549, d CP =5592, k=3376; Or, r = 550, d CP =848, k=3368; Or, r = 550, d CP =3536, k=3376; Or, r = 551, d CP =1480, k=3376; Or, r = 551, d CP =4168, k=3384; Or, r = 552, d CP =2112, k=3384; Or, r = 552, d CP =4800, k=3392; Or, r = 553, d CP =56, k=3384; Or, r = 553, d CP =2744, k=3392; Or, r = 553, d CP =5432, k=3400; Or, r = 554, d CP =688, k=3392; Or, r = 554, d CP =3376, k=3400; Or, r = 555, d CP =1320, k=3400; Or, r = 555, d CP =4008, k=3408; Or, r = 556, d CP =1952, k=3408; Or, r = 556, d CP =4640, k=3416; Or, r = 557, d CP =2584, k=3416; Or, r = 557, d CP =5272, k=3424; Or, r = 558, d CP =528, k=3416; Or, r = 558, d CP =3216, k=3424; Or, r = 559, d CP =1160, k=3424; Or, r = 559, d CP =3848, k=3432; Or, r = 560, d CP =1792, k=3432; Or, r = 560, d CP =4480, k=3440; Or, r = 561, d CP =2424, k=3440; Or, r = 561, d CP =5112, k=3448; Or, r = 562, d CP =368, k=3440; Or, r = 562, d CP =3056, k=3448; Or, r = 562, d CP =5744, k=3456.

83. The data processing device according to claim 77 or 78, characterized in that: r=520,d CP =704,k=3184; Or, r = 520, d CP =3392, k=3192; Or, r = 520, d CP =6080, k=3200; Or, r = 521, d CP =1336, k=3192; Or, r = 521, d CP =4024, k=3200; Or, r = 522, d CP =1968, k=3200; Or, r = 522, d CP =4656, k=3208; Or, r = 523, d CP =2600, k=3208; Or, r = 523, d CP =5288, k=3216; Or, r = 524, d CP =544, k=3208; Or, r = 524, d CP =3232, k=3216; Or, r = 525, d CP =1176, k=3216; Or, r = 525, d CP =3864, k=3224; Or, r = 526, d CP =1808, k=3224; Or, r = 526, d CP =4496, k=3232; Or, r = 527, d CP =2440, k=3232; Or, r = 527, d CP =5128, k=3240; Or, r = 528, d CP =384, k=3232; Or, r = 528, d CP =3072, k=3240; Or, r = 528, d CP =5760, k=3248; Or, r = 529, d CP =1016, k=3240; Or, r = 529, d CP =3704, k=3248; Or, r = 530, d CP =1648, k=3248; Or, r = 530, d CP =4336, k=3256; Or, r = 531, d CP =2280, k=3256; Or, r = 531, d CP =4968, k=3264; Or, r = 532, d CP =2912, k=3264; Or, r = 532, d CP =224, k=3256; Or, r = 533, d CP =856, k=3264; Or, r = 533, d CP =3544, k=3272; Or, r = 534, d CP =1488, k=3272; Or, r = 534, d CP =4176, k=3280; Or, r = 535, d CP =2120, k=3280; Or, r = 535, d CP =4808, k=3288.

84. The data processing device according to any one of claims 70 to 83, characterized in that: The fourth bit set includes m0 first bit subsets, where m0 is an integer greater than 1, and the data processing device further includes a first interleaving unit; The first interleaving unit is used to: perform a first interleaving process on the fourth bit set to obtain a fifth bit set, the fifth bit set includes m0 second bit subsets, each of the second bit subsets includes 256 bits, 128 bits of each of the second bit subsets come from the second bit set, and the other 128 bits of each of the second bit subsets come from the third bit set and / or the check bits of the FEC code.

85. The data processing device according to claim 84, characterized in that: Each of the second bit subsets includes consecutive 256 bits.

86. The data processing device according to claim 84, characterized in that: Each of the second bit subsets is presented as a square matrix.

87. The data processing device according to any one of claims 84 to 86, characterized in that: The 256 bits of the second bit subset are distributed into 16 rows and 16 columns, and the bits in the second bit subset satisfy one or more of the following: The bits in row 0 and columns 2, 3, 6, 7, 10, 11, 14, and 15 of the second bit subset are from the second bit set; The bits in row 1 and columns 0, 3, 4, 7, 8, 11, 12, and 15 of the second bit subset are from the second bit set; The bits in the second row and columns 0, 1, 4, 5, 8, 9, 12, and 13 in the second bit subset are from the second bit set; The bits in the third row and the first, second, fifth, sixth, ninth, tenth, third, and fourth columns of the second bit subset are from the second bit set; The bits in the 4th row and the 2nd, 3rd, 6th, 7th, 10th, 11th, 14th, and 15th columns of the second bit subset are from the second bit set; The bits in row 5 and columns 0, 3, 4, 7, 8, 11, 12, and 15 of the second bit subset are from the second bit set; The bits in row 6 and columns 0, 1, 4, 5, 8, 9, 12, and 13 in the second bit subset are from the second bit set; The bits in row 7 and columns 1, 2, 5, 6, 9, 10, 13, and 14 of the second bit subset are from the second bit set; The bits in row 8 and columns 2, 3, 6, 7, 10, 11, 14, and 15 in the second bit subset are from the second bit set; The bits in row 9 and columns 0, 3, 4, 7, 8, 11, 12, and 15 of the second bit subset are from the second bit set; The bits in the 10th row and the 0th, 1st, 4th, 5th, 8th, 9th, 12th, and 13th columns of the second bit subset are from the second bit set; The bits in the 11th row and the 1st, 2nd, 5th, 6th, 9th, 10th, 13th and 14th columns of the second bit subset are from the second bit set; The bits in the 12th row and the 2nd, 3rd, 6th, 7th, 10th, 11th, 14th, and 15th columns of the second bit subset are from the second bit set; The bits in row 13 and columns 0, 3, 4, 7, 8, 11, 12, and 15 of the second bit subset are from the second bit set; The bits in row 14 and columns 0, 1, 4, 5, 8, 9, 12, and 13 in the second bit subset are from the second bit set; The bits in row 15 and columns 1, 2, 5, 6, 9, 10, 13, and 14 in the second bit subset are from the second bit set.

88. The data processing device according to any one of claims 84 to 87, characterized in that: The m0×256 bits in the fourth bit set are distributed as 32 rows and m0×8 columns, the m0×256 bits in the fifth bit set are distributed as 32 rows and m0×8 columns, the m0×8 bits in the r1th row in the fifth bit set come from the m0×8 bits in the r0th row in the fourth bit set, wherein 0≤r0<32, 0≤r1<32.

89. The data processing device according to claim 88, characterized in that: r0=r1。 90. The data processing device according to any one of claims 70 to 89, characterized in that: The fourth bit set includes m0 first bit subsets, where m0=12 or 16.

91. The data processing device according to any one of claims 84 to 90, characterized in that: The data processing device also includes a second interleaving unit, a symbol mapping unit, a polarization division unit and a digital signal processing DSP framing unit; The second interleaving unit is used to: perform a second interleaving process on every two first bit streams among the L first bit streams to obtain a total of L / 2 second bit streams, each of the first bit streams includes a plurality of the fifth bit sets, and L is an even number greater than 0; The symbol mapping unit and the polarization division unit are used to: perform symbol mapping and polarization division on L / 2 second bit streams to obtain a dual-polarization symbol stream, wherein the symbol mapping and the polarization division map t bits into 1 dual-polarization symbol, and t is an integer greater than 0; The DSP framing unit is used to perform DSP framing on the dual-polarization symbol stream.

92. The data processing device according to claim 91, characterized in that: The amplitude bits in the dual-polarization symbol are from the second bit set.

93. The data processing device according to claim 92, characterized in that: t=8, the dual-polarization symbol is a dual-polarization DP-16QAM symbol.

94. The data processing device according to claim 93, characterized in that: The DSP framing unit is specifically used for: performing framing processing on every 172032 dual-polarization DP-16QAM symbols to obtain a DSP superframe, and the superframe contains 175104 dual-polarization symbols.

95. The data processing device according to claim 94, characterized in that: The first processing unit is specifically configured to: obtain F from the data frame Frame The first data to get F Frame ×r×q bits, F Frame is an integer greater than 0; d scr ×F Frame =336×k×F DSP ; Among them, F DSP represents the number of DSP superframes, F DSP A DSP superframe consists of F Frame The first data is processed and F DSP An integer greater than 0.

96. The data processing device according to claim 95, characterized in that: F DSP >1, the F DSP A plurality of continuous symbols in the first DSP superframe in the DSP superframes are the first identifier, and the F DSP A plurality of consecutive symbols in each DSP superframe in a DSP superframe except the first DSP superframe are the second identifier.

97. A data processing device, characterized in that: include: A first probability constellation shaping PCS unit, a first forward error correction FEC encoding unit, a second PCS unit, a second FEC unit, an interleaving processing unit, a symbol mapping unit and a polarization division unit; The first PCS unit is used to: perform a first PCS process on a first bit set in the first group of k bits to obtain a second bit set, where the second bit set includes m0×128 bits, k is an integer greater than 1, and m0 is an integer greater than 1; The first FEC encoding unit is used to: perform a first forward error correction FEC encoding on the second bit set and a third bit set in the first group of k bits except the first bit set to obtain a fourth bit set, wherein the fourth bit set includes m0 first bit square matrices, each of which includes 256 bits distributed in 16 rows and 16 columns; The second PCS unit is used to: perform a second PCS process on a fifth bit set in the second group of k bits to obtain a sixth bit set; The second FEC encoding unit is used to: encode the sixth bit set and the second group of k bits except the fifth bit set The seven-bit set is subjected to a second FEC encoding to obtain an eighth bit set, wherein the eighth bit set includes m0 second bit squares, and each of the second bit squares includes 256 bits distributed in 16 rows and 16 columns; The interleaving processing unit is used to: input 21 of the fourth bit sets and 21 of the eighth bit sets into an interleaving buffer, wherein the interleaving buffer includes 84×m1 buffer units distributed as 84 rows and m1 columns, m0=m1×2, each of the buffer units is used to buffer 16 rows and 16 columns, a total of 256 bits, 42×m1 of the first bit squares are input into the even rows of the interleaving buffer, and 42×m1 of the second bit squares are input into the odd rows of the interleaving buffer, the interleaving buffer includes a first buffer subset and a second buffer subset, the first buffer subset includes 42×m1 of the buffer units, the second buffer subset includes 42×m1 of the buffer units, the bits input into the first buffer subset come from the second bit set and the sixth bit set, and the bits input into the second buffer subset come from the third bit set, the seventh bit set, the check bits of the first FEC code, and the check bits of the second FEC code; The symbol mapping unit and the polarization division unit are used to perform symbol mapping and polarization division on every 8 bits in the interleaved cache to obtain a dual-polarization DP-16QAM symbol, wherein 2 amplitude bits of the 4 bits corresponding to the 16QAM symbol of the DP-16QAM symbol in the target polarization direction come from a column in the first cache unit of the first cache subset, and 2 sign bits of the 4 bits corresponding to the 16QAM symbol of the DP-16QAM symbol in the target polarization direction come from a column in the second cache unit of the second cache subset.

98. The data processing device according to claim 97, characterized in that: Four bits of the eight bits come from a column of a first cache unit of the first cache subset, and another four bits of the eight bits come from a column of a second cache unit of the second cache subset.

99. The data processing device according to claim 97 or 98, characterized in that: The m0 first bit matrixes are distributed into 2 rows and m1 columns, wherein the first bit matrix at the 0th row and m2th column and the first bit matrix at the 1st row and m2th column are from the second bit set, and the m0 second bit matrixes are distributed into 2 rows and m1 columns, wherein the second bit matrix at the 0th row and m2th column and the second bit matrix at the 1st row and m2th column are from the sixth bit set, 0≤m2<m1 / 2.

100. The data processing device according to claim 99, characterized in that: m0=16, the first cache subset includes 336 cache units in columns 0, 1, 2, and 3 of the interleaved cache, and the second cache subset includes 336 cache units in columns 4, 5, 6, and 7 of the interleaved cache; Alternatively, m0=12, the first cache subset includes a total of 252 cache units in columns 0, 1, and 2 of the interleaved cache, and the second cache subset includes a total of 252 cache units in columns 3, 4, and 5 of the interleaved cache.

101. The data processing device according to claim 97 or 98, characterized in that: m0=16,m1=8; The m0 first bit squares are distributed into 2 rows and m1 columns, and the first bit square in the 0th row and 0th column, the first bit square in the 0th row and 1st column, the first bit square in the 0th row and 4th column, the first bit square in the 0th row and 5th column, the first bit square in the 1st row and 0th column, the first bit square in the 1st row and 1st column, the first bit square in the 1st row and 4th column, and the first bit square in the 1st row and 5th column are from the second bit set; The m0 second bit matrixes are distributed as 2 rows and m1 columns, and the second bit matrix at row 0 and column 0, the second bit matrix at row 0 and column 1, the second bit matrix at row 0 and column 4, the second bit matrix at row 0 and column 5, the second bit matrix at row 1 and column 0, the second bit matrix at row 1 and column 1, the second bit matrix at row 1 and column 4 and the second bit matrix at row 1 and column 5 are from the sixth bit set.

102. The data processing device according to claim 101, characterized in that: The first cache subset includes 336 cache units in columns 0, 1, 4 and 5 of the interleaved cache, and the second cache subset includes 336 cache units in columns 2, 3, 6 and 7 of the interleaved cache.

103. A data processing device, characterized in that: include: A processor and a transceiver, the processor is used to execute the method as described in any one of claims 1 to 51, and the transceiver is used to perform data transmission and reception operations.

104. A communication system, characterized in that: include: A data processing device at a sending end and a data processing device at a receiving end, wherein the data processing device at the sending end is used to execute the method as described in any one of claims 1-51, and the data processing device at the sending end is used to send a data stream to the data processing device at the receiving end.