CN101252371B - Decoding method of high speed sharing control channel - Google Patents
Decoding method of high speed sharing control channel Download PDFInfo
- Publication number
- CN101252371B CN101252371B CN200810104027XA CN200810104027A CN101252371B CN 101252371 B CN101252371 B CN 101252371B CN 200810104027X A CN200810104027X A CN 200810104027XA CN 200810104027 A CN200810104027 A CN 200810104027A CN 101252371 B CN101252371 B CN 101252371B
- Authority
- CN
- China
- Prior art keywords
- sequence
- scch
- deconvolution
- bit
- ueid
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
Images
Landscapes
- Detection And Prevention Of Errors In Transmission (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a decoding method used for sharing the control channel with high speed and the HSDPA in the TD-SCDMA system. The decoding method includes that A. a bit corresponding relation table of decoded physical channel mapping and deconvolution code for the decoding of the HS-SCCH is prestored in the terminal; B. based on the bit corresponding relation table, the demodulated HS-SCCHsequence is processed with matching bit by bit to obtain the deconvolution sequence corresponding to the demodulated HS-SCCH sequence. The decoding method simplifies the decoding process of the HS-SCCH and improves the decoding efficiency of the HS-SCCH effectively.
Description
Technical field
The invention belongs to moving communicating field, particularly relate to the coding/decoding method that a kind of high speed downlink packet that is used for TD SDMA (TD-SCDMA) system inserts the High-Speed Shared Control Channel (HS-SCCH) of (HSDPA).
Background technology
In the evolution of 3G (Third Generation) Moblie technology, introduced an important enhancement techniques---HSDPA in 3GPP Release 5 Version Specs.The high speed business carrying of HSDPA is main by high speed descending sharing channel (HS-DSCH), and this is a HSDPA dedicated channel.In uplink and downlink a shared control channel is arranged respectively respectively in addition, promptly up HS-DSCH shares information channel (HS-SICH) and descending HS-SCCH.
HS-SCCH is the down control channel of HSDPA special use, is a physical channel, and it is used to carry all relevant bottom control information.That is to say that terminal receives the data of HS-DSCH channel and must just can finish under the cooperation of HS-SCCH control information.HS-SCCH is shared by the user terminal (UE) that all receive the HSDPA data, but to single HS-DSCH Transmission Time Interval (TTI), each HS-SCCH only is a relevant downlink signaling of UE carrying HS-DSCH, and 16 CRC moulds two of HS-SCCH add that the different terminal iidentification of each UE (UEID) is to distinguish different user.
Network side is dispatched the number range of HS-SCCH simultaneously can be from 1 HS-SCCH to 4 HS-SCCH, the corresponding gap information of HS-DSCH carries on this user HS-SCCH, this information provides according to a restriction: to an appointment UE, the skew of a nHS-SCCH 〉=3 time slots is arranged between the HS-DSCH (on the time) of the HS-SCCH that carries the HS-DSCH corresponding information and first indication.Because radio-frequency devices needs certain stabilization time, therefore, UE might finish the decoding of 4 HS-SCCH in the time of 2 multi-slots, to the decoding capability of UE, has proposed very high requirement.
Summary of the invention
Technical problem to be solved by this invention provides the coding/decoding method of HS-SCCH of the HSDPA of a kind of TD-SCDMA of being used for system, to simplify the HS-SCCH decoding process, improves the HS-SCCH decoding efficiency.
For solving the problems of the technologies described above, the embodiment of the invention provides technical scheme as follows:
The coding/decoding method of a kind of High-Speed Shared Control Channel (HS-SCCH), the high speed downlink packet that is used for TD SDMA (TD-SCDMA) system inserts (HSDPA), and described method comprises:
A, on terminal, store the bit mapping table before the reconciliation convolution code before the physical channel mapping of separating of HS-SCCH decoding in advance;
B, according to described bit mapping table, the HS-SCCH sequence after the demodulation is carried out correspondence by bit, obtain the sequence before the pairing deconvolution sign indicating number of HS-SCCH sequence after the described demodulation.
Preferably, also comprise after the step B:
(UEID) carries out convolutional encoding to terminal iidentification, and the back 72 bit moulds two of the sequence before the described rate-matched are added sequence after the UEID convolutional encoding, obtains removing the sequence after the UEID influence; Sequence after the described removal UEID influence is carried out the deconvolution sign indicating number; Sequence behind the deconvolution sign indicating number is carried out CRC check, and after the CRC check success, the sequence behind the deconvolution sign indicating number is removed CRC tail bit; Sequence behind the removal CRC tail bit is carried out demultiplexing.
Preferably, also comprise after the step B:
Sequence before the described rate-matched is carried out the deconvolution sign indicating number; The back 16 bit moulds two of the sequence behind the deconvolution sign indicating number are added UEID, obtain removing the sequence after UEID influences; The sequence of removing after UEID influences is carried out CRC check, and after the CRC check success, the sequence of removing after UEID influences is removed CRC tail bit; Sequence behind the removal CRC tail bit is carried out demultiplexing.
Embodiments of the invention need not obtain sequence before the rate-matched according to the mathematical formulae of separating physical channel mapping, deinterleaving, separating rate-matched, but make full use of the unique characteristic of bit corresponding relation that HS-SCCH separates physical channel mapping presequence and deconvolution sign indicating number presequence, standard operation is converted to sequence before the computing of tabling look-up obtains the deconvolution sign indicating number, simplify the HS-SCCH decoding process, can effectively improve the decoding efficiency of HS-SCCH.In other embodiments of the invention, can also influence by the preceding UEID of removal before the deconvolution sign indicating number, this has further simplified algorithm, has improved decoding speed.
Description of drawings
Fig. 1 is the HS-SCCH coding schematic flow sheet of TD-SCDMA in the prior art;
Fig. 2 is the HS-SCCH coding/decoding method flow chart of the embodiment of the invention 1;
Fig. 3 is the HS-SCCH coding/decoding method flow chart of the embodiment of the invention 2.
Embodiment
For ease of better understanding the present invention, simply introduce earlier the cataloged procedure of HS-SCCH in the TD-SCDMA system here, with reference to Fig. 1, cataloged procedure is as follows:
Convolutional encoding:
HS-SCCH is totally 30 information bits, is 46 bits behind additional 16 CRC.HS-SCCH use speed is 1/3 convolutional encoding, is 162 bit c after encoding
i(i=0,1,2...161)
Rate-matched:
Calculating can get 10 bits and will be repeated, and these 10 bits are respectively c
0, c
16, c
32, c
48, c
64, c
81, c
97, c
113, c
129, c
145, the sequence of rate-matched output is f
i(i=0,1,2...171), after the HS-SCCH convolutional encoding after sequence and the rate-matched bit corresponding relation of sequence as shown in table 1.
| Output | Input | Output | Input | Output | Input | Output | Input |
| f[0]? | c[0]? | f[44]? | c[41]? | f[88]? | c[82]? | f[132]? | c[124]? |
| f[1]? | c[0]? | f[45]? | c[42]? | f[89]? | c[83]? | f[133]? | c[125]? |
| f[2]? | c[1]? | f[46]? | c[43]? | f[90]? | c[84]? | f[134]? | c[126]? |
| f[3]? | c[2]? | f[47]? | c[44]? | f[91]? | c[85]? | f[135]? | c[127]? |
| f[4]? | c[3]? | f[48]? | c[45]? | f[92]? | c[86]? | f[136]? | c[128]? |
| f[5]? | c[4]? | f[49]? | c[46]? | f[93]? | c[87]? | f[137]? | c[129]? |
| f[6]? | c[5]? | f[50]? | c[47]? | f[94]? | c[88]? | f[138]? | c[129]? |
| f[7]? | c[6]? | f[51]? | c[48]? | f[95]? | c[89]? | f[139]? | c[130]? |
| f[8]? | c[7]? | f[52]? | c[48]? | f[96]? | c[90]? | f[140]? | c[131]? |
| f[9]? | c[8]? | f[53]? | c[49]? | f[97]? | c[91]? | f[141]? | c[132]? |
| f[10]? | c[9]? | f[54]? | c[50]? | f[98]? | c[92]? | f[142]? | c[133]? |
| f[11]? | c[10]? | f[55]? | c[51]? | f[99]? | c[93]? | f[143]? | c[134]? |
| f[12]? | c[11]? | f[56]? | c[52]? | f[100]? | c[94]? | f[144]? | c[135]? |
| f[13]? | c[12]? | f[57]? | c[53]? | f[101]? | c[95]? | f[145]? | c[136]? |
| f[14]? | c[13]? | f[58]? | c[54]? | f[102]? | c[96]? | f[146]? | c[137]? |
| f[15]? | c[14]? | f[59]? | c[55]? | f[103]? | c[97]? | f[147]? | c[138]? |
| f[16]? | c[15]? | f[60]? | c[56]? | f[104]? | c[97]? | f[148]? | c[139]? |
| f[17]? | c[16]? | f[61]? | c[57]? | f[105]? | c[98]? | f[149]? | c[140]? |
| f[18]? | c[16]? | f[62]? | c[58]? | f[106]? | c[99]? | f[150]? | c[141]? |
| f[19]? | c[17]? | f[63]? | c[59]? | f[107]? | c[100]? | f[151]? | c[142]? |
| f[20]? | c[18]? | f[64]? | c[60]? | f[108]? | c[101]? | f[152]? | c[143]? |
| f[21]? | c[19]? | f[65]? | c[61]? | f[109]? | c[102]? | f[153]? | c[144]? |
| f[22]? | c[20]? | f[66]? | c[62]? | f[110]? | c[103]? | f[154]? | c[145]? |
| f[23]? | c[21]? | f[67]? | c[63]? | f[111]? | c[104]? | f[155]? | c[145]? |
| f[24]? | c[22]? | f[68]? | c[64]? | f[112]? | c[105]? | f[156]? | c[146]? |
| f[25]? | c[23]? | f[69]? | c[64]? | f[113]? | c[106]? | f[157]? | c[147]? |
| f[26]? | c[24]? | f[70]? | c[65]? | f[114]? | c[107]? | f[158]? | c[148]? |
| f[27]? | c[25]? | f[71]? | c[66]? | f[115]? | c[108]? | f[159]? | c[149]? |
| f[28]? | c[26]? | f[72]? | c[67]? | f[116]? | c[109]? | f[160]? | c[150]? |
| f[29]? | c[27]? | f[73]? | c[68]? | f[117]? | c[110]? | f[161]? | c[151]? |
| f[30]? | ?c[28]? | f[74]? | ?c[69]? | f[118]? | c[111]? | f[162]? | c[152]? |
| f[31]? | ?c[29]? | f[75]? | ?c[70]? | f[119]? | c[112]? | f[163]? | c[153]? |
| f[32]? | ?c[30]? | f[76]? | ?c[71]? | f[120]? | c[113]? | f[164]? | c[154]? |
| f[33]? | ?c[31]? | f[77]? | ?c[72]? | f[121]? | c[113]? | f[165]? | c[155]? |
| f[34]? | ?c[32]? | f[78]? | ?c[73]? | f[122]? | c[114]? | f[166]? | c[156]? |
| f[35]? | ?c[32]? | f[79]? | ?c[74]? | f[123]? | c[115]? | f[167]? | c[157]? |
| f[36]? | ?c[33]? | f[80]? | ?c[75]? | f[124]? | c[116]? | f[168]? | c[158]? |
| f[37]? | ?c[34]? | f[81]? | ?c[76]? | f[125]? | c[117]? | f[169]? | c[159]? |
| f[38]? | ?c[35]? | f[82]? | ?c[77]? | f[126]? | c[118]? | f[170]? | c[160]? |
| f[39]? | ?c[36]? | f[83]? | ?c[78]? | f[127]? | c[119]? | f[171]? | c[161]? |
| f[40]? | ?c[37]? | f[84]? | ?c[79]? | f[128]? | c[120]? | ? | ? |
| f[41]? | ?c[38]? | f[85]? | ?c[80]? | f[129]? | c[121]? | ? | ? |
| f[42]? | ?c[39]? | f[86]? | ?c[81]? | f[130]? | c[122]? | ? | ? |
| f[43]? | ?c[40]? | f[87]? | ?c[81]? | f[131]? | c[123]? | ? | ? |
Table 1
Interweave:
Be based on the interweaving of HS-SCCH frame and interweave the relevant second time, the output sequence after interweaving is v
i(i=0,1,2...171), sequence is as shown in table 2 with the bit corresponding relation of the back sequence that interweaves after the HS-SCCH rate-matched.
| Output | Input | Output | Input | Output | Input | Output | Input |
| v[0]? | f[0]? | v[44]? | f[103]? | v[88]? | f[36]? | v[132]? | f[159]? |
| v[1]? | f[30]? | v[45]? | f[133]? | v[89]? | f[66]? | v[133]? | f[29]? |
| v[2]? | f[60]? | v[46]? | f[163]? | v[90]? | f[96]? | v[134]? | f[59]? |
| v[3]? | f[90]? | v[47]? | f[23]? | v[91]? | f[126]? | v[135]? | f[89]? |
| v[4]? | f[120]? | v[48]? | f[53]? | v[92]? | f[156]? | v[136]? | f[119]? |
| v[5]? | f[150]? | v[49]? | f[83]? | v[93]? | f[16]? | v[137]? | f[149]? |
| v[6]? | f[20]? | v[50]? | f[113]? | v[94]? | f[46]? | v[138]? | f[12]? |
| v[7]? | f[50]? | v[51]? | f[143]? | v[95]? | f[76]? | v[139]? | f[42]? |
| v[8]? | f[80]? | v[52]? | f[8]? | v[96]? | f[106]? | v[140]? | f[72]? |
| v[9]? | f[110]? | v[53]? | f[38]? | v[97]? | f[136]? | v[141]? | f[102]? |
| v[10]? | f[140]? | v[54]? | f[68]? | v[98]? | f[166]? | v[142]? | f[132]? |
| v[11]? | f[170]? | v[55]? | f[98]? | v[99]? | f[26]? | v[143]? | f[162]? |
| v[12]? | f[10]? | v[56]? | f[128]? | v[100]? | f[56]? | v[144]? | f[2]? |
| v[13]? | f[40]? | v[57]? | f[158]? | v[101]? | f[86]? | v[145]? | f[32]? |
| v[14]? | f[70]? | v[58]? | f[18]? | v[102]? | f[116]? | v[146]? | f[62]? |
| v[15]? | f[100]? | v[59]? | f[48]? | v[103]? | f[146]? | v[147]? | f[92]? |
| v[16]? | f[130]? | v[60]? | f[78]? | v[104]? | f[4]? | v[148]? | f[122]? |
| v[17]? | f[160]? | v[61]? | f[108]? | v[105]? | f[34]? | v[149]? | f[152]? |
| v[18]? | f[5]? | v[62]? | f[138]? | v[106]? | f[64]? | v[150]? | f[7]? |
| v[19]? | f[35]? | v[63]? | f[168]? | v[107]? | f[94]? | v[151]? | f[37]? |
| v[20]? | f[65]? | v[64]? | f[28]? | v[108]? | f[124]? | v[152]? | f[67]? |
| v[21]? | f[95]? | v[65]? | f[58]? | v[109]? | f[154]? | v[153]? | f[97]? |
| v[22]? | f[125]? | v[66]? | f[88]? | v[110]? | f[14]? | v[154]? | f[127]? |
| v[23]? | f[155]? | v[67]? | f[118]? | v[111]? | f[44]? | v[155]? | f[157]? |
| v[24]? | f[15]? | v[68]? | f[148]? | v[112]? | f[74]? | v[156]? | f[22]? |
| v[25]? | f[45]? | v[69]? | f[1]? | v[113]? | f[104]? | v[157]? | f[52]? |
| v[26]? | f[75]? | v[70]? | f[31]? | v[114]? | f[134]? | v[158]? | f[82]? |
| v[27]? | f[105]? | v[71]? | f[61]? | v[115]? | f[164]? | v[159]? | f[112]? |
| v[28]? | f[135]? | v[72]? | f[91]? | v[116]? | f[24]? | v[160]? | f[142]? |
| v[29]? | f[165]? | v[73]? | f[121]? | v[117]? | f[54]? | v[161]? | f[27]? |
| v[30]? | f[25]? | v[74]? | f[151]? | v[118]? | f[84]? | v[162]? | f[57]? |
| v[31]? | f[55]? | v[75]? | f[11]? | v[119]? | f[114]? | v[163]? | f[87]? |
| v[32]? | f[85]? | v[76]? | f[41]? | v[120]? | f[144]? | v[164]? | f[117]? |
| v[33]? | f[115]? | v[77]? | f[71]? | v[121]? | f[19]? | v[165]? | f[147]? |
| v[34]? | f[145]? | v[78]? | f[101]? | v[122]? | f[49]? | v[166]? | f[17]? |
| v[35]? | f[3]? | v[79]? | f[131]? | v[123]? | f[79]? | v[167]? | f[47]? |
| v[36]? | f[33]? | v[80]? | f[161]? | v[124]? | f[109]? | v[168]? | f[77]? |
| v[37]? | f[63]? | v[81]? | f[21]? | v[125]? | f[139]? | v[169]? | f[107]? |
| v[38]? | f[93]? | v[82]? | f[51]? | v[126]? | f[169]? | v[170]? | f[137]? |
| v[39]? | f[123]? | v[83]? | f[81]? | v[127]? | f[9]? | v[171]? | f[167]? |
| v[40]? | f[153]? | v[84]? | f[111]? | v[128]? | f[39]? | ? | ? |
| v[41]? | f[13]? | v[85]? | f[141]? | v[129]? | f[69]? | ? | ? |
| v[42]? | f[43]? | v[86]? | f[171]? | v[130]? | f[99]? | ? | ? |
| v[43]? | f[73]? | v[87]? | f[6]? | v[131]? | f[129]? | ? | ? |
Table 2
The physical channel mapping:
HS-SCCH takies 2 physical channels, and the output sequence after the physical channel mapping is u
i(i=0,1,2...175), the bit corresponding relation of sequence and physical channel mapping back sequence was as shown in table 3 after HS-SCCH interweaved.
| Output | Input | Output | Input | Output | Input | Output | Input |
| u[0]? | v[0]? | u[44]? | ? | u[88]? | v[171]? | u[132]? | ?v[87]? |
| u[1]? | v[2]? | u[45]? | ? | u[89]? | v[170]? | u[133]? | ?v[85]? |
| u[2]? | v[4]? | u[46]? | ? | u[90]? | v[169]? | u[134]? | ?v[83]? |
| u[3]? | v[6]? | u[47]? | ? | u[91]? | v[168]? | u[135]? | ?v[81]? |
| u[4]? | v[8]? | u[48]? | v[88]? | u[92]? | v[167]? | u[136]? | ?v[79]? |
| u[5]? | v[10]? | u[49]? | v[90]? | u[93]? | v[165]? | u[137]? | ?v[77]? |
| u[6]? | v[12]? | u[50]? | v[92]? | u[94]? | v[163]? | u[138]? | ?v[75]? |
| u[7]? | v[14]? | u[51]? | v[94]? | u[95]? | V[161]? | u[139]? | ?v[73]? |
| u[8]? | v[16]? | u[52]? | v[96]? | u[96]? | v[159]? | u[140]? | ?v[71]? |
| u[9]? | v[18]? | u[53]? | v[98]? | u[97]? | v[157]? | u[141]? | ?v[69]? |
| u[10]? | v[20]? | u[54]? | v[100]? | u[98]? | v[155]? | u[142]? | ?v[67]? |
| u[11]? | v[22]? | u[55]? | v[102]? | u[99]? | v[153]? | u[143]? | ?v[65]? |
| u[12]? | v[24]? | u[56]? | v[104]? | u[100]? | v[151]? | u[144]? | ?v[63]? |
| u[13]? | v[26]? | u[57]? | v[106]? | u[101]? | v[149]? | u[145]? | ?v[61]? |
| u[14]? | v[28]? | u[58]? | v[108]? | u[102]? | v[147]? | u[146]? | ?v[59]? |
| u[15]? | v[30]? | u[59]? | v[110]? | u[103]? | v[145]? | u[147]? | ?v[57]? |
| u[16]? | v[32]? | u[60]? | v[112]? | u[104]? | v[143]? | u[148]? | ?v[55]? |
| u[17]? | v[34]? | u[61]? | v[114]? | u[105]? | v[141]? | u[149]? | ?v[53]? |
| u[18]? | v[36]? | u[62]? | v[116]? | u[106]? | v[139]? | u[150]? | ?v[51]? |
| u[19]? | v[38]? | u[63]? | v[118]? | u[107]? | v[137]? | u[151]? | ?v[49]? |
| u[20]? | v[40]? | u[64]? | v[120]? | u[108]? | v[135]? | u[152]? | v[47]? |
| u[21]? | v[42]? | u[65]? | v[122]? | u[109]? | v[133]? | u[153]? | v[45]? |
| u[22]? | v[44]? | u[66]? | v[124]? | u[110]? | v[131]? | u[154]? | v[43]? |
| u[23]? | v[46]? | u[67]? | v[126]? | u[111]? | v[129]? | u[155]? | v[41]? |
| u[24]? | v[48]? | u[68]? | v[128]? | u[112]? | v[127]? | u[156]? | v[39]? |
| u[25]? | v[50]? | u[69]? | v[130]? | u[113]? | v[125]? | u[157]? | v[37]? |
| u[26]? | v[52]? | u[70]? | v[132]? | u[114]? | v[123]? | u[158]? | v[35]? |
| u[27]? | v[54]? | u[71]? | v[134]? | u[115]? | v[121]? | u[159]? | v[33]? |
| u[28]? | v[56]? | u[72]? | v[136]? | u[116]? | v[119]? | u[160]? | v[31]? |
| u[29]? | v[58]? | u[73]? | v[138]? | u[117]? | v[117]? | u[161]? | v[29]? |
| u[30]? | v[60]? | u[74]? | v[140]? | u[118]? | v[115]? | u[162]? | v[27]? |
| u[31]? | v[62]? | u[75]? | v[142]? | u[119]? | v[113]? | u[163]? | v[25]? |
| u[32]? | v[64]? | u[76]? | v[144]? | u[120]? | v[111]? | u[164]? | v[23]? |
| u[33]? | v[66]? | u[77]? | v[146]? | u[121]? | v[109]? | u[165]? | v[21]? |
| u[34]? | v[68]? | u[78]? | v[148]? | u[122]? | v[107]? | u[166]? | v[19]? |
| u[35]? | v[70]? | u[79]? | v[150]? | u[123]? | v[105]? | u[167]? | v[17]? |
| u[36]? | v[72]? | u[80]? | v[152]? | u[124]? | v[103]? | u[168]? | v[15]? |
| u[37]? | v[74]? | u[81]? | v[154]? | u[125]? | v[101]? | u[169]? | v[13]? |
| u[38]? | v[76]? | u[82]? | v[156]? | u[126]? | v[99]? | u[170]? | v[11]? |
| u[39]? | v[78]? | u[83]? | v[158]? | u[127]? | v[97]? | u[171]? | v[9]? |
| u[40]? | v[80]? | u[84]? | v[160]? | u[128]? | v[95]? | u[172]? | v[7]? |
| u[41]? | v[82]? | u[85]? | v[162]? | u[129]? | v[93]? | u[173]? | v[5]? |
| u[42]? | v[84]? | u[86]? | v[164]? | u[130]? | v[91]? | u[174]? | v[3]? |
| u[43]? | v[86]? | u[87]? | v[166]? | u[131]? | v[89]? | u[175]? | v[1]? |
Table 3
By above-mentioned cataloged procedure as can be seen, the bit number of HS-SCCH is certain, and the bit number after the convolutional encoding also is certain, data after the convolutional encoding through rate-matched, interweave, the position after the physical channel mapping all fixes.Therefore, can derive the bit corresponding relation of separating physical channel mapping presequence (176 bit) and deconvolution coding presequence (162 bit) according to table 1, table 2, table 3, as shown in table 4.
| Output | Input | Output | Input | Output | Input | Output | Input |
| c[0]? | u[0]+u[141]? | c[41]? | u[120]? | c[82]? | u[33]? | c[123]? | u[136]? |
| c[1]? | u[76]? | c[42]? | u[163]? | c[83]? | u[108]? | c[124]? | u[75]? |
| c[2]? | u[158]? | c[43]? | u[51]? | c[84]? | u[174]? | c[125]? | u[153]? |
| c[3]? | u[56]? | c[44]? | u[92]? | c[85]? | u[36]? | c[126]? | u[61]? |
| c[4]? | u[9]? | c[45]? | u[146]? | c[86]? | u[102]? | c[127]? | u[14]? |
| c[5]? | u[132]? | c[46]? | u[65]? | c[87]? | u[19]? | c[128]? | u[127]? |
| c[6]? | u[79]? | c[47]? | u[172]? | c[88]? | u[122]? | c[129]? | u[89]+u[31]? |
| c[7]? | u[26]? | c[48]? | u[41]+u[97]? | c[89]? | u[165]? | c[130]? | u[113]? |
| c[8]? | u[112]? | c[49]? | u[24]? | c[90]? | u[49]? | c[131]? | u[5]? |
| c[9]? | u[6]? | c[50]? | u[117]? | c[91]? | u[99]? | c[132]? | u[133]? |
| c[10]? | u[138]? | c[51]? | u[160]? | c[92]? | u[148]? | c[133]? | u[84]? |
| c[11]? | u[73]? | c[52]? | u[54]? | c[93]? | u[69]? | c[134]? | u[150]? |
| c[12]? | u[155]? | c[53]? | u[85]? | c[94]? | u[168]? | c[135]? | u[64]? |
| c[13]? | u[59]? | c[54]? | u[143]? | c[95]? | u[39]? | c[136]? | u[17]? |
| c[14]? | u[12]? | c[55]? | u[71]? | c[96]? | u[105]? | c[137]? | u[124]? |
| c[15]? | u[129]? | c[56]? | u[1]? | c[97]? | u[22]+u[119]? | c[138]? | u[93]? |
| c[16]? | u[87]+u[29]? | c[57]? | u[140]? | c[98]? | u[162]? | c[139]? | u[34]? |
| c[17]? | u[115]? | c[58]? | u[77]? | c[99]? | u[52]? | c[140]? | u[107]? |
| c[18]? | u[3]? | c[59]? | u[157]? | c[100]? | u[90]? | c[141]? | u[173]? |
| c[19]? | u[135]? | c[60]? | u[57]? | c[101]? | u[145]? | c[142]? | u[37]? |
| c[20]? | u[82]? | c[61]? | u[10]? | c[102]? | u[66]? | c[143]? | u[101]? |
| c[21]? | u[152]? | c[62]? | u[131]? | c[103]? | u[171]? | c[144]? | u[20]? |
| c[22]? | u[62]? | c[63]? | u[80]? | c[104]? | u[42]? | c[145]? | u[121]+u[164]? |
| c[23]? | u[15]? | c[64]? | u[27]+u[111]? | c[105]? | u[96]? | c[146]? | u[50]? |
| c[24]? | u[126]? | c[65]? | u[7]? | c[106]? | u[25]? | c[147]? | u[98]? |
| c[25]? | u[95]? | c[66]? | u[137]? | c[107]? | u[116]? | c[148]? | u[147]? |
| c[26]? | u[32]? | c[67]? | u[74]? | c[108]? | u[159]? | c[149]? | u[70]? |
| c[27]? | u[109]? | c[68]? | u[154]? | c[109]? | u[55]? | c[150]? | u[167]? |
| c[28]? | u[175]? | c[69]? | u[60]? | c[110]? | u[86]? | c[151]? | u[40]? |
| c[29]? | u[35]? | c[70]? | u[13]? | c[111]? | u[142]? | c[152]? | u[104]? |
| c[30]? | u[103]? | c[71]? | u[128]? | c[112]? | u[72]? | c[153]? | u[23]? |
| c[31]? | u[18]? | c[72]? | u[91]? | c[113]? | u[2]+u[139]? | c[154]? | u[118]? |
| c[32]? | u[123]+u[166]? | c[73]? | u[30]? | c[114]? | u[78]? | c[155]? | u[161]? |
| c[33]? | u[48]? | c[74]? | u[114]? | c[115]? | u[156]? | c[156]? | u[53]? |
| c[34]? | u[100]? | c[75]? | u[4]? | c[116]? | u[58]? | c[157]? | u[88]? |
| c[35]? | u[149]? | c[76]? | u[134]? | c[117]? | u[11]? | c[158]? | u[144]? |
| c[36]? | u[68]? | c[77]? | u[83]? | c[118]? | u[130]? | c[159]? | u[67]? |
| c[37]? | u[169]? | c[78]? | u[151]? | c[119]? | u[81]? | c[160]? | u[170]? |
| c[38]? | u[38]? | c[79]? | u[63]? | c[120]? | u[28]? | c[161]? | u[43]? |
| c[39]? | u[106]? | c[80]? | u[16]? | c[121]? | u[110]? | ? | ? |
| c[40]? | u[21]? | c[81]? | u[125]+u[94]? | c[122]? | u[8]? | ? | ? |
Table 4
The present invention utilizes HS-SCCH to separate to conciliate before the physical channel mapping the unique characteristic of bit corresponding relation before the convolution code, and standard operation is converted to the computing of tabling look-up, can the effective simplification algorithm, improve decoding speed.Particularly, be that table 4 is stored among the UE in advance, after UE receives HS-SCCH, earlier HS-SCCH is carried out demodulation, obtain the u of 176 bits
i, then according to table 4, with u
iCorrespond to c by turn
iIn.Wherein, the recurrence of 10 bits is arranged during owing to rate-matched, therefore, in table 4, have the u of 2 bits
iCorresponding c with 1 bit
iSituation, when adopting look-up method decoding of the present invention, need special processing, be about to the u of 2 bits
iCorrespond to c after the addition
iIn.
Below provide 2 and use the specific embodiment that above-mentioned look-up method carries out the HS-SCCH decoding.
Embodiment 1
With reference to Fig. 2, the HS-SCCH decode procedure mainly comprises the steps:
Embodiment 2
With reference to Fig. 2, the HS-SCCH decode procedure mainly comprises the steps:
In embodiment 1,2, for the HS-SCCH sequence after the demodulation, need not obtain sequence before the deconvolution sign indicating number of the HS-SCCH sequence correspondence after the described demodulation according to the mathematical formulae of separating physical channel mapping, deinterleaving, separating rate-matched, but finish by computation of table lookup, flow process is simple, the decoding efficiency height can the effective simplification algorithm, improves decoding speed.
The difference of embodiment 1,2 is to obtain the preceding sequence of deconvolution sign indicating number processing procedure afterwards.Among the embodiment 1,, carry out the deconvolution sign indicating number earlier, again CRC is removed the UEID influence, and then carry out CRC check for the sequence before the deconvolution sign indicating number that obtains of tabling look-up.Among the embodiment 2, before the deconvolution sign indicating number, remove the UEID influence, and then carry out deconvolution sign indicating number and CRC check, so, can the effective simplification algorithm, further improve decoding speed.
In addition, as previously mentioned, the recurrence of 10 bits is arranged during owing to rate-matched, therefore, in table 4, have the u of 2 bits
iCorresponding c with 1 bit
iSituation, when adopting look-up method decoding of the present invention, need special processing, be about to the u of 2 bits
iCorrespond to c after the addition
iIn.When specific implementation, table 4 can also be resolved into two tables (table 5, table 6), constitute the look-up table of HS-SCCH decoding jointly by table 5 and table 6.Wherein, table 5 is terminal 162 bit look-up tables, and table 6 needs the look-up table of 10 bit positions in list entries and output sequence of special processing for terminal, and is as follows:
| Output | Input | Output | Input | Output | Input | Output | Input |
| ?c’[0]? | u[0]? | c’[41]? | u[120]? | c’[82]? | u[33]? | c’[123]? | u[136]? |
| ?c’[1]? | u[76]? | c’[42]? | u[163]? | c’[83]? | u[108]? | c’[124]? | u[75]? |
| ?c’[2]? | u[158]? | c’[43]? | u[51]? | c’[84]? | u[174]? | c’[125]? | u[153]? |
| ?c’[3]? | u[56]? | c’[44]? | u[92]? | c’[85]? | u[36]? | c’[126]? | u[61]? |
| ?c’[4]? | u[9]? | c’[45]? | u[146]? | c’[86]? | u[102]? | c’[127]? | u[14]? |
| ?c’[5]? | u[132]? | c’[46]? | u[65]? | c’[87]? | u[19]? | c’[128]? | u[127]? |
| ?c’[6]? | u[79]? | c’[47]? | u[172]? | c’[88]? | u[122]? | c’[129]? | u[89]? |
| ?c’[7]? | u[26]? | c’[48]? | u[41]? | c’[89]? | u[165]? | c’[130]? | u[113]? |
| ?c’[8]? | u[112]? | c’[49]? | u[24]? | c’[90]? | u[49]? | c’[131]? | u[5]? |
| ?c’[9]? | u[6]? | c’[50]? | u[117]? | c’[91]? | u[99]? | c’[132]? | u[133]? |
| ?c’[10]? | u[138]? | c’[51]? | u[160]? | c’[92]? | u[148]? | c’[133]? | u[84]? |
| ?c’[11]? | u[73]? | c’[52]? | u[54]? | c’[93]? | u[69]? | c’[134]? | u[150]? |
| ?c’[12]? | u[155]? | c’[53]? | u[85]? | c’[94]? | u[168]? | c’[135]? | u[64]? |
| ?c’[13]? | u[59]? | c’[54]? | u[143]? | c’[95]? | u[39]? | c’[136]? | u[17]? |
| ?c’[14]? | u[12]? | c’[55]? | u[71]? | c’[96]? | u[105]? | c’[137]? | u[124]? |
| ?c’[15]? | u[129]? | c’[56]? | u[1]? | c’[97]? | u[22]? | c’[138]? | u[93]? |
| ?c’[16]? | u[87]? | c’[57]? | u[140]? | c’[98]? | u[162]? | c’[139]? | u[34]? |
| ?c’[17]? | u[115]? | c’[58]? | u[77]? | c’[99]? | u[52]? | c’[140]? | u[107]? |
| ?c’[18]? | u[3]? | c’[59]? | u[157]? | c’[100]? | u[90]? | c’[141]? | u[173]? |
| ?c’[19]? | u[135]? | c’[60]? | u[57]? | c’[101]? | u[145]? | c’[142]? | u[37]? |
| ?c’[20]? | u[82]? | c’[61]? | u[10]? | c’[102]? | u[66]? | c’[143]? | u[101]? |
| ?c’[21]? | u[152]? | c’[62]? | u[131]? | c’[103]? | u[171]? | c’[144]? | u[20]? |
| ?c’[22]? | u[62]? | c’[63]? | u[80]? | c’[104]? | u[42]? | c’[145]? | u[121]? |
| ?c’[23]? | u[15]? | c’[64]? | u[27]? | c’[105]? | u[96]? | c’[146]? | u[50]? |
| ?c’[24]? | u[126]? | c’[65]? | u[7]? | c’[106]? | u[25]? | c’[147]? | u[98]? |
| ?c’[25]? | u[95]? | c’[66]? | u[137]? | c’[107]? | u[116]? | c’[148]? | u[147]? |
| ?c’[26]? | u[32]? | c’[67]? | u[74]? | c’[108]? | u[159]? | c’[149]? | u[70]? |
| ?c’[27]? | u[109]? | c’[68]? | u[154]? | c’[109]? | u[55]? | c’[150]? | u[167]? |
| ?c’[28]? | u[175]? | c’[69]? | u[60]? | c’[110]? | u[86]? | c’[151]? | u[40]? |
| ?c’[29]? | u[35]? | c’[70]? | u[13]? | c’[111]? | u[142]? | c’[152]? | u[104]? |
| ?c’[30]? | u[103]? | c’[71]? | u[128]? | c’[112]? | u[72]? | c’[153]? | u[23]? |
| ?c’[31]? | u[18]? | c’[72]? | u[91]? | c’[113]? | u[2]? | c’[154]? | u[118]? |
| ?c’[32]? | u[123]? | c’[73]? | u[30]? | c’[114]? | u[78]? | c’[155]? | u[161]? |
| ?c’[33]? | u[48]? | c’[74]? | u[114]? | c’[115]? | u[156]? | c’[156]? | u[53]? |
| ?c’[34]? | u[100]? | c’[75]? | u[4]? | c’[116]? | u[58]? | c’[157]? | u[88]? |
| c’[35]? | u[149]? | c’[76]? | u[134]? | c’[117]? | u[11]? | c’[158]? | u[144]? |
| c’[36]? | u[68]? | c’[77]? | u[83]? | c’[118]? | u[130]? | c’[159]? | u[67]? |
| c’[37]? | u[169]? | c’[78]? | u[151]? | c’[119]? | u[81]? | c’[160]? | u[170]? |
| c’[38]? | u[38]? | c’[79]? | u[63]? | c’[120]? | u[28]? | c’[161]? | u[43]? |
| c’[39]? | u[106]? | c’[80]? | u[16]? | c’[121]? | u[110]? | ? | ? |
| c’[40]? | u[21]? | c’[81]? | u[125]? | c’[122]? | u[8]? | ? | ? |
Table 5
| The output sequence position | The list entries position |
| 0? | 141? |
| 16? | 29? |
| 32? | 166? |
| 48? | 97? |
| 64? | 111? |
| 81? | 94? |
| 97? | 119? |
| 113? | 139? |
| 129? | 31? |
| 145? | 164? |
Table 6
According to table 5, table 6, a kind of specific implementation of above-mentioned steps 202,302 is: 176 bit u that obtain for demodulation
i, according to table 5, do a circulation of 162 times, from 176 bits, choose corresponding bits, output to intermediate object program sequence c '
iFor 10 bits that need addition, do a circulation of 10 times, according to table 6 the 2nd column position from list entries u
iTake out corresponding bits, the position is from the middle c ' of sequence as a result shown in being listed as according to table 6 the 1st again
iTake out corresponding bits, deposit back c ' after the addition
i, the c ' of this moment
iBe the preceding sequence c of rate-matched
i
Should be noted that at last, above embodiment is only unrestricted in order to technical scheme of the present invention to be described, those of ordinary skill in the art is to be understood that, can make amendment or be equal to replacement technical scheme of the present invention, and not breaking away from the spiritual scope of technical solution of the present invention, it all should be encompassed in the middle of the claim scope of the present invention.
Claims (3)
1. the coding/decoding method of a high-speed shared control channel HS-SCCH is used for the high-speed downlink packet access HSDPA of TD SDMA TD-SCDMA system, it is characterized in that described method comprises:
A, pre-storing high-speed shared control channel HS-SCCH decoding separates the bit mapping table before the reconciliation convolution code before the physical channel mapping on terminal;
B, according to described bit mapping table, the high-speed shared control channel HS-SCCH sequence after the demodulation is carried out correspondence by bit, obtain the sequence before the pairing deconvolution sign indicating number of high-speed shared control channel HS-SCCH sequence after the described demodulation.
2. method according to claim 1 is characterized in that, also comprises after the step B:
Terminal iidentification UEID is carried out convolutional encoding, the back 72 bit moulds two of the sequence before the described deconvolution sign indicating number are added sequence after the terminal iidentification UEID convolutional encoding, obtain removing the sequence after the terminal iidentification UEID influence;
Sequence after the described removal terminal iidentification UEID influence is carried out the deconvolution sign indicating number;
Sequence behind the deconvolution sign indicating number is carried out CRC check, and after the CRC check success, the sequence behind the deconvolution sign indicating number is removed CRC tail bit;
Sequence behind the removal CRC tail bit is carried out demultiplexing.
3. method according to claim 1 is characterized in that, also comprises after the step B:
Sequence before the described deconvolution sign indicating number is carried out the deconvolution sign indicating number;
The back 16 bit moulds two of the sequence behind the deconvolution sign indicating number are added terminal iidentification UEID, obtain removing the sequence after terminal iidentification UEID influences;
The sequence of removing after terminal iidentification UEID influences is carried out CRC check, and after the CRC check success, the sequence of removing after terminal iidentification UEID influences is removed CRC tail bit;
Sequence behind the removal CRC tail bit is carried out demultiplexing.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200810104027XA CN101252371B (en) | 2008-04-14 | 2008-04-14 | Decoding method of high speed sharing control channel |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200810104027XA CN101252371B (en) | 2008-04-14 | 2008-04-14 | Decoding method of high speed sharing control channel |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101252371A CN101252371A (en) | 2008-08-27 |
| CN101252371B true CN101252371B (en) | 2010-12-15 |
Family
ID=39955572
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN200810104027XA Expired - Fee Related CN101252371B (en) | 2008-04-14 | 2008-04-14 | Decoding method of high speed sharing control channel |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101252371B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103312436B (en) * | 2012-03-09 | 2016-12-14 | 鼎桥通信技术有限公司 | The processing method of TD-SCDMA coding and equipment |
| CN103312437B (en) * | 2012-03-09 | 2016-12-28 | 鼎桥通信技术有限公司 | TD SCDMA little business interpretation method and device |
| CN103378942A (en) * | 2012-04-17 | 2013-10-30 | 马维尔国际有限公司 | Coding/decoding method and coding/decoding device for downlink control channel of multi-carrier system |
| US20160286534A1 (en) * | 2015-03-23 | 2016-09-29 | Qualcomm Incorporated | Early determination in high-speed shared control channel decoding |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1430361A (en) * | 2001-12-30 | 2003-07-16 | 华为技术有限公司 | Data transmission control method of downgoing high speed shared channel in high speed data insertion system |
| WO2005041465A1 (en) * | 2003-10-09 | 2005-05-06 | Telefonaktiebolaget L M Ericson (Publ) | Adaptive thereshold for hs-scch part 1 decoding |
-
2008
- 2008-04-14 CN CN200810104027XA patent/CN101252371B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1430361A (en) * | 2001-12-30 | 2003-07-16 | 华为技术有限公司 | Data transmission control method of downgoing high speed shared channel in high speed data insertion system |
| WO2005041465A1 (en) * | 2003-10-09 | 2005-05-06 | Telefonaktiebolaget L M Ericson (Publ) | Adaptive thereshold for hs-scch part 1 decoding |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101252371A (en) | 2008-08-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107046453B (en) | Method, device and system for determining transmission parameters of data sharing channel | |
| CN106160937B (en) | A kind of method and device for realizing code block segmentation | |
| CN101931485B (en) | Method and device for generating dedicated reference signal (DRS) | |
| CN105812107B (en) | Data packet processing method and device in OFDMA system | |
| CN101505180B (en) | CSI reference signal bearing method and apparatus in long term evolution system | |
| JP5468606B2 (en) | Resource block mapping of symbols with repeated overlap | |
| CN102404076B (en) | Information sending and blind-detecting method and equipment | |
| CN102891746B (en) | A kind of method for wireless communications and device | |
| KR102696834B1 (en) | Multiple access method, and corresponding transmission method, receiver and transmitter | |
| CN102237953B (en) | LTE (Long Term Evolution) PDSCH (Physical Downlink Shared Channel) rate de-matching method and device | |
| CN107040489A (en) | The method and apparatus for sending and receiving narrow band sync signal | |
| CN103444145B (en) | Method and device for data transmission | |
| CN107113103B (en) | Method and device for transmitting indication information | |
| WO2008115020A1 (en) | Method for mapping physical downlink control channel to resources and apparatus for transmitting/receiving the mapped physical downlink control channel in a wireless communication system | |
| US20100142630A1 (en) | Multicarrier transmitting apparatus, multicarrier receiving apparatus, and their methods | |
| CN105765983A (en) | Apparatus for transmitting broadcast signals, apparatus for receiving broadcast signals, method for transmitting broadcast signals and method for receiving broadcast signals | |
| CN105281868A (en) | Sending method based on code block grouping and apparatus thereof | |
| CN101252371B (en) | Decoding method of high speed sharing control channel | |
| CN103248598B (en) | Communication method, base station and user equipment | |
| CN101841390A (en) | Transmission channel coding and multiplexing method and bit level processor | |
| CA2646693C (en) | Method and system for subband indicator signalling | |
| EP3373674B1 (en) | Data processing method and apparatus | |
| CN107210838A (en) | Base station apparatus and terminal installation | |
| CN108964864A (en) | Non-orthogonal pilot and method for transmitting signals in a kind of SCMA multi-address system | |
| CN108631938B (en) | Multi-access method, transmitter and receiver |
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: 20101215 Termination date: 20180414 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |