3GPP36212860中文_第1页
3GPP36212860中文_第2页
3GPP36212860中文_第3页
3GPP36212860中文_第4页
3GPP36212860中文_第5页
已阅读5页,还剩52页未读 继续免费阅读

下载本文档

版权说明:本文档由用户提供并上传,收益归属内容提供方,若内容存在侵权,请进行举报或认领

文档简介

1、3GPP TS 36.212 V8.6.0 (2009-03)Technical Specification3rd Generation Partnership Project;Technical Specification Group Radio Access Network;Evolved Universal Terrestrial Radio Access (E-UTRA);Multiplexing and channel coding(Release 8)The present document has been developed within the 3rd Generation

2、Partnership Project (3GPP TM) and may be further elaborated for the purposes of 3GPP.The present document has not been subject to any approval process by the 3GPP Organizational Partners and shall not be implemented.This Specification is provided for future development work within 3GPP only. The Org

3、anizational Partners accept no liability for any use of this Specification.Specifications and reports for implementation of the 3GPP TM system should be obtained via the 3GPP Organizational Partners Publications Offices.Keywords<keyword, keyword>3GPPPostal address3GPP support office address650

4、 Route des Lucioles Sophia AntipolisValbonne FranceTel. : +33 4 92 94 42 00 Fax : +33 4 93 65 47 16InternetCopyright NotificationNo part may be reproduced except as authorized by written permission.The copyright and the foregoing restriction extend to reproduction in all media.© 2009,

5、 3GPP Organizational Partners (ARIB, ATIS, CCSA, ETSI, TTA, TTC).All rights reserved.UMTS is a Trade Mark of ETSI registered for the benefit of its members3GPP is a Trade Mark of ETSI registered for the benefit of its Members and of the 3GPP Organizational PartnersLTE is a Trade Mark of ETSI current

6、ly being registered for the benefit of its Members and of the 3GPP Organizational PartnersGSM® and the GSM logo are registered and owned by the GSM AssociationContentsForeword51Scope62References63Definitions, symbols and abbreviations63.1 Definitions63.2Symbols63.3 Abbreviations74Mapping to phy

7、sical channels74.1Uplink74.2Downlink85Channel coding, multiplexing and interleaving85.1Generic procedures8CRC calculation8Code block segmentation and code block CRC attachment9Channel coding10Tail biting convolutional coding11Turbo coding12Turbo encoder12Trellis termination for turbo encoder13Turbo

8、code internal interleaver13Rate matching15Rate matching for turbo coded transport channels15Sub-block interleaver15Bit collection, selection and transmission16Rate matching for convolutionally coded transport channels and control information18Sub-block interleaver18Bit collection, selection and tran

9、smission19Code block concatenation205.2Uplink transport channels and control information20Random access channel20Uplink shared channel20Transport block CRC attachment21Code block segmentation and code block CRC attachment22Channel coding of UL-SCH22Rate matching22Code block concatenation225.2.2.6 Ch

10、annel coding of control information22Channel quality information formats for wideband CQI reports27Channel quality information formats for higher layer configured subband CQI reports28Channel quality information formats for UE selected subband CQI reports28Channel coding for CQI/PMI information in P

11、USCH295.2.2.7 Data and control multiplexing305.2.2.8 Channel interleaver31Uplink control information on PUCCH33Channel coding for UCI HARQ-ACK33Channel coding for UCI scheduling request33Channel coding for UCI channel quality information33Channel quality information formats for wideband reports34Cha

12、nnel quality information formats for UE-selected sub-band reports35Channel coding for UCI channel quality information and HARQ-ACK36Uplink control information on PUSCH without UL-SCH data375.2.4.1 Channel coding of control information375.2.4.2 Control information mapping385.2.4.3 Channel interleaver

13、385.3Downlink transport channels and control information38Broadcast channel38Transport block CRC attachment39Channel coding395.3.1.3 Rate matching40Downlink shared channel, Paging channel and Multicast channel40Transport block CRC attachment41Code block segmentation and code block CRC attachment41Ch

14、annel coding41Rate matching41Code block concatenation41Downlink control information42DCI formats42Format 042Format 143Format 1A44Format 1B46Format 1C47Format 1D47Format 248Format 2A52Format 354Format 3A54CRC attachment55Channel coding55Rate matching55Control format indicator55Channel coding56HARQ in

15、dicator56Channel coding56Annex A (informative):Change history58ForewordThis Technical Specification has been produced by the 3rd Generation Partnership Project (3GPP).The contents of the present document are subject to continuing work within the TSG and may change following formal TSG approval. Shou

16、ld the TSG modify the contents of the present document, it will be re-released by the TSG with an identifying change of release date and an increase in version number as follows:where:xthe first digit:1presented to TSG for information;2presented to TSG for approval;3or greater indicates TSG approved

17、 document under change control.Ythe second digit is incremented for all changes of substance, i.e. technical enhancements, corrections, updates, etc.zthe third digit is incremented when editorial only changes have been incorporated in the document.1ScopeThe present document specifies the coding, mul

18、tiplexing and mapping to physical channels for E-UTRA.2ReferencesThe following documents contain provisions which, through reference in this text, constitute provisions of the present document.· References are either specific (identified by date of publication, edition number, version number, e

19、tc.) or nonspecific.· For a specific reference, subsequent revisions do not apply.· For a non-specific reference, the latest version applies. In the case of a reference to a 3GPP document (including a GSM document), a non-specific reference implicitly refers to the latest version of that d

20、ocument in the same Release as the present document.13GPP TR 21.905: "Vocabulary for 3GPP Specifications".23GPP TS 36.211: "Evolved Universal Terrestrial Radio Access (E-UTRA); Physical channels and modulation".33GPP TS 36.213: "Evolved Universal Terrestrial Radio Access (E-

21、UTRA); Physical layer procedures".43GPP TS 36.306: "Evolved Universal Terrestrial Radio Access (E-UTRA); User Equipment (UE) radio access capabilities".53GPP TS36.321, “Evolved Universal Terrestrial Radio Access (E-UTRA); Medium Access Control (MAC) protocol specification” 3Definition

22、s, symbols and abbreviations3.1 DefinitionsFor the purposes of the present document, the terms and definitions given in 1 and the following apply. A term defined in the present document takes precedence over the definition of the same term, if any, in 1.Definition format<defined term>: <def

23、inition>.3.2SymbolsFor the purposes of the present document, the following symbols apply:Downlink bandwidth configuration, expressed in number of resource blocks 2Uplink bandwidth configuration, expressed in number of resource blocks 2Number of SC-FDMA symbols carrying PUSCH in a subframeNumber o

24、f SC-FDMA symbols carrying PUSCH in the initial PUSCH transmission subframeNumber of SC-FDMA symbols in an uplink slot Number of SC-FDMA symbols used for SRS transmission in a subframe (0 or 1). 3.3 AbbreviationsFor the purposes of the present document, the following abbreviations apply:BCHBroadcast

25、 channelCFIControl Format IndicatorCPCyclic PrefixDCIDownlink Control InformationDL-SCHDownlink Shared channelFDDFrequency Division DuplexingHIHARQ indicatorMCHMulticast channelPBCHPhysical Broadcast channelPCFICHPhysical Control Format Indicator channelPCHPaging channelPDCCH Physical Downlink Contr

26、ol channelPDSCHPhysical Downlink Shared channelPHICHPhysical HARQ indicator channelPMCHPhysical Multicast channelPMIPrecoding Matrix IndicatorPRACHPhysical Random Access channelPUCCHPhysical Uplink Control channelPUSCHPhysical Uplink Shared channelRACHRandom Access channelRIRank IndicationSRSSoundin

27、g Reference SignalTDDTime Division DuplexingTPMITransmitted Precoding Matrix IndicatorUCIUplink Control InformationUL-SCHUplink Shared channel4物理信道映射4.1上行表4.1-1给出了上行传输信道和相应的物理信道间的映射关系。表4.1-2给出了上行控制信道信息和相应物理信道间的映射关系。Table 4.1-1TrCHPhysical ChannelUL-SCHPUSCHRACHPRACHTable 4.1-2Control informationPhys

28、ical ChannelUCIPUCCH, PUSCH4.2下行表4.2-1给出了下行传输信道和相应的物理信道间的映射关系。表4.2-2给出了下行控制信道信息和相应物理信道间的映射关系。Table 4.2-1TrCHPhysical ChannelDL-SCHPDSCHBCHPBCHPCHPDSCHMCHPMCHTable 4.2-2Control informationPhysical ChannelCFIPCFICHHIPHICHDCIPDCCH5信道编码、复用和交织对来自/传送到MAC层的数据和控制流进行编码/译码,以提供承载在无线传输链路上的传输和控制服务。信道编码方案由以下几部分组合

29、而成:检错,纠错,速率匹配,交织和传输信道或控制信息到物理信道的映射/物理信道到传输信道或控制信息的解映射。5.1通用流程这一节包含了各种传输信道或控制信息类型用到的编码流程。5.1.1CRC 计算用表示CRC计算模块的输入,表示校验比特。A是输入序列的长度,L是校验比特的个数。校验比特由下面的某一个循环生成多项式计算得到:-gCRC24A(D) = D24 + D23 + D18 + D17 + D14 + D11 + D10 + D7 + D6 + D5 + D4 + D3 + D + 1 和-gCRC24B(D) = D24 + D23 + D6 + D5 + D + 1 用于 CRC长

30、度 L = 24。-gCRC16(D) = D16 + D12 + D5 + 1 用于 CRC长度 L = 16。-gCRC8(D) = D8 + D7 + D4 + D3 + D + 1 用于 CRC长度L = 8。编码以系统码的形式进行,这意谓着在GF(2)中,多项式:可以被相应的长度24的CRC生成多项式gCRC24A(D) 或gCRC24B(D) 整除;也有,多项式:可以被相应的长度16的CRC生成多项式gCRC16(D)整除;也有,多项式:可以被相应的长度8的CRC生成多项式gCRC8(D) 整除。CRC添加后的比特表示为,其中,B = A+ L。ak 和bk 间的关系为: for

31、k = 0, 1, 2, , A-1for k = A, A+1, A+2,., A+L-1.5.1.2码块分割和码块CRC添加用于码块分割的输入比特序列表示为,其中B > 0。如果B大于最大码块长度Z,则需要对输入的比特序列进行分割,对每个码块添加L = 24比特CRC序列。最大码块长度为:-Z = 6144.如果由下面计算得到的填充比特的个数不等于0,则将填充比特添加在第一个块的开始。注意,如果B<40,填充比特直接添加到码块的开始。输入编码器的填充比特应该置为<NULL>。码块总个数C由下面的处理决定:if L = 0码块个数:elseL = 24码块个数:.en

32、d if对于C ¹ 0的情况,码块分割的输出比特表示为,其中,r 是码块标号,Kr 为码块r对应的总比特数。每个码块的比特数由下面的处理决定(仅适用于C ¹ 0的情况):第一个分割大小:= 表-3 中满足 的最小的K值。if 长度为 的码块个数为 =1,else if 第二个分割大小:= 表 -3 中满足 的最大的K值。分割大小的个数:.分割大小的个数:.end if填充比特个数:for k = 0 to F-1-插入填充比特end fork = Fs = 0for r = 0 to C-1if elseend ifwhile end whileif C >1 根据节

33、的方法以及生成多项式gCRC24B(D),来计算序列 的CRC 校验比特 。计算过程中,如果有填充比特,设其值为0。whileend whileend ifend for5.1.3信道编码输入到的信道编码模块的比特序列表示为,其中, K是待编码的比特数。编码后的比特表示为,其中,D为每个输出码流的比特数,i为输出码流的索引。 和 以及K 和 D 间的关系取决于信道编码方案。下列信道编码方案可以用于传输信道:-删尾比特卷积编码;-Turbo编码。表-1给出了不同类型传输信道各自使用的编码方案和编码码率。表5.1.3-2给出了不同类型的控制信息各自使用的编码方案和编码码率。与每种编码方案相关联的D

34、值为:-码率1/3删尾比特卷积编码:D = K;-码率1/3 Turbo编码:D = K + 4.对于两种编码方案,输出比特流的索引值i的范围是0, 1, 2。Table -1: Usage of channel coding scheme and coding rate for TrCHsTrCHCoding schemeCoding rateUL-SCHTurbo coding1/3DL-SCHPCHMCHBCHTail biting convolutional coding1/3Table -2: Usage of channel coding scheme and coding rat

35、e for control informationControl InformationCoding schemeCoding rateDCITail biting convolutional coding1/3CFIBlock code1/16HIRepetition code1/3UCIBlock codevariableTail biting convolutional coding1/3.1删尾比特卷积编码编码码率等于1/3的删尾比特卷积编码的约束长度定义为7。图-1给出了卷积编码器的构成框图。编码器包括的移位寄存器的初始值应该置为输入比特流的最后6个信息比特。因此,移位寄存器的初始状

36、态和终止状态是一样的。这样,如果用表示移位寄存器,则移位寄存器的初始值应该如下设置:Figure -1: Rate 1/3 tail biting convolutional encoder图-1中,, 和分别对应输出码流的第一、第二和第三校验数据流。.2Turbo编码.2.1Turbo 编码器Turbo编码器采用并行级联卷积编码(PCCC)结构,由2个8状态成员编码器和1个Turbo码内交织器组成。编码码率为1/3。图-2给出了Turbo编码器的结构框图。PCCC中2个8状态成员编码器的转移函数为:G(D) = ,其中g0(D) = 1 + D2 + D3,g1(D) = 1 + D + D

37、3. 在开始对输入比特进行编码时,2个成员编码器的移位寄存器的初始值都应该置为0。Turbo编码器的输出为:其中 .如果要编码的是第0个码块,并且填充比特数大于0,也就是F>0,则编码器应在输入端设置ck = 0,k = 0,(F-1),在输出端设置,k = 0,(F-1) ,k = 0,(F-1)。Turbo编码器的输入比特表示为,2个成员编码器的输出分别表示为和。Turbo码的内交织器的输出比特表示为,这些比特输入到第二个8状态成员编码器。Figure -2: Structure of rate 1/3 turbo encoder (dotted lines apply for tr

38、ellis termination only).2.2Turbo编码器网格截断在所有的信息比特被编码后,从移位寄存器反馈中获取尾比特,附加在编码后的信息比特后面,以此完成网格截断。前3个尾比特用来截断第一个成员编码器(图-2中上面的开关切换到低的位置),此时第二个成员编码器被禁止。后3个尾比特用来截断第二个成员编码器(图5.1.3-2中下面的开关切换到低的位置),此时第一个成员编码器被禁止。因此,用于网格截断的传送比特应该为:, , , , , , , , , .2.3Turbo码内交织器Turbo码内交织器的输入比特表示为,其中K 是输入比特的个数。Turbo码内交织器的输出比特表示为。输入

39、和输出比特的关系如下:, i=0, 1, (K-1)其中,输出索引i 和输入索引满足下面的二次方程式:参数和依赖于块的大小K ,归纳在表 -3中。Table -3: Turbo code internal interleaver parametersiKiiKiiKiiKi1403104841625529511206714014232001112402487124942451106961152357214332644432043561942504324772971184197414433285110446471651440911109812163976145339251212572718524

40、482916899124819781463456451192680112053456291141001280199240147352025722078852254464247581011312218214835845733689611245547229118102134421125214936483132289104726564808918010313762186150371227123210112418457488911221041408438815137761792361112010390584961576210514401496015238403311201212815325950455

41、841061472459215339043632441313693460512316410715044984615439683752481414417108615281766108153671481554032127168151529386254435681091568132815640963164161602112063560227420110160017801574160331301716810184645766596111163225102158422443264181762144655921974112166418310415942883313419184574666608377611

42、316965595416043524774082019223486762441234114172812796161441635138212001350686403980115176027110162448023328022208275269656185821161792291121634544357142232161136706724325211718242911416446083374802422427567168821861181856571161654672371462523285587270415544119188845354166473671444262402960737207912

43、012019203112016748007112027248336274736139921211952596101684864371522825615327575223941221984185124169492839462292641719876768217481232016113420170499212723430272336877784259812420483164171505639158312801032107880017801252112176617251203980322881936798161271021262176171136173518431963329619748083225

44、521272240209420174524811390234304377681848239106128230425321617553124116635312197882864174812923683674441765376251336363202112083880137110130243226545617754404317037328218284896215112131249618146817855042186383361158485912291141322560398017955684317439344193868692815581332624271641805632451764035221

45、448794414711813426881275041815696451784136013390889602960135275214317218257601611204236881468997659122136281643881835824891824337645949099265124137288029300184588832318444384234891100855841382944459218559524718645392243989210243164139300815718818660162394464001514093105617661403072479618760804719047

46、4081551029410881712041413136132818861442634805.1.4速率匹配.1Turbo编码传输信道的速率匹配Turbo编码传输信道下的速率匹配针对每个码块定义,包括3个信息比特流, 和的交织,以及其后的比特收集和循环缓存产生,如图-1所示。每个码块的输出比特按照5.1.4.1.2节的描述发送出去。Figure -1. Rate matching for turbo coded transport channels比特流按照.1.1节定义的子块交织器进行交织,输出序列定义为,其中 在定义。比特流按照.1.1节定义的子块交织器进行交织,输出序列定义为。比特流按照

47、.1.1节定义的子块交织器进行交织,输出序列定义为。发送出去的比特序列 根据 .1.2节描述生成。.1.1子块交织器块交织器的输入比特表示为,其中,D 是输入比特的个数。块交织器的输出比特序列按照如下处理获得:(1)指定 为矩阵的列数。矩阵的列从左到右依次标号为 0, 1, 2,。(2)决定矩阵的行数。其值为满足下面条件的最小整数值:矩阵的行从上到下依次标号为0, 1, 2,。(3)如果,则添加 个dummy比特,也就是 yk = <NULL>,其中 k = 0, 1, ND 1。然后,按照行的顺序从第0列第0行写入y0开始,将输入比特序列,例如, k = 0, 1, D-1,写入

48、的矩阵:对于 和有:(4)按照表-1给出的模式进行矩阵的列间交织,其中,P(j)是交织后第 j列的原始位置。交织后的矩阵为: (5)块交织器的输出是按照列的顺序从列间交织后的 矩阵读出比特序列。子块交织后的比特流表示为,其中 对应于, 对应于,并且。对于有:(4) 子块交织后的比特流表示为,其中 ,并且有交织函数 P 在表 -1中定义。Table -1 Inter-column permutation pattern for sub-block interleaverNumber of columns Inter-column permutation pattern32< 0, 16,

49、8, 24, 4, 20, 12, 28, 2, 18, 10, 26, 6, 22, 14, 30, 1, 17, 9, 25, 5, 21, 13, 29, 3, 19, 11, 27, 7, 23, 15, 31 >.1.2比特收集、选择和传输对应于第r 个码块的长度为的循环缓存按照如下的方式生成: for k = 0, for k = 0, for k = 0, 对应于传输块的软缓存大小定义为 NIR 比特,第r 个码块的软缓存大小为Ncb 比特。Ncb 的大小由以下处理得到,其中C 是节中计算出的码块个数:- 对应于下行Turbo编码传输信道- 对应于上行Turbo编码传输信道

50、其中 NIR 等于:其中:Nsoft 是软信道比特的总数,参见 4。KMIMO 等于 2,如果UE 被设置为基于 3 的7.1节定义的传输模式3或4进行PDSCH 传送的接收处理;否则,等于 1。MDL_HARQ 是3 的7节定义的DL HARQ进程的最大个数。Mlimit 是常数8。用 E 表示第r 个编码块速率匹配后输出序列的长度,rvidx 表示本次传输的冗余版本号 (rvidx = 0, 1, 2 or 3),速率匹配后输出的比特序列为,k = 0,1,., 。定义G 来表示提供给一个传输块的总的比特数:设置,其中,Qm 等于2对应于 QPSK,4 对应于16QAM, 6 对应于64Q

51、AM,其中- NL等于1 对应于传输块映射到1个传输层的情况,并且- NL等于2对应于传输块映射到2个或4个传输层的情况。设置,其中,C 为节中计算的码块个数。if 设置else设置end if设置,其中 为.1.1节定义的行的个数。设置 k = 0 和 j = 0while k < E if k = k +1end ifj = j +1end while.2卷积编码传输信道和控制信息的速率匹配如图-2所示,卷积编码传输信道和控制信息的速率匹配包含3个比特流 , 和的交织、比特收集和循环缓存产生。输出比特按照5.1.4.2.2节的描述发送出去。Figure -2. Rate matching for convolutionally co

温馨提示

  • 1. 本站所有资源如无特殊说明,都需要本地电脑安装OFFICE2007和PDF阅读器。图纸软件为CAD,CAXA,PROE,UG,SolidWorks等.压缩文件请下载最新的WinRAR软件解压。
  • 2. 本站的文档不包含任何第三方提供的附件图纸等,如果需要附件,请联系上传者。文件的所有权益归上传用户所有。
  • 3. 本站RAR压缩包中若带图纸,网页内容里面会有图纸预览,若没有图纸预览就没有图纸。
  • 4. 未经权益所有人同意不得将文件中的内容挪作商业或盈利用途。
  • 5. 人人文库网仅提供信息存储空间,仅对用户上传内容的表现方式做保护处理,对用户上传分享的文档内容本身不做任何修改或编辑,并不能对任何下载内容负责。
  • 6. 下载文件中如有侵权或不适当内容,请与我们联系,我们立即纠正。
  • 7. 本站不保证下载资源的准确性、安全性和完整性, 同时也不承担用户因使用这些下载资源对自己和他人造成任何形式的伤害或损失。

评论

0/150

提交评论