WO2018103638A1

WO2018103638A1 - Data transmission method, sending device, receiving device and communication system

Info

Publication number: WO2018103638A1
Application number: PCT/CN2017/114637
Authority: WO
Inventors: 马亮; 郑晨; 熊杰; 曾歆; 刘晓健; 魏岳军
Original assignee: 华为技术有限公司
Priority date: 2016-12-07
Filing date: 2017-12-05
Publication date: 2018-06-14

Abstract

Disclosed are a data transmission method, sending device, receiving device and communication system. The sending device is used for sending a first transmission block, wherein the sending device acquires an encoded bit segment from a first encoded code block, the first encoded code block being obtained by means of performing, according to processing capacity of a receiving device, LDPC encoding on a first code block in the first transmission block; and the sending device sends the encoded bit segment to the receiving device. Since the processing capacity of the receiving device is taken into consideration, the storage overhead of the sending device or the receiving device can be reduced, and the complexity of encoding or decoding is reduced, thereby improving the success rate of decoding.

Description

Data transmission method, transmitting device, receiving device, and communication system

This application claims the priority of the Chinese Patent Application submitted to the China Patent Office on December 7, 2016, the application number is 201611117610.5, and the invention name is "Data Transmission Method, Transmission Equipment, Receiving Equipment, and Communication System". Priority of Chinese Patent Application No. 201510042967.X, entitled "Data Transmission Method, Transmission Device, Receiving Device, and Communication System", filed on the 20th of the present application, the entire contents of which are incorporated herein by reference. in.

Technical field

Embodiments of the present invention relate to the field of communications, and in particular, to a data transmission method, a transmitting device, a receiving device, and a communication system.

Background technique

In a communication system, information data is transmitted between a transmitting device (for example, a base station or a terminal) and a receiving device (for example, a terminal or a base station). Since the wireless propagation environment is complex and variable, it is susceptible to interference and errors occur. In order to reliably transmit the information data, the transmitting device performs CRC check, channel coding, rate matching, interleaving, and the like on the information data, and maps the interleaved coded bits into modulation symbols and transmits them to the receiving device. After receiving the modulation symbol, the receiving device recovers the information data by deinterleaving, de-rate matching, decoding, and CRC check. These processes can reduce transmission errors and improve the reliability of data transmission.

Low density parity check (LDPC) code is a kind of linear block coding with sparse check matrix, which has the characteristics of flexible structure and low decoding complexity. Because it uses a partially parallel iterative decoding algorithm, it has a higher throughput than the traditional Turbo code. The LDPC code is considered to be the next-generation error correction code of the communication system, and can be used to improve the reliability and power utilization of channel transmission; and can be widely applied to space communication, optical fiber communication, personal communication systems, ADSL, and magnetic recording equipment. At present, LDPC codes have been considered as one of channel coding methods in the fifth generation mobile communication.

An LDPC code commonly used in communication systems has special structural features, and its base matrix has m*n elements. If z is used as an extension factor, the check matrix H can be obtained as (m*z)*(n*). The matrix of z), that is, having m*n block matrices, each block is a z*z unit matrix obtained by cyclic shift. The spreading factor z is generally determined according to the code block size supported by the system and the size of the information data. As shown in FIG. 1, a base matrix of an LDPC code having a QC structure of m=13 and n=38 has a code rate of (n-m)/n=0.6579. If the spreading factor is z=4, all elements with a value of -1 in the matrix are expanded to be a 4x4 all-zero matrix, and other elements are expanded to a 4*4 permutation matrix. The permutation matrix can be obtained by a unit matrix I after a corresponding number of cyclic shifts, the number of displacements being equal to the value of the corresponding matrix element. As shown in FIG. 1 , the corresponding matrix after the expansion of the element with a value of 0 in the base matrix is 4*4, and the corresponding matrix after the expansion of the element with a value of 1 is the matrix obtained by one displacement of the unit matrix. , and so on, will not go into details here.

After the base matrix is expanded, it can be used as a check matrix for LDPC code encoding. A code length is n, the information sequence length is k, and the LDPC code recorded as (n, k) can be uniquely determined by the check matrix H. The check matrix H is a sparse matrix, and each row represents a check equation constraint, corresponding to j coded bits, each column indicating that one coded bit is constrained by m check equations, and any two check equations contain at most one identical coded bit. An example of a check matrix H of an LDPC code and its corresponding check equation is given by the following equation (1):

The check matrix H can also be represented by a Tanner graph. Each column in the H matrix can be used as a variable node, corresponding to a coded bit. In the above example, each of v ₀ , v ₁ ,..., v ₉ , H matrix A row can be used as a check node, in the above example, c ₀ , c ₁ , ..., c ₄ . Each line between the check node and the variable node may indicate that there is a non-zero element at the intersection of the row and column corresponding to the two nodes.

Taking the check matrix of an LDPC code shown in FIG. 2 as an example, a core matrix and three extended matrix parts are included. For the information data, four check matrices can be used for encoding and decoding: the core matrix, the core matrix and the check matrix 1 composed of the extended matrix portion 1, the core matrix, the extended matrix portion 1 and the extended matrix portion 2 The matrix 2, the core matrix, the extended matrix portion 1, the extended matrix portion 2, and the extended matrix portion 3 constitute a complete matrix. These check matrices have a Raptor-like structure, and the check bits have a double-diagonal and single-column double structure. If the number of information bits before encoding is k, and the code length of the LDPC coded code block generated according to the check matrix is n, the code rate is k/n, and encoding with different check matrices can obtain LDPCs with different code rates. Encoded code block. It can be seen that the LDPC code generated according to the complete matrix has the largest code length and the lowest code rate R _min ; the LDPC code generated according to the core matrix has the smallest code length and the highest code rate R _max , and the LDPC generated according to the check matrix 1 The code has a code rate of R ₁ , and the code rate of the LDPC code generated by the check matrix 2 is R ₂ , and then R _min <R ₂ <R ₁ <R _max . It should be noted that, in the above example, the complete matrix, the core matrix, the check matrix 1 or the check matrix 2 may all be used as a matrix of the base matrix of the LDPC code according to the spreading factor.

Since LDPC coding is used, a base matrix of different code rates can be selected, and for the same base matrix to be extended, a check matrix of different sizes can be selected for encoding and decoding. The larger the check matrix is, the more coded bits are generated by the information data, and the lower the code rate, the more complicated the decoding and storage overhead of the receiving device 31.

Summary of the invention

In view of this, the embodiment of the present invention provides a data transmission method, a sending device, a receiving device, and a communication system, so as to reduce the storage overhead of the sending device or the receiving device when using LDPC as the channel coding mode, and reduce coding or The complexity of decoding increases the decoding success rate.

In a first aspect, a data transmission method is provided for a communication system using a low density parity check LDPC code, the communication system comprising a transmitting device and a receiving device, the transmitting device for transmitting a first transport block, The first transport block includes a first code block, including:

The sending device obtains the encoded bit segment from the first coded code block, where the first coded code block is obtained by processing the first code block according to the processing capability of the receiving device;

The transmitting device sends the encoded bit segment to the receiving device.

Since the sending device determines the size of the coded block based on the processing capability of the receiving device, and selecting the transmitted coded bit segment, the storage overhead of the receiving device can be saved, and the decoding complexity of the receiving device can be reduced.

In a second aspect, a data transmission method is provided for a communication system using a low density parity check LDPC code, the communication system comprising a transmitting device and a receiving device, the transmitting device for transmitting a first transport block, The first transmission The block includes a first code block, including:

Receiving, by the receiving device, an encoded bit segment from the sending device;

Receiving, by the receiving device, the soft value bits of the encoded bit segment in a soft information buffer of the receiving device;

The receiving device performs LDPC decoding on the soft information buffer to obtain the first code block, where the coded bit segment is obtained by the sending device from the first coded code block, the first code The code block is obtained by the sending device processing the first code block according to the processing capability of the receiving device.

Since the sending device determines the size of the coded block based on the processing capability of the receiving device, and selects the transmitted coded bit segment, the receiving device receiving the coded bit segment decoding can save the storage overhead of the receiving device and reduce the decoding complexity of the receiving device.

In the above aspect, the processing capability of the receiving device includes a maximum transport block size N _IR that can be supported by the soft information buffer of the receiving device, and a size of the first encoded code block.

The number of code blocks included in the first transport block is C, and the size of the loop buffer of the sending device is _Kw ; or

The processing capability of the receiving device includes a lowest decoding code rate R _t supported by the receiving device, and a size of the first coded code block.

Where K _{IR, send} is the first transport block size, the number of code blocks included in the first transport block is C, and the loop buffer size of the sending device is K _w ; or

The processing capability of the receiving device includes a maximum coded block size N _CB,t supported by the receiving device _, and a size of the first coded block N _CB =min(K _W , N _CB,t ), where The circular buffer size of the sending device is _Kw .

The transmitting device can determine the coded block size based on the processing capabilities of different receiving devices, and can implement flexible control.

In a possible implementation manner of the foregoing aspect, the first start position S _i of the coded bit segment of length n _i in the first code block is determined according to the redundancy version RV _j ;

Where i is an integer greater than or equal to 0, i is 0 for initial transmission, i is greater than 0 for ith retransmission, j is an integer, and 0 ≤ j < j _max , j _max is the transmitting device and the a maximum number of redundancy versions between the receiving devices, where the starting positions corresponding to the j _max redundancy versions are equally spaced in the first coded code block, and the starting position of the RV ₀ is the first code The position of the pth bit in the code block, and p is an integer greater than or equal to 0.

In another possible implementation manner of the foregoing aspect, the first starting position S _i of the coded bit segment of the length n _i in the first coded code block is a coded bit segment acquired according to a previous transmission. Corresponding starting position S _i-1 and the length n _i-1 of the encoded bit segment acquired by the previous transmission, wherein the initial starting position S ₀ is the p _- th bit of the first coded block position, or a length of n _i of the coded bits of the first segment of encoded code blocks in a first starting position S _i based on the initial transmission start position S _0, the initial transmission of the encoded bit length of the segment n ₀ and the number of retransmissions i is determined, wherein the initial position S ₀ of the initial transmission is the position of the pth bit of the first coded code block.

Optionally, p=z·l, where z is a spreading factor of the LDPC check matrix corresponding to the first coded code block, and l is a positive integer. Optionally, l may be 1, 2, or 3. One.

The above implementation manner can flexibly determine the starting position of the coded bit segment of the initial transmission or the retransmission.

In the above implementation manner, the position of the soft value bit in the soft information buffer of the receiving device and the bit position of the coded bit segment in the first coded code block are in one-to-one correspondence.

In any implementation manner of the foregoing aspect, optionally, the sending device may flexibly select a matrix for encoding to match the first a size of an encoded code block, where the first coded code block is obtained by matching a size of the first coded code block after the first code block is encoded by a complete matrix of the LDPC code; or, the first code block The coded code block is obtained by encoding the first code block by the check matrix of the LDPC code, wherein the check matrix of the LDPC code is determined according to the size of the first coded code block.

In the foregoing implementation manner, the complete matrix of the LDPC code includes a built-in punctured column, or the check matrix of the LDPC code includes a built-in punctured column, and the coded bits corresponding to the built-in punctured column are not included in the first coded code block. Usually, the built-in punctured column is a complete matrix of the LDPC code or a column with a large column weight in the check matrix.

In any implementation manner of the foregoing method, if n _i ≥ N _CB , the first coded code block is the LDPC base matrix of the first code block according to the 0th column of the check matrix after the expansion factor z is expanded. The matrix of the Nth _CB -1 column is encoded; or,

If n _i <N _CB and S _i +n _i -1<N _CB , the S _i to S _i +n _i -1 coded bits in the first coded code block are the same as the first code block according to a first LDPC matrix substrate S after the check matrix expanded spreading factor z -1 in a column corresponding to column _i coded bits through S _{_i} + n _i; or

If n _i <N _CB and S _i +n _i -1≥N _CB , the S _i to N _CB -1 coded bits in the first code block are an LDPC basis matrix of the first code block according to a first column of the parity check matrix S _i after expansion factor z is expanded through N _CB -1 coded bits corresponding to the columns, a first coded code blocks 0 through _{_{n i - (N CB -1-}} S i) coded bits are parity check matrix after the matrix base LDPC code block according to a first spreading factor z deployment of 0 through _{_{n i - (N CB -1-}} S i) coded bits corresponding to columns.

By encoding in this way, the length of the bit segment per code is equal to the number of bits actually transmitted, and the complexity of the coding of the transmitting device is reduced.

Further, in another possible implementation manner of the foregoing aspect, the receiving device determines a decoding code rate of the soft information buffer, determines a first check matrix according to the decoding code rate, and caches the soft information. The first code block is obtained by decoding the first check matrix. Since the receiving device can select the check matrix decoding according to the decoding code rate, the decoding complexity is reduced.

A third aspect provides a sending device, configured to send a first transport block, where the first transport block includes a first code block, including:

a rate matcher, configured to obtain an encoded bit segment from the first coded code block, where the first coded code block is obtained by processing the first code block according to processing capability of the receiving device ;

And a transceiver, configured to send the coded bit segment to the receiving device.

The transmitting device may be used to perform the method described in the above aspects, with particular reference to the description of the above aspects.

In one possible design, the transmitting device provided by the present application may include a module for performing the behavior of the transmitting device in the above method design. The module can be software and/or hardware.

In a fourth aspect, a receiving device is provided, including:

a transceiver, configured to receive a coded bit segment from the sending device;

a rate-matching unit, configured to save the soft-valued bits of the encoded bit segment in a soft information buffer of the receiving device;

a decoder, configured to perform LDPC decoding on the soft information buffer to obtain the first code block, where the coded bit segment is obtained by the sending device from a first coded code block, where An encoded code block is obtained by the sending device processing the first code block according to processing capability of the receiving device.

The receiving device can be used to perform the method described in the above aspects, with particular reference to the description of the above aspects.

In one possible design, the receiving device provided by the present application may include a module for performing the behavior of the transmitting device in the above method design. The module can be software and/or hardware.

A fifth aspect provides a data transmission method for a communication system using an LDPC code, the communication system including a transmitting device and a receiving device, including:

The sending device obtains the redundant version RV _j sent;

The transmitting device determines, according to the redundancy version RV _j , a first starting position S _{i of the} encoded bit segment in the first coded code block;

The transmitting device acquires, as the encoded bit segment, an encoded bit segment of length n _i from a first starting position S _i in the first coded code block;

Transmitting, by the sending device, the encoded bit segment; wherein

i is an integer greater than or equal to 0, i is 0 for initial transmission, and i is greater than 0 for ith retransmission,

j is an integer, and 0 ≤ j < j _max , j _max is the maximum number of redundancy versions between the transmitting device and the receiving device, and the starting position corresponding to the j _max redundancy versions is The first coded code block is equally spaced, the starting position of RV _{0 is} the position of the pth bit in the first coded code block, and p is an integer greater than or equal to 0.

A sixth aspect provides a data transmission method for a communication system using an LDPC code, the communication system including a transmitting device and a receiving device, including:

The transmitting device determines a first starting position S _{i of the} encoded bit segment in the first coded code block;

Transmitting, by the sending device, the encoded bit segment;

Where i is an integer greater than or equal to 0,

If i=0, indicating initial transmission, then S ₀ is the position of the pth bit of the first coded block.

If i>0, it means the ith retransmission,

S _i =(S _i-1 +n _i-1 )%N _CB , where S _i-1 is the starting position corresponding to the encoded bit segment acquired by the previous transmission, and n _i-1 is acquired by the previous transmission The length of the encoded bit segment, or,

S _i =(p+i*n ₀ )%N _CB , n ₀ is the length of the coded bit segment obtained by the initial transmission, n _i =n ₀ .

In a seventh aspect, a data transmission method is provided for a communication system using a low density parity check LDPC code, the communication system comprising a transmitting device and a receiving device, wherein the method comprises:

The receiving device acquires the transmitted redundancy version RV _j ;

The receiving device determines, according to the redundancy version RV _j , a first starting position S _i of the soft value bit of the encoded bit segment in the soft information buffer;

The receiving device combines and stores the soft value bits of the coded bit segment from the first start position S _i in the soft information buffer, where the number of soft value bits is n _i ;

j is an integer, and 0 ≤ j < j _max , j _max is the maximum number of redundancy versions between the transmitting device and the receiving device, and the starting position corresponding to the j _max redundancy versions is The soft information buffer is equally spaced, the starting position of RV _{0 is} the position of the p-th soft bit in the soft information buffer, and p is an integer greater than or equal to 0.

In an eighth aspect, a data transmission method is provided for a communication system using a low density parity check LDPC code, the communication system comprising a transmitting device and a receiving device, wherein the method comprises:

The receiving device determines a first starting position S _i of the soft value bit of the encoded bit segment in the soft information buffer;

The receiving device merges and stores the soft value bits of the coded bit segment from the first start position S _i in the soft information buffer, where the number of soft value bits is n _i ;

Where i is an integer greater than or equal to 0,

If i=0, indicating initial transmission, then S ₀ is the position of the p-th soft bit of the soft information buffer.

If i>0, it means the ith retransmission,

S _i =(S _i-1 +n _i-1 )%N _CB , where S _i-1 is the starting position of the soft bit of the previously received encoded bit segment, and n _i-1 is the previous received The number of soft-valued bits of the encoded bit segment, or,

S _i =(p+i*n ₀ )%N _CB , n ₀ is the number of soft-valued bits of the coded bit segment received initially, n _i =n ₀ .

Optionally, in the above fifth to eighth aspects, p=z·l, where z is a spreading factor of the LDPC check matrix corresponding to the first coded code block, and l is a positive integer.

In any implementation manner of the foregoing seventh or eighth aspect, optionally, the sending device may flexibly select a matrix for encoding to match a size of the first coded code block, where the first coded code block is the first a code block is matched according to the size of the first coded code block after being coded by the LDPC code; or the first code block is obtained by encoding the first code block by the check matrix of the LDPC code The check matrix of the LDPC code is determined according to the size of the first coded code block. For how to determine the size of the first coded block, reference may also be made to the various implementations of the first to fourth aspects described above.

In a ninth aspect, a transmitting device is provided, including:

a rate matcher for obtaining the transmitted redundancy version RV _j ,

Determining, according to the redundancy version RV _j , a first starting position S _{i of the} encoded bit segment in the first coded code block,

Obtaining, as the encoded bit segment, an encoded bit segment of length n _i from a first start position S _i in the first coded code block, where

j is an integer, and 0 ≤ j < j _max , j _max is the maximum number of redundancy versions between the transmitting device and the receiving device, and the starting position corresponding to the j _max redundancy versions is The first coded code block is equally spaced, the starting position of RV _{0 is} the position of the pth bit in the first coded code block, and p is an integer greater than or equal to 0;

The transmitting device may be configured to perform the methods described in the fifth aspect above, with specific reference to the description of the foregoing aspects.

In a tenth aspect, a transmitting device is provided, including:

a rate matcher, configured to determine a first start position S _{i of the} coded bit segment in the first code block,

Obtaining, as the encoded bit segment, an encoded bit segment of length n _i from a first starting position S _i in the first coded code block,

Where i is an integer greater than or equal to 0,

If i>0, it means the ith retransmission,

S _i =(p+i*n ₀ )%N _CB , n ₀ is the length of the coded bit segment obtained by the initial transmission, n _i =n ₀ ;

And a transceiver, configured to send the encoded bit segment to a receiving device.

The transmitting device may be configured to perform the methods described in the sixth aspect above, with specific reference to the description of the foregoing aspects.

In one possible design, each transmitting device provided by the present application may include a module for performing the behavior of the transmitting device in the above method design. The module can be software and/or hardware.

In an eleventh aspect, a receiving device is provided, including:

a transceiver, configured to receive a coded bit segment from a transmitting device;

a rate matching device for obtaining a transmitted redundancy version RV _j ,

Determining, according to the redundancy version RV _j , a first starting position S _i of the soft value bit of the encoded bit segment in the soft information buffer,

And combining the soft value bits of the coded bit segment from the first start position S _i in the soft information buffer, where the number of soft value bits is n _i , where

The receiving device may be configured to perform the methods described in the seventh aspect above, with specific reference to the description of the above aspects.

According to a twelfth aspect, a receiving device is provided, including:

a rate-matching device, configured to determine a first starting position S _i of the soft-valued bit of the encoded bit segment in the soft information buffer,

And storing the soft value bits of the coded bit segment from the first start position S _i in the soft information buffer, where the number of soft value bits is n _i ,

Where i is an integer greater than or equal to 0,

If i>0, it means the ith retransmission,

The receiving device may be used to perform the methods described in the above eighth aspect, with specific reference to the description of the above aspects.

In one possible design, each receiving device provided by the present application may include a module for performing the behavior of the receiving device in the above method design. The module can be software and/or hardware.

According to a thirteenth aspect, an embodiment of the present invention provides a communication system, where the system includes the sending device and the receiving device in the foregoing aspect.

In still another aspect, an embodiment of the present invention provides a computer storage medium including a program designed to perform the above aspects.

The method, the sending device, the receiving device, and the communication system of the embodiments of the present invention use the LDPC code as the channel coding mode, and determine the size of the coded block based on the processing capability of the receiving device, and select the transmitted coded bit segment to save the receiving device. The storage overhead reduces the decoding complexity of the receiving device.

DRAWINGS

1 is a schematic diagram of a base matrix of an LDPC code and a permutation matrix thereof;

2 is a schematic structural diagram of a parity check matrix of an LDPC code;

3 is a structural diagram of a communication system according to an embodiment of the present invention;

4 is a flowchart of a data transmission method according to another embodiment of the present invention;

FIG. 5 is a schematic diagram of a first coded code block according to another embodiment of the present invention;

FIG. 6 is a flowchart of a data transmission method according to another embodiment of the present invention;

FIG. 7 is a structural diagram of a sending device according to another embodiment of the present invention;

FIG. 8 is a structural diagram of a receiving device according to another embodiment of the present invention.

detailed description

The technical solutions in the embodiments of the present invention will be clearly and completely described in conjunction with the accompanying drawings in the embodiments of the present invention. It is understood that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. example. All other embodiments obtained by those skilled in the art based on the embodiments of the present invention without creative efforts are within the scope of the present invention.

As shown in FIG. 3, the communication system 300 includes a transmitting device 30 and a receiving device 31. When transmitting the information data, the transmitting device 30 divides the information data into a plurality of transmission blocks (TBs) according to the size of the supported transport block. A CRC check is added to each transport block. If the transport block size after adding the check exceeds the maximum code block length, Then, the transport block needs to be divided into several code blocks (CBs), and the code block CRC check can also be added in each code block, and padding bits can also be added. The transmitting device 30 performs channel coding on each code block separately, for example, using LDPC coding to obtain a corresponding coded block. Each of the coded code blocks includes a plurality of information bits before encoding and parity bits generated by the code, and are collectively referred to as coded bits.

The coded code block is stored in the circular buffer of the transmitting device 30 after the sub-block is interleaved, and the transmitting device 30 selects a piece of coded bit to be transmitted from the circular buffer, that is, obtains an encoded bit segment, which is interleaved, mapped to a modulation symbol, and then transmitted. When the retransmission occurs, the sending device 30 selects another encoded bit segment to be sent from the circular buffer. If the data in the circular buffer is transmitted once, it returns to the front end of the circular buffer to re-encode the bit.

The receiving device 31 demodulates the received modulation symbols, and after deinterleaving, stores the soft values of the received encoded bit segments in corresponding positions in the soft buffer. If retransmission occurs, the receiving device 31 combines the soft values of the coded bit segments that are retransmitted each time in the soft information buffer. The merging here means that if the received coded bits are in the same position, they will be twice. The received soft values of the coded bits are combined. The receiving device 31 decodes all soft values in the soft information buffer to obtain code blocks of the information data.

It should be noted that, in various embodiments of the present invention, the sending device 30 may be a network device in a communication system, such as a base station, and the corresponding receiving device 31 may be a terminal. To facilitate understanding, some of the terms related to this application are described below.

In the present application, the terms "network" and "system" are often used interchangeably, but those skilled in the art can understand the meaning. A terminal is a device having a communication function, and may include a handheld device having a wireless communication function, an in-vehicle device, a wearable device, a computing device, or other processing device connected to a wireless modem. Terminals can be called different names in different networks, such as: user equipment, mobile stations, subscriber units, stations, cellular phones, personal digital assistants, wireless modems, wireless communication devices, handheld devices, laptops, cordless phones, Wireless local loop station, etc. For convenience of description, the present application is simply referred to as a terminal. A base station (BS), also referred to as a base station device, is a device deployed in a radio access network to provide wireless communication functions. The name of a base station may be different in different wireless access systems, for example, in a Universal Mobile Telecommunications System (UMTS) network, a base station is called a Node B, but in an LTE network. The base station is called an evolved NodeB (eNB or eNodeB), and other base stations may also adopt other names in the 5th generation network. The invention is not limited to this.

FIG. 4 is a flowchart of a data transmission method according to an embodiment of the present invention. The method is applicable to a communication system using an LDPC code, and the communication system includes a sending device 30 and a receiving device 31. The method includes:

401: The sending device 30 acquires an encoded bit segment from the first coded code block.

The transmitting device 30 can be configured to transmit a data transport block, such as a first transport block, which can be divided into at least one code block. The first coded code block may be obtained by the sending device 30 processing one code block in the first transport block, for example, the first code block, according to the processing capability of the receiving device 31. For example, the sending device 30 determines the size of the first coded code block according to the processing capability of the receiving device 31, and the sending device 30 obtains the second coded code block by using the LDPC full matrix code for the first code block, and then according to the size of the first coded code block. Matching the second coded code block to obtain a first coded code block. For another example, the sending device 30 determines the size of the first coded code block according to the processing capability of the receiving device 31, and the sending device 30 determines an LDPC check matrix according to the size of the first coded code block, and uses the check matrix to perform the first code block. The LDPC code obtains the first coded code block.

Further, if the LDPC complete matrix includes a built-in punctured column, the second coded block has a built-in punch The coded bits corresponding to the column, that is, the built-in punctured column, the coded bits obtained by encoding the first code block are deleted, and then the first coded code block is obtained according to the size of the first coded code block, that is, the first coded code block. The coded bits corresponding to the built-in punctured column are not included; or if the LDPC check matrix includes the built-in punctured column, the built-in punctured column needs to be deleted in the coded block obtained by encoding the first code block by using the LDPC check matrix. Corresponding coding bits, the first coded code block is obtained, that is, the coded bits corresponding to the built-in punctured column are not included in the first coded code block, and the code block size obtained by the LDPC check matrix coding is larger than the size of the first coded code block. Therefore, after the coded bits corresponding to the built-in punctured column are deleted, the code block size and the first coded code block size are equal.

Usually, the built-in punctured column is a LDPC complete matrix or a column with a large column weight in the LDPC check matrix.

402: The transmitting device 30 sends the encoded bit segment acquired in step 401 to the receiving device 31.

The processing capability of the receiving device 31 may be based on the size of the register, the capabilities of the decoder, etc., including but not limited to at least one of the following: the maximum transport block size N _IR that the soft information buffer of the receiving device 31 can support, the decoder supports The lowest decoding code rate R _t and the size of the largest code block supported by the receiving device 31 N _CB,t . Different values of these processing capabilities may be represented by different levels of the receiving device 31. For example, the receiving device 31 has a processing capability of the receiving device 31 as an example of a maximum transport block size N _{IR that} can be supported by the soft information buffer of the receiving device 31. The level of 31 is 1, and the maximum transport block size N _IR that the soft information buffer can support is 250,000 bits, the level is 2, and the maximum transport block size N _IR that the soft information buffer can support is 1000000 bits. It should be noted that the foregoing is merely illustrative and not limiting. A first to N _CB represents the size of encoded code blocks, the first code block coding size N _CB any of the disclosed formula can be determined by the following:

or,

N _CB = min(K _W , N _{CB, t} ).

Where K _w is the circular buffer size of the transmitting device 30, C is the number of code blocks included in the first transport block, and K _{IR, send} is the size of the first transport block,

It is rounded down, and min(.) takes the minimum value for the elements in parentheses.

It can be seen that the size of the first coded code block is less than or equal to the circular buffer size of the transmitting device 30, and the first coded code block obtained by using the LDPC check matrix code for the first code block is stored in the circular buffer, and the first code is saved. The circular buffer portion of the code block may also be referred to as a virtual buffer, and the size of the first coded code block may also be said to be the size of the virtual buffer of the transmitting device 30.

If the processing capability of the receiving device 31 is limited, the transmitting device 30 determines the size of the coded block based on the processing capability of the receiving device 31 when the coded block is initially transmitted or retransmitted, and selects the transmitted coded bit segment to save the receiving device 31. The storage overhead and the decoding complexity of the receiving device 31 are reduced.

For the encoder of the transmitting device 30, the size of the first coded code block and the size of the first code block determine the code rate of the encoder output, for example, for N _CB =min(K _W , N _CB,t ) In other words, the N _{CB is} limited by the size of the largest code block N _CB,t supported by the receiving device 31 _, and the code rate output by the encoder is determined by the size of the first code block. The larger the size of the first code block, the larger the encoder. The higher the code rate of the output; the smaller the size of the first code block, the lower the code rate of the encoder output.

The sending device 30 will perform the obtained coded bit segment, after being interleaved, mapped into a modulation symbol, and then sent to the receiving device. 31. Further, the transmitting device 30 can also punct the acquired coded bit segments to increase the code rate.

In an embodiment of the present invention, the transmitting device 30 may first determine the transmitted redundancy version RV _j and then determine the first starting position S of the coded bit segment to be acquired in the first coded code block according to the redundancy version RV _{j .} _i, and start getting the coded bits from the first segment of encoded code blocks in the first start position S _i. Where i is an integer greater than or equal to 0, i is 0 for initial transmission, i is greater than 0 for ith retransmission; 0 ≤ j<j _max , j _max is redundancy between transmitting device 30 and receiving device 31 The maximum number of versions. It should be noted that, here, the first coded code block may be the coded code block obtained by processing the first code block according to the method shown in FIG. 4, or may be the code obtained by processing the first code block by other means. Code block.

When the communication system supports retransmission, which redundancy version is negotiated between the transmitting device 30 and the receiving device 31, and which redundancy version is used each time the retransmission is transmitted. Each of the redundancy versions may be used to indicate a starting position of the coded bit segment in the first coded code block, and the transmitting device 30 obtains the coded bit segment from the start position. The decoding success rate of the receiving device 31 can be improved by transmitting different coded bit segments in the coded block each time. In order to make the lengths of the obtained coded bit segments close or equal for each transmission, the starting positions corresponding to the j _max redundancy versions may be distributed at different positions in the first coded code block, and are usually equally spaced. When the transmission device 30 first encoded initial transmission block, redundancy version is typically used RV _0, RV starting position ₀ S ₀ may be the position of the first encoded block of bits where p, where p is greater than or An integer equal to 0.

Taking the schematic diagram of the first coded code block shown in FIG. 5 as an example, the length of the first coded code block is 179 bits, and the column is written in the circular buffer in 7 rows and 26 columns, and the position of the first row of the 0th column starts. The starting position corresponding to RV ₀ is the 0th line of the 1st column, that is, the 7th bit, and the starting position corresponding to RV ₁ is the 0th line of the 7th column, that is, the 49th bit, and the starting position corresponding to RV ₂ For the 0th line of the 13th column, that is, the 91st bit, the starting position corresponding to RV ₃ is the 0th line of the 19th column, that is, the 133rd bit. It can be seen that the various redundancy versions are equally spaced. If the redundancy version used for transmission is RV ₀ , the transmitting device 30 reads the coded bit segments in the column order from the first column, that is, reads the coded bit segments having a length of 42 bits from the seventh bit. If the redundancy version used for transmission is RV ₃ , the transmitting device 30 reads the coded bit segments in column order starting from the 19th column. It should be noted that after the last bit is read by the transmitting device 30, it is further continued to return to the circular buffer. The starting position reads the 1st line of column 0, that is, reads the coded bit segment having a total length of 53 bits. It should be noted that the present invention is only a convenient example and is not limited thereto.

In another embodiment of the present invention, the sending device 30 may also send the length n _{i-1 of} the acquired coded bit segment from the previous start position S _i-1 corresponding to the acquired coded bit segment. Determining a starting position S _{i of the} currently transmitted encoded bit segment in the first coded code block. If i=0, that is, the transmitting device 30 performs initial transmission on the first coded code block, S ₀ may be the position of the pth bit in the first coded code block, where p is an integer greater than or equal to 0. If i>0, that is, the transmitting device 30 needs to retransmit the first coded code block, then S _i =(S _i-1 +n _i-1 )%N _CB , or alternatively, for the first coded code block If the lengths of the coded bit segments transmitted or retransmitted are equal, then S _i =(p+i*n ₀ )%N _CB , n ₀ is the length of the coded bit segment obtained by the initial transmission. It should be noted that the first coded code block may be the coded code block obtained by processing the first code block according to the method shown in FIG. 4, or may be the coded code processed by the first code block by other means. Piece.

In each of the above embodiments, since the size of the LDPC check matrix of the first coded code block is determined by the spreading factor z, the start position S ₀ =p of the initially transmitted coded bit segment may be based on the first coded code. The spreading factor of the LDPC check matrix of the block is determined, for example, p=z·l, where l is a positive integer and can generally take the

value

1, 2, 3. Taking the coded code block shown in FIG. 4 as an example, z=7, l=1, that is, the spreading factor of the LDPC check matrix corresponding to the first coded code block is 7, l=1, indicating that the 0th column is played. Hole, the coded bit segment is taken from the first column at the time of initial transmission. It should be noted that the embodiments herein are merely examples, and the embodiments of the present invention are not limited thereto.

Since the coded bit segments of the initial transmission or the retransmission can be flexibly selected, the decoding success rate can be further improved.

Optionally, based on the methods of the foregoing embodiments, in a communication system employing LDPC coding, the first coded code block can be obtained in various manners.

In an embodiment of the present invention, after determining the size N _CB of the first coded code block, the sending device 30 may process the first code block according to the size of the first coded code block to obtain the first coded code block. In this way, rate matching and channel coding are not coupled.

For example, the sending device 30 may encode the first code block by using a complete matrix of the LDPC code to obtain a second coded code block, and then obtain the first coded code block according to the size of the first coded code block. For example, the second code may be used. code block 0th to (N _{_CB} -1) N _CB bits among coded bits as a first encoded code blocks.

For example, the sending device 30 may also determine a check matrix of the LDCP code according to the size of the first coded code block. For example, an LDCP check matrix with a column number less than or equal to N _CB may be determined, and the check matrix pair is used. The code block is encoded to obtain a first coded code block.

It should be noted that the above description is only for convenience of description, and the embodiments of the present invention are not limited thereto.

In another embodiment of the present invention, channel coding and rate matching may also be coupled together, and the length n _i of the coded bit segment to be transmitted and the length of the coded bit segment in the first coded code block are determined in rate matching. After the start position S _i , the channel coding performs LDPC encoding on the code block according to the length n _{i of} the coded bit segment and the start position S _{i of} the coded bit segment in the first code block, and obtains the first code block, and then obtains To the coded bit segment to be sent.

The length of the coded bit segment to be transmitted is n _i ≥ N _CB . In this case, if the size of the first code block is less than or equal to the length of the transmitted code segment, the base matrix can be selected to be expanded according to the expansion factor z. The first code block is obtained by encoding the first code block from the 0th column to the Nth _CB -1 column in the matrix to obtain the first coded code block. The coded bit segment to be transmitted may acquire n _i coded bits from the start position S _{i of the} first coded code block, and if the N _CB -1 bits have been reached, continue to return from the position of the 0th bit Obtained until the number of acquired bits is equal to the length n _{i of the} encoded bit segment. For example, the first coded code block size N _CB is 200, the coded bit segment length n _i to be transmitted is 400, the start position S _i is 100, and the coded bit segment is the 100th to 199th coded bits, and the 0th to The 199th coded bit, and the coded bit segment composed of the 0th to 99th coded bits. It should be noted that the examples herein are only examples and are not limited thereto.

If the length of the coded bit segment to be transmitted is n _i <N _CB and S _i +n _i -1<N _CB , then the S _i to S _i +n _i -1 coded bits in the first code block are according to a first base matrix check matrix S after spreading factor z deployment of S _{_i} + n _i -1 columns of coded bits corresponding to the _i-th column. In a possible implementation manner, the selection base matrix may perform the first code block according to the check matrix formed by the S _i column to the S _i +n _i -1 column in the check matrix after the expansion factor z is expanded. Encoding to obtain an encoded code block, wherein the S _i to the S _i +n _i -1 coded bits are the S _i column to the S _i +n _i -1 in the check matrix of the base matrix expanded according to the spreading factor z The coded bits corresponding to the column. In another possible implementation manner, the first matrix may be selected from the S _i column to the S _i +n _i -1 column in the check matrix expanded by the expansion factor z. The block is encoded to obtain n _i coded bits. N _i bits which can also be called a parity check matrix of the S matrix according to the group to expand the expansion factor z _i-th column to S _{_i} + n _i -1 coded bits corresponding to the column.

If the length of the coded bit segment to be transmitted is n _i < N _CB , and S _i + n _i -1 ≥ N _CB , then the S _i to N _{C B} -1 coded bits in the first code block are aligned with the base matrix. expansion of the S factor z check matrix expanded through the column _i N _CB -1 coded bits corresponding to the columns, a first coded code blocks 0 through _{_{n i - (N CB -1-}} S i) encoding bits are parity check matrix and the spreading factor group matrix according to the first deployment z 0 through _{_{n i - (N CB -1-}} S i) coded bits corresponding to columns. The implementation can also refer to the foregoing embodiment.

In the above embodiment, since the number of encoded bits is equal to the number of bits actually to be transmitted, the invalid encoding operation of the transmitting device 30 can be reduced.

FIG. 6 is a flowchart of a data transmission method according to an embodiment of the present invention. The method is applicable to a communication system using an LDPC code, and the communication system includes a sending device 30 and a receiving device 31. The method includes:

601: The receiving device 31 receives the encoded bit segment.

The coded bit segment received by the receiving device 31 is obtained by the transmitting device 30 from the first coded code block, and the first coded block is processed by the transmitting device 30 according to the processing capability of the receiving device 31. After getting it. Therefore, the encoded bit segment received by the receiving device 31 does not exceed its processing capability.

For details about the processing capability of the receiving device 31 and the size of the first coded block, refer to the foregoing embodiment, and details are not described herein again.

602: The receiving device 31 combines the soft value bits of the encoded bit segment received in step 601 in the soft information buffer of the receiving device 31;

The soft information buffer of the receiving device 31 is used to store a soft channel bit of the coded bit. For example, the coded bit sent by the transmitting device 30 is 1. After the channel transmission, the receiving device 31 obtains its corresponding soft value bit of 1.45. If the position of the coded bit in the first coded code block is the 5th bit, the 5th soft value bit in the soft information buffer of the receiving device 31 is 1.45. It should be noted that the description herein is merely an example, and the embodiment of the present invention is not limited thereto.

It can be seen that the position of each soft value bit in the soft information buffer of the receiving device 31 is in one-to-one correspondence with the position of each coded bit of the first coded code block.

In an embodiment of the present invention, the receiving device 31 acquires the transmitted redundancy version RV _j , and determines, according to the redundancy version RV _j , the first starting position S _i of the soft value bit of the encoded bit segment in the soft information buffer, The receiving device 31 merges and stores the soft value bits of the coded bit segment from the first start position S _i in the soft information buffer, wherein the number of soft value bits is n _i . Here, i is an integer greater than or equal to 0, i is 0 for initial transmission, and i is greater than 0 for ith retransmission. j is an integer, and 0 ≤ j < j _max , j _max is the maximum number of redundancy versions between the transmitting device 30 and the receiving device 31, and the starting position corresponding to the j _max redundancy versions The soft information buffer is equally spaced, and the starting position of RV _{0 is} the position of the p-th soft bit in the soft information buffer, and p is an integer greater than or equal to 0.

In yet another embodiment of the invention, the receiving device 31 determines that the received bit soft values in a first starting position S soft information cache _i, soft information from the first cache start position S _i stores the received combined Soft value bits, the number of soft value bits is n _i . Where i is an integer greater than or equal to 0. If i=0, indicating initial transmission, then S ₀ is the position of the p-th soft-valued bit of the soft information buffer. If i>0, it indicates the ith retransmission, S _i =(S _i-1 +n _i-1 )%N _CB , where S _i-1 is the starting position of the previously received soft value bit, and n _i-1 is the previous received soft value bit Number, or,

S _i =(p+i*n ₀ )%N _CB , n ₀ is the number of soft-valued bits received initially, n _i =n ₀ .

The receiving device 31 determines the starting position of the soft-valued bits of the received coded bit segment. Reference may also be made to the foregoing embodiment, and details are not described herein again.

If the coded bit segments acquired by the transmitting device 30 include n coded bits, the receiving device 31 may acquire n corresponding soft value bits. If the receiving device 31 receives the coded bits of the same location twice, the two soft values are combined, for example, the first soft value bit is 1.45, the second soft value bit is 0.5, and the combined value is 1.95. It should be noted that the examples are merely examples and are not limited thereto.

603: The receiving device 31 decodes the soft value bits in the soft information buffer to obtain the first code block.

Since the soft information buffer stores one or more merged soft value bits, the receiving device 31 needs to determine the decoding code rate of the soft value bits stored in the soft information buffer every time decoding, and determines according to the decoding code rate. An LDPC check matrix, here is a first check matrix, and the check matrix does not need to be identical to the check matrix used by the transmitting device 30 to encode the first code block, but when the soft value bits are small, the school The size of the matrix is also correspondingly small. Thereby, the complexity of decoding by the receiving device 31 can be reduced.

The receiving device 31 decodes the soft bit sample in the soft information buffer to decode the first check matrix to obtain the first code block. If the decoding is successful, the receiving device 31 will obtain the first code block and send an acknowledgement (ACK) to the sending device 30. After receiving the ACK, the transmitting device 30 may not retransmit the first coded block and continue processing the next. Code block. If the decoding is identified, the receiving device 31 will send a negative acknowledgement (NACK) to the transmitting device 30. After receiving the NACK, the transmitting device 30 will perform retransmission if the maximum number of retransmissions is not exceeded, in the first coded block. The selected coded bit segment is sent to the receiving device 31.

According to the method provided by the embodiment of the present invention, when the transmitting device 30 determines the size of the coded block based on the processing capability of the receiving device 31 and selects the transmitted coded bit segment, the receiving device 31 can save the receiving device 31. The storage overhead and the decoding complexity of the receiving device 31 are reduced.

Fig. 7 is a block diagram showing the structure of a transmitting apparatus which can be applied to the communication system shown in Fig. 3. Transmitting device 30 may include one or more transceivers 303, which may also be referred to as transceiving units, transceivers, or transceiver circuits, and the like. The transceiver 303 is mainly used for transmitting and receiving radio frequency signals, for example, for transmitting the encoded bit segments described in the foregoing embodiments to the receiving device 31. The encoder 301 is mainly used for encoding the information data, and the rate matcher 302 is mainly used for selecting the transmitted coded bit segment, for example, for selecting the coded bit segment for the first coded code block described in the above embodiment. The transmitting device 30 may also include other devices, such as means for generating a transport block CRC, a device for code block splitting and CRC check, an interleaver, a modulator, etc., which may be used to implement each of the transmitting devices 30 of FIG. 3, respectively. Some features.

In one example, rate matcher 302 can include a memory 3021 and a processor 3022. The memory 3021 is used to store necessary instructions and data. For example, the memory 3021 stores the first coded code block in the above embodiment. The processor 3022 is configured to perform necessary actions according to the instructions stored in the memory 3021, for example, to control the action of the transmitting device as shown in the portion of FIG. 4, and the control encoder 301 performs the first code block according to the processing capability of the receiving device 31. LDPC encoding, control rate matcher 302 obtains the encoded bit segments from the first coded code block.

It should be noted that the transmitting device 30 may include one or more memories and processors for implementing various functions of the transmitting device as in FIG. The memory and processor can be set individually for each device. It is also possible that multiple devices share the same memory and processor.

FIG. 8 is a schematic structural diagram of a receiving device, which can be applied to the communication system shown in FIG. System. The receiving device 31 may include one or more transceivers 313, which may also be referred to as transceiver units, transceivers, or transceiver circuits, and the like. The transceiver 313 is mainly used for transmitting and receiving radio frequency signals, for example, the receiving and transmitting device 30 transmits the encoded bit segments described in the foregoing embodiments. The decoding code 311 is mainly used for decoding the received signal, for example, for decoding soft value bits in the soft information buffer, and the de-rate matching unit 312 is mainly used for combining soft value bits, for example, for implementing the above. The soft-valued bits of the encoded bit segments described in the example are combined and stored in the soft information buffer. The receiving device 31 may also include other devices, such as means for transport block CRC check, block merging, deinterleaver, demodulator, etc., respectively, for implementing portions of the receiving device 31 of FIG. Features.

In one example, the de-rate matcher 312 can include a memory 3112 and a processor 3122. The memory 3121 is used to store necessary instructions and data. For example, the memory 3121 stores the soft value bits in the above embodiment. The processor 3122 is configured to perform necessary actions according to the instructions stored in the memory 3121, for example, to control the action of the receiving device as shown in the portion of FIG. 6, control the de-rate matcher 312 to merge and save the soft-valued bits, and control the decoder 311. The soft value bits are LDPC decoded.

It should be noted that the receiving device 31 may include one or more memories and processors for implementing various functions of the receiving device 31 in FIG. The memory and processor can be set individually for each device. It is also possible that multiple devices share the same memory and processor.

It is also understood by those skilled in the art that the various illustrative logical blocks and steps listed in the embodiments of the present invention can be implemented by electronic hardware, computer software, or a combination of both. Whether such functionality is implemented by hardware or software depends on the design requirements of the particular application and the overall system. A person skilled in the art can implement the described functions using various methods for each specific application, but such implementation should not be construed as being beyond the scope of the embodiments of the present invention.

The various illustrative logic units and circuits described in the embodiments of the invention may be implemented by a general purpose processor, a digital signal processor, an application specific integrated circuit (ASIC), a field programmable gate array (FPGA) or other programmable logic device. Discrete gate or transistor logic, discrete hardware components, or any combination of the above are designed to implement or operate the functions described. A general purpose processor may be a microprocessor. Alternatively, the general purpose processor may be any conventional processor, controller, microcontroller, or state machine. The processor may also be implemented by a combination of computing devices, such as a digital signal processor and a microprocessor, a plurality of microprocessors, one or more microprocessors in conjunction with a digital signal processor core, or any other similar configuration. achieve.

The steps of the method or algorithm described in the embodiments of the present invention may be directly embedded in hardware, a software unit executed by a processor, or a combination of the two. The software unit can be stored in RAM memory, flash memory, ROM memory, EPROM memory, EEPROM memory, registers, hard disk, removable disk, CD-ROM, or any other form of storage medium in the art. Illustratively, the storage medium can be coupled to the processor such that the processor can read information from the storage medium and can write information to the storage medium. Alternatively, the storage medium can also be integrated into the processor. The processor and the storage medium may be disposed in an ASIC, and the ASIC may be disposed in the UE. Alternatively, the processor and the storage medium may also be located in different components in the UE.

Through the description of the above embodiments, those skilled in the art can clearly understand that the present invention can be implemented in hardware, firmware implementation, or a combination thereof. When implemented in software, the functions described above may be stored in or transmitted as one or more instructions or code on a computer readable medium. Computer readable media includes both computer storage media and communication media including any medium that facilitates transfer of a computer program from one location to another. The storage medium can be any available medium that the computer can access. quality. By way of example and not limitation, computer readable media may comprise RAM, ROM, EEPROM, CD-ROM or other optical disk storage, disk storage media or other magnetic storage device, or can be used for carrying or storing in the form of an instruction or data structure. The desired program code and any other medium that can be accessed by the computer. Also. Any connection may suitably be a computer readable medium. For example, if the software is transmitted from a website, server, or other remote source using coaxial cable, fiber optic cable, twisted pair, digital subscriber line (DSL), or wireless technologies such as infrared, radio, and microwave, then the coaxial cable , fiber optic cable, twisted pair, DSL, or wireless technologies such as infrared, wireless, and microwave are included in the fixing of the associated media. As used in the present invention, a disk and a disc include a compact disc (CD), a laser disc, a compact disc, a digital versatile disc (DVD), a floppy disk, and a Blu-ray disc, wherein the disc is usually magnetically copied, and the disc is The laser is used to optically replicate the data. Combinations of the above should also be included within the scope of the computer readable media.

In summary, the above description is only a preferred embodiment of the technical solution of the present invention, and is not intended to limit the scope of the present invention. Any modifications, equivalent substitutions, improvements, etc. made within the spirit and scope of the present invention are intended to be included within the scope of the present invention.

Claims

A data transmission method for a communication system using a low density parity check LDPC code, the communication system comprising a transmitting device and a receiving device, the transmitting device for transmitting a first transport block, the first transport block comprising The first code block is characterized in that the method comprises:

The transmitting device obtains an encoded bit segment from a first coded code block, where the first coded code block is obtained by processing the first code block according to processing capability of the receiving device;

The transmitting device sends the encoded bit segment to the receiving device.
The method of claim 1 wherein

The processing capability of the receiving device includes a maximum transport block size N IR that can be supported by the soft information buffer of the receiving device, and a size of the first encoded code block.
The number of code blocks included in the first transport block is C, and the size of the loop buffer of the sending device is Kw ; or

The processing capability of the receiving device includes a lowest decoding code rate R t supported by the receiving device, and a size of the first coded code block.
Where K IR, send is the first transport block size, the number of code blocks included in the first transport block is C, and the loop buffer size of the sending device is K w ; or

The processing capability of the receiving device includes a maximum coded block size N CB,t supported by the receiving device , and a size of the first coded block N CB =min(K W , N CB,t ), where The circular buffer size of the sending device is Kw .
Method according to claim 1 or 2, characterized in that

The first coded code block is obtained by matching the size of the first coded code block after the first code block is encoded by the complete matrix of the LDPC code; or

The first coded code block is obtained by encoding the first code block by a check matrix of an LDPC code, where a check matrix of the LDPC code is determined according to a size of the first coded code block.
The method of claim 3 wherein:

The complete matrix of the LDPC code includes a built-in punctured column, and the first coded code block does not include a coded bit corresponding to the built-in punctured column, or

The check matrix of the LDPC code includes a built-in punctured column, and the first coded code block does not include coded bits corresponding to the built-in punctured column.
A data transmission method for a communication system using a low density parity check LDPC code, the communication system comprising a transmitting device and a receiving device, wherein the method comprises:

The transmitting device acquires the transmitted redundancy version RV j ;

The transmitting device determines, according to the redundancy version RV j , a first starting position S i of the encoded bit segment in the first coded code block;

The transmitting device acquires, as the encoded bit segment, an encoded bit segment of length n i from a first starting position S i in the first coded code block;

i is an integer greater than or equal to 0, i is 0 for initial transmission, and i is greater than 0 for ith retransmission,

j is an integer, and 0 ≤ j < j max , j max is the maximum number of redundancy versions between the transmitting device and the receiving device, and the starting position corresponding to the j max redundancy versions is The first coded code block is equally spaced, the starting position of RV 0 is the position of the pth bit in the first coded code block, and p is an integer greater than or equal to 0.
A data transmission method for a communication system using a low density parity check LDPC code, the communication system comprising a transmitting device and a receiving device, wherein the method comprises:

The transmitting device determines a first starting position S i of the encoded bit segment in the first coded code block;

The transmitting device acquires, as the encoded bit segment, an encoded bit segment of length n i from a first starting position S i in the first coded code block;

Where i is an integer greater than or equal to 0,

If i=0, indicating initial transmission, then S 0 is the position of the pth bit of the first coded block.

If i>0, it means the ith retransmission,

S i =(S i-1 +n i-1 )%N CB , where S i-1 is the starting position corresponding to the encoded bit segment acquired by the previous transmission, and n i- 1 is acquired by the previous transmission The length of the encoded bit segment, or,

S i =(p+i*n 0 )%N CB , n 0 is the length of the coded bit segment obtained by the initial transmission, n i =n 0 .
The method according to claim 5 or 6, wherein p=z·l, where z is a spreading factor of the LDPC check matrix corresponding to the first coded code block, and l is a positive integer.
A method according to any one of claims 5 to 7, wherein

If n i ≥ N CB , the first coded code block is a matrix code of the LDPC base matrix of the first code block according to the matrix of the 0th column to the Nth CB -1 column of the check matrix after the expansion factor z is expanded. ;or,

If n i <N CB and S i +n i -1<N CB , the S i to S i +n i -1 coded bits in the first code block are LDPC bases of the first code block S matrix of a parity check matrix according to the spreading factor z is expanded through column i S i + n i -1 coded bits corresponding to the column; or

If n i <N CB and S i +n i -1≥N CB , the S i to N CB -1 coded bits in the first code block are extended with the LDPC base matrix of the first code block. the first parity check matrix S after deployment factor z i-th to N CB -1 coded bits corresponding to columns, a first coded code blocks 0 through n i - (N CB -1- S i) coded bits the first code is a block LDPC matrix substrate according to the parity check matrix after deployment of the spreading factor z 0 through n i - (N CB -1- S i) coded bits corresponding to columns.
A data transmission method for a communication system using a low density parity check LDPC code, the communication system comprising a transmitting device and a receiving device, the transmitting device for transmitting a first transport block, the first transport block comprising The first code block is characterized in that the method comprises:

Receiving, by the receiving device, an encoded bit segment from the sending device;

Receiving, by the receiving device, the soft value bits of the encoded bit segment in a soft information buffer of the receiving device;

The receiving device performs LDPC decoding on the soft information buffer to obtain the first code block, where the coded bit segment is obtained by the sending device from the first coded code block, the first code The code block is obtained by the sending device processing the first code block according to the processing capability of the receiving device.
The method of claim 9 wherein:

The processing capability of the receiving device includes a maximum transport block size N IR that can be supported by the soft information buffer of the receiving device, and a size of the first encoded code block.
The number of code blocks included in the first transport block is C, and the size of the loop buffer of the sending device is Kw ; or

The processing capability of the receiving device includes a lowest decoding code rate R t supported by the receiving device, and a size of the first coded code block.
Where K IR, send is the first transport block size, the number of code blocks included in the first transport block is C, and the loop buffer size of the sending device is K w ; or

The processing capability of the receiving device includes a maximum coded block size N CB,t supported by the receiving device , and a size of the first coded block N CB =min(K W , N CB,t ), where The circular buffer size of the sending device is Kw .
The method according to claim 9 or 10, wherein the receiving device performs LDPC decoding on the soft information buffer to obtain the first code block, including:

The receiving device determines a decoding code rate of the soft information buffer;

The receiving device determines a first check matrix according to the decoding code rate;

The receiving device decodes the soft information by using the first check matrix to obtain a first code block.
A data transmission method for a communication system using a low density parity check LDPC code, the communication system comprising a transmitting device and a receiving device, wherein the method comprises:

The receiving device acquires the transmitted redundancy version RV j ;

The receiving device determines, according to the redundancy version RV j , a first starting position S i of the soft value bit of the encoded bit segment in the soft information buffer;

The receiving device combines and stores the soft value bits of the coded bit segment from the first start position S i in the soft information buffer, where the number of soft value bits is n i ;

i is an integer greater than or equal to 0, i is 0 for initial transmission, and i is greater than 0 for ith retransmission,

j is an integer, and 0 ≤ j < j max , j max is the maximum number of redundancy versions between the transmitting device and the receiving device, and the starting position corresponding to the j max redundancy versions is The soft information buffer is equally spaced, the starting position of RV 0 is the position of the p-th soft bit in the soft information buffer, and p is an integer greater than or equal to 0.
A data transmission method for a communication system using a low density parity check LDPC code, the communication system comprising a transmitting device and a receiving device, wherein the method comprises:

The receiving device determines a first starting position S i of the soft value bit of the encoded bit segment in the soft information buffer;

The receiving device merges and stores the soft value bits of the coded bit segment from the first start position S i in the soft information buffer, where the number of soft value bits is n i ;

Where i is an integer greater than or equal to 0,

If i=0, indicating initial transmission, then S 0 is the position of the p-th soft bit of the soft information buffer.

If i>0, it means the ith retransmission,

S i =(S i-1 +n i-1 )%N CB , where S i-1 is the starting position of the soft bit of the previously received encoded bit segment, and n i- 1 is the previous received The number of soft-valued bits of the encoded bit segment, or,

S i =(p+i*n 0 )%N CB , n 0 is the number of soft-valued bits of the coded bit segment received initially, n i =n 0 .
The method according to claim 12 or 13, wherein p=z·l, where z is a spreading factor of the LDPC check matrix corresponding to the first coded code block, and i is a positive integer.
A transmitting device for a communication system using a low density parity check LDPC code, the communication system comprising the transmitting device and a receiving device, the transmitting device for transmitting a first transport block, the first transport block The first code block is included, wherein the sending device includes:

a rate matcher, configured to obtain an encoded bit segment from the first coded code block, where the first coded code block is obtained by processing the first code block according to processing capability of the receiving device;

And a transceiver, configured to send the coded bit segment to the receiving device.
The transmitting device according to claim 15, wherein

The processing capability of the receiving device includes a maximum transport block size N IR that can be supported by the soft information buffer of the receiving device, and a size of the first encoded code block.
The number of code blocks included in the first transport block is C, and the size of the loop buffer of the sending device is Kw ; or

The processing capability of the receiving device includes a lowest decoding code rate R t supported by the receiving device, and a size of the first coded code block.
Where K IR, send is the first transport block size, the number of code blocks included in the first transport block is C, and the loop buffer size of the sending device is K w ; or

The processing capability of the receiving device includes a maximum coded block size N CB,t supported by the receiving device , and a size of the first coded block N CB =min(K W , N CB,t ), where The circular buffer size of the sending device is Kw .
A transmitting device according to claim 15 or 16, wherein

The first coded code block is obtained by matching the size of the first coded code block after the first code block is encoded by the complete matrix of the LDPC code; or

The first coded code block is obtained by encoding the first code block by a check matrix of an LDPC code, where a check matrix of the LDPC code is determined according to a size of the first coded code block.
The transmitting device according to claim 17, wherein

The complete matrix of the LDPC code includes a built-in punctured column, and the first coded code block does not include a coded bit corresponding to the built-in punctured column, or

The check matrix of the LDPC code includes a built-in punctured column, and the first coded code block does not include coded bits corresponding to the built-in punctured column.
A transmitting device, where the sending device includes:

a rate matcher for obtaining the transmitted redundancy version RV j ,

Determining, according to the redundancy version RV j , a first starting position S i of the encoded bit segment in the first coded code block,

Obtaining, as the encoded bit segment, an encoded bit segment of length n i from a first start position S i in the first coded code block, where

i is an integer greater than or equal to 0, i is 0 for initial transmission, and i is greater than 0 for ith retransmission,

j is an integer, and 0 ≤ j < j max , j max is the maximum number of redundancy versions between the transmitting device and the receiving device, and the starting position corresponding to the j max redundancy versions is The first coded code block is equally spaced, the starting position of RV 0 is the position of the pth bit in the first coded code block, and p is an integer greater than or equal to 0;

And a transceiver, configured to send the encoded bit segment to a receiving device.
A transmitting device, where the sending device includes:

a rate matcher, configured to determine a first start position S i of the coded bit segment in the first code block,

Obtaining, as the encoded bit segment, an encoded bit segment of length n i from a first starting position S i in the first coded code block,

Where i is an integer greater than or equal to 0,

If i=0, indicating initial transmission, then S 0 is the position of the pth bit of the first coded block.

If i>0, it means the ith retransmission,

S i =(S i-1 +n i-1 )%N CB , where S i-1 is the starting position corresponding to the encoded bit segment acquired by the previous transmission, and n i- 1 is acquired by the previous transmission The length of the encoded bit segment, or,

S i =(p+i*n 0 )%N CB , n 0 is the length of the coded bit segment obtained by the initial transmission, n i =n 0 ;

And a transceiver, configured to send the encoded bit segment to a receiving device.
The transmitting device according to claim 19 or 20, wherein p=z·l, where z is a spreading factor of the LDPC check matrix corresponding to the first coded code block, and l is a positive integer.
A transmitting device according to any one of claims 19 to 21, characterized in that

If n i ≥ N CB , the first coded code block is a matrix code of the LDPC base matrix of the first code block according to the matrix of the 0th column to the Nth CB -1 column of the check matrix after the expansion factor z is expanded. ;or,

If n i <N CB and S i +n i -1<N CB , the S i to S i +n i -1 coded bits in the first code block are LDPC bases of the first code block S matrix of a parity check matrix according to the spreading factor z is expanded through column i S i + n i -1 coded bits corresponding to the column; or

If n i <N CB and S i +n i -1≥N CB , the S i to N CB -1 coded bits in the first code block are extended with the LDPC base matrix of the first code block. the first parity check matrix S after deployment factor z i-th to N CB -1 coded bits corresponding to columns, a first coded code blocks 0 through n i - (N CB -1- S i) coded bits the first code is a block LDPC matrix substrate according to the parity check matrix after deployment of the spreading factor z 0 through n i - (N CB -1- S i) coded bits corresponding to columns.
A receiving device for a communication system using a low density parity check LDPC code, the communication system comprising a transmitting device and the receiving device, the transmitting device for transmitting a first transport block, the first transport block The first code block is included, wherein the receiving device includes:

a transceiver, configured to receive a coded bit segment from the sending device;

a rate-matching unit, configured to save the soft-valued bits of the encoded bit segment in a soft information buffer of the receiving device;

a decoder, configured to perform LDPC decoding on the soft information buffer to obtain the first code block, where the coded bit segment is obtained by the sending device from a first coded code block, where An encoded code block is obtained by the sending device processing the first code block according to processing capability of the receiving device.
A receiving device according to claim 23, wherein

The processing capability of the receiving device includes a maximum transport block size N IR that can be supported by the soft information buffer of the receiving device, and a size of the first encoded code block.
The number of code blocks included in the first transport block is C, and the size of the loop buffer of the sending device is Kw ; or

The processing capability of the receiving device includes a lowest decoding code rate R t supported by the receiving device, and a size of the first coded code block.
Where K IR, send is the first transport block size, the number of code blocks included in the first transport block is C, and the loop buffer size of the sending device is K w ; or

The processing capability of the receiving device includes a maximum coded block size N CB,t supported by the receiving device , and a size of the first coded block N CB =min(K W , N CB,t ), where The circular buffer size of the sending device is Kw .
The receiving device according to claim 23 or 24, wherein the decoder is specifically configured to:

Determining a decoding code rate of the soft information buffer;

Determining a first check matrix according to the decoded code rate;

And decoding, by the first check matrix, the soft information buffer to obtain a first code block.
A receiving device, wherein the receiving device comprises:

a transceiver, configured to receive a coded bit segment from a transmitting device;

a rate matching device for obtaining a transmitted redundancy version RV j ,

Determining, according to the redundancy version RV j , a first starting position S i of the soft value bit of the encoded bit segment in the soft information buffer,

And combining the soft value bits of the coded bit segment from the first start position S i in the soft information buffer, where the number of soft value bits is n i , where

i is an integer greater than or equal to 0, i is 0 for initial transmission, and i is greater than 0 for ith retransmission,

j is an integer, and 0 ≤ j < j max , j max is the maximum number of redundancy versions between the transmitting device and the receiving device, and the starting position corresponding to the j max redundancy versions is The soft information buffer is equally spaced, the starting position of RV 0 is the position of the p-th soft bit in the soft information buffer, and p is an integer greater than or equal to 0.
A receiving device, wherein the receiving device comprises:

a transceiver, configured to receive a coded bit segment from a transmitting device;

a rate-matching device, configured to determine a first starting position S i of the soft-valued bit of the encoded bit segment in the soft information buffer,

And storing the soft value bits of the coded bit segment from the first start position S i in the soft information buffer, where the number of soft value bits is n i ,

Where i is an integer greater than or equal to 0,

If i=0, indicating initial transmission, then S 0 is the position of the p-th soft bit of the soft information buffer.

If i>0, it means the ith retransmission,

S i =(S i-1 +n i-1 )%N CB , where S i-1 is the starting position of the soft bit of the previously received encoded bit segment, and n i- 1 is the previous received The number of soft-valued bits of the encoded bit segment, or,

S i =(p+i*n 0 )%N CB , n 0 is the number of soft-valued bits of the coded bit segment received initially, n i =n 0 .
The receiving device according to claim 26 or 27, wherein p=z·l, where z is a spreading factor of the LDPC check matrix corresponding to the first coded code block, and i is a positive integer.
A communication system, characterized in that the communication system uses a low density parity check LDPC code, comprising the transmitting device according to any one of claims 15 to 22, according to any one of claims 23 to Receiving device.