CN101330351B - Method for mapping bit with priority based on circulation caching speed matching - Google Patents
Method for mapping bit with priority based on circulation caching speed matching Download PDFInfo
- Publication number
- CN101330351B CN101330351B CN2007101276377A CN200710127637A CN101330351B CN 101330351 B CN101330351 B CN 101330351B CN 2007101276377 A CN2007101276377 A CN 2007101276377A CN 200710127637 A CN200710127637 A CN 200710127637A CN 101330351 B CN101330351 B CN 101330351B
- Authority
- CN
- China
- Prior art keywords
- circular buffer
- automatic repeat
- repeat requests
- bit
- mixed automatic
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
Images
Landscapes
- Mobile Radio Communication Systems (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a preferential mapping method of bits matched on circular buffer rate. The method comprises the following steps: S102, conducting sub-block interweaving process for a coded system bit stream and a coded check bit stream to form a circular buffer; S104, dereferencing according to the length of an HARQ sub-package, the length of the circular buffer and a redundancy edition, and calculating the starting position, the final position and the circular times of reading of the HARQ sub-package in the circular buffer; S106, reading code word bits of a hybrid automatic retransmission request sub-package from the circular buffer according to the starting position, the final position and the circular times of reading of the HARQ sub-package in the circular buffer; S108, separating the system bit stream from the check bit stream in the hybrid automatic retransmission request sub-package; S110, conducting bit collection and processing the separated bit stream and the separated check bit stream in the hybrid automatic retransmission request sub-package; and S112, conducting bit preferential mapping modulation for the system bit stream and the check bit stream after the bit collection and processing in the hybrid automatic retransmission request sub-package.
Description
Technical field
The present invention relates to the communications field, relate more specifically to a kind of bit priority mapping method based on the circulating buffer memory rate coupling.
Background technology
In wireless communication system, in order to improve the reliability that data are transmitted in wireless channel, improve the antijamming capability of transmission data, need to adopt corresponding channel coding technology.In many channel coding technologies, Turbo code is to generally acknowledge one of best error correction/encoding method at present.In up-to-date 3GPP LTE standard, determined to adopt Turbo to encode as the channel coding schemes of data service based on the QPP interleaver.Rate-matched is the very crucial technology of after the chnnel coding in the wireless communication system, its objective is the data after the chnnel coding are carried out repetition or punching by algorithm controls, be complementary with the physical channel resources of being distributed to guarantee the data length after the rate-matched.Present speed matching method mainly contains two kinds: 3GPP R6 speed matching method and based on the speed matching method of circular buffer.Speed matching method based on circular buffer is simple owing to algorithm, and performance can be comparable with 3GPP R6 speed matching method, so be used as Turbo coded speed matching scheme in 3GPP LTE standard.
The basic thought of bit priority mapping is preferentially systematic bits to be placed on the most reliable bit position in the planisphere, strengthens the protection to systematic bits.Therefore, the prerequisite that bit priority mapping is used is that constellation symbols has and do not wait reliable bit position, for example modulation system such as 16QAM, 64QAM.Because systematic bits often has bigger effect than check bit in channel decoding, therefore use the performance improvement of bit priority mapping can obtain for the first time mixed automatic repeat requests (Hybrid Automatic Repeat Request is called for short HARQ) transmission the time.It is exactly that bit collection mechanism is in conjunction with IQ shunt interleaver that the high speed downlink packet that is mapped in bit priority inserts an example of using in (High SpeedDownlink Packet Access is called for short HSDPA).Using bit priority to shine upon simultaneously can be compatible mutually with the planisphere recombinant technique, obtains best communication system HARQ throughput performance.
Summary of the invention
One or more problems in view of the above the invention provides a kind of bit priority mapping method based on the circulating buffer memory rate coupling.
According to the bit priority mapping method based on the circulating buffer memory rate coupling of the present invention, may further comprise the steps: S102, carry out sub-block interleaving to the check bit stream behind stream of the systematic bits behind the coding and the coding and handle, to form circular buffer; S104 according to the length of mixed automatic repeat requests bag, the length and the redundancy versions value of circular buffer, calculates mixed automatic repeat requests and wraps in start position, final position and the winding number of times that reads in the circular buffer; S106, wrap in start position, final position and the winding number of times that reads in the circular buffer according to mixed automatic repeat requests, from circular buffer, read the code word bits of mixed automatic repeat requests bag, if the code word bits of automatic repeat requests of the described mixing of reading bag only contains one in systematic bits stream or the check bit stream, then only systematic bits stream or the check bit stream that contains is carried out collection and treatment, and systematic bits stream or the check bit stream of handling through bit collection carried out bit mapping modulation, otherwise, forward S108 to; S108 separates the systematic bits stream and the check bit stream that mix automatic repeat requests bag; S110, systematic bits stream and check bit stream that automatic repeat requests of the mixing after separating is wrapped carry out the bit collection processing; And S112, systematic bits stream and check bit stream that mixed automatic repeat requests of handling through bit collection is wrapped carry out bit priority mapping modulation.
Wherein, step S104 may further comprise the steps: S1042, according to the length and the redundancy versions value of circular buffer, calculate mixed automatic repeat requests and wrap in the start position that reads in the circular buffer; S1044, wrap in the start position that reads in the circular buffer, the length of mixed automatic repeat requests bag and the length of circular buffer according to mixed automatic repeat requests, calculate mixed automatic repeat requests and wrap in the final position of reading in the circular buffer; And S1046, wrap in the start position that reads in the circular buffer, the length of mixed automatic repeat requests bag and the length of circular buffer according to mixed automatic repeat requests, calculate mixed automatic repeat requests and wrap in the winding number of times that reads in the circular buffer.
Wherein, mixed automatic repeat requests wraps in the following AD of being designated as in the final position of reading in the circular buffer
End=(AD
Start+ N
Harq-1) (3 * K), the winding number of times is mod
Wherein, N
HarqThe length of mixed automatic repeat requests of expression bag, 3 * K represents the length of circular buffer, AD
StartMixed automatic repeat requests of expression wraps in the start position that reads in the circular buffer.Wherein, the redundancy versions value for the set Φ=0,1 ... N
RVArbitrary value among the-1}, wherein, N
RVExpression redundancy versions number.
Be set Φ in the redundancy versions value
S={ φ
k| φ
k∈ Φ, 0≤k≤N
RVSUnder the situation of the arbitrary value the among-1}, mixed automatic repeat requests wraps in the start position AD that reads in the circular buffer
StartMeet the following conditions: 0≤AD
Start≤ K-1, i.e. AD
StartBe arranged in the systematic bits stream behind the coding of circular buffer, wherein, N
RVSThe redundancy versions number that certain bit the systematic bits stream of mixed automatic repeat requests of expression bag behind coding begins to read, and 0≤N
RVS≤ N
RV
Under mixed automatic repeat requests wraps in situation in the systematic bits stream of final position behind coding that reads in the circular buffer,, then do not read the check bit stream behind the coding if the winding number of times is zero; If described winding number of times is non-vanishing, systematic bits stream behind the coding and the check bit stream behind the coding have then been read.Under mixed automatic repeat requests wraps in situation in the check bit stream of final position behind coding that reads in the circular buffer, systematic bits stream behind the coding and the check bit stream behind the coding have been read.
Be set in the redundancy versions value
In the situation of arbitrary value under, mixed automatic repeat requests wraps in the start position AD that reads in the circular buffer
StartMeet the following conditions: K≤AD
Start≤ 3 * K-1, i.e. AD
StartBe arranged in the check bit stream behind the coding of circular buffer, wherein, N
RV-N
RVSThe redundancy versions number that certain bit in the check bit stream behind the coding of expression mixed automatic repeat requests bag from circular buffer begins to read.
Under mixed automatic repeat requests wraps in situation in the systematic bits stream of final position behind coding that reads in the circular buffer, systematic bits stream behind the coding and the check bit stream behind the coding have been read.
Under mixed automatic repeat requests wraps in situation in the check bit stream of final position behind coding that reads in the circular buffer,, then do not read the systematic bits stream behind the coding if the winding number of times is zero; If the winding number of times is non-vanishing, systematic bits stream behind the coding and the check bit stream behind the coding have then been read.
Wherein, in step S106 or S110, pass through N
Row* N
ColInterleaver mixed automatic repeat requests bag carried out bit collection handle, wherein, N
RowDetermine N by order of modulation
ColLength N by mixed automatic repeat requests bag
HarqAnd N
RowCommon definite, and N
Col=N
Harq/ N
Row
Wherein, in step S106 or S112, systematic bits stream and the check bit stream that mixed automatic repeat requests of handling through bit collection wraps is carried out bit priority mapping modulation according to order of modulation.
By the present invention, can improve communication system HARQ throughput performance, can improve the decoding performance of transmission for the first time especially, reduce retransmitting.And method of the present invention can be compatible mutually with the planisphere recombinant technique, obtains best communication system HARQ throughput performance in conjunction with the planisphere reorganization.
Description of drawings
Accompanying drawing described herein is used to provide further understanding of the present invention, constitutes the application's a part, and illustrative examples of the present invention and explanation thereof are used to explain the present invention, do not constitute improper qualification of the present invention.In the accompanying drawings:
Fig. 1 is the flow chart based on the bit priority mapping method of circulating buffer memory rate coupling according to the embodiment of the invention;
Fig. 2 is the Turbo coding flow chart based on the circulating buffer memory rate coupling of the prior art;
Fig. 3 is the flow chart of the concrete steps of the step S104 in the method shown in Figure 1;
Fig. 4 is the 0≤AD that satisfies condition
Start≤ K-1,0≤AD
EndHARQ bag when≤K-1, C=0 reads schematic diagram;
Fig. 5 is the 0≤AD that satisfies condition
Start≤ K-1,0≤AD
EndHARQ bag when≤K-1, C=1 reads schematic diagram;
Fig. 6 is the 0≤AD that satisfies condition
Start≤ K-1, K≤AD
EndHARQ bag when≤3 * K-1, C=0 reads schematic diagram;
Fig. 7 is the 0≤AD that satisfies condition
Start≤ K-1, K≤AD
EndHARQ bag when≤3 * K-1, C=1 reads schematic diagram;
Fig. 8 is the K≤AD that satisfies condition
Start≤ 3 * K-1,0≤AD
EndHARQ bag when≤K-1, C=1 reads schematic diagram;
Fig. 9 is the K≤AD that satisfies condition
Start≤ 3 * K-1,0≤AD
EndHARQ bag when≤K-1, C=2 reads schematic diagram;
Figure 10 is the K≤AD that satisfies condition
Start≤ 3 * K-1, K≤AD
EndHARQ bag when≤3 * K-1, C=0 reads schematic diagram;
Figure 11 is the K≤AD that satisfies condition
Start≤ 3 * K-1, K≤AD
EndHARQ bag when≤3 * K-1, C=1 reads schematic diagram;
Figure 12 handles schematic diagram according to the bit collection of the embodiment of the invention;
Figure 13 is 16QAM modulation mapped constellation figure; And
Figure 14 is 64QAM modulation mapped constellation figure.
Embodiment
Below with reference to accompanying drawing, describe the specific embodiment of the present invention in detail.
With reference to figure 1, the bit priority mapping method based on the circulating buffer memory rate coupling according to the embodiment of the invention is described.As shown in Figure 1, this bit priority mapping method may further comprise the steps:
S102, systematic bits stream S, check bit stream P1 and check bit stream P2 through Turbo information encoded grouped data are carried out sub-block interleaving respectively, begin the stream of the systematic bits behind sub-block interleaving S is write in proper order from the circular buffer start position, check bit stream P1 after will interweaving and check bit stream P2 interlock, and the sequence of positions after last systematic bits that has write from circular buffer writes, to form circular buffer.
S104, code word size and redundancy versions (RV) value after the sub-packet length of the HARQ of Fa Songing, Turbo encode as required, the following parameter of computed HARQ bag: HARQ wraps in start position, the final position of reading in the circular buffer and the number of times that unrolls.
S106, according to HARQ bag parameter and the circular buffer data calculated, from described circular buffer, read the code word bits of mixed automatic repeat requests bag, if the code word bits of automatic repeat requests of the described mixing of reading bag only contains one in systematic bits stream or the check bit stream, then only systematic bits stream or the check bit stream that contains is carried out collection and treatment, and systematic bits stream or the check bit stream of handling through bit collection carried out bit mapping modulation, otherwise, forward S108 to.
S108 separates the systematic bits stream and the check bit stream that mix automatic repeat requests bag.
S110, systematic bits stream and check bit stream that automatic repeat requests of the mixing after separating is wrapped carry out the bit collection processing.
S112, systematic bits stream and check bit stream that automatic repeat requests of the mixing of exporting after the bit collection and treatment is wrapped carry out bit priority mapping modulation.
Wherein, as shown in Figure 2 based on the Turbo encoding scheme of circular buffer.As can be seen from Figure 2, systematic bits stream S, check bit stream P1 and the check bit stream P2 of the information block data behind the Turbo coding carried out sub-block interleaving respectively, the systematic bits stream order behind the sub-block interleaving begins to write from the circular buffer starting point.Check bit stream P1 after interweaving and the staggered formation of check bit stream P2 check bit stream, order writes circular buffer after last systematic bits from the circular buffer that has write.Circular buffer Bit data sequence be CB (0 ..., 3 * K-1), wherein 3 * K is coding back code word bits length, i.e. circular buffer data length.
Wherein, need to calculate following HARQ bag parameter: HARQ wraps in the subscript AD of the start position that reads in the circular buffer
Start(0≤AD
Start≤ 3 * K-1), HARQ wraps in the subscript AD in the final position of reading in the circular buffer
End(0≤AD
End≤ 3 * K-1) and HARQ wrap in the number of times C that unrolls (C 〉=0) that reads in the circular buffer.Wherein, unrolling is meant, after HARQ bag reads the circular buffer end, unrolls to circular buffer beginning continuation reading of data (this is the decision of circular buffer characteristic).
If the sub length of wrapping of HARQ that needs to send is N
Harq(N
Harq＞0), redundancy versions value RV is i (0≤i≤N
RV-1), wherein, N
RVBe the redundancy versions number of definition, N in this embodiment
RV=8, but be not limited thereto.Then HARQ wraps in the start position subscript that reads in the circular buffer
HARQ wraps in the final position subscript AD that reads in the circular buffer
End=(AD
Start+ N
Harq-1) mod (3 * K).HARQ wraps in the number of times that unrolls that reads in the circular buffer
That is to say that step S104 (as shown in Figure 3) specifically may further comprise the steps: S1042, according to the length and the redundancy versions value of circular buffer, calculate mixed automatic repeat requests and wrap in the start position that reads in the circular buffer; S1044, wrap in the start position that reads in the circular buffer, the length of mixed automatic repeat requests bag and the length of circular buffer according to mixed automatic repeat requests, calculate mixed automatic repeat requests and wrap in the final position of reading in the circular buffer; And S1046, wrap in the start position that reads in the circular buffer, the length of mixed automatic repeat requests bag and the length of circular buffer according to mixed automatic repeat requests, calculate mixed automatic repeat requests and wrap in the winding number of times that reads in the circular buffer.
Then, wrap in start position, final position and the winding number of times that reads in the circular buffer according to mixed automatic repeat requests, from circular buffer, read the code word bits of mixed automatic repeat requests bag and separate systematic bits stream and the check bit stream that mixes automatic repeat requests bag.In this embodiment, separate the method for mixing sub systematic bits stream that wraps of automatic repeat requests and check bit stream and adopt difference concatenated in order method.But be not limited thereto, all systematic bits stream that satisfies automatic repeat requests bag and check bit flow point from any means all should comprise.
Wrap in the start position subscript AD that reads in the circular buffer according to HARQ that calculates
StartValue consider in two kinds of situation: 0≤AD
Start≤ K-1 and K≤AD
Start≤ 3 * K-1 represents that respectively certain bit in the systematic bits block sum check bit block of HARQ bag from circular buffer begins to read.
1.AD
StartValue satisfies condition: 0≤AD
Start≤ K-1
Wrap in the final position subscript AD that reads in the circular buffer according to HARQ
EndAgain in two kinds of situation:
Situation 1:AD
EndSatisfy condition: 0≤AD
End≤ K-1, last bit that promptly reads HARQ bag is arranged in the systematic bits piece of circular buffer, handles respectively again according to the value of the number of times C that unrolls.
1. as shown in Figure 4, when C=0, HARQ bag reads a sub-piece 1 of systematic bits, and the subscript at the whole story of the sub-piece 1 of systematic bits in circular buffer is respectively AD
StartAnd AD
End, promptly the sub-piece 1 of systematic bits is circular buffer sequence C B (AD
Start..., AD
End); And do not read check bit.Output system bit stream S is the sub-piece 1 of systematic bits.Output verification bit stream P is empty.
2. as shown in Figure 5, when C＞0, HARQ wraps at least sequential read and has got sub-piece 1 of systematic bits and the sub-piece 2 of systematic bits.The whole story subscript of the sub-piece 1 of systematic bits in circular buffer is respectively AD
StartAnd K-1, i.e. circular buffer sequence C B (AD
Start..., K-1).The whole story subscript of the sub-piece 2 of systematic bits in circular buffer is respectively 0 and AD
End, promptly circular buffer sequence C B (0 ..., AD
End).Especially, in C＞1 o'clock, after reading system sub-blocks of bits 1, repeat to read C-1 subsystem sub-blocks of bits 3, the whole story subscript of the sub-piece 3 of systematic bits in circular buffer is respectively 0 and K-1, i.e. circular buffer sequence C B (0,, K-1), reading system sub-blocks of bits 2 more at last.
Output system bit stream S is: at first the output system sub-blocks of bits 1, repeats to export C-1 subsystem sub-blocks of bits 3 subsequently, last output system sub-blocks of bits 2.Especially, when C=1, C-1=0, the output system sub-blocks of bits 3.
When C＞0, HARQ bag repeats to read the sub-piece 1 of check bit C time, and the whole story subscript of the sub-piece 1 of check bit in circular buffer is respectively K and 3 * K-1, promptly circular buffer sequence C B (K ..., 3 * K-1).Output verification bit stream P is: repeat to export the sub-piece 1 of check bit C time.
Situation 2:AD
EndSatisfy condition: K≤AD
End≤ 3 * K-1, last bit that promptly reads HARQ bag is arranged in the check bit piece of circular buffer, handles respectively again according to the value of the number of times C that unrolls.
1. as shown in Figure 6, when C=0, HARQ bag reads a sub-piece 1 of systematic bits, and the subscript at the whole story of the sub-piece 1 of systematic bits in circular buffer is respectively AD
StartAnd K-1, i.e. circular buffer sequence C B (AD
Start..., K-1).Output system bit stream S is the sub-piece 1 of systematic bits.
When C=0, HARQ bag reads a sub-piece 1 of check bit, and the whole story subscript of the sub-piece 1 of check bit in circular buffer is respectively K and AD
End, promptly circular buffer sequence C B (K ..., AD
End).Output verification bit stream P is the sub-piece 1 of check bit.
2. as shown in Figure 7, when C＞0, HARQ bag sequential read is got the sub-piece 1 of systematic bits, repeats to read C subsystem sub-blocks of bits 2 subsequently.The whole story subscript of the sub-piece 1 of systematic bits in circular buffer is respectively AD
StartAnd K-1, i.e. circular buffer sequence C B (AD
Start..., K-1).The whole story subscript of the sub-piece 2 of systematic bits in circular buffer is respectively 0 and K-1, promptly circular buffer sequence C B (0 ..., K-1).Output system bit stream S is: at first the output system sub-blocks of bits 1, repeats to export C subsystem sub-blocks of bits 2 subsequently.
When C＞0, HARQ bag repeats to read the sub-piece 1 of check bit C time, reads the sub-piece 2 of check bit subsequently.The whole story subscript of the sub-piece 1 of check bit in circular buffer is respectively K and 3 * K-1, promptly circular buffer sequence C B (K ..., 3 * K-1).The whole story subscript of the sub-piece 2 of check bit in circular buffer is respectively K and AD
End, promptly circular buffer sequence C B (K ..., AD
End).Output verification bit stream P is: at first repeat to export the sub-piece 1 of check bit C time, the output verification sub-blocks of bits 2 subsequently.
2.AD
StartValue satisfies condition: K≤AD
Start≤ 3 * K-1
Wrap in the final position subscript AD that reads in the circular buffer according to HARQ
EndAgain in two kinds of situation:
Situation 1:AD
EndSatisfy condition: 0≤AD
End≤ K-1, last bit that promptly reads HARQ bag is arranged in the systematic bits piece of circular buffer.
Fig. 9 reads schematic diagram (C=2 among Fig. 9) for HARQ bag in the case.
For systematic bits, HARQ bag repeats to read C-1 subsystem sub-blocks of bits 1, and the reading system sub-blocks of bits 2 subsequently.The whole story subscript of the sub-piece 1 of systematic bits in circular buffer is respectively 0 and K-1, promptly circular buffer sequence C B (0 ..., K-1).The whole story subscript of the sub-piece 2 of systematic bits in circular buffer is respectively 0 and AD
End, promptly circular buffer sequence C B (0 ..., AD
End).Output system bit stream S is: at first repeat to export C-1 subsystem sub-blocks of bits 1, the output system sub-blocks of bits 2 subsequently.Especially, when C=1, HARQ bag reads as shown in Figure 8, and the output system sub-blocks of bits 1.
For check bit, the sub-bag of HARQ reads the sub-piece 1 of check bit in proper order, repeats to read the sub-piece 2 of check bit subsequently C-1 time.The whole story subscript of the sub-piece 1 of check bit in circular buffer is respectively AD
StartWith 3 * K-1, i.e. circular buffer sequence C B (AD
Start..., 3 * K-1).The whole story subscript of the sub-piece 2 of check bit in circular buffer is respectively K and 3 * K-1, promptly circular buffer sequence C B (K ..., 3 * K-1).Output verification bit stream P is: at first the output verification sub-blocks of bits 1, repeats output verification sub-blocks of bits 2 subsequently C-1 time.Especially, when C=1, HARQ bag reads as shown in Figure 8, and the output verification sub-blocks of bits 2.
Situation 2:AD
EndSatisfy condition: K≤AD
End≤ 3 * K-1, last bit that promptly reads HARQ bag is arranged in the check bit piece of circular buffer, handles respectively again according to the value of the number of times C that unrolls.
1. as shown in figure 10, when C=0, HARQ bag reads a sub-piece 1 of check bit, and the subscript at the whole story of the sub-piece 1 of check bit in circular buffer is respectively AD
StartAnd AD
End, i.e. circular buffer sequence C B (AD
Start..., AD
End); Do not read systematic bits.Output system bit stream S is empty.Output verification bit stream P is the sub-piece 1 of check bit.
2. as shown in figure 11, when C＞0, HARQ bag repeats to read C subsystem sub-blocks of bits 1, and the subscript at the whole story of the sub-piece 1 of systematic bits in circular buffer is respectively 0 and K-1, promptly circular buffer sequence C B (0 ..., K-1).Output system bit stream S is: repeat to export C subsystem sub-blocks of bits 1.
When C＞0, HARQ bag at first reads the sub-piece 1 of check bit, repeats to read the sub-piece 2 of check bit subsequently C-1 time, reads the sub-piece 3 of check bit at last.The whole story subscript of the sub-piece 1 of check bit in circular buffer is respectively AD
Start(3 * K-1), i.e. circular buffer sequence C B (AD
Start..., 3 * K-1).The whole story subscript of the sub-piece 2 of check bit in circular buffer is respectively K and 3 * K-1, promptly circular buffer sequence C B (K ..., 3 * K-1).The whole story subscript of the sub-piece 3 of check bit in circular buffer is respectively K and AD
End, promptly circular buffer sequence C B (K ..., AD
End).Output verification bit stream P is: at first the output verification sub-blocks of bits 1, repeats to export the sub-piece 2 of check bit subsequently C-1 time, last output verification sub-blocks of bits 3.
With reference to Figure 12, the bit collection processing procedure according to the embodiment of the invention is described.As shown in figure 12, bit collection is handled the two-way input: systematic bits stream S and check bit stream P.Bit collection is handled and is passed through N
Row* N
ColInterleaver realize, wherein, parameter N
RowDetermine by order of modulation, for example: for QPSK, N
Row=2; For 16QAM, N
Row=4; For 64QAM, N
Row=6.Parameter N
ColBy the sub-packet length N of HARQ
HarqAnd N
RowDetermine N
Col=N
Harq/ N
Row
Systematic bits stream S and check bit stream P write and read by row.If the systematic bits of input stream S length is N
Sys, intermediate parameters N
rAnd N
cBe respectively:
N
c=N
Sys-N
r* N
Col
If N
c=0, systematic bits writing line 1 ... N
rOtherwise systematic bits writes first N
c1 of row ... N
rIf+1 row is N
r＞0, also be written to residue N
Col-N
c1 of row ... N
rOK, its complementary space of interleaver is write the row of remaining space by row by check bit stream.
The bit-order that every row were read after bit collection was handled depends on modulation system.Wherein, if modulation system is 64QAM, the bit-order that then every row are read is the 1st row, the 2nd row, the 3rd row, the 4th row, the 5th row, the 6th row.If modulation system is the 16QAM modulation, the bit-order that then every row are read is the 1st row, the 2nd row, the 3rd row, the 4th row.If modulation system is the QPSK modulation, the bit-order that then every row are read is the 1st row, the 2nd row.
Next HARQ bag bit priority mapping modulation is described.If bit collection is handled the sub-packet sequence of HARQ of output
According to the constellation modulation theory, for 64QAM modulation, 6 bit sequence i
1q
1i
2q
2i
3q
3Be mapped as a constellation point modulation symbol; For 16QAM modulation, 4 bit sequence i
1q
1i
2q
2Be mapped as a constellation point modulation symbol; For QPSK modulation, 2 bit sequence i
1q
1Be mapped as a modulation symbol.Wherein, 6 bits of 64QAM modulation have three reliability steps, as shown in figure 14, and i
1And q
1Has the high reliability grade, i
2And q
2Has middle reliability step, i
3And q
3Has low reliability step; 4 bits of 16QAM modulation have two reliability steps, as shown in figure 13, and i
1And q
1Has the high reliability grade, i
2And q
2Has low reliability step; The QPSK modulation symbol has only reliability step, i.e. an i
1And q
1Has the uniform reliability grade.
Bit collection is handled the sub-packet sequence of HARQ of output
Adopt following rule to the mapping of constellation point symbol:
For the 64QAM modulation, to divide into groups with continuous 6 bits, grouping is according to i
1q
1i
2q
2i
3q
3Order is shone upon.For the 16QAM modulation, to divide into groups with continuous 4 bits, grouping is according to i
1q
1i
2q
2Order is shone upon.For the QPSK modulation, to divide into groups with continuous 2 bits, grouping is according to i
1q
1Order is shone upon, also i.e. order mapping.
In sum, the present invention has proposed to be applied to the solution of channel code chain based on the bit priority method of circulating buffer memory rate coupling first.The present invention will realize that bit priority mapping method organically combines based on the Turbo coding method and the employing bit collection mechanism of circulating buffer memory rate coupling, be particularly useful for 3GPP LTE series standard.In addition, the present invention has realized the bit priority mapping by improved bit collection mechanism, thereby can carry out more reliable protection to systematic bits.
Adopt the present invention, can improve the decoding performance of transmission for the first time, reduce number of retransmissions, reduce retransmission delay time, thereby can further improve the throughput performance in high s/n ratio interval.Simultaneously, the present invention can be well compatible with the planisphere recombinant technique, obtains best HARQ throughput performance and transmission reliability in communication system, has a good application prospect.
The above is embodiments of the invention only, is not limited to the present invention, and for a person skilled in the art, the present invention can have various changes and variation.Within the spirit and principles in the present invention all, any modification of being done, be equal to replacement, improvement etc., all should be included within the claim scope of the present invention.
Claims (14)
1. the bit priority mapping method based on the circulating buffer memory rate coupling is characterized in that, may further comprise the steps:
S102 carries out sub-block interleaving to the check bit stream behind stream of the systematic bits behind the coding and the coding and handles, to form circular buffer;
S104, according to the length of mixed automatic repeat requests bag, the length and the redundancy versions value of described circular buffer, calculate described mixed automatic repeat requests and wrap in start position, final position and the winding number of times that reads in the described circular buffer;
S106, wrap in the start position that reads in the described circular buffer according to described mixed automatic repeat requests, the final position, with the winding number of times, from described circular buffer, read the code word bits of mixed automatic repeat requests bag, if the code word bits of automatic repeat requests of the described mixing of reading bag only contains one in systematic bits stream or the check bit stream, then only systematic bits stream or the check bit stream that contains is carried out collection and treatment, and systematic bits stream or the check bit stream of handling through bit collection carried out bit mapping modulation, otherwise, forward S108 to;
S108, the systematic bits stream and the check bit that separate automatic repeat requests of described mixing bag flow;
S110, systematic bits stream and check bit stream that automatic repeat requests of the described mixing after separating is wrapped carry out the bit collection processing;
S112, systematic bits stream and check bit stream that described mixed automatic repeat requests of handling through bit collection is wrapped carry out bit priority mapping modulation.
2. bit priority mapping method according to claim 1 is characterized in that, described step S104 may further comprise the steps:
S1042 according to the length and the described redundancy versions value of described circular buffer, calculates described mixed automatic repeat requests and wraps in the start position that reads in the described circular buffer;
S1044, wrap in the start position that reads in the described circular buffer, the length of described mixed automatic repeat requests bag and the length of described circular buffer according to described mixed automatic repeat requests, calculate described mixed automatic repeat requests and wrap in the final position of reading in the described circular buffer; And
S1046, wrap in the start position that reads in the described circular buffer, the length of described mixed automatic repeat requests bag and the length of described circular buffer according to described mixed automatic repeat requests, calculate described mixed automatic repeat requests and wrap in the winding number of times that reads in the described circular buffer.
3. bit priority mapping method according to claim 2 is characterized in that, described mixed automatic repeat requests wraps in the following AD of being designated as in the final position of reading in the described circular buffer
End=(AD
Start+ N
Harq-1) (3 * K), the winding number of times is mod
Wherein, N
HarqRepresent the length of described mixed automatic repeat requests bag, 3 * K represents the length of described circular buffer, AD
StartRepresent that described mixed automatic repeat requests wraps in the start position that reads in the described circular buffer.
4. bit priority mapping method according to claim 3 is characterized in that, described redundancy versions value for the set Φ=0,1 ... N
RVArbitrary value among the-1}, wherein, N
RVExpression redundancy versions number.
5. bit priority mapping method according to claim 4 is characterized in that, is set Φ in described redundancy versions value
S={ φ
k| φ
k∈ Φ, 0≤k≤N
RVSUnder the situation of the arbitrary value the among-1}, described mixed automatic repeat requests wraps in the start position AD that reads in the described circular buffer
StartMeet the following conditions: 0≤AD
Start≤ K-1, i.e. AD
StartBe arranged in the systematic bits stream behind the described coding of described circular buffer, wherein, N
RVSRepresent the redundancy versions number that certain bit the systematic bits stream of described mixed automatic repeat requests bag behind described coding begins to read, and 0≤N
RVS≤ N
RV
6. bit priority mapping method according to claim 5, it is characterized in that, under described mixed automatic repeat requests wraps in situation in the systematic bits stream of final position behind described coding that reads in the described circular buffer, if described winding number of times is zero, then do not read the check bit stream behind the described coding.
7. bit priority mapping method according to claim 5, it is characterized in that, under described mixed automatic repeat requests wraps in situation in the systematic bits stream of final position behind described coding that reads in the described circular buffer, if described winding number of times is non-vanishing, has then read systematic bits stream behind the described coding and the check bit behind the described coding and flowed.
8. bit priority mapping method according to claim 5, it is characterized in that, under described mixed automatic repeat requests wraps in situation in the check bit stream of final position behind described coding that reads in the described circular buffer, read systematic bits stream behind the described coding and the check bit behind the described coding and flowed.
9. bit priority mapping method according to claim 5 is characterized in that, is set in described redundancy versions value
In the situation of arbitrary value under, described mixed automatic repeat requests wraps in the start position AD that reads in the described circular buffer
StartMeet the following conditions: K≤AD
Start≤ 3 * K-1, i.e. AD
StartBe arranged in the check bit stream behind the described coding of described circular buffer, wherein, N
RV-N
RVSRepresent the redundancy versions number that certain bit in the check bit stream behind the described coding of described mixed automatic repeat requests bag from described circular buffer begins to read.
10. bit priority mapping method according to claim 9, it is characterized in that, under described mixed automatic repeat requests wraps in situation in the systematic bits stream of final position behind described coding that reads in the described circular buffer, read systematic bits stream behind the described coding and the check bit behind the described coding and flowed.
11. bit priority mapping method according to claim 9, it is characterized in that, under described mixed automatic repeat requests wraps in situation in the check bit stream of final position behind described coding that reads in the described circular buffer, if described winding number of times is zero, then do not read the systematic bits stream behind the described coding.
12. bit priority mapping method according to claim 9, it is characterized in that, under described mixed automatic repeat requests wraps in situation in the check bit stream of final position behind described coding that reads in the described circular buffer, if described winding number of times is non-vanishing, has then read systematic bits stream behind the described coding and the check bit behind the described coding and flowed.
13. each the described bit priority mapping method according in the aforementioned claim is characterized in that, in described step S106 or S110, passes through N
Row* N
ColInterleaver carries out bit collection to described mixed automatic repeat requests bag to be handled, wherein, and N
RowDetermine N by order of modulation
ColLength N by described mixed automatic repeat requests bag
HarqAnd N
RowCommon definite, and N
Col=N
Harq/ N
Row
14. bit priority mapping method according to claim 13 is characterized in that, in described step S106 or S112, according to order of modulation the described mixed automatic repeat requests bag of handling through bit collection is carried out bit priority mapping modulation.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2007101276377A CN101330351B (en) | 2007-06-20 | 2007-06-20 | Method for mapping bit with priority based on circulation caching speed matching |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2007101276377A CN101330351B (en) | 2007-06-20 | 2007-06-20 | Method for mapping bit with priority based on circulation caching speed matching |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101330351A CN101330351A (en) | 2008-12-24 |
| CN101330351B true CN101330351B (en) | 2011-05-25 |
Family
ID=40205971
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2007101276377A Expired - Fee Related CN101330351B (en) | 2007-06-20 | 2007-06-20 | Method for mapping bit with priority based on circulation caching speed matching |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101330351B (en) |
Families Citing this family (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101860412B (en) * | 2009-04-13 | 2015-10-21 | 中兴通讯股份有限公司 | Sub-packet processing method, code modulating method, processor, modulation coding system |
| CN101867443B (en) * | 2009-04-14 | 2015-05-20 | 中兴通讯股份有限公司 | Rate matching method and device |
| CN101547064B (en) * | 2009-05-06 | 2011-11-09 | 普天信息技术研究院有限公司 | Interleaving and rate matching and de-interleaving and rate de-matching methods |
| CN102265576B (en) * | 2009-06-15 | 2013-06-05 | 华为技术有限公司 | Method for transmission of data over a communications channel |
| CN102035617B (en) * | 2009-09-29 | 2015-04-01 | 中兴通讯股份有限公司 | Channel coding rate matching method and device in communication system |
| CN102075285B (en) * | 2009-11-25 | 2013-06-05 | 中兴通讯股份有限公司 | Rate matching method and device |
| CN110663205B (en) * | 2017-06-16 | 2021-07-09 | 华为技术有限公司 | Data processing method and data processing device |
| CN109150199A (en) | 2017-06-17 | 2019-01-04 | 华为技术有限公司 | A kind of interleaving treatment method and device for the Polar code that polarizes |
| CN112737731B (en) * | 2020-12-23 | 2022-10-28 | 上海微波技术研究所（中国电子科技集团公司第五十研究所） | Data retransmission method and system based on HARQ |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1427568A (en) * | 2001-11-02 | 2003-07-02 | 三星电子株式会社 | Wireless receiving/transmitting apparatus and method for effectively repeating high-speed information pocket data |
| CN1490972A (en) * | 2003-01-27 | 2004-04-21 | 西南交通大学 | Uniform and ununiform modulated constellation mapping based nonisoprotective mixed automatic retransmission inquiry method |
-
2007
- 2007-06-20 CN CN2007101276377A patent/CN101330351B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1427568A (en) * | 2001-11-02 | 2003-07-02 | 三星电子株式会社 | Wireless receiving/transmitting apparatus and method for effectively repeating high-speed information pocket data |
| CN1490972A (en) * | 2003-01-27 | 2004-04-21 | 西南交通大学 | Uniform and ununiform modulated constellation mapping based nonisoprotective mixed automatic retransmission inquiry method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101330351A (en) | 2008-12-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101330351B (en) | Method for mapping bit with priority based on circulation caching speed matching | |
| CN103312442B (en) | Data transmission method for uplink and device based on limited length circulating buffer memory rate matching | |
| CN101217352B (en) | A buffering setting method of phase rate matching | |
| CN105515719B (en) | A kind of data transmission method and device | |
| CN107070587B (en) | Selection of retransmission settings for HARQ in WCDMA and LTE networks | |
| CN101075857B (en) | Method for generating turbo-code block intersection and HARQ packet | |
| CN101867443B (en) | Rate matching method and device | |
| US7260770B2 (en) | Block puncturing for turbo code based incremental redundancy | |
| KR100446537B1 (en) | Method and device for transmitting packet data in mobile communication system | |
| US8156407B2 (en) | Method and system for memory management in a HARQ communications system | |
| CN101119182B (en) | Bit priority selection method of high-order modulation | |
| CN101183875B (en) | Velocity matching method for limited longness circulation caching of Turbo code | |
| US8341490B2 (en) | Virtual limited buffer modification for rate matching | |
| CN101227259B (en) | Method for data reading of limited length circulating buffer memory rate adaption | |
| CN110430010A (en) | Method, equipment and the communication system of information processing | |
| CN101442383B (en) | Bit priority mapping method for high-step modulation | |
| CN108400844A (en) | Method, apparatus, communication equipment and the communication system of information processing | |
| CN101867441A (en) | Star map mapping method | |
| CN106936548A (en) | A kind of mixed automatic retransmission request method and its device based on polarization code | |
| CN101267211A (en) | Data interweaving method and device | |
| CN101242234B (en) | Data interweaving method and device | |
| CN101436918B (en) | Channel encoding method, apparatus and system for structured low density parity check code | |
| CN102035617B (en) | Channel coding rate matching method and device in communication system | |
| KR100786104B1 (en) | Method for Transmitting Packets | |
| Cheng | Coding performance of HARQ with BICM—Part II: LTE circular buffer rate matching & extension |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20110525 Termination date: 20160620 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |