CN114268415B - Data encoding method and device, electronic equipment and storage medium - Google Patents
Data encoding method and device, electronic equipment and storage medium Download PDFInfo
- Publication number
- CN114268415B CN114268415B CN202111634761.9A CN202111634761A CN114268415B CN 114268415 B CN114268415 B CN 114268415B CN 202111634761 A CN202111634761 A CN 202111634761A CN 114268415 B CN114268415 B CN 114268415B
- Authority
- CN
- China
- Prior art keywords
- block
- data
- coding
- bit
- blocks
- 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
- 238000000034 method Methods 0.000 title claims abstract description 39
- 238000013507 mapping Methods 0.000 claims description 21
- 230000006870 function Effects 0.000 claims description 9
- 230000005540 biological transmission Effects 0.000 claims description 8
- 230000001502 supplementing effect Effects 0.000 claims description 3
- 238000005562 fading Methods 0.000 abstract description 11
- 230000006854 communication Effects 0.000 description 4
- 238000010586 diagram Methods 0.000 description 4
- 230000010363 phase shift Effects 0.000 description 4
- 238000004891 communication Methods 0.000 description 3
- 238000012545 processing Methods 0.000 description 3
- 238000004088 simulation Methods 0.000 description 3
- 230000000903 blocking effect Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
- 230000000750 progressive effect Effects 0.000 description 1
Landscapes
- Error Detection And Correction (AREA)
- Detection And Prevention Of Errors In Transmission (AREA)
Abstract
The invention discloses a data coding method, a device, an electronic device and a storage medium, wherein data are divided into data blocks with equal length to ensure that the performances among the data blocks are equal, the coding length of each data block and the occupied bit number of each coding block in each burst are determined based on the bearing condition of a physical channel, each data block is coded to obtain corresponding coding blocks, the bit stream of each coding block is uniformly interleaved to resist burst interference and fading influence among the bursts, the bit stream of each first interleaving block is divided according to the determined occupied bit number to obtain bit blocks, the bit blocks with the same module P remainder are cascaded to obtain bit cascade blocks, and the bit cascade blocks are sequentially and uniformly mapped into the bursts to ensure that each coding block is uniformly distributed in each burst and the code rate of each coding block is approximately the same, so that the performances among the coding blocks are ensured to be equal, and the overall performance of a system is ensured.
Description
Technical Field
The present invention relates to the field of data processing technologies, and in particular, to a data encoding method, apparatus, electronic device, and storage medium.
Background
In existing communication protocols (e.g., 4G, 5G), data needs to be encoded prior to transmission. The existing data transmission flow is generally as follows: according to the characteristics of the encoder, performing block processing on the data to form a data block; and encoding each data block to obtain an encoding block, and performing rate matching and interleaving on the encoding block. The bits of the code block are dispersed into each burst (burst) through interleaving, so that the influence of frequency domain fading and time fading can be well resisted.
In the prior art, null bits are filled in the interleaving process, and the null bits are deleted after interleaving is completed, so that bits of the coding blocks cannot be uniformly distributed in a burst, that is, the bits corresponding to each coding block are centrally placed. Since strong electronic countermeasure, such as blocking interference, is often present in the data communication process, when some bursts are interfered, the channel is deleted, so that the bit performance of continuous transmission is greatly affected, the performance difference among coding blocks is great, and the overall performance of the system is reduced.
Disclosure of Invention
In view of the above, the present invention discloses a data encoding method, apparatus, electronic device and storage medium, so as to solve the problem in the prior art that the performance difference between the encoding blocks is very large, and thus the overall performance of the system is reduced.
A data encoding method, comprising:
dividing data into N data blocks with equal length, wherein N is a positive integer;
determining the coding length of each data block and the occupied bit number of the coding block corresponding to each data block in each burst based on the bearing condition of a physical channel;
Coding each data block according to the coding length to obtain a corresponding coding block;
Uniformly interleaving the bit stream of each coding block for the first time to obtain a first interleaving block;
dividing the bit stream of each first interleaving block according to the determined occupied bit number to obtain P bit blocks, wherein P is a positive integer;
cascading the bit blocks with the same P remainder in the N-P bit blocks to obtain P bit cascading blocks;
And mapping each bit cascade block into bursts sequentially and uniformly to finish data coding.
Optionally, determining the coding length of each data block based on the bearer condition of the physical channel includes:
Obtaining the total bearing capacity of the physical channel according to the modulation order and the number of transmission symbols;
and obtaining the coding length of each data block according to the total bearing capacity and the total number N of the data blocks, wherein the expression of the coding length is as follows:
L＝floor(T_L/N)；
wherein L is the coding length, T_L is the total bearing capacity, and floor is a downward rounding function.
Optionally, when there are redundant bits after the total bearing capacity is evenly distributed to N data blocks, the method further includes:
and supplementing the redundant bit T_L-floor (T_L/N) to the previous L-floor (T_L/N) by N data blocks.
Optionally, based on the bearing condition of the physical channel, determining the number of occupied bits of the coding block corresponding to each data block in each burst includes:
Determining the number of occupied bits according to the following formula:
M＝floor(L/burst_num)；
wherein M is the number of occupied bits, L is the coding length, and burst_num is the number of bursts.
Optionally, when there are spare bits after the coding length is equally allocated to each burst, the method further includes:
and supplementing the redundant bit L-floor (L/burst_num) to a previous L-floor (L/burst_num) data block, wherein floor is a downward rounding function.
Optionally, the mapping sequentially and uniformly into bursts, completing data encoding, includes:
Performing second uniform interleaving on each bit cascade block to obtain a second interleaving block;
and mapping each second interleaving block into bursts sequentially and uniformly to finish data coding.
A data encoding apparatus comprising:
The dividing unit is used for dividing the data into N data blocks with equal length, wherein N is a positive integer;
The determining unit is used for determining the coding length of each data block and the occupied bit number of the corresponding coding block in each burst based on the bearing condition of the physical channel;
the coding unit is used for coding each data block according to the coding length to obtain a corresponding coding block;
a first interleaving unit, configured to uniformly interleave the bit stream of each coding block for the first time, to obtain a first interleaving block;
The dividing unit is used for dividing the bit stream of each first interleaving block according to the determined occupied bit number to obtain P bit blocks, N x P bit blocks are obtained in total, and P is a positive integer;
the cascade unit is used for cascading bit blocks with the same P remainder in the N-P bit blocks to obtain P bit cascade blocks;
And the mapping unit is used for sequentially and uniformly mapping each bit cascade block into a burst to finish data coding.
Optionally, the mapping unit is specifically configured to:
Performing second uniform interleaving on each bit cascade block to obtain a second interleaving block;
and mapping each second interleaving block into bursts sequentially and uniformly to finish data coding.
An electronic device comprising a memory and a processor;
the memory is used for storing at least one instruction;
The processor is configured to execute the at least one instruction to implement the data encoding method as described above.
A computer readable storage medium storing at least one instruction that when executed by a processor implements a data encoding method as described above.
As can be seen from the above technical solution, the present invention discloses a data encoding method, apparatus, electronic device and storage medium, wherein data are divided into data blocks with equal length, based on the bearing condition of a physical channel, the encoding length of each data block and the number of occupied bits of the encoding block corresponding to each data block in each burst are determined, each data block is encoded according to the encoding length to obtain a corresponding encoding block, the bit stream of each encoding block is uniformly interleaved for the first time to obtain a first interleaved block, the bit stream of each first interleaved block is divided according to the determined number of occupied bits to obtain bit blocks, the bit blocks with the same modulo P remainder are cascaded to obtain bit cascade blocks, and each bit cascade block is sequentially and uniformly mapped to the data blocks with equal length to complete data encoding in bursts; the bit stream of each coding block is uniformly interleaved to resist burst interference and fading influence among bursts, and each bit cascade block is mapped into the bursts sequentially and uniformly to ensure that each coding block is uniformly distributed in each burst, and the code rates of each coding block are approximately the same, so that the performance equality among the coding blocks is further ensured, and the overall performance of the system is ensured.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings that are required in the embodiments or the description of the prior art will be briefly described, and it is obvious that the drawings in the following description are only embodiments of the present invention, and that other drawings can be obtained according to the disclosed drawings without inventive effort for a person skilled in the art.
FIG. 1 is a flow chart of a data encoding method according to an embodiment of the present invention;
fig. 2 is a flowchart of a method for determining a coding length of each data block based on a bearer situation of a physical channel according to an embodiment of the present invention;
Fig. 3 is a flowchart of data encoding performed by a transmitting/receiving device according to an embodiment of the present invention;
FIG. 4 is a schematic diagram of a comparison graph of 2Mbps rate anti-interference performance of the optimized interleaving scheme disclosed in the embodiment of the present invention and a conventional interleaving scheme;
Fig. 5 is a schematic structural diagram of a data encoding device according to an embodiment of the present invention;
Fig. 6 is a schematic structural diagram of an electronic device according to an embodiment of the present invention.
Detailed Description
The following description of the embodiments of the present invention will be made clearly and completely with reference to the accompanying drawings, in which it is apparent that the embodiments described are only some embodiments of the present invention, but not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
The embodiment of the invention discloses a data coding method, a device, electronic equipment and a storage medium, wherein data are divided into data blocks with equal length, the coding length of each data block and the occupied bit number of the coding block corresponding to each data block in each burst are determined based on the bearing condition of a physical channel, each data block is coded according to the coding length to obtain the corresponding coding block, the bit stream of each coding block is uniformly interleaved for the first time to obtain a first interleaving block, the bit stream of each first interleaving block is divided according to the determined occupied bit number to obtain bit blocks, bit blocks with the same residue of a module P are cascaded to obtain bit cascade blocks, and each bit cascade block is mapped into the bursts sequentially and uniformly to finish data coding; the bit stream of each coding block is uniformly interleaved to resist burst interference and fading influence among bursts, and each bit cascade block is mapped into the bursts sequentially and uniformly to ensure that each coding block is uniformly distributed in each burst, and the code rates of each coding block are approximately the same, so that the performance equality among the coding blocks is further ensured, and the overall performance of the system is ensured.
Referring to fig. 1, a flowchart of a data encoding method disclosed in an embodiment of the present invention includes:
Step S101, dividing data into N data blocks with equal length;
In practical application, the data can be partitioned according to the characteristics of the encoder, and the data is divided into N data blocks with equal length, wherein N is a positive integer.
The characteristics of the encoder, such as the resolution of the encoder, the type of encoder, etc., are specifically determined according to the actual needs, and the present invention is not limited herein.
The invention can ensure the equal performance among the data blocks by dividing the data into N data blocks with equal length.
Step S102, based on the bearing condition of a physical channel, determining the coding length of each data block and the occupied bit number of the corresponding coding block in each burst;
in practical application, when determining the number of occupied bits of a coding block corresponding to each data block in each burst, it is necessary to ensure that the number of occupied bits M of each coding block in each burst (burst) is as uniform as possible.
Step S103, coding each data block according to the coding length to obtain a corresponding coding block;
After determining the coding length L of each data block TB, each data block TB may be coded to obtain a corresponding coding block cb_i, i representing a coding block sequence number, i=1, …, N, where the bit stream length of each coding block is L.
Step S104, carrying out first uniform interleaving on the bit stream of each coding block to obtain a first interleaving block;
In the invention, each coding block is uniformly distributed into each burst by uniformly interleaving the bit stream of each coding block, and the duty ratio of each coding block in the corresponding burst is the same.
The embodiment can resist burst interference and fading influence among burstiness by uniformly interleaving each coding block.
Preferably, the first uniform interleaving may be a row-in-row-out interleaving, QPP interleaving, or the like, which is specifically determined according to actual needs, and the present invention is not limited herein.
Step 105, dividing the bit stream of each first interleaving block according to the determined occupied bit number to obtain P bit blocks, and obtaining n×p bit blocks in total;
Wherein P is a positive integer.
Let the bit stream of each first interleaved Block be split to obtain P bit blocks block_i_p, i being the coding Block sequence number, P being the burst sequence number.
Block_i_p＝I_i((p-1)*M+1:(p-1)*M+M)；
Where i_i represents the first interleaved block and M represents the number of occupied bits.
Step S106, cascading the bit blocks with the same P remainder in the N-P bit blocks to obtain P bit cascading blocks;
Assuming that the bit concatenation Block is burst_p, the bit concatenation Block burst_p= [ block_1_p, block_2_p … block_n_p ], p e1, p.
And step S107, mapping each bit cascade block into bursts sequentially and uniformly to finish data coding.
In summary, the invention discloses a data coding method, which divides data into data blocks with equal length, determines the coding length of each data block and the occupied bit number of the coding block corresponding to each data block in each burst based on the bearing condition of a physical channel, codes each data block according to the coding length to obtain the corresponding coding block, uniformly interleaves the bit stream of each coding block for the first time to obtain a first interleaving block, divides the bit stream of each first interleaving block according to the determined occupied bit number to obtain bit blocks, cascades the bit blocks with the same modulo P remainder to obtain bit cascade blocks, and sequentially and uniformly maps each bit cascade block to the burst to finish data coding; the bit stream of each coding block is uniformly interleaved to resist burst interference and fading influence among bursts, and each bit cascade block is mapped into the bursts sequentially and uniformly to ensure that each coding block is uniformly distributed in each burst, and the code rates of each coding block are approximately the same, so that the performance equality among the coding blocks is further ensured, and the overall performance of the system is ensured.
To further optimize the foregoing embodiments, referring to fig. 2, a method flowchart for determining a coding length of each data block based on a bearer situation of a physical channel according to an embodiment of the present invention is disclosed, where the method includes:
step S201, obtaining the total bearing capacity of a physical channel according to the modulation order and the number of transmission symbols;
step S202, obtaining the coding length of each data block according to the total bearing capacity and the total number N of the data blocks.
In this embodiment, the expression of the encoding length is as follows:
L＝floor(T_L/N)；
wherein L is the coding length, T_L is the total bearing capacity, and floor is a downward rounding function.
It will be appreciated that the total load of the physical channel may not be all equally allocated to each data block, and there may be spare bits after the total load is equally allocated to N data blocks, in which case the above embodiment may further include:
the redundant bit T_L-floor (T_L/N) is supplied to the previous L-floor (T_L/N) N data blocks.
In the above embodiment, based on the bearing condition of the physical channel, the process of determining the number of occupied bits of the coding block corresponding to each data block in each burst includes:
determining the number of occupied bits in each burst for each coded block according to the following formula:
M＝floor(L/burst_num)；
Where M is the number of occupied bits in each burst per coded block, L is the coding length, and burst_num is the number of bursts.
It will be appreciated that there may be extra bits after the coding length is equally allocated to each burst, in which case it may also include:
The extra bit L-floor (L/burst_num) is appended to the previous L-floor (L/burst_num) data block, where floor is a downward rounding function.
To further optimize the above embodiment, step S107 may specifically include:
Uniformly interleaving each bit cascade block for the second time to obtain a second interleaving block;
and mapping each second interleaving block into bursts sequentially and uniformly to finish data coding.
In practical applications, the second uniform interleaving may be a line-in list or QPP interleaving, which is specific to practical needs, and the present invention is not limited herein.
In this embodiment, after modulating each second interleaving block, the second interleaving blocks may be mapped sequentially and uniformly into bursts, so as to complete data encoding.
The modulation may be performed by a modulation scheme such as QPSK (Quadrature PHASE SHIFT KEYING) or PSK (PHASE SHIFT KEYING).
In summary, the invention can effectively resist burst interference and fading influence in burst by cascading bit blocks and uniformly interleaving again after cascading. By ensuring equal performance between the encoded blocks, overall system performance is ensured, thereby providing higher transmission rates.
In order to illustrate the design concept of the present invention, taking the number of data blocks 2 and the number of bursts 2 as an example, referring to fig. 3, the illustrated flow chart of the transmitting/receiving device disclosed in the embodiment of the present invention divides data into the data block 1 and the data block 2, encodes the data block 1 and the data block 2 to obtain the encoded block 1 and the encoded block 2, uniformly interleaves the bit streams of the encoded block 1 and the encoded block 2 for the first time to obtain the first interleaving block 1, divides the two first interleaving blocks 1 to obtain the bit blocks (1, 1), the bit blocks (1, 2), the bit blocks (2, 1) and the bit blocks (2, 2), concatenates the bit blocks (1, 1) and the bit blocks (2, 1) to obtain the bit concatenation block 1, and concatenates the bit blocks (1, 2) and the bit blocks (2, 2) to obtain the bit concatenation block 2. And performing second uniform interleaving on the bit cascade block 1 to obtain a second interleaving block 1, and performing second uniform interleaving on the bit cascade block 2 to obtain a second interleaving block 2. The second interleaving block 1 is modulated and mapped into bursts to form burst1 data, and the second interleaving block 2 is modulated and mapped into bursts to form burst2 data.
In order to further prove that compared with the traditional scheme, the data coding method disclosed by the invention can ensure the equal performance among coding blocks, the interleaving method in the data coding process disclosed by the invention and the traditional interleaving method are subjected to comparison simulation, and the simulation comparison result is as follows:
1) And when no interference exists, the performance of the two algorithms is equivalent under different code rates.
2) When one burst is interfered, the BLER performance of the optimized interleaving algorithm disclosed by the invention is improved by about 3dB at the code rate of 0.8, and the BLER of the original interleaving algorithm can not be converged at the code rate of 0.9, so that the BLER can still be reduced to be below E-3 after the interleaving algorithm is optimized.
3) When 2 bursts are interfered, the original interleaving algorithm BLER can not be converged at the code rate of 0.8, and the interleaving algorithm can still reduce the BLER to be below E-3 after optimization.
4) The performance versus curves of the scheme and the comparison scheme are shown as a 2Mbps rate anti-interference performance versus curve in fig. 4, wherein the abscissa is the SNR (Signal-to-Noise Ratio), the unit dB, and the ordinate is the block error rate.
As can be seen from the simulation result shown in FIG. 4, the anti-interference performance of the high-code rate service of the optimized interleaving scheme disclosed by the invention is greatly improved compared with that of the original scheme, and the coding and decoding performance of the interleaving scheme in the invention is obviously improved no matter whether interference exists.
Corresponding to the embodiment of the method, the invention also discloses a data encoding device.
Referring to fig. 5, a schematic structural diagram of a data encoding apparatus according to an embodiment of the present invention is disclosed, where the apparatus includes:
A dividing unit 301, configured to divide data into N data blocks with equal lengths, where N is a positive integer;
In practical application, the data can be partitioned according to the characteristics of the encoder, and the data is divided into N data blocks with equal length, wherein N is a positive integer.
The characteristics of the encoder, such as the resolution of the encoder, the type of encoder, etc., are specifically determined according to the actual needs, and the present invention is not limited herein.
The invention can ensure the equal performance among the data blocks by dividing the data into N data blocks with equal length.
A determining unit 302, configured to determine, based on a bearer situation of a physical channel, a coding length of each data block and a number of occupied bits of a coding block corresponding to each data block in each burst;
in practical application, when determining the number of occupied bits of a coding block corresponding to each data block in each burst, it is necessary to ensure that the number of occupied bits M of each coding block in each burst (burst) is as uniform as possible.
A coding unit 303, configured to code each data block according to the coding length, so as to obtain a corresponding coding block;
After determining the coding length L of each data block TB, each data block TB may be coded to obtain a corresponding coding block cb_i, i representing a coding block sequence number, i=1, …, N, where the bit stream length of each coding block is L.
A first interleaving unit 304, configured to uniformly interleave the bit stream of each coding block for the first time, to obtain a first interleaved block;
In the invention, each coding block is uniformly distributed into each burst by uniformly interleaving the bit stream of each coding block, and the duty ratio of each coding block in the corresponding burst is the same.
The embodiment can resist burst interference and fading influence among burstiness by uniformly interleaving each coding block.
Preferably, the first uniform interleaving may be a row-in-row-out interleaving, QPP interleaving, or the like, which is specifically determined according to actual needs, and the present invention is not limited herein.
A dividing unit 305, configured to divide the bit stream of each first interleaved block according to the determined number of occupied bits to obtain P bit blocks, and obtain n×p bit blocks in total, where P is a positive integer;
let the bit stream of each first interleaved Block be split to obtain P bit blocks block_i_p, i being the coding Block sequence number, P being the burst sequence number.
Block_i_p＝I_i((p-1)*M+1:(p-1)*M+M)；
Where i_i represents the first interleaved block and M represents the number of occupied bits.
A concatenation unit 306, configured to concatenate bit blocks with the same P remainder in the n×p bit blocks to obtain P bit concatenated blocks;
Assuming that the bit concatenation Block is burst_p, the bit concatenation Block burst_p= [ block_1_p, block_2_p … block_n_p ], p e1, p.
And the mapping unit 307 is configured to sequentially and uniformly map each of the bit concatenation blocks into a burst, thereby completing data encoding.
In summary, the invention discloses a data coding device, which divides data into data blocks with equal length, determines the coding length of each data block and the occupied bit number of the coding block corresponding to each data block in each burst based on the bearing condition of a physical channel, codes each data block according to the coding length to obtain the corresponding coding block, uniformly interleaves the bit stream of each coding block for the first time to obtain a first interleaving block, divides the bit stream of each first interleaving block according to the determined occupied bit number to obtain bit blocks, cascades the bit blocks with the same modulo P remainder to obtain bit cascade blocks, and sequentially and uniformly maps each bit cascade block to the burst to finish data coding; the bit stream of each coding block is uniformly interleaved to resist burst interference and fading influence among bursts, and each bit cascade block is mapped into the bursts sequentially and uniformly to ensure that each coding block is uniformly distributed in each burst, and the code rates of each coding block are approximately the same, so that the performance equality among the coding blocks is further ensured, and the overall performance of the system is ensured.
In order to further optimize the above-described embodiments,
The mapping unit 307 is specifically configured to:
Uniformly interleaving each bit cascade block for the second time to obtain a second interleaving block;
and mapping each second interleaving block into bursts sequentially and uniformly to finish data coding.
In practical applications, the second uniform interleaving may be a line-in list or QPP interleaving, which is specific to practical needs, and the present invention is not limited herein.
In this embodiment, after modulating each second interleaving block, the second interleaving blocks may be mapped sequentially and uniformly into bursts, so as to complete data encoding.
The modulation may be performed by a modulation scheme such as QPSK (Quadrature PHASE SHIFT KEYING) or PSK (PHASE SHIFT KEYING).
In summary, the invention can effectively resist burst interference and fading influence in burst by cascading bit blocks and uniformly interleaving again after cascading. By ensuring equal performance between the encoded blocks, overall system performance is ensured, thereby providing higher transmission rates.
The specific operation principle of each component in the embodiment of the device should be specifically described, please refer to the corresponding portion of the method embodiment, and the detailed description is omitted herein.
Corresponding to the above embodiment, as shown in fig. 6, the present invention further provides an electronic device, which may include: a processor 1 and a memory 2;
Wherein the processor 1 and the memory 2 complete communication with each other through the communication bus 3;
a processor 1 for executing at least one instruction;
a memory 2 for storing at least one instruction;
the processor 1 may be a central processing unit CPU, or an Application-specific integrated Circuit ASIC (Application SPECIFIC INTEGRATED Circuit), or one or more integrated circuits configured to implement embodiments of the present invention.
The memory 2 may comprise a high-speed RAM memory or may further comprise a non-volatile memory (non-volatile memory), such as at least one disk memory.
Wherein execution of at least one instruction by the processor performs the following functions:
dividing data into N data blocks with equal length, wherein N is a positive integer;
determining the coding length of each data block and the occupied bit number of the coding block corresponding to each data block in each burst based on the bearing condition of a physical channel;
Coding each data block according to the coding length to obtain a corresponding coding block;
Uniformly interleaving the bit stream of each coding block for the first time to obtain a first interleaving block;
dividing the bit stream of each first interleaving block according to the determined occupied bit number to obtain P bit blocks, wherein P is a positive integer;
cascading the bit blocks with the same P remainder in the N-P bit blocks to obtain P bit cascading blocks;
And mapping each bit cascade block into bursts sequentially and uniformly to finish data coding.
The invention also discloses a computer readable storage medium, which is characterized in that the computer readable storage medium stores at least one instruction, and the at least one instruction realizes the following functions when being executed by a processor:
dividing data into N data blocks with equal length, wherein N is a positive integer;
determining the coding length of each data block and the occupied bit number of the coding block corresponding to each data block in each burst based on the bearing condition of a physical channel;
Coding each data block according to the coding length to obtain a corresponding coding block;
Uniformly interleaving the bit stream of each coding block for the first time to obtain a first interleaving block;
dividing the bit stream of each first interleaving block according to the determined occupied bit number to obtain P bit blocks, wherein P is a positive integer;
cascading the bit blocks with the same P remainder in the N-P bit blocks to obtain P bit cascading blocks;
And mapping each bit cascade block into bursts sequentially and uniformly to finish data coding.
Finally, it is further noted that relational terms such as first and second, and the like are used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Moreover, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising one … …" does not exclude the presence of other like elements in a process, method, article, or apparatus that comprises the element.
In the present specification, each embodiment is described in a progressive manner, and each embodiment is mainly described in a different point from other embodiments, and identical and similar parts between the embodiments are all enough to refer to each other.
The previous description of the disclosed embodiments is provided to enable any person skilled in the art to make or use the present invention. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other embodiments without departing from the spirit or scope of the invention. Thus, the present invention is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.
Claims (8)
1. A method of encoding data, comprising:
dividing data into N data blocks with equal length, wherein N is a positive integer;
determining the coding length of each data block and the occupied bit number of the coding block corresponding to each data block in each burst based on the bearing condition of a physical channel;
Coding each data block according to the coding length to obtain a corresponding coding block;
Uniformly interleaving the bit stream of each coding block for the first time to obtain a first interleaving block;
dividing the bit stream of each first interleaving block according to the determined occupied bit number to obtain P bit blocks, wherein P is a positive integer;
cascading the bit blocks with the same P remainder in the N-P bit blocks to obtain P bit cascading blocks;
Mapping each bit cascade block into bursts sequentially and uniformly to finish data coding;
based on the bearing condition of the physical channel, determining the number of occupied bits of the coding block corresponding to each data block in each burst includes:
Determining the number of occupied bits according to the following formula:
M＝floor(L/burst_num)；
Wherein M is the number of occupied bits, L is the coding length, burst_num is the number of bursts;
And when the coding length is evenly distributed to each burst and redundant bits exist, the redundant bits L-floor (L/burst_num) are fed to a front L-floor (L/burst_num) data block, wherein floor is a downward rounding function.
2. The data encoding method of claim 1, wherein determining the encoding length of each of the data blocks based on the bearer situation of the physical channel comprises:
Obtaining the total bearing capacity of the physical channel according to the modulation order and the number of transmission symbols;
and obtaining the coding length of each data block according to the total bearing capacity and the total number N of the data blocks, wherein the expression of the coding length is as follows:
L＝floor(T_L/N)；
wherein L is the coding length, T_L is the total bearing capacity, and floor is a downward rounding function.
3. The data encoding method according to claim 2, wherein; when there are redundant bits after the total bearing capacity is equally distributed to N data blocks, the method further includes:
and supplementing the redundant bit T_L-floor (T_L/N) to the previous L-floor (T_L/N) by N data blocks.
4. The data encoding method according to claim 1, wherein the sequential and uniform mapping into bursts, completing the data encoding, comprises:
Performing second uniform interleaving on each bit cascade block to obtain a second interleaving block;
and mapping each second interleaving block into bursts sequentially and uniformly to finish data coding.
5. A data encoding apparatus, comprising:
The dividing unit is used for dividing the data into N data blocks with equal length, wherein N is a positive integer;
The determining unit is used for determining the coding length of each data block and the occupied bit number of the corresponding coding block in each burst based on the bearing condition of the physical channel;
the coding unit is used for coding each data block according to the coding length to obtain a corresponding coding block;
a first interleaving unit, configured to uniformly interleave the bit stream of each coding block for the first time, to obtain a first interleaving block;
The dividing unit is used for dividing the bit stream of each first interleaving block according to the determined occupied bit number to obtain P bit blocks, N x P bit blocks are obtained in total, and P is a positive integer;
the cascade unit is used for cascading bit blocks with the same P remainder in the N-P bit blocks to obtain P bit cascade blocks;
The mapping unit is used for sequentially and uniformly mapping each bit cascade block into a burst to finish data coding;
the determining unit determines the number of occupied bits of the coding block corresponding to each data block in each burst based on the bearing condition of the physical channel, including:
Determining the number of occupied bits according to the following formula:
M＝floor(L/burst_num)；
Wherein M is the number of occupied bits, L is the coding length, burst_num is the number of bursts;
And when the coding length is evenly distributed to each burst and redundant bits exist, the redundant bits L-floor (L/burst_num) are fed to a front L-floor (L/burst_num) data block, wherein floor is a downward rounding function.
6. The data encoding device according to claim 5, wherein the mapping unit is specifically configured to:
Performing second uniform interleaving on each bit cascade block to obtain a second interleaving block;
and mapping each second interleaving block into bursts sequentially and uniformly to finish data coding.
7. An electronic device comprising a memory and a processor;
the memory is used for storing at least one instruction;
The processor is configured to execute the at least one instruction to implement the data encoding method according to any one of claims 1 to 4.
8. A computer readable storage medium storing at least one instruction which when executed by a processor implements a data encoding method according to any one of claims 1 to 4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111634761.9A CN114268415B (en) | 2021-12-29 | 2021-12-29 | Data encoding method and device, electronic equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111634761.9A CN114268415B (en) | 2021-12-29 | 2021-12-29 | Data encoding method and device, electronic equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114268415A CN114268415A (en) | 2022-04-01 |
| CN114268415B true CN114268415B (en) | 2024-04-30 |
Family
ID=80831374
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111634761.9A Active CN114268415B (en) | 2021-12-29 | 2021-12-29 | Data encoding method and device, electronic equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114268415B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115694727A (en) * | 2022-09-15 | 2023-02-03 | 北京融为科技有限公司 | Long interleaving method and equipment for satellite-ground laser communication data |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101282122A (en) * | 2007-04-03 | 2008-10-08 | 中兴通讯股份有限公司 | Method for partitioning encoding block |
| CN104618068A (en) * | 2015-02-16 | 2015-05-13 | 中国科学院上海高等研究院 | Bit-interleaved coded modulation device and method used for wireless broadcast communication system |
| CN105306165A (en) * | 2014-06-23 | 2016-02-03 | 中兴通讯股份有限公司 | Data transmission method and device |
| CN108574555A (en) * | 2017-03-10 | 2018-09-25 | 华为技术有限公司 | Interference randomization method and apparatus |
| CN111371531A (en) * | 2020-02-19 | 2020-07-03 | 哈尔滨工业大学 | Time domain energy interleaving transmission method based on extended weighted fractional Fourier transform |
| CN113660064A (en) * | 2021-09-15 | 2021-11-16 | 沈阳飞机设计研究所扬州协同创新研究院有限公司 | Multi-data-packet-based joint two-dimensional interleaving coding method suitable for power line communication system |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9166626B2 (en) * | 2011-11-18 | 2015-10-20 | Korea Advanced Institute Of Science And Technology | Encoding, decoding, and multi-stage decoding circuits for concatenated BCH, and error correction circuit of flash memory device using the same |
-
2021
- 2021-12-29 CN CN202111634761.9A patent/CN114268415B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101282122A (en) * | 2007-04-03 | 2008-10-08 | 中兴通讯股份有限公司 | Method for partitioning encoding block |
| CN105306165A (en) * | 2014-06-23 | 2016-02-03 | 中兴通讯股份有限公司 | Data transmission method and device |
| CN104618068A (en) * | 2015-02-16 | 2015-05-13 | 中国科学院上海高等研究院 | Bit-interleaved coded modulation device and method used for wireless broadcast communication system |
| CN108574555A (en) * | 2017-03-10 | 2018-09-25 | 华为技术有限公司 | Interference randomization method and apparatus |
| CN111371531A (en) * | 2020-02-19 | 2020-07-03 | 哈尔滨工业大学 | Time domain energy interleaving transmission method based on extended weighted fractional Fourier transform |
| CN113660064A (en) * | 2021-09-15 | 2021-11-16 | 沈阳飞机设计研究所扬州协同创新研究院有限公司 | Multi-data-packet-based joint two-dimensional interleaving coding method suitable for power line communication system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114268415A (en) | 2022-04-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101601188B (en) | Method and apparatus for encoding and decoding data | |
| CA2563642C (en) | Apparatus and method for encoding and decoding a block low density parity check code | |
| RU2369008C2 (en) | Device and method for coding/decoding block code for low density parity check with variable block length | |
| US20050229088A1 (en) | Systems and methods for LDPC coded modulation | |
| CN101710850B (en) | Convolution Turbo encoding method and device for realizing encoding method | |
| CN108494719B (en) | Constellation mapping method and demapping method | |
| CN101636914A (en) | Method and apparatus for encoding and decoding data | |
| WO2006035563A1 (en) | Method for encoding sequence of blocks of input bits to be transmitted over wireless channel | |
| CA2465381A1 (en) | Partially filling block interleaver for a communication system | |
| US20220190955A1 (en) | Signalling coding and modulation method and demodulation and decoding method and device | |
| CN114268415B (en) | Data encoding method and device, electronic equipment and storage medium | |
| KR20120079922A (en) | Method and apparatus for channel encoding and decoding in a communication system with low density parity-check codes | |
| US11139918B2 (en) | Interleaving method and interleaving apparatus | |
| JP2007515122A (en) | Data transmission / reception method and apparatus by coding having non-uniform error probability in mobile communication system | |
| CN108737021A (en) | Polar decoding transmission methods and device | |
| CN1306367A (en) | Effective band width cascade connected lattice code modem and decording method | |
| US7512863B2 (en) | Turbo code interleaver for low frame error rate | |
| CN101777923B (en) | CTC (Convolutional Turbo Code) encoder, internal code interleaver, as well as internal code interleaving method and encoding processing method | |
| CN113037298A (en) | System and method for filling interference information based on low-code-rate LDPC code | |
| EP2211470A1 (en) | Generating an exponent table for coding and decoding LDPC codewords of different lengths | |
| CN108270448B (en) | Quasi-cyclic low-density parity check coding method and device | |
| WO2000038363A1 (en) | Coding having peak power suppressing capability and error correcting capability in multi-carrier transmission and its decoding | |
| CN100463370C (en) | Input control apparatus and input control method | |
| CN114257342A (en) | Coding and decoding method for two-user multiple access system based on non-binary polarization code | |
| CN101771422B (en) | Interleaving method, encoding method, interleaver and encoder |
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 |