3GPP TS V8.9.0 ( )

Similar documents
3GPP TS V5.6.0 ( )

GSM GSM TECHNICAL August 1996 SPECIFICATION Version 5.2.0

GSM GSM TECHNICAL May 1996 SPECIFICATION Version 5.1.0

3GPP TS V ( )

ETSI TS V8.0.2 ( )

ETSI TS V8.9.0 ( )

ETSI TS V ( )

ETSI TS V7.0.1 ( )

3GPP TS V8.0.0 ( )

ETSI EN V8.2.1 ( )

TS V6.1.1 ( )

3GPP TS V8.0.1 ( )

3GPP TS V8.4.0 ( )

GSM GSM TECHNICAL August 1997 SPECIFICATION Version 5.2.0

3GPP TS V8.0.0 ( )

ETSI TS V ( )

3GPP TS V ( )

EUROPEAN ETS TELECOMMUNICATION September 1994 STANDARD

ETSI TS V ( )

GSM GSM TECHNICAL April 1998 SPECIFICATION Version 5.4.0

3GPP TS V8.0.0 ( )

3GPP TS V8.4.0 ( )

3GPP TS V8.0.0 ( )

GPRS Air Interface aspects

3GPP TS V5.0.0 ( )

ARIB STD-T V Mandatory speech codec; AMR speech codec; Interface to lu and Uu (Release 1999)

TD SMG-P Draft EN 300 XXX V2.0.0 ( )

Modeling and Dimensioning of Mobile Networks: from GSM to LTE. Maciej Stasiak, Mariusz Głąbowski Arkadiusz Wiśniewski, Piotr Zwierzykowski

ETSI EN V7.2.1 ( )

EUROPEAN ETS TELECOMMUNICATION April 2000 STANDARD

ETSI TS V8.0.0 ( ) Technical Specification

GSM GSM TELECOMMUNICATION May 1996 STANDARD Version 5.0.0

3GPP TS V8.9.0 ( )

ETSI EN V8.0.1 ( )

3GPP TR V ( )

ETSI EN V7.0.2 ( )

ETSI TS V1.1.1 ( )

EUROPEAN pr ETS TELECOMMUNICATION November 1996 STANDARD

GSM and Similar Architectures Lesson 08 GSM Traffic and Control Data Channels

EUROPEAN pr ETS TELECOMMUNICATION August 1995 STANDARD

3G TR 25.xxx V0.0.1 ( )

3GPP TS V8.0.0 ( )

ETSI TS V1.1.2 ( )

ETSI TS V ( )

3GPP TS V ( )

ETSI TS V7.1.0 ( ) Technical Specification

3GPP TS V ( )

3GPP TS V ( )

3GPP TS V ( )

3GPP TS V8.0.0 ( )

ETSI TS V5.1.0 ( )

EUROPEAN pr ETS TELECOMMUNICATION March 1996 STANDARD

3GPP TS V ( )

3GPP TS V ( )

Section A : example questions

3GPP TS V6.6.0 ( )

EN V6.3.1 ( )

3G TS V3.0.0 ( )

3GPP TR v ( )

ETSI TS V7.4.0 ( )

GSM Fundamentals. Copyright 2000, Agilent Technologies All Rights Reserved

Chapter 2: Global System for Mobile Communication

3GPP TS V ( )

3GPP TS V ( )

3GPP TS V6.2.0 ( )

3GPP TS V ( )

ETSI TS V8.2.0 ( ) Technical Specification

EUROPEAN ETS TELECOMMUNICATION May 1997 STANDARD

3GPP TS V ( )

GSM Network and Services

3GPP TS V ( )

EN V6.3.1 ( )

ARIB STD-T V

ETSI EN V7.0.1 ( )

3GPP TS V ( )

ETSI TS V ( )

ETSI EN V7.0.1 ( )

Chapter 7 GSM: Pan-European Digital Cellular System. Prof. Jang-Ping Sheu

3GPP TS V ( )

3GPP TS V ( )

3GPP TSG RAN WG2 TR V0.1.0: on Opportunity Driven Multiple Access

ETSI TS V8.7.0 ( ) Technical Specification

ETSI TS V ( )

Final draft ETSI EN V1.2.0 ( )

3GPP TS V8.2.0 ( )

3G TS V3.2.0 ( )

ETSI TS V7.0.0 ( )

Lecturer: Srwa Mohammad

ETSI TS V7.1.0 ( )

Global System for Mobile Communications

ETSI TS V8.1.0 ( ) Technical Specification

Access Methods in GSM

ETSI TS V8.1.0 ( ) Technical Specification

ETSI TS V8.0.0 ( ) Technical Specification

CS6956: Wireless and Mobile Networks Lecture Notes: 3/23/2015

3G TS V2.0.0 ( )

ETSI TS V ( )

ETSI TS V9.4.0 ( ) Technical Specification

JP-3GA (R99) High Speed Circuit Switched Data (HSCSD) ; Stage 2

ETSI TS V ( )

Transcription:

TS 05.03 V8.9.0 (2005-01) Technical Specification 3rd Generation Partnership Project; Technical Specification Group GSM/EDGE Radio Access Network; Channel coding (Release 1999) GLOBAL SYSTEM FOR MOBILE COMMUNICATIONS R The present document has been developed within the 3 rd Generation Partnership Project ( TM ) and may be further elaborated for the purposes of. The present document has not been subject to any approval process by the Organizational Partners and shall not be implemented. This Specification is provided for future development work within only. The Organizational Partners accept no liability for any use of this Specification. Specifications and reports for implementation of the TM system should be obtained via the Organizational Partners' Publications Offices.

2 TS 05.03 V8.9.0 (2005-01) Keywords GSM, radio Postal address support office address 650 Route des Lucioles - Sophia Antipolis Valbonne - FRANCE Tel.: +33 4 92 94 42 00 Fax: +33 4 93 65 47 16 Internet http://www.3gpp.org Copyright Notification No part may be reproduced except as authorized by written permission. The copyright and the foregoing restriction extend to reproduction in all media. 2005, Organizational Partners (ARIB, ATIS, CCSA, ETSI, TTA, TTC). All rights reserved.

3 TS 05.03 V8.9.0 (2005-01) Contents Foreword... 9 1 Scope... 10 1.1 References... 10 1.2 Abbreviations... 11 2 General... 11 2.1 General organization... 11 2.2 Naming Convention... 15 3 Traffic Channels (TCH)... 17 3.1 Speech channel at full rate (TCH/FS and TCH/EFS)... 17 3.1.1 Preliminary channel coding for EFR only... 17 3.1.1.1 CRC calculation... 17 3.1.1.2 Repetition bits... 18 3.1.1.3 Correspondence between input and output of preliminary channel coding... 18 3.1.2 Channel coding for FR and EFR... 18 3.1.2.1 Parity and tailing for a speech frame... 18 3.1.2.2 Convolutional encoder... 19 3.1.3 Interleaving... 19 3.1.4 Mapping on a Burst... 19 3.2 Speech channel at half rate (TCH/HS)... 20 3.2.1 Parity and tailing for a speech frame... 20 3.2.2 Convolutional encoder... 20 3.2.3 Interleaving... 21 3.2.4 Mapping on a burst... 21 3.3 Data channel at full rate, 12.0 kbit/s radio interface rate (9.6 kbit/s services (TCH/F9.6))... 21 3.3.1 Interface with user unit... 22 3.3.2 Block code... 22 3.3.3 Convolutional encoder... 22 3.3.4 Interleaving... 22 3.3.5 Mapping on a Burst... 22 3.4 Data channel at full rate, 6.0 kbit/s radio interface rate (4.8 kbit/s services (TCH/F4.8))... 23 3.4.1 Interface with user unit... 23 3.4.2 Block code... 23 3.4.3 Convolutional encoder... 23 3.4.4 Interleaving... 23 3.4.5 Mapping on a Burst... 23 3.5 Data channel at half rate, 6.0 kbit/s radio interface rate (4.8 kbit/s services (TCH/H4.8))... 24 3.5.1 Interface with user unit... 24 3.5.2 Block code... 24 3.5.3 Convolutional encoder... 24 3.5.4 Interleaving... 24 3.5.5 Mapping on a Burst... 24 3.6 Data channel at full rate, 3.6 kbit/s radio interface rate (2.4 kbit/s and less services (TCH/F2.4))... 24 3.6.1 Interface with user unit... 24 3.6.2 Block code... 24 3.6.3 Convolutional encoder... 24 3.6.4 Interleaving... 25 3.6.5 Mapping on a Burst... 25 3.7 Data channel at half rate, 3.6 kbit/s radio interface rate (2.4 kbit/s and less services (TCH/H2.4))... 25 3.7.1 Interface with user unit... 25 3.7.2 Block code... 25 3.7.3 Convolutional encoder... 25 3.7.4 Interleaving... 25 3.7.5 Mapping on a Burst... 26 3.8 Data channel at full rate, 14.5 kbit/s radio interface rate (14.4 kbit/s services (TCH/F14.4))... 26 3.8.1 Interface with user unit... 26

4 TS 05.03 V8.9.0 (2005-01) 3.8.2 Block code... 26 3.8.3 Convolutional encoder... 26 3.8.4 Interleaving... 26 3.8.5 Mapping on a Burst... 26 3.9 Adaptive multi rate speech channel at full rate (TCH/AFS)... 26 3.9.1 SID_UPDATE... 27 3.9.1.1 Coding of in-band data... 27 3.9.1.2 Parity and convolutional encoding for the comfort noise parameters... 27 3.9.1.3 Identification marker... 28 3.9.1.4 Interleaving... 29 3.9.1.5 Mapping on a Burst... 29 3.9.2 SID_FIRST... 29 3.9.2.1 Coding of in-band data... 29 3.9.2.2 Identification marker... 29 3.9.2.3 Interleaving... 29 3.9.2.4 Mapping on a Burst... 29 3.9.3 ONSET... 29 3.9.3.1 Coding of in-band data... 29 3.9.3.2 Interleaving... 30 3.9.3.3 Mapping on a Burst... 30 3.9.4 SPEECH... 30 3.9.4.1 Coding of the in-band data... 30 3.9.4.2 Ordering according to subjective importance... 30 3.9.4.3 Parity for speech frames... 31 3.9.4.4 Convolutional encoder... 33 3.9.4.5 Interleaving... 39 3.9.4.6 Mapping on a Burst... 39 3.9.5 RATSCCH... 39 3.9.5.1 Coding of in-band data... 39 3.9.5.2 Parity and convolutional encoding for the RATSCCH message... 40 3.9.5.3 Identification marker... 40 3.9.5.4 Interleaving... 41 3.9.5.5 Mapping on a Burst... 41 3.10 Adaptive multi rate speech channel at half rate (TCH/AHS)... 41 3.10.1 SID_UPDATE... 41 3.10.1.1 Coding of in-band data... 41 3.10.1.2 Parity and convolutional encoding for the comfort noise parameters... 42 3.10.1.3 Identification marker... 43 3.10.1.4 Interleaving... 43 3.10.1.5 Mapping on a Burst... 43 3.10.2 SID_UPDATE_INH... 43 3.10.2.1 Coding of in-band data... 43 3.10.2.2 Identification marker... 44 3.10.2.3 Interleaving... 44 3.10.2.4 Mapping on a Burst... 44 3.10.3 SID_FIRST_P1... 44 3.10.3.1 Coding of in-band data... 44 3.10.3.2 Identification marker... 44 3.10.3.3 Interleaving... 45 3.10.3.4 Mapping on a Burst... 45 3.10.4 SID_FIRST_P2... 45 3.10.4.1 Coding of in-band data... 45 3.10.4.2 Interleaving... 45 3.10.4.3 Mapping on a Burst... 45 3.10.5 SID_FIRST_INH... 45 3.10.5.1 Coding of in-band data... 46 3.10.5.2 Identification marker... 46 3.10.5.3 Interleaving... 46 3.10.5.4 Mapping on a Burst... 46 3.10.6 ONSET... 46 3.10.6.1 Coding of in-band data... 46 3.10.6.2 Interleaving... 46

5 TS 05.03 V8.9.0 (2005-01) 3.10.6.3 Mapping on a Burst... 46 3.10.7 SPEECH... 46 3.10.7.1 Coding of the in-band data... 46 3.10.7.2 Ordering according to subjective importance... 47 3.10.7.3 Parity for speech frames... 47 3.10.7.4 Convolutional encoder... 49 3.10.7.5 Interleaving... 53 3.10.7.6 Mapping on a Burst... 53 3.10.8 RATSCCH_MARKER... 53 3.10.8.1 Coding of in-band data... 53 3.10.8.2 Identification marker... 53 3.10.8.3 Interleaving... 53 3.10.8.4 Mapping on a Burst... 53 3.10.9 RATSCCH_DATA... 53 3.10.9.1 Coding of in-band data... 53 3.10.9.2 Parity and convolutional encoding for the RATSCCH message... 54 3.10.9.3 Interleaving... 54 3.10.9.4 Mapping on a Burst... 55 3.11 Data channel for ECSD at full rate, 29.0 kbit/s radio interface rate (28.8 kbit/s services (E-TCH/F28.8))... 55 3.11.1 Interface with user unit... 55 3.11.2 Block code... 55 3.11.2.1 Repetition bits... 55 3.11.2.2 Reed Solomon encoder... 55 3.11.3 Convolutional encoder... 57 3.11.3.1 Tailing bits for a data frame... 57 3.11.3.2 Convolutional encoding for a data frame... 57 3.11.4 Interleaving... 57 3.11.5 Mapping on a Burst... 57 3.12 Data channel for ECSD at full rate, 32.0 kbit/s radio interface rate (32.0 kbit/s services (E-TCH/F32.0))... 58 3.12.1 Interface with user unit... 58 3.12.2 Void... 58 3.12.3 Convolutional encoder... 58 3.12.3.1 Tailing bits for a data frame... 58 3.12.3.2 Convolutional encoding for a data frame... 58 3.12.4 Interleaving... 59 3.12.5 Mapping on a Burst... 60 3.13 Data channel for ECSD at full rate, 43.5 kbit/s radio interface rate (43.2 kbit/s services (E-TCH/F43.2))... 60 3.13.1 Interface with user unit... 60 3.13.2 Convolutional encoder... 60 3.13.2.1 Tailing bits for a data frame... 60 3.13.2.2 Convolutional encoding for a data frame... 60 3.13.3 Interleaving... 60 3.13.4 Mapping on a Burst... 60 4 Control Channels... 61 4.1 Slow associated control channel (SACCH)... 61 4.1.1 Block constitution... 61 4.1.2 Block code... 61 4.1.3 Convolutional encoder... 61 4.1.4 Interleaving... 61 4.1.5 Mapping on a Burst... 62 4.2 Fast associated control channel at full rate (FACCH/F)... 62 4.2.1 Block constitution... 62 4.2.2 Block code... 62 4.2.3 Convolutional encoder... 62 4.2.4 Interleaving... 62 4.2.5 Mapping on a Burst... 62 4.3 Fast associated control channel at half rate (FACCH/H)... 63 4.3.1 Block constitution... 63 4.3.2 Block code... 63 4.3.3 Convolutional encoder... 63 4.3.4 Interleaving... 63

6 TS 05.03 V8.9.0 (2005-01) 4.3.5 Mapping on a Burst... 63 4.4 Broadcast control, Paging, Access grant, Notification and Cell broadcast channels (BCCH, PCH, AGCH, NCH, CBCH), CTS Paging and Access grant channels (CTSPCH, CTSAGCH)... 64 4.5 Stand-alone dedicated control channel (SDCCH)... 64 4.6 Random access channel (RACH)... 64 4.7 Synchronization channel (SCH), Compact synchronization channel (CSCH), CTS Beacon and Access request channels (CTSBCH-SB, CTSARCH)... 65 4.8 Access Burst on circuit switched channels other than RACH... 66 4.9 Access Bursts for uplink access on a channel used for VGCS... 66 4.10 Fast associated control channel at ECSD E-TCH/F (E-FACCH/F)... 66 4.10.1 Block constitution... 66 4.10.2 Block code... 66 4.10.3 Convolutional encoder... 66 4.10.4 Interleaving... 66 4.10.5 Mapping on a Burst... 66 5 Packet Switched Channels... 67 5.1 Packet data traffic channel (PDTCH)... 67 5.1.1 Packet data block type 1 (CS-1)... 67 5.1.2 Packet data block type 2 (CS-2)... 67 5.1.2.1 Block constitution... 67 5.1.2.2 Block code... 67 5.1.2.3 Convolutional encoder... 68 5.1.2.4 Interleaving... 68 5.1.2.5 Mapping on a burst... 68 5.1.3 Packet data block type 3 (CS-3)... 68 5.1.3.1 Block constitution... 68 5.1.3.2 Block code... 68 5.1.3.3 Convolutional encoder... 69 5.1.3.4 Interleaving... 69 5.1.3.5 Mapping on a burst... 69 5.1.4 Packet data block type 4 (CS-4)... 70 5.1.4.1 Block constitution... 70 5.1.4.2 Block code... 70 5.1.4.3 Convolutional encoder... 70 5.1.4.4 Interleaving... 70 5.1.4.5 Mapping on a burst... 70 5.1.5 Packet data block type 5 (MCS-1)... 71 5.1.5.1 Downlink (MCS-1 DL)... 71 5.1.5.1.1 Block constitution... 71 5.1.5.1.2 USF precoding... 71 5.1.5.1.3 Header coding... 71 5.1.5.1.4 Data coding... 71 5.1.5.1.5 Interleaving... 72 5.1.5.1.6 Mapping on a burst... 73 5.1.5.2 Uplink (MCS-1 UL)... 73 5.1.5.2.1 Block constitution... 73 5.1.5.2.2 Header coding... 73 5.1.5.2.3 Data coding... 74 5.1.5.2.4 Interleaving... 74 5.1.5.2.5 Mapping on a burst... 74 5.1.6 Packet data block type 6 (MCS-2)... 75 5.1.6.1 Downlink (MCS-2 DL)... 75 5.1.6.1.1 Block constitution... 75 5.1.6.1.2 USF precoding... 75 5.1.6.1.3 Header coding... 75 5.1.6.1.4 Data coding... 75 5.1.6.1.5 Interleaving... 76 5.1.6.1.6 Mapping on a burst... 76 5.1.6.2 Uplink (MCS-2 UL)... 76 5.1.6.2.1 Block constitution... 76 5.1.6.2.2 Header coding... 76

7 TS 05.03 V8.9.0 (2005-01) 5.1.6.2.3 Data coding... 76 5.1.6.2.4 Interleaving... 76 5.1.6.2.5 Mapping on a burst... 76 5.1.7 Packet data block type 7 (MCS-3)... 76 5.1.7.1 Downlink (MCS-3 DL)... 76 5.1.7.1.1 Block constitution... 76 5.1.7.1.2 USF precoding... 76 5.1.7.1.3 Header coding... 77 5.1.7.1.4 Data coding... 77 5.1.7.1.5 Interleaving... 77 5.1.7.1.6 Mapping on a burst... 77 5.1.7.2 Uplink (MCS-3 UL)... 78 5.1.7.2.1 Block constitution... 78 5.1.7.2.2 Header coding... 78 5.1.7.2.3 Data coding... 78 5.1.7.2.4 Interleaving... 78 5.1.7.2.5 Mapping on a burst... 78 5.1.8 Packet data block type 8 (MCS-4)... 78 5.1.8.1 Downlink (MCS-4 DL)... 78 5.1.8.1.1 Block constitution... 78 5.1.8.1.2 USF precoding... 78 5.1.8.1.3 Header coding... 78 5.1.8.1.4 Data coding... 78 5.1.8.1.5 Interleaving... 79 5.1.8.1.6 Mapping on a burst... 79 5.1.8.2 Uplink (MCS-4 UL)... 79 5.1.8.2.1 Block constitution... 79 5.1.8.2.2 Header coding... 79 5.1.8.2.3 Data coding... 79 5.1.8.2.4 Interleaving... 79 5.1.8.2.5 Mapping on a burst... 80 5.1.9 Packet data block type 9 (MCS-5)... 80 5.1.9.1 Downlink (MCS-5 DL)... 80 5.1.9.1.1 Block constitution... 80 5.1.9.1.2 USF precoding... 80 5.1.9.1.3 Header coding... 80 5.1.9.1.4 Data coding... 81 5.1.9.1.5 Interleaving... 82 5.1.9.1.6 Mapping on a burst... 82 5.1.9.2 Uplink (MCS-5 UL)... 83 5.1.9.2.1 Block constitution... 83 5.1.9.2.2 Header coding... 83 5.1.9.2.3 Data coding... 84 5.1.9.2.4 Interleaving... 84 5.1.9.2.5 Mapping on a burst... 84 5.1.10 Packet data block type 10 (MCS-6)... 85 5.1.10.1 Downlink (MCS-6 DL)... 85 5.1.10.1.1 Block constitution... 85 5.1.10.1.2 USF precoding... 85 5.1.10.1.3 Header coding... 85 5.1.10.1.4 Data coding... 85 5.1.10.1.5 Interleaving... 86 5.1.10.1.6 Mapping on a burst... 86 5.1.10.2 Uplink (MCS-6 UL)... 86 5.1.10.2.1 Block constitution... 86 5.1.10.2.2 Header coding... 86 5.1.10.2.3 Data coding... 86 5.1.10.2.4 Interleaving... 86 5.1.10.2.5 Mapping on a burst... 86 5.1.11 Packet data block type 11 (MCS-7)... 86 5.1.11.1 Downlink (MCS-7 DL)... 86 5.1.11.1.1 Block constitution... 86

8 TS 05.03 V8.9.0 (2005-01) 5.1.11.1.2 USF precoding... 86 5.1.11.1.3 Header coding... 86 5.1.11.1.4 Data coding... 87 5.1.11.1.5 Interleaving... 88 5.1.11.1.6 Mapping on a burst... 88 5.1.11.2 Uplink (MCS-7 UL)... 89 5.1.11.2.1 Block constitution... 89 5.1.11.2.2 Header coding... 89 5.1.11.2.3 Data coding... 90 5.1.11.2.4 Interleaving... 90 5.1.11.2.5 Mapping on a burst... 90 5.1.12 Packet data block type 12 (MCS-8)... 91 5.1.12.1 Downlink (MCS-8 DL)... 91 5.1.12.1.1 Block constitution... 91 5.1.12.1.2 USF precoding... 91 5.1.12.1.3 Header coding... 91 5.1.12.1.4 Data coding... 91 5.1.12.1.5 Interleaving... 92 5.1.12.1.6 Mapping on a burst... 92 5.1.12.2 Uplink (MCS-8 UL)... 92 5.1.12.2.1 Block constitution... 92 5.1.12.2.2 Header coding... 92 5.1.12.2.3 Data coding... 92 5.1.12.2.4 Interleaving... 92 5.1.12.2.5 Mapping on a burst... 93 5.1.13 Packet data block type 13 (MCS-9)... 93 5.1.13.1 Downlink (MCS-9 DL)... 93 5.1.13.1.1 Block constitution... 93 5.1.13.1.2 USF precoding... 93 5.1.13.1.3 Header coding... 93 5.1.13.1.4 Data coding... 93 5.1.13.1.5 Interleaving... 94 5.1.13.1.6 Mapping on a burst... 94 5.1.13.2 Uplink (MCS-9 UL)... 94 5.1.13.2.1 Block constitution... 94 5.1.13.2.2 Header coding... 94 5.1.13.2.3 Data coding... 94 5.1.13.2.4 Interleaving... 94 5.1.13.2.5 Mapping on a burst... 94 5.2 Packet control channels (PACCH, PBCCH, PAGCH, PPCH, PNCH, PTCCH, CPBCCH, CPAGCH, CPPCH, and CPNCH)... 95 5.3 Packet random access channel (PRACH and CPRACH)... 95 5.3.1 Packet Access Burst... 95 5.3.2 Extended Packet Access Burst... 95 5.4 Access Burst on packet switched channels other than PRACH and CPRACH... 96 Annex A (informative): Summary of Channel Types... 112 Annex B (informative): Summary of Polynomials Used for Convolutional Codes... 114 Annex C (informative): Change history... 115

9 TS 05.03 V8.9.0 (2005-01) Foreword This Technical Specification has been produced by the 3 rd Generation Partnership Project (). The contents of the present document are subject to continuing work within the TSG and may change following formal TSG approval. Should 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: Version x.y.z where: x the first digit: 1 presented to TSG for information; 2 presented to TSG for approval; 3 or greater indicates TSG approved document under change control. y the second digit is incremented for all changes of substance, i.e. technical enhancements, corrections, updates, etc. z the third digit is incremented when editorial only changes have been incorporated in the document.

10 TS 05.03 V8.9.0 (2005-01) 1 Scope A reference configuration of the transmission chain is shown in GSM 05.01 [4]. According to this reference configuration, the present document specifies the data blocks given to the encryption unit. It includes the specification of encoding, reordering, interleaving and the stealing flag. It does not specify the channel decoding method. The definition is given for each kind of logical channel, starting from the data provided to the channel encoder by the speech coder, the data terminal equipment, or the controller of the Mobile Station (MS) or Base Transceiver Station (BTS). The definitions of the logical channel types used in this technical specification are given in GSM 05.02 [5], a summary is in annex A. 1.1 References The 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, etc.) or non-specific. For a specific reference, subsequent revisions do not apply. For a non-specific reference, the latest version applies. For this Release 1999 document, references to GSM documents are for Release 1999 versions (version 8.x.y). [1] GSM 01.04: "Digital cellular telecommunications system (Phase 2+); Abbreviations and acronyms". [2] GSM 04.08: "Digital cellular telecommunications system (Phase 2+); Mobile radio interface layer 3 specification". [3] GSM 04.21: "Digital cellular telecommunications system (Phase 2+); Rate adaption on the Mobile Station - Base Station System (MS - BSS) interface". [4] GSM 05.01: "Digital cellular telecommunications system (Phase 2+); Physical layer on the radio path General description". [5] GSM 05.02: "Digital cellular telecommunications system (Phase 2+); Multiplexing and multiple access on the radio path". [6] GSM 05.05: "Digital cellular telecommunications system (Phase 2+); Radio Transmission and Reception". [7] GSM 05.09: "Digital cellular telecommunications system (Phase 2+); Link adaptation". [8] GSM 06.10: "Digital cellular telecommunications system; Full rate speech transcoding". [9] GSM 06.20: "Digital cellular telecommunications system; Half rate speech transcoding". [10] GSM 06.60: "Digital cellular telecommunications system; Enhanced Full Rate (EFR) speech transcoding". [11] GSM 06.90: "Digital cellular telecommunications system; Adaptive Multi-Rate speech transcoding". [12] GSM 06.93: "Digital cellular telecommunications system; Discontinous transmission (DTX) for Adaptive Multi-Rate speech traffic channels". [13] GSM 03.64: "Digital cellular telecommunications system (Phase 2+); General Packet Radio Service (GPRS); Overall description of the GPRS Radio Interface; Stage 2".

11 TS 05.03 V8.9.0 (2005-01) [14] GSM 03.52: "Digital cellular telecommunications system (Phase 2+); GSM Cordless Telephony System (CTS), Phase 1; Lower layers of the CTS Radio Interface; Stage 2". 1.2 Abbreviations Abbreviations used in the present document are listed in GSM 01.04. 2 General 2.1 General organization Each channel has its own coding and interleaving scheme. However, the channel coding and interleaving is organized in such a way as to allow, as much as possible, a unified decoder structure. Each channel uses the following sequence and order of operations: - the information bits are coded with a systematic block code, building words of information + parity bits; - these information + parity bits are encoded with a convolutional code, building the coded bits; - reordering and interleaving the coded bits, and adding a stealing flag, gives the interleaved bits. All these operations are made block by block, the size of which depends on the channel. However, most of the channels use a block of 456 coded bits which is interleaved and mapped onto bursts in a very similar way for all of them. Figures 1a and 1b give a diagram showing the general structure of the channel coding. This block of 456 coded bits is the basic structure of the channel coding scheme. In the case of full rate speech TCH, this block carries the information of one speech frame. In case of control channels, it carries one message. In the case of half rate speech TCH, the information of one speech frame is carried in a block of 228 coded bits. In the case of the Enhanced full rate speech the information bits coming out of the source codec first go through a preliminary channel coding. then the channel coding as described above takes place. In the case of a packet switched channel the block of 456 or 1384 coded bits carries one radio block. In the case of E-TCH/F28.8 or E-TCH/F43.2, the block of 1368 coded bits (456 coded symbols) carries one radio block. In the case of E-TCH/F32.0, the block of 1392 coded bits (464 coded symbols) carries one radio block. In the case of FACCH, a coded message block of 456 bits is divided into eight sub-blocks. The first four sub-blocks are sent by stealing the even numbered bits of four timeslots in consecutive frames used for the TCH. The other four sub-blocks are sent by stealing the odd numbered bits of the relevant timeslot in four consecutive used frames delayed 2 or 4 frames relative to the first frame. Along with each block of 456 coded bits there is, in addition, a stealing flag (8 bits), indicating whether the block belongs to the TCH or to the FACCH. In the case of SACCH, BCCH, CCCH or CTSCCH, this stealing flag is dummy. In the case of a packet switched channel, these bits are used to indicate the coding scheme used. In the case of E-FACCH/F, a coded message block of 456 bits is divided into four sub-blocks. The four sub-blocks are sent by stealing all symbols of four timeslots in consecutive frames used for the E-TCH and using GMSK modulation. The indication of the E-FACCH/F is based on the identification of the modulation. Along with each block of 456 coded bits there is, in addition, a stealing flag (8 bits), indicating whether the block belongs to the E-FACCH, FACCH or TCH.

12 TS 05.03 V8.9.0 (2005-01) Some cases do not fit in the general organization, and use short blocks of coded bits which are sent completely in one timeslot. They are the random access messages of: - the RACH; - or PRACH and CPRACH; on uplink and the synchronization information broadcast on the SCH or CSCH on the downlink. In CTS, they are the access request message of the CTSARCH on uplink and the information broadcast on the CTSBCH-SB on downlink. interface 0 interface 1 interface 2 interface 3 TCH/HS (half rate speech TCH) speech frame 112 bits 3.2 cyclic code + tail in: 112 bits out: 121 bits 3.2.1 speech frame 244 bits 3.1 cyclic code + repetition in: 244 bits out: 260 bits 3.1.1 reordering and partitioning +stealing flag in: 228 bits out: 4 blocks 3.2.3 interface 4 block diagonal interleaving in: 4 blocks out: pairs of blocks 3.2.3 TCH/EFS (Enhanced full rate speech TCH) convolutional code k=7, 2 classes in: 121 bits out: 228 bits 3.2.2 SACCH, FACCH, TCH/FS BCCH, CBCH, PCH (full rate AGCH, SDCCH speech TCH) CTSAGCH, CTSPCH speech frame 260 bits 3.1 cyclic code + tail in: 260 bits out: 267 bits 3.1.1 convolutional code k=5, 2 classes in: 267 bits out: 456 bits 3.1.2 TCH/FS, TCH/EFS TCH/F2.4, FACCH block diagonal interleaving in: 8 blocks out: pairs of blocks 3.1.3, 4.3.4 encryption unit message 184 bits 4.1.1 Fire code +tail in: 184 bits out: 228 bits 4.1.2 convolutional code k=5, rate 1/2 in: 228 bits out: 456 bits 4.1.3 reordering and partitioning +stealing flag in: 456 bits out: 8 blocks 3.1.3, 4.1.4, 4.3.4 TCH/F2.4 others block rectangular interleaving in: 8 blocks out: pairs of blocks 4.1.4 data TCHs data frame N0 bits 3.n.1 +tail in: N0 bits out: N1 bits 3.n.2 convolutional code k=5, rate r in: N1 bits out: 456 bits 3.n.3 others PRACH PTCCH/U RACH, SCH CTSBCH-SB, CTSARCH message P0 bits 4.6, 4.7, 5.3.2 cyclic code + tail in: P0 bits out: P1 bits 4.6, 4.7, 5.3.2 convolutional code k=5, rate r in: P1 out: P2 bits 4.6, 4.7, 5.3.2 diagonal interleaving + stealing flags in: 456 bits out: 4 blocks diagonally interleaved to depth 19, starting on consecutive bursts 3.n.4 Figure 1a: Channel Coding and Interleaving Organization PDTCH(1-4), PBCCH, PAGCH, PPCH, PNCH, PTCCH/D RLC block Q0 bits 5.1.n.1 CS-1 cyclic code + tail in: Q0 bits out: Q1 bits 5.1.n.2 others CS-4 convolutional code k=5, rate r in: Q1 bits out: 456 bits 5.1.n.3 others reordering and partitioning +code identifier in: 456 bits out: 8 blocks 4.1.4 In each box, the last line indicates the chapter defining the function. In the case of RACH, P0 = 8 and P1 = 18; in the case of SCH, CSCH, CTSBCH-SB and CTSARCH, P0 = 25 and P1 = 39. In the case of data TCHs, N0, N1 and n depend on the type of data TCH.

13 TS 05.03 V8.9.0 (2005-01) Interfaces: 1) information bits (d); 2) information + parity + tail bits (u); 3) coded bits (c); 4) interleaved bits (e). TCH/AHS TCH/AFS In-band data 2 bits 3.10.7 interface 0 Speech frame 95..159 bits 3.10.7 In-band data 2 bits 3.9. 4 interface 0 Speech frame 95..244 bits 3.9. 4 id Subjective ordering in: 95..159 bits out: 95..159 bits 3.10.7.2 Class 2 12..36 bits id Subjective ordering in: 95..244 bits out: 95..244 bits 3.9.4.2 interface 1 interface 1 block code cyclic code block code cyclic codel in: 2 bits out: 4 bits 3.10.7.1 ic interface 2 in: 83..123 bits out: 89..129 bits 3.10.7.3 convolutional code K=5 or 7 rate 1/3..1/2 in: 89..129 bits out: 172..212 bits 3.10.7.4 in: 2 bits out: 8 bits 3.9.4.1 ic interface 2 in: 95..244 bits out: 101..250 bits 3.9.4. 3 convolutional code K=5 or 7 rate 1/5..1/2 in: 101..250 bits out: 448 bits 3.9.4.4 interface 3 reordering and partitioning +stealing flag in: 228 bits out: 4 blocks 3.10.7.5 -> 3.2.3 reordering and partitioning +stealing flag in: 456 bits out: 8 blocks 3.9.4.5 -> 3.1.3 block diagonal interleaving in: 4 blocks out: pairs of blocks 3.10.7.5 -> 3.2.3 block diagonal interleaving in: 8 blocks out: pairs of blocks 3.9.4.5 -> 3.1.3 interface 4 encryption unit Figure 1b: Channel Coding and Interleaving Organization, adaptive multi-rate speech In each box, the last line indicates the chapter defining the function.

14 TS 05.03 V8.9.0 (2005-01) Interfaces: 0) speech bits from the speech encoder (s); 1) reordered speech bits (d); 2) speech + parity + tail bits (u); 3) coded bits (c); 4) interleaved bits (e). Interface 0 E-TCH/F28.8 Interface data frame 580 bits 3.11.1 E-TCH/F43.2 data frame 870 bits 3.13.1 E-TCH/F32.0 data frame 640 bits 3.12.1 1 + repeated bits in: 580 bits out: 584 bits 3.11.2.1 shortened RS code in: 584 bits out: 85 symbols 3.11.2.2 Interface + tail bits in: 680 bits out: 686 bits 3.11.3.1 + tail bits in: 870 bits out: 876 bits 3.13.2.1 + tail bits in: 640 bits out: 646 bits 3.12.3.1 2 Interface convolutional code k=7, rate=1/2 in: 686 bits out: 1368 bits 3.11.3.2 convolutional code k=7, rate=1/2 in: 876 bits out: 1368 bits 3.13.2.2 convolutional code k=7, rate=1/3 in: 646 bits out: 1392 bits 3.12.3.2 3 Interface 4 diagonal interleaving over 19 bursts + stealing flags in: 1368 bits out: 4 blocks 3.11.4 diagonal interleaving over 12 bursts in: 1392 bits out: 4 blocks 3.12.4 Figure 2a: Channel Coding and Interleaving Organization for ECSD 8-PSK modulated signals In each box, the last line indicates the chapter defining the function.

15 TS 05.03 V8.9.0 (2005-01) interface 0 interface 1 interface 2 interface 3 block code in: 3 bits out: 12 bits 5.1.5.1.2 PTDCH(n=5-8) downlink RLC block 31+Q0 bits 5.1.n.1.1 cyclic code (no tail) in: 28 bits out: 36 bits 5.1.5.1.3 convolutional code k=7, rate 9/17 in: 36 bits out: 68 bits 5.1.5.1.3 downlink cyclic code + tail in: Q0 bits out: Q1 bits 5.1.n.1.4 convolutional code k=7, rate r in: Q1 bits out: 372 bits 5.1.n.1.4 cyclic code (no tail) in: 31 bits out: 39 bits 5.1.5.2.2 convolutional code k=7, rate 39/80 in: 39 bits out: 80 bits 5.1.5.2.2 uplink PTDCH(n=5-8) uplink RLC block 31+Q0 bits 5.1.n.2.1 PTDCH(n=9,10) downlink RLC block 28+Q0 bits 5.1.n.1.1 cyclic code (no tail) in: 25 bits out: 33 bits 5.1.9.1.3 convolutional code k=7, rate 0.33 in: 33 bits out: 100 bits 5.1.9.1.3 cyclic code + tail in: Q0 bits out: Q1 bits 5.1.n.1.4 convolutional code k=7, rate r in: Q1 bits out: 372 bits 5.1.n.1.4 PTDCH(n=9,10) uplink RLC block 37+Q0 bits 5.1.n.2.1 cyclic code (no tail) in: 37 bits out: 45 bits 5.1.9.2.2 convolutional code k=7, rate 45/136 in: 45 bits out: 136 bits 5.1.9.2.2 block code in: 3 bits out: 36 bits 5.1.9.1.2 PTDCH(n=11-13) downlink RLC block 40+Q0 bits 5.1.n.1.1 cyclic code (no tail) in: 37 bits out: 45 bits 5.1.11.1.3 convolutional code k=7, rate 45/124 in: 45 bits out: 124 bits 5.1.11.1.3 cyclic code + tail in: Q0 bits out: Q1 bits 5.1.n.1.4 convolutional code k=7, rate r in: Q1 bits out: 1224 bits 5.1.n.1.4 PTDCH(n=11-13) uplink RLC block 46+Q0 bits 5.1.n.2.1 cyclic code (no tail) in: 46 bits out: 54 bits 5.1.11.2.2 convolutional code k=7, rate 27/80 in: 54 bits out: 160 bits 5.1.11.2.2 reordering and partitioning +code identifier in: 456 bits out: 8 blocks 5.1.5.1.5 reordering and partitioning +code identifier in: 456 bits out: 8 blocks 5.1.5.2.4 block rectangular interleaving in: 100 bits out: 100 bits 5.1.9.1.5 block rectangular interleaving in: 1248 bits out: 1248 bits 5.1.9.1.5 block rectangular interleaving in: 136 bits out: 136 bits 5.1.9.2.4 block rectangular interleaving in: 124 bits out: 124 bits 5.1.11.1.5 block rectangular interleaving in: 1224 bits out: 1224 bits 5.1.11.1.5 block rectangular interleaving in: 160 bits out: 160 bits 5.1.11.2.4 interface 4 block rectangular interleaving in: 8 blocks out: pairs of blocks 4.1.4 encryption unit downlink partitioning +code identifier in: 1392 bits out: pair of blocks 5.1.9.1.6 uplink partitioning +code identifier in: 1392 bits out: pair of blocks 5.1.9.2.5 downlink partitioning +code identifier in: 1392 bits out: pair of blocks 5.1.11.1.6 uplink partitioning +code identifier in: 1392 bits out: pair of blocks 5.1.11.2.5 Figure 2b: Channel Coding and Interleaving Organization for EGPRS Packet Data Channels In each box, the last line indicates the chapter defining the function. 2.2 Naming Convention For ease of understanding a naming convention for bits is given for use throughout the technical specification: - General naming: "k" and "j" for numbering of bits in data blocks and bursts; "K x " gives the amount of bits in one block, where "x" refers to the data type; "n" is used for numbering of delivered data blocks where; "N" marks a certain data block; "B" is used for numbering of bursts or blocks where; "B 0 " marks the first burst or block carrying bits from the data block with n = 0 (first data block in the transmission). - Data delivered to the preliminary channel encoding unit (for EFR only): s(k) for k = 1..., K s - Data delivered by the preliminary channel encoding unit (for EFR only) before bits rearrangement w(k) for k = 1..., K w - Data bits delivered to the encoding unit (interface 1 in figure 1): d(k) for k = 0,1,...,K d -1 - Data symbols delivered to the encoding unit:

16 TS 05.03 V8.9.0 (2005-01) D(k) for k = 0,1,...,K D -1 - Input in-band data bits (for TCH/AMR only): id(k) for k = 0, 1 - Encoded in-band data bits (for TCH/AMR only): ic(k) for k = 0, 1,...,3 TCH/AHS speech frames or k = 0, 1,...,15 TCH/AMR, SID frames k = 0, 1,...,7 TCH/AFS speech frames or - Code identifying the used coding scheme (for packet switched channels only): q(k) for k = 0,1,..., 7 - Data bits after the first encoding step (block code, cyclic code; interface 2 in figure 1): u(k) for k = 0,1,...,K u -1 - Data symbols after the first encoding step (block code): U(k) for k = 0,1,...,K U -1 - Data put into the shift register of the convolutional code and calculated from the data bits u(k) and the feedback bits in recursive systematic convolutional codes r(k) for k= 0,1,..., K r -1 - Data after the second encoding step (convolutional code ; interface 3 in figure 1): c(n,k) or c(k) for k = 0,1,...,K c -1 - Interleaved data bits: n = 0,1,...,N,N+1,... i(b,k) for k = 0,1,...,K i -1 B = B 0, B 0 +1,... - Interleaved data symbols: I(B,k) for k = 0,1,...,K I -1 B = B 0, B 0 +1,... - Bits in one burst (interface 4 in figure 1): e(b,k) for k = 0,1,...,114,115 B = B 0,B 0 +1,... - Symbols in one burst (interface 4 in figure 2): E(B,k) for k = 0,1,...,114,115 B = B 0,B 0 +1,... - E-IACCH messages delivered to the block coding of inband signalling (for ECSD only): im(k) or im(n,k) for k = 0,1,2

17 TS 05.03 V8.9.0 (2005-01) n = 0,1,...,N,N+1,... - E-IACCH bits delivered to the mapping on one burst (for ECSD only): ib(b,k) for k = 0,1,...,5 B = B 0, B 0 +1,... - E-IACCH symbols in one burst (for ECSD only): HL(B) and HU(B) for B = B 0, B 0 +1,... 3 Traffic Channels (TCH) Two kinds of traffic channel are considered: speech and data. Both of them use the same general structure (see figure 1), and in both cases, a piece of information can be stolen by the FACCH. 3.1 Speech channel at full rate (TCH/FS and TCH/EFS) The speech coder (whether Full rate or Enhanced full rate) delivers to the channel encoder a sequence of blocks of data. In case of a full rate and enhanced full rate speech TCH, one block of data corresponds to one speech frame. For the full rate coder each block contains 260 information bits, including 182 bits of class 1 (protected bits), and 78 bits of class 2 (no protection), (see table 2). The bits delivered by the speech coder are received in the order indicated in GSM 06.10 and have to be rearranged according to table 2 before channel coding as defined in subclauses 3.1.1 to 3.1.4. The rearranged bits are labelled {d(0),d(1),...,d(259)}, defined in the order of decreasing importance. For the EFR coder each block contains 244 information bits. The block of 244 information bits, labelled s(1).., s(244), passes through a preliminary stage, applied only to EFR (see figure 1) which produces 260 bits corresponding to the 244 input bits and 16 redundancy bits. Those 16 redundancy bits correspond to 8 CRC bits and 8 repetition bits, as described in subclause 3.1.1. The 260 bits, labelled w(1)..w(260), have to be rearranged according to table 7 before they are delivered to the channel encoding unit which is identical to that of the TCH/FS. The 260 bits block includes 182 bits of class 1(protected bits) and 78 bits of class 2 (no protection). The class 1 bits are further divided into the class 1a and class 1b, class 1a bits being protected by a cyclic code and the convolutional code whereas the class 1b are protected by the convolutional code only. 3.1.1 Preliminary channel coding for EFR only 3.1.1.1 CRC calculation An 8-bit CRC is used for error-detection. These 8 parity bits (bits w253-w260) are generated by the cyclic generator polynomial: g(d) = D 8 + D 4 + D 3 + D 2 + 1 from the 65 most important bits (50 bits of class 1a and 15 bits of class 1b). These 65 bits (b(1)-b(65)) are taken from the table 5 in the following order (read row by row, left to right): s39 s40 s41 s42 s43 s44 s48 s87 s45 s2 s3 s8 s10 s18 s19 s24 s46 s47 s142 s143 s144 s145 s146 s147 s92 s93 s195 s196 s98 s137 s148 s94 s197 s149 s150 s95 s198 s4 s5 s11 s12 s16 s9 s6 s7 s13 s17 s20 s96 s199 s1 s14 s15 s21 s25 s26 s28 s151 s201 s190 s240 s88 s138 s191 s241 The encoding is performed in a systematic form, which means that, in GF(2), the polynomial: - b(1)d 72 + b(2)d 71 +...+b(65)d 8 + p(1)d 7 + p(2)d 6 +...+ p(7)d 1 + p(8);

18 TS 05.03 V8.9.0 (2005-01) - p(1) - p(8): the parity bits (w253-w260); - b(1) - b(65) = the data bits from the table above; when divided by g(d), yields a remainder equal to 0. 3.1.1.2 Repetition bits The repeated bits are s70, s120, s173 and s223. They correspond to one of the bits in each of the PULSE_5, the most significant one not protected by the channel coding stage. 3.1.1.3 Correspondence between input and output of preliminary channel coding The preliminary coded bits w(k) for k = 1 to 260 are hence defined by: w(k) = s(k) for k = 1 to 71 w(k) = s(k-2) for k = 74 to 123 w(k) = s(k-4) for k = 126 to 178 w(k) = s(k-6) for k = 181 to s230 w(k) = s(k-8) for k = 233 to s252 Repetition bits: Parity bits: w(k) = s(70) for k = 72 and 73 w(k) = s(120) for k = 124 and 125 w(k) = s(173) for k = 179 and 180 w(k) = s(223) for k = 231 and 232 w(k = p(k-252) for k = 253 to 260 3.1.2 Channel coding for FR and EFR 3.1.2.1 Parity and tailing for a speech frame a) Parity bits: The first 50 bits of class 1 (known as class 1a for the EFR) are protected by three parity bits used for error detection. These parity bits are added to the 50 bits, according to a degenerate (shortened) cyclic code (53,50,2), using the generator polynomial: g(d) = D3 + D + 1 The encoding of the cyclic code is performed in a systematic form, which means that, in GF(2), the polynomial: d(0)d52 + d(1)d51 +... + d(49)d3 + p(0)d2 + p(1)d+ p(2) where p(0), p(1), p(2) are the parity bits, when divided by g(d), yields a remainder equal to: 1 + D + D2 b) Tailing bits and reordering: The information and parity bits of class 1 are reordered, defining 189 information + parity + tail bits of class 1, {u(0),u(1),...,u(188)} defined by: u(k) = d(2k) and u(184-k) = d(2k+1) for k = 0,1,...,90

19 TS 05.03 V8.9.0 (2005-01) u(91+k) = p(k) for k = 0,1,2 u(k) = 0 for k = 185,186,187,188 (tail bits) 3.1.2.2 Convolutional encoder The class 1 bits are encoded with the 1/2 rate convolutional code defined by the polynomials: G0 = 1 + D3+ D4 G1 = 1 + D + D3+ D4 The coded bits {c(0), c(1),..., c(455)} are then defined by: - class 1: c(2k) = u(k) + u(k-3) + u(k-4) c(2k+1) = u(k) + u(k-1) + u(k-3) + u(k-4) for k = 0,1,...,188 u(k) = 0 for k < 0 - class 2: c(378+k) = d(182+k) for k = 0,1,...,77 3.1.3 Interleaving The coded bits are reordered and interleaved according to the following rule: i(b,j) = c(n,k), for k = 0,1,...,455 n = 0,1,...,N,N+1,... B = B 0 + 4n + (k mod 8) j = 2((49k) mod 57) + ((k mod 8) div 4) See table 1. The result of the interleaving is a distribution of the reordered 456 bits of a given data block, n = N, over 8 blocks using the even numbered bits of the first 4 blocks (B = B 0 + 4N + 0, 1, 2, 3) and odd numbered bits of the last 4 blocks (B = B 0 + 4N + 4, 5, 6, 7). The reordered bits of the following data block, n = N+1, use the even numbered bits of the blocks B = B 0 + 4N + 4, 5, 6, 7 (B = B 0 + 4(N+1) + 0, 1, 2, 3) and the odd numbered bits of the blocks B = B 0 + 4(N+1) + 4, 5, 6, 7. Continuing with the next data blocks shows that one block always carries 57 bits of data from one data block (n = N) and 57 bits of data from the next block (n = N+1), where the bits from the data block with the higher number always are the even numbered data bits, and those of the data block with the lower number are the odd numbered bits. The block of coded data is interleaved "block diagonal", where a new data block starts every 4 th block and is distributed over 8 blocks. 3.1.4 Mapping on a Burst The mapping is given by the rule: and e(b,j) = i(b,j) and e(b,59+j) = i(b,57+j) for j = 0,1,...,56 e(b,57) = hl(b) and e(b,58) = hu(b) The two bits, labelled hl(b) and hu(b) on burst number B are flags used for indication of control channel signalling. For each TCH/FS block not stolen for signalling purposes: hu(b) = 0 for the first 4 bursts (indicating status of even numbered bits) hl(b) = 0 for the last 4 bursts (indicating status of odd numbered bits) For the use of hl(b) and hu(b) when a speech frame is stolen for signalling purposes see subclause 4.2.5.

20 TS 05.03 V8.9.0 (2005-01) 3.2 Speech channel at half rate (TCH/HS) The speech coder delivers to the channel encoder a sequence of blocks of data. In case of a half rate speech TCH, one block of data corresponds to one speech frame. Each block contains 112 bits, including 95 bits of class 1 (protected bits), and 17 bits of class 2 (no protection), see tables 3a and 3b. The bits delivered by the speech coder are received in the order indicated in GSM 06.20 and have to be arranged according to either table 3a or table 3b before channel encoding as defined in subclauses 3.2.1 to 3.2.4. The rearranged bits are labelled {d(0),d(1),...,d(111)}. Table 3a has to be taken if parameter Mode = 0 (which means that the speech encoder is in unvoiced mode), while table 3b has to be taken if parameter Mode = 1, 2 or 3 (which means that the speech encoder is in voiced mode). 3.2.1 Parity and tailing for a speech frame a) Parity bits: The most significant 22 class 1 bits d(73),d(74),...,d(94) are protected by three parity bits used for error detection. These bits are added to the 22 bits, according to a cyclic code using the generator polynomial: g(d) = D3 + D + 1 The encoding of the cyclic code is performed in a systematic form, which means that, in GF(2), the polynomial: d(73)d24 + d(74)d23 +... + d(94)d3 + p(0)d2 + p(1)d + p(2) where p(0), p(1), p(2) are the parity bits, when divided by g(d), yields a remainder equal to: 1 + D + D2. b) Tail bits and reordering: The information and parity bits of class 1 are reordered, defining 104 information + parity + tail bits of class 1, {u(0),u(1),...,u(103)} defined by: u(k) = d(k) for k = 0,1,...,94 u(k) = p(k-95) for k = 95,96,97 u(k) = 0 for k = 98,99,...,103 (tail bits) 3.2.2 Convolutional encoder The class 1 bits are encoded with the punctured convolutional code defined by the mother polynomials: G4 = 1 + D2 + D3 + D5 + D6 G5 = 1 + D + D4 + D6 G6 = 1 + D + D2 + D3 + D4 + D6 and the puncturing matrices: (1,0,1) for {u(0),u(1),...,u(94)} (class 1 information bits); and {u(98),u(99),...,u(103)} (tail bits). (1,1,1) for {u(95),u(96),u(97)} (parity bits) In the puncturing matrices, a 1 indicates no puncture and a 0 indicates a puncture. The coded bits {c(0),c(1),...,c(227)} are then defined by: class 1 information bits: c(2k) = u(k)+u(k-2)+u(k-3)+ (k-5)+u(k-6)

21 TS 05.03 V8.9.0 (2005-01) c(2k+1) = u(k)+u(k-1)+u(k-2)+u(k-3)+u(k-4)+u(k-6) for k = 0,1,...,94;u(k) = 0 for k<0 parity bits: c(3k-95) = u(k)+u(k-2)+u(k-3)+u(k-5)+u(k-6) c(3k-94) = u(k)+u(k-1)+u(k-4)+u(k-6) c(3k-93) = u(k)+u(k-1)+u(k-2)+u(k-3)+u(k-4)+u(k-6) for k = 95,96,97 tail bits: c(2k+3) = u(k)+u(k-2)+u(k-3)+u(k-5)+u(k-6) c(2k+4) = u(k)+u(k-1)+u(k-2)+u(k-3)+u(k-4)+u(k-6) for k = 98,99,...,103 class 2 information bits: c(k+211) = d(k+95) for k = 0,1,...,16 3.2.3 Interleaving The coded bits are reordered and interleaved according to the following rule: i(b,j) = c(n,k) for k = 0,1,...,227 n = 0,1,...,N,N+1,... B = B0 + 2n + b The values of b and j in dependence of k are given by table 4. The result of the interleaving is a distribution of the reordered 228 bits of a given data block, n = N, over 4 blocks using the even numbered bits of the first 2 blocks (B = B0+2N+0,1) and the odd numbered bits of the last 2 blocks (B = B0+2N+2,3). The reordered bits of the following data block, n = N + 1, use the even numbered bits of the blocks B = B0 + 2N + 2,3 (B = B0+2(N+1)+0,1) and the odd numbered bits of the blocks B = B0 + 2(N+1) + 2,3. Continuing with the next data blocks shows that one block always carries 57 bits of data from one data block (n = N) and 57 bits from the next block (n = N+1), where the bits from the data block with the higher number always are the even numbered data bits, and those of the data block with the lower number are the odd numbered bits. The block of coded data is interleaved "block diagonal", where a new data block starts every 2 nd block and is distributed over 4 blocks. 3.2.4 Mapping on a burst The mapping is given by the rule: and e(b,j) = i(b,j) and e(b,59+j) = i(b,57+j) for j = 0,1,...,56 e(b,57) = hl(b) and e(b,58) = hu(b) The two bits, labelled hl(b) and hu(b) on burst number B are flags used for indication of control channel signalling. For each TCH/HS block not stolen for signalling purposes: hu(b) = 0 for the first 2 bursts (indicating status of the even numbered bits) hl(b) = 0 for the last 2 bursts (indicating status of the odd numbered bits) For the use of hl(b) and hu(b) when a speech frame is stolen for signalling purposes, see subclause 4.3.5. 3.3 Data channel at full rate, 12.0 kbit/s radio interface rate (9.6 kbit/s services (TCH/F9.6)) The definition of a 12.0 kbit/s radio interface rate data flow for data services is given in GSM 04.21.

22 TS 05.03 V8.9.0 (2005-01) 3.3.1 Interface with user unit The user unit delivers to the encoder a bit stream organized in blocks of 60 information bits (data frames) every 5 ms. Four such blocks are dealt with together in the coding process {d(0),...,d(239)}. For non-transparent services those four blocks shall align with one 240-bit RLP frame. 3.3.2 Block code The block of 4 * 60 information bits is not encoded, but only increased with 4 tail bits equal to 0 at the end of the block. u(k) = d(k) for k = 0,1,...,239 u(k) = 0 for k = 240,241,242,243 (tail bits) 3.3.3 Convolutional encoder This block of 244 bits {u(0),...,u(243)} is encoded with the 1/2 rate convolutional code defined by the following polynomials: G0 = 1 + D3 + D4 G1 = 1 + D + D3+ D4 resulting in 488 coded bits {C(0), C(1),..., C(487)} with C(2k) = u(k) + u(k-3) + u(k-4) C(2k+1) = u(k) + u(k-1) + u(k-3) + u(k-4) for k = 0,1,...,243 ; u(k) = 0 for k < 0 The code is punctured in such a way that the following 32 coded bits: {C(11+15j) for j = 0,1,...,31} are not transmitted. The result is a block of 456 coded bits, {c(0),c(1),..., c(455)} 3.3.4 Interleaving The coded bits are reordered and interleaved according to the following rule: i(b,j) = c(n,k) for k = 0,1,...,455 n = 0,1,...,N,N + 1,... B = B 0 +4n + (k mod 19) + (k div 114) j = (k mod 19) + 19 (k mod 6) The result of the interleaving is a distribution of the reordered 114 bit of a given data block, n = N, over 19 blocks, 6 bits equally distributed in each block, in a diagonal way over consecutive blocks. Or in other words the interleaving is a distribution of the encoded, reordered 456 bits from four given input data blocks, which taken together give n = N, over 22 bursts, 6 bits equally distributed in the first and 22 nd bursts, 12 bits distributed in the second and 21 st bursts, 18 bits distributed in the third and 20 th bursts and 24 bits distributed in the other 16 bursts. The block of coded data is interleaved "diagonal", where a new block of coded data starts with every fourth burst and is distributed over 22 bursts. 3.3.5 Mapping on a Burst The mapping is done as specified for TCH/FS in subclause 3.1.4. On bitstealing by a FACCH, see subclause 4.2.5.

23 TS 05.03 V8.9.0 (2005-01) 3.4 Data channel at full rate, 6.0 kbit/s radio interface rate (4.8 kbit/s services (TCH/F4.8)) The definition of a 6.0 kbit/s radio interface rate data flow for data services is given in GSM 04.21. 3.4.1 Interface with user unit The user unit delivers to the encoder a bit stream organized in blocks of 60 information bits (data frames) every 10 ms, {d(0),d(1),...,d(59)}. In the case where the user unit delivers to the encoder a bit stream organized in blocks of 240 information bits every 40 ms (e.g. RLP frames), the bits {d(0),d(1),...,d(59),d(60),...,d(60+59), d(2*60),...,d(2*60+59), d(3*60),...,d(3*60+59)} shall be treated as four blocks of 60 bits each as described in the remainder of this clause. To ensure end-to-end synchronization of the 240 bit blocks, the resulting block after coding of the first 120 bits {d(0),d(1),...,d(60+59)} shall be transmitted in one of the transmission blocks B0, B2, B4 of the channel mapping defined in GSM 05.02. 3.4.2 Block code Sixteen bits equal to 0 are added to the 60 information bits, the result being a block of 76 bits, {u(0),u(1),...,u(75)}, with: u(19k+p) = d(15k+p)for k = 0,1,2,3 and p = 0,1,...,14; u(19k+p) = 0 for k = 0,1,2,3 and p = 15,16,17,18. Two such blocks forming a block of 152 bits {u'(0),u'(1),...,u'(151)} are dealt with together in the rest of the coding process: u'(k) = u1(k), k = 0,1,...,75 (u1 = 1 st block) u'(k+76) = u2(k), k = 0,1,...,75 (u2 = 2 nd block) 3.4.3 Convolutional encoder This block of 152 bits is encoded with the convolutional code of rate 1/3 defined by the following polynomials: G1 = 1 + D + D3 + D4 G2 = 1 + D2 + D4 G3 = 1 + D + D2 + D3 + D4 The result is a block of 3 * 152 = 456 coded bits, {c(0),c(1),...,c(455)}: c(3k) c(3k+1) = u'(k) + u'(k-1) + u'(k-3) + u'(k-4) = u'(k) + u'(k-2) + u'(k-4) c(3k+2) = u'(k) + u'(k-1) + u'(k-2) + u'(k-3) + u'(k-4) for k = 0,1,...,151; u'(k) = 0 for k < 0 3.4.4 Interleaving The interleaving is done as specified for the TCH/F9.6 in subclause 3.3.4. 3.4.5 Mapping on a Burst The mapping is done as specified for the TCH/FS in subclause 3.1.4. On bitstealing for signalling purposes by a FACCH, see subclause 4.2.5.

24 TS 05.03 V8.9.0 (2005-01) 3.5 Data channel at half rate, 6.0 kbit/s radio interface rate (4.8 kbit/s services (TCH/H4.8)) The definition of a 6.0 kbit/s radio interface rate data flow for data services is given in GSM 04.21. 3.5.1 Interface with user unit The user unit delivers to the encoder a bit stream organized in blocks of 60 information bits (data frames) every 10 ms. Four such blocks are dealt with together in the coding process, {d(0),d(1),...,d(239)}. For non-transparent services those four blocks shall align with one complete 240-bit RLP frame. 3.5.2 Block code The block encoding is done as specified for the TCH/F9.6 in subclause 3.3.2. 3.5.3 Convolutional encoder The convolutional encoding is done as specified for the TCH/F9.6 in subclause 3.3.3. 3.5.4 Interleaving The interleaving is done as specified for the TCH/F9.6 in subclause 3.3.4. 3.5.5 Mapping on a Burst The mapping is done as specified for the TCH/FS in subclause 3.1.4. On bitstealing for signalling purposes by a FACCH, see subclause 4.3.5. 3.6 Data channel at full rate, 3.6 kbit/s radio interface rate (2.4 kbit/s and less services (TCH/F2.4)) The definition of a 3.6 kbit/s radio interface rate data flow for data services is given in GSM 04.21. 3.6.1 Interface with user unit The user unit delivers to the encoder a bit stream organized in blocks of 36 information bits (data frames) every 10 ms. Two such blocks are dealt with together in the coding process, {d(0),d(1),...,d(71)}. 3.6.2 Block code This block of 72 information bits is not encoded, but only increased with four tail bits equal to 0 at the end of the block. u(k) = d(k), k = 0,1,...,71 u(k) = 0, k = 72,73,74,75 (tail bits); 3.6.3 Convolutional encoder This block of 76 bits {u(0),u(1),...,u(75)} is encoded with the convolutional code of rate 1/6 defined by the following polynomials: G1 = 1 + D + D3 +D4 G2 = 1 + D2 + D4

25 TS 05.03 V8.9.0 (2005-01) G3 = 1 + D + D2 + D3 + D4 G1 = 1 + D + D3 + D4 G2 = 1 + D2 + D4 G3 = 1 + D + D2 + D3 + D4 The result is a block of 456 coded bits: {c(0), c(1),...,c(455)}, defined by c(6k) c(6k+1) = c(6k+3) = u(k) + u(k-1) + u(k-3) + u(k-4) = c(6k+4) = u(k) + u(k-2) + u(k-4) c(6k+2) = c(6k+5) = u(k) + u(k-1) + u(k-2) + u(k-3) + u(k-4), for k = 0,1,...,75; u(k) = 0 for k < 0 3.6.4 Interleaving The interleaving is done as specified for the TCH/FS in subclause 3.1.3. 3.6.5 Mapping on a Burst The mapping is done as specified for the TCH/FS in subclause 3.1.4. 3.7 Data channel at half rate, 3.6 kbit/s radio interface rate (2.4 kbit/s and less services (TCH/H2.4)) The definition of a 3.6 kbit/s radio interface rate data flow for data services is given in GSM 04.21. 3.7.1 Interface with user unit The user unit delivers to the encoder a bit stream organized in blocks of 36 information bits (data frames) every 10 ms. Two such blocks are dealt with together in the coding process, {d(0),d(1),...,d(71)}. 3.7.2 Block code The block of 72 information bits is not encoded, but only increased with 4 tail bits equal to 0, at the end of the block. Two such blocks forming a block of 152 bits {u(0),u(1),...,u(151)} are dealt with together in the rest of the coding process. u(k) = d1(k), k = 0,1,...,75 (d1 = 1st information block) u(k+76) = d2(k), k = 0,1,...,75 (d2 = 2nd information block) u(k) = 0, k = 72,73,74,75,148,149,150,151 (tail bits) 3.7.3 Convolutional encoder The convolutional encoding is done as specified for the TCH/F4.8 in subclause 3.4.3. 3.7.4 Interleaving The interleaving is done as specified for the TCH/F9.6 in subclause 3.3.4.