CN101753256A - Constellation map mapping method and device - Google Patents

Abstract

The invention discloses a constellation map mapping method and a device. The method comprises the following steps: using a part of bits of a bit sequence to be mapped as a first bit sequence, mapping every m bits in the first bit sequence as a constellation point of a constellation map in a sequence from front to back, mapping the bit positioned in the first preset position onto the first preset bit of the corresponding constellation point for every m bits, mapping the bit positioned in the second preset position onto the second preset bit of the corresponding to constellation point (the reliability of the first preset bit is higher than that of the second preset bit), using the other part of bits of the bit sequence to be mapped as a second bit sequence, mapping every m bits in the second bit sequence as a constellation point of the constellation map in a sequence from front to back, mapping the bit positioned in the first preset position onto the second preset bit of the corresponding constellation point for every m bits, and mapping the bit positioned in the second preset position onto the first preset bit of the corresponding constellation point. The reliability of the code letter bits is furthest balanced.

Description

Constellation map mapping method and device

Technical field

The present invention relates to the communications field, relate in particular to a kind of constellation map mapping method and device.

Background technology

Fig. 1 shows the structure of digital communication system, as shown in Figure 1, digital communication system is made up of transmitting terminal, channel and receiving terminal, wherein, transmitting terminal generally includes parts such as information source, source encoder, channel encoder and modulator, and receiving terminal generally includes demodulator, channel decoder, source decoder and the stay of two nights, in the communication process of transmitting terminal and receiving terminal, transmitting terminal sends data by channel to receiving terminal, has noise source in the channel usually.

In digital communication system, channel code chain (comprising channel decoding, modulation etc.) is the key component of whole digital communication physical layer, and the treatment situation of channel code chain has determined the bottom transmission availability and the reliability of digital communication system.

In specific implementation process, channel code chain mainly comprises the processing of following components:

Chnnel coding (Channel Coding abbreviates CC as)

Chnnel coding is by increasing redundant information artificially, and the system that makes has the ability of automatic correction mistake, resists various noises and interference in the transmission course with this, has guaranteed the reliability of Digital Transmission.Turbine (Turbo) sign indicating number is one of forward error correction coding of present optimum of generally acknowledging, is widely adopted the chnnel coding solution as data traffic transmission in many standard agreements.For example, at up-to-date third generation partner program (3rd GenerationPartnership Project, abbreviate 3GPP as) Long Term Evolution (Long Term Evolution, abbreviate LTE as) just adopted in the standard agreement based on quadratic polynomial displacement (QuadraticPolynomial Permutation, QPP) Turbo code that interweaves is as the channel coding schemes of data service, and along with the increase of deciphering iterations, the decoding error-correcting performance will strengthen.

Rate-matched (Rate Matching abbreviates RM as)

Rate-matched is handled a key technology of the subsequent operation that is chnnel coding, its objective is the code word bits after the chnnel coding is carried out repetition or punching, wherein this repetition or punch operation can be controlled by algorithm, are complementary with the physical channel resources of being distributed to guarantee the data bit length after the rate-matched.

At present, speed matching algorithm mainly contains two kinds: 3GPP R6 speed matching algorithm and circulating buffer memory rate coupling (Circular Buffer Rate Matching abbreviates CBRM as) algorithm.Wherein, because the circulating buffer memory rate matching algorithm can generate and have the outstanding simple algorithm of deleting surplus pattern performance, therefore, in series standard, IEEE802.16 standard and the 3GPP LTE standard of 3GPP2, all adopt the circulating buffer memory rate matching algorithm to carry out rate-matched.In the circulating buffer memory rate matching algorithm, the code word bits of Turbo coding output is isolated three data bit streams through bit separation: systematic bits stream, first check bit stream and second check bit stream.Above-mentioned three data bit streams carry out block interleaver at first separately and rearrange, and this process is called as in the piece and interweaves; Then, in output state, the systematic bits after resetting is placed on the starting position, places the check bit stream of two rearrangements subsequently alternately, this process is called as interblock and interweaves; After this,, can select Ndata coded-bit, as the output of circulating buffer memory rate coupling according to the bit rate output of expectation; At last, a N data coded-bit is read in circulating buffer memory rate coupling starting position of certain appointment from output state, and this process becomes to be called as bit and selects.Generally speaking, 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, like this to buffer, just can realize rate-matched (delete surplus or repeat) by simple method based on circular buffer, so for the HARQ operation, circular buffer has the advantage of flexibility and granularity again.

Mix automatic repeat requests (Hybrid Automatic Repeat Request abbreviates HARQ as)

HARQ is an extremely important link adaptation techniques in the digital communication system.The implementation procedure of this technology is: receiving terminal is deciphered the HARQ packet of its reception, if decoding is correct, then feeds back correct response message (ACKnowledge character abbreviates ACK as) and gives transmitting terminal, and the notice transmitting terminal sends new HARQ packet; If decoding failure, then feedback error response message (Negative ACKnowledge character abbreviates NACK as) signal is given transmitting terminal, and the request transmitting terminal resends this 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.

Redundancy versions (Redundancy Version abbreviates RV as)

Under the HARQ mode, the start position that in circular buffer, can specify different positions to read as each transmitting HARQ packet.A plurality of start positions that the HARQ packet reads have promptly been determined in the definition of redundancy versions 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 relevant regulations of LTE, RV has defined the starting point at circular buffer, just can generate current HARQ bag by a segment encode word by defining this starting point.If the RV number is 4, then redundancy versions is according to 0,1, and 2 and 3 have from left to right indicated four positions equably in circular buffer, relevant motion and standard that more concrete description can be mated with reference to the virtual circulating buffer memory rate of LTE, and this paper is not described in detail.

HARQ bag designator (HARQ subpacket identifier abbreviates SPID as)

SPID is applied in the IEEE802.16 standard at present, and it is identical with acting on of redundancy versions RV in essence,, all is used for the particular location of true stator pack data in the circular buffer district that is.

In the IEEE802.16 system, HARQ bag designator and HARQ data packet length have defined original position and the length of HARQ bag data in the circular buffer district jointly, like this, can in the circular buffer district, select a segment encode word to generate current HARQ bag, wherein, the span of SPID is { 00,01,10,11}.Chuan Shu SPID value one is decided to be 00 first, and the SPID value when other retransmit then can be chosen arbitrarily or selecting in its scope in certain sequence.That is to say, when repeatedly transmitting, may reuse some SPID values, also can not use some SPID values.Especially, when each time transmission code rate is identical, and the SPID value is followed successively by 00,01, and 10,11 o'clock, the position that each transmission wraps in female sign indicating number was continuous successively.

HARQ bag generative process

In the IEEE802.16 standard, adopt circulating buffer memory rate matching treatment flow and method to generate HARQ bag data, its handling process specifically comprises as shown in Figure 2:

Suppose to exist a block of information Bit data sequence I (i ₀, i ₁..., i _K-1), wherein, K is a block of information Bit data length, i _k(0≤k≤K-1) is the binary bits data, and this block of information Bit data I is through the CTC coding, and the CTC coding codeword bit stream sequence of output is C (c ₀, c ₁... c _{3 * K-1}), suppose that herein the female sign indicating number of a CTC coding code check is 1/3 (being 1/3 to be that example describes with the female sign indicating number of a CTC coding code check only, also can be other code check) here.

Afterwards, CTC coding output code word bit stream sequence C is carried out the bit separation operation, isolate systematic bits stream sequence S (s ₀, s ₁... s _K-1), first check bit stream sequence P1 (p ₀ ¹, p ₁ ¹... p _K-1 ¹) and second check bit stream sequence P2 (p ₀ ², p ₁ ²... p _K-1 ²).

Then, isolated systematic bits stream sequence S, first check bit stream sequence P1 and second check bit stream sequence P2 are carried out sub-block interleaving respectively, obtain the systematic bits stream sequence SI (s behind the sub-block interleaving ₀ ^I, s ₁ ^I..., s _K-1 ^I), the stream of first check bit behind sub-block interleaving sequence P1I (p1 ₀ ^I, p1 ₁ ^I..., p1 _K-1 ^I) and sub-block interleaving after second check bit stream sequence P2I (p2 ₀ ^I, p2 ₁ ^I..., p2 _K-1 ^I).

First check bit stream sequence P1I after handling through sub-block interleaving and second check bit stream sequence P2I are carried out Bit Interleave, form check bit sequence P (p ₀ ^I, p ₁ ^I..., p _2K-1 ^I).Wherein, second check bit stream sequence P2I after first check bit stream sequence P1I after check bit sequence P and sub-block interleaving are handled, sub-block interleaving are handled satisfies following relation respectively:

$p_{2k}^I=p{1}_k^I$ (0≤k≤K-1)

$p_{2k+1}^I=p{2}_k^I$ (0≤k≤K-1)

Wherein, the systematic bits stream SI after handling according to sub-block interleaving is preceding, check bit sequence P after order form virtual circular buffer CB (cb ₀, cb ₁..., cb _{3 * K-1}), and systematic bits stream SI, check bit sequence P after virtual circular buffer CB and sub-block interleaving are handled satisfy following relation respectively:

${\mathrm{cb}}_k=s_k^I$ k＝0，1，…K-1

${\mathrm{cb}}_{K+k}=p_k^I$ k＝0，1，…2K-1

In the IEEE802.16 agreement, determine the start position that the HARQ data read according to child bag designator (being called for short SPID) in virtual circular buffer, concrete formula is: pos (SPID)=(L*SPID) mod (3*K), wherein, L is for sending the HARQ length of data package.

Original position is that pos (SPID) begins to circulate and reads the Bit data D=(d of size for the transmission HARQ of L bag from virtual circular buffer ₀, d ₁..., d _L-1).

In 3GPP LTE standard, the handling process that adopts circulating buffer memory rate matching treatment flow and method to generate HARQ bag data can specifically may further comprise the steps with reference to Fig. 2 equally:

Import a block of information Bit data sequence I (i ₀, i ₁..., i _K-1), wherein, K is a block of information Bit data length, i _k(0≤k≤K-1) is the binary bits data.

After block of information Bit data I is through the Turbo coding, output Turbo coding codeword bit stream sequence C (c ₀, c ₁... c _{3 * s-1}), wherein, S=K+4 can suppose that herein the female sign indicating number of a Turbo coding code check is 1/3 (being 1/3 to be that example describes with the female sign indicating number of a CTC coding code check only, also can be other code check) here, then exports 12 tail bits.

Afterwards, Turbo coding output code word bit stream sequence C is carried out the bit separation operation, isolate systematic bits stream sequence S (s ₀, s ₁... s _S-1), first check bit stream sequence P1 (p ₀ ¹, p ₁ ¹... p _S-1 ¹) and second check bit stream sequence P2 (p ₀ ², p ₁ ²... p _S-1 ²).

Turbo coding codeword bit stream sequence C and isolated systematic bits stream sequence S, first check bit stream sequence P1, second check bit stream sequence P2 satisfy following relation respectively:

s _k＝c _3×k k＝0，1，…S-1

${\mathrm{<figure-callout\; id="1"\; label="p\; k"\; filenames="H2008101886480E0000021.png"\; state="\{\{state\}\}">p</figure-callout>}}_k^{}={\mathrm{<figure-callout\; id="3"\; label="c"\; filenames="H2008101886480E0000021.png"\; state="\{\{state\}\}">c</figure-callout>}}_{3\&times;k+1}$ k＝0，1，…S-1

$p_k^2={\mathrm{<figure-callout\; id="3"\; label="c"\; filenames="H2008101886480E0000021.png"\; state="\{\{state\}\}">c</figure-callout>}}_{3\&times;k+2}$ k＝0，1，…S-1

Isolated systematic bits stream sequence S, first check bit stream sequence P1 and second check bit stream sequence P2 carry out sub-block interleaving respectively, and wherein, the systematic bits stream sequence behind the sub-block interleaving is SI (s ₀ ^I, s ₁ ^I..., s _S-1 ^I), first check bit stream sequence behind the sub-block interleaving is P1I (p1 ₀ ^I, p1 ₁ ^I..., p1 _S-1 ^I), second check bit stream sequence behind the sub-block interleaving is P2I (p2 ₀ ^I, p2 ₁ ^I..., p2 _S-1 ^I).

π is set _Sys, π _P1And π _P2The sub-block interleaving processing function of representing isolated systematic bits stream, first check bit stream and second check bit stream respectively.

First check bit stream sequence P1I after will handling through sub-block interleaving and second check bit stream sequence P2I carry out Bit Interleave, form check bit sequence P (p ₀ ^I, p ₁ ^I..., p _2S-1 ^I).Wherein, check bit sequence P has following relation with second check bit stream sequence P2I that carries out after first check bit stream sequence P1I after sub-block interleaving is handled, sub-block interleaving handle:

$p_{2k}^I={p1}_k^I$ (0≤k≤S-1)

$p_{2k+1}^I={p2}_k^I$ (0≤k≤S-1)

Systematic bits stream SI after handling according to sub-block interleaving is preceding, check bit sequence P after order form virtual circular buffer CB (cb ₀, cb ₁..., cb _{3 * S-1}).Wherein, systematic bits stream SI, check bit sequence P after virtual circular buffer CB and sub-block interleaving are handled have following relation:

${\mathrm{cb}}_k=s_k^I$ k＝0，1，…S-1

${\mathrm{cb}}_{S+k}=p_k^I$ k＝0，1，…2S-1

It is RV that the redundancy versions value is set, and then sending the start position that the HARQ packet reads in virtual circular buffer can determine by following formula:

(concrete definite mode is not limited to this formula).

Original position is that pos (RV) begins to circulate and reads the Bit data D=(d of size for the transmission HARQ of L bag from virtual circular buffer ₀, d ₁..., d _L-1), wherein, L is for sending the HARQ data packet length.

High order modulation (High order Modulation)

In order to obtain the higher availability of frequency spectrum, in numerous communication standard protocols, more and more tend to adopt high-order modulating to improve system spectrum utilance and hardware circuit solution performance, wherein, Chang Yong high order modulation approach comprises 8PSK, 16QAM, 64QAM etc. the most.In these high order modulation approach, the constellation point mapped bits often has different reliability steps, that is to say, in same modulation symbol, two bits wherein will have higher bit error probability than two other bit.Therefore, how utilizing the reliability of constellation point different mappings bit to improve decoding and transmission performance is to need the problem that solves at present.

For example, Fig. 3 a shows that modulation system is the planisphere of 16QAM in 3GPP LTE system, shown in Fig. 3 a, per four bit v0, v1, v2, v3 represent on the planisphere a bit.Wherein, v0, the reliability of two bits of v1 is higher than v2, and therefore two bits of v3, claim v0, and v1 is a high prioritized bit, and claims v2, and v3 is the low priority bit.Fig. 3 a shows that modulation system is the planisphere of 64QAM in 3GPP LTE system, shown in Fig. 4 a, and per six bit v0, v1, v2, v3, v4, v5 represent a bit on the planisphere, wherein, v0, two bit reliabilities of v1 are the highest, take second place to be v2 two bits of v3, v4, the reliability of two bits of v5 is the poorest.Therefore, claim v0, v1 is a high prioritized bit, and claims v2, and v3 is the medium priority bit; V4, v5 are the low priority bit.

Because the planisphere in the different communication systems is arranged different, therefore the position of height priority bit is also different, and in the IEEE802.16 agreement, the arrangement mode of planisphere is inequality in the arrangement mode of its planisphere and the 3GPP LTE system.Fig. 3 b shows that modulation system is the planisphere of 16QAM in the IEEE802.16 system, shown in Fig. 3 b, wherein, and bit b1, the reliability of b3 is higher than bit b0, and therefore b2, claims b1, and b3 is a high prioritized bit, and b0, b2 are the low priority bit.The planisphere of 64QAM is arranged shown in Fig. 4 b among the IEEE802.16, wherein, and bit b2, b5 has the highest reliability, bit b1, and the reliability of b4 is taken second place, and bit b0, the reliability of b3 is the poorest, therefore, claim bit b2, b5 is a high prioritized bit, and bit b1, b4 are the medium priority bit, bit b0, b3 are the low priority bit.

Similar with 16QAM and 64QAM, 3 bits in same 8PSK modulation symbol also have different priority.The error rate of first mapped bits is lower than latter two bit, and the error rate of latter two bit equates.Therefore, claim that first bit is a high prioritized bit, and latter two bit is the low priority bit.

As can be seen, because the priority inequality of different bits will cause the reliability inequality of bit, and then influence the performance of link, however the but proposition technical scheme that can address this problem as yet at present.

Summary of the invention

Consider in the correlation technique that the problem that priority difference owing to bit causes the reliability inequality of bit and influences link performance makes the present invention, for this reason, main purpose of the present invention is to provide a kind of constellation map mapping method and device.

According to an aspect of the present invention, provide a kind of constellation map mapping method.

Constellation map mapping method according to the present invention comprises: first mapping is handled: with a part of bit of bit sequence to be mapped as first bit sequence, every m bit wherein is mapped as a constellation point of planisphere according to order from front to back, wherein, for every m bit, the bit that will be positioned at first precalculated position maps on first predetermined bit of respective constellation point, the bit that will be positioned at second precalculated position maps on second predetermined bit of respective constellation point, and, m is the included bit number of each modulation symbol, and the reliability of first predetermined bit is higher than the reliability of second predetermined bit; Second mapping is handled: with another part bit of bit sequence to be mapped as second bit sequence, every m bit wherein is mapped as a constellation point of planisphere according to order from front to back, wherein, for every m bit, the bit that will be positioned at first precalculated position maps on second predetermined bit of respective constellation point, and the bit that will be positioned at second precalculated position maps on first predetermined bit of respective constellation point.

According to another aspect of the present invention, provide a kind of planisphere mapping device.

Planisphere mapping device according to the present invention comprises: first mapping block, be used for a part of bit with bit sequence to be mapped as first bit sequence, every m bit wherein is mapped as a constellation point of planisphere according to order from front to back, wherein, for every m bit, the bit that will be positioned at first precalculated position maps on first predetermined bit of respective constellation point, the bit that will be positioned at second precalculated position maps on second predetermined bit of respective constellation point, and, m is the included bit number of each modulation symbol, and the reliability of first predetermined bit is higher than the reliability of second predetermined bit; Second mapping block, be used for another part bit with bit sequence to be mapped as second bit sequence, every m bit wherein is mapped as a constellation point of planisphere according to order from front to back, wherein, for every m bit, the bit that will be positioned at first precalculated position maps on second predetermined bit of respective constellation point, and the bit that will be positioned at second precalculated position maps on first predetermined bit of respective constellation point.

By technique scheme of the present invention, by the bit position for the treatment of modulation bit after the Constellation Rearrangement is changed, the even spectrum energy of each bit, the reliability of balanced code word bits substantially, solve the problem that causes link performance decline in the correlation technique owing to the reliability inequality of code word bits, effectively strengthened the performance of link.

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 block diagram according to the digital communication system of correlation technique;

Fig. 2 is the realization schematic diagram according to the rate-matched of correlation technique;

Fig. 3 a is according to 16QAM modulation bit mapped constellation figure in the LTE standard of correlation technique;

Fig. 3 b is according to 16QAM modulation bit mapped constellation figure in the IEEE802.16 standard of correlation technique;

Fig. 4 a is according to 64QAM modulation bit mapped constellation figure in the LTE standard of correlation technique;

Fig. 4 b is according to 64QAM modulation bit mapped constellation figure in the IEEE802.16 standard of correlation technique;

Fig. 5 is the flow chart according to the constellation map mapping method of the embodiment of the invention;

Fig. 6 is the simplified flow chart according to the constellation map mapping method of the embodiment of the invention;

Fig. 7 is the flow chart that the relation of handling according to the execution and the chnnel coding of the constellation map mapping method of the embodiment of the invention is shown;

Fig. 8 is according to the rate-matched of the embodiment of the invention and Constellation Rearrangement process chart;

Fig. 9 is the process chart that obtains modulation symbol according to the embodiment of the invention;

Figure 10 is the planisphere mapping device according to the embodiment of the invention.

Embodiment

Functional overview

As mentioned above, at in the correlation technique because the priority inequality of different bits, the reliability inequality of the bit that causes, and then influence the problem of the performance of link, the invention provides a kind of planisphere mapping scheme, resequence by being mapped in the planisphere on the constellation point bit of different reliabilities, evenly the spectrum energy of each bit, the performance of the link of the reliability of balanced code word bits, and enhancing substantially.

Under the situation of not conflicting, embodiment and the feature among the embodiment among the application can make up mutually.

Method embodiment

According to an aspect of the present invention, provide a kind of constellation map mapping method.

Fig. 5 is the flow chart according to the constellation map mapping method of the embodiment of the invention, be used for the bit sequence of packet is mapped to each constellation point of planisphere, need to prove, for convenience of description, in Fig. 5, illustrated and described the technical scheme of method embodiment of the present invention, can in computer system, carry out such as a set of computer-executable instructions in the step shown in Fig. 5 with the form of step.Though figure 5 illustrates logical order, in some cases, can carry out step shown or that describe with the order that is different from herein.As shown in Figure 5, this method comprises following processing (step S502 is to step S504).

Step S502, first mapping is handled: with a part of bit of bit sequence to be mapped as first bit sequence, every m bit wherein is mapped as a constellation point of planisphere according to order from front to back, wherein, for every m bit, the bit that will be positioned at first precalculated position maps on first predetermined bit of respective constellation point, the bit that will be positioned at second precalculated position maps on second predetermined bit of respective constellation point, and, m is the included bit number of each modulation symbol, and the reliability of first predetermined bit is higher than the reliability of second predetermined bit.

Step S504, second mapping is handled: with another part bit of bit sequence to be mapped as second bit sequence, every m bit wherein is mapped as a constellation point of planisphere according to order from front to back, wherein, for every m bit, the bit that will be positioned at first precalculated position maps on second predetermined bit of respective constellation point, and the bit that will be positioned at second precalculated position maps on first predetermined bit of respective constellation point.

Need to prove, method shown in Figure 5 is applicable to the first biography of packet and the re-transmission of packet, by the bit position for the treatment of modulation bit after the Constellation Rearrangement is changed, the even spectrum energy of each bit, the reliability of balanced code word bits substantially, solve the problem that causes link performance decline in the correlation technique owing to the reliability inequality of code word bits, effectively strengthened the performance of link.

As shown in Figure 6, in actual applications, the processing procedure of method shown in Figure 5 can may further comprise the steps (step S602 is to step S608).

Step S602, importing length to be mapped is the bit sequence of L, i.e. HARQ bag (transmission);

Step S604 is for bit sequence front half (that is, mentioned above first bit sequence), according to the past order backward, every m bit directly is mapped as a constellation point (also can be called the planisphere point) of planisphere, and wherein, m is meant the bit number that each modulation symbol comprises;

When every m bit is mapped as a high-order modulation constellation figure point, index is from 0 to the m-1 position that indicates this m bit, to be positioned at position A (promptly, first precalculated position mentioned above) bit on is mapped on the high reliability bit of constellation point, the bit that will be positioned on the position B (that is, mentioned above second precalculated position) is mapped on the low reliability bits of constellation point;

Step S606, for bit sequence back half (that is, second bit sequence mentioned above), according to backward order in the past, every m bit passes through a point that is mapped as planisphere after the m bit arrangement again;

When every m bit is mapped as a high-order modulation constellation figure point, index is from 0 to the m-1 position that indicates this m bit, the bit that will be positioned on the A of position is mapped on the low reliability bits of constellation point, other bits that are positioned at position B is mapped on the high reliability bit of constellation point;

Step S608, output mapped constellation figure point sequence (sequence of complex numbers) is to follow-up processing module.

Above-mentioned modulation system includes, but are not limited to: 16QAM, 64QAM.

To be example with different modulation systems below, the processing procedure of the embodiment of the invention will be illustrated.

Modulation system is 16QAM

In modulation system is under the situation of 16QAM, and the processing procedure of Constellation Rearrangement can specifically can comprise following processing procedure referring to Fig. 6:

Import the bit sequence that length to be mapped is L (corresponding to step S602);

For this bit sequence front half (that is, first bit sequence mentioned above), according to the past order backward, per 4 bits directly are mapped as a point of planisphere; Index from 0 to 3 indicates the position of these 4 bits, there are two to be positioned at position A (promptly, first precalculated position mentioned above) bit on can be mapped on the high reliability bit of constellation point, two other is positioned on the low reliability bits that bit on the position B (that is, mentioned above second precalculated position) can be mapped to constellation point (corresponding to step S604);

For this bit sequence back half (that is, second bit sequence mentioned above), according to the past order backward, per 4 bits directly are mapped as a point of planisphere; Index from 0 to 3 indicates the position of these 4 bits, have two bits that are positioned on the A of position can be mapped on the low reliability bits of constellation point, two other is positioned on the high reliability bit that bit on the B of position can be mapped to constellation point (corresponding to step S606);

Output mapped constellation figure point sequence (sequence of complex numbers) is to the module (corresponding to step S608) of back.

For example, in the LTE system, when planisphere was planisphere shown in Fig. 3 a, v0, v1 were the high reliability bits of planisphere, and v2, v3 are the low reliability bits of planisphere.Assumed position A be 0,1}, i.e. first and second position; Position B be 2,3}, i.e. third and fourth position.

Last partial bit for bit sequence, per four bits are mapped as a constellation point of planisphere according to the past order backward, promptly, first and second bit are mapped to respectively on v0, the v1, the 3rd and the 4th bit map to v2, v3, obtain current planisphere point according to v0, v1, v2, v3 and planisphere, so analogize.Back a part of bit for bit sequence, per four bits are mapped as a constellation point of planisphere according to the past order backward, first and second bit map to respectively on v2, the v3, the 3rd and the 4th bit map to v0, v1, obtain the planisphere point according to v0, v1, v2, v3 and planisphere, so analogize.Finally just can obtain the constellation point sequence that length is L/4.

For example, in the IEEE802.16 system, when planisphere was planisphere shown in Fig. 3 b, b3, b1 were the high reliability bits of this planisphere, and b2, b0 are the low reliability bits of this planisphere.Assumed position A be 3,1}, i.e. first and third position; Position B be 2,0}, i.e. second, four position.For a part before the bit sequence, per four bits are mapped as a constellation point of planisphere according to the past order backward, first, second and third and four bits map to respectively on b3, b2, b1 and the b0, obtain current planisphere point according to b3, b2, b1, b0 and planisphere, so analogize.For a part behind the bit sequence, according to the past order backward per four bits are mapped as a planisphere point, first and the 3rd bit map to respectively on b2, the b0, second and the 4th bit map to b3, b1, obtain the planisphere point according to b3, b2, b1, b0 and planisphere, so analogize.Finally can obtain length is the constellation point sequence of L/4.

Modulation system is 64QAM

In modulation system is under the situation of 64QAM, and the processing procedure of Constellation Rearrangement can specifically can comprise following processing procedure referring to Fig. 6:

Import the bit sequence that length to be mapped is L (corresponding to step S602);

For half bit of front (that is, first bit sequence mentioned above) of bit sequence, according to the past order backward, per 6 bits directly are mapped as a point of planisphere; Index from 0 to 5 indicates the position of these 6 bits, be positioned at position A (promptly with two, first precalculated position mentioned above) bit on is mapped on the high reliability bit of constellation point, two other is positioned at position B (promptly, second precalculated position mentioned above) bit on is mapped on the middle reliability bits of constellation point, two bits that are positioned on the C of position is mapped on the low reliability bits of constellation point (corresponding to step S604);

For bit sequence back half (that is, second bit sequence mentioned above), according to the past order backward, per 6 bits directly are mapped as a point of planisphere; Index from 0 to 5 indicates the position of these 6 bits, two bits that are positioned on the A of position are mapped on the low reliability bits of constellation point, two other bit that is arranged on the B of position is mapped on the reliability bits of constellation point, two bits that are positioned on the C of position is mapped on the high reliability bit of constellation point (corresponding to step S606);

Output mapped constellation figure point sequence (sequence of complex numbers) is to the module (corresponding to step S608) of back.

For example, in the LTE system, when planisphere was planisphere shown in Fig. 4 a, v0, v1 were the high reliability bits of this planisphere, and v2, v3 are the middle reliability bits of this planisphere, and v4, v5 are the low reliability bits of this planisphere.Assumed position A be 0,1}, i.e. first and second position; Position B be 2,3}, i.e. third and fourth position; Position C be 4,5}, i.e. the 5th, six position.Last partial bit for bit sequence, per six bits are mapped as a constellation point of planisphere according to the past order backward, first and second bit map to respectively on v0, the v1, the 3rd and the 4th bit map to v2, v3, the 5th and the 6th bit map to v4, v5, obtain current planisphere point according to v0, v1, v2, v3, v4, v5 and planisphere, so analogize.Back a part of bit for bit sequence, according to the past order backward per six bits are mapped as a planisphere point, first and second bit map to respectively on v4, the v5, the 3rd and the 4th bit map to v2, v3, the 5th and the 6th bit map to v0, v1, obtain the planisphere point according to v0, v1, v2, v3, v4, v5 and planisphere, so analogize.Finally can obtain length is the constellation point sequence of L/6.

For example, in the IEEE802.16 system, when planisphere was planisphere shown in Fig. 4 b, b5, b2 were the high reliability bits of this planisphere, and b4, b1 are the middle reliability bits of this planisphere, and b3, b0 are the low reliability bits of this planisphere.Assumed position A be 5,2}, i.e. first, fourth position; Position B be 4,1}, i.e. second, five position; Position C be 3,0}, i.e. the 3rd, six position.Last partial bit for bit sequence, per six bits are mapped as a constellation point of planisphere according to the past order backward, first, second, third and fourth, five and the 6th bits map to respectively on b5, b4, b3, b2, b1 and the b0, obtain current planisphere point according to b5, b4, b3, b2, b1, b0 and planisphere, so analogize.Back a part of bit for bit sequence, according to the past order backward per six bits are mapped as a planisphere point, first and the 4th bit map to respectively on b3, the b0, second and the 5th bit map to respectively on b4, the b1, the 3rd and the 6th bit map to b5, b2, obtain the planisphere point according to b5, b4, b3, b2, b1, b0 and planisphere, so analogize.Finally can obtain length is the constellation point sequence of L/6.

According to Constellation Rearrangement method provided by the invention, this Constellation Rearrangement method includes, but are not limited to following a kind of concrete application, should specifically use and be: above-mentioned bit sequence to be mapped is meant the HARQ packet before the Constellation Rearrangement, and the HARQ packet is carried out will obtaining treating modulation bit behind the planisphere bit rearrangement.Wherein, to head pass that packet has carried out that first mapping is handled and the second mapping processing after, under the situation that bit sequence is retransmitted, if the packet that retransmits is merged decoding according to the steadily increase redundancy mode, then first bit sequence is carried out first mapping and handle, and second bit sequence is carried out second mapping handle; To head pass that packet has carried out that first mapping is handled and the second mapping processing after, under the situation that bit sequence is retransmitted, if the packet that retransmits is merged decoding according to the chase mode, then first bit sequence is carried out second mapping and handle, and second bit sequence is carried out first mapping handle.

Fig. 7 shows the relation according to Constellation Rearrangement method of the present invention and chnnel coding processing.As shown in Figure 7, specifically can be divided into following two steps:

Step S702 encodes the block of information Bit data of input, for example, carries out Turbo coding, CTC coding etc.;

Step S704 carries out rate-matched with the data behind the coding, generates HARQ bag data, carry out Constellation Rearrangement again after, the modulation bit data are treated in output.

Fig. 8 shows the handling process to the coding output code word bit stream that obtains after the chnnel coding.

As shown in Figure 8, specifically comprise following processing:

Step S802 carries out bit separation to coding output code word bit stream;

Step S804 carries out sub-block interleaving and handles;

Step S806 carries out bit collection and handles;

Step S808 carries out circular buffer/rate-matched and handles;

Step S810 carries out Constellation Rearrangement/Bit Interleave and handles.

Fig. 9 shows the processing procedure that obtains modulation symbol from the block of information Bit data, as shown in Figure 9, specifically comprises following processing:

S902 encodes to the block of information Bit data, as Turbo code, and CTC sign indicating number etc., but be not limited thereto;

S904 carries out rate-matched output HARQ packet based on circular buffer and remains unchanged by last partial data the code word bits behind the coding, and a part of data in back are carried out high prioritized bit and reset with the requirement that the low priority bit is changed;

S906 carries out the high order modulation mapping to the HARQ packet after resetting.

Wherein, can carry out at step S904 according to above-mentioned Constellation Rearrangement method of the present invention.

The implementation process of the Constellation Rearrangement method that will mate with the Turbo code circulating buffer memory rate of 3GPP LTE standard is that example is described bright the present invention in detail below.Should be noted that the present invention can also be applied to other system outside the LTE system, and can adopt other coded system outside the Turbo code.

Modulation system is the planisphere mapping processing procedure of 16QAM in the LTE system

In 3GPP LTE standard, modulation system is for when planisphere is planisphere shown in Fig. 3 a, and v0, v1 are the high reliability bits of this planisphere, and v2, v3 are the low reliability bits of this planisphere.Assumed position A be 0,1}, i.e. first and second position; Position B be 2,3}, i.e. third and fourth position.For a part before the bit sequence, according to the past order backward per four bits are mapped as a planisphere point, first and second bit map to respectively on v0, the v1, the 3rd and the 4th bit map to v2, v3, obtain current planisphere point according to v0, v1, v2, v3 and planisphere, so analogize.For a part behind the bit sequence, according to the past order backward per four bits are mapped as a planisphere point, first and second bit are mapped to respectively on v2, the v3, the 3rd and the 4th bit are mapped to v0, v1, obtain the planisphere point according to v0, v1, v2, v3 and planisphere, so analogize.Finally can obtain length is the constellation point sequence of L.

Concrete processing procedure is:

At first, after the information bit data of input are carried out the Turbo coding, coding codeword is carried out rate-matched, generate HARQ bag data, promptly obtain bit sequence to be mapped, concrete rate-matched process no longer repeats as shown in Figure 6 here.

Afterwards, HARQ packet bit is carried out Constellation Rearrangement handles, just to the every m of the last partial data bit of HARQ packet directly be mapped as in the planisphere a bit, then a part of data are then carried out the rearrangement of height priority bit.Promptly, in same modulation symbol, originally bit that was mapped to low priority position in the planisphere and the bit that is mapped to the high priority position are changed, be its objective is that when the HARQ packet overlaps with each bit of distributing to the HARQ packet of energy even, detailed process is as follows:

Importing length to be mapped is the bit sequence D=(d of L ₀, d ₁..., d _L-1);

If high order modulation is 16QAM, the modulation mapping ruler can be with reference to Fig. 3 a, that is, v0, v1 are the high reliability bits of this planisphere, and v2, v3 are the low reliability bits of this planisphere.

In order to be unit with 4 bits when data are divided with complete being mapped in the planisphere of bit to be mapped, the contained bit number of promptly last partial data is:

L ₁=4*floor (L/8) (that is, mentioned above first bit sequence)

The contained bit number of a part of data in back is:

L ₂=4*ceil (L/8) (that is, mentioned above second bit sequence)

Wherein, floor represents downward round numbers, and ceil represents the number that rounds up.

Half bit of front for bit sequence carries out the first mapping processing, and according to the past order backward, per 4 bits directly are mapped as a point of planisphere; Index from 0 to 3 indicates the position of these 4 bits, be positioned at position A (promptly with two, first precalculated position mentioned above) bit on is mapped on the high reliability bit of constellation point, in addition two bits that are positioned on the position B (that is, mentioned above second precalculated position) are mapped on the low reliability bits of constellation point.Promptly, according to the past order backward per four bits are mapped as a planisphere point, first and second bit are mapped to respectively on v0, the v 1, the 3rd and the 4th bit are mapped to v2, v3, according to v0, v1, v2, v3 and planisphere, obtain current planisphere point, particularly, can utilize following formula that the bit in first bit sequence is shone upon:

For k from 0 to L ₁/ 4-1,

v _j，k＝d _4k+j j＝0，1，2，3

Wherein, v _{0, k}, v _{1, k}, v _{2, k}, v _{3, k}The coordinate of representing k constellation point, according to this formula, finally can obtain length is preceding a part of constellation point sequence of the constellation point sequence of L/4 (that is, the first constellation point sequence above), e _kIt is plural number.

Half bit of back for bit sequence carries out the second mapping processing, and according to the past order backward, per 4 bits directly are mapped as a point of planisphere; Index from 0 to 3 indicates the position of these 4 bits, two bits that are positioned on the A of position is mapped on the low reliability bits of constellation point, and the bit on the B of two other position is mapped on the high reliability bit of constellation point.Promptly, back a part of bit for bit sequence, according to the past order backward per four bits are mapped as a planisphere point, first and second bit are mapped to respectively on v2, the v3, the 3rd and the 4th bit are mapped to v0, v1,, obtain the planisphere point according to v0, v1, v2, v3 and planisphere, particularly, can shine upon the bit in second bit sequence according to following formula:

For k from L ₁/ 4 to L/4-1,

v _j，k＝d _4k+j+2 j＝0，1

v _j，k＝d _4k+j-2 j＝2，3

Wherein, v _{0, k}, v _{1, k}, v _{2, k}, v _{3, k}The coordinate of representing k constellation point is so analogized, and finally can obtain length is back a part of constellation point sequence of the constellation point sequence of L/4

(that is, the second constellation point sequence mentioned above), wherein e _kIt is plural number.

At last, can export mapped constellation figure point sequence E _Total=(e ₀, e ₁..., e _L/4-1) (sequence of complex numbers) to the module of back.

Modulation system is the planisphere mapping processing procedure of 64QAM in the LTE system

In the LTE system, if modulation system is 64QAM, the modulation mapping ruler is shown in Fig. 4 a, and v0, v1 are the high reliability bits of this planisphere, and v2, v3 are the middle reliability bits of this planisphere, and v4, v5 are the low reliability bits of this planisphere.Suppose, position A be 0,1}, i.e. first and second position; Position B be 2,3}, i.e. third and fourth position; Position C be 4,5}, i.e. the 5th, six position.Last partial bit for bit sequence, according to the past order backward per six bits are mapped as a planisphere point, first and second bit are mapped to respectively on v0, the v1, the 3rd and the 4th bit are mapped to v2, v3, and the 5th and the 6th bit map to v4, v5.Obtain current planisphere point according to v0, v1, v2, v3, v4, v5 and planisphere, so analogize.Back a part of bit for bit sequence, according to the past order backward per six bits are mapped as a planisphere point, first and second bit are mapped to respectively on v4, the v5, the 3rd and the 4th bit are mapped to v2, v3, and the 5th and the 6th bit map to v0, v1.Obtain the planisphere point according to v0, v1, v2, v3, v4, v5 and planisphere, so analogize.Finally can obtain length is the constellation point sequence of L/6.

Concrete processing procedure is:

In order can when data are divided, to be unit with 6 bits with complete being mapped in the planisphere of bit to be mapped.Be that the contained bit number of last partial data is:

L ₁＝6*floor(L/12)

The contained bit number of a part of data in back is:

L ₂＝6*ceil(L/12)

Wherein, floor represents downward round numbers, and ceil represents the number that rounds up.

For half bit of front of bit sequence,, per 6 bits directly are mapped as a point of planisphere according to the past order backward; Index from 0 to 5 indicates the position of these 6 bits, two bits that are positioned on the A of position are mapped on the high reliability bit of constellation point, in addition two bits that are arranged on the B of position are mapped on the reliability bits of constellation point, also two bits that are positioned on the C of position are mapped on the low reliability bits of constellation point.

Promptly, last partial bit for bit sequence, according to the past order backward per six bits are mapped as a planisphere point, first and second bit are mapped to respectively on v0, the v1, the 3rd and the 4th bit are mapped to v2, v3, the 5th and the 6th bit map to v4, v5, obtain current planisphere point according to v0, v1, v2, v3, v4, v5 and planisphere, so analogize.Finally can obtain length is preceding a part of constellation point sequence of the constellation point sequence of L/6

For k from 0 to L ₁/ 6-1,

v _j，k＝d _6k+j j＝0，1，2，3，4，5

Wherein, v _{0, k}, v _{1, k}, v _{2, k}, v _{3, k}, v _{4, k}, v _{5, k}The coordinate of representing k constellation point, e _kIt is plural number.

For half bit of back of bit sequence,, per six bits directly are mapped as a point of planisphere according to the past order backward; Index from 0 to 5 indicates the position of these 6 bits, two bits that are positioned on the A of position are mapped on the low reliability bits of constellation point, two other bit that is arranged on the B of position is mapped on the reliability bits of constellation point, also two bits that are positioned on the C of position is mapped on the high reliability bit of constellation point.

Promptly, back a part of bit for bit sequence, according to the past order backward per six bits are mapped as a planisphere point, first and second bit are mapped to respectively on v4, the v5, the 3rd and the 4th bit are mapped to v2, v3, the 5th and the 6th bit are mapped to v0, v1.Obtain the planisphere point according to v0, v1, v2, v3, v4, v5 and planisphere, so analogize.Finally can obtain length is the back part of the constellation point sequence of L/6

E wherein _kIt is plural number.

For k from L ₁/ 6 to L/6-1,

v _j，k＝d _6k+j+4 j＝0，1

v _j，k＝d _6k+j j＝2，3

v _j，k＝d _6k+j-4 j＝4，5

Wherein, v _{0, k}, v _{1, k}, v _{2, k}, v _{3, k}, v _{4, k}, v _{5, k}The coordinate of representing k constellation point.

At last, can export mapped constellation figure point sequence E _Total=(e ₀, e ₁..., e _L/6-1) (sequence of complex numbers) to the module of back.

To be that example describes the present invention in detail with the implementation process of the Constellation Rearrangement method of IEEE802.16 modular system and CTC sign indicating number circulating buffer memory rate coupling below.

Modulation system is the planisphere mapping processing procedure of 16QAM in the IEEE802.16 system

For example, in the IEEE802.16 standard, when planisphere was planisphere shown in Fig. 7 b, b3, b1 were the high reliability bits of this planisphere, and b2, b0 are the low reliability bits of this planisphere.Assumed position A be 3,1}, i.e. first and third position; Position B be 2,0}, i.e. second, four position.Last partial bit for bit sequence, according to the past order backward per four bits are mapped as a planisphere point, first and the 3rd bit are mapped to respectively on b3, the b1, second and the 4th bit are mapped to b2, b0, obtain current planisphere point according to b0, b1, b2, b3 and planisphere, so analogize.Back a part of bit for bit sequence, according to the past order backward per four bits are mapped as a planisphere point, first and the 3rd bit are mapped to respectively on b2, the b0, second and the 4th bit are mapped to b3, b1, obtain the planisphere point according to b0, b1, b2, b3 and planisphere, so analogize.Finally can obtain length is the constellation point sequence of L/4.

Concrete processing procedure is:

At first, after the information bit data of input are carried out the CTC coding, coding codeword is carried out rate-matched, generate HARQ bag data, that is, obtained bit sequence to be mapped, concrete rate-matched process can be referring to Fig. 6.

Afterwards, HARQ packet bit is carried out Constellation Rearrangement to be handled, promptly, according to from front to back order to every m bit in the last partial data of HARQ packet directly be mapped as in the planisphere a bit, the a part of data in back are then carried out the height priority bit resets, the bit that promptly will be mapped to low priority position in the planisphere in same modulation symbol is originally changed with the bit that is mapped to the high priority position, its objective is that when the HARQ packet overlaps with each bit of distributing to the HARQ packet of energy even, detailed process is as follows:

Importing length to be mapped is the bit sequence D=(d of L ₀, d ₁, d _L-1);

If high order modulation is 16QAM, the modulation mapping ruler is shown in Fig. 3 b, and b3, b1 are the high reliability bits of this planisphere, and b2, b0 are the low reliability bits of this planisphere.

In order to be unit with 4 bits when data are divided with complete being mapped in the planisphere of bit to be mapped, the contained bit number of promptly last partial data is: L ₁=4*floor (L/8); The contained bit number of a part of data in back is: L ₂=4*ceil (L/8); Wherein, floor represents downward round numbers, and ceil represents the number that rounds up.

For half bit of front of bit sequence,, per 4 bits directly are mapped as a point of planisphere according to the past order backward; Index from 0 to 3 indicates the position of these 4 bits, two bits that are positioned on the A of position is mapped on the high reliability bit of constellation point, and two other bit that is positioned on the B of position is mapped on the low reliability bits of constellation point.

Promptly, last partial bit for bit sequence, according to the past order backward per four bits are mapped as a planisphere point, first and the 3rd bit are mapped to respectively on b3, the b1, second and the 4th bit are mapped to b2, b0 obtains current planisphere point according to b0, b1, b2, b3 and planisphere, so analogizes.Finally can obtain length is preceding a part of constellation point sequence of the constellation point sequence of L/4

For k from 0 to L ₁/ 4-1,

b _j，k＝d _4k+(3-j) j＝0，1，2，3

Wherein, b _{0, k}, b _{1, k}, b _{2, k}, b _{3, k}The coordinate of representing k constellation point, e _kIt is plural number.

For half bit of back of bit sequence,, per 4 bits directly are mapped as a point of planisphere according to the past order backward; Index from 0 to 3 indicates the position of these 4 bits, two bits that are positioned on the A of position is mapped on the low reliability bits of constellation point, and two other bit that is positioned on the B of position is mapped on the high reliability bit of constellation point.

Promptly, back a part of bit for bit sequence, according to the past order backward per four bits are mapped as a planisphere point, first and the 3rd bit are mapped to b2 respectively, on the b0, second and the 4th bit are mapped to b3, b1, obtain the planisphere point, so analogize according to b3, b2, b1, b0 and planisphere.Finally can obtain length is back a part of constellation point sequence of the constellation point sequence of L/4

E wherein _kIt is plural number.

For k from L ₁/ 4 to L/4-1,

b _j，k＝d _4k+j+2 j＝0，1

b _j，k＝d _4k+j-2 j＝2，3

Wherein, b _{0, k}, b _{1, k}, b _{2, k}, b _{3, k}The coordinate of representing k constellation point.

Afterwards, can export mapped constellation figure point sequence E _Total=(e ₀, e ₁..., e _L/4-1) (sequence of complex numbers) to the module of back.

Modulation system is the planisphere mapping processing procedure of 64QAM in the IEEE802.16 system

In the IEEE802.16 standard, if high order modulation is 64QAM, the modulation mapping ruler can be with reference to Fig. 4 b.At this moment, b5, b2 are the high reliability bits of this planisphere, and b4, b1 are the middle reliability bits of this planisphere, and b3, b0 are the low reliability bits of this planisphere.Assumed position A be 5,2}, i.e. first, fourth position; Position B be 4,1}, i.e. second, five position; Position C be 3,0}, i.e. the 3rd, six position.

Last partial bit for bit sequence, according to the past order backward per six bits are mapped as a planisphere point, first and the 4th bit are mapped to respectively on b5, the b2, second and the 5th bit are mapped to b4, b1, the 3rd and the 6th bit are mapped to b3, b0.Obtain current planisphere point according to b0, b1, b2, b3, b4, b5 and planisphere, so analogize.

Back a part of bit for bit sequence, according to the past order backward per six bits are mapped as a planisphere point, first and the 4th bit are mapped to respectively on b3, the b0, second and the 5th bit are mapped to b4, b1, the 3rd and the 6th bit are mapped to b5, b2.Obtain the planisphere point according to b0, b1, b2, b3, b4, b5 and planisphere, so analogize.Finally can obtain length is the constellation point sequence of L/6.

Concrete processing procedure is:

In order can when data are divided, to be unit with 6 bits with complete being mapped in the planisphere of bit to be mapped.That is, the contained bit number of last partial data is: L ₁=6*floor (L/12); The contained bit number of a part of data in back is: L ₂=6*ceil (L/12); Wherein, floor represents downward round numbers, and ceil represents the number that rounds up.

For half bit of front of bit sequence, according to the past order backward, per 6 bits directly are mapped as a point of planisphere; Index from 0 to 5 indicates the position of these 6 bits, two bits that are positioned on the A of position are mapped on the high reliability bit of constellation point, two other bit that is arranged on the B of position is mapped on the reliability bits of constellation point, also two bits that are positioned on the C of position is mapped on the low reliability bits of constellation point.

Promptly, last partial bit for bit sequence, according to the past order backward per six bits are mapped as a planisphere point, first and the 4th bit are mapped to respectively on b5, the b2, second and the 5th bit are mapped to b4, b1, the 3rd and the 6th bit are mapped to b3, b0, obtain current planisphere point, so analogize according to b0, b1, b2, b3, b4, b5 and planisphere.Finally can obtain length is preceding a part of constellation point sequence of the constellation point sequence of L/6

For k from 0 to L ₁/ 6-1,

b _j，k＝d _6k+(5-j) j＝0，1，2，3，4，5

Wherein, b _{0, k}, b _{1, k}, b _{2, k}, b _{3, k}, b _{4, k}, b _{5, k}The coordinate of representing k constellation point, e _kIt is plural number.

For half bit of back of bit sequence, according to the past order backward, per six bits directly are mapped as a point of planisphere; Index from 0 to 5 indicates the position of these 6 bits, there are two bits on the A of position to be mapped on the low reliability bits of constellation point, bit on the B of two other position is mapped on the middle reliability bits of constellation point, also has the bit on two position C to be mapped on the high reliability bit of constellation point.

Promptly, back a part of bit for bit sequence, according to the past order backward per six bits are mapped as a planisphere point, first and the 4th bit are mapped to respectively on b3, the b0, second and the 5th bit are mapped to b4, b1, the 3rd and the 6th bit map to b5, b2, obtain the planisphere point according to b0, b1, b2, b3, b4, b5 and planisphere, so analogize.Finally can obtain length is back a part of constellation point sequence of the constellation point sequence of L/6

E wherein _kIt is plural number.

For k from L ₁/ 6 to L/6-1,

b _j，k＝d _6k+j+3 j＝0，1，2

b _j，k＝d _6k+j-3 j＝3，4，5

Wherein, b _{0, k}, b _{1, k}, b _{2, k}, b _{3, k}, b _{4, k}, b _{5, k}The coordinate of representing k constellation point.

Afterwards, can export mapped constellation figure point sequence E _Total=(e ₀, e ₁..., e _L/6-1) (sequence of complex numbers) to the module of back.

Need to prove; the constellation map mapping method of the embodiment of the invention only is that 16QAM and 64QAM are that example describes with the modulation system; but be not limited to this; other modulation systems of using constellation map mapping method provided by the invention are still in protection scope of the present invention; for example, modulation system is 8PSK, 256QAM.

Device embodiment

According to the embodiment of the invention, provide a kind of planisphere mapping device.

Figure 10 is the structured flowchart according to the planisphere mapping device of the embodiment of the invention, as shown in figure 10, comprises first mapping block 10 and second mapping block 20.

First mapping block 10, be used for a part of bit with bit sequence to be mapped as first bit sequence, every m bit wherein is mapped as a constellation point of planisphere according to order from front to back, wherein, for every m bit, the bit that will be positioned at first precalculated position maps on first predetermined bit of respective constellation point, the bit that will be positioned at second precalculated position maps on second predetermined bit of respective constellation point, and, m is the included bit number of each modulation symbol, and the reliability of first predetermined bit is higher than the reliability of second predetermined bit; Second mapping block 20, be used for another part bit with bit sequence to be mapped as second bit sequence, every m bit wherein is mapped as a constellation point of planisphere according to order from front to back, wherein, for every m bit, the bit that will be positioned at first precalculated position maps on second predetermined bit of respective constellation point, and the bit that will be positioned at second precalculated position maps on first predetermined bit of respective constellation point.

In sum, by means of technique scheme of the present invention, by the bit position for the treatment of modulation bit after the Constellation Rearrangement is changed, the even spectrum energy of each bit, the reliability of balanced code word bits substantially, solve the problem that causes link performance decline in the correlation technique owing to the reliability inequality of code word bits, effectively strengthened the performance of link; In addition, the solution of the present invention is fit to Project Realization, is applicable to the digital radio communication system of various standards, and has good utilization effect.

The above is the preferred embodiments of the present 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 protection scope of the present invention.

Claims (8)

1. a constellation map mapping method is characterized in that, comprising:

First mapping is handled: with a part of bit of bit sequence to be mapped as first bit sequence, every m bit wherein is mapped as a constellation point of planisphere according to order from front to back, wherein, for every m bit, the bit that will be positioned at first precalculated position maps on first predetermined bit of respective constellation point, the bit that will be positioned at second precalculated position maps on second predetermined bit of respective constellation point, and, m is the included bit number of each modulation symbol, and the reliability of described first predetermined bit is higher than the reliability of described second predetermined bit;

Second mapping is handled: with another part bit of bit sequence to be mapped as second bit sequence, every m bit wherein is mapped as a constellation point of described planisphere according to order from front to back, wherein, for every m bit, the bit that will be positioned at described first precalculated position maps on second predetermined bit of respective constellation point, and the bit that will be positioned at described second precalculated position maps on first predetermined bit of respective constellation point.

2. method according to claim 1, it is characterized in that, under the situation that described bit sequence is retransmitted, if the described packet that retransmits is merged decoding according to the steadily increase redundancy mode, then described first bit sequence is carried out described first mapping and handle, and described second bit sequence is carried out described second mapping handle.

3. method according to claim 1, it is characterized in that, under the situation that described bit sequence is retransmitted, if the described packet that retransmits is merged decoding according to the chase mode, then described first bit sequence is carried out described second mapping and handle, and described second bit sequence is carried out described first mapping handle.

4. according to each described method in the claim 1 to 3, it is characterized in that, is under the situation of 16QAM of Long Term Evolution standard in described modulation system,

According to following formula at described bit sequence D=(d ₀, d ₁..., d _L-1) in determine described first bit sequence and described second bit sequence:

L ₁＝4*floor(L/8)，L ₂＝4*ceil(L/8)；

Wherein, d is the bit in the described bit sequence, L ₁Be the length of described first bit sequence, L ₂Be the length of described second bit sequence, floor represents downward round numbers computing, ceil several computings of representing to round up;

When carrying out described first mapping and handle, according to formula v _{J, k}=d _4k+jBit in described first bit sequence is shone upon, wherein, j=0,1,2,3, v ₀, k, v _{1, k}, v _{2, k}, v _{3, k}Be the coordinate of k constellation point, k is 0 to L ₁/ 4-1;

When carrying out described second mapping and handle, the bit in described second bit sequence is shone upon according to following formula:

v _j，k＝d _4k+j+2，j＝0，1，

v _j，k＝d _4k+j-2，j＝2，3；

Wherein, j=0,1,2,3, v _{0, k}, v _{1, k}, v _{2, k}, v _{3, k}Be the coordinate of k constellation point, k is L ₁/ 4 to L/4-1;

Obtain planisphere point sequence E according to the described first constellation point sequence and the described second constellation point sequence as mapping result _Total=(e ₀, e ₁..., e _L/4-1).

5. according to each described method in the claim 1 to 3, it is characterized in that, is under the situation of 64QAM of Long Term Evolution standard in described modulation system,

According to following formula at described bit sequence D=(d ₀, d ₁..., d _L-1) in determine described first bit sequence and described second bit sequence:

L ₁＝6*floor(L/12)，L ₂＝6*ceil(L/12)；

Wherein, d is the bit in the described bit sequence, L ₁Be the length of described first bit sequence, L ₂Be the length of described second bit sequence, floor represents downward round numbers computing, ceil several computings of representing to round up;

When carrying out described first mapping and handle, according to formula v _{J, k}=d _6k+j, the bit in described first bit sequence is shone upon, wherein, j=0,1,2,3,4,5, v _{0, k}, v _{1, k}, v _{2, k}, v _{3, k}, v _{4, k}, v _{5, k}Be the coordinate of k constellation point, k is 0 to L ₁/ 6-1;

When carrying out described second mapping and handle, the bit in described second bit sequence is shone upon according to following formula:

v _j，k＝d _6k+j+4 j＝0，1

v _j，k＝d _6k+j j＝2，3

v _j，k＝d _6k+j-4 j＝4，5

Wherein, j=0,1,2,3,4,5, v _{0, k}, v _{1, k}, v _{2, k}, v _{3, k}Be the coordinate of k constellation point, k is that L1/6 is to L/6-1.

6. according to each described method in the claim 1 to 3, it is characterized in that, is under the situation of 16QAM of IEEE 802.16 standards in described modulation system,

According to following formula at described bit sequence D=(d ₀, d ₁..., d _L-1) in determine described first bit sequence and described second bit sequence:

L ₁＝4*floor(L/8)，L ₂＝4*ceil(L/8)；

Wherein, d is the bit in the described bit sequence, L ₁Be the length of described first bit sequence, L ₂Be the length of described second bit sequence, floor represents downward round numbers computing, ceil several computings of representing to round up;

When carrying out described first mapping and handle, according to formula b _{J, k}=d _{4k+ (3-j)}Bit in described first bit sequence is shone upon, wherein, j=0,1,2,3, b _{0, k}, b _{1, k}, b _{2, k}, b _{3, k}Be the coordinate of k constellation point, k is 0 to L ₁/ 4-1;

When carrying out described second mapping and handle, the bit in described second bit sequence is shone upon according to following formula:

b _j，k＝d _4k+j+2 j＝0，1

b _j，k＝d _4k+j-2 j＝2，3

Wherein, j=0,1,2,3, b _{0, k}, b _{1, k}, b _{2, k}, b _{3, k}Be the coordinate of k constellation point, k is that L1/4 is to L/4-1.

7. according to each described method in the claim 1 to 3, it is characterized in that, is under the situation of 64QAM of IEEE 802.16 standards in described modulation system,

According to following formula at described bit sequence D=(d ₀, d ₁..., d _L-1) in determine described first bit sequence and described second bit sequence:

L ₁＝6*floor(L/12)，L ₂＝6*ceil(L/12)；

Wherein, d is the bit in the described bit sequence, L ₁Be the length of described first bit sequence, L ₂Be the length of described second bit sequence, floor represents downward round numbers computing, ceil several computings of representing to round up;

When carrying out described first mapping and handle, according to formula b _{J, k}=d _{6k+ (5-j)}, the bit in described first bit sequence is shone upon, wherein, j=0,1,2,3,4,5, b _{0, k}, b _{1, k}, b _{2, k}, b _{3, k}, b _{4, k}, b _{5, k}Be the coordinate of k constellation point, k is 0 to L ₁/ 6-1;

When carrying out described second mapping and handle, the bit in described second bit sequence is shone upon according to following formula:

b _j，k＝d _6k+j+3 j＝0，1，2

b _j，k＝d _6k+j-3 j＝3，4，5

Wherein, j=0,1,2,3,4,5, b _{0, k}, b _{1, k}, b _{2, k}, b _{3, k}, b _{4, k}, b _{5, k}Be the coordinate of k constellation point, k is L ₁/ 6 to L/6-1.

8. a planisphere mapping device is characterized in that, comprising:

First mapping block, be used for a part of bit with bit sequence to be mapped as first bit sequence, every m bit wherein is mapped as a constellation point of planisphere according to order from front to back, wherein, for every m bit, the bit that will be positioned at first precalculated position maps on first predetermined bit of respective constellation point, the bit that will be positioned at second precalculated position maps on second predetermined bit of respective constellation point, and, m is the included bit number of each modulation symbol, and the reliability of described first predetermined bit is higher than the reliability of described second predetermined bit;

Second mapping block, be used for another part bit with bit sequence to be mapped as second bit sequence, every m bit wherein is mapped as a constellation point of described planisphere according to order from front to back, wherein, for every m bit, the bit that will be positioned at described first precalculated position maps on second predetermined bit of respective constellation point, and the bit that will be positioned at described second precalculated position maps on first predetermined bit of respective constellation point.

Images