UMTS 3GPP TS 25.212：FDD复用与信道编码技术规范

需积分: 9 121 浏览量更新于2023-06-29 收藏 970KB PDF 举报

"3GPP 25.212协议是关于3G移动通信系统（UMTS）的多路复用和信道编码规范，适用于频分双工（FDD）模式。此协议的标准版本为ETSITS125212V10.1.0，发布于2011年5月，由3GPP组织发布。" 3GPP 25.212协议是3G移动通信系统的核心技术之一，它定义了在FDD模式下如何进行多路复用和信道编码，以确保数据的有效传输和网络性能。以下是该协议涉及的一些关键知识点： 1. **多路复用**：多路复用技术允许在单个物理信道上传输多个独立的数据流。在3GPP 25.212中，这通常包括时分复用（TDM）、频分复用（FDM）和码分多址（CDMA）。通过这些方法，网络可以高效地利用频谱资源，同时服务多个用户。 2. **信道编码**：信道编码是为了提高数据传输的可靠性和鲁棒性。协议可能包含卷积编码、Turbo编码、块编码等技术，这些编码可以增加错误检测和纠正能力，以应对无线通信中的噪声和干扰。 3. **释放10**：这个版本（Release 10）代表了3GPP标准的一个特定阶段，可能包含了针对HSPA+（High-Speed Packet Access Plus）的增强，提高了数据速率和网络效率。 4. **UMTS技术**：UMTS是第三代移动通信系统，它采用了WCDMA（Wideband CDMA）作为其核心空中接口技术。3GPP 25.212协议是UMTS系统规范的一部分，确保了不同设备之间的互操作性。 5. **PDF版本**：官方文档通常提供PDF格式，这是参考版本，以防电子版本或打印版本之间出现内容差异。在解决争议时，以3GPP秘书处特定网络驱动器上存储的PDF版本为准。 6. **更新与修订**：3GPP规范可能会随着时间推移进行修订和状态变更，因此使用者应定期检查更新，以获取最新的技术信息和要求。 3GPP 25.212协议对于理解和实现3G UMTS网络的信号处理和数据传输至关重要，特别是在优化网络容量、提升服务质量以及增强用户体验方面。开发者、网络运营商和技术人员需要深入理解这一协议，以确保其设备和系统符合国际标准。

ETSI

ETSI TS 125 212 V10.1.0 (2011

05)

3GPP TS 25.212 version 10.1.0 Release 10

4.2.1 CRC attachment

Error detection is provided on transport blocks through a Cyclic Redundancy Check (CRC). The size of the CRC is 24,

16, 12, 8 or 0 bits and it is signalled from higher layers what CRC size that should be used for each TrCH.

4.2.1.1 CRC Calculation

The entire transport block is used to calculate the CRC parity bits for each transport block. The parity bits are generated

by one of the following cyclic generator polynomials:

- g

CRC24

(D) = D

+ D

+ D + 1;

- g

CRC16

(D) = D

+ D

+ 1;

- g

CRC12

(D) = D

+ D

+ D + 1;

- g

CRC8

(D) = D

+ D

+ D + 1.

Denote the bits in a transport block delivered to layer 1 by

imAimimim

aaaa ,,,,

321

K , and the parity bits by

imLimimim

pppp ,,,,

321

. A

is the size of a transport block of TrCH i, m is the transport block number, and L

is the

number of parity bits. L

can take the values 24, 16, 12, 8, or 0 depending on what is signalled from higher layers.

The encoding is performed in a systematic form, which means that in GF(2), the polynomial:

1 imimimimimA

pDpDpDpDaDaDa

++++++++

yields a remainder equal to 0 when divided by g

CRC24

(D), polynomial:

1 imimimimimA

pDpDpDpDaDaDa

++++++++

yields a remainder equal to 0 when divided by g

CRC16

(D), polynomial:

1 imimimimimA

pDpDpDpDaDaDa

++++++++

yields a remainder equal to 0 when divided by g

CRC12

(D) and polynomial:

1 imimimimimA

pDpDpDpDaDaDa

++++++++

yields a remainder equal to 0 when divided by g

CRC8

(D).

If no transport blocks are input to the CRC calculation (M

= 0), no CRC attachment shall be done. If transport blocks

are input to the CRC calculation (M

≠ 0) and the size of a transport block is zero (A

= 0), CRC shall be attached, i.e. all

parity bits equal to zero.

4.2.1.2 Relation between input and output of the CRC attachment block

The bits after CRC attachment are denoted by

imBimimim

bbbb ,,,,

321

K , where B

= A

+ L

. The relation between a

imk

and

imk

is:

imkimk

ab = k = 1, 2, 3, …, A

))(1(

AkLimimk

−−+

= k = A

+ 1, A

+ 2, A

+ 3, …, A

+ L

ETSI

ETSI TS 125 212 V10.1.0 (2011

05)

3GPP TS 25.212 version 10.1.0 Release 10

4.2.2 Transport block concatenation and code block segmentation

All transport blocks in a TTI are serially concatenated. If the number of bits in a TTI is larger than Z, the maximum size

of a code block in question, then code block segmentation is performed after the concatenation of the transport blocks.

The maximum size of the code blocks depends on whether convolutional coding or turbo coding is used for the TrCH.

4.2.2.1 Concatenation of transport blocks

The bits input to the transport block concatenation are denoted by

imBimimim

bbbb ,,,,

321

K where i is the TrCH

number, m is the transport block number, and B

is the number of bits in each block (including CRC). The number of

transport blocks on TrCH i is denoted by M

. The bits after concatenation are denoted by

iXiii

xxxx ,,,,

321

K , where i

is the TrCH number and X

. They are defined by the following relations:

kiik

= k = 1, 2, …, B

)(,2,

Bkiik

−

= k = B

+ 1, B

+ 2, …, 2B

)2(,3,

Bkiik

−

= k = 2B

+ 1, 2B

+ 2, …, 3B

))1((,,

iii

BMkMiik

−−

= k = (M

- 1)B

+ 1, (M

- 1)B

+ 2, …, M

4.2.2.2 Code block segmentation

Segmentation of the bit sequence from transport block concatenation is performed if X

>Z. The code blocks after

segmentation are of the same size. The number of code blocks on TrCH i is denoted by C

. If the number of bits input to

the segmentation, X

, is not a multiple of C

, filler bits are added to the beginning of the first block. If turbo coding is

selected and X

< 40, filler bits are added to the beginning of the code block. The filler bits are transmitted and they are

always set to 0. The maximum code block sizes are:

- convolutional coding: Z = 504;

- turbo coding: Z = 5114.

The bits output from code block segmentation, for C

≠ 0, are denoted by

irKiririr

oooo ,,,,

321

K , where i is the TrCH

number, r is the code block number, and K

is the number of bits per code block.

Number of code blocks:

⎡ ⎤

Number of bits in each code block (applicable for C

≠ 0 only):

if X

< 40 and Turbo coding is used, then

= 40

else

⎡

/ C

⎤

end if

Number of filler bits: Y

= C

- X

for k = 1 to Y

-- Insertion of filler bits

ETSI

ETSI TS 125 212 V10.1.0 (2011

05)

GPP TS 25.212 version 10.1.0 Release 10

Turbo code

internal interleaver

x’

z’

Input

Output

Input

Output

x’

1st constituent encoder

2nd constituent encoder

Figure 4: Structure of rate 1/3 Turbo coder (dotted lines apply for trellis termination only)

4.2.3.2.2 Trellis termination for Turbo coder

Trellis termination is performed by taking the tail bits from the shift register feedback after all information bits are

encoded. Tail bits are padded after the encoding of information bits.

The first three tail bits shall be used to terminate the first constituent encoder (upper switch of figure 4 in lower

position) while the second constituent encoder is disabled. The last three tail bits shall be used to terminate the second

constituent encoder (lower switch of figure 4 in lower position) while the first constituent encoder is disabled.

The transmitted bits for trellis termination shall then be:

K+1

, z

K+1

, x

K+2

, z

K+2

, x

K+3

, z

K+3

, x'

K+1

, z'

K+1

, x'

K+2

, z'

K+2

, x'

K+3

, z'

K+3

4.2.3.2.3 Turbo code internal interleaver

The Turbo code internal interleaver consists of bits-input to a rectangular matrix with padding, intra-row and inter-row

permutations of the rectangular matrix, and bits-output from the rectangular matrix with pruning. The bits input to the

Turbo code internal interleaver are denoted by

xxxx ,,,,

321

K , where K is the integer number of the bits and takes

one value of 40

≤ K ≤ 5114. The relation between the bits input to the Turbo code internal interleaver and the bits

input to the channel coding is defined by

irkk

ox = and K = K

The following subclause specific symbols are used in subclauses 4.2.3.2.3.1 to 4.2.3.2.3.3:

K Number of bits input to Turbo code internal interleaver

R Number of rows of rectangular matrix

C Number of columns of rectangular matrix

p Prime number

v Primitive root

()

{}

2,,1,0 −∈ pj

Base sequence for intra-row permutation

Minimum prime integers

Permuted prime integers

剩余117页未读，继续阅读

caoyezhandou

粉丝: 0
资源: 5

UMTS 3GPP TS 25.212：FDD复用与信道编码技术规范

3GPP TS 25.211 V12.1.0 (2014-12)

3GPP TS 29.212 V14.4.0 (2017-06)

25.212物理层复用与信道编码(中文版)

3GPP 各种规范之3GPP TS 29061.pdf

LTE协议学习索引.pdf

3GPP Long Term Evolution

LTE协议学习索引[借鉴].pdf

3pgg spec FDD 物理层协议

3G WCDAM HSPA 原理

3G的标准与原理相关资料

最新资源