Embodiment
The HARQ processing method and processing devices provided in an embodiment of the present invention based on CRC check are carried out below in conjunction with the accompanying drawings detailed
Thin description.
Fig. 2 is the HARQ process flow figures provided in an embodiment of the present invention based on CRC check.
Reference picture 2, in step S101, judge whether packet is new data packets, wherein, the new data packets include M
Code block, M are positive integer.
In step S102, if the packet is the new data packets, from first code block in the M code block
Traveled through to obtain at least one first data and at least one first solution bit selection data.
In step S103, if the packet is not the new data packets, followed from first in the M code block
Ring redundancy check code CRC check erroneous block is traveled through to obtain at least one second data and at least one second solution than special
Select data.
In step S104, at least one first data or at least one second data are subjected to code block level respectively
Connection, and carry out CRC check.
Further, if the packet is the new data packets, from first code in the M code block
Block is traveled through to obtain at least one first data and at least one first solution bit selects data to include, and repeats following place
Reason, until m-th code block is traversed:
Bit-level is carried out to first code block to handle to obtain first data;
First data are subjected to CRC check;
If first data store first data and carry out next code block by the CRC check
Bit-level processing;
If first data solve bit selection not over the CRC check, in stored bits level processing procedure
As a result, the first solution bit selection data are obtained, and remaining is not subjected to bit-level processing code block and all carries out solving at bit selection
Reason.
Here, when packet is new data packets, carry out solving rate-matched and decoding processing from first code block, and carry out
CRC check, if by CRC check, the first data are stored, and enter the processing of second code block, second code
Block continues to solve rate-matched and decoding processing, and carries out CRC check, to the last a code block (i.e. m-th code block), most
Posterior circle terminates.
If first code block carries out solution bit selection and handles to obtain the selection of the first solution bit not over CRC check
Data, and stored, since second code block, remaining code block all carries out the selection of solution bit and handled, to the last one
Code block (i.e. m-th code block), finally circulation terminate.
Further, if the packet is not the new data packets, first from the M code block
CRC CRC check erroneous block is traveled through to obtain at least one second solution of at least one second data than special
Selecting data includes, and repeats following processing, until the m-th code block is traversed:
First CRC check erroneous block progress bit-level is handled to obtain second data;
CRC check is carried out to second data;
If second data store second data and carry out next code block by the CRC check
Bit-level processing;
If second data are not over the CRC check, to first CRC check erroneous block bit
Obtained solution bit selection result is stored in level processing procedure, obtains the second solution bit selection data, and by remaining
The code block of only storage solution bit selection data carries out solving bit selection processing.
Here, when packet is not new data packets, from first CRC check erroneous block carry out solution rate-matched,
HARQ merges and the processing of decoding, and carries out CRC check, if by CRC check, the second data are stored, gone forward side by side
Enter the processing of second code block, second code block continues the processing for solving rate-matched, HARQ merges and decoded, and carries out
CRC check, to the last a code block (i.e. m-th code block), finally circulation terminate.
If first CRC check erroneous block carries out solution bit selection and handles to obtain second not over CRC check
Bit selection data are solved, and are stored, since second code block, remaining code block all carries out solving bit selection processing, directly
To a last code block (i.e. m-th code block), finally circulation terminates.
Further, it is described to carry out bit-level to first code block and handle to obtain first data to include:
Solution rate-matched is carried out to first code block and obtains the 3rd data;
3rd data are entered into row decoding and obtain first data.
Further, it is described to handle first CRC check erroneous block progress bit-level to obtain second number
According to including:
Solution rate-matched is carried out to first CRC check erroneous block and obtains the 4th data;
4th data progress HARQ is merged to obtain the 5th data;
5th data are entered into row decoding and obtain the second data.
Fig. 3 is another HARQ process flow figures based on CRC check provided in an embodiment of the present invention.
Reference picture 3, step 1, judge whether packet is new data packets.If new data packets, opened from first code block
Beginning is handled, and into code block cyclic, performs step 2;If new data packets it are not, from first CRC check erroneous block
Handled, into code block cyclic, perform step 3.
Step 2, bit-level processing is carried out to first code block, bit-level processing includes solving rate-matched and decoding, then
CRC check is carried out, if CRC check result is correct, the first data is stored in and cached, perform step 4;If CRC check knot
Fruit is incorrect, by the first solution bit selection data deposit caching, performs step 6.
Step 3, carry out bit-level processing to first CRC check erroneous block, bit-level processing include solution rate-matched,
HARQ merges and decoding, then enters CRC check, if CRC check result is correct, the second data is stored in and cached, perform step
5;If CRC check result is incorrect, by the second solution bit selection data deposit caching, step 6 is performed.
Step 4, judge whether code block sequence number is more than M, that is, judge whether code block is last code block.If code block sequence number
More than M, terminate code block cyclic, perform step 8;If code block sequence number is less than M, next code block is handled, performs step
2。
Step 5, judge whether code block sequence number is more than M, if code block sequence number is more than M, terminate code block cyclic, perform step 8;
If code block sequence number is less than M, next code block is handled, performs step 3.
Step 6, judge whether code block sequence number is more than M, if code block sequence number is more than M, terminate code block cyclic, return to NACK.
If code block sequence number is less than M, next code block is handled, performs step 7.
Step 7, code-aiming block carries out solving bit selection processing, no longer carries out remaining processing procedure, then records code block CRC
As a result it is mistake, and the selection result deposit of solution bit is cached, repeats step 6.
Step 8, at least one first data or at least one second data are subjected to code block cascade, Ran Houjin
Row transmission block CRC check.If verification passes through, ACK is returned;If verification is not over returning to NACK.
Fig. 4 is the HARQ processing unit schematic diagrames provided in an embodiment of the present invention based on CRC check.
Reference picture 4, the device include judging unit 30, the first Traversal Unit 31, the second Traversal Unit 32 and code block cascade
Unit 33.
Judging unit 30 is used to judge whether packet is new data packets, wherein, the new data packets include M code block, M
For positive integer.
First Traversal Unit 31 is used in the case where the packet is the new data packets, from the M code block
First code block traveled through to obtain at least one first data and at least one first solution bit selection data.
Second Traversal Unit 32 is used in the case where the packet is not the new data packets, from the M code block
In first CRC CRC check erroneous block traveled through to obtain at least one second data and at least one
Second solution bit selection data.
Code block concatenation unit 33 is used to respectively enter at least one first data or at least one second data
Row code block cascades, and carries out CRC check.
Further, first Traversal Unit 31 is used to repeat following processing, until m-th code block is traversed:
Bit-level is carried out to first code block to handle to obtain first data;
First data are subjected to CRC check;
If first data store first data and carry out next code block by the CRC check
Bit-level processing;
If first data solve bit selection not over the CRC check, in stored bits level processing procedure
As a result, the first solution bit selection data are obtained, and remaining is not subjected to bit-level processing code block and all carries out solving at bit selection
Reason.
Further, second Traversal Unit 32 is used to repeat following processing, until m-th code block quilt time
Go through:
First CRC check erroneous block progress bit-level is handled to obtain second data;
CRC check is carried out to second data;
If second data store second data and carry out next code block by the CRC check
Bit-level processing;
If second data are not over the CRC check, to first CRC check erroneous block bit
Obtained solution bit selection result is stored in level processing procedure, obtains the second solution bit selection data, and by remaining
The code block of only storage solution bit selection data carries out solving bit selection processing.
Further, first Traversal Unit 31 also includes:
Solution rate-matched is carried out to first code block and obtains the 3rd data;
3rd data are entered into row decoding and obtain first data.
Further, second Traversal Unit 32 also includes:
Solution rate-matched is carried out to first CRC check erroneous block and obtains the 4th data;
4th data progress HARQ is merged to obtain the 5th data;
5th data are entered into row decoding and obtain the second data.
The foregoing is only a specific embodiment of the invention, but protection scope of the present invention is not limited thereto, any
Those familiar with the art the invention discloses technical scope in, change or replacement can be readily occurred in, should all be contained
Cover within protection scope of the present invention.Therefore, protection scope of the present invention should be based on the protection scope of the described claims.