CN101227259A - 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

A kind of method for reading data of limited length circulating buffer memory rate coupling

Technical field

The present invention relates to digital communicating field, particularly the method for reading data of a kind of limited length circulating buffer memory rate coupling in the field of channel coding.

Background technology

As substituting of third generation partner program 3GPP (3rd Generation Partnership Project) Rel-6 speed matching algorithm, rate-matched (Circular Buffer RateMatching based on cyclic buffer, CBRM) provide a method of deleting surplus pattern that can generate function admirable simply, its concrete structure as shown in Figure 1.

In the circular buffering speed matching method, each data flow will be rearranged by sub-interleaver separately, is called as in the piece interweave (sub-block interleaver); Usually realize in order to simplify hardware, the columns of block interleaver is fixed, and line number changes along with the change of weaving length, so circular buffer can be regarded the ranks buffer memory of " R capable * C row " as, promptly regard " R capable * C row " virtual buffer memory as, as shown in Figure 2.

For example in the circular buffering speed matching method of 3GPP, interweaving in the piece that is adopted is exactly the block interleaver that a columns is fixed 32 row.Because systematic bits, first check bit and three data flow of second check bit are arranged in the circular buffer, so " circular buffer " can regard the virtual cache that a columns is 96 row as.In single output buffers, the systematic bits after resetting is placed on the starting position, place the check bit data flow of two rearrangements subsequently alternately, be called as interblock and interweave.For the code check (Rate) of expectation, it is that somewhere starting point from buffer memory calls over L bit that the bit of circular buffering rate-matched is selected, as the output of rate-matched.Generally speaking, the bit that is selected for transmission can begin to be read out and from any one point of buffer memory, if arrive the end of buffer memory, can continue read data around the starting position to buffer memory, up to finish read L bit till.

Mixing automatic request retransmission (HARQ) is extremely important link adaptation techniques in a kind of digital communication system.Receiving terminal is deciphered the HARQ packet of its reception, if decoding correctly then the feeding back ACK signal give transmitting terminal, notify it to send new HARQ packet; If decoding failure then feeds back the NACK signal and gives transmitting terminal, the request transmitting terminal resends the HARQ packet.Receiving terminal can improve its successfully decoded probability by the packet that repeatedly retransmits being carried out IR or Chase merging decoding, realizes the high reliability request of link transmission.

Mixing under automatic request retransmission (HARQ) mode start position that in circular buffer, can specify different positions to read as each transmitting HARQ packet.Redundancy versions (RedundancyVersion, a plurality of start positions that the HARQ packet reads have promptly been determined in definition RV) in circular buffer, the redundancy versions value has just been determined the concrete start position that this transmitting HARQ packet reads in circular buffer.For example in the 3GPP system, based on HARQ processing procedure definition 4 kinds of RV versions (RV=0,1,2,3) of circular buffering rate-matched.Each HARQ retransmits the long child bag of L is starting point from the redundancy versions definition, chooses L bit composition clockwise.

The HARQ function comprises twice rate-matched and a virtual I R buffer memory, and the rate-matched process matches virtual I R buffer memory with the input bit number for the first time, and virtual I R buffer memory is disposed by high level.If the input bit number is no more than the ability of virtual I R, does not then need any bit of being struck off, otherwise need remove unnecessary bit.For the second time the rate-matched process is in order to meet the requirement of channel, the bit number after the first time rate-matched is matched total bit number of a plurality of physical channels.

The length of limited length circular buffer is limited, and its rate-matched is on the basis of restriction circular buffer length, according to the bit rate output of expectation, selects L coded-bit, as the output of circulating buffer memory rate coupling; Similar with the rate-matched of non-limited circular buffer, the bit that is selected for transmission can begin to read out in any position from buffer.If reach the end of buffer, can continue reading of data around starting position to buffer.Usually in limited length circular buffer, can specify different positions as the start position that each transmitting HARQ packet reads, promptly formulate the start position of the HARQ bag of redundancy versions value correspondence.

In some communication system, in order to save signaling consumption, with the redundancy versions of RV=0 and new data indicator (New Data Indicator, NDI) multiplexing, be that RV=0 had both represented that the redundancy versions value is the starting point of 0 HARQ bag reading of data, also represented the starting point of a new data block simultaneously.Like this, for fear of obscuring, in the retransmission processes of a data block, RV=0 can only not allow to re-use RV=0 as the starting point that reads that the first time, HARQ wrapped in the later re-transmission.For example, in 3GPP, the value sequence of 8 re-transmission RV is RV={0,2,1,3,2,1,3, and 2}.Considering under the multiplexing situation of RV=0 and NDI; between RV=0 and the RV=1; between RV=1 and the RV=2; distance between RV=2 and the RV=3 should be identical; and the distance between last RV (for example RV=3) and the RV=0 should be less, and the distribution mode of this RV is the protection system bit better.

In the speed matching method of existing limited length circular buffer, have such problem: the spacing between each RV can be along with the size of limited length circular buffer fluctuations, the distance between last RV and the RV=0 under some particular case in addition equal RV=0 and RV=1 between distance, existing RV distributes and obviously can not adapt to the multiplexing situation of RV=0 and NDI in the limited buffer memory.Method provided by the invention can make the starting point that reads of HARQ packet concern according to a certain percentage and reasonably be distributed in the limited length circular buffer, compares with existing method and can obtain better retransmission performance.

Summary of the invention

Technical problem to be solved by this invention is, a kind of method for reading data of limited length circulating buffer memory rate coupling is provided,, reads the position according to the reasonable specified data of redundant length at the deficiencies in the prior art, form the HARQ bag, so that improve the retransmission performance of HARQ bag.

The invention provides a kind of method for reading data of limited length circulating buffer memory rate coupling, comprise the steps:

Determine the physical length N of limited length circular buffer _Cb

According to the automatic request retransmission of current mixing is HARQ packet corresponding redundancy, utilizes following formula to determine that the original position of reading of data is:

$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, R _Subblock ^TCIt is the line number of limited length circular buffer matrix; Operation () expression rounds correction function; N _RvThe number of expression redundancy versions; It is the proportionality constant that is used to control the distance between each original position; Rv _IdxThe value of representing each redundancy versions, the set 0,1 ... N _Rv-1) value in; Offset represents that first redundancy versions value is rv _IdxBe offset between the starting point of relatively limited length circular buffer first row of the HARQ packet starting point of=0 correspondence.The offset row, offset is known specific integer, and $0\&le;\mathrm{offset}<C_{\mathrm{subblock}}^{\mathrm{TC}},$ Described C _Limited ^TCIt is limited length circular buffer matrix column number;

From the original position of determined reading of data, by being listed as the code word bits of reading length L from top to bottom, form current HARQ packet along the order that is listed as, described current HARQ packet is sent, described L is the size of current HARQ packet.

Wherein, the described correction function operation () that rounds is round up function or the downward bracket function or the bracket function that rounds off.

Wherein, the N of described redundancy versions appointment _RvRow column index respectively limited length circular buffer matrix column index sequence [0,1 ... C _Limited ^TC-1] goes up value, described C _Limited ^TCBe limited length circular buffer matrix column number, the number N of described redundancy versions _RvBe 3,4,6 or 8.

The physical length N of described limited length circular buffer _CbBe defined as: N _Cb=min (N _IR, K _w), wherein, minimum operation, N are got in min () expression _IRBe the size of input code block available cache memory, K _wIt is the size of circular buffer.

Forming according to the original position reading of data of determined reading of data in the process of current HARQ packet,, then skipping and do not read, till reading L significant bit if in reading the process of bit, run into filling bit and dummy bit.

Forming according to the original position reading of data of determined reading of data in the process of current HARQ packet,, then continuing reading of data around starting position to buffer if in reading the process of bit, read the end that reaches buffer.

The present invention also provides a kind of method for reading data of limited length circulating buffer memory rate coupling, comprises the steps:

Determine the physical length N of limited length circular buffer _Cb

According to the automatic request retransmission of current mixing is HARQ packet corresponding redundancy, utilizes following formula to determine that the original position of reading of data is:

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

Wherein, R _Subblock ^TCIt is the line number of limited length circular buffer matrix; Operation () expression rounds correction function; N _RvThe number of expression redundancy versions; It is the proportionality constant that is used to control the distance between each original position; Rv _IdxThe value of representing each redundancy versions, the set 0,1 ... N _Rv-1) value in; Offset represents that first redundancy versions value is rv _IdxSkew offset row between the starting point of relatively limited length circular buffer first row of the HARQ packet starting point of=0 correspondence, offset is known specific integer, and $0\&le;\mathrm{offset}<C_{\mathrm{subblock}}^{\mathrm{TC}},$ Described C _Limited ^TCIt is limited length circular buffer matrix column number;

From the original position of determined reading of data, by being listed as the code word bits of reading length L from top to bottom, form current HARQ packet along the order that is listed as, described current HARQ packet is sent, described L is the size of current HARQ packet.

Wherein, the described correction function operation () that rounds is round up function or the downward bracket function or the bracket function that rounds off.

Wherein, the N of described redundancy versions appointment _RvRow column index limited length circular buffer matrix column index sequence [0,1 ... C _Limited ^TC-1] goes up value, described C _Limited ^TCBe limited length circular buffer matrix column number, the number N of described redundancy versions _RvBe 3,4,6 or 8.

The physical length N of described limited length circular buffer _CbBe defined as: N _Cb=min (N _IR, K _w), wherein, minimum operation, N are got in min () expression _IRBe the size of input code block available cache memory, K _wIt is the size of circular buffer.

Forming according to the original position reading of data of determined reading of data in the process of current HARQ packet,, then skipping and do not read, till reading L significant bit if in reading the process of bit, run into filling bit and dummy bit.

Forming according to the original position reading of data of determined reading of data in the process of current HARQ packet,, then continuing reading of data around starting position to buffer if in reading the process of bit, read the end that reaches buffer.

The present invention also provides the method for reading data of another kind of limited length circulating buffer memory rate coupling, comprises the steps:

A, determine the physical length N of limited length circular buffer _CbAnd the proportionality constant that is used to control the distance between each original position;

B, be HARQ packet corresponding redundancy and the proportionality constant that is used to control the distance between each original position, determine the original position of reading of data according to the automatic request retransmission of current mixing;

C, from the original position of determined reading of data, read the code word bits of length L from top to bottom by row along the order of row, form current HARQ packet, described current HARQ packet is sent, described L is the size of current HARQ packet.

Further, among the step B, utilize following formula to determine that the original position of reading of data is:

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

Wherein, R _Subblock ^TCIt is the line number of limited length circular buffer matrix; Operation () expression rounds correction function; N _RvThe number of expression redundancy versions;

It is the proportionality constant that is used to control the distance between each original position; Rv _IdxThe value of representing each redundancy versions, the set 0,1 ... N _Rv-1) value in; Offset represents that first redundancy versions value is rv _IdxBe offset between the starting point of relatively limited length circular buffer first row of the HARQ packet starting point of=0 correspondence.The offset row, offset is known specific integer, and $0\&le;\mathrm{offset}<C_{\mathrm{subblock}}^{\mathrm{TC}},$ Described C _Limited ^TCIt is limited length circular buffer matrix column number.

Further, among the step B, utilize following formula to determine that the original position of reading of data is:

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

Wherein, R _Subblock ^TCIt is the line number of limited length circular buffer matrix; Operation () expression rounds correction function; N _RvThe number of expression redundancy versions;

It is the proportionality constant that is used to control the distance between each original position; Rv _IaxThe value of representing each redundancy versions, the set 0,1 ... N _Rv-1) value in; Offset represents that first redundancy versions value is rv _IdxBe offset between the starting point of relatively limited length circular buffer first row of the HARQ packet starting point of=0 correspondence.The offset row, offset is known specific integer, and $0\&le;\mathrm{offset}<C_{\mathrm{subblock}}^{\mathrm{TC}},$ Described C _Limited ^TCIt is limited length circular buffer matrix column number.

Wherein, the described correction function operation () that rounds is round up function or the downward bracket function or the bracket function that rounds off.

The N of described redundancy versions appointment _RvRow column index limited length circular buffer matrix column index sequence [0,1 ... C _Limited ^TC-1] goes up value, described C _Limited ^TCBe limited length circular buffer matrix column number, the number N of described redundancy versions _RvBe 3,4,6 or 8.

The physical length N of described limited length circular buffer _CbBe defined as: N _Cb=min (N _IR, K _w), wherein, minimum operation, N are got in min () expression _IRBe the size of input code block available cache memory, K _wIt is the size of circular buffer.

Forming according to the original position reading of data of determined reading of data in the process of current HARQ packet,, then skipping and do not read, till reading L significant bit if in reading the process of bit, run into filling bit and dummy bit.

Forming according to the original position reading of data of determined reading of data in the process of current HARQ packet,, then continuing reading of data around starting position to buffer if in reading the process of bit, read the end that reaches buffer.

The present invention also provides specified data in a kind of limited length circulating buffer memory rate coupling to read the method for original position, comprising:

According to the automatic request retransmission of current mixing is HARQ packet corresponding redundancy, utilizes following formula to determine that the original position of reading of data is:

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

Wherein, R _Subblock ^TCIt is the line number of limited length circular buffer matrix; Operation () expression rounds correction function; The physical length N of limited length circular buffer _CbN _RvThe number of expression redundancy versions;

It is the proportionality constant that is used to control the distance between each original position; Rv _IdxThe value of representing each redundancy versions, the set 0,1 ... N _Rv-1) value in; Offset represents that first redundancy versions value is rv _IdxSkew offset row between the starting point of relatively limited length circular buffer first row of the HARQ packet starting point of=0 correspondence, offset is known specific integer, and $0\&le;\mathrm{offset}<C_{\mathrm{subblock}}^{\mathrm{TC}},$ Described C _Limited ^TCIt is limited length circular buffer matrix column number.

The present invention also provides specified data in the another kind of limited length circulating buffer memory rate coupling to read the method for original position, comprising:

According to the automatic request retransmission of current mixing is HARQ packet corresponding redundancy, utilizes following formula to determine that the original position of reading of data is:

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

Wherein, R _Subblock ^TCIt is the line number of limited length circular buffer matrix; Operation () expression rounds correction function; The physical length N of limited length circular buffer _CbN _RvThe number of expression redundancy versions; It is the proportionality constant that is used to control the distance between each original position; Rv _IdxThe value of representing each redundancy versions, the set 0,1 ... N _Rv-1) value in; Offset represents that first redundancy versions value is rv _IdxBe offset between the starting point of relatively limited length circular buffer first row of the HARQ packet starting point of=0 correspondence.The offset row, offset is known specific integer, and $0\&le;\mathrm{offset}<C_{\mathrm{subblock}}^{\mathrm{TC}},$ Described C _Limited ^TCIt is limited length circular buffer matrix column number.

The present invention provides specified data in the another kind of limited length circulating buffer memory rate coupling to read the method for original position again, comprising:

According to the automatic request retransmission of current mixing is HARQ packet corresponding redundancy, utilizes following formula to determine that the original position of reading of data is:

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

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

Wherein, R _Subblock ^TCIt is the line number of limited length circular buffer matrix; Operation () expression rounds correction function; The physical length N of limited length circular buffer _CbN _RvThe number of expression redundancy versions;

It is the proportionality constant that is used to control the distance between each original position; Rv _IdxThe value of representing each superfluous She's version, the set 0,1 ... N _Rv-1) value in; Offset represents that first redundancy versions value is rv _IdxBe offset between the starting point of relatively limited length circular buffer first row of the HARQ packet starting point of=0 correspondence.The offset row, offset is known specific integer, and $0\&le;\mathrm{offset}<C_{\mathrm{subblock}}^{\mathrm{TC}},$ Described C _Limited ^TCIt is limited length circular buffer matrix column number.

Method of the present invention, can be according to the position of redundant length, especially in conjunction with the proportionality constant that is used to control the distance between each original position, read the position by calculating specified data, overcome that the HARQ packet reads the bigger problem of interval variation in the prior art, make the starting point that reads of HARQ packet concern reasonably according to a certain percentage and be distributed in the limited length circular buffer.Improve the retransmission performance of HARQ bag with prior art phase specific energy.

Description of drawings

Fig. 1 is the structure of circular buffering rate-matched;

Fig. 2 is the continuous transmission structure of virtual circular buffering rate-matched;

Fig. 3 is a two-dimensional finite length circular buffer structure;

Fig. 4 is the speed matching method FB(flow block) of the limited length circular buffer of the embodiment of the invention.

Embodiment

For making the purpose, technical solutions and advantages of the present invention clearer, the present invention is described in further detail below in conjunction with accompanying drawing.

The HARQ packet reads the bigger problem of interval variation in the prior art in order to overcome in the present invention, a kind of method for reading data of rate-matched of limited length circular buffer is provided, makes the starting point that reads of HARQ packet concern reasonably according to a certain percentage and be distributed in the limited length circular buffer.

In embodiments of the present invention, setting limited length circular buffer is the matrix array of the capable C row of R, and redundancy versions is used for determining which row from matrix begin reading of data, as shown in Figure 3.Method of the present invention can be according to the position of redundant length, and specified data reads the position, especially increases the proportionality constant be used to control the distance between each original position, also needs to consider the interval between this redundant length position when determining original position.For the rate-matched of the limited length circular buffer array of Turbo code, method of the present invention may further comprise the steps:

Step 1: at first, determine the physical length of limited length circular buffer;

Step 2:, determine the original position k of reading of data according to current HARQ packet corresponding redundancy ₀

Wherein, described redundancy versions RV is used for determining from R _Subblock ^TC* C _Limited ^TCWhich row beginnings read data, wherein R of two-dimensional finite length circular buffer matrix _Subblock ^TCBe the line number of limited length circular buffer matrix, C _Limited ^TCIt is limited length circular buffer matrix column number.Redundancy versions 0,1 ... N _RvThe N of-1} appointment _RvRow column index respectively the column index sequence [0,1 ... C _Limited ^TC-1] goes up value, establish here that the next adjacent element of last element is first element in the column index sequence;

Step 3:, by being listed as the code word bits of reading length L from top to bottom, form current HARQ packet along the order that is listed as from the described original position of step 2;

Step 4: send current HARQ packet to the subsequent treatment module.

In described step 1, the physical length N of limited length circular buffer _Cb=min (N _IR, K _w).Wherein minimum operation, N are got in min () expression _IRBe the size of input code block available cache memory (for example, the virtual I R buffer memory of rate-matched) for the first time, K _wIt is the size of circular buffer.The method of calculating limited length circular buffer is not limited thereto.

In described step 2, the original position of the HARQ packet of each redundancy versions value correspondence is calculated by following formula 1:

Formula 1: $k_0^i=R_{\mathrm{subblock}}^{\mathrm{TC}}\&CenterDot;[2\&times;\mathrm{Operation}(\frac{N_{\mathrm{cb}}}{2\&times;R_{\mathrm{subblock}}^{\mathrm{TC}}\&CenterDot;N_{\mathrm{rv}}}\&CenterDot;\frac{Q}{P}\&CenterDot;{\mathrm{rv}}_{\mathrm{idx}})+\mathrm{Offset}],$

Wherein, N _RvThe number of expression redundancy versions, N _Rv=3,4,6 or 8;

Be a proportionality constant, be used to control the distance between each original position;

Rv _IdxThe value of representing each redundancy versions, it the set 0,1 ... N _RvValue among the-1};

Offset represents first redundancy versions value (rv _Idx=0) skew offset row between the starting point of the corresponding relative two-dimensional finite length of HARQ packet starting point circular buffer first row, offset is known specific integer, and $0\&le;\mathrm{offset}<C_{\mathrm{subblock}}^{\mathrm{TC}}.$

Operation () expression rounds correction, and the method for correction can be round up (ceil), rounds (floor) downwards or round off to round (round).

Use above-mentioned formula $k_0^i=R_{\mathrm{subblock}}^{\mathrm{TC}}\&CenterDot;[2\&times;\mathrm{Operation}(\frac{N_{\mathrm{cb}}}{2\&times;R_{\mathrm{subblock}}^{\mathrm{TC}}\&CenterDot;N_{\mathrm{rv}}}\&CenterDot;\frac{Q}{P}\&CenterDot;{\mathrm{rv}}_{\mathrm{idx}})+\mathrm{Offset}],$ Can be limited to even column and begin reading of data, simultaneously can be so that position calculation is more level and smooth.

The HARQ packet original position that need to prove each redundancy versions value correspondence can also have following distortion:

Formula 2: $k_0^i=R_{\mathrm{subblock}}^{\mathrm{TC}}\&CenterDot;[2\&times;\mathrm{Operation}(\frac{N_{\mathrm{cb}}}{2\&times;R_{\mathrm{subblock}}^{\mathrm{TC}}\&CenterDot;N_{\mathrm{rv}}}\&CenterDot;\frac{Q}{P})\&CenterDot;{\mathrm{rv}}_{\mathrm{idx}}+\mathrm{Offset}];$ Perhaps,

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

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

Also be to be limited to even column to begin reading of data in the described formula 2, whether then do not limit in the formula 3 and 4 from even column, can from odd number or idol row beginning reading of data.

Above-mentioned these distortion also should be in protection scope of the present invention, and the parameter in the formula 2,3,4 is identical with parameter in the formula 1, repeats no more.

In step 3, begin from finite length speed buffer memory, to read in proper order the current HARQ bag of L bit (L is the size of current HARQ packet) composition from the start position of current redundancy versions correspondence, if in reading the process of bit, run into " filling " bit (padding bits) and " dummy bit ", then skip and do not read, till reading L significant bit.According to the characteristics of circular buffer,, can continue reading of data around starting position to buffer if reach the end of buffer.

In addition, the method for the invention is applicable to that not only (New Data Indicator, NDI) multiplexing situation is applicable to non-multiplexing situation too with the redundancy versions of RV=0 and new data indicator.

Application example:

As shown in Figure 4, in the embodiment of the invention, the method for reading data that mates for limited length circulating buffer memory rate may further comprise the steps:

Step 401: the code block available cache memory size that system is provided with is N _IR, the length of circular buffer is K _w, the size of limited length circular buffer: N then _Cb=min (N _IR, K _w); Promptly choose in code block available cache memory size and the circular buffer length minimum value as the size of limited length circular buffer.The definite of the size of limited length circular buffer can also adopt alternate manner to determine.

Step 402: the number N of current redundancy versions _Rv=4, the call number of data is since 0 number consecutively, and column index is number also since 0 number consecutively from left to right.

Suppose first redundancy versions value (rv _Idx=0) differs between the starting point of Dui Ying HARQ packet starting point and two-dimensional finite length circular buffer first row.The offset=2 row, and get $\frac{Q}{P}=\frac{7}{6},$ Each redundancy versions value (rv then _Idx=0) the original position index of Dui Ying HARQ packet:

Wherein, i=0,1,2,3, the modification method of operation () employing here is round up (ceil), certainly, operation () also can adopt other modification method.

The original position index that it may be noted that the HARQ packet of each redundancy versions value correspondence also can calculate with following formula:

Or,

Or,

Step 403: if rv _Idx=0 is again the designator (NDI) of new data simultaneously, then only when retransmitting for the first time from rv _Idx=0 position begins reading of data, does not begin read data from this position in the retransmission processes afterwards.Here, suppose to retransmit for 8 times the redundancy versions value for 0,2,1,3,2,1,3,2}, the HARQ data packet length that needs to send is the L bit.Each re-transmission all is the position from redundancy versions value correspondence, read the code word bits of length L from top to bottom by row along the order of row, form current HARQ packet, read in the process of bit, if run into " filling " bit (padding bits) and " dummy bit ", then skip and do not read, till reading L significant bit.According to the characteristics of circular buffer,, can continue reading of data around starting position to buffer if reach the end of buffer.

Step 404: send current HARQ packet to the subsequent treatment module.

Described herein only is the preferred embodiments of the present invention, be not limited to the present invention, for a person skilled in the art, under the situation of spirit of the present invention and essence, the technical staff can produce other embodiment according to the present invention, and the present invention can have various changes and variation.Therefore, all any modifications of being done within the spirit and principles in the present invention, be equal to replacement, improve and upgrade or the like, all should be included within protection scope of the present invention.

Claims (23)

1. the method for reading data of a limited length circulating buffer memory rate coupling comprises the steps:

Determine the physical length N of limited length circular buffer _Cb

According to the automatic request retransmission of current mixing is HARQ packet corresponding redundancy, utilizes following formula to determine that the original position of reading of data is:

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

Wherein, R _Subblock ^TCIt is the line number of limited length circular buffer matrix; Operation () expression rounds correction function; N _RvThe number of expression redundancy versions;

It is the proportionality constant that is used to control the distance between each original position; Rv _IdxThe value of representing each redundancy versions, the set 0,1 ... N _Rv-1) value in; Offset represents that first redundancy versions value is rv _IdxSkew offset row between the starting point of relatively limited length circular buffer first row of the HARQ packet starting point of=0 correspondence, offset is known specific integer, and $0\&le;\mathrm{offset}<C_{\mathrm{subblock}}^{\mathrm{TC}},$ Described C _Limited ^TCIt is limited length circular buffer matrix column number;

From the original position of determined reading of data, by being listed as the code word bits of reading length L from top to bottom, form current HARQ packet along the order that is listed as, described current HARQ packet is sent, described L is the size of current HARQ packet.

2. method for reading data as claimed in claim 1 is characterized in that, the described correction function operation () that rounds is round up function or the downward bracket function or the bracket function that rounds off.

3. method for reading data as claimed in claim 1 is characterized in that, the N of described redundancy versions appointment _RvRow column index respectively limited length circular buffer matrix column index sequence [0,1 ... C _Limited ^TC-1] goes up value, described C _Limited ^TCBe limited length circular buffer matrix column number, the number N of described redundancy versions _RvBe 3,4,6 or 8.

4. method for reading data as claimed in claim 1 is characterized in that,

The physical length N of described limited length circular buffer _CbBe defined as: N _Cb=min (N _IR, K _w), wherein, minimum operation, N are got in min () expression _IRBe the size of input code block available cache memory, K _wIt is the size of circular buffer.

5. method for reading data as claimed in claim 1 is characterized in that,

Forming according to the original position reading of data of determined reading of data in the process of current HARQ packet,, then skipping and do not read, till reading L significant bit if in reading the process of bit, run into filling bit and dummy bit.

6. as claim 1 or 5 described method for reading data, it is characterized in that,

Forming according to the original position reading of data of determined reading of data in the process of current HARQ packet,, then continuing reading of data around starting position to buffer if in reading the process of bit, read the end that reaches buffer.

7. the method for reading data of a limited length circulating buffer memory rate coupling comprises the steps:

Determine the physical length N of limited length circular buffer _Cb

According to the automatic request retransmission of current mixing is HARQ packet corresponding redundancy, utilizes following formula to determine that the original position of reading of data is:

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

Wherein, R _Subblock ^TCIt is the line number of limited length circular buffer matrix; Operation () expression rounds correction function; N _RvThe number of expression redundancy versions:

It is the proportionality constant that is used to control the distance between each original position; Rv _IdxThe value of representing each redundancy versions, the set 0,1 ... N _Rv-1) value in; Offset represents that first redundancy versions value is rv _IdxBe offset between the starting point of relatively limited length circular buffer first row of the HARQ packet starting point of=0 correspondence.The offset row, offset is known specific integer, and $0\&le;\mathrm{offset}<C_{\mathrm{subblock}}^{\mathrm{TC}},$ Described C _Limited ^TCIt is limited length circular buffer matrix column number;

From the original position of determined reading of data, by being listed as the code word bits of reading length L from top to bottom, form current HARQ packet along the order that is listed as, described current HARQ packet is sent, described L is the size of current HARQ packet.

8. method for reading data as claimed in claim 7 is characterized in that, the described correction function operation () that rounds is round up function or the downward bracket function or the bracket function that rounds off.

9. method for reading data as claimed in claim 7 is characterized in that, the N of described redundancy versions appointment _RvRow column index limited length circular buffer matrix column index sequence [0,1 ... C _Limited ^TC-1] goes up value, described C _Limited ^TCBe limited length circular buffer matrix column number, the number N of described redundancy versions _RvBe 3,4,6 or 8.

10. method for reading data as claimed in claim 7 is characterized in that,

The physical length N of described limited length circular buffer _CbBe defined as: N _Cb=min (N _IR, K _w), wherein, minimum operation, N are got in min () expression _IRBe the size of input code block available cache memory, K _wIt is the size of circular buffer.

11. method for reading data as claimed in claim 7 is characterized in that,

Forming according to the original position reading of data of determined reading of data in the process of current HARQ packet,, then skipping and do not read, till reading L significant bit if in reading the process of bit, run into filling bit and dummy bit.

12. as claim 7 or 11 described method for reading data, it is characterized in that,

Forming according to the original position reading of data of determined reading of data in the process of current HARQ packet,, then continuing reading of data around starting position to buffer if in reading the process of bit, read the end that reaches buffer.

13. the method for reading data of a limited length circulating buffer memory rate coupling comprises the steps:

A, determine the physical length N of limited length circular buffer _CbAnd the proportionality constant that is used to control the distance between each original position;

B, be HARQ packet corresponding redundancy and the proportionality constant that is used to control the distance between each original position, determine the original position of reading of data according to the automatic request retransmission of current mixing;

C, from the original position of determined reading of data, read the code word bits of length L from top to bottom by row along the order of row, form current HARQ packet, described current HARQ packet is sent, described L is the size of current HARQ packet.

14. method for reading data as claimed in claim 13 is characterized in that,

Among the step B, utilize following formula to determine that the original position of reading of data is:

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

Wherein, R _Subblock ^TCIt is the line number of limited length circular buffer matrix; Operation () expression rounds correction function; N _RvThe number of expression redundancy versions;

It is the proportionality constant that is used to control the distance between each original position; Rv _IdxThe value of representing each redundancy versions, the set 0,1 ... N _Rv-1) value in; Offset represents that first redundancy versions value is rv _IdxBe offset between the starting point of relatively limited length circular buffer first row of the HARQ packet starting point of=0 correspondence.The offset row, offset is known specific integer, and $0\&le;\mathrm{offset}<C_{\mathrm{subblock}}^{\mathrm{TC}},$ Described C _Limited ^TCIt is limited length circular buffer matrix column number.

15. method for reading data as claimed in claim 13 is characterized in that, among the step B, utilizes following formula to determine that the original position of reading of data is:

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

Wherein, R _Subblock ^TCIt is the line number of limited length circular buffer matrix; Operation () expression rounds correction function; N _RvThe number of expression redundancy versions;

It is the proportionality constant that is used to control the distance between each original position; Rv _IdxThe value of representing each redundancy versions, the set 0,1 ... N _Rv-1) value in; Offset represents that first redundancy versions value is rv _IdxBe offset between the starting point of relatively limited length circular buffer first row of the HARQ packet starting point of=0 correspondence.The offset row, offset is known specific integer, and $0\&le;\mathrm{offset}<C_{\mathrm{subblock}}^{\mathrm{TC}},$ Described C _Limited ^TCIt is limited length circular buffer matrix column number.

16. as claim 14 or 15 described method for reading data, it is characterized in that,

The described correction function operation () that rounds is round up function or the downward bracket function or the bracket function that rounds off.

17. as claim 14 or 15 described method for reading data, it is characterized in that,

The N of described redundancy versions appointment _RvRow column index limited length circular buffer matrix column index sequence [0,1 ... C _Limited ^TC-1] goes up value, described C _Limited ^TCBe limited length circular buffer matrix column number, the number N of described redundancy versions _RvBe 3,4,6 or 8.

18. as claim 14 or 15 described method for reading data, it is characterized in that,

The physical length N of described limited length circular buffer _CbBe defined as: N _Cb=min (N _IR, K _w), wherein, minimum operation, N are got in min () expression _IRBe the size of input code block available cache memory, K _wIt is the size of circular buffer.

19. as claim 14 or 15 described method for reading data, it is characterized in that,

Forming according to the original position reading of data of determined reading of data in the process of current HARQ packet,, then skipping and do not read, till reading L significant bit if in reading the process of bit, run into filling bit and dummy bit.

20. as claim 14 or 15 described method for reading data, it is characterized in that,

Forming according to the original position reading of data of determined reading of data in the process of current HARQ packet,, then continuing reading of data around starting position to buffer if in reading the process of bit, read the end that reaches buffer.

21. specified data read the method for original position during a limited length circulating buffer memory rate mated, and comprising:

According to the automatic request retransmission of current mixing is HARQ packet corresponding redundancy, utilizes following formula to determine that the original position of reading of data is:

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

Wherein, R _Subblock ^TCIt is the line number of limited length circular buffer matrix; Operation () expression rounds correction function; The physical length N of limited length circular buffer _CbN _RvThe number of expression redundancy versions;

It is the proportionality constant that is used to control the distance between each original position; Rv _IdxThe value of representing each redundancy versions, the set 0,1 ... N _Rv-1) value in; Offset represents that first redundancy versions value is rv _IdxBe offset between the starting point of relatively limited length circular buffer first row of the HARQ packet starting point of=0 correspondence.The offset row, offset is known specific integer, and $0\&le;\mathrm{offset}<C_{\mathrm{subblock}}^{\mathrm{TC}},$ Described C _Limited ^TCIt is limited length circular buffer matrix column number.

22. specified data read the method for original position during a limited length circulating buffer memory rate mated, and comprising:

According to the automatic request retransmission of current mixing is HARQ packet corresponding redundancy, utilizes following formula to determine that the original position of reading of data is:

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

Wherein, R _Subblock ^TCIt is the line number of limited length circular buffer matrix; Operation () expression rounds correction function; The physical length N of limited length circular buffer _CbN _RvThe number of expression redundancy versions;

It is the proportionality constant that is used to control the distance between each original position; Rv _IdxThe value of representing each redundancy versions, the set 0,1 ... N _Rv-1) value in; Offset represents that first redundancy versions value is rv _IdxSkew offset row between the starting point of relatively limited length circular buffer first row of the HARQ packet starting point of=0 correspondence, offset is known specific integer, and $0\&le;\mathrm{offset}<C_{\mathrm{subblock}}^{\mathrm{TC}},$ Described C _Limited ^TCIt is limited length circular buffer matrix column number.

23. specified data read the method for original position during a limited length circulating buffer memory rate mated, and comprising:

According to the automatic request retransmission of current mixing is HARQ packet corresponding redundancy, utilizes following formula to determine that the original position of reading of data is:

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

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

Wherein, R _Subblock ^TCIt is the line number of limited length circular buffer matrix; Operation () expression rounds correction function; The physical length N of limited length circular buffer _CbN _RvThe number of expression redundancy versions; It is the proportionality constant that is used to control the distance between each original position; Rv _IdxThe value of representing each redundancy versions, the set 0,1 ... N _Rv-1) value in; Offset represents that first redundancy versions value is rv _IdxBe offset between the starting point of relatively limited length circular buffer first row of the HARQ packet starting point of=0 correspondence.The offset row, offset is known specific integer, and $0\&le;\mathrm{offset}<C_{\mathrm{subblock}}^{\mathrm{TC}},$ Described C _Limited ^TCIt is limited length circular buffer matrix column number.

Images