Data processing method and data processing device

By punching the information bits and check bits of the FEC codeword in the PON system and adjusting the proportion of the punching position, the problem of high bit error rate after correction in traditional technology is solved, and a lower bit error rate is achieved and higher decoding efficiency.

CN119094081AActive Publication Date: 2024-12-06HUAWEI TECH CO LTD
View PDF 7 Cites 0 Cited by

Patent Information

Application Number
CN202410986581.4
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2022-12-14
Publication Date
2024-12-06
Estimated Expiration
2042-12-14

AI Technical Summary

Technical Problem

In PON systems, it is difficult to find a suitable check bit in the traditional FEC codeword punching method, resulting in poor bit error rate after correction and affecting network performance.

Method used

Expand the drilling range, including drilling the information bit and the checking bit, adjusting the ratio of the drilling position to reduce the bit error rate after correction, and increasing the drilling information bit without increasing the total drilling bit number , reduce the hole punching of the check bit.

Benefits of technology

It effectively reduces the corrected bit error rate of FEC codewords, keeps the bit rate unchanged, and improves the decoding efficiency, reduces the number of iterative calculations, and improves the decoding performance of the collector equipment.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119094081A_ABST
    Figure CN119094081A_ABST
Patent Text Reader

Abstract

The invention discloses a data processing method and a data processing device, and in the method, the data processing device expands the punching range of each first code word from a check bit to an information bit and the check bit instead of only punching the check bit of each first code word. Therefore, a proper punching position can be searched, and the error rate after correction of the FEC code word is reduced.
Need to check novelty before this filing date? Find Prior Art

Description

[0001] This application is a divisional application. The application number of the original application is 202211607442.3, and the original application date is December 14, 2022. The entire contents of the original application are incorporated into this application by reference. Technical Field

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

[0003] In passive optical network (PON) access systems, with the increasing demand for network capacity and customer experience, flexible configuration of customer rates has become an important technical point of PON systems. Flexible rate configuration can maximize the use of channel conditions to optimize the overall network capacity, while optimizing the network experience of each user. Adjusting the rate through flexible forward error correction coding (Flex FEC) is an easy-to-implement method, usually achieved by puncturing and shortening the system standard codewords. However, for PON systems, the system has performance requirements at extremely low post-correction bit error rates (<1e-12), so after puncturing, FEC needs to maintain relatively good performance and no error flattening. Therefore, choosing the right puncturing method is a key issue in the design of high-throughput Flex FEC.

[0004] In the conventional technology, a plurality of check bits are selected from the check bits of the FEC codeword for puncturing to obtain the punctured FEC codeword.

[0005] However, each FEC codeword has a limited number of check bits, and it is not easy to find suitable punctured check bits, which can easily affect the post-correction bit error rate of the FEC codeword. Summary of the invention

[0006] The present application provides a data processing method and a data processing device for reducing the post-correction bit error rate of FEC codewords.

[0007] In a first aspect, the present application provides a data processing method, which can be executed by a data processing device or by a component of the data processing device (e.g., a processor, a chip, or a chip system). Taking a data processing device as an example, the data processing device obtains a first data stream, which is a data stream encoded by FEC, and the first data stream includes multiple first code words; then, the data processing device performs puncturing processing on the information bit and the check bit of each first code word in the first data stream, respectively, to obtain a second data stream including multiple second code words, and the length of each second code word is less than the length of each first code word.

[0008] In this embodiment, since the data processing device extends the puncturing range of each first codeword from the check bit to the information bit and the check bit, rather than only puncturing the check bit of each first codeword, it is helpful to search for a suitable puncturing position and reduce the post-correction bit error rate of the FEC codeword.

[0009] In a possible implementation, a data processing device performs puncturing processing on the information bit and check bit of each first codeword in the first data stream, or performs puncturing processing on the information bit of each first codeword in the first data stream, to obtain a second data stream containing multiple second codewords, including: the data processing device obtains h first puncturing positions and g second puncturing positions corresponding to each first codeword, each first puncturing position indicates multiple bits in the information bit of the first codeword, and each second puncturing position indicates multiple bits in the check bit of the first codeword; wherein the sum of h and g is equal to w, h is an integer greater than 0, g is an integer greater than or equal to 0, and w is an integer greater than 1. Then, the data processing device excludes the bits indicated by the h first puncturing positions and the bits indicated by the g second puncturing positions corresponding to each first codeword from each first codeword, to obtain multiple second codewords.

[0010] In this embodiment, it is proposed that the data processing device can obtain h first puncturing positions and g second puncturing positions for each first codeword, and then the data processing device performs puncturing processing on the first codeword based on the aforementioned h first puncturing positions and g second puncturing positions. If the sum of the number of first puncturing positions and the number of second puncturing positions for each first codeword is equal to a fixed value (for example, the aforementioned w), the data processing device can adjust the ratio between the first puncturing position selected in the information bit and the second puncturing position selected in the check bit, and then search for a suitable puncturing position to reduce the post-correction bit error rate of the FEC codeword.

[0011] In one possible implementation, w is the number of puncturing positions that need to be excluded by the standard puncturing process. Exemplarily, w=7. Among them, the number of puncturing positions that need to be excluded by the standard puncturing process is the number of puncturing positions that need to be excluded by the puncturing mode that only punches the check bits. For example, in the conventional technology, the puncturing mode that only punches the check bits needs to select w puncturing positions in the check bits of the first codeword, while the solution of the present application is to select w puncturing positions in the information bits and check bits of the first codeword. Since the puncturing positions of the information bits in the first codeword are increased and the puncturing positions of the check bits in the first codeword are reduced, while the total number of puncturing positions for a first codeword does not change, it is beneficial to keep the code rate unchanged while reducing the post-correction bit error rate of the FEC codeword.

[0012] In another possible implementation, w is related to the post-correction bit error rate and the FEC codeword transmission rate. It can also be understood that w is the optimal solution that can improve the FEC codeword transmission rate while ensuring the post-correction bit error rate.

[0013] In a possible implementation manner, the first puncturing positions of any two first codewords in the first data stream are the same, and / or the second puncturing positions of any two first codewords in the first data stream are the same.

[0014] In a possible implementation, the first puncturing position and / or the second puncturing position are related to the number of iterative calculations. For example, the first puncturing position and / or the second puncturing position of the same first codeword is a puncturing position that enables the second codeword corresponding to the first codeword to update all external information of all check formulas of the first codeword after one iterative calculation. Therefore, it is beneficial that the second codeword only needs to perform fewer iterative calculations during the decoding process, thereby improving the efficiency of the receiving device in decoding the second codeword.

[0015] In a possible implementation, the first data stream includes multiple first codewords with a length of (L+T) bits, the first L bits of the first codeword are information bits, the last T bits of the first codeword are check bits, L is an integer greater than 0, and T is an integer greater than 0. The data processing device performs puncturing processing on the information bits and check bits of each first codeword in the first data stream respectively, or performs puncturing processing on the information bits of each first codeword in the first data stream to obtain a second data stream containing multiple second codewords, including: the data processing device excludes P bits from the first L bits of information bits of each first codeword, and excludes Q bits from the check bits of the last T bits of each first codeword to obtain multiple second codewords, each second codeword includes K bits of punctured information bits and M bits of punctured check bits, K=LP, M=TQ, the sum of P and Q is equal to w times r, r is the number of bits to be excluded at each puncturing position, r is an integer greater than 0, w is an integer greater than 0, P is an integer greater than 0, Q is an integer greater than or equal to 0, K is an integer greater than 0, and M is an integer greater than 0.

[0016] In a possible implementation, the h first puncturing positions include h columns of information bit code blocks and the g second puncturing positions include g columns of check bit code blocks, each first codeword includes e columns of information bit code blocks and f columns of check bit code blocks, and each column of code blocks includes at least one bit; the data processing device performs puncturing processing on the information bit and check bit of each codeword in the first data stream respectively, or performs puncturing processing on the information bit of each of the first codewords in the first data stream to obtain a second data stream containing multiple second codewords, including: the data processing device obtains the identifier of each column of information bit code blocks in the h columns of information bit code blocks and the identifier of each column of check bit code blocks in the g columns of check bit code blocks; then, the data processing device excludes the h column of information bit code blocks from the e column of information bit code blocks based on the identifier of the h column of information bit code blocks, and excludes the g column of check bit code blocks from the f column of check bit code blocks based on the identifier of the g column of check bit code blocks, to obtain the second codeword, where e is an integer greater than 1, f is an integer greater than 1, h is an integer greater than 0, and g is an integer greater than or equal to 0. Optionally, the sum of h and g equals w.

[0017] In this embodiment, the data processing device can convert the first code word into a set of multiple columns of code blocks by simulating an iterative decoding algorithm, and then determine the first puncture position and the second puncture position based on a column of code blocks, which is beneficial for quickly and efficiently determining each first puncture position and each second puncture position.

[0018] In one possible implementation, the check matrix of the second codeword corresponds to a multi-layer check formula, and the variable nodes in each layer of the check formula of the check matrix of the second codeword can obtain external information after the first iterative calculation, and the external information is used to decode the check formula corresponding to the variable nodes in the second codeword related to the external information.

[0019] In a possible implementation, there is at least one shortened frame in the first data stream, and the length of the information bit of the last first codeword of the shortened frame is less than the length of the information bit of other first codewords of the frame; the data processing device obtains the first data stream, including: the data processing device performs zero padding on each shortened frame in the data stream to be encoded to obtain the zero-padded data stream to be encoded; then, the data processing device performs FEC encoding on the zero-padded data stream to be encoded to obtain the encoded data stream; then, the data processing device shortens each zero-padded frame in the encoded data stream to obtain the first data stream.

[0020] In a possible implementation, there is at least one shortened frame in the first data stream, and the length of the information bit of the last first codeword of the shortened frame is equal to (LS), where S is an integer greater than 0 and less than L. Acquiring the first data stream includes: acquiring a data stream to be encoded, the data stream to be encoded includes multiple data blocks of length L and at least one shortened data block of length less than L, the shortened data block being the last data block of a frame; supplementing S zero bits after each shortened data block in the data stream to be encoded to obtain a zero-padded data stream to be encoded; performing FEC encoding on the zero-padded data stream to be encoded with a coding block of L bits to obtain a coded data stream; deleting S zero bits from the information bits of the last coding block of the frame in the coded data stream to obtain the first data stream.

[0021] In one possible implementation, the first data stream also includes at least one shortened first codeword having a length of (L-S+T) bits, the first (LS) bits of the shortened first codeword are information bits, the last T bits of the shortened first codeword are check bits, L is an integer greater than 0, and T is an integer greater than 0. The data processing device performs puncturing processing on the information bits and check bits of each first codeword in the first data stream, or performs puncturing processing on the information bits of each first codeword in the first data stream, to obtain a second data stream containing multiple second codewords, including: the data processing device excludes P' bits from the information bits of the first (LS) bits of the shortened first codeword, and excludes Q bits from the check bits of the last T bits of the shortened first codeword, to obtain a shortened second codeword, the shortened second codeword includes K' bits of punctured information bits and M bits of punctured check bits, K'=LS-P', M=TQ, the sum of P' and Q is equal to w times r, r is the number of bits that need to be excluded at each puncturing position, r is an integer greater than 0, w is an integer greater than 0, P' is an integer greater than 0, Q is an integer greater than or equal to 0, K' is an integer greater than 0, and M is an integer greater than 0.

[0022] In a second aspect, the present application provides a data processing device, the data processing device comprising:

[0023] An acquisition module, used to acquire a first data stream, where the first data stream is a data stream encoded by FEC, and the first data stream includes a plurality of first codewords;

[0024] A puncturing processing module is used to perform puncturing processing on the information bits and check bits of each first code word in the first data stream respectively, or to perform puncturing processing on the information bits of each first code word in the first data stream to obtain a second data stream including multiple second code words, and the length of each second code word is less than the length of each first code word.

[0025] Optionally, the acquisition module includes an FEC encoding module, and the FEC encoding module is used to perform FEC encoding on the data stream to be encoded to obtain the first data stream.

[0026] In a possible implementation, an acquisition module is specifically used to acquire h first puncture positions and g second puncture positions corresponding to each first codeword, each first puncture position indicates multiple bits in the information bit of the first codeword, each second puncture position indicates multiple bits in the check bit of the first codeword, the sum of h and g is equal to w, h is an integer greater than 0, g is an integer greater than or equal to 0, and w is an integer greater than 1; a puncture processing module is specifically used to exclude the bits indicated by the h first puncture positions and the bits indicated by the g second puncture positions corresponding to each first codeword from each first codeword, to obtain multiple second codewords.

[0027] In a possible implementation, w is the number of punching positions that need to be excluded in the standard punching process. For example, w=7.

[0028] In a possible implementation manner, w is related to the post-correction bit error rate and the FEC codeword transmission rate.

[0029] In a possible implementation manner, the first puncturing positions of any two first codewords in the first data stream are the same, and / or the second puncturing positions of any two first codewords in the first data stream are the same.

[0030] In a possible implementation manner, the first punching position and / or the second punching position is related to the number of iterative calculations.

[0031] In a possible implementation, the first puncturing position and / or the second puncturing position of the same first codeword is a puncturing position that enables the second codeword corresponding to the first codeword to update all external information of all check equations of the first codeword after one iterative calculation.

[0032] In a possible implementation, the first data stream includes a plurality of first codewords with a length of (L+T) bits, the first L bits of the first codeword are information bits, the last T bits of the first codeword are check bits, L is an integer greater than 0, and T is an integer greater than 0. The puncturing processing module is specifically used to exclude P bits from the information bits of the first L bits of each first codeword, and exclude Q bits from the check bits of the last T bits of each first codeword, to obtain a plurality of second codewords, each second codeword includes K bits of punctured information bits and M bits of punctured check bits, K=LP, M=TQ, the sum of P and Q is equal to w times r, r is the number of bits to be excluded at each puncturing position, r is an integer greater than 0, w is an integer greater than 0, P is an integer greater than 0, Q is an integer greater than or equal to 0, K is an integer greater than 0, and M is an integer greater than 0.

[0033] In a possible implementation manner, the h first puncturing positions include h columns of information bit code blocks and the g second puncturing positions include g columns of check bit code blocks, each first codeword includes e columns of information bit code blocks and f columns of check bit code blocks, and each column of code blocks includes at least one bit;

[0034] An acquisition module, specifically used to acquire an identifier of each column of information bit code blocks in the h columns of information bit code blocks and an identifier of each column of check bit code blocks in the g columns of check bit code blocks;

