WO2018141292A1

WO2018141292A1 - Data processing method and device

Info

Publication number: WO2018141292A1
Application number: PCT/CN2018/075290
Authority: WO
Inventors: 马亮; 郑晨; 曾歆; 魏岳军
Original assignee: 华为技术有限公司
Priority date: 2017-02-06
Filing date: 2018-02-05
Publication date: 2018-08-09

Abstract

Disclosed in the embodiments of the present application are a data processing method and a data processing device. The method comprises: acquiring a first bit sequence to be processed, the first bit sequence to be processed being a transmission block or a code block generated by the transmission block after undergoing code block segmentation; encoding the first bit sequence to be processed to obtain a first encoded bit sequence; saving all of or at least part of the first encoded bit sequence into a circular cache; and extracting a first output bit sequence from the bits saved in the circular cache. By using the method and device provided by the present application, rate matching of sequences generated by low density parity check (LDPC) coding may be achieved.

Description

Data processing method and device

This application claims the priority of the Chinese Patent Application submitted to the China Patent Office on February 6, 2017, the application number is 201710065944.0, the application name is "Data Processing Method and Equipment", and the Chinese Patent Office submitted to the China Patent Office on March 3, 2017. Priority is claimed on Japanese Patent Application No. Serial No. No. No. No. No. No. No. No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No

Technical field

The present application relates to the field of wireless communications, and in particular, to a data processing method and device.

Background technique

A quasi cycle low density parity check code (QC-LDPC) is a type of linear block coding with a sparse check matrix. Because QC-LDPC not only has good performance close to the Shannon limit, but also has the characteristics of flexible structure and low decoding complexity, it can be widely used in various communication systems.

In order to support the requirements of various code length code rates, after encoding the information bit sequence using the LDPC check matrix to generate a code sequence, it is also necessary to rate match the code sequence, thereby adjusting the code rate of the code sequence to conform to the system transmission. The code rate of the demand. Therefore, there is a need for a data processing method that achieves rate matching of sequences generated by LDPC encoding.

Summary of the invention

The application provides a data processing method and device to achieve rate matching of sequences generated by LDPC coding.

In a first aspect, an embodiment of the present invention provides a data processing method, including: acquiring a first to-be-processed bit sequence, where the first to-be-processed bit sequence is a code block generated by a transport block or a transport block after code block segmentation. Encoding the first to-be-processed bit sequence to obtain a first encoded bit sequence; saving all or at least a portion of the first encoded bit sequence to a circular buffer; storing the bit from the circular buffer The first output bit sequence is taken out.

In a possible design, acquiring the first bit sequence to be processed includes: acquiring a transport block; generating, according to the transport block, N bit sequences including the first bit sequence to be processed, where N is greater than 0 Integer.

In one possible design, the method further includes interleaving the first sequence of output bits.

In a possible design, the method further includes: generating a vector sequence based on the first output bit sequence, the vector sequence including Q vectors of the first output bit sequence, each of the first The vector of output bit sequences includes at least one bit of the first output bit sequence, wherein Q is a positive integer; the vector sequence is interleaved.

In one possible design, the vector sequence further comprises a vector generated based on the second output bit sequence; each vector of the second output bit sequence comprising at least one bit of the second output bit sequence.

In one possible design, interleaving the vector sequence includes interleaving the vectors contained in the vector sequence.

In a possible design, the interleaving the vector sequence includes performing inter-sub-interleaving on each sub-vector sequence included in the vector sequence to obtain M inter-subsequence sub-sequences, where the vector sequence Included in the sequence of M sub-vectors, the number of vectors included in each of the sub-vector sequences is a positive integer multiple of a vector included in a time-domain symbol in a channel for transmitting the transport block within a transmission time interval; M interleaved subsequences.

In a second aspect, an embodiment of the present invention provides a data processing method, including: acquiring a first to-be-processed bit sequence, where the first to-be-processed bit sequence is a code block generated by a transport block or a transport block after code block segmentation. Encoding the first to-be-processed bit sequence to obtain a first coded bit sequence; performing bit-rearrangement on the first coded bit sequence to obtain a first rearranged bit sequence; or all or all of the first rearranged bit sequence At least a portion of the bits are saved to a circular buffer; a first output bit sequence is fetched from the saved bits in the circular buffer.

In a possible design, performing bit rearrangement on the first encoded bit sequence includes at least one operation of: changing a position of the first subsequence in the first encoded bit sequence, the first subsequence The length is a positive integer multiple of the spreading factor; or, the second subsequence in the first encoded bit sequence is deleted, and the length of the second subsequence is a positive integer multiple of the spreading factor.

In a possible design, the first coded bit sequence is bit-rearranged to obtain a first rearranged bit sequence, including: the second sub-sequence includes at least one information bit; or the first sub-sequence includes At least one check bit.

In a possible design, performing bit rearrangement on the first encoded bit sequence includes: obtaining a punctured sequence and a redundant interleaving sequence, wherein the punctured sequence is a sequence obtained by puncturing the information bit sequence The redundant interleaving sequence is a sequence obtained by performing bit rearrangement on the first redundant sequence; cascading the punctured sequence, the redundant interleaving sequence, and the second redundant sequence, thereby obtaining a bit first rearranged bit sequence; The information bit sequence is composed of information bits included in the first to-be-processed bit sequence, and the first redundant bit sequence is generated by encoding a first to-be-processed bit sequence using a core matrix of an LDPC check matrix. The remaining bits are constructed, and the second redundant sequence is composed of redundant bits generated by encoding the first to-be-processed bit sequence using the spreading matrix of the LDPC check matrix.

In a possible design, performing bit rearrangement on the first redundant sequence includes: rearranging the subsequences included in the first redundant sequence according to the selected interleaving pattern, wherein each subsequence is included in the core matrix A column of check bits is formed by redundant bits generated by encoding the information bit sequence.

In a third aspect, in order to implement the data processing method of the first aspect, the embodiment of the present invention provides a data processing device, which has the function of implementing the data processing method in each embodiment of the first aspect. The functions may be implemented by hardware or by corresponding software implemented by hardware. The hardware or software includes one or more modules corresponding to the functions described above.

In a possible design, the data processing device includes: an acquiring unit, configured to acquire a first to-be-processed bit sequence, where the first to-be-processed bit sequence is a transport block or a block generated after the code block is split. a coding unit, configured to: encode a first to-be-processed bit sequence to obtain a first encoded bit sequence; and a saving unit, configured to save all or at least part of the first encoded bit sequence to a circular buffer; a unit for extracting a first output bit sequence from the circular buffer.

In a possible design, the acquiring unit includes: an obtaining subunit for acquiring a transport block, and a generating subunit, configured to generate, according to the transport block, a N including the first to-be-processed bit sequence a sequence of bits, N being an integer greater than zero.

In a possible design, the device further includes: a first interleaving unit, configured to interleave the first output bit sequence.

In a possible design, the device further includes: a second interleaving unit, configured to generate a vector sequence based on the first output bit sequence, where the vector sequence includes Q vectors of the first output bit sequence And each of said first output bit sequence vectors includes at least one bit of said first output bit sequence, wherein Q is a positive integer; said vector sequence is interleaved.

In a possible design, the second interleaving unit is specifically configured to interleave vectors included in the vector sequence.

In a possible design, the second interleaving unit is specifically configured to perform intra-sub-interleaving on each sub-vector sequence included in the vector sequence to obtain M inter-subsequence sub-sequences, where the vector The sequence includes M sub-vector sequences, and the number of vectors included in each of the sub-vector sequences is a positive integer multiple of a vector included in a time-domain symbol in a channel for transmitting the transport block within one transmission time interval; M interleaved subsequences are described.

In a fourth aspect, in order to implement the data processing method of the second aspect, the embodiment of the present invention provides a data processing device, which has the function of implementing the data processing method in each embodiment of the second aspect. The functions may be implemented by hardware or by corresponding software implemented by hardware. The hardware or software includes one or more modules corresponding to the functions described above.

In a possible design, the data processing device includes: an acquiring unit, configured to acquire a first to-be-processed bit sequence, where the first to-be-processed bit sequence is generated after a transport block or a transport block is code-blocked. a code block, configured to encode the first to-be-processed bit sequence to obtain a first coded bit sequence, and a rearrangement unit to perform bit-rearrangement on the first coded bit sequence to obtain a first rearranged bit a sequence; a saving unit, configured to save all or at least part of the first reordered bit sequence to a circular buffer; and an output unit, configured to extract the first output bit sequence from the saved bits in the circular buffer .

In a possible design, the rearrangement unit is specifically configured to change a position of the first sub-sequence in the first encoded bit sequence, where the length of the first sub-sequence is a positive integer multiple of the spreading factor; Or deleting a second subsequence in the first encoded bit sequence, the length of the second subsequence being a positive integer multiple of the spreading factor.

In one possible design, the second subsequence includes at least one information bit; or the first subsequence includes at least one parity bit.

In a possible design, the rearrangement unit is specifically configured to obtain a post-punch sequence and a redundant interleaving sequence, where the post-punch sequence is a sequence obtained by puncturing the information bit sequence; the redundant interleaving sequence a sequence obtained by performing bit rearrangement on the first redundant sequence; cascading the punctured sequence, the redundant interleaving sequence, and the second redundant sequence, thereby obtaining a bit first rearranged bit sequence; wherein the information bit sequence Forming, by the information bits included in the first to-be-processed bit sequence, the first redundant bit sequence is composed of redundant bits generated by encoding a first to-be-processed bit sequence using a core matrix of an LDPC check matrix, The two redundant sequences are composed of redundant bits generated by encoding the first to-be-processed bit sequence using an spreading matrix of the LDPC check matrix.

In a possible design, the rearrangement unit is further configured to rearrange sub-sequences included in the first redundant sequence according to the selected interleaving pattern, wherein each sub-sequence is represented by a column of check bits in the core matrix. The redundant bits formed by encoding the information bit sequence are constructed.

In a fifth aspect, an embodiment of the present invention further provides a data processing device, including: a processor, a memory, and a transceiver; the processor may execute a program or an instruction stored in the memory, thereby implementing the first Aspects and the data processing method of various implementations of the second aspect.

In a sixth aspect, an embodiment of the present invention provides a storage medium, where the computer storage medium may store a program, and when the program is executed, the first aspect and the part of the second aspect provided by the embodiment of the present invention may be implemented. Or all steps.

The data processing method and device provided by the embodiments of the present invention can implement rate matching of sequences generated by LDPC coding.

DRAWINGS

In order to more clearly illustrate the technical solutions of the present application, the drawings used in the embodiments will be briefly described below. Obviously, for those skilled in the art, without any creative labor, Other drawings can also be obtained from these figures.

1 is a schematic flow chart of an embodiment of a data processing method according to the present application;

2 is a schematic flowchart of another embodiment of a data processing method according to the present application;

3 is a schematic flowchart of another embodiment of a data processing method according to the present application;

4 is a schematic flowchart of another embodiment of a data processing method according to the present application;

FIG. 5 is a schematic flowchart diagram of another embodiment of a data processing method according to the present application;

6 is a schematic structural diagram of an embodiment of a data processing device according to the present application;

7 is a schematic structural diagram of an embodiment of a data processing device according to the present application;

8 is a schematic structural diagram of an embodiment of a data processing device according to the present application;

9 is a schematic structural diagram of a system for transmitting data processing systems for uplinks according to the present application;

FIG. 10 is another schematic structural diagram of a system for transmitting a data processing system for uplink in the present application; FIG.

11 is another schematic structural diagram of a system for transmitting data processing systems for uplinks according to the present application;

12 is a schematic structural diagram of a receiving side data processing system system for an uplink according to the present application;

13 is another schematic structural diagram of a receiving side data processing system system for an uplink according to the present application;

14 is another schematic structural diagram of a receiving side data processing system system for an uplink according to the present application;

15 is a schematic structural diagram of a system for transmitting data on a downlink side of the present application;

16 is another schematic structural diagram of a system for transmitting data on a downlink side of the present application;

17 is another schematic structural diagram of a system for transmitting data on a downlink side of the present application;

18 is a schematic structural diagram of a receiving side data processing system system for a downlink according to the present application;

19 is another schematic structural diagram of a receiving side data processing system system for a downlink according to the present application;

FIG. 20 is another schematic structural diagram of a receiving side data processing system system for a downlink according to the present application.

detailed description

Referring to FIG. 1, a flow chart of an embodiment of a data processing method of the present application is shown.

In step 101, the data processing device acquires a transport block.

The data processing device may first acquire data to be transmitted, and generate a transport block (TB) corresponding to the data to be transmitted. The length of the transport block may be a predetermined value.

If the check information is not included in the data to be transmitted, the data processing device may add check information to the data to be transmitted, thereby obtaining a transport block. If the check information is already included in the data to be transmitted, the data processing device may directly use the acquired data to be transmitted as a transport block. For example, if the data to be transmitted does not include the check information, the data processing device may attach a corresponding cyclical redundancy check (CRC) check bit after the data to be transmitted, thereby obtaining a transport block.

Step 102: Generate N bit sequences based on the transport block.

If the length of the transport block is not greater than the data length that the encoder can encode each time, the transport block can be directly used as the first pending bit sequence. If the length of the transport block is greater than the data length that the encoder can encode each time, after acquiring the transport block, the data processing device can generate N bit sequences based on the transport block. Wherein, the length of each of the bit sequences may also be a predetermined value. Wherein, the value of N is a positive integer, and the length of the data block may be less than or equal to the length that the encoder can encode each time. When the value of N is greater than 1, each data block may be of a predetermined length. In general, the length of the data block, the length of the bit sequence, and the value of N can all be preset by the wireless communication system.

The data processing device may perform data block (CB) segmentation on the transport block according to a preset parameter and a split mode, and the data block may also be called a code block, thereby obtaining N data blocks. After the N data blocks are generated, the data processing device may directly use each of the data blocks obtained by the segmentation as a bit sequence; or, after each of the data blocks, a corresponding CRC check bit may be attached, and then A data block to which a CRC check bit is attached is used as a bit sequence, thereby obtaining N bit sequences. It is also possible to divide the data blocks into groups, and attach corresponding CRC check bits after each group of data blocks. A set of data blocks may include a plurality of data blocks, which may also be referred to as a code block group, and may transmit feedback according to a code block group when transmitting.

Step 103: Encode the first to-be-processed bit sequence to obtain a first encoded bit sequence. The first to-be-processed bit sequence may be any one of the N bit sequences.

The data processing device may perform LDPC encoding on the first to-be-processed bit sequence to obtain a first encoded bit sequence. The LDPC check matrix may be obtained by the data processing device based on the base matrix or saved by the data processing device, or obtained from other devices. The specific process of encoding the first to-be-processed bit sequence by using the LDPC check matrix will not be repeated here.

Step 104: Save all or at least part of the first encoded bit sequence to a circular buffer.

If the first to-be-processed bit sequence contains k bits, and the first encoded bit sequence includes n-bit code words, then at this time, the code rate supported by the LDPC code mother code is R=k/n. If the first encoded bit sequence is greater than the maximum encoded bit sequence n _max , or the LDPC code rate is lower than the minimum supported code rate R _min , the data processing device needs to be different according to different processing capabilities of different receiving devices. After encoding, the bit sequence is truncated and then input into the circular buffer.

There are various ways in which the data processing device performs rate matching on the first encoded bit sequence. Generally, the data processing device may perform rate matching on the first encoded bit sequence using a circular buffer to generate a first output bit sequence.

If rate matching is implemented using a circular buffer, the data processing device may first determine the size N _{CB of the} data processing device circular buffer based on the processing capabilities of the receiving device. If the size of the circular buffer is greater than or equal to the length of the first encoded bit sequence, the first encoded bit sequence may be directly saved to the circular buffer if the circular buffer is smaller than the first encoded bit sequence Then, after deleting the portion of the bit sequence larger than N _CB after the first encoding, the remaining portion is placed in the virtual cache.

The N _CB value is determined differently depending on the application scenario.

In an implementation manner, if the first encoded bit sequence size in the data processing device is K _W , the maximum transport block size supported by the soft buffer of the receiving device is calculated according to the decoding capability of the receiving device (transport) Block size) is N _IR , and the number of data blocks at this time is C, then

Wherein the value of N _IR receiving apparatus according to the different decoding capabilities preset by the system, may have a plurality of different levels.

In another implementation, if the first encoded bit sequence size in the data processing device is K _W , the lowest LDPC mother code rate supported by the receiving device is R _t , and the current to be transmitted The transport block size information bit size is K _{IR, send} , and the number of data blocks at this time is C, then

In still another implementation, if the receiving device not only has limited transport block buffer, but also has limited decoding capability, then the formula can be expressed as:

or

If the receiving device is not limited to the transport block buffer and the circular buffer of each code block is limited, then the formula can be expressed as:

In another implementation manner, if the first encoded bit sequence size in the data processing device is K _W and the receiving device has a maximum of N _CB,t per block, then N _CB =min(K _W , N _{CB , t} ), where the value of N _CB,t is preset by the system according to the decoding capability of the receiving device, and may have multiple different levels.

It can be seen that the circular buffer in the data processing device can be used to save all or part of the bits in the first encoded bit sequence in step 103, so that rate matching can be performed.

Step 105: Extract a first output bit sequence from the circular buffer.

After saving all or at least part of the first encoded bit sequence to the circular buffer, the data processing device may extract a bit segment of a predetermined length from a selected starting position in the circular buffer, thereby obtaining a first output. Bit sequence. The selected starting location may be a redundancy version starting location in the virtual cache, and the predetermined length may be a redundancy version length indicated by system control information.

In the process of fetching the bit segment, if the bit operation reaches the end of the virtual buffer, if the length of the bit segment has not reached the predetermined length, the header may be returned to the loop buffer until the bit segment is The length reaches the predetermined length, resulting in output bit segments e ₀ , e ₁ , ..., e _E-1 , where E represents the length of the output bit segment.

Wherein, when the preset maximum number of the redundancy version is j _max , j _max redundancy versions may be respectively recorded as

The starting positions of these redundant versions are respectively recorded as

i _max represents the maximum number of starting positions of the redundancy version, rv _i <rv _i+1 , i=0,1,...,i _max-2 ; rv ₀ indicates the first bit in the circular buffer,

The value can be directly preset by the system or calculated according to the preset formula. Assume that the block lengths of the redundancy versions RV ₀ , RV ₁ , ..., RV _j are respectively

The number of redundancy versions currently transmitted is j, then the equivalent code rate of the first output bit sequence can be expressed as:

It should be noted that the steps from 103 to 105 are only described by taking the value of N as 1, for example, a bit sequence to be processed is taken as an example. If the value of N is greater than 1, the bit sequence to be processed is When there is more than one, the data processing device may respectively generate the output bit sequence corresponding to each bit sequence to be processed in the manner shown in steps 103 to 105.

When the value of N is greater than 1, the data processing device may generate an output bit sequence corresponding to each bit sequence to be processed in parallel, or may generate an output bit sequence corresponding to each bit sequence to be processed one by one in a serial manner.

Since, in order to obtain better decoding performance when performing rate matching using the circular buffer, it may be necessary to delete part of the bits in the first encoded bit sequence or to preferentially transmit the first encoding according to the difference in length of the first output bit sequence. The data processing device may further perform bit rearrangement on the first encoded bit sequence to obtain a first rearranged bit sequence, and then save all or at least part of the second bit sequence to the circular buffer.

As shown in FIG. 2, in another embodiment, the foregoing step 104 can also be replaced by the following steps 106 to 107:

Step 106: Perform bit rearrangement on the first encoded bit sequence to obtain a first rearranged bit sequence.

The data processing device may perform bit rearrangement on the first encoded bit sequence by using a bit rearrangement method, thereby obtaining a bit first rearranged bit sequence. The performing the bit rearrangement on the first encoded bit sequence includes at least one operation of: changing a position of the first subsequence in the first encoded bit sequence, where the length of the first subsequence is a spreading factor A positive integer multiple; or, deleting the second subsequence in the first encoded bit sequence, the length of the second subsequence being a positive integer multiple of the spreading factor. That is, the first rearranged bit sequence is obtained by changing the position of the first subsequence in the first encoded bit sequence, or the first rearranged bit sequence is the second of deleting the first encoded bit sequence. Subsequence obtained.

In one implementation, the first subsequence may include at least one parity bit and the second subsequence includes at least one information bit. Changing the position of the first subsequence may be to interact the first subsequence with other subsequence locations or insert the first subsequence into a position in the first post-coded bit sequence.

For example, when the first encoded bit sequence is generated by LDPC encoding, the first encoded bit sequence L is sequentially leveld by the information bit sequence L ₀ , the first redundant sequence L ₁ and the second redundant sequence L _{2 .} Linked up. Wherein L _{0 is} composed of information bits included in the first to-be-processed bit sequence; L _{1 is} composed of redundant bits generated by encoding the first to-be-processed bit sequence using a core matrix of the LDPC check matrix; L _{2 is} composed of The redundancy matrix generated by encoding the first to-be-processed bit sequence is constructed using an extension matrix of the LDPC parity check matrix. The core matrix refers to a matrix in which the check portion of the LDPC check matrix includes at least a complete double-diagonal or lower triangular structure; and the extended matrix refers to other than the core matrix in the LDPC check matrix. matrix.

When the first encoded bit sequence is generated by LDPC encoding, performing bit rearrangement on the first encoded bit sequence may include the following steps:

The data processing apparatus may be made to punch L _0, L ₀ will be deleted in one or more information bits, the puncturing resulting sequence L _'0. Number of information bits may be deleted as an integer multiple spreading factors, these may be removed as a second information bit sequence, such as L _3.

In addition to puncturing L _0, the data processing device may also change the position of the sub-sequence of L _1, to generate a redundancy interleaving sequence L _'1.

After L _'0, L' ₁ and L ₂ are determined, the data processing apparatus may sequentially cascaded L _'0, L' ₁ and L _2, thereby obtaining a first rearranged bit sequence L '; Alternatively, the data processing device the data processing device may also be sequentially cascaded _{_{L '0, L' 1,}} L 2 and L ₃ are perforated by a sequence of bits to be punctured bits configured to obtain bits of the first bit sequence rearranged L '. It should be noted here that the present application does not perform the puncturing of the data processing device L ₀ and the order in which the data processing device performs bit rearrangement on L ₁ .

When L ₀ of the puncturing, the data processing device first uses the predetermined puncturing rule, puncturing of L _0. The sequence formed by the bits remaining after puncturing L ₀ is the post-punch sequence L'₀; and the sequence formed by the punctured bits contiguously is the punctured bit sequence L ₃ .

When changing the position of L _1, the data processing apparatus in accordance with the selected interleaving pattern of the sub-sequence comprises a first sequence of redundancy rearrangement, wherein each sub-sequence consists of a core matrix of the first parity bit to be processed The bit sequence is composed of redundant bits generated by encoding.

In an implementation manner, the data processing device may first determine an interleaving pattern corresponding to the core matrix; then perform column rearranging on the core matrix by using the interleaving pattern; and then interpolate according to each column in the core matrix. The order in the front matrix is arranged for the subsequences corresponding to the columns in the core matrix to obtain L' ₁ . Each of the sub-sequences is composed of redundant bits generated by encoding a first to-be-processed bit sequence using a column of parity bits of the core matrix. The subsequence corresponding to a column in the core matrix refers to a sequence composed of redundant bits generated by encoding the first to-be-processed bit sequence using the column check bits in the column.

For example, if the interleaving pattern is k _b +1, k _b +2, k _b , then the data processing device may cascade the k _b +1 subsequence, the k _b + 2 subsequence and the k _b subsequence in sequence. The k _b sub-sequence is composed of redundant bits generated by encoding the first to-be-processed bit sequence using the k- _th column parity of the core matrix, and the k _b +1 sub-sequence is obtained by using the k _{b of the} core matrix. The +1 column check bit is formed by the redundant bits generated by encoding the first bit sequence to be processed, and the k _b + 2 subsequence is performed on the first output bit sequence by using the k _b + 2 column check bits of the core matrix. The coding consists of a redundant bit structure that encodes the first to-be-processed bit sequence.

For another example, if the interleaving pattern is k _b +3, k _b +1, k _b +2, k _b , then the data processing device can cascade the k _b +3 subsequence, the k _b +1 subsequence, k _b +2 subsequence and k _b subsequence. The k _b sub-sequence is composed of redundant bits generated by encoding the first to-be-processed bit sequence using the k- _th column parity of the core matrix, and the k _b +1 sub-sequence is obtained by using the k _{b of the} core matrix. The +1 column check bit is composed of redundant bits generated by encoding the first to-be-processed bit sequence, and the k _b + 2 sub-sequence is used by using the k _b + 2 column check bit of the core matrix to the first to-be-processed bit sequence The redundant bits formed by the encoding are constructed, and the k _b +3 subsequence is composed of redundant bits generated by encoding the first to-be-processed bit sequence using the k _b + 3 column parity bits of the core matrix.

In addition to the above interleaving patterns, the possible interleaving patterns also include:

Assuming that the number of columns to be interleaved is 3, the pattern after interleaving is

k _b +1,k _b +2,k _b , or

k _b +1,k _b ,k _b +2, or

k _b ,k _b +1,k _b +2, or

k _b ,k _b +2,k _b +1

Assuming that the number of columns to be interleaved is 4, the pattern after interleaving can be,

k _b +3,k _b +1,k _b +2,k _b , or

k _b +1,k _b +3,k _b +2,k _b , or

k _b +3,k _b +1,k _b ,k _b +2, or

k _b +1,k _b +3,k _b ,k _b +2, or

k _b ,k _b +2,k _b +1,k _b +3, or

k _b +2,k _b ,k _b +1,k _b +3, or

k _b ,k _b +2,k _b +3,k _b +1, or

k _b +2,k _b ,k _b +3,k _b +1, or,

k _b ,k _b +1,k _b +2,k _b +3, or,

k _b , k _b +1, k _b +3, k _b +2.

Assuming that the number of columns to be interleaved is 6, the pattern after interleaving can be,

_{_{k b + 5, k b +}} 3, k b + 1, k b + 4, k b + 2, k b, or

k _b +1,k _b +3,k _b +5,k _b +4,k _b +2,k _b , or

k _b +5,k _b +3,k _b +1,k _b ,k _b +2,k _b +4, or

k _b +1,k _b +3,k _b +5,k _b ,k _b +2,k _b +4, or

k _b +4,k _b +2,k _b ,k _b +5,k _b +3,k _b +1, or

k _b +4,k _b +2,k _b ,k _b +1,k _b +3,k _b +5, or

k _b ,k _b +2,k _b +4,k _b +5,k _b +3,k _b +1, or

k _b ,k _b +2,k _b +4,k _b +1,k _b +3,k _b +5,

Assuming that there are other values for the number of columns to be interleaved, the design principle of the interleaving pattern is:

L ₁ in the sequence corresponding to the sequence number is even preferred that all of the puncturing sequences, or preferentially selects all odd numbered sequences of puncturing.

Step 107: Save all or at least part of the first rearranged bit sequence to a circular buffer.

If the size of the circular buffer is greater than or equal to the length of the first reordered bit sequence, the bit sequence may be directly saved to a circular buffer, if the circular buffer is smaller than the first rearranged bit sequence, then The remaining portion may be placed in the virtual cache after the portion of the first rearranged bit sequence greater than N _CB is deleted. The manner of determining the value of N _CB can be referred to the foregoing, and is not described herein.

By using the implementation manner, the first coded bit sequence is bit-rearranged, and when the first output bit sequence is generated, the punctured bits are preferentially discarded, or the order of selecting the first redundant sequence is changed, so as to avoid hitting the wrong one. The hole sequence selects the encoded bit sequence, thereby improving the decoding performance of the LDPC code.

It should be noted that, in addition to bit rearranging the first encoded bit sequence in the above manner, the first encoded bit sequence may be bit rearranged in other manners.

It can be seen that the circular buffer in the data processing device can also be used to save all or part of the bits in the first reordered bit sequence in step 106 so that rate matching can be performed.

It should be noted that steps 106 to 107 are only described by one encoded bit sequence. If the encoded bit sequence is multiple, the methods shown in steps 106 to 107 and step 105 may be used to generate and An output bit sequence corresponding to each encoded bit sequence.

After the output bit sequence is generated, the data processing device also needs to interleave the output bit sequence to facilitate gain during signal transmission. The data processing device may perform intra-sequence interleaving on each output bit segment, or may interleave between two or more output bit segments. The inter-bit interleaving may further include frequency domain interleaving or channel interleaving.

It should be noted that in various embodiments of the present application, a bit sequence is sometimes referred to as a bit segment, and a bit subsequence generally refers to a subset of a bit sequence. The bit subsequence, the bit sequence, and the bit segment are all formally composed of one or more bits. Interleaving a bit sequence, or a bit subsequence, or a bit segment is performed at a bit granularity.

The following describes an inter-sequence interleaving process by taking an intra-sequence interleaving of an output bit sequence as an example:

Referring to FIG. 3, it is a schematic flowchart of an embodiment of an interleaving method according to the present application.

In step 301, an intra-sequence interlace matrix is determined.

The data processing device may first determine an intra-sequence interleaving matrix. Wherein, the number of columns of the interleaving matrix in the sequence is

The number of rows is

E is the length of the first output bit sequence. usually,

Can be a predetermined value, and

Can be satisfied

The minimum value. The numbers of the columns in the interleaving matrix in the sequence are from left to right.

Each row in the interleaving matrix in the sequence is numbered sequentially from top to bottom.

Step 302: Generate a first sequence to be interleaved.

In addition to determining the interleaving matrix within the sequence, the data processing device also needs to generate a first sequence to be interleaved.

in case

Then the data processing device can

Add dummy bits before the first output bit sequence to generate a first sequence to be interleaved

Wherein, when k=0,1,...,N _D -1, y _k =<NULL>; and when k=0,1,...,E,

in case

Then the data processing device can directly use the first output bit sequence as the first to-be-interleaved sequence.

That is, when

The first sequence to be interleaved is a sequence generated by adding N _D elements having a value of <NULL> at the front end of the first output bit sequence;

The first output bit sequence is the first sequence to be interleaved.

It should be noted that the present application does not limit the execution order between

step

301 and 302.

Step 303: Fill the first to-be-interleaved sequence into the intra-sequence interleave matrix in a row-by-row manner.

After the first to-be-interleaved sequence is generated, the data processing device may fill the first inter-interleaved sequence into the intra-sequence interleave matrix in a row-by-row manner.

Step 304: Perform column switching on the intra-sequence interleaving matrix filled in the first to-be-interleaved sequence, thereby generating a column switching matrix.

After the first to-be-interleaved sequence is filled into the intra-sequence interleaving matrix in a row-by-row manner, the data processing device may perform an intra-sequence interleaving matrix filled with the first to-be-interleaved sequence according to a preset column exchange pattern. Column exchange is performed to generate a column exchange matrix.

Wherein, the column exchange pattern can be obtained by looking up a table. The column exchange pattern can be expressed as <p(j)> _{j∈{0,1,...,N-1}} , where p(j) is the original column number of the jth column after the column exchange.

Table 1 is an example of an interlaced pattern:

Table 1

For example, the matrix before the column exchange can be expressed as:

The matrix after column exchange can be expressed as:

Step 305, reading all the matrix elements in the column switching matrix in column order.

After the column switch matrix is generated, all of the matrix elements in the column switch matrix are read in column order. The sequence formed by reading all the matrix elements in the column switching matrix in column order is the interleaved bit sequence in the sequence.

The interleaved bit sequence within the sequence can be expressed as:

Where v ₀ =y _p(0) ,

v _k =y _π(k) ,......;

The interleaved bit sequence W=w ₀ , w ₁ , . . . , w _{E is} obtained one by one from the intra-sequence interleaved bit sequence, wherein if the value v _i ≠<NULL> is satisfied and the value of i is at least i ₀ , then

in case

Satisfying the formula v _i ≠<NULL>, i>i _q , the minimum value of i is i _q+1 , then

It should be noted that the pre-interleaving matrix used for intra-sequence interleaving of different output bit sequences may be the same or different.

In another implementation manner of the data processing method of the present application, if the code blocks are grouped when performing code block division on the transport block, the output bit sequences of the respective code blocks in the at least one code block group may be cascaded. The interleaved input bit sequence, for example, is input to bit sequence A, and then interleaved with the input bit sequence A. Each code block in a code block group passes through steps 103-105 or through

steps

103, 106, 107 and 105 to obtain corresponding output bit sequences, which may also be referred to as a set of output bit sequences. That is, each output bit sequence is obtained from a circular buffer, where the circular buffer is used to save all or part of the bits obtained by encoding the code block corresponding to each of the output bit sequences, or the circular buffer is used. And storing all or part of the bits obtained after the code block corresponding to each of the output bit sequences is encoded and rearranged.

In one possible embodiment, it can be:

A01: Acquire an input bit sequence A, wherein the input bit sequence A can be obtained based on at least one set of output bit sequences, each set of output bit sequences includes at least one output bit sequence, and each output bit sequence in each set of output bit sequences is based on Generated by each code block in the same code block group;

A02: Interleaving the input bit sequence A.

For the method of performing intra-sequence interleaving on the input bit sequence A, reference may be made to steps 301-305, except that E is the length of the input bit sequence A.

For example, when performing code block partitioning on a transport block, a total of 15 code blocks and 3 code block groups are obtained, wherein code blocks 0 to 4 belong to code block group 0, and code blocks 5 to 9 belong to code block group 1, code blocks. 10 to 14 belong to code block group 2. If the intra-sequence interleaving is performed according to the code block group 0, the input bit sequence A can be obtained by cascading the output bit sequences of the code blocks in the code block group 0, that is, the output bit sequences corresponding to the code blocks 0 to 4 are cascaded. If a plurality of code block groups are inter-sequence interleaved, for example, code block groups 1 and 2, the input bit sequence A can be obtained by cascading the output bit sequence of each code block in the code block groups 1 and 2, that is, the code block The output bit sequences corresponding to 5 to 14 are obtained by cascading. It should be noted that the embodiments herein are merely illustrative, and the embodiments of the present invention are not limited thereto.

The following is a description of the process of frequency domain interleaving two or more output bit sequences:

Referring to FIG. 4, it is a schematic flowchart of another embodiment of the interleaving method of the present application.

In step 401, a vector sequence is generated.

The vector sequence is composed of at least one vector, the vector sequence including at least a vector generated based on the first output bit sequence. The vector generated based on the first output bit sequence is Q, where Q is a positive integer.

Each of the vectors generated based on the first output bit sequence includes at least one bit of the first output bit sequence, and the bits included in each vector may not overlap each other. Each vector may contain a predetermined number of bits, number of bits contained in the vector may be a modulation order mapped layers and Q _m N _L product Q _m · N _L.

It should be noted that in various embodiments of the present application, a vector sequence is sometimes referred to as a vector segment. A sub-vector sequence generally refers to a subset of a vector sequence, and sometimes a sub-vector sequence is also referred to as a vector segment. Vector sequences, vector segments, sub-vector sequences, and vector segments are all formed by one or more vectors. Each vector includes one or more bits. Vector sequences, vector segments, sub-vector sequences, and vector segments are interleaved in a vector-based granularity.

For example, if the first output bit sequence contains 16 bits, each vector contains 4 bits, then the number of vectors generated based on the first output bit sequence is 4, and each of the vectors includes the number The four bits in an output bit sequence, the bits contained in each vector are combined to form the first output bit sequence.

In addition to the vector generated based on the first output bit, if the value of N is greater than 1, the generated vector may also include the generated vector based on the second output bit sequence. A vector of each of said second output bit sequences includes at least one bit of said second output bit sequence.

The data processing device may first acquire a second sequence of bits to be processed. When the first to-be-processed sequence is a transport block, the second to-be-processed bit sequence may be a transport block different from the first to-be-processed sequence; or, when the first to-be-processed sequence is the N-bits In one of the sequences, the second transmission bit may be another one of the N bit sequences different from the first to-be-processed sequence.

After acquiring the second to-be-processed bit, the data processing device may encode the second to-be-processed bit sequence to obtain a second encoded bit sequence; and then save all or at least part of the second encoded bit sequence to Cycling the buffer; and then extracting the second output bit sequence from the circular buffer. The generation process of the second output bit sequence is similar to the process of generating the first output bit sequence, and will not be described herein.

It should be noted that the second output bit sequence may be one or more. In general, the second output bit sequence may be N-1, and each second output bit sequence may correspond to a to-be-processed bit sequence other than the first to-be-processed bit sequence. The manner in which the vector is generated based on the second output bit sequence is the same as the manner in which the vector is generated based on the first bit, and will not be described herein.

In addition, when the transport block downlink data, the vector sequence may only include a vector generated based on the N output bit sequences; and when the transport block is uplink data, the vector sequence may further include The vector generated by the information required by the road signaling.

For example, a vector generated based on the N output bit sequences may be represented as a first vector subsequence g ₀ , g ₁ , . . . , g _H′-1 , where H′ represents for The total number of vectors generated by the output bit sequence. If the channel-to-path signaling common Q' _Ad vectors are to be sent in a preset manner, the associated channel signaling may be represented as a second vector subsequence

The data processing device can have g ₀ , g ₁ ,..., g _H'-1 and

Interleaving and mixing to obtain a vector sequence

The length of the vector sequence is H' _total = H' + Q' _Ad .

Step 402: Interleave each sub-vector sequence in the vector sequence to obtain M inter-subsequence sub-sequences. Where M is a positive integer.

The vector sequence includes M vector segments, wherein each vector segment includes a vector number that is a positive integer multiple of a vector number corresponding to a time domain symbol in a channel for transmitting the transport block. The time domain symbol may be an OFDM symbol, an SC-FDMA symbol, or a time domain symbol in other multiple access modes. The data processing device may respectively interleave each sub-vector sequence in the vector sequence to obtain M inter-subsequence sub-sequences;

The following takes a sub-vector sequence as an example to illustrate the process of frequency domain interleaving:

The data processing device may first determine a matrix before the frequency domain interleaving; wherein, the number of columns of the matrix before the frequency domain interleaving is

The number of rows is

For the length of the sub-vector sequence, each vector segment in the embodiment includes only one vector contained in one time domain symbol, and N _symb is a time-domain symbol in the intra-channel for transmitting the transport block in one subframe. number

usually,

Can be a predetermined value, and

Can be satisfied

The minimum value. The numbers of the columns in the matrix before the frequency domain interleaving are from left to right.

Each row in the matrix before the frequency domain interleaving is numbered sequentially from top to bottom.

in case

Then

Fill symbols are padded to the beginning of the sub-vector sequence Y ₂ =e ₀ , e ₁ ,..., e _E-1 to obtain a filled symbol sequence

Where k = 0, 1, ..., N _D , the vector y _k = <NULL>; after that, when k = 0, 1, ..., E,

After filling the symbol sequence Y 'generated after _2, the data processing device may Y' ₂ is filled in a progressive manner to fill the front column exchange matrix, wherein, Y 'in each of ₂ symbols occupy the front row exchange An element position in the matrix; then performing column exchange on the column pre-exchange matrix according to a preset column exchange pattern, thereby generating a column-switched matrix, where the column pre-exchange matrix and the column-switched matrix are relative to the column exchange It can be seen that the matrix before the column exchange is the matrix before the frequency domain interleaving; then all the matrix elements in the matrix after the column exchange are read in column order. The sequence formed by reading all the matrix elements in the column after the column switching in the column order is the frequency domain interleaved vector sequence.

After the symbol sequence is filled into the frequency domain pre-interleaving matrix row by row, the following matrix can be obtained:

The data processing device may perform column switching on the frequency domain interleaving matrix according to a preset interleaving pattern, thereby obtaining a frequency domain interleaved matrix. The interleaving pattern can be expressed as <p(j)> _{j∈{0,1,...,N-1}} , where p(j) is the original column number of the jth column after the column exchange. The matrix after frequency domain interleaving is expressed as follows:

The data processing device may read matrix elements in the frequency domain interleaved matrix column by column, thereby obtaining a frequency domain interleaved vector sequence, where the frequency domain interleaved vector sequence includes

The symbol sequence; the frequency domain interleaved vector sequence can be expressed as:

Where v ₀ =y _p(0) ,

That is, v _k = y _π(k) ,

After by-vector sequence obtained from the interleaving interleaved within the sequence of a sequence of vectors _{_{W = w 0, w 1,}} ..., w E, which, if satisfied Formula v _i ≠ <NULL>, _i is the minimum value i _0, then

in case

After the interleaving in the sub-vector sequence is completed, the interleaved sub-sequence may be mapped, or the sub-vector sequences may be interleaved and concatenated before being mapped and transmitted.

Optionally, the method may further include:

Step 403: Cascading the M interleaved subsequences.

After the interleaved subsequence corresponding to the M sub-vector sequences are generated, the data processing device may cascade the M interleaved sub-sequences to complete the frequency domain interleaving of the output sequence to obtain an inter-interleaved sequence.

After the vector sequence is generated, the data processing device may also interleave the vector sequence by channel interleaving. As shown in the figure, the foregoing steps 402 to 403 can also be replaced by the following step 404.

Referring to FIG. 5, it is a schematic flowchart of another implementation manner of the interleaving method of the present application.

Step 404, performing channel interleaving on the vector sequence.

The data processing device first obtains the number of columns as

The channel interleaving matrix, where

Is a positive integer greater than one. The number of rows of the matrix before channel interleaving is calculated in bits.

By symbol

The numbers of the columns in the matrix before the channel interleaving are from left to right.

The number of each row in the matrix before the channel interleaving is from top to bottom.

among them,

Value equal to

Indicates the number of SC-FDMA symbols in each subframe in the uplink data channel. Since the SC-FDMA may not be used in the wireless communication system, and channel downlink may also be used in the downlink, the present application is not correct.

The specific value is limited.

If channel interleaving is applied to the uplink and the MIMO rank information also needs to be transmitted, the MIMO rank number symbol sequence can be expressed as

Then proceed line by line from the last line of the matrix,

Write to the specified column one by one. The specified column referred to herein may be the column indicated by the table 5.2.2.7-1 in the LTE protocol.

After writing the MIMO rank number symbol sequence to the channel interleaving matrix, the data processing device may assign symbols corresponding to the information symbol sequence g ₀ , g ₁ , . . . , g _H′-1 from the upper left corner of the matrix. Write to the matrix.

After the information symbol sequence is filled into the matrix of the channel interleaving line by line, the following matrix can be obtained:

Starting from y ₀ , each element in the matrix represents a symbol, and if a symbol that has already been written is encountered during writing, it is skipped directly.

If channel interleaving is applied to the uplink, and the HARQ-ACK information also needs to be transmitted in the subframe, the sequence of HARQ-ACK information symbols to be transmitted may be expressed as

The data processing device can write the HARQ-ACK information symbol sequence one by one from the last row of the matrix to the specified column one by one. This step rewrites some symbols in the information symbol sequence that have been written into the matrix before the channel interleaving. The specified column may be the column indicated by the table 5.2.2.8-2 in the LTE protocol.

The data processing device may perform bit rearrangement on the matrix before channel interleaving according to a preset interleaving pattern, thereby obtaining a matrix after channel interleaving. The symbols in the matrix after channel interleaving are then read column by column in column order. The sequence of symbols after channel interleaving is expressed as

Here, N _L represents the number of layers corresponding to the corresponding transport block.

In another implementation manner of the interleaving method of the present application, if the code blocks are grouped when the transport block is coded, the interleaving may be performed by one or more code block groups after generating the vector sequence. For the implementation method, reference may be made to the foregoing steps 401-403, except that each sub-vector sequence includes a vector generated by an output bit sequence corresponding to each code block in at least one code block group.

For example, when performing code block partitioning on a transport block, a total of 5 code blocks and 2 code block groups are obtained, wherein code blocks 0 to 2 belong to code block group 0, and code blocks 3 to 4 belong to code block group 1. If the number of bits included in each vector is 4 bits, and the length of the output bit sequence corresponding to each code block is 16 bits, four vectors g ₀ , g ₁ , g ₂ and may be generated based on the output bit sequence corresponding to the code block 0. G _3, based on the code block output bit sequence corresponding to the can generates four vectors g ₄ ~ g _7, may generate four vectors g ₈ ~ g ₁₁ based on an output bit sequence of the code block 2 corresponding to the code block 3 corresponding to the output based on The bit sequence can generate four vectors g ₁₂ to g ₁₅ , and four vectors g ₁₆ to g ₁₉ can be generated based on the output bit sequence corresponding to the code block 4. In a possible implementation, the interleaving may be performed according to a code block group, and the vector sequence may include two sub-vector sequences, where each sub-vector sequence includes an output bit sequence corresponding to each code block in a code block group. Vector. The sub-vector sequence A includes vectors g ₀ to g ₁₁ generated by the output bit sequences corresponding to the code blocks 0 to 2 in the code block group 0, and has a length of 12, and the sub-vector sequence B includes each code block 3 in the code block group 1 4 The vector g ₁₂ to g ₁₉ generated by the corresponding output bit sequence has a length of 8. Of course, the interleaving may be performed according to multiple code block groups, and the vector sequence includes a sub-vector sequence including vectors g ₀ to g ₁₉ generated by the output bit sequences corresponding to the code blocks in the two code block groups. It should be noted that the embodiments are convenient for illustration, and the embodiments of the present invention are not limited thereto.

In a possible implementation manner of the data processing method provided by the present application, the method may include:

B01: obtaining Q vectors based on P output bit sequences;

B02: obtaining an input vector sequence A, the input vector sequence A includes Q vectors, and the Q vectors are obtained based on P output bit sequences in the previous step;

B03: Interleaving the input vector sequence A.

Wherein P and Q are integers greater than zero.

Since frequency domain interleaving, channel interleaving, and code block group interleaving are all interleaving sub-vector sequences at vector granularity. If the sub-vector sequence is referred to as an input vector sequence A, the input vector sequence A includes Q vectors, which are obtained based on P output bit sequences.

Each of the output bit sequences is obtained from a circular buffer, where the circular buffer is used to store all or part of the bits obtained by encoding the code blocks corresponding to each of the output bit sequences, or the circular buffer is used. And storing all or part of the bits obtained after the code block corresponding to each of the output bit sequences is encoded and rearranged. For example, each output bit sequence may be obtained by transmitting block partitions, respectively, via steps 103-105 or via

steps

103, 106, 107 and 105.

Wherein, the Q vectors are obtained based on the P output bit sequences, and each output bit sequence is divided into at least one vector, and the P output bit sequences may generate Q vectors; or, the P output bit sequences are respectively performed in the sequence. Interleaving obtains P interleaved bit sequences, and divides each interleaved bit sequence into at least one vector, thereby obtaining Q vectors. The method for performing intra-sequence interleaving for each output bit sequence may refer to the foregoing method steps 301 to 305, or A01 to A02.

It can be seen that for frequency domain interleaving, Q is a positive integer multiple of the vector contained in the intra-channel time domain symbol used to transmit the transport block within a transmission time interval.

It can be seen that for channel interleaving, P is the number of code blocks obtained after the code block is divided by the code block.

It can be seen that for code block group interleaving, P is the number of code blocks included in at least one code block group of the G code block groups obtained after the code block is divided by the code block.

FIG. 6 is a schematic structural diagram of an embodiment of a data processing device according to the present application.

As shown in FIG. 6, the data processing device may include: an obtaining unit 601, configured to acquire a first to-be-processed bit sequence, where the first to-be-processed bit sequence is a transport block or a code generated after the code block is split. a coding unit 602, configured to encode a first to-be-processed bit sequence to obtain a first coded bit sequence, and a saving unit 603, configured to save all or at least part of the first coded bit sequence to a circular buffer; The output unit 604 is configured to extract the first output bit sequence from the circular buffer.

It can be seen that the circular buffer in the data processing device can be used to save all or part of the bits in the first encoded bit sequence obtained by the encoding unit 602, so that rate matching can be performed.

Optionally, the obtaining unit 601 includes: an obtaining subunit, configured to acquire a transport block, and a generating subunit, configured to generate, according to the transport block, N bit sequences including the first to-be-processed bit sequence , N is an integer greater than one.

Optionally, the first interleaving unit is configured to interleave the first output bit sequence.

Optionally, the method further includes: a second interleaving unit, configured to generate a vector sequence according to the first output bit sequence, where the vector sequence includes Q vectors of the first output bit sequence, each of the first The vector of output bit sequences includes at least one bit of the first output bit sequence, wherein Q is a positive integer; the vector sequence is interleaved.

Optionally, the vector sequence further includes a vector generated based on the second output bit sequence; each vector of the second output bit sequence includes at least one bit of the second output bit sequence.

Optionally, the second interleaving unit is specifically configured to interleave a vector included in the vector sequence.

Optionally, the second interleaving unit is specifically configured to perform intra-sub-interleaving on each sub-vector sequence included in the vector sequence to obtain M inter-subsequence sub-sequences, where the vector sequence includes M sub-sequences. a sequence of vectors, each of the number of vectors included in the sub-vector sequence being a positive integer multiple of a vector included in a time-domain symbol for transmitting the transport block in a transmission time interval; cascading the M interlaces Post subsequence.

The data processing device can be used to implement the foregoing method embodiments. For details, refer to the description in the foregoing method embodiments, and details are not described herein.

In another implementation, the data processing device shown in FIG. 7 may further include: a rearrangement unit 605. When the reordering unit 605 is included, the acquiring unit 601 is configured to acquire a first to-be-processed bit sequence, where the first to-be-processed bit sequence is a code block generated by the transport block or the transport block after the code block is divided; the coding unit 602 For encoding the first to-be-processed bit sequence to obtain a first coded bit sequence, and a rearranging unit 605, configured to perform bit-rearrangement on the first coded bit sequence to obtain a first rearranged bit sequence; and the saving unit 603 And for saving all or at least part of the first reordered bit sequence to a circular buffer; and outputting unit 604, for extracting the first output bit sequence from the saved bits in the circular buffer.

Optionally, the rearranging unit 605 is specifically configured to change a position of the first sub-sequence in the first encoded bit sequence, where the length of the first sub-sequence is a positive integer multiple of the spreading factor; or, delete a second subsequence in the first encoded bit sequence, the length of the second subsequence being a positive integer multiple of the spreading factor. That is, the first rearranged bit sequence is obtained by changing the position of the first subsequence in the first encoded bit sequence, or the first rearranged bit sequence is the second of deleting the first encoded bit sequence. Subsequence obtained.

It can be seen that the circular buffer in the data processing device can also be used to rearrange all or part of the bits in the first reordered bit sequence obtained by unit 605, so that rate matching can be performed.

Optionally, the second subsequence includes at least one information bit.

Optionally, the rearrangement unit 605 is specifically configured to obtain a post-punch sequence and a redundant interleaving sequence, where the post-punch sequence is a sequence obtained by puncturing the information bit sequence; the redundant interleaving sequence is a pair a sequence obtained by bit rearrangement of a redundant sequence; cascading a post-punch sequence, a redundant interleaving sequence, and a second redundancy sequence, thereby obtaining a bit first rearranged bit sequence; wherein the information bit sequence is The information bits included in the first to-be-processed bit sequence are formed by the redundant bits generated by encoding the first to-be-processed bit sequence using the core matrix of the LDPC check matrix, and the second redundancy The sequence consists of redundant bits generated by encoding the first to-be-processed bit sequence using an spreading matrix of the LDPC check matrix.

Optionally, the rearranging unit 605 is further configured to rearrange the sub-sequences included in the first redundant sequence according to the selected interleaving pattern, where each sub-sequence is represented by a column of parity bits in the core matrix. The sequence is composed of redundant bits generated by encoding.

In another embodiment of the data processing device of the present application, the method may include:

The obtaining unit 601 is configured to obtain a first to-be-processed bit sequence, where the first to-be-processed bit sequence is a transport block or a code block generated after the code block is divided.

The encoding unit 602 is configured to encode the first to-be-processed bit sequence to obtain a first encoded bit sequence.

An output unit 604, configured to extract a first output bit sequence from a circular buffer;

The loop buffer is configured to save all bits or partial bits of the first encoded bit sequence, or the loop buffer is used to save all bits or partial bits of the first rearranged bit sequence, the first The rearranged bit sequence is obtained by bit rearranging the first encoded bit sequence.

Optionally, the method further includes a first interleaving unit, configured to interleave the first output bit sequence.

In another embodiment of the data processing device of the present application, the data processing device may be used to implement the method in the foregoing method embodiments. For details, refer to the description in the foregoing method embodiments, and details are not described herein again. The data processing device can include:

An obtaining unit, configured to obtain an input bit sequence A, the input bit sequence A being obtained based on at least one set of output bit sequences, wherein each set of output bit sequences includes at least one output bit sequence, each set of output bit sequence groups Each of the output bit sequences is generated based on each code block in the same code block group;

An interleaving unit is configured to interleave the input bit sequence A.

Generating unit, configured to obtain M vectors based on the N output bit sequences;

An obtaining unit, configured to acquire an input vector sequence A, where the input vector sequence A includes the M vectors;

An interleaving unit, configured to interleave the sequence of input vectors A;

Where N is an integer greater than 0, and M is an integer greater than 0, and each of the output bit sequences corresponds to one code block obtained by the code block partitioning of the transport block.

FIG. 8 is a schematic structural diagram of another embodiment of a data processing device according to the present application. As shown in FIG. 8, the data processing device shown in FIG. 8 may include: a processor 801, a memory 802, and a transceiver 803.

The transceiver 803 is configured to acquire a first to-be-processed bit sequence, where the first to-be-processed bit sequence is a code block generated by a transport block or a transport block after code block segmentation; Encoding the first to-be-processed bit sequence to obtain a first encoded bit sequence; saving all or at least a portion of the first encoded bit sequence to a circular buffer; and storing the bit from the circular buffer The first output bit sequence is taken out. The transceiver 803 can also be configured to output the first output bit sequence.

Optionally, the transceiver 803 is further configured to obtain a transport block, where the processor 801 is further configured to generate, according to the transport block, N bit sequences including the first to-be-processed bit sequence. , N is an integer greater than one.

Optionally, the processor 801 is further configured to perform interleaving on the first output bit sequence.

Optionally, the processor 801 is further configured to generate a vector sequence based on the first output bit sequence, where the vector sequence includes Q vectors of the first output bit sequence, each of the first The vector of output bit sequences includes at least one bit of the first output bit sequence, wherein Q is a positive integer; the vector sequence is interleaved.

Optionally, the processor 801 is further configured to interleave a vector included in the vector sequence.

Optionally, the processor 801 is further configured to perform inter-sub-interleaving on each sub-vector sequence included in the vector sequence to obtain M inter-subsequence sub-sequences, where the vector sequence includes M sub-sequences. a sequence of vectors, each of the number of vectors included in the sub-vector sequence being a positive integer multiple of a vector included in a time-domain symbol for transmitting the transport block in a transmission time interval; cascading the M interlaces Post subsequence.

Optionally, the transceiver 803 is further configured to obtain a first to-be-processed bit sequence, where the first to-be-processed bit sequence is a code block generated by the transport block or the transport block after the code block is divided; The 801 may be further configured to: encode the first to-be-processed bit sequence to obtain a first coded bit sequence; perform bit-reordering on the first coded bit sequence to obtain a first rearranged bit sequence; All or at least some of the bits of the bit sequence are saved to a circular buffer; the first output bit sequence is fetched from the saved bits in the circular buffer.

The performing the bit rearrangement on the first encoded bit sequence includes at least one operation of: changing a position of the first subsequence in the first encoded bit sequence, where the length of the first subsequence is a spreading factor A positive integer multiple; or, deleting the second subsequence in the first encoded bit sequence, the length of the second subsequence being a positive integer multiple of the spreading factor. The second subsequence includes at least one information bit.

The processor 801 may be further configured to obtain a post-punch sequence and a redundant interleaving sequence, where the post-punch sequence is a sequence obtained by puncturing the information bit sequence; the redundant interleaving sequence is to the first redundant sequence Performing a sequence of bit rearrangement; cascading the punctured sequence, the redundant interleaving sequence, and the second redundant sequence, thereby obtaining a bit first reordering bit sequence; wherein the information bit sequence is processed by the first to be processed The information bits included in the bit sequence are composed of redundant bits generated by encoding the first to-be-processed bit sequence using a core matrix of the LDPC check matrix, and the second redundant sequence is used by using LDPC The spreading matrix of the check matrix is composed of redundant bits generated by encoding the first bit sequence to be processed.

The processor 801 is further configured to reorder the sub-sequences included in the first redundancy sequence according to the selected interleaving pattern, where each sub-sequence encodes the information bit sequence by a column of check bits in the core matrix. The redundant bits are formed.

It should be noted that the data processing device can include one or more memories, and one or more processors, the memory storing instructions coupled to the memory for retrieving instructions in the memory to The various steps described in the various method embodiments above are performed.

Referring to FIG. 9, the present application is used for a system architecture of a transmitting side data processing system of an uplink.

As shown in FIG. 9, the system may include: a transport block CRC attachment module for performing CRC attachment on a transport block; a code block segmentation code block CRC attachment module, for Performing CRC attachment on the code block; wherein the code block may be generated by the code block by code block segmentation; an encoder module for encoding the code block, for example, may be used to implement the coding step in the foregoing embodiment. a bit re-ordering module for performing bit rearrangement on a sequence output by the encoding module. For example, the step of performing bit rearrangement on the encoded bit sequence in the foregoing embodiment may be implemented; rate matching a module for implementing the process of rate matching in the foregoing embodiments; for example, for implementing the foregoing embodiments, saving all or at least some bits of the encoded bit sequence to a circular buffer; saving from the circular buffer Steps of extracting an output bit sequence from the bits; a block interleaver module for matching rate after rate The bit sequence is interleaved, for example, may be used to implement the step of interleaving the output bit sequence in the foregoing embodiment; a code block concatenation module for cascading output bit sequence modules of each code block; for example, The first output bit sequence, the second output bit sequence, and the like may be outputted in the foregoing embodiment, and the data and control multiplexing module is added to the sequence of the code block cascade output. Data information or control information. The code block CRC attaching module and the column switching module are optional modules, and the system may not include the code block CRC attaching module or the column switching module.

In another implementation manner, the sub-block interleaving module, the code block cascading module, and the data and control information may also be added by the code block cascading module, the data and control information adding module, and the frequency domain interleaving as shown in FIG. The module is replaced. In still another implementation manner, the block interleaving module, the code block cascading module, and the data and control information adding module may also be a code block cascading module, a data and control information adding module, and a channel interleaving module as shown in FIG. Replaced. In both implementations, the code block cascading module can be used to cascade the bit sequence output by the rate matching module. For example, the step of generating a vector sequence can be implemented. The data and control information adding module can then implement the step of adding path-dependent signaling in the vector sequence. The frequency domain interleaving module may be configured to perform frequency domain interleaving on a sequence output by the code block cascading mode; for example, performing the step of interleaving the vector sequence in the foregoing embodiment. The channel interleaving module can be used to perform frequency domain interleaving on the sequence output by the code block concatenation module; for example, the step of interleaving the vector sequence in the foregoing embodiment is implemented.

Correspondingly, the uplink receiving data processing system system architecture can be as shown in FIG.

As shown in FIG. 12, the system may include: a control signaling detection module; a code block segmentation module; a de-block interleaver module; and a rate matching (de-) Rate matching module; HARQ combine module; decoder module; code block concatenation module; TB CRC caculation module.

The control information detecting module, the code block combining module, and the deblocking interleaving module may also be replaced by a frequency domain interleaving module, a control information detecting module and a code block dividing module as shown in FIG. 13; or, as shown in FIG. Decoding frequency domain interleaving module, control information detection module and code block segmentation module

The foregoing various modules are used to perform the inverse processing of the corresponding modules in the data processing system on the transmitting side, and the specific content will not be described herein.

15 to 17, a schematic structural diagram of a system for a transmitting side data processing system for a downlink according to the present application.

The transmission side data processing system system architecture for the downlink is similar to the transmission side data processing system system shelf for the uplink. However, since it is not necessary to transmit the associated channel signaling in the downlink, the transmitting side data processing system system for the downlink may not include the data and control information adding module.

Correspondingly, referring to FIG. 18 to FIG. 20, the system architecture of the receiving side data processing system for downlink is used in this application.

Since the channel-independent signaling is not required in the downlink, the transmission side data processing system system for the downlink may not include the control information detecting module.

In a specific implementation, the present application further provides a computer storage medium, wherein the computer storage medium may store a program, and the program may include some or all of the steps in the embodiments of the data processing method provided by the application. The storage medium may be a magnetic disk, an optical disk, a read-only memory (English: read-only memory, abbreviated as: ROM) or a random access memory (English: random access memory, abbreviation: RAM).

Those skilled in the art can clearly understand that the technology in the embodiments of the present application can be implemented by means of software plus a necessary general hardware platform. Based on such understanding, the technical solution in the embodiments of the present application may be embodied in the form of a software product in essence or in the form of a software product, and the computer software product may be stored in a storage medium such as a ROM/RAM. , a diskette, an optical disk, etc., including instructions for causing a computer device (which may be a personal computer, server, or network device, etc.) to perform the methods described in various embodiments of the present application or portions of the embodiments.

The same and similar parts between the various embodiments in this specification can be referred to each other. In particular, for the device embodiment, since it is basically similar to the method embodiment, the description is relatively simple, and the relevant points can be referred to the description in the method embodiment.

The embodiments of the present application described above are not intended to limit the scope of the present application.

Claims

A data processing method, comprising:

Obtaining a first to-be-processed bit sequence, where the first to-be-processed bit sequence is a code block generated by a transport block or a transport block after code block segmentation;

Encoding the first to-be-processed bit sequence to obtain a first encoded bit sequence;

Extracting the first output bit sequence from the bits held in the circular buffer;

