CN102118221B - Decoding method and device for UCI (uplink control information) - Google Patents

Abstract

The invention provides a decoding method for UCI (uplink control information), including the steps as follows: receiving UCI coding information sent by user equipment at a base station; re-ranking the code words of the received coding information and then adding the re-ranked code words with mask codes according to a mask code table; conducting fast Hadamard inverse transformation on the code words added with the mask codes; and according to the maximum related value, looking up the table to determine and output the decoding information. The invention also provides a decoding device for the UCI. According to the decoding method or the decoding device, the requirement of a storage space can be effectively reduced, the computing complexity is lowered and the decoding is accelerated.

Description

A kind of interpretation method of UCI ascending control information and device

Technical field

The present invention designs the LTE system, particularly relates to interpretation method and the device of UCI ascending control information in the LTE system.

Background technology

Mobile and broadband becomes the developing direction of modern communication technology, 3GPP (3rd GenerationPartnership Project, third generation partner program) be devoted to LTE (Long TermEvolution, Long Term Evolution) system is as the evolution of 3G system, and target is that development 3GPP wireless access technology is towards high data rate, the low delay and the evolution of optimization packet data application direction.

The main performance target of 3GPP LTE project comprises: the peak rate that descending 100Mbps, up 50Mbps can be provided in the 20MHz spectral bandwidth; Improve the performance of Cell Edge User; Improve cell capacity; Reduce system delay, the inner unidirectional transmission time delay of user plane is lower than 5ms, and lower than 50ms, the transit time from the resident state to the state of activation is less than 100ms from sleep state to the state of activation transit time for control plane; Support the residential quarter of 100Km radius to cover; Can provide for 350Km/h high-speed mobile user＞access service of 100kbps; Support paired or non-paired frequency spectrum, but and flexible configuration 1.25MHz to the 20MHz various bandwidth.

In the LTE system, UCI (Uplink Control Information, ascending control information) by PUSCH (Physical Uplink Shared Channel, Physical Uplink Shared Channel) and PUCCH (PhysicalUplink Control Channel, Physical Uplink Control Channel) carrying.In PUSCH, length is that (32, linear block coding O) is formed by the basic sequence linear combinations of 11 32, and basic sequence sees Table 3GPP TS 36.212 V8.6.0 Table 5.2.2.6.4-1 less than the UCI information of 11 bits.And in PUCCH, UCI information is that (20, A) linear block coding is obtained by the basic sequence linear combinations of 13 20, and basic sequence sees Table 3GPP TS 36.212 V8.6.0 Table 5.2.3.3-1.Complete UCI ascending control information piece cataloged procedure please refer to 3GPP TS36.212 V8.6.05.2.2.6.4 and 5.2.3.3 joint.

Existing implementation has two kinds, and the first is to ask the code word that receives and the Hamming distance between all possible information code word, finds out with the nearest information code word of the code word Hamming distance that receives and can translate information.The second is the correlation of asking the code word that receives and the possible information code word of institute, and the information code transliteration of finding out the correlation maximum goes out information.

These two kinds of interpretation method operands are all larger, and efficient is low, and decoding delay is long, takies storage resources many.So that (32, O) piece is encoded to example, and the Hamming distance of calculating between 32 bit codewords needs 63 sub-addition computings and 32 power operations, and calculating correlation needs 31 sub-addition computings and 32 product calculations.If peculiar 10 of encoding ratio has the i.e. 1024 kinds of possibility information code words of 2^10, operand need to multiply by 1024 times, and computational complexity is very large, is unfavorable for that DSP realizes.Peculiar 13 of PUCCH encoding ratio needs the code word memory space up to the 20K byte, and the code word that obtains when calculating Hamming distance or correlation also needs so large storage, needs the 40K byte so take total memory space.

Summary of the invention

For overcoming defects, the objective of the invention is to propose a kind of interpretation method of UCI ascending control information, the method splits into three section processes with the original encoding table, the method of this partition table makes required storage reduce, the search volume diminishes, adopt quick hadamard inverse transformation to ask correlation, seek the maximum from correlation, by its numbering decoding.

The embodiment of the present invention proposes a kind of interpretation method of UCI ascending control information on the one hand, and the method comprises:

The base station receives the UCI ascending control information coded message that user equipment (UE) sends;

After the described UCI coded message that described base station will be received is carried out the code word rearrangement, according to mask table, the code word after resetting is added mask;

Quick hadamard inverse transformation is carried out to the code word that adds after mask in described base station, according to maximum related value, tables look-up and determines decoding information and output.

The embodiment of the present invention also proposes a kind of code translator of UCI ascending control information on the other hand, comprising:

Information receiving module is used for receiving the UCI ascending control information coded message that user equipment (UE) sends;

Rearrangement adds the mask module, is used for that the UCI coded message is carried out code word and resets, and generates mask table and according to mask table, the code word after resetting is added mask;

Decoding module is used for the code word that adds after mask is carried out quick hadamard inverse transformation, according to maximum related value, tables look-up and determines decoding information and output.

According to the embodiment of the present invention, can effectively reduce memory space requirements, reduce computational complexity, accelerate decoding speed.H (M) hadamard inverse transformation fast needs M * log ₂M plus and minus calculation, M=32, only need 160 plus and minus calculations just can obtain 32 correlations here.If coded-bit does not surpass 6 bits, only need do once hadamard inverse transformation fast, the hunting zone is 32, so decoding speed is very fast, adopts the DSP of dominant frequency 1G Hz only to need a hundreds of cycle.The worst situation is coding 13 bits of PUCCH, need to do quick hadamard inverse transformation 128 times, memory space only needs the 8K byte, the hunting zone is 4096, but because fast hadamard transform is butterfly computation, be fit to very much DSP and realize, so only needed for 1,000 multi-clock cycles can complete decoding.Comparing former technology does not have power operation, only has plus and minus calculation, and decoding speed has improved decades of times.Memory space needed 64K originally, only needed now 8K, had reduced by 8 times.

Description of drawings