[0035] The puncturing processing module is specifically used to exclude the h column information bit code block from the e column information bit code block based on the identifier of the h column information bit code block, and exclude the g column check bit code block from the f column check bit code block based on the identifier of the g column check bit code block, to obtain a second code word, where e is an integer greater than 1, f is an integer greater than 1, h is an integer greater than 0, and g is an integer greater than or equal to 0. Optionally, the sum of h and g is equal to w.

[0036] In one possible implementation, the check matrix of the second codeword corresponds to a multi-layer check formula, and the variable nodes in each layer of the check formula of the check matrix of the second codeword can obtain external information after the first iterative calculation, and the external information is used to decode the check formula corresponding to the variable nodes in the second codeword related to the external information.

[0037] In a possible implementation, there is at least one shortened frame in the first data stream, and the length of the information bit of the last first codeword of the shortened frame is less than the length of the information bit of other first codewords of the frame. The data processing device also includes a zero-padding processing module; the zero-padding processing module is used to perform zero-padding processing on each shortened frame in the to-be-encoded data stream to obtain a zero-padding to-be-encoded data stream; an FEC encoding module is used to perform FEC encoding processing on the zero-padding to-be-encoded data stream to obtain an encoded data stream; and the shortening processing module is used to perform shortening processing on each zero-padding frame in the encoded data stream to obtain a first data stream.

[0038] In a possible implementation, there is at least one shortened frame in the first data stream, and the length of the information bit of the last first codeword of the shortened frame is equal to (LS), where S is an integer greater than 0 and less than L; an acquisition module is used to acquire a data stream to be encoded, where the data stream to be encoded includes multiple data blocks of length L and at least one shortened data block of length less than L, and the shortened data block is the last data block of a frame; a zero-padding processing module is used to add S zero bits after each shortened data block in the data stream to be encoded, so as to obtain a zero-padding data stream to be encoded; an FEC encoding module is used to perform FEC encoding processing on the zero-padding data stream to be encoded with a coding block of L bits in length, so as to obtain a coded data stream; and a shortening processing module is used to delete S zero bits from the information bits of the last coding block of the frame in the coded data stream, so as to obtain the first data stream.

[0039] In a possible implementation, the first data stream further includes at least one shortened first codeword of length (L-S+T) bits, the first (LS) bits of the shortened first codeword are information bits, the last T bits of the shortened first codeword are check bits, L is an integer greater than 0, and T is an integer greater than 0. The puncturing processing module is specifically used to exclude P' bits from the information bits of the first (LS) bits of the shortened first codeword, and exclude Q bits from the check bits of the last T bits of the shortened first codeword, to obtain a shortened second codeword, the shortened second codeword includes K' bits of punctured information bits and M bits of punctured check bits, K'=LS-P', M=TQ, the sum of P' and Q is equal to w times r, r is the number of bits to be excluded at each puncturing position, r is an integer greater than 0, w is an integer greater than 0, P' is an integer greater than 0, Q is an integer greater than or equal to 0, K' is an integer greater than 0, and M is an integer greater than 0.

[0040] It should be noted that the specific implementation methods and beneficial effects of this aspect are similar to some implementation methods in the first aspect above. Please refer to the specific implementation methods and beneficial effects of the first aspect for details, and no further details will be given here.

[0041] In a third aspect, the present application provides a data processing device, which includes a processor and a transceiver; the transceiver is used to receive a first data stream and send a second data stream; the processor is used to execute part or all of the steps of any one of the methods in the first aspect above.

[0042] In a fourth aspect, the present application provides a chip comprising at least one logic circuit and an input / output interface; the input / output interface is used to input a first data stream and output a second data stream; the logic circuit is used to execute part or all of the steps of any one of the methods in the first aspect above.

[0043] In a fifth aspect, the present application provides a computer-readable storage medium storing a computer program, wherein the computer program, when executed by hardware, can implement part or all of the steps of any one of the methods in the first aspect above. BRIEF DESCRIPTION OF THE DRAWINGS

[0044] In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings required for use in the description of the embodiments will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present application.

[0045] Figure 1 A schematic diagram of a communication system used in an embodiment of the present application;

[0046] Figure 2 It is a schematic diagram of the data transmission process in the traditional technology;

[0047] Figure 3 A flow chart of the data processing method in this application;

[0048] Figure 4A This is an example diagram of a frame structure involved in the data processing method in this application;

[0049] Figure 4B is another example diagram of a frame structure involved in the data processing method of the present application;

[0050] Figure 5 An example diagram showing the comparison between the punching method of the present application and the punching method in the conventional technology;

[0051] Figure 6 is another flow chart of the data processing method in this application;

[0052] Fig. 7A An example diagram of a first puncture position and a second puncture position in a first codeword of the present application;

[0053] Figure 7B Another example diagram of the first puncture position and the second puncture position in the first codeword of the present application;

[0054] Figure 8 An example diagram comparing the convergence of the puncturing pattern of the present application solution and the puncturing pattern of the traditional solution;

[0055] Fig. 9 An example diagram showing the performance comparison between the punching mode of the present application and the punching mode of the traditional solution;

[0056] Fig.10 A schematic diagram of an embodiment of a data processing device in the present application;

[0057] Fig.11 FIG. 4 is a schematic diagram of another embodiment of a data processing device in the present application. DETAILED DESCRIPTION

[0058] The technical solutions in the embodiments of the present application will be clearly and completely described below in conjunction with the drawings in the embodiments of the present application. Obviously, the described embodiments are only part of the embodiments of the present application, rather than all of the embodiments.

[0059] The terms "first", "second", "third", "fourth", etc. (if any) in the specification and claims of the present application and the above-mentioned drawings are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequence. It should be understood that the terms used in this way are interchangeable where appropriate, so that the embodiments described herein can be implemented in an order other than that illustrated or described herein. 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 that are clearly listed, but may include other steps or units that are not clearly listed or inherent to these processes, methods, products or devices.

[0060] It should be understood that the term "and / or" in this article is only a description of the association relationship of the associated objects, indicating that there can be three relationships. For example, A and / or B can represent: A exists alone, A and B exist at the same time, and B exists alone. In addition, the character " / " in this article generally indicates that the associated objects before and after are in an "or" relationship.

[0061] Figure 1 Schematic diagram of a communication system used in the embodiment of the present application. Figure 1 As shown, the communication system includes a transmitting end 01, a receiving end 02 and a channel transmission medium 03. Taking the PON system as an example, the transmitting end 01 and the receiving end 02 can be optical modules, electrical modules, connectors or other modules that process data during data transmission, and the channel transmission medium 03 can be an optical fiber. Optionally, the transmitting end 01, the receiving end 02 and the channel transmission medium 03 in the communication system can support bidirectional transmission or unidirectional transmission, which is not limited here.

[0062] like Figure 2As shown, it is a schematic diagram of the data transmission process in the conventional technology. In the process of transmitting the data stream from the transmitting end 01 to the receiving end 02, the transmitting end 01 is used to perform flexible forward error coding (FEC) encoding on the original data stream to obtain a data stream containing multiple FEC code words before puncturing, and then the transmitting end 01 performs puncturing processing on the check bits of the FEC code words before puncturing to obtain a data stream containing multiple FEC code words after puncturing, and then the transmitting end 01 transmits the punctured data stream to the receiving end 02 through the channel transmission medium 03. After receiving the aforementioned punctured data stream, the receiving end 02 performs decoding processing on the data stream to obtain the original data stream. In this process, since the transmitting end 01 only performs puncturing processing on the check bits of the FEC code words, it is not easy to find a suitable punctured check bit, so it is easy to affect the post-correction bit error rate of the FEC code words in the decoding process of the receiving end 02.

[0063] In this regard, the present application provides a data processing method, which adopts a new puncturing mode, which is conducive to searching for a suitable puncturing position and reducing the post-correction bit error rate of the FEC codeword. Figure 3 To introduce:

[0064] like Figure 3 As shown, it is the main process of the data processing method provided by the present application. The data processing device involved in the method can be located in the aforementioned sending device 01 or the sending processing module 02. Specifically, the data processing device will perform the following steps:

[0065] Step 301: A data processing device obtains a first data stream including a plurality of first codewords, where the first data stream is a FEC-encoded data stream.

[0066] Each first codeword includes an information bit and a check bit. For example, the first few bits of the first codeword are information bits, and the last few bits of the first codeword are check bits. Generally, the check bits are determined by the FEC encoder based on the information bits. The FEC encoder may be located in the aforementioned data processing device, or in other processing chips or functional modules outside the aforementioned data processing device, which is not limited here.

[0067] It should be noted that the FEC coding involved in this application can be a coding method based on a low-density parity check code (LDPC), and can also be other types of FEC coding methods, which are not limited by this application. For example, in the Flexible FEC (Flex FEC) coding scenario in 50GPON, the FEC coding is LDPC coding; in other scenarios, the FEC coding can be other types of FEC coding methods.

[0068] In a possible implementation, the first data stream is processed by FEC encoding, but the first data stream is not shortened. For example, the data processing device includes an FEC encoder, and the data processing device performs FEC encoding on the data stream to be encoded based on the FEC encoder, and outputs the first data stream. In this case, the first data stream only includes the first codeword that has not been shortened, and the length of each first codeword in the first data stream is the same.

[0069] For example, Figure 4A The following is an example diagram of a process for a data processing device to obtain a first data stream that has not been shortened. Figure 4A As shown, the length of each data block in the data stream to be encoded is the same, and the data stream to be encoded includes multiple data blocks of length L as an example. The data processing device encodes the data blocks of length L into information bits, adds check bits of length T, and obtains a first data stream. Among them, the length of each first codeword in the first data stream is the same, and each first codeword includes information bits of length L and check bits of length T. Among them, L is an integer greater than 0, and T is an integer greater than 0.

[0070] In another possible implementation, the first data stream is not only subjected to FEC encoding processing, but also subjected to shortening processing. For example, the data stream to be encoded obtained by the data processing device includes not only a plurality of data blocks of length L but also at least one shortened data block of length less than L. The data processing device first performs zero padding processing on each shortened data block in the data stream to be encoded, so that the length of each data block in the data stream to be encoded after zero padding processing is L. Then, the data processing device performs FEC encoding processing on the data stream to be encoded after zero padding processing based on the FEC encoder, and outputs the encoded data stream. Then, the data processing device shortens the information bits of the codewords in the encoded data stream that have been subjected to zero padding processing, and obtains a first data stream containing multiple first codewords. In this case, there is at least one shortened codeword in the first data stream, and the length of the shortened codeword is less than the length of other codewords. That is, there are at least two first codewords of different lengths in the first data stream.

[0071] For example, it is assumed that there is at least one shortened data block (hereinafter referred to as shortened data block) in the data stream to be encoded. Figure 4B As shown, the shortened data block (e.g. Figure 4BThe data block n' in the to-be-encoded data stream is located at the last data block of a frame, and the length of the last data block of the frame is less than the length of other data blocks in the frame. For example, the length of the last data block in the frame (i.e., the shortened data block) is (LS) bits, and the length of other data blocks in the frame is L bits, where S is an integer greater than 0 and less than L. The data processing device performs the following steps on each shortened data block (e.g., Figure 4B The data block n' in the encoding process is padded with S zero bits to obtain a data stream to be encoded after the zero-padded process. At this time, the length of each data block in the data stream to be encoded after the zero-padded process is L bits. For example, after the data block n' with a length of (LS) bits is padded with zeros, a data block n with a length of L bits is obtained. Then, the data processing device encodes the data block with a length of L into information bits, adds a check bit with a length of T, and obtains a coded data stream containing multiple coded blocks. Then, the data processing device performs the last coded block (for example, Figure 4B The information bits of the coded block n) in the first data stream are deleted with S zero bits, so as to obtain a first data stream including at least two first code words of different lengths. For example, the length of the information bits of the last first code word of some frames in the obtained first data stream is (LS) bits, and the length of the information bits of other first code words of the frame is L bits.

[0072] It should be noted that not every last codeword of each frame in the shortened first data stream is shortened, and only the last codeword of some frames may be shortened. The present application does not limit the number of shortened first codewords included in the first data stream.

[0073] Step 302: The data processing device performs puncturing processing on the information bits and check bits of each first codeword in the first data stream, or performs puncturing processing on the information bits of each first codeword in the first data stream, to obtain a second data stream including multiple second codewords.

[0074] In a possible implementation, the data processing device selects a plurality of bits from the information bits of each first codeword for puncturing, that is, excludes (or deletes) the aforementioned plurality of bits from the information bits of the first codeword, and selects a plurality of bits from the check bits of each first codeword for puncturing, that is, excludes (or deletes) the aforementioned plurality of bits from the check bits of the first codeword, to obtain a second codeword. The length of the information bits of the second codeword is less than the length of the information bits of the first codeword, and the length of the check bits of the second codeword is less than the length of the check bits of the first codeword. The length of each second codeword is less than the length of each first codeword.

[0075] In another possible implementation, the data processing device selects a plurality of bits from the information bits of each first codeword for puncturing, that is, excludes (or deletes) the aforementioned plurality of bits from the information bits of the first codeword to obtain a second codeword. The length of the information bits of the second codeword is less than the length of the information bits of the first codeword, and the length of the check bits of the second codeword is equal to the length of the check bits of the first codeword. The length of each second codeword is less than the length of each first codeword.

[0076] The following is an introduction with examples:

[0077] In a possible example, the first data stream includes only a plurality of first codewords with a length of (L+T) bits, the first L bits of the first codeword are information bits, and the last T bits of the first codeword are check bits. Wherein, L is an integer greater than 0, and T is an integer greater than 0. Figure 4A As shown, the data processing device excludes P bits from the first L bits of information bits of each of the first code words, and excludes Q bits from the check bits of the last T bits of each of the first code words, to obtain multiple second code words. Each second code word includes K bits of punctured information bits and M bits of punctured check bits, K=LP, M=TQ, the sum of P and Q is equal to w times r, r is the number of bits to be excluded at each puncturing position, r is an integer greater than 0, w is an integer greater than 0, P is an integer greater than 0, Q is an integer greater than or equal to 0, K is an integer greater than 0, and M is an integer greater than 0.

[0078] In another possible example, the first data stream includes not only a plurality of first codewords with a length of (L+T) bits, but also includes at least one shortened first codeword with a length of (L-S+T) bits, the first (LS) bits of the shortened first codeword are information bits, and the last T bits of the shortened first codeword are check bits. Wherein, L is an integer greater than 0, and T is an integer greater than 0. Figure 4B As shown, the data processing device excludes P' bits from the first (LS) bits of information bits of the shortened first codeword, and excludes Q bits from the check bits of the last T bits of the shortened first codeword, to obtain a shortened second codeword. The shortened second codeword includes K' bits of information bits after puncturing and M bits of check bits after puncturing, K'=LS-P', M=TQ, the sum of P' and Q is equal to w times r, r is the number of bits to be excluded at each puncturing position, r is an integer greater than 0, w is an integer greater than 0, P' is an integer greater than 0, Q is an integer greater than or equal to 0, K' is an integer greater than 0, and M is an integer greater than 0.

[0079] It should be noted that the last codeword of each frame in the first data stream may be a shortened codeword. If the position of the shortening process coincides with the position of the puncturing process, the shortening process is followed and the non-overlapping information bit portion is punctured. Since puncturing and shortening are two independent steps, it is not necessary to introduce the judgment of whether the puncturing position coincides with the shortening position in actual operation, and the processing complexity will not be increased. In other words, regardless of whether there is a shortened first codeword in the first data stream, the data processing device can perform puncturing on the information bit and the check bit of the first codeword respectively, or only perform puncturing on the information bit of the first codeword.

[0080] In this embodiment, since the puncturing range is expanded, that is, the puncturing processing range is extended to the information bit of each first codeword, rather than only puncturing the check bit of each first codeword, it is helpful to search for a suitable puncturing position and reduce the post-correction bit error rate of the FEC codeword.

[0081] In addition, compared with the traditional technology, without increasing the number of puncturing bits, the information bit puncturing is added to the traditional puncturing method, and the check bit puncturing is reduced. Figure 5 For example, the number of punctured bits in the conventional technology is (Q+P) bits, and the conventional puncturing method only punctures (Q+P) bits in the check bit, while the puncturing method proposed in the present application punctures P bits in the information bit and Q bits in the check bit. Among them, P is an integer greater than 0, and Q is an integer greater than or equal to 0. Therefore, the length of the codeword after puncturing in the conventional scheme is the same as the length of the codeword after puncturing in the scheme of the present application, for example, both are (K+M) bits. In addition, since the FEC decoding at the receiving end will restore all bits of the codeword, that is, it can restore the information bits deleted during the puncturing process, therefore, compared with the conventional scheme, the number of information bits transmitted by a single codeword in the scheme of the present application is L, and the code rate is L / (K+M). Therefore, the scheme of this embodiment can reduce the post-correction bit error rate of the FEC codeword while ensuring the code rate.

[0082] The following will be combined Figure 6 The data processing method provided in the present application is further introduced. After obtaining the first data stream, the data processing device performs puncturing processing in the following manner:

[0083] Step 601: A data processing apparatus obtains h first puncturing positions and g second puncturing positions corresponding to each first codeword in a first data stream.

[0084] Among them, each first puncturing position indicates a plurality of bits in the information bit of the first codeword, and each second puncturing position indicates a plurality of bits in the check bit of the first codeword. The number of bits indicated by any two of the h first puncturing positions is the same. For example, the data processing device obtains h first puncturing positions, each of which indicates a bits, where h is an integer greater than 0, and a is an integer greater than 0. The number of bits indicated by any two of the g second puncturing positions is the same. For example, the data processing device obtains g second puncturing positions, each of which indicates b bits, where g is an integer greater than or equal to 0, and b is an integer greater than 0. The number of bits indicated by a first puncturing position may be the same as or different from the number of bits indicated by a second puncturing position. For example, a in the aforementioned example may be equal to b, or a may not be equal to b, and this application does not limit this.

[0085] Optionally, the sum of the number of first puncturing positions and the number of second puncturing positions of each first codeword is equal to w, where w is an integer greater than 1. For example, for a first codeword, the number of first puncturing positions is h, the number of second puncturing positions is g, and a total of h+g=w positions are punctured on the first codeword. Wherein, w is an integer greater than 0, h is an integer greater than 0, and g is an integer greater than or equal to 0.

[0086] Exemplarily, w is related to the post-correction bit error rate and the FEC codeword transmission rate. It can also be understood that w is the optimal solution that can improve the FEC codeword transmission rate while ensuring the post-correction bit error rate.

[0087] Exemplarily, w is the number of puncturing positions that need to be excluded in the standard puncturing process. For example, in the conventional technology, the puncturing mode of puncturing only the check bits needs to select w puncturing positions in the check bits of the first codeword, while the solution of the present application selects w puncturing positions in the information bits and check bits of the first codeword.

[0088] For example, w=7, indicating that 7 puncture positions are generally selected in the 50GPON standard puncture processing. For example, h=1, g=6; or, h=2, g=5; or, h=3, g=4; or, h=4, g=3; or, h=5, g=2; or, h=6, g=1. That is to say, compared with the conventional technology of selecting 7 puncture positions in the check bit of the first codeword for puncture processing, the scheme of the present application selects h puncture positions in the information bit of the first codeword and g puncture positions in the check bit of the first codeword, and a total of h+g=7 puncture positions are selected on the first codeword for puncture processing. Since the puncture positions of the information bits in the first codeword are increased, the puncture positions of the check bits in the first codeword are reduced, and the total number of puncture positions for a first codeword does not change, it is beneficial to keep the code rate unchanged while reducing the post-correction bit error rate of the FEC codeword.

[0089] In a possible implementation manner, each first codeword in the first data stream may be arranged in units of code blocks as follows: Fig. 7A The rectangle shown. Each of the first codewords includes e columns of information bit code blocks and f columns of check bit code blocks, and each column of the code blocks includes at least one bit. Wherein, e is an integer greater than 1, and f is an integer greater than 1. Generally, different code blocks contain the same number of bits, but there may also be a situation where two columns of code blocks contain different numbers of bits, which is not limited in this application. Fig. 7A For example, the aforementioned h first punching positions can be Fig. 7A The information bits of the first codeword in the h-column information bit code block identified as h1, h2, h3, h4 and h5, the aforementioned g second puncturing positions may be Fig. 7A g columns of check bit code blocks identified as g1 and g2 in the check bit of the first code word in , wherein h is an integer greater than 0, and g is an integer greater than or equal to 0. Optionally, the sum of h and g is equal to w. w can be understood as the number of columns of code blocks that need to be excluded in the standard puncturing process.

[0090] It should be noted that the first punching position and / or the second punching position may be determined by the data processing device based on an algorithm or may be manually configured, and the specifics are not limited here. The first punching position and the second punching position obtained by the data processing device satisfy at least one of the following constraints:

[0091] In a possible constraint example, the first puncturing position and the second puncturing position are related to the check matrix construction of the first codeword. For example, the data processing device determines the first puncturing position and the second puncturing position of the first codeword based on pre-configured puncturing positions.

[0092] Another possible constraint example is that the first puncture position and the second puncture position are related to the number of iterative calculations. The first puncture position and the second puncture position obtained by the data processing device are conducive to the second codeword only requiring fewer iterative calculations during the decoding process, thereby improving the efficiency of the receiving device in decoding the second codeword. For example, the first puncture position and the second puncture position of the same first codeword are puncture positions that enable the second codeword corresponding to the first codeword to update all external information of all check nodes of the first codeword after one iterative calculation. Among them, one iterative calculation refers to the receiving device completing the calculation of the external information of all check nodes once according to the check relationship of the check matrix when decoding the second codeword.

[0093] Exemplarily, the data processing device may determine the check matrix of the first codeword based on the first codeword, and each layer of the check matrix of the first codeword corresponds to a check formula, that is, the check matrix of the first codeword corresponds to a multi-layer check formula. For example, the first codeword includes e columns of information bit code blocks and f columns of check bit code blocks, and the check matrix of the first codeword includes f rows of check formulas. There is an association relationship between the aforementioned multi-layer check formulas. Each of the check formulas includes multiple variable nodes. The data processing device may search for the aforementioned first puncturing position and the second puncturing position based on theoretical calculations, fast convergence or simulation experiments. If the first puncturing position and the second puncturing position searched by the data processing device can enable the variable nodes in each layer of the check formula of the check matrix of the second codeword to obtain external information after the first iterative calculation, the external information is used to decode the check formula corresponding to the variable node related to the external information in the second codeword. In other words, the first puncturing position and the second puncturing position enable the external information to be transmitted to all information bits participating in this check after the first iteration during the decoding process.

[0094] Exemplarily, when each row in the f-row check formula of the first codeword in the (e+f) column satisfies the following condition, the second codeword obtained after the puncturing process satisfies the aforementioned constraint:

[0095] At most 1 bit is punctured in the first row;

[0096] Among the punctured bits in the second row, the number of bits not participating in the check of the first row shall not exceed 1;

[0097] Among the punctured bits in the third row, the number of bits that do not participate in the check of either row 1 or row 2 does not exceed 1;

[0098] Among the punctured bits in the fourth row, the number of bits that do not participate in the check of any of the first, second, and third rows does not exceed 1;

[0099] …

[0100] Among the punctured bits in the fth row, the number of bits that do not participate in the check of any of the previous (f-1) rows does not exceed 1.

[0101] It should be noted that, in practical applications, the data processing device may also use other algorithms to determine the first puncture position and the second puncture position that satisfy the aforementioned constraints, which are not listed one by one here.

[0102] Step 602: The data processing device excludes, from each first codeword, the h bits indicating the first puncturing positions and the g bits indicating the second puncturing positions corresponding to the first codeword, to obtain a second data stream including a plurality of second codewords.

[0103] In a possible implementation, the bits indicated by the h first puncturing positions corresponding to the first codeword are bits corresponding to the h column information bit code block, and the bits indicated by the g second puncturing positions corresponding to the first codeword are bits corresponding to the g column check bit code block. The data processing device excludes the h column information bit code block from the e column information bit code block based on the identifier of the h column information bit code block, and excludes the g column check bit code block from the f column check bit code block based on the identifier of the g column check bit code block, to obtain the second codeword. Fig. 7A For example, the data processing device excludes the h column information bit code block from the e column information bit code block of the first code word based on the h column information bit code blocks identified as h1, h2, h3, h4 and h5; in addition, the data processing device excludes the g column check bit code block from the f column check bit code block of the first code word based on the g column check bit code block identified as g1 and g2 to obtain the second code word.

[0104] For example, take the 50GPON standard puncturing 7 columns (each column puncturing 256 bits, a total of 1792 bits punctured) of codewords, and the FEC encoder is an LDPC encoder as an example. Figure 7B As shown, the first codeword includes 69 columns of code blocks, wherein the 1st to 57th columns of the first codeword are information bit code blocks, and the 58th to 69th columns are check bit code blocks. If each column includes 256 bits, then the 57 columns of information bit code blocks of the first codeword are 57×256=14592 bits, the 12 columns of check bit code blocks of the first codeword are 12×256=3072 bits, and the first codeword code length is 15872 bits. If the data processing device determines to perform puncturing processing on the 22nd, 23rd, 42nd, 52nd and 57th columns of the information bits of each first codeword, a total of 5 columns of information bit code blocks, and the 60th and 64th columns of the check bits of each first codeword, a total of 2 columns of check bit code blocks, then the data processing device will determine the following parameters:

[0105] The number of punctured information bits P = h × 256 = 5 × 256 = 1280 bits;

[0106] The number of punctured check bits Q = g × 256 = 2 × 256 = 512 bits;

[0107] The number of information bits after puncturing K = (eh) × 256 = (57-5) × 256 = 52 × 256 = 13312 bits;

[0108] The number of check bits after puncturing M = (fg) × 256 = (12-2) × 256 = 10 × 256 = 2560 bits;

[0109] The length of the second codeword transmitted in the channel is N=K+M=13312+2560=15872 bits;

[0110] The second codeword rate R=(K+P) / N=(13312+1280) / 15872=14592 / 15872≈0.9194.

[0111] The data processing device encodes according to the above parameters through the LDPC encoder. Specifically, Figure 7B As shown, the data processing device generates 3072=512+2560 check bits based on the received 14592 information bits after encoding, and then performs puncturing on the positions corresponding to [22 23 42 52 57 60 64], and finally leaves 13312 information bits and 2560 check bits, a total of 15872 bits. Then the data processing device obtains the second codeword according to Figure 4A Generates a physical frame for transmission.

[0112] like Figure 8 As shown above Figure 7B The example shown is a comparison chart of the puncturing positions with those of the traditional puncturing method. The solution of the traditional technology is to select 7 columns from the 12 columns of check bit code blocks in the first codeword for puncturing; while the solution provided by the present application is to select 7 columns from all 69 columns for puncturing. In this example, the dark shade indicates the code blocks that can transmit external information to the puncturing position in the first iteration, and the light shade indicates the code blocks that cannot transmit external information. If the puncturing process is performed according to the solution of the traditional technology, in the best case there are still two rows (i.e., the first row and the third row) of check formulas that cannot transmit external information in the first iteration, while the solution of the present application can transmit external information at all positions in the first iteration. Therefore, the solution provided by the present application has a faster convergence speed and better performance.

[0113] In addition, Figure 8 The two examples shown in the figure are used to simulate the bit error of Gaussian channel. The simulation results are shown in Fig. 9 As shown. Among them, Fig. 9 The horizontal axis of the line graph is the signal-to-noise ratio (SNR), and the vertical axis is the bit error rate after decoding. It can be seen that the average number of iterations of the two puncturing methods at different SNR points is shown in Table 1 below.

[0114] Table 1

[0115]

[0116] Compared with the traditional puncturing method, at the working point of the system, the average number of decoding iterations is reduced, and the performance is about 0.05dB better than the existing puncturing mode, and the advantage is more obvious at 1e-12. Therefore, the puncturing method provided by the present application is conducive to reducing the post-correction bit error rate of the FEC codeword while ensuring the bit rate, which is conducive to the receiving end using fewer iterative calculations during the decoding process and reducing the processing power consumption of the receiving end hardware.

[0117] like Fig.10 FIG. 1 is a schematic diagram of the structure of a data processing device 10 provided in this embodiment. It should be understood that the aforementioned Figure 3 or Figure 6 The data processing device 10 in the corresponding method embodiment can be based on the Fig.10 The data processing device 10 may be Figure 1 or Figure 2 The transmitting end 01 in the optical communication scenario. For example, in an optical communication scenario, the data processing device 10 may be an optical line terminal (OLT), an optical network unit (ONU) or an optical network terminal (ONT) and other devices. In addition, the data processing device 10 may also be a functional module, an integrated circuit or a chip in the transmitting end 01. For example, in an optical communication scenario, the data processing device 10 may be a functional module, an integrated circuit or a chip in an OLT, an ONU, an ONT and other devices. For example, the data processing device may be a field-programmable gate array (FPGA) or an application-specific integrated circuit (ASIC) in an OLT, an ONU, an ONT and other devices, which is not limited here.

[0118] like Fig.10 As shown, the data processing device 10 includes an acquisition module 1001 and a puncturing processing module 1002. The acquisition module 1001 is used to acquire a first data stream, which is a data stream encoded by FEC and includes multiple first code words; the puncturing processing module 1002 is used to perform puncturing processing on the information bit and check bit of each first code word in the first data stream, or perform puncturing processing on the information bit of each first code word in the first data stream, to obtain a second data stream including multiple second code words, wherein the length of each second code word is less than the length of each first code word.

[0119] Optionally, the acquisition module 1001 includes an FEC encoding module 10011, and the FEC encoding module 10011 is used to perform FEC encoding on the data stream to be encoded to obtain the first data stream.

[0120] In a possible implementation, the acquisition module 1001 is specifically used to obtain h first puncture positions and g second puncture positions corresponding to each first codeword, each first puncture position indicates multiple bits in the information bit of the first codeword, and each second puncture position indicates multiple bits in the check bit of the first codeword, the sum of h and g is equal to w, h is an integer greater than 0, g is an integer greater than or equal to 0, and w is an integer greater than 1; the puncture processing module 1002 is specifically used to exclude the bits indicated by the h first puncture positions and the bits indicated by the g second puncture positions corresponding to the first codeword from each first codeword, to obtain multiple second codewords.

[0121] In a possible implementation, w is the number of punching positions that need to be excluded in the standard punching process. For example, w=7.

[0122] In a possible implementation manner, w is related to the post-correction bit error rate and the FEC codeword transmission rate.

[0123] In a possible implementation manner, the first puncturing positions of any two first codewords in the first data stream are the same, and / or the second puncturing positions of any two first codewords in the first data stream are the same.

[0124] In a possible implementation manner, the first punching position and / or the second punching position is related to the number of iterative calculations.

[0125] In a possible implementation, the first puncturing position and / or the second puncturing position of the same first codeword is a puncturing position that enables the second codeword corresponding to the first codeword to update all external information of all check equations of the first codeword after one iterative calculation.

[0126] In a possible implementation, the first data stream includes a plurality of first codewords with a length of (L+T) bits, the first L bits of the first codeword are information bits, the last T bits of the first codeword are check bits, L is an integer greater than 0, and T is an integer greater than 0. The puncturing processing module 1002 is specifically configured to exclude P bits from the first L bits of information bits of each first codeword, and exclude Q bits from the check bits of the last T bits of each first codeword, to obtain a plurality of second codewords, each second codeword includes K bits of punctured information bits and M bits of punctured check bits, K=LP, M=TQ, the sum of P and Q is equal to w times r, r is the number of bits to be excluded at each puncturing position, r is an integer greater than 0, w is an integer greater than 0, P is an integer greater than 0, Q is an integer greater than or equal to 0, K is an integer greater than 0, and M is an integer greater than 0.

[0127] In a possible implementation, the aforementioned h first puncturing positions include h columns of information bit code blocks and the aforementioned g second puncturing positions include g columns of check bit code blocks, each first codeword includes e columns of information bit code blocks and f columns of check bit code blocks, and each column of code blocks includes at least one bit. The acquisition module 1001 is specifically used to obtain the identifier of each column of information bit code blocks in the h columns of information bit code blocks and the identifier of each column of check bit code blocks in the g columns of check bit code blocks; the puncturing processing module 1002 is specifically used to exclude the h column of information bit code blocks from the e column of information bit code blocks based on the identifier of the h column of information bit code blocks, and exclude the g column of check bit code blocks from the f column of check bit code blocks based on the identifier of the g column of check bit code blocks, to obtain the second codeword, e is an integer greater than 1, f is an integer greater than 1, h is an integer greater than 0, and g is an integer greater than or equal to 0. Optionally, the sum of h and g is equal to w.

[0128] In one possible implementation, the check matrix of the second codeword corresponds to a multi-layer check formula, and the variable nodes in each layer of the check formula of the check matrix of the second codeword can obtain external information after the first iterative calculation, and the external information is used to decode the check formula corresponding to the variable nodes in the second codeword related to the external information.

[0129] In a possible implementation, there is at least one shortened frame in the first data stream, and the length of the information bit of the last first codeword of the shortened frame is less than the length of the information bit of other first codewords of the frame. The data processing device also includes a zero-padding processing module 10012; the zero-padding processing module 10012 is used to perform zero-padding processing on each shortened frame in the to-be-encoded data stream to obtain a zero-padding to-be-encoded data stream; the FEC encoding module 10011 is used to perform FEC encoding processing on the zero-padding to-be-encoded data stream to obtain an encoded data stream; the shortening processing module 10013 is used to shorten each zero-padding frame in the encoded data stream to obtain a first data stream.

[0130] In a possible implementation, there is at least one shortened frame in the first data stream, and the length of the information bit of the last first codeword of the shortened frame is equal to (LS), where S is an integer greater than 0 and less than L; an acquisition module 1001 is used to acquire a data stream to be encoded, where the data stream to be encoded includes multiple data blocks of length L and at least one shortened data block of length less than L, and the shortened data block is the last data block of a frame; a zero-padding processing module 10012 is used to add S zero bits after each shortened data block in the data stream to be encoded, so as to obtain a zero-padding data stream to be encoded; an FEC encoding module 10011 is used to perform FEC encoding processing on the zero-padding data stream to be encoded with a coding block of L bits in length, so as to obtain a coded data stream; a shortening processing module 10013 is used to delete S zero bits from the information bits of the last coding block of the frame in the coded data stream, so as to obtain the first data stream.

[0131] In a possible implementation, the first data stream further includes at least one shortened first codeword of length (L-S+T) bits, the first (LS) bits of the shortened first codeword are information bits, the last T bits of the shortened first codeword are check bits, L is an integer greater than 0, and T is an integer greater than 0. The puncturing processing module 1002 is specifically configured to exclude P' bits from the information bits of the first (LS) bits of the shortened first codeword, and exclude Q bits from the check bits of the last T bits of the shortened first codeword, to obtain a shortened second codeword, the shortened second codeword includes K' bits of punctured information bits and M bits of punctured check bits, K'=LS-P', M=TQ, the sum of P' and Q is equal to w times r, r is the number of bits to be excluded at each puncturing position, r is an integer greater than 0, w is an integer greater than 0, P' is an integer greater than 0, Q is an integer greater than or equal to 0, K' is an integer greater than 0, and M is an integer greater than 0.

[0132] For the rest, please refer to the above Figure 3 or Figure 6 The method of the data processing device in the corresponding embodiment will not be described in detail here.

[0133] like Fig.11 FIG. 1 is a schematic diagram of the structure of another data processing device 110 provided in this embodiment. It should be understood that the aforementioned Figure 3 or Figure 6 The data processing device in the corresponding method embodiment can be based on the Fig.11 The structure of the data processing device 110 is shown in FIG. Fig.11As shown, the data processing device 110 may include a processor 1101 and a transceiver 1102 , and the processor 1101 is coupled to the transceiver 1102 .

[0134] The processor 1101 may be a central processing unit (CPU), an application-specific integrated circuit (ASIC), a programmable logic device (PLD) or a combination thereof. The PLD may be a complex programmable logic device (CPLD), a field-programmable gate array (FPGA), a generic array logic (GAL) or any combination thereof. The processor 1101 may refer to one processor or may include multiple processors, which is not specifically limited here.

[0135] The transceiver 1102 may also be referred to as a transceiver unit, a transceiver, a transceiver device, etc. Optionally, a device in the transceiver unit for implementing a receiving function may be regarded as a receiving unit, and a device in the transceiver unit for implementing a sending function may be regarded as a sending unit, that is, the transceiver unit includes a receiving unit and a sending unit, and the receiving unit may also be referred to as a receiver, an input port, a receiving circuit, etc., and the sending unit may be referred to as a transmitter, a transmitter, or a transmitting circuit, etc.

[0136] Optionally, the data processing device 110 also includes a memory 1103. The processor 1101 is coupled to the memory 1103. The memory 1103 is mainly used to store software programs and data. The memory 1103 can exist independently and be connected to the processor 1101. Optionally, the memory 1103 can be integrated with the processor 1101, for example, integrated into one or more chips. The memory 1103 can store program codes for executing the technical solutions of the embodiments of the present application, and the execution is controlled by the processor 1101. The various types of computer program codes executed can also be regarded as drivers for the processor 1101. The memory 1103 may include a volatile memory, such as a random-access memory (RAM); the memory may also include a non-volatile memory, such as a read-only memory (ROM), a flash memory, a hard disk drive (HDD) or a solid-state drive (SSD); the memory 1103 may also include a combination of the above-mentioned types of memories. The memory 1103 may refer to one memory, or may include multiple memories. Exemplarily, the memory 1103 is used to store various data. For example, at least one first punching position and at least one second punching position. For another example, the identifier of the h column information bit code block and the identifier of the g column check bit code block in the first codeword. Specifically, please refer to the relevant introduction in the previous embodiment, which will not be repeated here.

[0137] In one implementation, the memory 1103 stores computer-readable instructions, which include multiple software modules, for example, Fig.10 The acquisition module 1001, the puncturing processing module 1002, the FEC encoding module 10011, the zero padding processing module 10012 and the shortening processing module 10013 described above are described in detail. Fig.10 The relevant description in will not be repeated here.

[0138] In addition, the present application provides a computer program product, which includes one or more computer instructions. When the computer program instructions are loaded and executed on a computer, the process or function according to the embodiment of the present application is generated in whole or in part. For example, the aforementioned Figure 3 or Figure 6Methods related to a data processing device in a computer. The computer may be a general-purpose computer, a special-purpose computer, a computer network, or other programmable devices. The computer instructions may be stored in a computer-readable storage medium, or transmitted from one computer-readable storage medium to another computer-readable storage medium, for example, the computer instructions may be transmitted from one website, computer, server, or data center to another website, computer, server, or data center by wired (e.g., coaxial cable, optical fiber, digital subscriber line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.) means. The computer-readable storage medium may be any available medium that a computer can store or a data storage device such as a server or data center that includes one or more available media integrated. The available medium may be a magnetic medium (e.g., a floppy disk, a hard disk, a magnetic tape), an optical medium (e.g., a digital versatile disc (DVD)), or a semiconductor medium (e.g., a solid state disk (SSD)), etc.

[0139] In addition, the present application also provides a computer-readable storage medium, which stores a computer program, which is executed by a processor to implement the above Figure 3 or Figure 6 A method related to a data processing device in a method.

[0140] It should be understood that in the various embodiments of the present application, the size of the serial numbers of the above-mentioned processes does not mean the order of execution. The execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiments of the present application.

[0141] Those skilled in the art can clearly understand that, for the convenience and brevity of description, the specific working processes of the systems, devices and units described above can refer to the corresponding processes in the aforementioned method embodiments and will not be repeated here.

Claims

1. A data processing method, characterized in that: include: Acquire a first data stream, where the first data stream is a data stream that has been subjected to forward error correction coding (FEC), and the first data stream includes a plurality of first codewords; Puncturing the check bit of each of the first code words in the first data stream to obtain a second data stream including a plurality of second code words, wherein the length of each of the second code words is smaller than the length of each of the first code words; The second data stream is output.

2. The method according to claim 1, characterized in that The step of performing puncturing processing on the check bits of each of the first codewords in the first data stream to obtain a second data stream including a plurality of second codewords includes: Obtain h first puncturing positions corresponding to each first codeword, where h is an integer greater than 0; The plurality of second codewords are obtained by excluding the h bits indicated by the first puncturing positions from each of the first codewords.

3. The method according to claim 1, characterized in that The first puncturing positions of any two of the first codewords in the first data stream are the same.

4. The method according to any one of claims 1 to 3, characterized in that The first puncture position is related to the number of iterative calculations.

5. The method according to claim 4, characterized in that The first puncturing position of the same first codeword is a puncturing position that enables the second codeword corresponding to the first codeword to update all external information of all check equations of the first codeword after one iterative calculation.

6. The method according to any one of claims 1 to 3, characterized in that: The first data stream includes a plurality of first codewords with a length of (L+T) bits, the first L bits of the first codeword are information bits, the last T bits of the first codeword are check bits, L is an integer greater than 0, and T is an integer greater than 0; The step of performing puncturing on the check bit of each of the first code words in the first data stream to obtain a second data stream including a plurality of second code words includes: Exclude Q bits from the check bits of the last T bits of each of the first codewords to obtain multiple second codewords, each of the second codewords includes L bits of information bits and M bits of punctured check bits, Q is an integer greater than or equal to 0, and M is an integer greater than 0.

7. The method according to claim 6, characterized in that The check matrix of the second codeword corresponds to a multi-layer check formula, and the variable nodes in each layer of the check matrix of the second codeword can obtain external information after the first iterative calculation, and the external information is used to decode the check formula corresponding to the variable nodes in the second codeword related to the external information.

8. The method according to any one of claims 1 to 3, characterized in that There is at least one shortened frame in the first data stream; The obtaining of the first data stream comprises: Performing zero padding on each shortened frame in the to-be-encoded data stream to obtain a zero-padded to-be-encoded data stream; Perform FEC encoding on the zero-padded data stream to be encoded to obtain the first data stream.

9. The method according to claim 1, characterized in that: The first codeword includes an information bit code block and a check bit code block.

10. The method according to claim 9, characterized in that The first codeword includes a 57-bit information bit code block and a 12-column check bit code block.

11. The method according to claim 1, characterized in that: The obtaining of the first data stream comprises: Perform forward error correction (FEC) encoding on the original data stream to obtain multiple first data streams containing the first codeword.

12. The method according to claim 11, characterized in that The FEC coding is a low-density parity check code or a flexible FEC coding.

13. The method according to claim 11, characterized in that Also includes: A check matrix of the first codeword is determined based on the first codeword.

14. A data processing device, characterized in that: Includes processor and transceiver; The transceiver is used to receive a first data stream and output a second data stream; The processor is configured to execute the method according to any one of claims 1 to 13.

15. A chip, characterized in that: including at least one logic circuit and an input-output interface; The input and output interface is used to input a first data stream and output a second data stream; The logic circuit is configured to execute the method according to any one of claims 1 to 13.

16. A computer-readable storage medium, characterized in that: Instructions are stored, and when the instructions are executed on a computer, the computer is caused to execute the method according to any one of claims 1 to 13.

Citation Information

Patent Citations

  • Multiple access method and corresponding transmitting method, receiver and transmitter

    CN107070541A

  • IR(Incremental Redundancy)-HARQ (Hybrid Automatic Repeat Request) transmission method applied to LDPC (Low Density Parity Check) codes in 5G

    CN107181576A

  • 5G LDPC coder and coding method with low complexity and high throughput rate

    CN109347486A

  • Rate-compatible 5G LDPC code encoding device and encoding method

    CN111162797A

  • Data processing method based on QC_LDPC code, communication device, equipment and storage medium

    CN113612579A