The loop buffer is configured to save all bits or partial bits of the first encoded bit sequence, or the loop buffer is used to save all bits or partial bits of the first rearranged bit sequence, the first The rearranged bit sequence is obtained by bit rearranging the first encoded bit sequence.
The method according to claim 1, wherein said first reordering bit sequence is obtained by changing a position of said first subsequence in said first encoded bit sequence, said first subsequence having a length of a positive integer multiple of the expansion factor; or,

The first rearranged bit sequence is obtained by deleting a second subsequence in the first encoded bit sequence, and the length of the second subsequence is a positive integer multiple of the spreading factor.
The method of claim 1 or 2, wherein acquiring the first bit sequence to be processed comprises:

Obtain a transport block;

Generating N bit sequences including the first to-be-processed bit sequence based on the transport block, N being an integer greater than zero.
The method of any of claims 1 to 3, further comprising:

Interleaving the first output bit sequence.
The method of any of claims 1 to 3, further comprising:

Generating a vector sequence based on the first output bit sequence, where the vector sequence includes Q vectors of the first output bit sequence, and each of the first output bit sequence vectors includes the first output bit sequence At least one bit, wherein Q is a positive integer;

The vector sequence is interleaved.
The method of claim 5 wherein:

The vector sequence also includes a vector generated based on the second output bit sequence; each vector of the second output bit sequence includes at least one bit of the second output bit sequence.
The method of claim 5 or 6, wherein interleaving the sequence of vectors comprises:

Interleaving the vectors contained in the vector sequence.
The method of claim 5 or 6, wherein interleaving the sequence of vectors comprises:

Performing sub-vector intra-sequence interleaving on each sub-vector sequence included in the vector sequence to obtain M inter-subsequence sub-sequences, wherein the vector sequence includes M sub-vector sequences, and each of the sub-vector sequences includes a vector The number is a positive integer multiple of the vector contained in the intra-channel time domain symbol used to transmit the transport block within one transmission time interval.
A data processing method for a communication system, comprising:

Obtaining an input bit sequence A, the input bit sequence A being obtained based on at least one set of output bit sequences;

Wherein each set of output bit sequences includes at least one output bit sequence, and each output bit sequence in each set of output bit sequences is generated based on each code block in the same code block group;

The input bit sequence A is interleaved.
The method of claim 9 wherein:

Each of the output bit sequences is obtained from a circular buffer, wherein

The cyclic buffer is configured to save all or part of the bits obtained by encoding the code block corresponding to each of the output bit sequences, or the cyclic buffer is configured to save the code block corresponding to each of the output bit sequences. And all or part of the bits obtained after the bit rearrangement.
A data processing method for a communication system, comprising:

Obtaining Q vectors based on P output bit sequences;

Obtaining an input vector sequence A, the input vector sequence A comprising the Q vectors;

Interleaving the input vector sequence A;

Wherein P is an integer greater than 0, and Q is an integer greater than 0, and each of the output bit sequences corresponds to a code block obtained by the code block partitioning of the transport block.
The method according to claim 11, wherein the obtaining Q vectors based on the P output bit sequences comprises:

Interleaving the P output bit sequences separately to obtain P interleave bit sequences;

The Q vectors are obtained based on the P interleaved bit sequences.
Method according to claim 11 or 12, characterized in that

The P is the number of code blocks obtained after the code block is divided by the code block.
Method according to claim 11 or 12, characterized in that

The Q is a positive integer multiple of a vector contained in a time domain symbol within a channel for transmitting the transport block within a transmission time interval.
Method according to claim 11 or 12, characterized in that

The P is the number of code blocks included in at least one of the G code block groups obtained after the code block is divided by the code block.
A method according to any one of claims 11 to 15, wherein

Each of the output bit sequences is obtained from a circular buffer, wherein

The loop buffer is configured to save all or part of the bits obtained by encoding the code block corresponding to the output bit sequence, or

The circular buffer is configured to save all or part of the bits obtained after the code block corresponding to the output bit sequence is encoded and bit rearranged.
A data processing device, comprising:

An acquiring unit, configured to acquire a first to-be-processed bit sequence, where the first to-be-processed bit sequence is a transport block or a code block generated after the code block is divided;

a coding unit, configured to encode the first to-be-processed bit sequence to obtain a first coded bit sequence;

An output unit, configured to extract a first output bit sequence from the loop buffer;

The loop buffer is configured to save all bits or partial bits of the first encoded bit sequence, or the loop buffer is used to save all bits or partial bits of the first rearranged bit sequence, the first The rearranged bit sequence is obtained by bit rearranging the first encoded bit sequence.
The method according to claim 17, wherein said first reordering bit sequence is obtained by changing a position of said first subsequence in said first encoded bit sequence, said first subsequence having a length of a positive integer multiple of the expansion factor; or,

The first rearranged bit sequence is obtained by deleting a second subsequence in the first encoded bit sequence, and the length of the second subsequence is a positive integer multiple of the spreading factor.
The data processing device according to claim 17 or 18, wherein the obtaining unit comprises:

Obtaining a subunit for obtaining a transport block;

Generating a subunit for generating N bit sequences including the first to-be-processed bit sequence based on the transport block, where N is an integer greater than zero.
The data processing device according to any one of claims 17 to 19, further comprising:

The first interleaving unit is configured to interleave the first output bit sequence.
The data processing device according to any one of claims 17 to 19, further comprising:

a second interleaving unit, configured to generate a vector sequence based on the first output bit sequence, where the vector sequence includes Q vectors of the first output bit sequence, and each vector of the first output bit sequence includes At least one bit of the first output bit sequence, wherein Q is a positive integer; interleaving the vector sequence.
A data processing device according to claim 21, wherein

The vector sequence also includes a vector generated based on the second output bit sequence; each vector of the second output bit sequence includes at least one bit of the second output bit sequence.
A data processing device according to claim 21 or 22, wherein

The second interleaving unit is specifically configured to interleave a vector included in the vector sequence.
A data processing device according to claim 21 or 22, wherein

The second interleaving unit is specifically configured to perform intra-sub-interleaving on each sub-vector sequence included in the vector sequence to obtain M inter-subsequence sub-sequences, where the vector sequence includes M sub-vector sequences, each The number of vectors included in one of the sub-vector sequences is a positive integer multiple of the vector contained in the intra-channel time domain symbols used to transmit the transport block within one transmission time interval.
A data processing device, comprising:

An obtaining unit, configured to obtain an input bit sequence A, the input bit sequence A being obtained based on at least one set of output bit sequences, wherein each set of output bit sequences includes at least one output bit sequence, each set of output bit sequence groups Each of the output bit sequences is generated based on each code block in the same code block group;

An interleaving unit is configured to interleave the input bit sequence A.
A data processing apparatus according to claim 25, wherein said data processing device further comprises an output unit for acquiring each of said output bit sequences from a circular buffer, wherein each of said output bits sequence,

The cyclic buffer is configured to save all or part of the bits obtained by encoding the code block corresponding to each of the output bit sequences, or the cyclic buffer is configured to save the code block corresponding to each of the output bit sequences. And all or part of the bits obtained after the bit rearrangement.
A data processing device, comprising:

Generating unit, configured to obtain M vectors based on the N output bit sequences;

An obtaining unit, configured to acquire an input vector sequence A, where the input vector sequence A includes the M vectors;

An interleaving unit, configured to interleave the sequence of input vectors A;

Where N is an integer greater than 0, and M is an integer greater than 0, and each of the output bit sequences corresponds to one code block obtained by the code block partitioning of the transport block.
A data processing device according to claim 27, wherein said generating unit is specifically for

Interleaving the N output bit sequences separately to obtain N interleave bit sequences;

The M vectors are obtained based on the N interleaved bit sequences.
The data processing device according to claim 27 or 28, wherein said N is a number of code blocks obtained by code block division of the transport block.
A data processing apparatus according to claim 27 or 28, wherein said M is a positive integer multiple of a vector contained in a time-domain symbol in the channel for transmitting said transport block within a transmission time interval.
The data processing device according to claim 27 or 28, wherein the N is a number of code blocks included in at least one of the G code block groups obtained by the code block division by the code block.
A data processing apparatus according to any one of claims 27 to 31, further comprising an output unit for respectively acquiring each of said output bit sequences from a circular buffer, wherein each of said outputs Bit sequence,

The cyclic buffer is configured to save all or part of the bits obtained by encoding the code block corresponding to each of the output bit sequences, or the cyclic buffer is configured to save the code block corresponding to each of the output bit sequences. And all or part of the bits obtained after the bit rearrangement.
A device for performing the method of any one of claims 1 to 16.
A communication device, comprising: a processor and a memory, the memory storing instructions coupled to the memory for retrieving instructions in the memory to perform as claimed in claim 1 The method of any of the 16 items.
A computer readable storage medium comprising instructions which, when executed on a computer, cause the computer to perform the method of any one of claims 1 to 16.
A computer program product, when run on a computer, causes the computer to perform the method of any one of claims 1 to 16.
A communication system comprising the data processing device of any one of claims 17 to 32.