CN102299770B - United coding method and system for long term evolution (LTE) uplink control information (UCI) - Google Patents

United coding method and system for long term evolution (LTE) uplink control information (UCI) Download PDF

Info

Publication number
CN102299770B
CN102299770B CN 201110263664 CN201110263664A CN102299770B CN 102299770 B CN102299770 B CN 102299770B CN 201110263664 CN201110263664 CN 201110263664 CN 201110263664 A CN201110263664 A CN 201110263664A CN 102299770 B CN102299770 B CN 102299770B
Authority
CN
China
Prior art keywords
tbcc
lte
code
encoded
maker
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Expired - Fee Related
Application number
CN 201110263664
Other languages
Chinese (zh)
Other versions
CN102299770A (en
Inventor
杨维
阳振华
张倩
樊婷婷
许昌龙
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Jiaotong University
Original Assignee
Beijing Jiaotong University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Beijing Jiaotong University filed Critical Beijing Jiaotong University
Priority to CN 201110263664 priority Critical patent/CN102299770B/en
Publication of CN102299770A publication Critical patent/CN102299770A/en
Application granted granted Critical
Publication of CN102299770B publication Critical patent/CN102299770B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Abstract

The invention discloses a united coding method and a united coding system for long term evolution (LTE) uplink control information (UCI), and belongs to the technical field of LTE channel coding. In the method, the channel coding of the UCI under different lengths is finished through the two-stage punching of a basic tail-biting convolutional code (TBCC) with the code rate of 1/5; and generators are selected at the first stage, and redundant code word bits are deleted at the second stage, namely when an LTE block code is replaced, the required generators at the first stage can be selected according to the size of the UCI and the determined punching pattern, and a code word with the code length of 20 or 32 is obtained according to the number and positions of the bits deleted at the second stage, and when the LTE TBCC is replaced, three original LTE generators are selected at the first stage, and the code word is not deleted at the second stage. The UCI on a physical uplink control channel (PUCCH) and a physical uplink shared channel (PUSCH) is coded/decoded by the united method, so that a user side and a base station side are prevented from selecting various coding and decoding methods, and the coding/decoding structure of the system is simplified.

Description

The Unified coding method and system of LTE ascending control information
Technical field
The present invention relates to a kind of Unified coding method and system of LTE ascending control information, belong to Long Term Evolution (Long Term Evolution, LTE) channel coding technology field.
Background technology
LTE is universal mobile telecommunications system (Universal Mobile Telecommunications System, UMTS) Long Term Evolution project, current super 3G (Beyond 3G with strongest influence power, B3G) system, can provide higher data rate, lower delay and larger power system capacity and coverage.
The up link of LTE has adopted the basic transmission technology of single-carrier frequency division multiple access (Single-Carrier Frequency Division Multiple Access, SC-FDMA) as physical layer.SC-FDMA is divided into a plurality of parallel orthogonal sub-carriers by transmission bandwidth, uses Cyclic Prefix (Cyclic Prefix, CP) to keep the orthogonality of subcarrier in frequency-selective channel.According to the difference of duration, CP can be divided into conventional CP and expand two types of CP.Based on the SC-FDMA transmission technology, LTE defines uplink transmission resource from time domain and two dimensions of frequency domain: time domain, maximum unit is the radio frames of 10 milliseconds (ms), each radio frames is divided into the subframe of 10 1ms, each subframe is divided into again 2 time slots (slot), each time slot comprises 7 SC-FDMA symbols under conventional CP, under expansion CP, only comprises 6 SC-FDMA symbols; 12 subcarriers take from frequency domain as a unit.The time-frequency structure of LTE up link can be used Resource Block (Resource Block, RB) describe, a RB refers to 12 subcarriers in 1 time slot, RB can continue to be divided into resource particle (Resource Element, RE), 1 RE is a subcarrier in a SC-FDMA symbol time.The basic running time-frequency resource structure of LTE up link as shown in Figure 1.
The ascending control information of LTE (Uplink Control Information, UCI) comprise that the HARQ to downlink data packet replys (ACK/NACK), channel quality indication (Channel Quality Indicator, CQI) and dispatch request (Scheduling Request, SR), comprise in addition order indication (the Rank Indicator for downlink transmission, RI), the pre-coding matrix indication feedback informations relevant to MIMO such as (Precoding Matrix Indicator, PMI).
The mainly upper transmission of capable physically control channel (Physical Uplink Control Channel, PUCCH) of UCI.LTE has adopted the mode of frequency diversity to transmit PUCCH: the 1st time slot transmits in a RB at system bandwidth edge, and the 2nd time slot transmits in another RB of system bandwidth opposite edge, and two RB are called a PUCCH territory together, as shown in Figure 2.According to the kind of the control information of transmitting, PUCCH is divided into 7 kinds of forms: 1 of form transmits SR; Form 1a transmits 1 bit ACK/NACK; Form 1b transmits 2 bit ACK/NACK; 2 of forms transmit CQI (20 coded-bits); Form 2a transmits CQI and 1 bit ACK/NACK (20+1 coded-bit); Form 2b transmits CQI and 2 bit ACK/NACK (20+2 coded-bit).
UCI also can go the upper transmission of shared channel (Physical Uplink Shared Channel, PUSCH) sometimes physically.Because a subscriber equipment (User Equipment, UE) can not transmit PUCCH and PUSCH in same subframe simultaneously.Therefore, when transmitting PUSCH, can not recycle the PUCCH control information transmission when a subframe.Now, the control information such as CQI, ACK/NACK must with data-reusing after on PUSCH, transmit.
Ascending control information (UCI) comprises that CQI, HARQ reply, SR and RI etc.HARQ replys from high level and obtains, and comprises 1 or 2 bits, and each affirmative acknowledgement (ACK) is encoded into bit " 1 ", and each negative response is encoded into bit " 0 "; SR and RI etc. also are encoded into 1 or 2 bits; CQI needs to be encoded into 20 or 32 code word bits.
The CQI of UCI has three kinds of forms, is respectively used to the subband report of broadband report, high-rise configuration and the subband report that UE selects.UE reports to base station after need first detecting the CQI in Physical Downlink Shared Channel (Physical Downlink Shared Channel, PDSCH) again, therefore the form difference of CQI under different PDSCH transmission modes.Each CQI form all comprises a plurality of territories, the bit width addition in each territory is obtained to the number of CQI bit.
When transmitting on PUCCH, UCI adopts one (20, A) block code is encoded, in PUSCH, when transmission adopts respectively according to the number of CQI bit that (32, O) block code and tail-biting convolutional code (Tail-Biting Convolutional Code, TBCC) carry out chnnel coding.Can find out, according to the channel of UCI transmission and the bit number of transmission, subscriber equipment need to be selected between three coding methods, and also corresponding different decoding scheme of different encoding schemes, so base station receiver also needs to select corresponding decoding scheme to carry out decoding, the complexity of system is higher.
Summary of the invention
In order to solve the problems of the technologies described above, the present invention proposes a kind of Unified coding method and system of LTE ascending control information, the method replaces (20 with unified coding method, A) block code, (32, O) block code and TBCC code, the two-stage of the basic TBCC that is 1/5 by a code check bores a hole to replace tri-kinds of chnnel codings of former LTE, avoided the selection of user side between the Multi-encoding method, therefore the base station end only needs the TBCC decoding scheme, do not need to select, simplified the encoder/decoder structure of system, and its performance approaches or is better than the LTE block code, reduced decoding complexity, improved the performance of system.
The present invention has taked following technical scheme:
A kind of Unified coding method of LTE ascending control information, the two-stage of the TBCC that the method is 1/5 by a code check has been bored a hole the chnnel coding of ascending control information under different length, specifically comprise the steps: first order perforation step, use the TBCC maker to be encoded to ascending control information; The number of described use maker is determined as follows: when the TBCC code is encoded, and three makers that the maker of use is the LTE convolution code; When block code is encoded, when to (20, when A) block code is encoded, the bit number after TBCC code coding is to be more than or equal to 20 smallest positive integral; When to (32, when O) block code is encoded, the bit number after TBCC code coding is to be more than or equal to 32 smallest positive integral, determines the number of maker according to the value of the bit number after TBCC code coding; Second level perforation step, when the TBCC code being carried out to second level perforation, retain the bit number after all TBCC codes described in first order perforation step are encoded; When block code being carried out to second level perforation, the part of coded-bit described in first order perforation step needs to delete, the bit number of deleting is determined by following formula: when the bit number after TBCC code coding is greater than 20, the bit number of deletion is that the bit number after TBCC code coding deducts 20; When the bit number after TBCC code coding is greater than 32, the bit number of deletion is that the bit number after TBCC code coding deducts 32.
A kind of unified coding system of LTE ascending control information, the two-stage of the TBCC that this system is 1/5 by a code check has been bored a hole the chnnel coding of ascending control information under different length, specifically comprise: first order puncture module, for using the TBCC maker, ascending control information is encoded; The number of described use maker is determined as follows: when the TBCC code is encoded, and three makers that the maker of use is the LTE convolution code; When block code is encoded, when to (20, when A) block code is encoded, the bit number after TBCC code coding is to be more than or equal to 20 smallest positive integral; When to (32, when O) block code is encoded, the bit number after TBCC code coding is to be more than or equal to 32 smallest positive integral, determines the number of maker according to the value of the bit number after TBCC code coding; Second level puncture module, for when the TBCC code being carried out to second level perforation, retain the bit number after all TBCC codes described in first order perforation step are encoded; When block code being carried out to second level perforation, the part of coded-bit described in first order perforation step needs to delete, the bit number of deleting is determined by following formula: when the bit number after TBCC code coding is greater than 20, the bit number of deletion is that the bit number after TBCC code coding deducts 20; When the bit number after TBCC code coding is greater than 32, the bit number of deletion is that the bit number after TBCC code coding deducts 32.
In terms of existing technologies, the present invention has the following advantages:
1) three makers in the basic TBCC of code check 1/5 that the present invention proposes are identical with the TBCC of LTE, therefore can keep the backwards compatibility with LTE.
2), from aspect of performance, frame error rate (Frame Error Rate, the FER) performance of two-stage perforation TBCC scheme approaches or is better than the LTE block code, and decoding complexity is much lower.
3) the two-stage perforation TBCC scheme proposed can be carried out encoder/decoder to the UCI on PUCCH and PUSCH by a kind of unified method, has avoided user side and base station end to be selected between Multi-encoding and interpretation method, has simplified the encoder/decoder structure of system.
The accompanying drawing explanation
The basic running time-frequency resource structure that Fig. 1 is the LTE up link;
Fig. 2 is PUCCH upload control structure;
Fig. 3 is the R=1/3 convolution code in the LTE standard;
Fig. 4 is two-stage perforation TBCC scheme;
Two-stage perforation TBCC and LTE block code that Fig. 5 (a)~Fig. 5 (g) code length is 20 are the FER performance under 7 to 13 bits at UCI;
Two-stage perforation TBCC and LTE block code that Fig. 6 (a)~Fig. 6 (e) code length is 32 are the FER performance under 7 to 11 bits at UCI;
The two-stage perforation TBCC that Fig. 7 code length is 20 and the decoding complexity of block code are relatively
The two-stage perforation TBCC that Fig. 8 code length is 32 and the decoding complexity of block code are relatively
Fig. 9 be (20, the A) basic sequence of block code;
Figure 10 be (32, the O) basic sequence of block code;
Figure 11 is the perforation pattern that two-stage perforation TBCC is 20 o'clock in code length;
Figure 12 is the perforation pattern that two-stage perforation TBCC is 32 o'clock in code length;
Figure 13 is normalization QPSK planisphere;
Figure 14 is LTE block code and the performance of two-stage perforation TBCC when FER=10-4 that code length is 20;
Figure 15 is LTE block code and the performance of two-stage perforation TBCC when FER=10-4 that code length is 32.
Embodiment
For above-mentioned purpose of the present invention, feature and advantage can be become apparent more, below in conjunction with the drawings and specific embodiments, the present invention is further detailed explanation.
The invention provides a kind of Unified coding method of LTE ascending control information, wherein three makers of the basic TBCC that the code check that the method is used is 1/5 are identical with the convolution code of LTE, to guarantee and LTE original encoding scheme compatibility, specifically comprise the two-stage perforation step.In first order perforation, in the basic TBCC maker that is 1/5 at code check, select several or whole makers to carry out the TBCC coding of variable bit rate.While having selected identical three makers of convolution code with former LTE, consistent with the former TBCC coding of LTE; While replacing the former block code of LTE, the concrete bit number according to UCI, select the number of maker, thereby the TBCC to different coding speed, the bit number of selecting the number of maker will meet after UCI under different situations encode by TBCC to obtain is for being greater than/equaling 20 (replacements (20, A) during block code) or 32 (smallest positive integral that replaces when block code (32, O)) makes the second level delete the bit of code word minimum as far as possible.In the perforation of the second level, the code word bits of output after first order perforation is deleted, obtained the code word bits length of former LTE regulation.While replacing the former TBCC code of LTE, the deleted bit number is zero, while replacing the former block code of LTE, for the code word that to obtain length be 20 or 32, deletion exceeds the bit of required code length, and adopted two kinds of methods in the perforation of the second level: first method is that coded-bit is evenly bored a hole; Second method is the circular buffer of utilizing in LTE TBCC rate-matched (Rate Matching, RM), starts to delete the bit last maker output stream from end, i.e. circulation is deleted.The maker and the perforation pattern that in the first order and second level perforation, use obtain by search, calculate the decoding error probability under all possible perforation pattern, select to make the best perforation pattern of error performance.
The two-stage of the basic TBCC that the present invention is 1/5 by a code check has been bored a hole the chnnel coding of UCI under different length, wherein three makers of the basic TBCC that code check is 1/5 are identical with the convolution code of LTE, can keep the backwards compatibility with LTE: while replacing the former TBCC code of LTE, select three makers of former LTE convolution code in first order perforation, in the second level, need not delete code word; While replacing the former block code of LTE, in first order perforation, select the number of TBCC maker according to the bit number of UCI, carry out the TBCC coding, in the perforation of the second level, unnecessary bit after deletion first order coding, obtain the code word that code length is 20 or 32.The receiver of TBCC code can adopt efficiently (Wrap Around Viterbi Algorithm, WAVA) carry out decoding, complexity is than the maximum likelihood of block code (Maximum Likelihood, ML) decoding is much lower, therefore obtain the approaching performance that even is better than LTE original encoding scheme from performance and complexity two aspects, and reduced the complexity of system.Therefore, UCI can adopt as above the unification of two-stage perforation TBCC scheme to be encoded under different length, not need to (20, A) block code, (32, O) between block code and rate 1/3TBCC, selected.The base station end also only need carry out WAVA decoding to the TBCC code, more much lower than former LTE block code ML decoding complexity.
Embodiment:
Below in conjunction with accompanying drawing, method of the present invention is described in detail.
1.LTE original encoding method:
(20, A) block code is encoded to adopt one when UCI transmits on PUCCH.LTE (20, A) code word of block code is the linear combination of 13 basic sequences, and these 13 basic sequences are designated as (M i, 0, M i, 1..., M i, 12), as shown in Figure 9.Code word bits before coding is designated as a 0, a 1, a 2..., a a-1, the bit that coding obtains is designated as b 0, b 1, b 2..., b b-1, wherein B=20 is the code word bits number, each code word bits is calculated by following formula:
b i = Σ n = 0 A - 1 ( a n · M i , n ) mod 2 , i = 0,1,2 , . . . B - 1 [formula 1]
When CQI transmits on PUSCH, if be less than 11 bits, need to be encoded into 32 code word bits.(32, O) the variable bit rate block code is encoded, and the CQI bit that is input to channel coding module is designated as o by one 0, o 1, o 2..., o o-1, wherein, O is bit number.(32, O) code word of block code is the linear combination of 11 basic sequences, and these 11 basic sequences are designated as (M i, 0, M i, 1..., M i, 10), as shown in figure 10.The bit that coding obtains is designated as b 0, b 1, b 2..., b b-1, wherein B=32 is the code word bits number, each code word bits is calculated by following formula:
b i = Σ n = 0 O - 1 ( o n · M i , n ) mod 2 , i = 0,1,2 , . . . B - 1 [formula 2]
When CQI transmits on PUSCH, if be greater than 11 bits, adopting a constraint length is 7, and the TBCC that code check is 1/3 carries out chnnel coding.The maker of TBCC is (133,171,165), and coder structure as shown in Figure 3.For the initial condition that makes shift register is identical with end-state, the initial value of shift register is set to last 6 information bits of input stream.If input stream is u 0, u 1, u 2..., u k-1, the number that k is information bit, 6 memory cell s in shift register 0, s 1, s 2, s 3, s 4, s 5mean, the initial value of TBCC shift register should be set to so:
S i=u k-1-i[formula 3]
Obtain three code word bits streams after coding
Figure BDA0000089623740000083
i=0,1,2.Wherein D is the bit number of each coding output stream, the sequence number of i presentation code output stream.
2. according to LTE original encoding method, the TBCC maker that to obtain code check be 1/5
In order to keep the compatibility of LTE, wherein three makers of the TBCC that code check is 1/5 are identical with the convolution code of LTE, i.e. (133,171,165) 8(meaning the octal system form), another two makers obtain by exhaustive search.At first in (133,171,165) 8basis on add 1 maker and form the convolution code that code check is 1/4, the maker that is 7 for constraint length, have following several may:
(1) there is 1 zero in maker, total
Figure BDA0000089623740000091
plant situation, i.e. (0111111) 2~(1111110) 2.
(2) there are 2 zero in maker, total
Figure BDA0000089623740000092
plant situation, i.e. (0011111) 2~(1111100) 2.
(3) there are 3 zero in maker, total
Figure BDA0000089623740000093
plant situation, i.e. (0001111) 2~(1111000) 2.
(4) there are 4 zero in maker, total
Figure BDA0000089623740000094
plant situation, i.e. (0000111) 2~(1110000) 2.
(5) there are 5 zero in maker, total
Figure BDA0000089623740000095
plant situation, i.e. (0000011) 2~(1100000) 2.
(6) there are 6 zero in maker, total
Figure BDA0000089623740000096
plant situation, i.e. (0000001) 2~(1000000) 2.
By this
Figure BDA0000089623740000097
kind possible maker respectively with (133,171,165) sthe convolution code that to form code check be 1/4 calculates the code W (C) that heavily distributes:
W (C)=(A i, i=0,1 ... n) [formula 4]
Wherein, A imean the number of all code words that in code C, Hamming weight is i, n is code length, gets n=32 here.Heavily distribute according to code, be calculated as follows out the decoding error probability under additive white Gaussian noise (Additive White Gaussian Noise, AWGN) channel:
P e ( C ) < &Sigma; w = 0 n A w Q ( 2 wR E b N 0 ) [formula 5]
Wherein, R is code check, E b/ N 0for every bit signal to noise ratio, Q (x) is Gauss Q function.By search, make the best maker of convolution code decoding error performance that code check is 1/4 that (055) be arranged s, (132) s, (113) s, (151) s.The maker of having chosen rate 1/4 convolution code is (133,171,165,132) s, according to identical method, the maker of definite rate 1/5 convolution code is (133,171,165,132,157) s.
3. according to basic TBCC maker, implement two-stage perforation TBCC
The two-stage perforation TBCC scheme proposed as shown in Figure 4.
1), in first order perforation, using all or part of of basic maker is 7 to 13 bit UCI codings to length.If the coded-bit number is K (7≤K≤13), the UCI bit that is input to channel coding module is: k 0, k 1, k 2..., k k-1, the basic maker number used is N (2≤N≤5), so the code rate of TBCC code is 1/N, and the bit number after coding is K*N, and the code word bits after coding is: b 0, b 1, b 2..., b k*N-1while replacing the former TBCC code of LTE, that select is three maker N=3 of LTE convolution code, while replacing the LTE block code, require the number of K*N (to replace (20 for being greater than/equaling 20, A) during block code) or 32 (replace the smallest positive integral of when block code (32, O)), thereby determine the number of N.
2) in the perforation of the second level, while replacing the TBCC code of LTE, need not delete, while replacing the LTE block code, for the code word that to obtain code length be 20 or 32, the part of coded-bit (or not having) is further deleted, and can obtain bit number P:K*N-20 (K*N>20) or the K*N-32 (K*N>32) that should delete; Adopted two kinds of methods in the perforation of the second level: first method is that coded-bit is evenly bored a hole; Second method is the circular buffer of utilizing in LTE TBCC rate-matched (Rate Matching, RM), starts to delete the bit last maker output stream from end, i.e. circulation perforation.
4. according to the two-stage method for punching in 3, determine determining of maker under different UCI bit conditions and perforation pattern
The maker and the perforation pattern that in the first order and second level perforation, use obtain by search, utilize formula (5) to calculate the decoding error probability under all possible perforation pattern, select to make the best perforation pattern of error performance.Final perforation pattern is in Figure 11 and Figure 12.
5. the comparison of the interpretation method complexity of two-stage perforation TBCC code and LTE block code
In sum, the cataloged procedure of two-stage perforation TBCC scheme as shown in Figure 4, the bit number of known UCI, according to Figure 11 or Figure 12 carry out the two-stage perforation to parameter and take and obtain the code word that code length is 20 or 32 (owing to replacing the TBCC code, interpretation method is consistent, decoding complexity is the same, so do not discuss herein).Receiver can adopt efficient WAVA to carry out decoding, and the ML decoding of LTE block code and the comparison of WAVA decoding complexity below have been discussed.
Suppose that two-stage perforation TBCC scheme adopts WAVA to carry out decoding, LTE (20, A) block code and (32, O) block code adopts ML to carry out decoding.WAVA utilizes the grid chart search of the convolution code code word the most similar with the reception signal, and ML decoding compares and obtains the code word the most similar to receiving signal by receiving signal and all possible code word.When (n, k) parameter is identical, in most cases the complexity of WAVA is all much lower than ML decoding.
Below from the amount of calculation of add operation, multiplying and comparison operation, carry out the complexity of comparison WAVA and ML decoding." add operation " refers to two real number value additions." multiplying " refers to the soft information of demodulator output multiplied each other with "+1 " or " 1 ", and also can be equivalent to certain code word bits of check is " 0 " or " 1 "." comparison operation " refers to the size of two values of comparison and selects wherein the value of large (or less).
At first consider the WAVA algorithm.The maximum iteration time arranged while supposing decoding is 2, and each iteration carries out Viterbi decoding one time, lower general of high s/n ratio (Signal to Noise Ratio, SNR), needs 1 iteration to get final product.Viterbi algorithm utilizes the grid chart of convolution code to carry out decoding: the length of supposing information bit is designated as k, and in grid chart, moment scope is t=1,2 .., k; Constraint length is designated as K, each the time be carved with 2 kindividual state; Code check is designated as 1/q, so each state has 2 1, there be q code word bits in=2 input branches in each branch.In each moment of Viterbi decoding: at first calculate 2 qindividual possibility branch metrics, branch upper 2 qindividual possible code word and the distance that receives signal, the calculating of each branch metrics needs multiplication q time, and therefore the q-1 sub-addition has 2 q* q multiplication, 2 q* (q-1) sub-addition; Secondly, for each state, calculate 2 candidates and estimate, select to estimate less value as new state metrics, therefore have 2 k* 2 sub-additions, 2 kinferior comparison.In total k the moment of each Viterbi decoding, therefore the amount of calculation of 1 iteration WAVA is [2 k* 2+2 q* (q-1)] * the k sub-addition, 2 q* q * k time multiplication and 2 k* compare for k time.
Next considers the ML decoding algorithm.Supposing to receive signal length is n, calculate receive between signal and a code word apart from needing multiplication, n-1 sub-addition n time.ML decoding need to be calculated and be received signal and 2 kthe distance of individual possible code word, and select the minimum code word of distance, therefore have 2 k* (n-1) sub-addition, 2 k* n multiplication and 2 k-1 comparison.
Be more than a kind of coding and interpretation method of Unified coding scheme of LTE ascending control information.
Performance for the Unified coding method of estimating a kind of LTE ascending control information of the present invention, the two-stage perforation TBCC scheme of proposition and the performance of the former blook code implementation of LTE have been carried out to emulation, wherein perforation scheme in the TBCC second level has adopted respectively the method for even perforation and circulation perforation, finally with regard to performance and complexity two aspects, compares:
The cataloged procedure of two-stage perforation TBCC scheme as shown in Figure 4, and according to Figure 11 or Figure 12 bored a hole to obtain the code word that code length is 20 or 32 to parameter.The cataloged procedure of the former blook code implementation of LTE is suc as formula shown in (1) or formula (2), adopts respectively the basic sequence that length that Fig. 9 or Figure 10 provide is 20 or 32.The simulated environment of channel is awgn channel, according to the SNR provided, produces the AWGN noise, then noise is added on the output sequence through encoder and modulator.Modulation system is Quadrature Phase Shift Keying (Quadrature Phase Shift Keying, QPSK), adopts normalization QPSK planisphere as shown in figure 13, bit group b (i), and b (i+1) is mapped to complex value modulation symbol x=I+jQ.All 106 frame UCI bits have been carried out to emulation under each SNR.The decoded mode of receiving terminal block code: two-stage perforation TBCC scheme adopts WAVA to carry out decoding, LTE (20, A) block code and (32, O) block code adopts ML to carry out decoding.
Two-stage perforation TBCC and LTE block code that Fig. 5 (a)~Fig. 5 (g) is 20 for code length are the FER performance under 7 to 13 bits at UCI.In figure, (n, k) presentation code device, using the k bit as input, is exported the code word of n bit.With FER=10 -4for the performance of each scheme of standard analysis, as shown in figure 14.As can be seen from the figure, the TBCC under circulation deletion scheme can obtain than the better performance of TBCC under even deletion scheme, and therefore, second level perforation should be selected circulation deletion scheme.At UCI, be 8 and during 11 bit, the performance of TBCC scheme is identical with the LTE block code.At UCI, be 10 and during 12 bit, the performance of TBCC scheme and the gap of block code are very little, only have 0.05dB.At UCI, be 7,9 and during 13 bit, the performance of TBCC scheme is slightly poor, than the poor 0.3dB to 0.5dB of block code.
The two-stage perforation TBCC and the block code that as Fig. 6 (a)~Fig. 6 (e), for code length, are 32 are the FER performance under 7 to 11 bits at UCI.With FER=10 -4for the performance of each scheme of standard analysis, as shown in figure 15.As can be seen from the figure, the situation that is 20 with code length is the same, and second level perforation should select circulation deletion scheme to obtain better performance.When UCI is 7 bit, the good 0.35dB of Performance Ratio LTE block code of TBCC scheme.When UCI is 8 bit, the performance of TBCC scheme is identical with the LTE block code.At UCI, be 9 and during 11 bit, the performance of TBCC scheme and the gap of block code are very little, only have 0.05dB or 0.1dB.When UCI is 10 bit, the performance of TBCC scheme is slightly poor, than the poor 0.5dB of block code.
Two-stage perforation TBCC and LTE block code that Fig. 7 (a)~Fig. 7 (c) is 20 for code length are the decoding complexity comparison under 7 to 13 bits at UCI, and the TBCC parameter under different UCI length is arranged by Figure 11.From Fig. 7 (a) and Fig. 7 (b), can find out, " add operation " of WAVA and the complexity of " multiplying " are along with the increase of UCI bit is linear growth, and the decoding complexity of ML is exponential increase along with the increase of UCI bit, and the complexity of WAVA is more much lower than ML.From Fig. 7 (c), can find out, under high SNR, WAVA only needs iteration 1 time, and the complexity of " comparison operation " was more or less the same with ML before 9 bits, but more much lower than ML since the complexity of 9 bit WAVA; Under low SNR, WAVA needs 2 iteration, " more complicated degree " large than ML 10 bits before, but lower than ML from the complexity of the later WAVA of 10 bits.
Two-stage perforation TBCC and LTE block code that Fig. 8 (a)~Fig. 8 (c) is 32 for code length are the decoding complexity comparison under 7 to 11 bits at UCI, and the TBCC parameter under different UCI length is arranged by Figure 12.From Fig. 8 (a) and Fig. 8 (b), can find out, " add operation " of WAVA and the complexity of " multiplying " are more much lower than ML.From Fig. 8 (c), can find out, " the more complicated degree " of 1 WAVA repeatedly the time 9 bits before than the height of ML, later lower than ML at 9 bits, and WAVA " more complicated degree " is than the height of ML, only low than ML when 11 bit during 2 iteration.
The result of Fig. 5, Fig. 6, Fig. 7 and Fig. 8 shows the performance for FER, and two-stage perforation TBCC scheme and the LTE block code of proposition are more or less the same, even better than LTE block code under some UCI bit length.Two-stage perforation TBCC scheme can adopt WAVA to carry out decoding, under high SNR, decoding complexity is more much lower than the ML decoding of block code, under low SNR except the complexity of " comparison operation " slightly greatly, the complexity of " add operation " and " multiplying " is still much lower than ML.Therefore, from performance and complexity two aspects, the performance of two-stage perforation TBCC scheme approaches and even is better than LTE original encoding scheme.The two-stage perforation TBCC scheme proposed can be carried out encoder/decoder to the UCI on PUCCH and PUSCH by a kind of unified method, has avoided user side and base station end to be selected between Multi-encoding and decoding algorithm scheme, has simplified the encoder/decoder structure of system.
The above method and system of the Unified coding to a kind of LTE ascending control information provided by the present invention describe in detail, applied specific embodiment herein principle of the present invention and execution mode are set forth, the explanation of above embodiment is just for helping to understand method of the present invention and core concept thereof; Simultaneously, for one of ordinary skill in the art, according to thought of the present invention, all will change in specific embodiments and applications.In sum, this description should not be construed as limitation of the present invention.

Claims (2)

1. the Unified coding method of a LTE ascending control information, is characterized in that, the two-stage of the TBCC that is 1/5 by a code check has been bored a hole the chnnel coding of ascending control information under different length, specifically comprises the steps:
First order perforation step, used the TBCC maker to be encoded to ascending control information; The number of described use maker is determined as follows: when the former TBCC code of replacement LTE is encoded, and three makers that the maker of use is the LTE convolution code; When the former block code of replacement LTE is encoded, in two kinds of situation, when to replacing LTE former (20, when A) block code is encoded, bit number after by the TBCC maker, ascending control information being encoded is to be more than or equal to 20 smallest positive integral, when to replacing LTE former (32, when O) block code is encoded, bit number after by the TBCC maker, ascending control information being encoded is to be more than or equal to 32 smallest positive integral, determines the number of maker according to the value of the bit number after by the TBCC maker, ascending control information being encoded;
Second level perforation step, when when replacing the former TBCC code of LTE to carry out second level perforation, retain all described in first order perforation step and pass through the bit number after the TBCC maker is encoded to ascending control information; When the former block code of replacement LTE is carried out to second level perforation, the part of coded-bit described in first order perforation step needs to delete, the bit number of deleting is determined by following formula: when the bit number after by the TBCC maker, ascending control information being encoded is greater than 20, the bit number of deletion deducts 20 for the bit number after by the TBCC maker, ascending control information being encoded; When the bit number after by the TBCC maker, ascending control information being encoded is greater than 32, the bit number of deletion deducts 32 for the bit number after by the TBCC maker, ascending control information being encoded.
2. the unified coding system of a LTE ascending control information, is characterized in that, the two-stage of the TBCC that this system is 1/5 by a code check has been bored a hole the chnnel coding of ascending control information under different length, specifically comprises:
First order puncture module, encoded to ascending control information for using the TBCC maker; The number of described use maker is determined as follows: when the former TBCC code of replacement LTE is encoded, and three makers that the maker of use is the LTE convolution code; When replacing the former block code of LTE to be encoded, when to replacing LTE, former (20, when A) block code is encoded, the bit number after by the TBCC maker, ascending control information being encoded is to be more than or equal to 20 smallest positive integral; When to replacing LTE former (32, when O) block code is encoded, bit number after by the TBCC maker, ascending control information being encoded is to be more than or equal to 32 smallest positive integral, determines the number of maker according to the value of the bit number after by the TBCC maker, ascending control information being encoded;
Second level puncture module, for when when replacing the former TBCC code of LTE to carry out second level perforation, retain all described in first order perforation step and pass through the bit number after the TBCC maker is encoded to ascending control information; When the former block code of replacement LTE is carried out to second level perforation, the part of coded-bit described in first order perforation step needs to delete, the bit number of deleting is determined by following formula: when the bit number after by the TBCC maker, ascending control information being encoded is greater than 20, the bit number of deletion deducts 20 for the bit number after by the TBCC maker, ascending control information being encoded; When the bit number after by the TBCC maker, ascending control information being encoded is greater than 32, the bit number of deletion deducts 32 for the bit number after by the TBCC maker, ascending control information being encoded.
CN 201110263664 2011-09-07 2011-09-07 United coding method and system for long term evolution (LTE) uplink control information (UCI) Expired - Fee Related CN102299770B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN 201110263664 CN102299770B (en) 2011-09-07 2011-09-07 United coding method and system for long term evolution (LTE) uplink control information (UCI)

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN 201110263664 CN102299770B (en) 2011-09-07 2011-09-07 United coding method and system for long term evolution (LTE) uplink control information (UCI)

Publications (2)

Publication Number Publication Date
CN102299770A CN102299770A (en) 2011-12-28
CN102299770B true CN102299770B (en) 2013-12-18

Family

ID=45359962

Family Applications (1)

Application Number Title Priority Date Filing Date
CN 201110263664 Expired - Fee Related CN102299770B (en) 2011-09-07 2011-09-07 United coding method and system for long term evolution (LTE) uplink control information (UCI)

Country Status (1)

Country Link
CN (1) CN102299770B (en)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2018127771A1 (en) * 2017-01-09 2018-07-12 Telefonaktiebolaget Lm Ericsson (Publ) Coding technique for multi-stage control information
SG11201905795VA (en) 2017-02-05 2019-08-27 Lg Electronics Inc Method for terminal transmitting uplink control information in wireless communication system and apparatus supporting same
CN108616331B (en) * 2018-04-27 2020-12-22 江苏中科芯核电子科技有限公司 Wireless communication system decoding method based on LTE

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101946539A (en) * 2008-02-03 2011-01-12 Lg电子株式会社 Method for transmitting cqi in wireless communication system
CN102075293A (en) * 2011-01-10 2011-05-25 中兴通讯股份有限公司 Method for sending channel state information and terminal
CN102104458A (en) * 2010-07-02 2011-06-22 电信科学技术研究院 Method and equipment for UCI (transmitting uplink control information) transmitting uplink control information)

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2010085187A1 (en) * 2009-01-21 2010-07-29 Telefonaktiebolaget L M Ericsson (Publ) Self-organizing network control for pucch resources

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101946539A (en) * 2008-02-03 2011-01-12 Lg电子株式会社 Method for transmitting cqi in wireless communication system
CN102104458A (en) * 2010-07-02 2011-06-22 电信科学技术研究院 Method and equipment for UCI (transmitting uplink control information) transmitting uplink control information)
CN102075293A (en) * 2011-01-10 2011-05-25 中兴通讯股份有限公司 Method for sending channel state information and terminal

Also Published As

Publication number Publication date
CN102299770A (en) 2011-12-28

Similar Documents

Publication Publication Date Title
US11632190B2 (en) Method, device and system of determining transmission parameter of data shared channel
US10887150B2 (en) Method and apparatus for data transmission in a multiuser downlink cellular system
US10277361B2 (en) Method, apparatus and system for transmitting information bits
CN111954982B (en) Apparatus and method for encoding and decoding using polar code in wireless communication system and broadcasting system
JP6830100B2 (en) CQI information receiving method, transmitting method, receiving device, and transmitting device
CN106160987B (en) Control information sending method and device
CN101902313B (en) PUSCH transmission (Physical Uplink Shared Channel) based coding method and system of uplink control information
CN107210839B (en) Control information sending and receiving method, user equipment and network equipment
CN103181107A (en) Mobile station device, processing method, and integrated circuit
CN102845038A (en) Method and apparatus of transmitting uplink signal
CN111447665B (en) Method and device used in user equipment and base station for power adjustment
CN102299770B (en) United coding method and system for long term evolution (LTE) uplink control information (UCI)
KR101402906B1 (en) Apparatus and method for power control in mobile communication system
CN107370564B (en) Polarization code processing method and device and node
CN104660365A (en) Channel state measuring method, device and user terminal
CN113890686B (en) Polarization code processing method and device and node
CN109964427B (en) Method and device used in terminal and base station for channel coding
CN102377509B (en) Control information transmitting method, control information receiving method and control information receiving equipment
CN110896342B (en) URLLC single transmission method and device, storage medium and terminal
CN116723542A (en) Method and device for channel coding in base station and user equipment
CN116235434A (en) Techniques for channel quality information reporting and modulation and coding scheme determination for devices with limited capabilities
Bai et al. Optimal QoS-Constrained Resource Allocation in Downlink and Uplink Multicarrier Systems

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20131218

Termination date: 20140907

EXPY Termination of patent right or utility model