CN1437340A - Mapping method from the calculated value of transmission format combination to the indication of transmission format combination - Google Patents

Abstract

A mapping method of calculation value of transmission format combination to indication of transmission format combination includes to form TFCI set by m number of different TFCI selected out from 2k(0-2k-1) number of TFCI, calculating code minimum distance after each TFCI set having been coded and to search maximum value of code minimum distance from above said code distance as well as to index out TFCI set according to subscript of maximum value of code minimum distance, making ascending order arrangement of TFCI in TSi of TFCI set and setting up a mapping relationship between CTFC and TFCI according to ascending order one by one correspondingly. It is able to make decoding performance optimum because the code minimum distance is maximum after selected TFCI set has been coded.

Description

The mapping method of indication from the calculated value of transformat combination to transformat combination

Technical field

The present invention relates to the coding method in code division multiple access (CDMA) mobile communication system, relate in particular in the cataloged procedure of transformat combination indication (TFCI) data mapping method from the calculated value (CTFC) of transformat combination to TFCI.

Background technology

The form that transformat combination indication (TFCI) is used to indicate code combination transmission channel (CCTrCH) is usually by the calculated value definition corresponding TFCI of radio resource control layer (RRC) according to CTFC.According to the agreement 3GPP TS 25.331V3.6.0 of 3G (Third Generation) Moblie cooperative association (3GPP) (2001-06), the computing formula of CTFC is as follows: $\mathrm{CTFC}({\mathrm{TFI}}_1,{\mathrm{TFI}}_2,K,{\mathrm{TFI}}_I)=\underset{i=1}{\overset{I}{\mathrm{\Σ}}}{\mathrm{TFI}}_i{P}_i;$ $P_i=\underset{j=0}{\overset{i-1}{\mathrm{\Π}}}{L}_j,{\mathrm{TFI}}_i\∈\{\mathrm{0,1,2},\·\·\·\·\·\·,L_i-1\},----\left(1\right)$

L ₀＝1

L _i, i=1...I is the transformat number of i transmission channel, transmission channel is according to sign (ID) number sort ascending of transmission channel.CTFC is used for identifying different transformat combination, and for different transformat combination, by formula the value of (1) CTFC of calculating is different, and promptly the CTFC value of each transformat combination correspondence is unique.When sending data, transmit leg sends by some transformat combination, what must know during recipient's restore data that transmit leg selects for use is any transformat combination, transmit leg must transmit the sign of this transformat combination in advance like this, be that CTFC gives the recipient, but because by formula (1) CTFC value of calculating may be too big, the bearing capacity that may exceed physical channel so communication system does not transmit CTFC, but transmits corresponding TFCI.As long as between transmit leg and recipient, appoint the one-to-one relationship of CTFC and TFCI in advance, the recipient just can determine corresponding C TFC according to this corresponding relation after receiving the TFCI value, thereby determine the transformat combination of transmit leg, further decipher restore data again according to this transformat combination.

A kind of common corresponding relation of CTFC and TFCI is as follows: the CTFC ascending order is arranged, and corresponding definition of T FCI value increases progressively ascending order since 0 with 1 and arranges.For example there is the value of three CTFC to be respectively 3,7,20, then CTFC is as follows with the one-to-one relationship regulation of TFCI: the CTFC value is that the value of 3 o'clock corresponding TFCI is 0, the CTFC value is that the value of 7 o'clock corresponding TFCI is 1, and the CTFC value is that the value of 20 o'clock corresponding TFCI is 2, is expressed as follows with diagram:

CTFC??????TFCI

3???????0

7???????1

20??????2

If the sign CTFC value of the transformat combination when transmit leg sends data is 7,7 these information that then transmit are not as the simpler more resource-saving of transmission 1 this information, and the recipient just can determine that CTFC is 7 according to one-to-one relationship when obtaining TFCI information 1.

3 transmission channels are for example arranged, and transmission channel ID identification number is respectively 1,2,3, establishing the transmission channel identification number and be 1 transmission channel has 3 corresponding transformats, this 3 transformats indication collection with integer representation be 0,1,2}, if the transmission channel identification number is 2 transmission channel 3 transformats are arranged also, these 3 transformats indications are { 0,1 with integer representation, 2}, establishing the transmission channel identification number and be 3 transmission channel has 2 transformats, and these 2 transformats indications are { 0 with integer representation, 1}, then these 3 transmission channels are capable of being combined goes out 3 * 3 * 2=18 transformat combination, supposes that legal available transformat combination is a part of 18, has only 8, the corresponding transformat combination indication of these 8 transformat combination collection with integer representation is: { (0,0,0), (1,0,0), (2,0,0), (0,1,0), (0,2,0), (0,0,1), (0,1,1), (0,2,1) }, then can calculate CTFC according to formula (1), again according to mapping ruler: the CTFC ascending order is arranged, and corresponding definition of T FCI value increases progressively ascending order since 0 with 1 and arranges the TFCI that just obtains correspondence, sees the following form.

Transmission channel ID			CTFC is to the mapping relations of TFCI
					????1	????2	????3
The transformat indication	The transformat indication	The transformat indication						????CTFC	????TFCI
			????0	????0	????0	????0	????0
????1	????0	????0						????1	????1
			????2	????0	????0	????2	????2
????0	????1	????0						????3	????3
			????0	????2	????0	????6	????4
????0	????0	????1						????9	????5
			????0	????1	????1	????12	????6
????0	????2	????1						????15??	????7

Because TFCI has indicated the transformat combination of transmission channel, so the correctness of TFCI decoding is speech business, the prerequisite of decoding such as data service.In order to improve the correctness of TFCI transmission, in 3GPP, through performance coding method is preferably encoded on the one hand, also increases the antijamming capability (transmitting power of Dedicated Physical Data Channel DPDCH raising 0～6dB) relatively usually by improving transmitting power on the other hand.The coding of TFCI is the RM linear block codes at present, and by the linear block codes theory as can be known, two key factors that influence decoding performance are: sign indicating number minimum range and code word weight distribution.Therefore should select suitable TFCI from the angle of performance, make the minimum range maximum of its coding back sign indicating number.The TFCI that obtains to the mapping method of TFCI according to present CTFC, the scope of mapping value is 0～m-1, m is the CTFC number, and in fact the TFCI scope that can use of physical layer may be much larger than 0～m-1, because present mapping method does not make full use of this information, make the TFCI coding cause the decline of decoding performance.

Summary of the invention

The object of the present invention is to provide a kind of mapping method of indicating to transformat combination from the calculated value of transformat combination, adopt the minimum distance increase after this mapping method makes the TFCI coding, thereby can when optimizing the TFCI coding, improve the decoding performance of TFCI.

For achieving the above object, mapping method of indicating to transformat combination from the calculated value of transformat combination provided by the invention comprises:

(1) from 2 ^k(0～2 ^k-1) selects m different tfc I among the individual TFCI;

Wherein: k is that encoding scheme is that (n is the code word size number of bits after encoding, 2 for n, the k) number of bits of the binary representation of the indication of the transformat combination in the linear block codes (TFCI) ^kBe available TFCI number, m is the number of transformat combination (TFC);

With ${\mathrm{TS}}_0,{\mathrm{TS}}_1,\·\·\·{\mathrm{TS}}_{C_{2^k}^m-1}$ Represent this

Plant the set of m TFCI, the rule of the subscript ordering of TFCI set TS is: the sufficient and necessary condition of subscript p＞q is to have integer l, a _l＞b _l, a _t=b _t, 0≤t≤l-1, a _tBelong to TS _p, big more with subscript t, a _tAlso big more, b _tBelong to TS _q, big more with subscript t, b _tAlso big more;

(2) calculate sign indicating number minimum range behind each TFCI collection coding, be designated as respectively: $d_0,d_1,\·\·\·d_{C_{2^k}^m-1};$

(3) maximum of searching code minimum range is designated as $d_{\max }=\underset{0\≤j\≤C_{2^k}^m-1}{\max }{d}_j;$

(4) go out the TFCI collection according to the peaked subscript index of sign indicating number minimum range, establish d _i=d _Max, i is In satisfy equation d _i=d _MaxThe integer of minimum, then Dui Ying TFCI collection is TS _i

(5) with TFCI collection TS _iIn the TFCI ascending order arrange, be designated as TFCI from small to large ₀, TFCI ₁... TFCI _M-1

(6) between CTFC and TFCI, set up---mapping relations, press ascending order correspondence, that is: CTFC one by one _jBe mapped as TFCI _j: CTFC _j TFCI _j, j=0～m-1.

The present invention is from 2 ^k(0～2 ^k-1) select m different tfc I among the individual TFCI, and from Select the set of code distance maximum in the individual TFCI set, determine the corresponding relation of CTFC according to this set to TFCI, because the sign indicating number minimum range maximum behind the TFCI collective encoding of selecting, can make decoding performance reach best, so in TFC number difference, promptly under the situation that Ying She TFCI collection varies in size, use the present invention can improve TFCI when optimizing the TFCI coding decoding performance.

Description of drawings

Fig. 1 is the embodiment flow chart of the method for the invention.

Embodiment

The present invention is described in further detail below in conjunction with drawings and Examples.

In communication system, general high level need be with the information of some information mapping to the physical layer correspondence, in practical situation, high-rise mapped information changes, sometimes many, few sometimes, and physical layer needs the map information that provides abundant, more for a long time, also can between mapped information and map information, set up mapping relations with convenient high-rise mapped information.Work as high-rise mapped information more like this, can select optimum information combination, between the two, set up mapping relations then in physical layer.

Based on the above-mentioned fact, in the mapping of TFCI, the encoding scheme of supposing TFCI is for (k is the number of bits of the binary representation of TFCI for n, k) linear block codes, and n is the code word size (number of bits) after encoding, and then available TFCI number is 2 at CTFC ^kSuppose that TFC has m, and m≤2 ^k, because in practice in most cases, the number m of TFC is far smaller than the number 2 of available TFCI ^kIf therefore be designated as CTFC successively after the CTFC value ascending order arrangement that by formula calculate (1) ₀, CTFC ₁... CTFC _M-1, then the present invention is exactly will be from 2 ^k(0～2 ^k-1) find out m TFCI among the individual available TFCI, feasible coding back best performance is arranged this m TFCI ascending order corresponding one by one with CTFC then.

Fig. 1 is the embodiment flow chart of the method for the invention.According to Fig. 1, at first in step 1, from 2 ^k(0～2 ^k-1) selects m different tfc I among the individual TFCI;

Wherein: k is that encoding scheme is that (n is the code word size number of bits after encoding, 2 for n, the k) number of bits of the binary representation of the indication of the transformat combination in the linear block codes (TFCI) ^kBe available TFCI number, m is the number of transformat combination (TFC);

With ${\mathrm{TS}}_0,{\mathrm{TS}}_1,\·\·\·{\mathrm{TS}}_{C_{2^k}^m-1}$ Represent this Plant the set of m TFCI, the rule of the subscript ordering of TFCI set TS is: the sufficient and necessary condition of subscript p＞q is to have integer l, a _l＞b _l, a _t=b _t, 0≤t≤l-1, a _tBelong to TS _p, big more with subscript t, a _tAlso big more, b _tBelong to TSq, big more with subscript t, b _tAlso big more;

Above-mentioned from 2 ^k(0～2 ^k-1) select m different tfc I among the individual TFCI, total

Kind of combination situations, k=2 for example, m=2, all TFCI be 0,1,2,3}, totally 4, therefrom select 2 different tfc I, have $C_4^2=4\×3/2=6$ Plant situation, 6 TFCI set are: and 0,1}, 0,2}, and 0,3}, 1,1}, and 1,2}, 1, and 3}, therefore the symbolic representation of obtainable 6 TFCI collection is TS ₀=0,1}, TS ₁=0,2}, TS ₂=0,3}, TS ₃=1,1}, TS ₄=1,2}, TS ₅=1,3}.

In step 2, calculate the sign indicating number minimum range after each TFCI collection is encoded, be designated as respectively $d_0,d_1,\·\·\·d_{C_{2^k}^m-1}.$

If coded system adopts single order RM (16,5) linear block codes coding, the sign indicating number minimum range that then can calculate each TFCI collection of example all is 8, i.e. d ₀=d ₁=d ₂=d ₃=d ₄=d ₅=8.In step 3, the maximum of searching code minimum range is designated as $d_{\max }=\underset{0\≤j\≤C_{2^k}^m-1}{\max }{d}_j.$

For last example, because all yards minimum range all is 8, so maximum wherein also is 8, i.e. d _Max=8.

In step 4, go out the TFCI collection according to the peaked subscript index of sign indicating number minimum range, if establish d _i=d _Max, i is In certain number, this number may not be unique, but selects wherein several i of subscript minimum, at this moment, corresponding TFCI collection is TS _i

For last example, each yard minimum range all is a maximum, and is not unique, but wherein the subscript minimum have only one, i.e. d ₀d ₀Corresponding TFCI collection is TS ₀

In step 5, with TFCI collection TS _iIn the TFCI ascending order arrange, be designated as TFCI from small to large ₀, TFCI ₁... TFCI _M-1By last example, then TFCI collection TS ₀In TFCI have only two, 0 and 1, then have after ascending order is arranged: TFCI ₀=0, TFCI ₁=1.

At last in step 6: between CTFC and TFCI, set up---mapping relations, corresponding one by one by ascending order.Be CTFC _jBe mapped as TFCI _j: CTFC _j TFCI _j, j=0～m-1.

By last example, individual CTFC of the m that calculate (1) by formula (m=2) and TFCI collection TS ₀In two TFCI between set up that mapping relations are as follows one to one:

CTFC?????????TFCI

CTFC ₀?????0

CTFC ₁?????1

In the above-mentioned steps, preceding 4 steps all are in order to obtain the result of step 5, thereby can li set up mapping relations one by one in step 6.

The present invention can take two kinds of schemes when practical application:

(A) be network layer calculates CTFC and TFCI in real time by above-mentioned steps mapping relations by wireless network control layer (RRC).

(B) prior good the two mapping relations of calculated off-line are stored in the communication equipment, and communication equipment is found corresponding mapping relations with the form of tabling look-up according to practical situation in memory.

(B) is further described again for application scheme: the number of establishing available TFCI is 2 ^k, then the number m of TFC can be 1 to 2 in the practical situation ^kIn any one value.To each m, but all off-line obtains m TFCI value by scheme (A) in step (5), is designated as TFCI from small to large ₀, TFCI ₁... TFCI _M-1, store this m TFCI value at the high level of communication equipment.All m (1≤m≤2 ^k) corresponding all storing in m the TFCI value that step (5) obtains by scheme (A).When the TFC of reality number was m, communication equipment directly read out m TFCI value, set up mapping relations one by one by the step (6) of such scheme (A) with m CTFC.

With two kinds of coded systems among the 3GPP, second order RM numeral sign indicating number (32, the 10) linear block codes of single order RM (16, the 5) linear block codes of schizotype coding and normal mode is encoded to example below, and the present invention will be further described.

At first be to encode the CTFC of corresponding TFCI coding to the mapping of TFCI with single order RM (16, the 5) linear block codes of schizotype.

The number of TFC is that 2, two CTFC ascending orders are designated as CTFC in this example ₀, CTFC ₁

For (16,5) linear block codes coding, physical layer can with TFCI value scope be 0～2 ⁵-1=31, because TFC has only 2, by formula promptly (1) only can calculate two CTFC values, it is CTFC that ascending order is arranged the back symbolically ₀, CTFC ₁Choose two different TFCI values and CTFC from 0～31 and set up one by one that the situation of mapping relations has $C_{32}^2=32\×31/(2\×1)=496$ Kind, in order to look for a kind of best TFCI collection, to use the present invention and can obtain 32 TFCI collection, these 32 TFCI collection are shown with the mathematical expression sublist: x, and x+16}, 32 * k≤x≤32 * k+15,0≤k≤1, x, k all are integers.These 32 TFCI collection coding back sign indicating number minimum range maximums are 16.According to the step 4 of the embodiment of the invention, the TFCI collection of selecting the peaked subscript index of minimum distance to go out is for { 0,16} 5,6 can obtain CTFC and to the mapping ruler of TFCI is set by step: CTFC ₀ 0, CTFC ₁ 16.If the TFCI collection that obtains according to existing method for 0,1}, a sign indicating number minimum range is 8, CTFC to the mapping ruler of TFCI is: CTFC ₀ 0, CTFC ₁ 1.Therefore, according to mapping ruler of the present invention, the relative prior art of receiving terminal TFCI decoding performance has the lifting about 3dB under Gauss's white noise channel.

Be the mapping of the CTFC of the corresponding TFCI coding of the second order RM numeral sign indicating number (32,10) of normal mode below to TFCI.

The TFC number is that 2, two CTFC ascending orders are designated as CTFC in this example ₀, CTFC ₁

For (32,10) linear block codes coding, physical layer can with TFCI value scope be 0～2 ¹⁰-1=1023, existing TFC has only 2, and by formula promptly (1) only can calculate two CTFC values, and it is CTFC that ascending order is arranged the back symbolically ₀, CTFC ₁Then from 0～1023, choose two different TFCI values and CTFC and set up one by one that the situation of mapping relations has $C_{1024}^2=1024\×1023/(2\×1)=523776$ Kind, in order to look for a kind of best mapping relations, to use the present invention and can obtain 512 TFCI collection, these 512 TFCI collection are unified to be shown with the mathematical expression sublist: x, and x+32}, 64 * k≤x≤64 * k+31,0≤k≤15, x, k all are integers.These 512 TFCI collection coding back sign indicating number minimum range maximums are 32, step 4 according to an embodiment of the invention, and selecting one is that { 0,32}TFCI gathers.5,6 can obtain CTFC and be set by step: CTFC to the mapping ruler of TFCI ₀ 0, CTFC ₁ 32.And if adopt existing mapping method, the TFCI collection that obtains for 0,1}, a sign indicating number minimum range is 16, CTFC to the mapping ruler of TFCI is: CTFC ₀ 0, CTFC ₁ 1.By mapping ruler of the present invention, the rule of hinting obliquely at of the existing relatively method of receiving terminal TFCI decoding performance has lifting about 2.75dB under Gauss's white noise channel.

Claims (1)

1, a kind of mapping method of indicating to transformat combination from the calculated value of transformat combination comprises:

(1) from 2 ^k(0～2 ^k-1) selects m different tfc I among the individual TFCI;

Wherein: k is that encoding scheme is that (n is the code word size number of bits after encoding, 2 for n, the k) number of bits of the binary representation of the indication of the transformat combination in the linear block codes (TFCI) ^kBe available TFCI number, m is the number of transformat combination (TFC);

With ${\mathrm{TS}}_0,{\mathrm{TS}}_1,\·\·\·{\mathrm{TS}}_{C_{2^k}^m-1}$ Represent this

Plant the set of m TFCI, the rule of the subscript ordering of TFCI set TS is: the sufficient and necessary condition of subscript p＞q is to have integer l, a _l＞b _l, a _t=b _t, 0≤t≤l-1, a _tBelong to TS _p, big more with subscript t, a _tAlso big more, b _tBelong to TS _q, big more with subscript t, b _tAlso big more;

(2) calculate sign indicating number minimum range behind each TFCI collection coding, be designated as respectively: $d_0,d_1,\·\·\·d_{C_{2^k}^m-1};$

(3) maximum of searching code minimum range is designated as $d_{\max }=\underset{0\≤j\≤C_{2^k}^m-1}{\max }{d}_j;$

(4) go out the TFCI collection according to the peaked subscript index of sign indicating number minimum range, establish d _i=d _Max, i is In satisfy equation d _i=d _MaxThe integer of minimum, then Dui Ying TFCI collection is TS _i

(5) with TFCI collection TS _iIn the TFCI ascending order arrange, be designated as TFCI from small to large ₀, TFCI ₁... TFCI _M-1

(6) between CTFC and TFCI, set up---mapping relations, press ascending order correspondence, that is: CTFC one by one _jBe mapped as TFCI _j: CTFC _j TFCI _j, j=0～m-1.