CN101227259B - Method for data reading of limited length circulating buffer memory rate adaption - Google Patents

Abstract

The invention discloses a method for reading data of finite length circulating storage with suitable speed, which comprises: firstly, confirming the actual length Ncb of the finite length circulating storage, confirming the initial position for reading the data, according to a redundant edition of a mixed automatic request retransmission which is corresponded with an HARQ data packet, the row number and the column number of a finite length circulating storage matrix, which is used to control proportionality constant of distance between each initial position and deviant offset, reading code word bits of the length L from the confirmed initial position for reading the data along the order number of lines from up to down, combining a present HARQ data packet, and sending the present HARQ data packet, wherein the L is the size of the present HARQ data packet. When the invention is in application, the problem that HARQ data packet reading interval changes are bigger in an existing technique, which enables the initial position for reading the HARQ data packet rationally to be distributed in the finite length circulating storage according to certain scaling relation.

Description

Data reading method for finite length circular buffer rate matching

Technical Field

The invention relates to the field of digital communication, in particular to a data reading method of limited-length circular buffer rate matching in the field of channel coding.

Background

As an alternative to the 3rd Generation Partnership Project 3GPP (3rd Generation Partnership Project) Rel-6 rate matching algorithm, Circular Buffer Rate Matching (CBRM) provides a method for simply generating a puncturing pattern with excellent performance, and a specific structure thereof is shown in fig. 1.

In the circular buffer rate matching method, each data stream is rearranged by a respective sub-interleaver, called sub-block interleaver; generally, to simplify the hardware implementation, the number of columns of the block interleaver is fixed, and the number of rows changes with the change of the interleaving length, so the circular buffer can be regarded as a "R row × C column" row-column buffer, i.e. as a "R row × C column" virtual buffer, as shown in fig. 2.

For example, in the circular buffer rate matching method of 3GPP, the adopted intra-block interleaving is a block interleaver with a fixed number of 32 columns. Since the circular cache includes three data streams including the system bit, the first parity bit and the second parity bit, the circular cache can be regarded as a virtual cache with 96 columns. In a single output buffer, the reordered systematic bits are placed at the beginning position, followed by interleaved placement of the two reordered check bit data streams, referred to as inter-block interleaving. For a desired code Rate (Rate), the bit selection for circular buffer Rate matching is to read L bits sequentially from a starting point somewhere in the buffer as the output of Rate matching. In general, the bits selected for transmission may be read from any point in the buffer, and if the end of the buffer is reached, the read data may be continued around the beginning of the buffer until the read of the L bits is complete.

Hybrid automatic repeat request (HARQ) is a link adaptation technique of great importance in digital communication systems. The receiving end decodes the HARQ data packet received by the receiving end, and if the decoding is correct, an ACK signal is fed back to the sending end to inform the sending end of sending a new HARQ data packet; and if the decoding fails, feeding back a NACK signal to the sending end to request the sending end to resend the HARQ data packet. The receiving end can improve the decoding success probability by carrying out IR or Chase combined decoding on the data packet which is retransmitted for many times, and the requirement of high reliability of link transmission is met.

In a hybrid automatic repeat request (HARQ) scheme, a different location may be designated in the circular buffer as the starting location for reading each transmission HARQ packet. The definition of Redundancy Version (RV) determines a plurality of starting point positions read by the HARQ packet in the circular buffer, and the value of the redundancy version determines the specific starting point position read by the HARQ packet transmitted this time in the circular buffer. For example, in the 3GPP system, 4 RV versions (RV ═ 0, 1, 2, 3) are defined for the HARQ process based on circular buffer rate matching. Each HARQ retransmission L long sub-packets are formed by clockwise selecting L bits from the starting point defined by the redundancy version.

The HARQ function includes two rate matching processes and a virtual IR buffer, the first rate matching process matches the number of input bits to the virtual IR buffer, which is configured by higher layers. If the number of input bits does not exceed the capability of the virtual IR, then no bits need to be dropped, otherwise the excess bits need to be dropped. The second time rate matching process is to match the bit number after the first time rate matching to the total bit number of the plurality of physical channels in order to meet the requirement of the channels.

The length of the limited length circular buffer is limited, and the rate matching selects L coded bits as the output of the circular buffer rate matching according to the expected output code rate on the basis of limiting the length of the circular buffer; similar to the rate matching of an unrestricted circular buffer, the bits selected for transmission may be read from any location in the buffer. If the end of the buffer is reached, the data may continue to be read, bypassing the beginning of the buffer. Usually, different positions can be specified in the limited-length circular buffer as the starting position of reading each transmission HARQ packet, that is, the starting position of the HARQ packet corresponding to the redundancy version value is specified.

In some communication systems, in order to save signaling overhead, a redundancy version with RV of 0 and a New Data Indicator (NDI) are multiplexed, that is, RV of 0 indicates both the start point of reading Data of an HARQ packet with redundancy version of 0 and the start point of a New Data block. In this way, to avoid confusion, RV ═ 0 can only be used as the read start point of the first HARQ packet during retransmission of one data block, and RV ═ 0 is not allowed to be reused in subsequent retransmissions. For example, in 3GPP, one value sequence of an RV for 8 retransmissions is RV {0, 2, 1, 3, 2, 1, 3, 2 }. When the multiplexing of RV-0 and NDI is considered, the distance between RV-0 and RV-1, between RV-1 and RV-2, between RV-2 and RV-3 should be the same, and the distance between the last RV (for example, RV-3) and RV-0 should be smaller, so that the distribution of RVs can better protect the systematic bits.

In the existing rate matching method of the limited-length circular buffer, the following problems exist: the spacing between RVs fluctuates with the size of the finite length circular buffer, and in some specific cases, the distance between the last RV and RV 0 is even equal to the distance between RV 0 and RV 1, and the existing RV distribution obviously cannot adapt to the case of RV 0 and NDI multiplexing in the finite buffer. The method provided by the invention can ensure that the reading starting points of the HARQ data packet are reasonably distributed in the limited length circular buffer according to a certain proportional relation, and can obtain better retransmission performance compared with the prior method.

Disclosure of Invention

The technical problem to be solved by the present invention is to provide a data reading method for rate matching of a limited length circular buffer, and to overcome the disadvantages of the prior art, a data reading position is reasonably determined according to a redundancy length to form an HARQ packet, so as to improve the retransmission performance of the HARQ packet.

The invention provides a data reading method for finite length circular buffer rate matching, which comprises the following steps:

determining the actual length N of a finite-length circular buffer_cb；

According to the redundancy version corresponding to the current hybrid automatic repeat request (HARQ) data packet, the initial position of the read data is determined by the following formula:

$k_0^i=R_{\mathrm{subblock}}^{\mathrm{TC}}\·[2\×\mathrm{Operation}(\frac{N_{\mathrm{cb}}}{2\×R_{\mathrm{subblock}}^{\mathrm{TC}}\·N_{\mathrm{rv}}}\·\frac{Q}{P}\·{\mathrm{rv}}_{\mathrm{idx}})+\mathrm{Offset}],$

wherein,

is the number of rows of the finite length circular buffer matrix; operation (·) represents the rounding correction function; n is a radical of_rvRepresents the number of redundancy versions;

is a proportionality constant for controlling the distance between the starting positions; rv_idxRepresents the value of each redundancy version, and is in the set {0, 1.. N_rv-1} is selected; offset represents the first redundancy version value, rv_idxThe HARQ packet starting point corresponding to 0 is offset by an offset column from the starting point of the first column of the finite length circular buffer, the offset being a specific known integer, and

the above-mentionedIs a loop buffer of finite lengthThe number of columns of the memory matrix;

reading out the code word bits with the length L from top to bottom column by column along the sequence of the columns from the determined initial position of the read data to form a current HARQ data packet, and sending the current HARQ data packet, wherein L is the size of the current HARQ data packet.

Wherein the rounding correction function operation () is an upward rounding function, or a downward rounding function, or a rounding function.

Wherein the redundancy version specifies N_rvColumn index of column in column index sequence of finite length circular buffer matrix $\left[\begin{array}{cccc}0,& 1,& ...,& C_{\mathrm{limited}}^{\mathrm{TC}}-1\end{array}\right]$ Above value, theIs the number of columns of a limited length circular buffer matrix, the number of redundancy versions N_rvIs 3, 4, 6 or 8.

Actual length N of the finite length circular buffer_cbThe determination is as follows: n is a radical of_cb＝min(N_IR，K_w) Wherein min (-) represents the minimum value operation, N_IRIs the size of the available buffer for the input code block, K_wIs the size of the circular buffer.

And skipping not to read if the filling bits and the dummy bits are encountered in the process of reading the bits until L effective bits are read in the process of reading the data to form the current HARQ data packet according to the determined starting position of the read data.

And in the process of reading the data according to the determined starting position of the read data to form the current HARQ data packet, if the reading reaches the end of the buffer in the process of reading the bits, the data is continuously read by winding to the starting position of the buffer.

The invention also provides a data reading method of finite length circular buffer rate matching, which comprises the following steps:

determining the actual length N of a finite-length circular buffer_cb；

According to the redundancy version corresponding to the current hybrid automatic repeat request (HARQ) data packet, the initial position of the read data is determined by the following formula:

$k_0^i=R_{\mathrm{subblock}}^{\mathrm{TC}}\·[2\×\mathrm{Operation}(\frac{N_{\mathrm{cb}}}{2\×R_{\mathrm{subblock}}^{\mathrm{TC}}\·N_{\mathrm{rv}}}\·\frac{Q}{P})\·{\mathrm{rv}}_{\mathrm{idx}}+\mathrm{Offset}],$

wherein,

is the number of rows of the finite length circular buffer matrix; operation (·) represents the rounding correction function; n is a radical of_rvRepresents the number of redundancy versions;

is a proportionality constant for controlling the distance between the starting positions; rv_idxRepresents the value of each redundancy version, and is in the set {0, 1.. N_rv-1} is selected; offset represents the first redundancy version value, rv_idxThe HARQ packet starting point corresponding to 0 is offset by an offset column from the starting point of the first column of the finite length circular buffer, the offset being a specific known integer, and

the above-mentioned

Is the number of columns of the finite length circular buffer matrix;

reading out the code word bits with the length L from top to bottom column by column along the sequence of the columns from the determined initial position of the read data to form a current HARQ data packet, and sending the current HARQ data packet, wherein L is the size of the current HARQ data packet.

Wherein the rounding correction function operation () is an upward rounding function, or a downward rounding function, or a rounding function.

Wherein the redundancy version specifies N_rvColumn index of columns column index sequence of a finite length circular buffer matrix $\left[\begin{array}{cccc}0,& 1,& ...,& C_{\mathrm{limited}}^{\mathrm{TC}}-1\end{array}\right]$ Above value, the

Is the number of columns of a limited length circular buffer matrix, the number of redundancy versions N_rvIs 3, 4, 6 or 8.

Actual length N of the finite length circular buffer_cbThe determination is as follows: n is a radical of_cb＝min(N_IR，K_w) Wherein min (-) represents the minimum value operation, N_IRIs the size of the available buffer for the input code block, K_wIs the size of the circular buffer.

And skipping not to read if the filling bits and the dummy bits are encountered in the process of reading the bits until L effective bits are read in the process of reading the data to form the current HARQ data packet according to the determined starting position of the read data.

And in the process of reading the data according to the determined starting position of the read data to form the current HARQ data packet, if the reading reaches the end of the buffer in the process of reading the bits, the data is continuously read by winding to the starting position of the buffer.

The invention also provides another data reading method with finite length circular buffer rate matching, which comprises the following steps:

A. determining the actual length N of a finite-length circular buffer_cbAnd a proportionality constant for controlling the distance between the starting positions;

B. determining the initial position of the read data according to the redundancy version corresponding to the current hybrid automatic repeat request (HARQ) data packet and a proportionality constant for controlling the distance between the initial positions;

C. reading out the code word bits with the length L from top to bottom column by column along the sequence of the columns from the determined initial position of the read data to form a current HARQ data packet, and sending the current HARQ data packet, wherein L is the size of the current HARQ data packet.

Further, in step B, the starting position of the read data is determined by using the following formula:

$k_0^i=R_{\mathrm{subblock}}^{\mathrm{TC}}\·[\mathrm{Operation}(\frac{N_{\mathrm{cb}}}{R_{\mathrm{subblock}}^{\mathrm{TC}}\·N_{\mathrm{rv}}}\·\frac{Q}{P}\·{\mathrm{rv}}_{\mathrm{idx}})+\mathrm{Offset}],$

wherein,

is the number of rows of the finite length circular buffer matrix; operation (·) represents the rounding correction function; n is a radical of_rvRepresents the number of redundancy versions;

is a proportionality constant for controlling the distance between the starting positions; rv_idxTo representThe value of each redundancy version is in the set {0, 1.. N_rv-1} is selected; offset represents the first redundancy version value, rv_idxThe HARQ packet starting point corresponding to 0 is offset by an offset column from the starting point of the first column of the finite length circular buffer, the offset being a specific known integer, and

the above-mentioned

Is the number of columns of the finite length circular buffer matrix.

Further, in step B, the starting position of the read data is determined by using the following formula:

$k_0^i=R_{\mathrm{subblock}}^{\mathrm{TC}}\·[\mathrm{Operation}(\frac{N_{\mathrm{cb}}}{R_{\mathrm{subblock}}^{\mathrm{TC}}\·N_{\mathrm{rv}}}\·\frac{Q}{P})\·{\mathrm{rv}}_{\mathrm{idx}}+\mathrm{Offset}],$

wherein,

is a loop buffer of finite lengthStoring the number of rows of the matrix; operation (·) represents the rounding correction function; n is a radical of_rvRepresents the number of redundancy versions;

is a proportionality constant for controlling the distance between the starting positions; rv_idxRepresents the value of each redundancy version, and is in the set {0, 1.. N_rv-1} is selected; offset represents the first redundancy version value, rv_idxThe HARQ packet starting point corresponding to 0 is offset by an offset column from the starting point of the first column of the finite length circular buffer, the offset being a specific known integer, and

the above-mentioned

Is the number of columns of the finite length circular buffer matrix.

Wherein the rounding correction function operation () is an upward rounding function, or a downward rounding function, or a rounding function.

N specified by the redundancy version_rvColumn index of columns column index sequence of a finite length circular buffer matrix $\left[\begin{array}{cccc}0,& 1,& ...,& C_{\mathrm{limited}}^{\mathrm{TC}}-1\end{array}\right]$ Above value, theIs the number of columns of a finite length circular buffer matrix, the redundancyNumber of versions N_rvIs 3, 4, 6 or 8.

Actual length N of the finite length circular buffer_cbThe determination is as follows: n is a radical of_cb＝min(N_IR，K_w) Wherein min (-) represents the minimum value operation, N_IRIs the size of the available buffer for the input code block, K_wIs the size of the circular buffer.

And skipping not to read if the filling bits and the dummy bits are encountered in the process of reading the bits until L effective bits are read in the process of reading the data to form the current HARQ data packet according to the determined starting position of the read data.

And in the process of reading the data according to the determined starting position of the read data to form the current HARQ data packet, if the reading reaches the end of the buffer in the process of reading the bits, the data is continuously read by winding to the starting position of the buffer.

The invention also provides a method for determining the data reading initial position in the finite length circular buffer rate matching, which comprises the following steps:

according to the redundancy version corresponding to the current hybrid automatic repeat request (HARQ) data packet, the initial position of the read data is determined by the following formula:

$k_0^i=R_{\mathrm{subblock}}^{\mathrm{TC}}\·[2\×\mathrm{Operation}(\frac{N_{\mathrm{cb}}}{2\×R_{\mathrm{subblock}}^{\mathrm{TC}}\·N_{\mathrm{rv}}}\·\frac{Q}{P}\·{\mathrm{rv}}_{\mathrm{idx}})+\mathrm{Offset}],$

wherein,is the number of rows of the finite length circular buffer matrix; operation (·) represents the rounding correction function; actual length N of finite length circular buffer_cb；N_rvRepresents the number of redundancy versions;is a proportionality constant for controlling the distance between the starting positions; rv_idxRepresents the value of each redundancy version, and is in the set {0, 1.. N_rv-1} is selected; offset represents the first redundancy version value, rv_idxThe HARQ packet starting point corresponding to 0 is offset by an offset column from the starting point of the first column of the finite length circular buffer, the offset being a specific known integer, and

the above-mentioned

Is the number of columns of the finite length circular buffer matrix.

The invention also provides another method for determining the data reading starting position in the finite length circular buffer rate matching, which comprises the following steps:

according to the redundancy version corresponding to the current hybrid automatic repeat request (HARQ) data packet, the initial position of the read data is determined by the following formula:

$k_0^i=R_{\mathrm{subblock}}^{\mathrm{TC}}\·[2\×\mathrm{Operation}(\frac{N_{\mathrm{cb}}}{2\×R_{\mathrm{subblock}}^{\mathrm{TC}}\·N_{\mathrm{rv}}}\·\frac{Q}{P})\·{\mathrm{rv}}_{\mathrm{idx}}+\mathrm{Offset}],$

wherein,

is the number of rows of the finite length circular buffer matrix; operation (·) represents the rounding correction function; actual length N of finite length circular buffer_cb；N_rvRepresents the number of redundancy versions;

is a proportionality constant for controlling the distance between the starting positions; rv_idxRepresents the value of each redundancy version, and is in the set {0, 1.. N_rv-1} is selected; offset represents the first redundancy version value, rv_idxThe HARQ packet starting point corresponding to 0 is offset by an offset column from the starting point of the first column of the finite length circular buffer, the offset being a specific known integer, and

the above-mentioned

Is the number of columns of the finite length circular buffer matrix.

The invention further provides another method for determining a data reading starting position in finite length circular buffer rate matching, which comprises the following steps:

according to the redundancy version corresponding to the current hybrid automatic repeat request (HARQ) data packet, the initial position of the read data is determined by the following formula:

$k_0^i=R_{\mathrm{subblock}}^{\mathrm{TC}}\·[\mathrm{Operation}(\frac{N_{\mathrm{cb}}}{R_{\mathrm{subblock}}^{\mathrm{TC}}\·N_{\mathrm{rv}}}\·\frac{Q}{P})\·{\mathrm{rv}}_{\mathrm{idx}}+\mathrm{Offset}];$ or,

$k_0^i=R_{\mathrm{subblock}}^{\mathrm{TC}}\·[\mathrm{Operation}(\frac{N_{\mathrm{cb}}}{R_{\mathrm{subblock}}^{\mathrm{TC}}\·N_{\mathrm{rv}}}\·\frac{Q}{P}\·{\mathrm{rv}}_{\mathrm{idx}})+\mathrm{Offset}];$

wherein,

is the number of rows of the finite length circular buffer matrix; operation (·) represents the rounding correction function; actual length N of finite length circular buffer_cb；N_rvRepresents the number of redundancy versions;

is a proportionality constant for controlling the distance between the starting positions; rv_idxRepresents the value of each redundancy version, and is in the set {0, 1.. N_rv-1} is selected; offset represents the first redundancy version value, rv_idxThe HARQ packet starting point corresponding to 0 is offset by an offset column from the starting point of the first column of the finite length circular buffer, the offset being a specific known integer, and

the above-mentioned

Is the number of columns of the finite length circular buffer matrix.

The method of the invention can determine the data reading position by calculation according to the position of the redundant length, especially in combination with the proportionality constant for controlling the distance between the initial positions, and overcomes the problem of large variation of the reading interval of the HARQ data packet in the prior art, so that the reading starting points of the HARQ data packet are reasonably distributed in the limited length circular buffer according to a certain proportionality relationship. Compared with the prior art, the retransmission performance of the HARQ packet can be improved.

Drawings

FIG. 1 is a structure of circular buffer rate matching;

FIG. 2 is a continuous transmission structure for virtual circular buffer rate matching;

FIG. 3 is a two-dimensional finite length circular cache structure;

fig. 4 is a flow chart of a rate matching method of a limited-length circular buffer according to an embodiment of the present invention.

Detailed Description

In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention is further described in detail below with reference to the accompanying drawings.

The invention provides a data reading method of rate matching of a limited-length circular buffer for overcoming the problem of large change of the reading interval of the HARQ data packet in the prior art, so that the reading starting points of the HARQ data packet are reasonably distributed in the limited-length circular buffer according to a certain proportional relation.

In the embodiment of the present invention, the limited-length circular buffer is a matrix array with R rows and C columns, and the redundancy version is used to determine from which column of the matrix the data is read, as shown in fig. 3. The method of the invention can determine the data reading position according to the position of the redundant length, especially increase the proportionality constant for controlling the distance between the initial positions, and the interval between the redundant length positions is also needed to be considered when determining the initial positions. For rate matching of a finite length circular buffer array of a Turbo code, the method of the invention comprises the following steps:

step 1: firstly, determining the actual length of a limited length circular buffer;

step 2: determining the initial position k of the read data according to the redundancy version corresponding to the current HARQ data packet₀。

Wherein the redundancy version RV is used for determining the redundancy version from

Which column of the two-dimensional finite-length circular buffer matrix starts reading data, whereinIs the number of rows of the finite length circular buffer matrix,

is the number of columns of the finite length circular buffer matrix. Redundancy version {0, 1., N_rv-1} N_rvColumn indexes of the columns are respectively in the column index sequence $\left[\begin{array}{cccc}0,& 1,& ...,& C_{\mathrm{limited}}^{\mathrm{TC}}-1\end{array}\right]$ Taking the value up, wherein the next adjacent element of the last element in the column index sequence is the first element;

and step 3: reading out the code word bits with the length L from top to bottom column by column along the sequence of the columns from the starting position in the step 2 to form a current HARQ data packet;

and 4, step 4: and sending the current HARQ data packet to a subsequent processing module.

In step 1, the actual length N of the finite-length circular buffer_cb＝min(N_IR，K_w). Wherein min (-) represents the minimum value calculation, N_IRIs the size of the buffer available for the input code block (e.g., the first rate-matched virtual IR buffer), K_wIs the size of the circular buffer. The method of calculating the finite length circular buffer is not limited thereto.

In step 2, the starting position of the HARQ packet corresponding to each redundancy version value is calculated according to the following formula 1:

equation 1: $k_0^i=R_{\mathrm{subblock}}^{\mathrm{TC}}\·[2\×\mathrm{Operation}(\frac{N_{\mathrm{cb}}}{2\×R_{\mathrm{subblock}}^{\mathrm{TC}}\·N_{\mathrm{rv}}}\·\frac{Q}{P}\·{\mathrm{rv}}_{\mathrm{idx}})+\mathrm{Offset}],$

wherein N is_rvRepresenting redundancyNumber of versions, N_rv3, 4, 6 or 8;

is a proportionality constant for controlling the distance between the starting positions;

rv_idxrepresents the value of each redundancy version, which is in the set {0, 1.. N_rv-1} is selected;

offset represents the first redundancy version value (rv)_idx0) is offset from the beginning of the first column of the two-dimensional finite length circular buffer by an offset column, where offset is a known specific integer, and

operation (. cndot.) denotes rounding correction, which can be done by rounding up (ceil), rounding down (floor) or rounding up (round).

Applying the above formula $k_0^i=R_{\mathrm{subblock}}^{\mathrm{TC}}\·[2\×\mathrm{Operation}(\frac{N_{\mathrm{cb}}}{2\×R_{\mathrm{subblock}}^{\mathrm{TC}}\·N_{\mathrm{rv}}}\·\frac{Q}{P}\·{\mathrm{rv}}_{\mathrm{idx}})+\mathrm{Offset}],$ Reading data can be limited to the beginning of even columns while the position calculation can be made smoother.

It should be noted that the HARQ packet start position corresponding to each redundancy version value may also be modified as follows:

equation 2: $k_0^i=R_{\mathrm{subblock}}^{\mathrm{TC}}\·[2\×\mathrm{Operation}(\frac{N_{\mathrm{cb}}}{2\×R_{\mathrm{subblock}}^{\mathrm{TC}}\·N_{\mathrm{rv}}}\·\frac{Q}{P})\·{\mathrm{rv}}_{\mathrm{idx}}+\mathrm{Offset}];$ or,

equation 3: $k_0^i=R_{\mathrm{subblock}}^{\mathrm{TC}}\·[\mathrm{Operation}(\frac{N_{\mathrm{cb}}}{R_{\mathrm{subblock}}^{\mathrm{TC}}\·N_{\mathrm{rv}}}\·\frac{Q}{P})\·{\mathrm{rv}}_{\mathrm{idx}}+\mathrm{Offset}];$ or,

equation 4: $k_0^i=R_{\mathrm{subblock}}^{\mathrm{TC}}\·[\mathrm{Operation}(\frac{N_{\mathrm{cb}}}{R_{\mathrm{subblock}}^{\mathrm{TC}}\·N_{\mathrm{rv}}}\·\frac{Q}{P}\·{\mathrm{rv}}_{\mathrm{idx}})+\mathrm{Offset}],$

in the formula 2, it is also limited to start reading data from even columns, while in the formulas 3 and 4, it is not limited whether to start reading data from even columns, odd columns or even columns.

These modifications are also within the scope of the present invention, and the parameters in equations 2, 3 and 4 are the same as those in equation 1, and are not described again.

In step 3, starting from the starting position corresponding to the current redundancy version, sequentially reading L bits (L is the size of the current HARQ data packet) from the limited length rate cache to form the current HARQ packet, and skipping not to read if a padding bit (padding bits) and a dummy bit are encountered during the process of reading the bits until L valid bits are read out. According to the characteristics of the circular buffer, if the end of the buffer is reached, the data can be continuously read by winding to the starting position of the buffer.

In addition, the method of the present invention is not only applicable to the case of multiplexing a redundancy version with RV ═ 0 and a New Data Indicator (NDI), but also applicable to the case of non-multiplexing.

Application example:

as shown in fig. 4, in the embodiment of the present invention, the data reading method for finite length circular buffer rate matching includes the following steps:

step 401: the available buffer size of the code block set by the system is N_IRThe length of the circular buffer is K_wThen the size of the finite length circular buffer is N_cb＝min(N_IR，K_w) (ii) a Namely, the minimum value of the available buffer size of the code block and the length of the circular buffer is selected as the size of the circular buffer with the limited length. The determination of the size of the limited-length circular buffer may also be determined in other ways.

Step 402: number of current redundancy versions N_rvThe index numbers of the data are numbered in order from 0, and the column index numbers are also numbered in order from left to right from 0.

Assume that the first redundancy version takes the value (rv)_idx0) and the offset between the starting point of the corresponding HARQ data packet and the starting point of the first column of the two-dimensional finite-length circular buffer is 2 columns, and the two-dimensional finite-length circular buffer is taken

Then each redundancy version takes the value (rv)_idx0) the starting position index of the corresponding HARQ packet:

here, i is 0, 1, 2, 3, and the correction method used in the operation () is rounding (ceil), but of course, other correction methods may be used in the operation ().

It should be noted that the starting position index of the HARQ packet corresponding to each redundancy version value may also be calculated by the following formula:

or,

or,

step 403: if rv_idx0 and at the same time an indicator (NDI) of new data, then only on the first retransmission from rv_idxThe data starts to be read at the position of 0, and the data is not read from the position in the subsequent retransmission process. Here, it is assumed that the redundancy version of 8 retransmissions takes a value of {0, 2, 1, 3, 2, 1, 3, 2}, and the length of the HARQ packet to be transmitted is L bits. Each retransmission starts from the position corresponding to the value of the redundancy version and is arranged from top to bottom column by column along the sequence of the columnsAnd reading the code word bits with the length L downwards to form the current HARQ data packet, and skipping not to read if padding bits (padding bits) and dummy bits are encountered in the process of reading the bits until L effective bits are read. According to the characteristics of the circular buffer, if the end of the buffer is reached, the data can be continuously read by winding to the starting position of the buffer.

Step 404: and sending the current HARQ data packet to a subsequent processing module.

While the invention has been described with reference to a preferred embodiment, it will be understood by those skilled in the art that various changes in form and detail may be made therein without departing from the spirit and scope of the invention. Therefore, any modification, equivalent replacement, improvement, and updating made within the spirit and principle of the present invention should be included in the protection scope of the present invention.

Claims (21)

1. A data reading method of finite length circular buffer rate matching includes the following steps:

determining the actual length N of a finite-length circular buffer_cb；

According to the redundancy version corresponding to the current hybrid automatic repeat request (HARQ) data packet, the initial position of the read data is determined by the following formula:

$k_0^i=R_{\mathrm{subblock}}^{\mathrm{TC}}\·[2\×\mathrm{Operation}(\frac{N_{\mathrm{cb}}}{2\×R_{\mathrm{subblock}}^{\mathrm{TC}}\·N_{\mathrm{rv}}}\·\frac{Q}{P}\·{\mathrm{rv}}_{\mathrm{idx}})+\mathrm{Offset}],$

wherein,

is the number of rows of the finite length circular buffer matrix; operation (·) represents the rounding correction function; n is a radical of_rvRepresents the number of redundancy versions;

is a proportionality constant for controlling the distance between the starting positions; rv_idxRepresents the value of each redundancy version, and is in the set {0, 1.. N_rv-1} is selected; offset represents the first redundancy version value, rv_idxThe HARQ packet starting point corresponding to 0 is offset by an offset column from the starting point of the first column of the finite length circular buffer, the offset being a specific known integer, and

the above-mentioned

Is the number of columns of the finite length circular buffer matrix;

reading out the code word bits with the length L from top to bottom column by column along the sequence of the columns from the determined initial position of the read data to form a current HARQ data packet, and sending the current HARQ data packet, wherein L is the size of the current HARQ data packet.

2. A method for reading data according to claim 1, wherein the rounding modification function operation () is a round-up function, a round-down function, or a round-up function.

3. The data reading method of claim 1, wherein the redundancy version specifies N_rvColumn index of column in column index sequence of finite length circular buffer matrix $\left[\begin{array}{ccc}0,& 1,& ...,\end{array}\right.$ $\left.\begin{array}{c}{C}_{\mathrm{limited}}^{\mathrm{TC}}-1\end{array}\right]$ Above value, the

Is the number of columns of a limited length circular buffer matrix, the number of redundancy versions N_rvIs 3, 4, 6 or 8.

4. The data reading method of claim 1,

actual length N of the finite length circular buffer_cbThe determination is as follows: n is a radical of_cb＝min(N_IR，K_w) Wherein min (-) represents the minimum value operation, N_IRIs the size of the available buffer for the input code block, K_wIs the size of the circular buffer.

5. The data reading method of claim 1,

and skipping not to read if the filling bits and the dummy bits are encountered in the process of reading the bits until L effective bits are read in the process of reading the data to form the current HARQ data packet according to the determined starting position of the read data.

6. The data reading method according to claim 1 or 5,

and in the process of reading the data according to the determined starting position of the read data to form the current HARQ data packet, if the reading reaches the end of the buffer in the process of reading the bits, the data is continuously read by winding to the starting position of the buffer.

7. A data reading method of finite length circular buffer rate matching includes the following steps:

determining the actual length N of a finite-length circular buffer_cb；

According to the redundancy version corresponding to the current hybrid automatic repeat request (HARQ) data packet, the initial position of the read data is determined by the following formula:

$k_0^i=R_{\mathrm{subblock}}^{\mathrm{TC}}\·[2\×\mathrm{Operation}(\frac{N_{\mathrm{cb}}}{2\×R_{\mathrm{subblock}}^{\mathrm{TC}}\·N_{\mathrm{rv}}}\·\frac{Q}{P})\·{\mathrm{rv}}_{\mathrm{idx}}+\mathrm{Offset}],$

wherein,

is the number of rows of the finite length circular buffer matrix; operation (·) represents the rounding correction function; n is a radical of_rvRepresents the number of redundancy versions;

is a proportionality constant for controlling the distance between the starting positions; rv_idxRepresents the value of each redundancy version, and is in the set {0, 1.. N_rv-1} is selected; offset represents the first redundancy version value, rv_idxThe HARQ packet starting point corresponding to 0 is offset by an offset column from the starting point of the first column of the finite length circular buffer, the offset being a specific known integer, and

the above-mentionedIs the number of columns of the finite length circular buffer matrix;

reading out the code word bits with the length L from top to bottom column by column along the sequence of the columns from the determined initial position of the read data to form a current HARQ data packet, and sending the current HARQ data packet, wherein L is the size of the current HARQ data packet.

8. The data reading method according to claim 7, wherein the rounding modification function operation () is a round-up function, a round-down function, or a round-up function.

9. The data reading method of claim 7, wherein the redundancy version specifies N_rvColumn index of columns column index sequence of a finite length circular buffer matrix $\left[\begin{array}{cccc}0,& 1,& ...,& C_{\mathrm{limited}}^{\mathrm{TC}}-1\end{array}\right]$ Above value, the

Is the number of columns of a limited length circular buffer matrix, the number of redundancy versions N_rvIs 3, 4, 6 or 8.

10. The data reading method of claim 7,

actual length N of the finite length circular buffer_cbThe determination is as follows: n is a radical of_cb＝min(N_IR，K_w) Wherein min (-) represents the minimum value operation, N_IRIs the size of the available buffer for the input code block, K_wIs the size of the circular buffer.

11. The data reading method of claim 7,

and skipping not to read if the filling bits and the dummy bits are encountered in the process of reading the bits until L effective bits are read in the process of reading the data to form the current HARQ data packet according to the determined starting position of the read data.

12. The data reading method according to claim 7 or 11,

and in the process of reading the data according to the determined starting position of the read data to form the current HARQ data packet, if the reading reaches the end of the buffer in the process of reading the bits, the data is continuously read by winding to the starting position of the buffer.

13. A data reading method of finite length circular buffer rate matching includes the following steps:

A. determining the actual length N of a finite-length circular buffer_cbAnd a proportionality constant for controlling the distance between the starting positions;

B. according to the redundancy version corresponding to the current hybrid automatic repeat request (HARQ) data packet and the proportionality constant for controlling the distance between the initial positions, the initial position of the read data is determined by any one of the following four formulas:

$k_0^i=R_{\mathrm{subblock}}^{\mathrm{TC}}\·[2\×\mathrm{Operation}(\frac{N_{\mathrm{cb}}}{2\×R_{\mathrm{subblock}}^{\mathrm{TC}}\·N_{\mathrm{rv}}}\·\frac{Q}{P}\·{\mathrm{rv}}_{\mathrm{idx}})+\mathrm{Offset}];$ or,

$k_0^i=R_{\mathrm{subblock}}^{\mathrm{TC}}\·[2\×\mathrm{Operation}(\frac{N_{\mathrm{cb}}}{2\×R_{\mathrm{subblock}}^{\mathrm{TC}}\·N_{\mathrm{rv}}}\·\frac{Q}{P})\·{\mathrm{rv}}_{\mathrm{idx}}+\mathrm{Offset}];$ or,

$k_0^i=R_{\mathrm{subblock}}^{\mathrm{TC}}\·[\mathrm{Operation}(\frac{N_{\mathrm{cb}}}{R_{\mathrm{subblock}}^{\mathrm{TC}}\·N_{\mathrm{rv}}}\·\frac{Q}{P})\·{\mathrm{rv}}_{\mathrm{idx}}+\mathrm{Offset}];$ or,

$k_0^i=R_{\mathrm{subblock}}^{\mathrm{TC}}\·[\mathrm{Operation}(\frac{N_{\mathrm{cb}}}{R_{\mathrm{subblock}}^{\mathrm{TC}}\·N_{\mathrm{rv}}}\·\frac{Q}{P}\·{\mathrm{rv}}_{\mathrm{idx}})+\mathrm{Offset}];$

wherein,

is the number of rows of the finite length circular buffer matrix; operation (·) represents the rounding correction function; n is a radical of_rvRepresents the number of redundancy versions;

is a proportionality constant for controlling the distance between the starting positions; rv_idxRepresents the value of each redundancy version, and is in the set {0, 1.. N_rv-1} is selected; offset represents the first redundancy version value, rv_idxThe HARQ packet starting point corresponding to 0 is offset by an offset column from the starting point of the first column of the finite length circular buffer, the offset being a specific known integer, and

the above-mentionedIs the number of columns of the finite length circular buffer matrix;

C. reading out the code word bits with the length L from top to bottom column by column along the sequence of the columns from the determined initial position of the read data to form a current HARQ data packet, and sending the current HARQ data packet, wherein L is the size of the current HARQ data packet.

14. The data reading method of claim 13,

the rounding correction function operation () is an up-rounding function, or a down-rounding function, or a rounding function.

15. The data reading method of claim 13,

n specified by the redundancy version_rvColumn index of columns column index sequence of a finite length circular buffer matrix $\left[\begin{array}{cccc}0,& 1,& ...,& C_{\mathrm{limited}}^{\mathrm{TC}}-1\end{array}\right]$ Above value, the

Is the number of columns of a limited length circular buffer matrix, the number of redundancy versions N_rvIs 3, 4, 6 or 8.

16. The data reading method of claim 13,

actual length N of the finite length circular buffer_cbThe determination is as follows: n is a radical of_cb＝min(N_ir，k_w) Wherein min (-) represents the minimum value operation, N_IRIs the size of the available buffer for the input code block, K_wIs the size of the circular buffer.

17. The data reading method of claim 13,

and skipping not to read if the filling bits and the dummy bits are encountered in the process of reading the bits until L effective bits are read in the process of reading the data to form the current HARQ data packet according to the determined starting position of the read data.

18. The data reading method of claim 13,

and in the process of reading the data according to the determined starting position of the read data to form the current HARQ data packet, if the reading reaches the end of the buffer in the process of reading the bits, the data is continuously read by winding to the starting position of the buffer.

19. A method for determining a data read start position in finite length circular buffer rate matching comprises the following steps:

according to the redundancy version corresponding to the current hybrid automatic repeat request (HARQ) data packet, the initial position of the read data is determined by the following formula:

$k_0^i=R_{\mathrm{subblock}}^{\mathrm{TC}}\·[2\×\mathrm{Operation}(\frac{N_{\mathrm{cb}}}{2\×R_{\mathrm{subblock}}^{\mathrm{TC}}\·N_{\mathrm{rv}}}\·\frac{Q}{P}\·{\mathrm{rv}}_{\mathrm{idx}})+\mathrm{Offset}],$

wherein,

is the number of rows of the finite length circular buffer matrix; operation (·) represents the rounding correction function; actual length N of finite length circular buffer_cb；N_rvRepresents the number of redundancy versions;

is a proportionality constant for controlling the distance between the starting positions；rv_idxRepresents the value of each redundancy version, and is in the set {0, 1.. N_rv-1} is selected; offset represents the first redundancy version value, rv_idxThe HARQ packet starting point corresponding to 0 is offset by an offset column from the starting point of the first column of the finite length circular buffer, the offset being a specific known integer, and

the above-mentioned

Is the number of columns of the finite length circular buffer matrix.

20. A method for determining a data read start position in finite length circular buffer rate matching comprises the following steps:

according to the redundancy version corresponding to the current hybrid automatic repeat request (HARQ) data packet, the initial position of the read data is determined by the following formula:

$k_0^i=R_{\mathrm{subblock}}^{\mathrm{TC}}\·[2\×\mathrm{Operation}(\frac{N_{\mathrm{cb}}}{2\×R_{\mathrm{subblock}}^{\mathrm{TC}}\·N_{\mathrm{rv}}}\·\frac{Q}{P})\·{\mathrm{rv}}_{\mathrm{idx}}+\mathrm{Offset}],$

wherein,

is the number of rows of the finite length circular buffer matrix; operation (·) represents the rounding correction function; actual length N of finite length circular buffer_cb；N_rvRepresents the number of redundancy versions;is a proportionality constant for controlling the distance between the starting positions; rv_idxRepresents the value of each redundancy version, and is in the set {0, 1.. N_rv-1} is selected; offset represents the first redundancy version value, rv_idxThe HARQ packet starting point corresponding to 0 is offset by an offset column from the starting point of the first column of the finite length circular buffer, the offset being a specific known integer, andthe above-mentionedIs the number of columns of the finite length circular buffer matrix.

21. A method for determining a data read start position in finite length circular buffer rate matching comprises the following steps:

according to the redundancy version corresponding to the current hybrid automatic repeat request (HARQ) data packet, the initial position of the read data is determined by the following formula:

$k_0^i=R_{\mathrm{subblock}}^{\mathrm{TC}}\·[\mathrm{Operation}(\frac{N_{\mathrm{cb}}}{R_{\mathrm{subblock}}^{\mathrm{TC}}\·N_{\mathrm{rv}}}\·\frac{Q}{P})\·{\mathrm{rv}}_{\mathrm{idx}}+\mathrm{Offset}];$ or,

$k_0^i=R_{\mathrm{subblock}}^{\mathrm{TC}}\·[\mathrm{Operation}(\frac{N_{\mathrm{cb}}}{R_{\mathrm{subblock}}^{\mathrm{TC}}\·N_{\mathrm{rv}}}\·\frac{Q}{P}\·{\mathrm{rv}}_{\mathrm{idx}})+\mathrm{Offset}];$

wherein,

is the number of rows of the finite length circular buffer matrix; operation (·) denotes the rounding correction function(ii) a Actual length N of finite length circular buffer_cb；N_rvRepresents the number of redundancy versions;is a proportionality constant for controlling the distance between the starting positions; rv_idxRepresents the value of each redundancy version, and is in the set {0, 1.. N_rv-1} is selected; offset represents the first redundancy version value, rv_idxThe HARQ packet starting point corresponding to 0 is offset by an offset column from the starting point of the first column of the finite length circular buffer, the offset being a specific known integer, and

the above-mentioned

Is the number of columns of the finite length circular buffer matrix.

Images