Above-mentioned and/or additional aspect of the present invention and advantage will become from the following description of the accompanying drawings of embodiments and obviously and easily understand, wherein:

Fig. 1 is the interpretation method flow chart according to the UCI coded message of the embodiment of the present invention;

Fig. 2 is the functional schematic according to embodiment of the present invention decoding;

Fig. 3 is the coding schedule 1 according to the embodiment of the present invention;

Fig. 4 is the coding schedule 2 according to the embodiment of the present invention;

Fig. 5 is the quick hadamard inverse transformation matrix P according to the embodiment of the present invention; And

Fig. 6 is the structural representation according to embodiment of the present invention code translator.

Embodiment

The below describes embodiments of the invention in detail, and the example of described embodiment is shown in the drawings, and wherein same or similar label represents same or similar element or the element with identical or similar functions from start to finish.Be exemplary below by the embodiment that is described with reference to the drawings, only be used for explaining the present invention, and can not be interpreted as limitation of the present invention.

In order better to explain the present invention, at first in the LTE system, two kinds of situations of UCI ascending control information describe.In the LTE system, the UCI ascending control information is by PUSCH channel and PUCCH channel bearing.The information bit that these two kinds of channels carry is different.

In the PUSCH channel, UCI information be (32, O) linear block coding, O＜=11 are formed by the basic sequence linear combination of 11 32 at the most, basic sequence sees Table 3GPP TS 36.212 V8.6.0Table 5.2.2.6.4-1, as shown in Figure 3.And in the PUCCH channel, UCI information be (20, A) linear block coding, A＜=13 are obtained by the basic sequence linear combination of 13 20 at the most, basic sequence sees Table 3GPP TS 36.212V8.6.0Table 5.2.3.3-1, as shown in Figure 4.

Above-mentioned two kinds of code words are the coded message that the embodiment of the present invention need to be carried out decoding.

Can find following rule by observing Fig. 3:

In Fig. 3 the 2nd rearranged by [31 30 19 18 17 29 16 15 28 27 14 13 12 1,126 20 25 10 98 24 76 23 54 22 32 21 1 32] to the row of 6 row, obtains following result, for showing conveniently, done matrix transpose operation:

10101010101010101010101010101010 Walsh(1)

11001100110011001100110011001100 Walsh(2)

11110000111100001111000011110000 Walsh(4)

11111111000000001111111100000000 Walsh(8)

11111111111111110000000000000000 Walsh(16)

Easily find out, these 5 row are Walsh sequences, and the Walsh sequence can be obtained by hadamard matrix row or column, and 32 of this sequence code lengths are so be to be produced by the hadamard matrix of H (32).Corresponding W1 after the 2nd to 6 rearrangement in coding schedule, W2, W4, W8, the Walsh code of W16 is learnt by the character of Walsh code, the code word that obtains after any two Walsh code combinations remains the Walsh code.Above-mentioned Walsh code numbering is converted to binary system corresponds to 1,10,100,1000,10000.These 5 binary numbers represent respectively 1 to 5 bit, and the combination between them is total to namely 32 kinds of 2^5, also namely can be combined into 32 Walsh codes out by these 5 Walsh codes, and the code word of 32 32 has just consisted of H (32) hadamard matrix.Be quadrature between the Walsh code, and ask the correlation of Walsh code to obtain by fast hadamard transform, this is the basis of Fast Decoding Algorithim.

From the 7th row of coding schedule Fig. 3, there is no obvious rule, they are called mask MASK sequence, are derived by the Gold code, and essence is the pseudo random sequence of knowing, and has extraordinary correlation.The selection of mask code sequence is very large for the coding efficiency impact, has 5 row in this table, and having 2^5 to be 32 kinds between them may make up.

For realizing purpose of the present invention, the embodiment of the present invention has proposed a kind of interpretation method of UCI ascending control information, as shown in Figure 1, is the interpretation method FB(flow block) according to the UCI ascending control information of the embodiment of the present invention.The method comprises:

S101: the base station receives the UCI ascending control information coded message that user equipment (UE) sends.

Wherein, UCI ascending control information coded message comprises: 32 bit word of PUSCH channel bearing and by 20 bit word of PUCCH channel bearing.

For by 20 bit word of PUCCH channel bearing the time, mend 12 0 when the UCI ascending control information coded message that receives after 20 bit word, consist of 32 bit word.

S102: the base station adds mask according to mask table to the code word after resetting after the UCI coded message of receiving is carried out the code word rearrangement.

The code word rearrangement is carried out to 32 bit word of PUSCH channel bearing and rear 32 bit word of benefit 0 of PUCCH channel bearing in the base station, resets by [31 30 19 18 17 29 16 15 28 27 14 13 12 1,126 20 25 10 98 24 76 23 54 22 32 21 1 32] and is undertaken.

When the UCI ascending control information coded message that receives was 32 bit word of PUSCH channel bearing, coding schedule as shown in Figure 3.As shown in Figure 3, coding schedule is divided into three parts, comprises complete 1 sequence, Walsh sequence and mask code sequence.Be Mi, 0 is complete 1 sequence, Mi, and 1 to Mi, and 5 is Walsh sequence, Mi, and 6 to Mi, and 10 is mask code sequence.The mode of above-mentioned this partition table can effectively reduce computational complexity.

As shown in Figure 2, be the functional schematic according to embodiment of the present invention decoding, after receiving the UCI coded message of user's transmission, carrying out code word resets, according to mask table, the code word after resetting is added mask afterwards, and carry out quick hadamard inverse transformation, according to maximum related value, table look-up and determine decoding information and output.

Number of coded bits [o0 when the UCI coded message, o1...o5] when being no more than 6 bit, mask table is the full 0 mask or thinks and do not add mask, the bit information of rear 5 [o1...o5] is by quick hadamard inverse transformation, wherein, the quick hadamard inverse transformation matrix P of use as shown in Figure 5, according to maximum related value, table look-up and determine decoding information and output, specifically see the narration of step S301.

When the number of coded bits of UCI coded message during greater than 6 bit, 6＜O＜=11, corresponding mask table is mask table K; Perhaps 6＜A＜=13, corresponding mask table is mask table J.The below provides the acquisition methods of mask table K, mask table J.

Mask table K acquisition methods comprises:

With the M in Fig. 3 _{I, 6}To M _{I, 10}Row correspond to the groups of binary bits symphysis and become mask table, wherein M _{I, 6}Corresponding highest order (MSB), M _{I, 10}Corresponding lowest order (LSB), total 2^5=32 group mask, every group of corresponding 32 bits of mask, every group of mask forms original mask table K by rows, obtains mask table K after the row of described original mask table K are reset by [31 30 19 18 17 29 16 15 28 27 14 13 12 11 26 20 25 10 98 24 76 235 4 22 32 21 1 32];

With decimal system numerical value corresponding to bit number after 6 bits of O, search relevant mask from mask table K, the code word after resetting is added described relevant mask, can eliminate the mask effect of the coding codeword that receives by adding mask, after eliminating the mask effect, carry out quick hadamard inverse transformation.

Mask table J acquisition methods comprises:

With the M in Fig. 4 _{I, 6}To M _{I, 12}Row correspond to the groups of binary bits symphysis and become mask table, wherein M _{I, 6}Corresponding highest order (MSB), M _{I, 12}Corresponding lowest order (LSB), total 2^7=128 group mask, every group of corresponding 32 bits of mask, every group of mask forms original mask table J by rows, obtains mask table J after the row of described original mask table J are reset by [31 30 19 18 17 29 16 15 28 27 14 13 12 11 26 20 25 10 98 24 7 623 54 22 32 21 1 32];

With decimal system numerical value corresponding to bit number after 6 bits of A, search relevant mask from mask table J, the code word after resetting is added described relevant mask, can eliminate the mask effect of the coding codeword that receives by adding mask, after eliminating the mask effect, carry out quick hadamard inverse transformation.

Particularly, during greater than 6, during coding, code word has added the Gold mask when number of coded bits [o0, o1...o10], the situation complexity a little.Interpretation method is first the mask effect to be eliminated, and then does Hadamard transform.As shown in Figure 2, at first take advantage of mask according to the number of coded bits situation.

Describe as an example of Fig. 3 example, number of coded bits is O, O＜=11, the mask possibility has n=2^ (O-6) to plant, and list entries is first added mask, and n kind possibility is arranged, this n kind sequence is done respectively Hadamard transform, obtain n*32 correlation, can regard the correlation matrix of n*32 as, search the maximum in matrix.The peaked position of correlation matrix can represent with the ranks number.N*32 matrix columns is 32, and those row corresponding to maximum are converted to binary representation and just obtain front 5 of information bit, with above-mentioned number of coded bits less than 6 the same.The span of line number n is 0～32, and it is converted to binary number 5 bits, just corresponding [o6 .., o10].Here o6 represents highest order, and o10 represents lowest order.It is exactly rear 5 of information bit that the row at maximum correlation place is converted to binary representation.For example coded-bit O is 7, and n is 2, and gained correlation matrix size is 2*32, and relevant mask namely is the 00000th or 10000 row in mask table K with the binary representation mask that is correspondence, namely in mask table K the 1st of 32 groups of masks the group and the 17th group.If maximum is in the first row, binary system is 0 expression, if at the second row, binary system is 1, and [o6] is translated into 0 or 1.In like manner, if coded-bit is 8, n is 4, the correlation matrix has 4 row, the mask of namely being correlated with, that corresponding mask is the 00000th, 01000,10000 and 11000 row in mask table K with binary representation, namely in mask table K the 1st of 32 groups of masks the group, the 9th group, the 17th group and the 25th group.There is dibit corresponding with every row, just can translates [o6, o7] so the row at maximum place transfers binary bits to.By that analogy, the worst situation is coding 11 bits, and n is 32, do fast hadamard transform 32 times, and operand increases, and searching maximum also can time-consuming.

To the codec class after 6 bits of code word A seemingly, when the UCI ascending control information coded message that receives when mending 32 bit word of the PUCCH channel bearing after 0, coding schedule as shown in Figure 4, corresponding mask table be described mask table J before.Owing to having mended into 32, so the decoding of decode operation and O is consistent, and as mask table J, other operation is identical, does not repeat them here except the mask table used.

S103: quick hadamard inverse transformation is carried out to the code word that adds after mask in the base station, according to maximum related value, tables look-up and determines decoding information and output.

As shown in Figure 3 and Figure 4, all can be divided into complete 1 sequence be first row to coding schedule; The Walsh sequence i.e. the second to the 6th row; With mask code sequence namely since the 7th row sequence.

S1031: the code word of at first Walsh sequence corresponding to [o1...o5] being controlled is carried out decoding.

After resetting, coded-bit [o1...o5] process corresponds to the W1 of Walsh sequence, W2, and W4, W8, the Walsh code of W16, namely

10101010101010101010101010101010 Walsh(1)

11001100110011001100110011001100 Walsh(2)

11110000111100001111000011110000 Walsh(4)

11111111000000001111111100000000 Walsh(8)

11111111111111110000000000000000 Walsh(16)

Therefore, the code word that adds after mask that above-mentioned 5 row Walsh sequences are controlled is asked relevant to the hadamard matrix of 32*32, namely the code word that adds after mask is carried out quick hadamard inverse transformation.Obtain 32 correlations, search wherein maximum correlation, the correlation sequence number corresponds to 0-31, and it is 5 that the decimal system label of correlation sequence number is converted into binary bits, corresponding Walsh code sequence number.The Walsh code of tabling look-up and finding corresponding sequence number according to Walsh code sequence number, and then obtain the codeword decoding result that in coding schedule, the Walsh sequence is controlled.This decode results can be expressed as [o5 o4 o3 o2 o1].

That is, when number of coded bits [o0, o1...o5] when being no more than 6, visible coding does not add mask, or thinks and added the full 0 mask.First first no matter [o0], complete namely control 1 sequence that position, rear 5 [o1...o5] 32 coding codewords combinations controlling are exactly a kind of of 32 long Walsh codes.The code word that receives and the hadamard matrix of 32*32 are done relevant, obtained 32 correlations, find maximum related value, the corresponding Walsh code of its label sequence number.The correlation sequence number is from 0～31, and being converted into binary bits is 5, and the decimal system label of the maximum related value that obtains is transferred to binary system, and decode results is expressed as [o5 o4 o3 o2 o1], namely obtains translating code word.This situation decoding is than faster, only need to be relevant with H (32) hadamard matrix receiving code word, and can use quick hadamard inverse transformation to realize, wherein, the quick hadamard inverse transformation matrix P of use is as shown in Figure 5.

S1032: complete after Walsh code sequential decoding, carry out decoding in the code word that mask code sequence is controlled.

When Bearer Channel was PUSCH, mask code sequence was [o6...o10], and when Bearer Channel was PUCCH, mask code sequence was [o6...o12].Below with regard to both of these case, the codeword decoding process that mask code sequence is controlled is described respectively.

When Bearer Channel is that PUSCH or Bearer Channel are when being PUCCH, described in the decode procedure such as step 1031 of the code word that the Walsh sequence of [o1...o5] is controlled.

Bearer Channel is that the mask code sequence that the mask code sequence of PUSCH is PUCCH for [o6...o10] and Bearer Channel is [o6...o12], shows that all coding codeword has added the Gold mask.Add mask by step 102 pair coding codeword, reached the effect of eliminating the Gold mask.Wherein, o6 represents highest order, and the mask code sequence o10 of PUSCH and the mask code sequence o12 of PUCCH represent lowest order.The coding codeword that this mask code sequence is controlled carries out quick hadamard inverse transformation, obtains maximum related value.The row at this maximum related value place is converted to rear 7 of information bit that binary message namely represents rear 5 or the PUCCH carrying of PUSCH beared information bit.

According to the embodiment of above-mentioned steps S201, for example when mask code sequence was [o6], number of coded bits O was 7, and this moment, the mask possibility was n=2^ (O-6)=2, and namely the mask possibility is 2 kinds.Gained correlation matrix size is 2*32, is expressed as 0 if maximum related value in the first row, is converted to binary message; If maximum related value at the second row, is converted to binary message and is expressed as 1.Therefore the code word correspondence of mask code sequence [o6] control is translated into 0 or 1.

For example when mask code sequence was [o6, o7], number of coded bits O was 8, and this moment, the mask possibility was n=2^ (O-6)=4, and namely the mask possibility is 4 kinds.Gained correlation battle array size absolutely is 4*32, and the correlation matrix has 4 row, has dibit corresponding with every row.So the row at maximum place transfers binary message to, just can translate [o6, o7].If maximum related value in the first row, is converted to binary message and is expressed as 00; If maximum related value at the second row, is converted to binary message and is expressed as 01, if at the third line, being converted to binary message, maximum related value is expressed as 10; If maximum related value in fourth line, is converted to binary message and is expressed as 11.

Determining of the corresponding relevant particular location of mask in mask table K or mask table J seen step S201.

By that analogy, the number of coded bits O maximum of PUSCH is 11, and this moment, n was 32, do quick hadamard inverse transformation 32 times; The number of coded bits O maximum of PUCCH is 13, and this moment, n was 128, do quick hadamard inverse transformation 128 times.At this moment, operand increases, and searching maximum needs the time maximum.

After the decoding of completing Walsh code sequence and mask code sequence, at last bit [o0] corresponding to complete 1 sequence carried out decoding.

S1033: complete 1 sequence is controlled the decoding of code word.

The bit [o0] that complete 1 sequence is corresponding, if this position is 1, coding codeword is anti-phase.That is, 0 becomes 1,1 and becomes 0; If this position is 0, coding codeword does not change.{ the upper definition of 0,1} mould 2 adds computing, and { the i.e. multiplying in bipolarity space adds computing corresponding to the mould 2 of unipolarity space corresponding element for the upper definition of 1,1} multiplying, these two spaces isomorphic space each other for the bipolarity space in the unipolarity space.The code word that receives is soft bit, and on the bipolarity space, and coding is in the unipolarity space.The polarity that needs only according to maximum related value during decoding just can judge whether complete 1 sequence.Concrete polarity positive and negative is translated into 0 or 1 and will shines upon rule according to unipolarity and bipolarity.

But, can the have the greatest impact polarity of correlation of Walsh code control bit number.Specifically in addition, when several are combined as hadamard matrix when the Walsh sequence pairs, the Walsh code reversing that obtains.For example, 1 yard of Walsh is 10101010 ... Walsh2 is 11001100 ..., both moulds 2 add that to obtain the Walsh3 theory be 10011001 ..., but actual result is 01100110 ... if, as seen in the bipolarity space polarity become anti-.

Consider all factors, be mapped as 1,10 and be mapped as in-1 situation, obtain the o0 interpretation method and be: be 0 if control the Walsh sequence bits of the 2nd to 6 row, or odd number 1 is arranged in bit, maximum correlation polarity is when negative, and o0 is translated into 0, otherwise is translated into 1; If control the Walsh sequence bits of the 2nd to 6 row, even number 1 is arranged, maximum correlation polarity is timing, and o0 is translated into 0, otherwise is translated into 1.

Correspondingly, according to interpretation method of the present invention, as shown in Figure 6, embodiments of the invention have also proposed a kind of code translator 100 of UCI coded message, comprising: information receiving module 110, rearrangement adds mask module 120 and decoding module 130.

Wherein, information receiving module 110 is used for receiving the UCI ascending control information coded message that user equipment (UE) sends.

The UCI coded message that information receiving module 110 receives comprises by 32 bit word of PUSCH channel bearing or by 20 bit word of PUCCH channel bearing, wherein, the number of coded bits of 32 bit word of PUSCH channel bearing is O, O＜=11, the number of coded bits of 20 bit word of PUSCH channel bearing is A, A＜=13; For by 20 bit word of PUCCH channel bearing the time, mend 12 0 when the UCI ascending control information coded message that receives after 20 bit word, consist of 32 bit word.

Rearrangement adds mask module 120 and is used for the UCI coded message is carried out the code word rearrangement, generates mask table and also according to mask table, the code word after resetting is added mask.

Rearrangement adds 120 pairs of coded messages of mask module and carries out the code word rearrangement by [31 30 19 18 17 29 16 15 28 27 14 1,312 11 26 20 25 10 98 24 76 23 54 22 32 21 1 32].

Particularly, when the number of coded bits of UCI coded message during greater than 6 bit, 6＜O＜=11, corresponding mask table is mask table K; 6＜A＜=13, corresponding mask table is mask table J.

Particularly, resetting the mask table K that adds 120 generations of mask module comprises:

With the M in Fig. 3 _{I, 6}To M _{I, 10}Row correspond to the groups of binary bits symphysis and become mask table, wherein M _{I, 6}Corresponding highest order, M _{I, 10}Corresponding lowest order, total 2^5=32 group mask, every group of corresponding 32 bits of mask, every group of mask forms original mask table K by rows, obtains mask table K after the row of original mask table K are reset by [31 30 1,918 17 29 16 15 28 27 14 13 12 11 26 20 25 10 98 24 76 23 54 22 3 22 11 32];

Rearrangement adds mask module 120 with decimal system numerical value corresponding to bit number after 6 bits of O, searches relevant mask from mask table K, and the code word after resetting is added relevant mask.

Particularly, resetting the mask table J that adds 120 generations of mask module comprises:

With the M in Fig. 4 _{I, 6}To M _{I, 12}Row correspond to the groups of binary bits symphysis and become mask table, wherein M _{I, 6}Corresponding highest order, M _{I, 12}Corresponding lowest order, total 2^7=128 group mask, every group of corresponding 32 bits of mask, every group of mask forms original mask table J by rows, obtains mask table J after the row of original mask table J are reset by [31 30 1,918 17 29 16 15 28 27 14 13 12 11 26 20 25 10 98 24 76 23 54 22 32 21 1 32];

Rearrangement adds mask module 120 with decimal system numerical value corresponding to bit number after 6 bits of A, searches relevant mask from mask table J, and the code word after resetting is added relevant mask.

Decoding module 130 is used for the code word that adds after mask is carried out quick hadamard inverse transformation, according to maximum related value, tables look-up and determines decoding information and output.

Particularly, when the number of coded bits [o0, o1...o5] of UCI coded message when being no more than 6 bit, mask table is the full 0 mask, after 130 pairs of decoding modules, the bit information of 5 [o1...o5] by quick hadamard inverse transformation, according to maximum related value, is tabled look-up and is determined decoding information and output.

Particularly, the code word that 130 pairs of decoding modules add after mask is carried out quick hadamard inverse transformation, according to maximum related value, and the bit information after 6 bits of determining O of tabling look-up and output.

Particularly, the code word that 130 pairs of decoding modules add after mask is carried out quick hadamard inverse transformation, according to maximum related value, and the bit information after 6 bits of determining A of tabling look-up and output.

Particularly, the M of Fig. 3 _{I, 1}To M _{I, 5}The row of row rearranges by [31 30 19 18 17 29 16 15 28 27 1,413 12 11 26 20 25 10 98 24 76 23 54 22 32 21 1 32], obtains 5 Walsh sequences:

10101010101010101010101010101010 Walsh(1)，

11001100110011001100110011001100 Walsh(2)，

11110000111100001111000011110000 Walsh(4)，

11111111000000001111111100000000 Walsh(8)，

11111111111111110000000000000000 Walsh(16)；

The decoding of first coded-bit of 130 pairs of UCI coded messages of decoding module comprises:

Regulation 0 is mapped as 1,1 and is mapped as-1, in the unipolarity space { 0, the upper definition of 1} mould 2 adds computing, bipolarity space { the upper definition of 1,1} multiplying, these two spaces isomorphic space each other, i.e. the multiplying in bipolarity space adds computing corresponding to the mould 2 of unipolarity space corresponding element;

When bits of each row of Walsh sequence is 0, or when in bit, odd number 1 being arranged, the maximum related value of Walsh sequence is when negative, and first coded-bit is decoded as 0; The maximum related value of Walsh sequence is timing, and first coded-bit is decoded as 1;

In the bit of each row of Walsh sequence, even number 1 is arranged, when the maximum related value polarity of Walsh sequence was negative, first coded-bit was decoded as 0; The maximum related value polarity of Walsh sequence is timing, and first coded-bit is decoded as 1.

The technical scheme that proposes according to the present invention can effectively reduce memory space requirements, reduces computational complexity, accelerates decoding speed.H (M) hadamard inverse transformation fast needs M * log ₂M plus and minus calculation, M=32, only need 160 plus and minus calculations just can obtain 32 correlations here.If coded-bit does not surpass 6 bits, only need do once hadamard inverse transformation fast, the hunting zone is 32, so decoding speed is very fast, adopts the DSP of dominant frequency 1G Hz only to need a hundreds of cycle.The worst situation is coding 13 bits of PUCCH, need to do quick hadamard inverse transformation 128 times, memory space only needs the 8K byte, the hunting zone is 4096, but because fast hadamard transform is butterfly computation, be fit to very much DSP and realize, so only needed for 1,000 multi-clock cycles can complete decoding.Comparing former technology does not have power operation, only has plus and minus calculation, and decoding speed has improved decades of times.Memory space needed 64K originally, only needed now 8K, had reduced by 8 times.

Obviously; adopt Fig. 3; the coded system of stipulating in agreement 3GPP TS36.212 V8.6.05.2.2.6.4 and 5.2.3.3 in Fig. 4 is carried out decoding; the coding of the UCI control information of the PUSCH that defines in LTE agreement 3GPP TS36.212 V8.6.05.2.2.6.4 and 5.2.3.3 and PUCCH carrying, its interpretation method still belongs to protection scope of the present invention.The LTE-A system and after in the evolution system of LTE, when using coding schedule Fig. 3, the coded system of stipulating in Fig. 4 and similar agreement 3GPP TS36.212 V8.6.05.2.2.6.4 and 5.2.3.3 still belongs to the protection range of the interpretation method that the present invention proposes.

One of ordinary skill in the art will appreciate that and realize that all or part of step that above-described embodiment method is carried is to come the relevant hardware of instruction to complete by program, described program can be stored in a kind of computer-readable recording medium, this program comprises step of embodiment of the method one or a combination set of when carrying out.

In addition, each functional unit in each embodiment of the present invention can be integrated in a processing module, can be also that the independent physics of unit exists, and also can be integrated in a module two or more unit.Above-mentioned integrated module both can adopt the form of hardware to realize, also can adopt the form of software function module to realize.If described integrated module realizes with the form of software function module and during as independently production marketing or use, also can be stored in a computer read/write memory medium.

The above-mentioned storage medium of mentioning can be read-only memory, disk or CD etc.

The above is only the preferred embodiment of the present invention; should be pointed out that for those skilled in the art, under the prerequisite that does not break away from the principle of the invention; can also make some improvements and modifications, these improvements and modifications also should be considered as protection scope of the present invention.

Claims (12)

1. the interpretation method of a UCI ascending control information, is characterized in that, comprises the following steps:

The base station receives the UCI coded message that user equipment (UE) sends;

After the described UCI coded message that described base station will be received is carried out the code word rearrangement, according to mask table, the code word after resetting is added mask;

Quick hadamard inverse transformation is carried out to the code word that adds after mask in described base station, according to maximum related value, tables look-up and determines decoding information and output;

Wherein, described UCI coded message comprises by 32 bit word of PUSCH channel bearing or by 20 bit word of PUCCH channel bearing, wherein, the number of coded bits of 32 bit word of PUSCH channel bearing is O, O＜=11, the number of coded bits of 20 bit word of PUSCH channel bearing is A, A＜=13;

For by 20 bit word of PUCCH channel bearing the time, mend 12 0 when the UCI ascending control information coded message that receives after described 20 bit word, consist of 32 bit word;

Wherein, the coded message that receives being carried out code word according to [31 30 19 18 17 29 16 15 28 27 14 13 12 11 26 20 25 10 98 24 76 23 54 22 32 21 1 32] resets.

2. interpretation method as claimed in claim 1, it is characterized in that, number of coded bits [o0 when described UCI coded message, o1 ... o5] when being no more than 6 bit, described mask table is the full 0 mask, rear 5 [o1 ... o5] bit information by quick hadamard inverse transformation, according to maximum related value, table look-up and determine decoding information and output.

3. interpretation method as claimed in claim 1, is characterized in that, when the number of coded bits of described UCI coded message during greater than 6 bit, and 6＜O＜=11, corresponding mask table is mask table K; 6＜A＜=13, corresponding mask table is mask table J.

4. interpretation method as claimed in claim 3, is characterized in that, described mask table K comprises:

M in following table _i,6To M _{I, 10}Row correspond to the groups of binary bits symphysis and become mask table, wherein M _i,6Corresponding highest order, M _{I, 10}Corresponding lowest order, total 2^5=32 group mask, every group of corresponding 32 bits of mask, every group of mask forms original mask table K by rows, after being reset by [31 30 19 18 17 29 16 15 28 27 14 13 12 11 26 20 25 10 98 24 76 23 54 22 32 21 1 32], the row of described original mask table K obtain mask table K

M _i,0 M _i,1 M _i,2 M _i,3 M _i,4 M _i,5 M _i,6 M _i,7 M _i,8 M _i,9 M _i，10 1 1 0 0 0 0 0 0 0 0 1 1 1 1 0 0 0 0 0 0 1 1 1 0 0 1 0 0 1 0 1 1 1 1 0 1 1 0 0 0 0 1 0 1 1 1 1 1 0 0 0 1 0 0 1 1 1 0 0 1 0 1 1 1 0 1 1 0 1 0 1 0 1 0 1 1 1 1 0 0 1 1 0 0 1 1 0 1 1 1 0 1 1 0 0 1 0 1 1 1 0 1 1 1 0 1 0 0 1 1 1 0 1 0 0 1 1 1 0 1 1 1 1 1 0 0 1 1 0 1 0 1 1 0 0 1 0 1 0 1 1 1 1 1 1 0 1 0 1 0 1 0 1 1 1 0 0 0 1 1 0 1 0 0 1 1 1 0 0 1 1 1 1 0 1 1 1 1 1 0 1 1 1 0 0 1 0 1 0 0 1 1 1 0 0 1 0 0 1 1 0 1 1 1 1 1 0 0 0 1 0 0 0 0 1 1 0 0 0 0 1 0 1 0 0 0 1 0 0 0 1 1 1 0 1 0 0 0 0 0 1 1 1 0 0 0 1 0 0 1 1 0 1 1 1 1 0 1 0 0 0 1 1 1 1 1 1 1 1 0 1 1 1 1 0 1 1 0 0 0 1 1 1 0 0 1 1 0 1 1 0 1 0 0 1 1 0 1 1 1 1 0 1 0 1 1 1 0 1 0 1 0 1 1 1 0 1 0 0 1 0 1 1 1 1 1 1 1 0 0 1 1 1 1 1 1 1 1 1 1 1 1 0 0 0 0 0 0 0 0 0 0

；

With decimal system numerical value corresponding to bit number after 6 bits of O, search relevant mask from mask table K, the code word after resetting is added described relevant mask, the code word that adds after mask is carried out quick hadamard inverse transformation;

According to maximum related value, the bit information after 6 bits of determining O of tabling look-up and output.

5. interpretation method as claimed in claim 3, is characterized in that, described mask table J comprises:

M in following table _i,6To M _{I, 12}Row correspond to the groups of binary bits symphysis and become mask table, wherein M _i,6Corresponding highest order, M _{I, 12}Corresponding lowest order, total 2^7=128 group mask, every group of corresponding 32 bits of mask, every group of mask forms original mask table J by rows, after being reset by [31 30 19 18 17 29 16 15 28 27 14 13 12 11 26 20 25 10 98 24 76 23 54 22 32 21 1 32], the row of described original mask table J obtain mask table J

M _i,0 M _i,1 M _i,2 M _i,3 M _i,4 M _i,5 M _i,6 M _i,7 M _i,8 M _i,9 M _i,10 M _i,11 M _i,12 1 1 0 0 0 0 0 0 0 0 1 1 0 1 1 1 0 0 0 0 0 0 1 1 1 0 1 0 0 1 0 0 1 0 1 1 1 1 1 1 0 1 1 0 0 0 0 1 0 1 1 1 1 1 1 1 0 0 0 1 0 0 1 1 1 1 1 0 0 1 0 1 1 1 0 1 1 1 1 0 1 0 1 0 1 0 1 1 1 1 1 1 0 0 1 1 0 0 1 1 0 1 1 1 1 1 0 1 1 0 0 1 0 1 1 1 1 1 0 1 1 1 0 1 0 0 1 1 1 1 1 0 1 0 0 1 1 1 0 1 1 1 1 1 1 1 0 0 1 1 0 1 0 1 1 1 1 0 0 1 0 1 0 1 1 1 1 1 1 1 1 0 1 0 1 0 1 0 1 1 1 1 1 0 0 0 1 1 0 1 0 0 1 0 1 1 1 0 0 1 1 1 1 0 1 1 0 1 1 1 1 0 1 1 1 0 0 1 0 1 1 1 0 0 1 1 1 0 0 1 0 0 1 1 1 1 0 1 1 1 1 1 0 0 0 0 0 1 0 0 0 0 1 1 0 0 0 0 0 0

；

With decimal system numerical value corresponding to bit number after 6 bits of A, search relevant mask from mask table J, the code word after resetting is added described relevant mask, the code word that adds after mask is carried out quick hadamard inverse transformation;

According to maximum related value, the bit information after 6 bits of determining A of tabling look-up and output.

6. interpretation method as described in one of claim 4 or 5, is characterized in that, the M in table _i,1To M _i,5The row of row rearranges by [31 30 19 18 17 29 16 15 28 27 14 13 12 11 26 20 25 10 98 24 76 23 54 22 32 21 1 32], obtains 5 Walsh sequences:

10101010101010101010101010101010Walsh(1)，

11001100110011001100110011001100Walsh(2)，

11110000111100001111000011110000Walsh(4)，

11111111000000001111111100000000Walsh(8)，

11111111111111110000000000000000Walsh(16)；

The interpretation method of first coded-bit of described UCI coded message comprises:

Regulation 0 is mapped as 1,1 and is mapped as-1, in the unipolarity space { 0, the upper definition of 1} mould 2 adds computing, bipolarity space { the upper definition of 1,1} multiplying, these two spaces isomorphic space each other, i.e. the multiplying in bipolarity space adds computing corresponding to the mould 2 of unipolarity space corresponding element;

When bits of each row of Walsh sequence is 0, or when in bit, odd number 1 being arranged, the maximum related value of Walsh sequence is when negative, and first coded-bit is decoded as 0; The maximum related value of Walsh sequence is timing, and first coded-bit is decoded as 1;

In the bit of each row of Walsh sequence, even number 1 is arranged, when the maximum related value polarity of Walsh sequence was negative, first coded-bit was decoded as 0; The maximum related value polarity of Walsh sequence is timing, and first coded-bit is decoded as 1.

7. the code translator of a UCI ascending control information, is characterized in that, comprising:

Information receiving module is used for receiving the UCI ascending control information coded message that user equipment (UE) sends;

Rearrangement adds the mask module, is used for that the UCI coded message is carried out code word and resets, and generates mask table and according to mask table, the code word after resetting is added mask;

Decoding module is used for the code word that adds after mask is carried out quick hadamard inverse transformation, according to maximum related value, tables look-up and determines decoding information and output;

Wherein, the described UCI coded message that described information receiving module receives comprises by 32 bit word of PUSCH channel bearing or by 20 bit word of PUCCH channel bearing, wherein, the number of coded bits of 32 bit word of PUSCH channel bearing is O, O＜=11, the number of coded bits of 20 bit word of PUSCH channel bearing is A, A＜=13;

For by 20 bit word of PUCCH channel bearing the time, mend 12 0 when the UCI ascending control information coded message that receives after described 20 bit word, consist of 32 bit word;

Wherein, described rearrangement adds the mask module and coded message is carried out code word by [31 30 19 18 17 29 16 15 28 27 14 13 12 11 26 20 25 10 98 24 76 23 54 22 32 21 1 32] resets.

8. code translator as claimed in claim 7, it is characterized in that, number of coded bits [o0 when described UCI coded message, o1 ... o5] when being no more than 6 bit, described mask table is the full 0 mask, described decoding module is to rear 5 [o1 ... o5] bit information by quick hadamard inverse transformation, according to maximum related value, table look-up and determine decoding information and output.

9. code translator as claimed in claim 8, is characterized in that, when the number of coded bits of described UCI coded message during greater than 6 bit, and 6＜O＜=11, corresponding mask table is mask table K; 6＜A＜=13, corresponding mask table is mask table J.

10. code translator as claimed in claim 9, is characterized in that, the described mask table K that described rearrangement adds the generation of mask module comprises:

M in following table _i,6To M _{I, 10}Row correspond to the groups of binary bits symphysis and become mask table, wherein M _i,6Corresponding highest order, M _{I, 10}Corresponding lowest order, total 2^5=32 group mask, every group of corresponding 32 bits of mask, every group of mask forms original mask table K by rows, after being reset by [31 30 19 18 17 29 16 15 28 27 14 13 12 11 26 20 25 10 98 24 76 23 54 22 32 21 1 32], the row of described original mask table K obtain mask table K

M _i,0 M _i1 M _i,2 M _i,3 M _i,4 M _i,5 M _i,6 M _i,7 M _i,8 M _i,9 M _i，10 1 1 0 0 0 0 0 0 0 0 1 1 1 1 0 0 0 0 0 0 1 1 1 0 0 1 0 0 1 0 1 1 1 1 0 1 1 0 0 0 0 1 0 1 1 1 1 1 0 0 0 1 0 0 1 1 1 0 0 1 0 1 1 1 0 1 1 0 1 0 1 0 1 0 1 1 1 1 0 0 1 1 0 0 1 1 0 1 1 1 0 1 1 0 0 1 0 1 1 1 0 1 1 1 0 1 0 0 1 1 1 0 1 0 0 1 1 1 0 1 1 1 1 1 0 0 1 1 0 1 0 1 1 0 0 1 0 1 0 1 1 1 1 1 1 0 1 0 1 0 1 0 1 1 1 0 0 0 1 1 0 1 0 0 1 1 1 0 0 1 1 1 1 0 1 1 1 1 1 0 1 1 1 0 0 1 0 1 0 0 1 1 1 0 0 1 0 0 1 1 0 1 1 1 1 1 0 0 0 1 0 0 0 0 1 1 0 0 0 0 1 0 1 0 0 0 1 0 0 0 1 1 1 0 1 0 0 0 0 0 1 1 1 0 0 0 1 0 0 1 1 0 1 1 1 1 0 1 0 0 0 1 1 1 1 1 1 1 1 0 1 1 1 1 0 1 1 0 0 0 1 1 1 0 0 1 1 0 1 1 0 1 0 0 1 1 0 1 1 1 1 0 1 0 1 1 1 0 1 0 1 0 1 1 1 0 1 0 0 1 0 1 1 1 1 1 1 1 0 0 1 1 1 1 1 1 1 1 1 1 1 1 0 0 0 0 0 0 0 0 0 0

；

Described rearrangement adds the mask module with decimal system numerical value corresponding to bit number after 6 bits of O, searches relevant mask from mask table K, and the code word after resetting is added described relevant mask;

Described decoding module carries out quick hadamard inverse transformation to the code word that adds after mask, according to maximum related value, and the bit information after 6 bits of determining O of tabling look-up and output.

11. code translator as claimed in claim 9 is characterized in that, the described mask table J that described rearrangement adds the generation of mask module comprises:

M in following table _i,6To M _{I, 12}Row correspond to the groups of binary bits symphysis and become mask table, wherein M _i,6Corresponding highest order, M _{I, 12}Corresponding lowest order, total 2^7=128 group mask, every group of corresponding 32 bits of mask, every group of mask forms original mask table J by rows, after being reset by [31 30 19 18 17 29 16 15 28 27 14 13 12 11 26 20 25 10 98 24 76 23 54 22 32 21 1 32], the row of described original mask table J obtain mask table J

M _i,0 M _i,1 M _i,2 M _i,3 M _i,4 M _i,5 M _i,6 M _i,7 M _i,8 M _i,9 M _i,10 M _i,11 M _i,12 1 1 0 0 0 0 0 0 0 0 1 1 0 1 1 1 0 0 0 0 0 0 1 1 1 0 1 0 0 1 0 0 1 0 1 1 1 1 1 1 0 1 1 0 0 0 0 1 0 1 1 1 1 1 1 1 0 0 0 1 0 0 1 1 1 1 1 0 0 1 0 1 1 1 0 1 1 1 1 0 1 0 1 0 1 0 1 1 1 1 1 1 0 0 1 1 0 0 1 1 0 1 1 1 1 1 0 1 1 0 0 1 0 1 1 1 1 1 0 1 1 1 0 1 0 0 1 1 1 1 1 0 1 0 0 1 1 1 0 1 1 1 1 1 1 1 0 0 1 1 0 1 0 1 1 1 1 0 0 1 0 1 0 1 1 1 1 1 1 1 1 0 1 0 1 0 1 0 1 1 1 1 1 0 0 0 1 1 0 1 0 0 1 0 1 1 1 0 0 1 1 1 1 0 1 1 0 1 1 1 1 0 1 1 1 0 0 1 0 1 1 1 0 0 1 1 1 0 0 1 0 0 1 1 1 1 0 1 1 1 1 1 0 0 0 0 0 1 0 0 0 0 1 1 0 0 0 0 0 0

；

Described rearrangement adds the mask module with decimal system numerical value corresponding to bit number after 6 bits of A, searches relevant mask from mask table J, and the code word after resetting is added described relevant mask;

Described decoding module carries out quick hadamard inverse transformation to the code word that adds after mask, according to maximum related value, and the bit information after 6 bits of determining A of tabling look-up and output.

12. code translator as described in one of claim 10 or 11 is characterized in that, the M in table _i,1To M _i,5The row of row rearranges by [31 30 19 18 17 29 16 15 28 27 14 13 12 11 26 20 25 10 98 24 76 23 54 22 32 21 1 32], obtains 5 Walsh sequences:

10101010101010101010101010101010Walsh(1)，

11001100110011001100110011001100Walsh(2)，

11110000111100001111000011110000Walsh(4)，

11111111000000001111111100000000Walsh(8)，

11111111111111110000000000000000Walsh(16)；

Described decoding module comprises the decoding of first coded-bit of described UCI coded message:

Regulation 0 is mapped as 1,1 and is mapped as-1, in the unipolarity space { 0, the upper definition of 1} mould 2 adds computing, bipolarity space { the upper definition of 1,1} multiplying, these two spaces isomorphic space each other, i.e. the multiplying in bipolarity space adds computing corresponding to the mould 2 of unipolarity space corresponding element;

When bits of each row of Walsh sequence is 0, or when in bit, odd number 1 being arranged, the maximum related value of Walsh sequence is when negative, and first coded-bit is decoded as 0; The maximum related value of Walsh sequence is timing, and first coded-bit is decoded as 1;

In the bit of each row of Walsh sequence, even number 1 is arranged, when the maximum related value polarity of Walsh sequence was negative, first coded-bit was decoded as 0; The maximum related value polarity of Walsh sequence is timing, and first coded-bit is decoded as 1.

Images