CN114915372A - Channel coding method for equal bit width data - Google Patents
Channel coding method for equal bit width data Download PDFInfo
- Publication number
- CN114915372A CN114915372A CN202111482800.8A CN202111482800A CN114915372A CN 114915372 A CN114915372 A CN 114915372A CN 202111482800 A CN202111482800 A CN 202111482800A CN 114915372 A CN114915372 A CN 114915372A
- Authority
- CN
- China
- Prior art keywords
- data
- last
- equal
- original
- bits
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 28
- 230000005540 biological transmission Effects 0.000 claims abstract description 43
- 230000006798 recombination Effects 0.000 claims abstract description 25
- 238000005215 recombination Methods 0.000 claims abstract description 25
- 230000004044 response Effects 0.000 claims abstract description 5
- 230000001502 supplementing effect Effects 0.000 claims abstract description 5
- 230000000295 complement effect Effects 0.000 claims description 13
- 238000000638 solvent extraction Methods 0.000 claims description 6
- 238000005192 partition Methods 0.000 claims description 4
- 230000008569 process Effects 0.000 description 8
- 238000010586 diagram Methods 0.000 description 5
- 238000004891 communication Methods 0.000 description 3
- 238000012937 correction Methods 0.000 description 3
- 230000009467 reduction Effects 0.000 description 3
- 230000008859 change Effects 0.000 description 2
- 238000011161 development Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 238000012545 processing Methods 0.000 description 2
- 238000003672 processing method Methods 0.000 description 2
- 230000008521 reorganization Effects 0.000 description 2
- 230000004075 alteration Effects 0.000 description 1
- 230000010365 information processing Effects 0.000 description 1
- 230000010354 integration Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
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/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
- H04L1/0009—Systems modifying transmission characteristics according to link quality, e.g. power backoff by adapting the channel coding
Landscapes
- Engineering & Computer Science (AREA)
- Quality & Reliability (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Compression, Expansion, Code Conversion, And Decoders (AREA)
Abstract
The invention provides a channel coding method of equal bit width data, which comprises the following steps: dividing each of a plurality of sets of original equal-length data into a plurality of equal-bit-width data segments based on a given fixed bit width; in response to the valid bit of the last data segment of the plurality of data segments not being full: sequentially numbering a plurality of groups of original isometric data; sequentially carrying out bit complementing on a first data segment of original isometric data with odd serial numbers to a last data segment of original isometric data with even serial numbers so as to carry out first round recombination; sequentially supplementing bits to a plurality of data segments of each group of original equal-length data with odd numbers so as to ensure that the effective bits of the last two data segments in each group of original equal-length data are not full and the bit numbers are the same; sequentially carrying out bit complementing on data segments with the last two unfilled effective bits of original equal-length data with odd numbers in a combined mode so as to carry out second round of recombination; and integrating and cascading the processed new data segments of the multiple groups of original data with equal length to form new data for transmission.
Description
Technical Field
The present invention relates to the field of communications technologies, and in particular, to a channel coding and data processing method for data with equal bit width.
Background
With the development of information technology, especially the rapid development of 5G communication, in order to solve the problem of transmission of data information with equal bit width involved in hardware chip and software information processing in a communication system, a corresponding channel coding scheme and a processing method are required. There are some common channel coding methods such as parity check, concatenated code blocks, etc.
The processing of data by chips such as FPGA (field programmable gate array chip) and DSP (digital signal processing chip) generally has a fixed data bit width, and there is a great challenge in using these systems with fixed data bit width to cascade multiple sets of original data of equal length between code blocks. Especially, under the condition that the bit number of the original data with equal length is not an integer multiple of the fixed data bit width, when each group of original data with equal length is converted into data with fixed data bit width, some invalid bits may exist in the data segment at the tail position of each group of original data with equal length, which makes the invalid bits need to be removed when the concatenation between code blocks is performed, and the removed invalid bits need to be filled by the following valid bits, which becomes very difficult in a complex transmission scene. In addition, when data transmission with equal bit width is performed on original equal-length data, the transmission error correction capability of signals needs to be considered.
Based on this, in order to make the concatenated transmission between code blocks more reliable and easier and improve the quality, anti-interference capability and error correction capability of channel transmission at the same time, it is desirable to provide a channel coding method for bit-width data.
Disclosure of Invention
This summary is provided to introduce a selection of concepts in a simplified form that are further described below in the detailed description. This summary is not intended to identify key features or essential features of the claimed subject matter, nor is it intended to be used as an aid in determining the scope of the claimed subject matter.
The invention considers the problems of transmissibility and transmission quality when the original equal-length data is converted into equal-bit-width data or low-bit-width data for transmission, and achieves the cascade connection among code blocks by establishing a new optimal recombination rule, thereby improving the noise removing capability to cope with a more complex transmission environment.
According to an aspect of the present invention, there is provided a channel coding method for bit-width data, the method including: dividing each of a plurality of sets of original equal-length data into a plurality of equal-bit-width data segments based on a given fixed bit width; in response to the valid bit of the last data segment of the plurality of data segments not being full, performing the following: sequentially numbering the multiple groups of original isometric data; sequentially carrying out bit complementing on a first data segment in a plurality of data segments of original equal-length data with odd numbers to a last data segment in a plurality of data segments of original equal-length data with even numbers in the front to carry out first round of recombination; sequentially supplementing bits to a plurality of data segments of each group of original equal-length data with odd numbers so as to ensure that the effective bits of the last two data segments in each group of original equal-length data are not full and the bit numbers are the same; sequentially carrying out bit complementing on data segments with the last two unfilled effective bits of original equal-length data with odd serial numbers so as to carry out second round recombination; and integrating and cascading the processed new data segments of the multiple groups of original data with equal length to form new data for transmission.
According to an embodiment of the invention, the first round of regrouping further comprises: and placing the data at the high position in the first data segment of the plurality of data segments of the original equal-length data with odd numbers at the corresponding position of the last data segment of the plurality of data segments of the original equal-length data with even numbers to fill the effective bit of the last data segment.
According to a further embodiment of the present invention, the bit-complementing sequentially and jointly the data segments with less than two last significant bits of the original equal-length data with odd-numbered bits further comprises: and when the fixed bit width divides the effective bits of the last two data segments completely, sequentially cascading the data segments with odd numbers and with less than two effective bits of the original equal-length data for transmission.
According to a further embodiment of the present invention, the bit-complementing sequentially and jointly the data segments with less than two last significant bits of the original equal-length data with odd-numbered bits further comprises: and when the fixed bit width cannot divide the effective bits of the last two data segments evenly, if the quotient is 1, filling the bit of the last data segment of the original equal-length data with the odd number to the last-but-one data segment to fill up the effective bit of the last-but-one data segment, sequentially cascading and filling the bit of the last data segment after filling the bit of each group of original equal-length data with the odd number for transmission, if the quotient is more than 1, placing all the data in the last data segment of the original equal-length data with the odd number at the corresponding position of the last-but-one data segment, and sequentially cascading and filling the bit of the last-but-one data segment after filling the bit of each group of original equal-length data with the odd number for transmission.
According to a further embodiment of the present invention, in a case that the number of the plurality of sets of original equal-length data is odd, the last set of even-numbered original equal-length data is directly transmitted without being reassembled.
According to another aspect of the present invention, there is provided a channel coding system for bit-width data, the system comprising: a data partitioning module configured to partition each of a plurality of sets of original equal length data into a plurality of equal bit width data segments based on a given fixed bit width; a data reassembly module configured to: in response to the valid bit of the last data segment of the plurality of data segments not being full, performing the following: sequentially numbering the multiple groups of original isometric data; sequentially carrying out bit complementing on a first data segment in a plurality of data segments of original equal-length data with odd numbers to a last data segment in a plurality of data segments of original equal-length data with even numbers in the front to carry out first round of recombination; sequentially supplementing bits to a plurality of data segments of each group of original equal-length data with odd numbers so as to enable the effective bits of the last two data segments in each group of original equal-length data to be not full and to be the same; sequentially carrying out bit complementing on data segments with the last two unfilled effective bits of original equal-length data with odd numbers in a combined mode so as to carry out second round of recombination; and a data concatenation module configured to integrally concatenate the processed new data segments of the plurality of sets of original equal length data to form new data for transmission.
According to an embodiment of the invention, the first round of regrouping further comprises: and placing the data at the high position in the first data segment of the plurality of data segments of the original equal-length data with odd numbers at the corresponding position of the last data segment of the plurality of data segments of the original equal-length data with even numbers to fill the effective bit of the last data segment.
According to a further embodiment of the present invention, the bit complementing sequentially the data segments with less than two last significant bits of the original equal-length data with odd numbers further comprises: and when the fixed bit width divides the effective bits of the last two data segments completely, sequentially cascading the data segments with odd numbers and with less than two effective bits of the original equal-length data for transmission.
According to a further embodiment of the present invention, the bit-complementing sequentially and jointly the data segments with less than two last significant bits of the original equal-length data with odd-numbered bits further comprises: and when the fixed bit width cannot divide the effective bits of the last two data segments evenly, if the quotient is 1, filling the bit of the last data segment of the original equal-length data with the odd number to the last-but-one data segment to fill up the effective bit of the last-but-one data segment, sequentially cascading and filling the bit of the last data segment after filling the bit of each group of original equal-length data with the odd number for transmission, if the quotient is more than 1, placing all the data in the last data segment of the original equal-length data with the odd number at the corresponding position of the last-but-one data segment, and sequentially cascading and filling the bit of the last-but-one data segment after filling the bit of each group of original equal-length data with the odd number for transmission.
According to a further embodiment of the present invention, in a case that the number of the plurality of sets of original equal-length data is odd, the last set of even-numbered original equal-length data is directly transmitted without being reassembled.
Compared with the scheme in the prior art, the channel coding method of the equal bit-width data provided by the invention at least has the following advantages:
(1) the invention optimizes the recombination mode of the new data segment, and ensures that the recombined new data segment is more reliable and has good code block cascade property by establishing a new recombination rule; and
(2) the original equal-length data is subjected to equal-bit-width division and optimized recombination, so that the transmission quality can be improved, and the more complex transmission environment can be met.
These and other features and advantages will become apparent upon reading the following detailed description and upon reference to the accompanying drawings. It is to be understood that both the foregoing general description and the following detailed description are explanatory only and are not restrictive of aspects as claimed.
Drawings
So that the manner in which the above recited features of the present invention can be understood in detail, a more particular description of the invention, briefly summarized above, may be had by reference to embodiments, some of which are illustrated in the appended drawings. It is to be noted, however, that the appended drawings illustrate only certain typical aspects of this invention and are therefore not to be considered limiting of its scope, for the description may admit to other equally effective aspects.
Fig. 1 shows an exemplary architecture diagram of a channel coding system for equal bit-width data according to one embodiment of the present invention.
Fig. 2 shows a flowchart of a channel coding method for equal bit-width data according to an embodiment of the present invention.
FIG. 3 shows a schematic diagram of raw data partitioning based on bit-width data, according to one embodiment of the invention.
Fig. 4a-4d show schematic diagrams of reorganizing a new data segment, according to an embodiment of the present invention.
Detailed Description
The present invention will be described in detail below with reference to the attached drawings, and the features of the present invention will be further apparent from the following detailed description.
Fig. 1 shows an exemplary architecture diagram of a channel coding system 100 for equal bit-width data according to one embodiment of the present invention. The channel coding system 100 includes at least a data partitioning module 101, a data reassembling module 102, and a data concatenating module 103.
When multi-group original equal-length data is subjected to equal bit width transmission, the original data needs to be divided according to a fixed bit width. Data partitioning module 101 may partition each of the sets of raw equal length data into a plurality of equal bit wide data segments based on a given fixed bit width. In some cases, in the case that the number of bits of the original equal-length data is an integer multiple of the fixed data bit width, the valid bits of the divided last group of data segments are equal to the fixed data bit width (i.e., the valid bits are full), and thus there are no invalid bits. In other cases, where the number of bits of the original equal length data is not an integer multiple of the fixed data bit width, the valid bits of the last group of divided data segments are less than the fixed data bit width (i.e., the valid bits are not full), and thus there are one or more invalid bits. In a preferred embodiment, in the second case (i.e. in case the valid bits of the last group of divided data segments are not full), the data dividing module 101 may complement a parity bit to increase the error correction capability of the channel transmission.
Since there may be some invalid bits in the data segment at the end position of each set of original equal-length data, these invalid bits need to be removed when concatenation between code blocks is performed, and these removed invalid bits must be filled by the following valid bits, which becomes very difficult in a complex transmission scenario, and therefore, these data segments need to be reassembled before concatenation of code blocks. The data reassembly module 102 may number groups of original equal-length data sequentially from 0, perform a first round of reassembly according to the numbered parities of the original equal-length data, and perform a second round of reassembly according to the original equal-length data numbered as odd numbers. In some cases, after sequentially numbering the original equal-length data, the data reassembly module 102 may place the data at the higher order in the first of the divided data segments of the original equal-length data numbered as an odd number in the corresponding position of the last of the divided data segments of the original equal-length data numbered as an even number to fill up the valid bits of the last data segment for the first round of reassembly. When the number of the plurality of sets of original equal-length data is even, all the valid bits of the original equal-length data with even numbers are filled after the first round of reconstruction. In the case where the number of the plurality of sets of original equal-length data is odd, after the first round of reassembly, all the valid bits of the original equal-length data numbered as an even number are padded except for the last original equal-length data. Subsequently, in the process of performing the second round of reassembly, the data reassembly module 102 may sequentially complement each divided data segment of each set of original equal-length data with odd-numbered data groups, so that the valid bits of the last two data segments in each set are not full and equal. Of course, in the case where the original equal-length data is divided into two groups, the bit-padding operation is not required for each group of data. Additionally, in the second round of reassembly, the data reassembly module 102 may perform bit padding on the data segments with less than two last significant bits of the original equal-length data with odd-numbered bits in sequence after each set of odd-numbered data is processed. In some cases, the process of performing bit padding on the last two data segments of the original equal-length data with odd numbers sequentially and jointly includes the following three scenarios: (1) when the given fixed bit width divides the effective bits of the last two data segments, the data segments with odd number and less than two effective bits of the original equal-length data can be sequentially cascaded to complement bits for transmission; (2) when the given fixed bit width cannot divide the valid bits of the last two data segments evenly and the quotient is 1, the last data segment of the original equal-length data with odd number can be complemented to the last-but-one data segment to complement the valid bit of the last-but-one data segment, and the last data segments after the complementation of each group of original equal-length data with odd number are sequentially cascaded to complement the bits for transmission; and (3) when the given fixed bit width cannot divide the effective bits of the last two data segments evenly and the quotient is greater than 1, all data in the last data segment of the original equal-length data with the odd number can be placed at the corresponding position of the penultimate data segment, and the penultimate data segments after the complementary bits of each group of the original equal-length data with the odd number are sequentially cascaded for complementary bits to be transmitted. After two rounds of recombination, invalid bits can be simply removed, thereby achieving good code block concatenation consistency. The data concatenation module 103 may perform an integrated concatenation of the new data segments after two rounds of reassembly to form new data for transmission.
Those skilled in the art will appreciate that the system of the present invention and its various modules may be implemented in either hardware or software, and that the modules may be combined or combined in any suitable manner.
Fig. 2 shows a flow diagram of a method 200 for channel coding of the same bit-width data according to one embodiment of the invention. The method 200 begins at step 201, where the data partitioning module 101 may partition each of a plurality of sets of raw equal length data into a plurality of equal bit wide data segments based on a given fixed bit width. In one example, the original equal length data is 56 bits, the equal bit width data segment is 16 bits or the channel can process a transmission signal of 16 bits (i.e., 16 bits given a fixed bit width). In this example, the original 56-bit data is divided based on 16-bit equal-width data, and the division is schematically shown in fig. 3, and after the division, each original equal-length data segment is divided into 4 data segments, wherein the valid bits of the first 3 data segments are 16 bits (i.e., the valid bits are full) and the valid bits of the last data segment are 8 bits (i.e., the valid bits are not full).
Optionally, in step 202, it is determined whether the valid bit of the last divided group of data segments is equal to the fixed bit width, and if so, no invalid bit exists, and the process may directly proceed to step 206 to sequentially integrate the data segments for cascade transmission.
If the valid bit of the last divided group of data segments is not equal to the fixed bit width, that is, if the valid bit of the last group of data segments is not full, two rounds of reassembly are performed, and in step 203, the data reassembly module 102 may number multiple groups of original data with equal length sequentially from 0. In the above example, the data reorganization module 102 may number the multiple sets of original equal-length data as 0, 1, 2, … …, n-1 in sequence, for example, 4 sets of original equal-length data numbered 0-3 are shown in fig. 3, and the data numbered 1 is divided into data segments 1-1, 1-2, 1-3 and 1-4, wherein the valid bit of the last data segment is not full (8 bits).
In step 204, the data reassembly module 102 may perform a first round of reassembly according to the numbered parities of the original equal-length data. Further, in the first round of reassembly, the data reassembly module 102 may directly map data at a high bit in the first data segment of the odd-numbered original data to a corresponding position of the last data segment of the previous even-numbered original data to fill up the valid bit of the last data segment. In the above example, as shown in fig. 4a, the data at the first 8 bits in the first data segment 1-1 of the original data numbered 1 (odd number) can be directly placed at the first 8 bits in the last data segment 0-4 of the original data numbered 0 (even number) so that the valid bits of all the data segments of the original data numbered 0 are full, and the valid bits of the first two data segments (data segment 2-1 and data segment 2-4) of the original data numbered 1 are not full, as shown in fig. 4 b. In addition, it can be understood that, in the case where the number of the plurality of sets of original equal-length data is an odd number, after the first round of reassembly, the valid bits of the last data segment of the last set of even-numbered original data are not full, and the valid bits of the last data segments of the remaining even-numbered original data are all filled, in this case, for the last set of even-numbered original data, reassembly is not required, and one channel is exclusively occupied for transmission.
In step 205, the data reassembly module 102 may perform a second round of reassembly based on the original equal-length data numbered as odd numbers. Further, in the second round of reassembly, the data reassembly module 102 may sequentially perform bit padding on each divided data segment of each set of odd-numbered original data, so as to make the effective bits of the last two data segments in each set less than full and the effective bit number the same, where the effective bit number is equal to the effective bit number of the last data segment after being divided by the bit width. As shown in fig. 4c, the data segments of the original data with number 1 after the first round of reassembly are sequentially subjected to bit-filling, so that the valid bits of the last two data segments 1-3, 1-4 of the data are not full (both are 8 bits). Subsequently, the data reassembly module 102 may sequentially perform bit padding in association with data segments with less than full last two significant bits of the original data with odd numbers after each group of data with odd numbers is processed. Specifically, when bits are sequentially and jointly complemented, firstly, the fixed bit width of the equal-bit-width channel is recorded as N, the number of valid bits of the divided last group of data segments is recorded as N, the remainder of N/N is recorded as r, and the quotient is recorded as q, and the following two cases can be divided according to whether the remainder r is 0:
(1) when r is 0, i.e. the channel bit width can divide the bit number of the less than full valid data bits, the second round of reassembly rules are: new data segments that are less than an integer (q) times as many valid data bits may be sequentially concatenated to complement the number of bits of the bit-wide channel, and no remainder. In one example, the fixed bit width N is 16, the original data with equal length has 56 bits, the original data with equal length is divided into 4 new data segments after being divided into equal bit widths, the number of bits with less than full significant bits is 8 bits, in this case, r is 0 and q is 2, in this case, when performing sequential joint bit complementing, new data segments with numbers of 1-3, 1-4, 3-3, 3-4, 5-3, 5-4, etc. with only 8 bits as significant bits may be cascaded in sequence to perform transmission of the equal-bit-width channel. As shown in FIG. 4d, 8 bits of 1-4 may be placed in 1-3 such that 1-3 is filled, and 1-4 discarded;
(2) when r! When the channel bit width is 0, that is, the bit number of the less-than-full valid data bits cannot be divided, the following two cases can be divided according to whether the quotient is 1 or not:
(2.1) when q is 1, that is, when a new data segment whose last significant bit numbered odd is not full is padded to a new data segment whose previous significant bit is not full, the previous data segment is just padded and there is a remainder, the second round of reassembly rules is: and after the position of the last new data segment with the odd number is supplemented to the position of the previous data segment, the new data segments are just supplemented, and the last new data segment with the odd number is sequentially cascaded for transmission. In one example, the fixed bit width N is 16, the original data with equal length has 62 bits, the original data with equal length is divided into 4 new data segments after being divided into equal bit widths, the number of bits with less than full valid bits is 14 bits, in this case, r is 2, q is 1, in this case, when performing sequential joint complementary bits, 1-4 with odd number and 14 valid bits is complemented to 1-3, 1-4 with valid bits is left 12 bits, 3-4 with odd number and 3-3 with 3-3 are complemented, 3-4 with valid bits is left 12 bits, and so on, 5-4 is complemented to 5-3, 7-4 is complemented to 7-3, and so on, finally, the valid bits is left to 12 new data segments 1-4 with 12 bits, 3-4, 5-4, 7-4 and the like are cascaded in sequence to carry out transmission of the equal-bit-width channel;
(2.2) when q >1, i.e. a new data segment not full of the last significant bit numbered odd is padded to a new data segment not full of the previous significant bit, the previous data segment is not padded and there is no residue, the second round of reassembly rules is: after the last new data segment with odd number is complemented by the previous data segment, the penultimate new data segment with odd number is cascaded in sequence for transmission. In one example, the fixed bit width N is 16, the original data with equal length has 54 bits, the original data with equal length is divided into 4 new data segments after being divided into data with equal length, the number of bits with less than full valid bits is 6 bits, when r is 4 and q is 2, in this case, when performing sequential joint padding, only the odd-numbered 1-4 with valid bits of 6 bits is padded to 1-3 without padding 1-3, the valid bits of 1-3 are changed into 12 bits, the valid bits of 1-4 are left with 0 bits, similarly, the odd-numbered 3-4 is padded to 3-3 without padding 3-3, the valid bits of 3-3 are changed into 12 bits, the valid bits of 3-4 are left with 0 bits, and so on, the odd-numbered 3-4 is padded to 5-3, the odd-numbered 7-4 is padded to 7-3, and so on, and finally, discarding the new data segments 1-4, 3-4, 5-4, 7-4 and the like with the effective bits only having 0 bit, and sequentially cascading the new data segments 1-3, 3-3, 5-3, 7-3 and the like with the effective bits only having 12 bit to carry out transmission of the equal-bit wide channel.
In other cases, in the case that the number of the original equal-length data is an odd number, the last group of the original equal-length data may not be recombined, but be directly transmitted after the equal-bit-width division.
In step 206, the data concatenation module 103 may perform integration concatenation on each new data segment after reassembly, forming new data for transmission. Simple concatenation is thereby achieved, thereby improving transmission quality to cope with more complex transmission environments.
Because the first round of recombination and the second round of recombination described above are based on sequential forward bit-filling, the recombination rule is simpler, and the data can be restored by a sequential backward pushing method in the restoring process, which is simpler, and the corresponding restoring is also divided into the following 3 cases:
(1) when r is 0, the reduction of the second round of recombination is as follows: and sequentially pushing the last two new data segments with the original serial numbers of odd numbers backwards from the beginning, wherein each data segment only reserves the bit number of the effective data bits after the first round of recombination, and the effective bit numbers of the last two data segments with the original serial numbers of odd numbers are both not full and have the same bit number. In one example, the fixed bit width N is 16, the number of bits of the original equal-length data is 56 bits, the original equal-length data is divided into 4 new data segments after being divided into equal-bit widths, the number of bits whose significant bits are not full is 8 bits, at this time, r is 0, q is 2, in this case, in the restoring process, the new data segments whose original numbers are odd numbers and whose significant bits are full may be sequentially shifted backwards, so that only 8 significant data bits are reserved in the last two data segments whose original numbers are odd numbers;
(2) when r! When q is 0 and q is 1, the reduction of the second round of recombination is divided into the following 2 steps: the method comprises the following steps that 1, the last new data segment with the original serial number of odd numbers is sequentially pushed backwards from the beginning, each data segment only keeps the number of the effective bits left in the second round of recombination after the last data segment is supplemented with the bits of the previous data segment, the second step enables the penultimate data segment with the original serial number of odd numbers to keep the number of the effective bits left in the first round of recombination, and the remaining data bits are pushed towards the last data segment, so that the effective bits of the last two data segments with the original serial numbers of odd numbers are both not full and the number of the effective bits is the same. In one example, the fixed bit width N is 16, the number of bits of the original data with equal length is 62 bits, the original data with equal length is divided into 4 new data segments after being divided into equal bit widths, the number of bits with less than full valid bits is 14 bits, when r is 2, q is 1, in this case, the restoring process is divided into 2 steps: step 1, new data segments with full valid bits, the original serial numbers of which are odd numbers, such as 1-4, 3-4, 5-4, 7-4, and the like, are sequentially pushed backwards, and each data segment only retains 12 valid data bits; step 2, only 14 valid data bits are reserved for 1-3 with full valid bits and odd original numbers, the last 2 valid bits are shifted to 1-4, the valid bits of 1-4 are changed into 14 bits, similarly, only 14 valid data bits are reserved for 3-3, the last 2 valid bits are shifted to 3-4, the valid bits of 3-4 are changed into 14 bits, and so on, only 14 valid data bits are reserved for the last two data segments with odd original numbers;
(3) when r! When q is greater than 1 and 0, the reduction of the second round of the recombination rule is divided into the following 2 steps: and step 1, sequentially pushing the penultimate new data segment with the original number of odd numbers from head to back, wherein each data segment only remains in the 2 nd round of recombination, the bit number of the previous data segment is added after the last data segment is added with the bit number of the previous data segment, and step 2, half of the bit number of the penultimate 2 data segment with the original number of odd numbers is pushed to the last data segment, so that the effective bit numbers of the last two data segments with the original number of odd numbers are both not full and the bit numbers are the same. In one example, the fixed bit width N is 16, the number of bits of the original data with equal length is 54 bits, the original data with equal length is divided into 4 new data segments after being divided into equal bit widths, the number of bits with less than full valid bits is 6 bits, when r is 4, q is 2, in this case, the restoring process is divided into 2 steps: step 1, new data segments with full valid bits and odd original numbers of 1-3, 3-3, 5-3, 7-3 and the like are sequentially pushed backwards, and each data segment only retains 12 valid data bits; step 2, reserving half of data bits, namely 6 valid bits, in the data segments 1-3 with valid bits of only 12 bits, and pushing the last 6 valid bits to 1-4 to change the valid bits of 1-4 into 6 bits, similarly reserving 6 valid data bits in the data segments 3-3, pushing the last 6 valid bits to 3-4 to change the valid bits of 3-4 into 6 bits, and so on until the last two data segments with the original numbers of odd numbers only reserve 6 valid data bits;
in addition, the first round of reorganization is simpler, only the last data segment with the original number of odd numbers needs to be fixed, the effective bits of the previous data segments are sequentially pushed backwards, and the effective bits of each data segment with the original number of odd numbers except the last data segment are supplemented.
The various illustrative blocks and modules described in connection with the disclosure herein may be implemented or performed with a general purpose processor, a DSP, an ASIC, an FPGA or other programmable logic device, discrete gate or transistor logic, discrete hardware components, or any combination thereof designed to perform the functions described herein. A general purpose processor may be a microprocessor, but in the alternative, the processor may be any conventional processor, controller, microcontroller, or state machine. A processor may also be implemented as a combination of computing devices (e.g., a combination of a DSP and a microprocessor, a plurality of microprocessors, one or more microprocessors in conjunction with a DSP core, or any other such configuration).
The functions described herein may be implemented in hardware, software executed by a processor, firmware, or any combination thereof. If implemented in software executed by a processor, the functions may be stored on or transmitted over as one or more instructions or code on a computer-readable medium. Other examples and implementations are within the scope of the disclosure and the following claims. For example, due to the nature of software, the functions described herein may be implemented using software executed by a processor, hardware, firmware, hard-wired, or any combination thereof. Features that implement functions may also be physically located at various locations, including being distributed such that portions of functions are implemented at different physical locations.
What has been described above includes examples of aspects of the claimed subject matter. It is, of course, not possible to describe every conceivable combination of components or methodologies for purposes of describing the claimed subject matter, but one of ordinary skill in the art may recognize that many further combinations and permutations of the claimed subject matter are possible. Accordingly, the disclosed subject matter is intended to embrace all such alterations, modifications and variations that fall within the spirit and scope of the appended claims.
Claims (10)
1. A method for channel coding of data having equal bit widths, the method comprising:
dividing each of a plurality of sets of original equal-length data into a plurality of equal-bit-width data segments based on a given fixed bit width;
in response to the valid bit of the last data segment of the plurality of data segments not being full, performing the following:
sequentially numbering the multiple groups of original isometric data;
sequentially carrying out bit complementing on a first data segment in a plurality of data segments of original equal-length data with odd numbers to a last data segment in a plurality of data segments of original equal-length data with even numbers in the front to carry out first round of recombination;
sequentially supplementing bits to a plurality of data segments of each group of original equal-length data with odd serial numbers so as to ensure that the effective bits of the last two data segments in each group of original equal-length data are not full and the number of bits is the same;
sequentially carrying out bit complementing on data segments with the last two unfilled effective bits of original equal-length data with odd numbers in a combined mode so as to carry out second round of recombination;
and integrating and cascading the processed new data segments of the multiple groups of original data with equal length to form new data for transmission.
2. The method of claim 1, wherein the first round of reassembly further comprises:
and placing the data at the high position in the first data segment of the plurality of data segments of the original equal-length data with odd numbers at the corresponding position of the last data segment of the plurality of data segments of the original equal-length data with even numbers to fill the effective bit of the last data segment.
3. The method of claim 1, wherein sequentially padding data segments not full of the last two significant bits of original equal-length data numbered as odd numbers in combination further comprises:
and when the fixed bit width divides the effective bits of the last two data segments completely, sequentially cascading the data segments with odd numbers and with less than two effective bits of the original equal-length data for transmission.
4. The method of claim 1, wherein sequentially padding data segments not full of the last two significant bits of original equal-length data numbered as odd numbers in combination further comprises:
where the fixed bit width is not able to divide the valid bits of the last two data segments evenly,
if the quotient is 1, the last data segment of the original equal-length data with odd number is complemented to the last-but-one data segment to fill the valid bit of the last-but-one data segment, and the last data segments after the complemented bit of each group of the original equal-length data with odd number are sequentially cascaded to be complemented for transmission,
if the quotient is greater than 1, all data in the last data segment of the original equal-length data with the odd number are placed at the corresponding position of the penultimate data segment, and the penultimate data segments after the complementary bits of each group of the original equal-length data with the odd number are sequentially connected in a cascade manner for complementary bits to be transmitted.
5. The method of claim 1, wherein in case of odd number of said plurality of sets of original equal-length data, the last set of even numbered original equal-length data is transmitted directly without reassembly.
6. A channel coding system for bit-width-equivalent data, the system comprising:
a data partitioning module configured to partition each of a plurality of sets of raw equal length data into a plurality of equal bit wide data segments based on a given fixed bit width;
a data reassembly module configured to: in response to the valid bit of the last data segment of the plurality of data segments not being full, performing the following:
sequentially numbering the multiple groups of original isometric data;
sequentially carrying out bit complementing on a first data segment in a plurality of data segments of original equal-length data with odd numbers to a last data segment in a plurality of data segments of original equal-length data with even numbers in the previous sequence so as to carry out first round recombination;
sequentially supplementing bits to a plurality of data segments of each group of original equal-length data with odd numbers so as to enable the effective bits of the last two data segments in each group of original equal-length data to be not full and to be the same;
sequentially carrying out bit complementing on data segments with the last two unfilled effective bits of original equal-length data with odd serial numbers so as to carry out second round recombination; and
a data concatenation module configured to integrate and concatenate the processed new data segments of the plurality of sets of original equal length data to form new data for transmission.
7. The system of claim 6, wherein the first round of reassembly further comprises:
and placing the data at the high position in the first data segment of the plurality of data segments of the original equal-length data with odd numbers at the corresponding position of the last data segment of the plurality of data segments of the original equal-length data with even numbers to fill the effective bit of the last data segment.
8. The system of claim 6, wherein sequentially padding data segments not full of the last two significant bits of the original equal length data numbered as odd numbers, further comprises:
and when the effective bits of the last two data segments are divided by the fixed bit width, sequentially cascading and complementing the data segments with the odd number and the incomplete last two effective bits of the original equal-length data for transmission.
9. The system of claim 6, wherein sequentially complementing data segments of the original equal-length data numbered as odd numbers with less than two last significant bits further comprises:
where the fixed bit width is not able to divide the valid bits of the last two data segments evenly,
if the quotient is 1, the last data segment of the original equal-length data with odd number is complemented to the last-but-one data segment to fill the valid bit of the last-but-one data segment, and the last data segments after the complemented bit of each group of the original equal-length data with odd number are sequentially cascaded to be complemented for transmission,
if the quotient is greater than 1, all data in the last data segment of the original equal-length data with the odd number are placed at the corresponding position of the penultimate data segment, and the penultimate data segments after the complementary bits of each group of the original equal-length data with the odd number are sequentially connected in a cascade manner for complementary bits to be transmitted.
10. The system of claim 9, wherein in case of odd number of said plurality of sets of original equal length data, the last set of even numbered original equal length data is transmitted directly without re-assembly.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111482800.8A CN114915372B (en) | 2021-12-07 | 2021-12-07 | Channel coding method for equipotential width data |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111482800.8A CN114915372B (en) | 2021-12-07 | 2021-12-07 | Channel coding method for equipotential width data |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114915372A true CN114915372A (en) | 2022-08-16 |
| CN114915372B CN114915372B (en) | 2023-12-22 |
Family
ID=82763249
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111482800.8A Active CN114915372B (en) | 2021-12-07 | 2021-12-07 | Channel coding method for equipotential width data |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114915372B (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070126612A1 (en) * | 2005-12-02 | 2007-06-07 | Viasat, Inc. | Variable length data encapsulation and encoding |
| US20180198554A1 (en) * | 2015-07-17 | 2018-07-12 | Huawei Technologies Co., Ltd. | Data transmission method and apparatus based on unequal error protection and device |
| CN108572787A (en) * | 2017-03-09 | 2018-09-25 | 深圳市中兴微电子技术有限公司 | A kind of method and device that data are stored, read |
| US20190342138A1 (en) * | 2016-11-24 | 2019-11-07 | Technische Universität München | Methods of converting or reconverting a data signal and method and system for data transmission and/or data reception |
| CN112737736A (en) * | 2021-04-02 | 2021-04-30 | 苏州华兴源创科技股份有限公司 | Data processing method in channel coding, computer device and storage medium |
| CN112821987A (en) * | 2021-04-16 | 2021-05-18 | 苏州华兴源创科技股份有限公司 | Data processing method in channel coding, computer device and storage medium |
-
2021
- 2021-12-07 CN CN202111482800.8A patent/CN114915372B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070126612A1 (en) * | 2005-12-02 | 2007-06-07 | Viasat, Inc. | Variable length data encapsulation and encoding |
| US20180198554A1 (en) * | 2015-07-17 | 2018-07-12 | Huawei Technologies Co., Ltd. | Data transmission method and apparatus based on unequal error protection and device |
| US20190342138A1 (en) * | 2016-11-24 | 2019-11-07 | Technische Universität München | Methods of converting or reconverting a data signal and method and system for data transmission and/or data reception |
| CN108572787A (en) * | 2017-03-09 | 2018-09-25 | 深圳市中兴微电子技术有限公司 | A kind of method and device that data are stored, read |
| CN112737736A (en) * | 2021-04-02 | 2021-04-30 | 苏州华兴源创科技股份有限公司 | Data processing method in channel coding, computer device and storage medium |
| CN112821987A (en) * | 2021-04-16 | 2021-05-18 | 苏州华兴源创科技股份有限公司 | Data processing method in channel coding, computer device and storage medium |
Non-Patent Citations (1)
| Title |
|---|
| 裴威 等: "GPU数据库核心技术综述", 软件学报, vol. 32, no. 3 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114915372B (en) | 2023-12-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10491370B2 (en) | Data processing method, data transmit end, and data receive end | |
| KR101354288B1 (en) | Method and apparatus for error detection in a communication system | |
| US4312070A (en) | Digital encoder-decoder | |
| US5483541A (en) | Permuted interleaver | |
| JP3549788B2 (en) | Multi-stage encoding method, multi-stage decoding method, multi-stage encoding device, multi-stage decoding device, and information transmission system using these | |
| CN102130742B (en) | Method and device for encoding and decoding of error correcting codes | |
| EP2974036B1 (en) | Fast cyclic redundancy check computation circuit | |
| EP2051387A1 (en) | Receiver, interleaving and deinterleaving circuit and method | |
| US6049903A (en) | Digital data error detection and correction system | |
| US8555133B2 (en) | Rate matching apparatus and rate matching method thereof | |
| JP3922819B2 (en) | Error correction method and apparatus | |
| US4293951A (en) | Method and apparatus for encoding/decoding a convolutional code to a periodic convolutional code block | |
| JP3358195B2 (en) | Data element interleaving / deinterleaving | |
| JP2000503185A (en) | Data transmission method and apparatus for encoding a signal | |
| US3571795A (en) | Random and burst error-correcting systems utilizing self-orthogonal convolution codes | |
| EP1610467A1 (en) | Efficient address generation for Forney's modular periodic interleavers | |
| CN114915372A (en) | Channel coding method for equal bit width data | |
| US5933431A (en) | Frame-based modulus interleaver | |
| US20050138525A1 (en) | System and method for forward error correction | |
| US5280484A (en) | Time-division multiplex communication system with a synchronizing circuit at the receiving end which responds to the coding of words inserted in the transmitted information | |
| US9000959B2 (en) | Turbo encoder apparatus | |
| JP3173713B2 (en) | Error correction encoding method and transmission / reception device | |
| JP2555213B2 (en) | Time division multiplex communication system having a receiving end synchronization circuit responsive to encoding of a word inserted in transmission information | |
| US7746944B2 (en) | Electronic transmitter/receiver | |
| CN113949487B (en) | Data communication method, device, communication terminal and computer readable storage medium |
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 |