CN112737736B - Data processing method in channel coding, computer device and storage medium - Google Patents
Data processing method in channel coding, computer device and storage medium Download PDFInfo
- Publication number
- CN112737736B CN112737736B CN202110358974.7A CN202110358974A CN112737736B CN 112737736 B CN112737736 B CN 112737736B CN 202110358974 A CN202110358974 A CN 202110358974A CN 112737736 B CN112737736 B CN 112737736B
- Authority
- CN
- China
- Prior art keywords
- bit
- data
- segment
- original
- end position
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0056—Systems characterized by the type of code used
- H04L1/0067—Rate matching
- H04L1/0068—Rate matching by puncturing
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Error Detection And Correction (AREA)
- Compression, Expansion, Code Conversion, And Decoders (AREA)
Abstract
The invention relates to the technical field of communication, and discloses a data processing method in channel coding, computer equipment and a storage medium. When the data processing method provided by the invention is applied to a system with fixed data bit width, the bit section can be subjected to bit-level processing by taking the fixed data bit width as a unit when the system processes data, and the system delay and the processing time are shortened. And determining the positions of the bit segments to be punched in the original bit segments and the original data segments respectively, and performing punching processing. The remaining valid bits can be recombined according to the condition of the invalid bits after puncturing in the data start position and/or the data end position to obtain a new data segment, and the invalid bit at the end of the new data segment is replaced by 0, so that the invalid bits do not exist in the punctured data, and the data at other positions in the data stream cannot be changed, which is beneficial to the simpler and clearer operation of the system when processing the data at the bit level.
Description
Technical Field
The present invention relates to the field of communications technologies, and in particular, to a data processing method in channel coding, a computer device, and a storage medium.
Background
When the PDSCH of the physical downlink shared channel in the 5G NR system performs channel coding, a large amount of processes for bit-level processing on bit streams are involved. The basic flow of channel coding mainly adds CRC to each transmission block to detect transmission errors, then carries out code block segmentation, channel coding and rate matching processing, and then carries out code block concatenation on all code blocks to form a bit sequence based on the transmission blocks. In the channel coding process, bit puncturing operations are used in many places, for example, after LDPC coding, a previous segment of bit segments needs to be punctured, and in the rate matching process, a middle segment of padding bit segments needs to be removed.
The processing of data by chips such as FPGA (field programmable gate array) and DSP (digital signal processing chip) has a fixed data bit width, and there is a certain complexity and challenge when bit-level punching operation is performed on bit segments by using such systems with fixed data bit width. This is because the bit segment to be punctured may not be an integer multiple of the fixed data bit width, so that some bits of some data may be invalid in the punctured data, and the invalid bits may not exist in the data stream, and when the invalid bits are removed, data at other positions in the data stream may be changed, thereby making it quite complicated and difficult to perform bit-level processing based on a system with a fixed data bit width.
Disclosure of Invention
In view of the foregoing, it is desirable to provide a data processing method, a computer device, and a storage medium in channel coding, which address the problems of complexity and difficulty in performing puncturing operations on bit segments using a system with a fixed data bit width.
A data processing method in channel coding is applied to a wireless communication system, the wireless communication system has a fixed data bit width when processing signals, the method comprises the steps of converting original bit sections of signals to be processed into original data sections according to the data bit width; determining the bit start position and the bit end position of a bit segment needing to be cut in the original bit segment; converting the bit start position and the bit end position in the original bit segment into a data start position and a data end position in the original data segment; punching the original bit segment; recombining the remaining effective bits according to the condition of the invalid bits after punching in the data start position and/or the data end position to obtain a new data segment; replacing the invalid bit at the end in the new data segment with 0.
The data processing method of the channel coding firstly converts the original bit segment into an original data segment according to the fixed data bit width of the system. And according to the bit start position and the bit end position of the bit segment needing to be cut in the original bit segment and the corresponding data start position and data end position of the bit segment needing to be cut in the data segment, punching the signal. And then, according to the condition of invalid bits appearing after the punching in the data start position and/or the data end position, recombining the residual valid bits to obtain a new data segment. When the data processing method is applied to a system with a fixed data bit width, the bit section can be subjected to bit-level processing by taking the fixed data bit width as a unit when the system processes data, and the system delay and the processing time are shortened. And recombining the remaining valid bits according to the condition of the invalid bits after the puncturing in the data start position and/or the data end position to obtain a new data segment, and replacing the invalid bit at the tail of the new data segment with 0, so that the invalid bits do not exist in the punctured data, and the data at other positions in the data stream cannot be changed, which is beneficial to the simpler and clearer operation of the system when the system performs the data processing at the bit level.
In one embodiment, the converting the original bit segment of the signal to be processed into the original data segment according to the fixed data bit width includes acquiring the original bit segment length of the signal to be processed and the fixed data bit width of a system; and dividing the original bit segment by taking the fixed data bit width as a unit to obtain the original data segment.
In one embodiment, the determining the bit start position and the bit end position of the bit segment to be dropped in the original bit segment includes defining the start position of the original bit segment as the bit start position, and determining the bit end position according to the length of the bit segment to be dropped; or, defining the end position of the original bit segment as the bit end position, and determining the bit start position according to the length of the bit segment to be dropped; or defining the middle position of the original bit segment as the bit start position, and determining the bit end position according to the length of the bit segment needing to be cut.
In one embodiment, when the start position of the original bit segment is defined as the bit start position and the bit end position is determined according to the length of the bit segment to be punctured, the puncturing process for the original bit segment includes puncturing a bit portion from the data start position to the data end position when the bit end position is at the end position of the data end position; and when the bit end position is at a position other than the tail end position of the data end position, puncturing a bit part from the data start position to a position before the data end position, and puncturing a bit part which needs to be punctured in the data end position.
In one embodiment, when the end position of the original bit segment is defined as the bit end position and the bit start position is determined according to the length of the bit segment to be punctured, the puncturing process for the original bit segment includes puncturing a bit portion from the data start position to the data end position when the bit start position is at the start position of the data start position; when the starting position of the bits is at the non-starting position of the data, puncturing the bit part from the position behind the starting position of the data to the ending position of the data, and puncturing the bit part which needs to be punctured in the starting position of the data.
In one embodiment, when the middle position of the original bit segment is defined as the bit start position and the bit end position is determined according to the length of the bit segment to be punctured, the puncturing process for the original bit segment includes puncturing a bit portion from the data start position to the data end position when the bit start position is at the start position of the data start position and the bit end position is at the end position of the data end position; when the bit starting position is at the starting position of the data starting position and the bit ending position is at the non-end position of the data ending position, puncturing a bit part from the data starting position to the position before the data ending position, and puncturing a bit part needing to be punctured in the data ending position; when the bit starting position is at a non-starting position of the data starting position and the bit ending position is at an end position of the data ending position, puncturing a bit part from a position behind the data starting position to the data ending position, and puncturing a bit part which needs to be punctured in the data starting position; when the bit start position is located at a non-start position of the data start position and the bit end position is located at a non-end position of the data end position, puncturing a bit portion from a position after the data start position to a position before the data end position, and puncturing bit portions which need to be punctured in the data start position and the data end position.
In one embodiment, the rearranging the remaining valid bits according to the punctured invalid bits in the data start position and/or the data end position includes, when the bit start position is at a non-start position of the data start position, replacing the valid bit position at a higher position in each data segment after the data end position with a lower position at a previous position until the punctured invalid bits are replaced at the end of the new data segment.
In one embodiment, the rearranging the remaining valid bits according to the punctured invalid bits in the data start position and/or the data end position, the arranging the invalid bits to the end of the new data segment includes replacing the valid bit positions that are higher in each segment of the data segment after the data end position with the lower bits of the previous position when the bit start position is at the start position of the data start position and the bit end position is at the non-end position of the data end position until the punctured invalid bits are replaced to the end of the new data segment; when the bit starting position is at the non-starting position of the data starting position and the bit ending position is at the end position of the data ending position, replacing the effective bit position at the high position in each data segment after the data ending position to the low position of the previous position until replacing the invalid bit after punching to the end of a new data segment; and when the bit starting position is at a non-starting position of the data starting position and the bit ending position is at a non-ending position of the data ending position, replacing the effective bit position at the high position in each data segment after the data starting position with the low position at the previous position until replacing the invalid bit appearing after the punching with the end of a new data segment.
A computer device comprising a memory and a processor, the memory storing a computer program, wherein the processor when executing the computer program implements the steps of the channel coded data processing method described in any one of the above embodiments.
A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the steps of the channel coded data processing method described in any one of the preceding embodiments.
Drawings
In order to more clearly illustrate the embodiments of the present specification or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments described in the specification, and other drawings can be obtained by those skilled in the art without inventive labor.
FIG. 1 is a flowchart illustrating a method for processing data in channel coding according to an embodiment of the present invention;
FIG. 2 is a flowchart illustrating a method for converting an original bit segment into an original data segment according to an embodiment of the present invention;
FIG. 3 is a diagram illustrating a method for puncturing an original bit segment in a first case according to an embodiment of the present invention;
FIG. 4 is a diagram illustrating a method for puncturing original bit segments in a second case according to an embodiment of the present invention;
FIG. 5 is a diagram illustrating a method for puncturing original bit segments in a third scenario according to an embodiment of the present invention;
FIG. 6 is a diagram illustrating a method for reconstructing remaining data in the puncturing pattern of case 1 according to an embodiment of the present invention
FIG. 7 is a diagram illustrating a method for reorganizing the lower bits and the upper bits of the significant bits of Kb2 according to an embodiment of the present invention;
FIG. 8 is a diagram illustrating a method for reorganizing the lower bits and the upper bits of the significant bits of Kb1 according to an embodiment of the present invention.
Detailed Description
To facilitate an understanding of the invention, the invention will now be described more fully with reference to the accompanying drawings. Preferred embodiments of the present invention are shown in the drawings. This invention may, however, be embodied in many different forms and should not be construed as limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete.
It will be understood that when an element is referred to as being "secured to" another element, it can be directly on the other element or intervening elements may also be present. When an element is referred to as being "connected" to another element, it can be directly connected to the other element or intervening elements may also be present. As used herein, the terms "vertical," "horizontal," "left," "right," "upper," "lower," "front," "rear," "circumferential," and the like are based on the orientation or positional relationship shown in the drawings for ease of description and simplicity of description, and do not indicate or imply that the referenced device or element must have a particular orientation, be constructed and operated in a particular orientation, and are therefore not to be considered limiting of the present invention.
Unless defined otherwise, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this invention belongs. The terminology used in the description of the invention herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention. As used herein, the term "and/or" includes any and all combinations of one or more of the associated listed items.
When the system processes the bit segment in bit level, if each bit is processed one by one, the system delay and processing time will be increased greatly. Therefore, the bit-level processing operation performed by the system with the fixed data bit width can increase the processing speed and reduce the system delay, but the bit-level processing operation performed by the system with the fixed data bit width has certain complexity and challenges. This is because the bit segment to be punctured may not be an integer multiple of the fixed data bit width, so that some bits of some data may be invalid in the punctured data, and the invalid bits may not exist in the data stream, and when the invalid bits are removed, data at other positions in the data stream may be changed, thereby making it quite complicated and difficult to perform bit-level processing based on a system with a fixed data bit width.
In view of the difficulties in the prior art, the present invention provides a data processing method in channel coding. Fig. 1 is a flowchart illustrating a method for processing data in channel coding according to an embodiment of the present invention, wherein the method includes the following steps S100 to S600.
S100: and converting the original bit segment of the signal to be processed into an original data segment according to the fixed data bit width.
S200: and determining the bit starting position and the bit ending position of the bit segment needing to be cut in the original bit segment.
S300: and converting the bit starting position and the bit ending position in the original bit segment into a data starting position and a data ending position in the original data segment.
S400: and perforating the original bit segment.
S500: and recombining the residual effective bits according to the condition of the invalid bits which appear after the punching in the data start position and/or the data end position to obtain a new data segment.
S600: the invalid bit at the end in the new data segment is replaced with 0.
The chips such as FPGA (field programmable gate array) and DSP (digital signal processing chip) have fixed data bit width when processing data, and the data processing method is applied to the system with fixed data bit width and can realize the punching processing of any bit section. The system converts the original bit segment of the signal to be processed into an original data segment according to the fixed data bit width when the system processes data. Determining the bit start position and the bit end position of the bit segment to be punctured in the original bit segment, and the corresponding data start position and the data end position of the bit segment to be punctured in the data segment, and puncturing the signal. And recombining the residual effective bits according to the condition of the invalid bits which appear after the punching in the data start position and/or the data end position to obtain a new data segment.
When the data processing method is applied to a system with a fixed data bit width, the bit section can be subjected to bit-level processing by taking the fixed data bit width as a unit when the system processes data, and the system delay and the processing time are shortened. The system can recombine the remaining valid bits according to the condition of the invalid bits after punching in the data start position and/or the data end position, obtain a new data segment, and replace the invalid bit at the tail of the new data segment with 0, so that the invalid bits do not exist in the punched data, the data at other positions in the data stream cannot be changed, and the operation of the system is facilitated to be simpler and clearer when the system carries out data processing at a bit level.
Fig. 2 is a flowchart illustrating a method for converting an original bit segment into an original data segment according to an embodiment of the present invention, wherein in an embodiment, determining a bit start position and a bit end position of a bit segment to be dropped in the original bit segment includes the following steps S110 to S120.
S110: and acquiring the length of an original bit segment of the signal to be processed and the bit width of the fixed data of the system.
S120: and dividing the original bit segment by taking the fixed data bit width as a unit to obtain the original data segment.
The system determines the fixed data bit width 2 when it processes datanAnd obtaining the original bit length Lb of the signal to be processed. Wherein n is an exponent number of 2, and the value of n is an integer greater than 0. According to the length Lb of the original bit segment, the maximum representation bit width m available for the original bit segment can be obtained, and then [ m: 0] can be used]Bit width range of (c) represents the value of Lb, where Lb [ m ] is used:0]To indicate the length value of Lb. In the present embodiment, in order to describe the above puncturing process in more detail, the processing procedure of the data processing method is explained using the original bit segments as shown in table 1. As can be seen from table 1, the original bit segment Lb =330 bits is selected.
TABLE 1 data table of original bit segments
With a fixed data bit width of 2nDividing the original bit segment into data segments, and calculating the length Ld of the original data segment according to the division condition to obtain Ld = Lb [ m: n]. In this embodiment, the fixed data bit width of the system is 16 bits, so that the data table of the original data segment shown in table 2 can be obtained by converting the original bit segment with the original bit segment length of 330 bits shown in table 1 into the data segment with the original bit segment length of 16 bits as the fixed data bit width. Table 2 shows the original data segment obtained by converting the original bit segment shown in table 1. When the original bit segment is converted into the original data segment, each 16 bits in the original bit segment are sequentially converted into one data according to the mode of firstly converting the lower bits into the higher bits. After the original bit segment is converted into the original data segment, the length of the converted original data segment can be known to be Ld =21 according to the conversion condition.
TABLE 2 data sheet of original data segment
In one embodiment, determining the bit start position and the bit end position of the bit segment to be dropped in the original bit segment includes the following steps S210 to S230.
S210: defining the initial position of the original bit segment as the bit starting position, and determining the bit ending position according to the length of the bit segment needing to be cut. Alternatively, the first and second electrodes may be,
s220: defining the end position of the original bit segment as the bit end position, and determining the bit start position according to the length of the bit segment needing to be cut. Alternatively, the first and second electrodes may be,
s230: defining the middle position of the original bit segment as the bit start position, and determining the bit end position according to the length of the bit segment needing to be cut.
In some implementation scenarios, when a bit segment with any length is discarded from an original bit segment, there are three cases. Specifically, as shown in table 3, table 3 is an aggregate table of three puncturing cases. The bit segment to be cut is represented by Rb, the bit segment to be reserved is represented by Kb, and if the reserved bit segment is divided into two parts, the bit segment to be cut is represented by Kb1 and Kb 2.
TABLE 3 aggregation of three puncturing scenarios
Let Sb be the start bit position and Eb be the end bit position, as can be seen from table 3, three cases of removing any bit segment with any length from the original bit segment can be:
Case 2, a bit segment located after the original bit segment needs to be discarded, that is, the end position of the original bit segment is defined as the end position of the bit, Eb = Lb. Then, the bit start position is determined according to the length of the bit segment to be cut. Since the bit segment that needs to be reserved is Kb in this embodiment, the bit start position Sb = Kb is assumed. Wherein Lb = Kb + Rb.
And in case 3, a bit segment in the middle of the original bit segment needs to be discarded, that is, any middle position of the original bit segment is defined as a bit start position. Then, the bit start position is determined according to the length of the bit segment to be cut. Since the two bit segments that need to be reserved are Kb1 and Kb2, in the present embodiment, let Sb = Kb1 be the bit start position and Eb = Kb1+ Rb be the bit end position.
In one embodiment, let the data start position be Sd and the data end position be Ed. When converting the bit start position Sb and the bit end position Eb in the original bit segment into the data start position Sd and the data end position Ed in the original data segment, the bit start position Sb and the bit end position Eb may be located at the fixed data bit width 2 according to whether or not the bit start position Sb and the bit end position Eb are located at the fixed data bit width 2nThe comparison at the position of the integral multiple of (c) is converted in different ways.
When converting the bit start position Sb into the data start position Sd, it may be in accordance with Sb [ n-1:0]]The judgment result of whether the value is 0 can be divided into two different transformation modes. Mode one, if Sb [ n-1:0]0, the data start position for transformation is Sd = Sb [ m: n%](ii) a Mode two, if Sb [ n-1:0]If not 0, the data start position Sd = Sb [ m: n ] of the conversion]+1. The data at the data start position Sd converted out in the second mode has a part of valid bits and a part of invalid bits, where the lower Sb [ n-1:0] is]Bits are valid bits requiring a reservation, high 2n- Sb[n-1:0]The invalid bit needs to be turned off.
When converting the end position Eb of the bit into the end position Ed of the data, according to Eb [ n-1:0]]The judgment result of whether the value is 0 can be also divided into two different transformation modes. Mode one if Eb [ n-1:0]0, the end of the translated data position Ed = Eb [ m: n](ii) a Mode two, if Eb [ n-1:0]If not 0, the end of data position Ed = Eb [ m: n ] of the translation]+1. The data at the end position Ed of the data converted out in the second mode has a part of valid bits and a part of invalid bits, wherein the lower Eb [ n-1:0]]Bits invalid, need to be turned off, 2 highn- Eb[n-1:0]Reserved for valid bits.
In one embodiment, when the start position of the original bit segment is defined as the bit start position and the bit end position is determined according to the length of the bit segment to be punctured, the puncturing process for the original bit segment includes the following steps S410 to S420.
S410: when the bit end position is at the end position of the data end position, the bit portion from the data start position to the data end position is punctured.
S420: and when the bit end position is at the position which is not the tail position of the data end position, punching the bit part from the data start position to the position which is before the data end position, and punching the bit part which needs to be punched in the data end position.
When the start position of the original bit segment is defined as the bit start position, and the bit end position is determined according to the length of the bit segment to be punctured, that is, when it is determined that the original bit segment is processed in the puncturing manner of case 1, the bit part belonging to the integral multiple of the bit width in the bit segment to be punctured may be punctured first.
In case 1, when a bit portion that is an integral multiple of the bit width in the bit segment needs to be punctured, the puncturing process may be performed according to the conversion between the data start position Sd and the data end position Ed. If Eb [ n-1:0]When the bit width is 0, the bit part of the bit segment which belongs to the integral multiple of the bit width is knocked off from the position 0 to the position Ed of the data segment. If Eb [ n-1:0]If not 0, then the bit part of the bit segment which belongs to integral multiple of bit width is cut off from the 0 position to the Ed-1 position of the data segment, and the data at the Ed position is lower by Eb [ n-1:0]]Bits invalid, need to be turned off, 2 highn- Eb[n-1:0]Bits need to be reserved for valid bits.
When Eb [ n-1:0]When the bit segment is 0, the bit segments to be knocked off are all at integer multiples of the bit width, so that invalid bits do not exist in the rest bit segments, and the bit parts of non-bit width integer multiples at the tail end of the bit segments to be knocked off are not required to be processed. When Eb [ n-1: 0)]When not 0, of the data at the Ed position, the lower Eb [ n-1:0]]Bit is invalid bit, 2 highern- Eb[n-1:0]The bit is a valid bit, so that the invalid bit in the Ed position needs to be also turned off, and the data in the original data segment from the Eb position to the back is reserved.
For describing the puncturing process in more detail, the original bit segment Lb =330bit is selected, the system fixes the data bit width to 16bit, and the previous Rb =150bit segment is cut out as an example for explanation. Fig. 3 is a schematic diagram of a method for puncturing an original bit segment in a first case according to an embodiment of the present invention. The first table in fig. 3 is a data table of original bit segments that need to be removed and retained in the puncturing pattern of case 1, the second table is a data table of original data segments that need to be removed and retained in the puncturing pattern of case 1, and the third table is a data table of original data segments that need to be retained in the puncturing pattern of case 1.
As can be seen from fig. 3, when Sb =0 and Rb =150bit, Eb =150bit, and Sd =0 and Ed =10 can be further determined. After completing the puncturing operation for the original bit segment according to case 1, the remaining data segment is shown in the third table of fig. 3. When Rb =150 bits, Ed =10, and after the puncturing operation is performed on the original bit segment, there are 10-bit valid bits and 6-bit invalid bits in Ed.
In one embodiment, when the end position of the original bit segment is defined as the bit end position and the bit start position is determined according to the length of the bit segment to be punctured, the puncturing process for the original bit segment includes the following steps S430 to S440.
S430: when the bit start position is at the start position of the data start position, a bit portion from the data start position to the data end position is punctured.
S440: when the bit start position is at the non-start position of the data start position, the bit part from the position behind the data start position to the data end position is punctured, and the bit part needing to be punctured in the data start position is punctured.
When the end position of the original bit segment is defined as the bit end position, and the bit start position is determined according to the length of the bit segment to be punctured, that is, when it is determined that the original bit segment is processed in the puncturing manner of case 2, the bit part belonging to the integral multiple of the bit width in the bit segment to be punctured may be punctured first.
In case 2, when a bit portion that is an integral multiple of the bit width in the bit segment needs to be punctured, the puncturing process may be performed according to the conversion between the data start position Sd and the data end position Ed. If Sb [ n-1:0]When the data is 0, all the data at the Sd position are valid bits, and the bits from the 0 position to the Ed position of the data segment are the bits to be turned offThe bit part of the segment belonging to integral multiple of bit width punches from the 0 position to the Ed position of the data segment. If Sb [ n-1:0]If not 0, then the data at the Sd position is low Sb [ n-1:0]]Bits are valid bits requiring a reservation, high 2n- Sb[n-1:0]Bits that are invalid need to be removed.
Fig. 4 is a diagram illustrating a method for puncturing an original bit segment in a second case according to an embodiment of the present invention. The first table in fig. 4 is a data table of original bit segments that need to be removed and retained in the puncturing pattern of case 2, the second table is a data table of original data segments that need to be removed and retained in the puncturing pattern of case 2, and the third table is a data table of original data segments that need to be retained in the puncturing pattern of case 2. As can be seen from the first and second tables in fig. 4, when Eb =330 and Rb =180bit, Sb =150bit, Sd =10 and Ed =21 can be further determined.
When Sb [ n-1:0] is 0, bit sections needing to be knocked off are all located at integral multiples of bit width, therefore, invalid bits do not exist in the rest bit sections, and bit parts at the tail end of the bit sections which are not in integral multiples of the bit width do not need to be knocked off.
And when Sb [ n-1:0]When not 0, among data at the Sd position, low Sb [ n-1:0]]Bit is valid bit, high 2n- Sb[n-1:0]The bits are invalid bits, so that the invalid bits in the Sd position need to be turned off, and the data in the original data segment from the Sb position onward is retained. After the puncturing operation for the original bit segment is completed according to case 2, the remaining data segment is shown in the third table of fig. 4. It can be seen that when Rb =180bit, Sd =10, and the original bit segment is punctured, there are 10-bit valid bits and 6-bit invalid bits in Sd.
In one embodiment, when the middle position of the original bit segment is defined as the bit start position and the bit end position is determined according to the length of the bit segment to be punctured, the puncturing process for the original bit segment includes the following steps S450 to S480.
S450: when the bit start position is at the start position of the data start position and the bit end position is at the end position of the data end position, the bit portion from the data start position to the data end position is punctured.
S460: when the bit start position is at the start position of the data start position and the bit end position is at the non-end position of the data end position, the bit part from the data start position to the position before the data end position is punched, and the bit part needing to be punched in the data end position is punched.
S470: when the bit start position is at the non-start position of the data start position and the bit end position is at the end position of the data end position, the bit part from the position behind the data start position to the data end position is punctured, and the bit part needing to be punctured in the data start position is punctured.
S480: when the bit start position is at the non-start position of the data start position and the bit end position is at the non-end position of the data end position, the bit part from the position behind the data start position to the position in front of the data end position is punched, and the bit part needing to be punched in the data start position and the data end position is punched.
When the bit start position is at the start position of the data start position and the bit end position is at the non-end position of the data end position, that is, when it is determined that the original bit segment is processed in the puncturing manner of case 3, the bit portion belonging to the integral multiple of the bit width in the bit segment to be punctured may be punctured first.
In the condition of case 3, when a bit portion that is an integral multiple of the bit width in the bit segment needs to be punctured, the puncturing process may be performed according to the conversion between the data start position Sd and the data end position Ed. If Eb [ n-1:0] is 0 and Sb [ n-1:0] is 0, then the bit part belonging to integral multiple of bit width in the bit segment is knocked off from the Sd position to the Ed position.
If Eb [ n-1:0]Sb [ n-1:0] instead of 0]At 0, then Sd position to Ed-1 position are equal to Eb [ n-1:0] for dropping the bit portions belonging to integer multiples of the bit width in the bit segment, and the data at the Ed position is lower]Bits invalid, need to be turned off, 2 highn- Eb[n-1:0]Bits need to be reserved for valid bits.
If Eb [ n-1:0]0 and Sb [ n-1:0]When not 0, then the Sd +1 position to the Ed position are for cutting off the bit part belonging to integral multiple of bit width in the bit section, and the data at the Sd position is low Sb [ n-1:0]]Bits are valid bits requiring a reservation, high 2n- Sb[n-1:0]Bits that are invalid need to be removed.
If Eb [ n-1:0]Is not 0 and Sb [ n-1:0]If not 0, then the Sd +1 position to the Ed-1 position are for knocking out the bit portions belonging to integer multiples of the bit width in the bit segment, and the data at the Ed position is low Eb [ n-1:0]]Bits invalid, need to be turned off, 2 highn- Eb[n-1:0]Bits are valid bits that need to be retained, and data at the Sd position, low Sb [ n-1:0]]Bits are valid bits requiring a reservation, high 2n- Sb[n-1:0]Bits that are invalid need to be removed.
Fig. 5 is a diagram illustrating a method for puncturing an original bit segment in a third case according to an embodiment of the present invention. The first table in fig. 5 is a data table of original bit segments that need to be removed and retained in the puncturing pattern of case 3, the second table is a data table of original data segments that need to be removed and retained in the puncturing pattern of case 3, and the third table is a data table of original data segments that need to be retained in the puncturing pattern of case 3. As can be seen from the first and second tables in fig. 5, the data to be retained are Kb1=250bit, Kb2=30 bit.
When Sb [ n-1:0] is 0 and Eb [ n-1:0] is 0, the bit sections to be punched out are all at integral multiples of the bit width, so no invalid bit exists in the rest bit sections, and the bit parts at the tail end of the bit sections which are not integral multiples of the bit width do not need to be punched out.
When Sb [ n-1:0]Not 0 but Eb [ n-1:0]0, among data at the Sd position, low Sb [ n-1:0]]Bit is valid bit, high 2n- Sb[n-1:0]The bits are invalid bits, so that the invalid bits in the Sd position need to be turned off, and the data in the original data segment from the Sb position onward is retained.
When Sb [ n-1:0]Is 0 and Eb [ n-1:0]When not 0, of the data at the Ed position, the lower Eb [ n-1:0]]Bit is invalid bit, 2 highern- Eb[n-1:0]The bits are valid bits, so that the invalid bit in the Ed position needs to be also turned off, and the Sb bit in the original data segment is reservedForward data is put.
When Sb [ n-1:0]Is not 0 and Eb [ n-1:0]When it is not 0 either, of the data at the Sd position, low Sb [ n-1:0]]Bit is valid bit, high 2n- Sb[n-1:0]The bit is an invalid bit, and of the data at the Ed position, the lower Eb [ n-1:0]]Bit is invalid bit, 2 highern- Eb[n-1:0]The bits are valid bits, so that invalid bits in the Sd and Ed positions need to be turned off, and data in the original data segment from the Sb position onward and data in the original data segment from the Eb position onward need to be retained.
After completing the puncturing operation for the original bit segment according to case 3, the remaining data segment is shown in the third table of fig. 5. It can be seen that when Rb =180bit, Sd =10, and after the puncturing operation is performed on the original bit segment, there are 10-bit valid bits and 6-bit invalid bits in Sd.
In one embodiment, the method for reorganizing the remaining valid bits according to the invalid bits after puncturing in the data start position and/or the data end position comprises the following steps, wherein the invalid bits appearing at the Ed position need to be processed because the invalid bits exist in the data at the Ed position and the lower Eb [ n-1:0] bits are invalid bits. Fig. 6 is a schematic diagram of a method for reconstructing remaining data in the puncturing manner in case 1 according to an embodiment of the present invention. The first table in fig. 6 is a data table in which the remaining data segment is divided into lower and upper bits in the puncturing pattern of case 1, and the second table is a data table in which the lower and upper bits are reorganized in the puncturing pattern of case 1.
Will be higher than the Ed position by 2n- Eb[n-1:0]Bits are placed at the low bits of the newly composed data, with a low Eb [ n-1:0] at the Ed +1 position]The bits are placed in the newly composed data high order bits, i.e. the new data segment, and the data at the position Ed is composed of a part of the data at the two positions of the original Ed and Ed +1, respectively. Similarly, the new data segment has the Ed +1 position higher by 2 than the original data segment Ed +1 positionn - Eb[n-1:0]The bit is placed at the lower Eb [ n-1:0] of the new data, lower than the original data segment Ed +2]The bit is placed in the upper component of the new data. And repeating the above arrangement rules to recombine the remaining valid data, so as to obtain a new data segment, which is shown in the second table in fig. 6.
In one embodiment, after the original bit segment is processed in the puncturing manner of case 2, if there is a invalid bit, the invalid bit appears at the end of the data segment, so that the remaining valid data does not need to be reassembled.
In one embodiment, the remaining valid bits are rearranged according to the invalid bits occurring after puncturing in the data start position and/or the data end position, and arranging the invalid bits to the end of the new data segment includes the following steps S510 to S530.
S510: when the bit start position is at the start position of the data start position and the bit end position is at the non-end position of the data end position, replacing the effective bit position at the high position in each data segment after the data end position to the low position of the previous position until replacing the invalid bit after the punching to the end of the new data segment.
S520: when the bit start position is at the non-start position of the data start position and the bit end position is at the end position of the data end position, the effective bit position at the high position in each data segment after the data end position is replaced to the low position of the previous position until the invalid bit appearing after the punching is replaced to the end of the new data segment.
S530: when the bit start position is at the non-start position of the data start position and the bit end position is at the non-end position of the data end position, the effective bit position at the high position in each data segment after the data start position is replaced to the low position of the previous position until the invalid bit appearing after the punching is replaced to the end of the new data segment.
When the bit start position is at the start position of the data start position and the bit end position is at the non-end position of the data end position, that is, when Sb [ n-1:0] is 0 and Eb [ n-1:0] is not 0, the data at the Ed position has a no significant bit and the Sd position has no significant bit, and therefore only the no significant bit appearing at the Ed position needs to be processed.
Data before the Sd position is unchanged, willHeight 2 of Ed positionn- Eb[n-1:0]Bits are placed at the low bits of the newly composed data, with a low Eb [ n-1:0] at the Ed +1 position]The bits are placed in the newly composed data high order bits, i.e. the new data segment, and the data at the position Ed is composed of a part of the data at the two positions of the original Ed and Ed +1, respectively. Similarly, the new data segment has the Ed +1 position higher by 2 than the original data segment Ed +1 positionn - Eb[n-1:0]The bit is placed at the lower Eb [ n-1:0] of the new data, lower than the original data segment Ed +2]The bit is placed in the upper component of the new data. And repeating the above steps to recombine the residual effective data to obtain new data segments.
When the bit start position is at the start position of the data start position and the bit end position is at the non-end position of the data end position, that is, when Sb [ n-1:0] is 0 and Eb [ n-1:0] is not 0, the data at the Ed position has a no significant bit and the Sd position has no significant bit, and therefore only the no significant bit appearing at the Ed position needs to be processed. FIG. 7 is a diagram illustrating a method for reorganizing the lower bits and the upper bits of the significant bits of Kb2 according to an embodiment of the present invention. In the figure, the first table is a data table obtained by dividing the remaining data segment into lower and upper bits in the puncturing pattern of case 3, and the second table is a data table obtained by rearranging the lower and upper bits of the significant bits of Kb2 in the puncturing pattern of case 3.
Data before Sd position is unchanged, and the height of Ed position is increased by 2n- Eb[n-1:0]Bits are placed at the low bits of the newly composed data, with a low Eb [ n-1:0] at the Ed +1 position]The bits are placed in the newly composed data high order bits, i.e. the new data segment, and the data at the position Ed is composed of a part of the data at the two positions of the original Ed and Ed +1, respectively. Similarly, the new data segment has the Ed +1 position higher by 2 than the original data segment Ed +1 positionn - Eb[n-1:0]The bit is placed at the lower Eb [ n-1:0] of the new data, lower than the original data segment Ed +2]The bit is placed in the upper component of the new data. And repeating the above arrangement rules to recombine the remaining valid data, so as to obtain a new data segment, which is shown in the second table in fig. 7.
When the bit start position is at a non-start position of the data start position and the bit end position is at a non-end position of the data end position, that is, when Sb [ n-1:0] is not 0 and Eb [ n-1:0] is 0, there is a no significant bit in the data at the Sd position and no significant bit at the Ed position, and therefore only the no significant bit appearing at the Sd position needs to be processed. FIG. 8 is a diagram illustrating a method for reorganizing the lower bits and the upper bits of the significant bits of Kb1 according to an embodiment of the present invention. The first table in fig. 8 is a table in which the remaining data segment is divided into lower and upper bits in the puncturing pattern of case 3, and the second table in fig. 8 is a table in which the lower and upper bits of the Kb1 valid bit are reorganized in the puncturing pattern of case 3.
For data at Sd position, it is lowered by Sb [ n-1:0]]The bit is placed at the lower level of the new composition data, the lower 2 of the Ed positionn- Sb[n-1:0]The newly composed data with bits placed at the upper bits of the newly composed data, i.e., the Sd position, is composed of a part of the data at two positions of the original Sd and Ed positions, respectively. For data at the Ed location, the high Sb [ n-1:0] at the Ed location is added]With bits placed low, e 2 low at the Ed +1 positionn- Sb[n-1:0]The bits are placed high, constituting the newly composed data at the Ed position. Similarly, the newly composed data at the Ed +1 th position consists of high Sb [ n-1:0] at the Ed +1 th position]With bits placed low, low 2 at the Ed +2 positionn- Sb[n-1:0]The bit is placed at the high position. And (5) according to the arrangement rule, repeating the data of the Ed and the subsequent positions to obtain a new data segment.
When the bit start position is at a non-start position of the data start position and the bit end position is at a non-end position of the data end position, i.e., Eb [ n-1:0] is not 0 and Sb [ n-1:0] is not 0, data at the Ed position has a null bit and data at the Sd position also has a null bit, and therefore, the null bits appearing at both the Ed position and the Sd position need to be processed.
Will be higher than the Ed position by 2n- Eb[n-1:0]Bits are placed at the low bits of the newly composed data, with a low Eb [ n-1:0] at the Ed +1 position]The bits are placed in the newly composed data high order bits, i.e. the new data segment, and the data at the position Ed is composed of a part of the data at the two positions of the original Ed and Ed +1, respectively. Similarly, the new data segment has the Ed +1 position higher by 2 than the original data segment Ed +1 positionn - Eb[n-1:0]The bit is placed at the lower Eb [ n-1:0] of the new data, lower than the original data segment Ed +2]The bit is placed in the upper component of the new data. And (5) according to the arrangement rule, repeating the data of the Ed and the subsequent positions.
Then, the data at the Sd position is at its low Sb [ n-1:0]]The bit is placed low in the new composition data, 2 low at the Ed positionn- Sb[n-1:0]The newly composed data with bits placed at the upper bits of the newly composed data, i.e., the Sd position, is composed of a part of the data at two positions of the original Sd and Ed positions, respectively. For data at the Ed location in the new data segment, then high Sb [ n-1:0] at the Ed location is added]With bits placed low, e 2 low at the Ed +1 positionn- Sb[n-1:0]The bits are placed high, constituting the newly composed data at the Ed position. Similarly, the newly formed data at the Ed +1 th position consists of high Sb [ n-1:0] at the Ed +1 th position]With bits placed low, low 2 at the Ed +2 positionn- Sb[n-1:0]The bit is placed at the high position. And (5) according to the arrangement rule, repeating the data of the Sd and the subsequent positions to obtain a new data segment.
After the new data segment is obtained, the invalid bit in the tail position in the new data segment is replaced by 0, so that invalid bits do not exist in the punched data, and data at other positions in the data stream cannot be changed, which is beneficial to simpler and clearer operation of the system when the data processing at the bit level is carried out.
A computer device comprising a memory and a processor, the memory storing a computer program, wherein the processor when executing the computer program implements the steps of the channel coded data processing method described in any one of the above embodiments.
A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the steps of the channel coded data processing method described in any one of the preceding embodiments.
It will be understood by those skilled in the art that all or part of the processes of the methods of the embodiments described above can be implemented by hardware instructions of a computer program, which can be stored in a non-volatile computer-readable storage medium, and when executed, can include the processes of the embodiments of the methods described above. Any reference to memory, storage, database or other medium used in the embodiments provided herein can include at least one of non-volatile and volatile memory. Non-volatile Memory may include Read-Only Memory (ROM), magnetic tape, floppy disk, flash Memory, optical storage, or the like. Volatile Memory can include Random Access Memory (RAM) or external cache Memory. By way of illustration and not limitation, RAM can take many forms, such as Static Random Access Memory (SRAM) or Dynamic Random Access Memory (DRAM), among others.
In the description herein, references to the description of "some embodiments," "other embodiments," "desired embodiments," etc., mean that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the invention. In this specification, a schematic description of the above terminology may not necessarily refer to the same embodiment or example.
The technical features of the embodiments described above may be arbitrarily combined, and for the sake of brevity, all possible combinations of the technical features in the embodiments described above are not described, but should be considered as being within the scope of the present specification as long as there is no contradiction between the combinations of the technical features.
The above-mentioned embodiments only express several embodiments of the present invention, and the description thereof is more specific and detailed, but not construed as limiting the scope of the invention. It should be noted that, for a person skilled in the art, several variations and modifications can be made without departing from the inventive concept, which falls within the scope of the present invention. Therefore, the protection scope of the present patent shall be subject to the appended claims.
Claims (10)
1. A data processing method in channel coding, applied to a wireless communication system, wherein the wireless communication system has a fixed data bit width when processing signals, the method comprising:
converting the original bit segment of the signal to be processed into an original data segment according to the fixed data bit width;
determining the bit start position and the bit end position of a bit segment needing to be cut in the original bit segment;
converting the bit start position and the bit end position in the original bit segment into a data start position and a data end position in the original data segment;
punching the original bit segment;
recombining the remaining effective bits according to the condition of the invalid bits after punching in the data start position and/or the data end position to obtain a new data segment;
replacing the invalid bit at the end in the new data segment with 0.
2. The method as claimed in claim 1, wherein said converting the original bit segment of the signal to be processed into the original data segment according to the fixed data bit width comprises:
acquiring the length of an original bit segment of the signal to be processed and the bit width of fixed data of a system;
and dividing the original bit segment by taking the fixed data bit width as a unit to obtain the original data segment.
3. The data processing method of claim 1 or 2, wherein the determining the bit start position and the bit end position of the bit segment to be dropped in the original bit segment comprises:
defining the initial position of the original bit segment as the bit starting position, and determining the bit ending position according to the length of the bit segment to be cut; alternatively, the first and second electrodes may be,
defining the end position of the original bit segment as the bit end position, and determining the bit start position according to the length of the bit segment to be cut; alternatively, the first and second electrodes may be,
defining the middle position of the original bit segment as the bit start position, and determining the bit end position according to the length of the bit segment needing to be cut.
4. The data processing method of claim 3, wherein when the starting position of the original bit segment is defined as the bit starting position and the bit ending position is determined according to the length of the bit segment to be punctured, the puncturing process for the original bit segment comprises:
when the bit end position is at the end position of the data end position, puncturing the bit part from the data start position to the data end position;
and when the bit end position is at a position other than the tail end position of the data end position, puncturing a bit part from the data start position to a position before the data end position, and puncturing a bit part which needs to be punctured in the data end position.
5. The data processing method of claim 3, wherein when defining the end position of the original bit segment as the bit end position and determining the bit start position according to the length of the bit segment to be punctured, the puncturing process on the original bit segment comprises:
when the bit start position is at the start position of the data start position, puncturing a bit part from the data start position to the data end position;
when the starting position of the bits is at the non-starting position of the data, puncturing the bit part from the position behind the starting position of the data to the ending position of the data, and puncturing the bit part which needs to be punctured in the starting position of the data.
6. The data processing method of claim 3, wherein when the middle position of the original bit segment is defined as the bit start position and the bit end position is determined according to the length of the bit segment to be punctured, the puncturing process for the original bit segment comprises:
puncturing a bit portion from the data start position to the data end position when the bit start position is at a start position of the data start position and the bit end position is at an end position of the data end position;
when the bit starting position is at the starting position of the data starting position and the bit ending position is at the non-end position of the data ending position, puncturing a bit part from the data starting position to the position before the data ending position, and puncturing a bit part needing to be punctured in the data ending position;
when the bit starting position is at a non-starting position of the data starting position and the bit ending position is at an end position of the data ending position, puncturing a bit part from a position behind the data starting position to the data ending position, and puncturing a bit part which needs to be punctured in the data starting position;
when the bit start position is located at a non-start position of the data start position and the bit end position is located at a non-end position of the data end position, puncturing a bit portion from a position after the data start position to a position before the data end position, and puncturing bit portions which need to be punctured in the data start position and the data end position.
7. The method as claimed in claim 4, wherein the rearranging the remaining valid bits according to the punctured invalid bits in the data start position and/or the data end position, wherein the arranging the invalid bits to the end of the new data segment comprises:
and when the bit starting position is at the non-starting position of the data starting position, replacing the effective bit position at the high position in each data segment after the data ending position to the low position of the previous position until the invalid bit appearing after the punching is replaced to the end of the new data segment.
8. The method as claimed in claim 5, wherein the rearranging the remaining valid bits according to the punctured invalid bits in the data start position and/or the data end position, wherein the arranging the invalid bits to the end of the new data segment comprises:
when the bit starting position is at the starting position of the data starting position and the bit ending position is at the non-end position of the data ending position, replacing the effective bit position at the high position in each data segment after the data ending position to the low position of the previous position until replacing the invalid bit after punching to the end of a new data segment;
when the bit starting position is at the non-starting position of the data starting position and the bit ending position is at the end position of the data ending position, replacing the effective bit position at the high position in each data segment after the data ending position to the low position of the previous position until replacing the invalid bit after punching to the end of a new data segment;
and when the bit starting position is at a non-starting position of the data starting position and the bit ending position is at a non-ending position of the data ending position, replacing the effective bit position at the high position in each data segment after the data starting position with the low position at the previous position until replacing the invalid bit appearing after the punching with the end of a new data segment.
9. A computer device comprising a memory and a processor, the memory storing a computer program, characterized in that the processor, when executing the computer program, implements the steps of the method of any of claims 1 to 8.
10. A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the steps of the method of any one of claims 1 to 8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110358974.7A CN112737736B (en) | 2021-04-02 | 2021-04-02 | Data processing method in channel coding, computer device and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110358974.7A CN112737736B (en) | 2021-04-02 | 2021-04-02 | Data processing method in channel coding, computer device and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112737736A CN112737736A (en) | 2021-04-30 |
| CN112737736B true CN112737736B (en) | 2021-07-09 |
Family
ID=75596336
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110358974.7A Active CN112737736B (en) | 2021-04-02 | 2021-04-02 | Data processing method in channel coding, computer device and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112737736B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114915372B (en) * | 2021-12-07 | 2023-12-22 | 天翼数字生活科技有限公司 | Channel coding method for equipotential width data |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108400838A (en) * | 2017-02-06 | 2018-08-14 | 华为技术有限公司 | Data processing method and equipment |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108696936B (en) * | 2017-04-12 | 2022-11-11 | 华为技术有限公司 | Data sending method, data receiving method and related equipment |
| CN110266448B (en) * | 2017-06-19 | 2020-11-10 | 华为技术有限公司 | Information processing method, communication device and storage medium |
| US10849115B2 (en) * | 2018-09-10 | 2020-11-24 | Apple Inc. | Downlink control channel design in new radio systems |
| CN111478750B (en) * | 2020-03-12 | 2022-10-14 | 普联技术有限公司 | Data parallel interleaving method, terminal equipment and computer storage medium |
-
2021
- 2021-04-02 CN CN202110358974.7A patent/CN112737736B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108400838A (en) * | 2017-02-06 | 2018-08-14 | 华为技术有限公司 | Data processing method and equipment |
Non-Patent Citations (1)
| Title |
|---|
| R1-1704926 "Discussion on coding chain for eMBB data transmission";LG Electronics;《3GPP TSG RAN WG1 Meeting #88bis》;20170324;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112737736A (en) | 2021-04-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| DE60307800T2 (en) | Error detection method in wireless communication systems | |
| CN112737736B (en) | Data processing method in channel coding, computer device and storage medium | |
| WO2019128707A1 (en) | Rate matching and polar code encoding method and device | |
| DE60211536T2 (en) | ENERGY SAVINGS IN COMMUNICATION TERMINALS | |
| CN115549857B (en) | Coding and decoding method, device and storage medium | |
| WO2021042594A1 (en) | Method and apparatus for data caching | |
| CN111181707A (en) | Data transmission method and communication device | |
| CN107277109B (en) | Multi-string matching method for compressed flow | |
| CN113613289B (en) | Bluetooth data transmission method, system and communication equipment | |
| CN116505954B (en) | Huffman coding method, system, device and medium | |
| DE60014367T2 (en) | TIME SLOT DISTRIBUTION IN A TDMA SYSTEM | |
| CN109391347B (en) | Coding and decoding method and device | |
| US11171673B2 (en) | Decoding method and apparatus | |
| CN106027521B (en) | Compression method, decompressing method, compression set and decompression device | |
| CN108880559B (en) | Data compression method, data decompression method, compression equipment and decompression equipment | |
| DE69908820T2 (en) | FAST, MAXIMUM-A-POSTERIORI DECODING METHOD AND SYSTEM | |
| CN110324111B (en) | Decoding method and device | |
| DE102016121567A1 (en) | Convolutional decoding of system information | |
| CN108446319B (en) | Method and system for binary serialization of data | |
| EP1166448B1 (en) | Method for coding channels | |
| CN114499643B (en) | Method and device for allocating equipment resources in satellite ground station and electronic equipment | |
| US20220263626A1 (en) | Method and apparatus for determining position occupied by resource, user equipment, and storage medium | |
| CN112217521B (en) | gZIP-based large file distributed compression method | |
| DE102015115281B4 (en) | Decoder and method for decoding | |
| US20120056763A1 (en) | Systems and methods for data compression |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |