hash stringlengths 32 32 | doc_id stringlengths 7 13 | section stringlengths 3 121 | content stringlengths 0 2.2M |
|---|---|---|---|
c26f502af59545c0bddf8ce8e94c7b28 | 100 929 | 3.3.3 Authentication at location updating in a new VLR, using IMSI | When the IMSI is used for identification, or more generally when the old VLR is not reachable, the procedure described in subclause 3.3.2 cannot be used. Instead, pairs of RAND/SRES contained in the security related information are requested directly from the HPLMN. The procedure is schematized in figure 3.5. ... |
c26f502af59545c0bddf8ce8e94c7b28 | 100 929 | 3.3.6 Authentication with IMSI if authentication with TMSI fails | If authentication of an MS which identifies itself with a TMSI is unsuccessful, the network requests the IMSI from the MS, and repeats the authentication using the IMSI. Optionally, if authentication using the TMSI fails the network may reject the access request or location registration request which triggered the auth... |
c26f502af59545c0bddf8ce8e94c7b28 | 100 929 | 3.3.7 Re-use of security related information in failure situations | Security related information consisting of sets of RAND, SRES and Kc is stored in the VLR and in the HLR. When a VLR has used a set of security related information to authenticate an MS, it shall delete the set of security related information or mark it as used. When a VLR needs to use security related information, it ... |
c26f502af59545c0bddf8ce8e94c7b28 | 100 929 | 4.1 Generality | In GSM 02.09, some signalling information elements are considered sensitive and must be protected. To ensure identity confidentiality (see clause 2), the Temporary Subscriber Identity must be transferred in a protected mode at allocation time and at other times when the signalling procedures permit it. The confidential... |
c26f502af59545c0bddf8ce8e94c7b28 | 100 929 | 4.2 The ciphering method | The layer 1 data flow (transmitted on DCCH or TCH) is ciphered by a bit per bit or stream cipher, i.e. the data flow on the radio path is obtained by the bit per bit binary addition of the user data flow and a ciphering bit stream, generated by algorithm A5 using a key determined as specified in subclause 4.3. The key ... |
c26f502af59545c0bddf8ce8e94c7b28 | 100 929 | 4.3 Key setting | Mutual key setting is the procedure that allows the mobile station and the network to agree on the key Kc to use in the ciphering and deciphering algorithms A5. A key setting is triggered by the authentication procedure. Key setting may be initiated by the network as often as the network operator wishes. Key setting mu... |
c26f502af59545c0bddf8ce8e94c7b28 | 100 929 | 4.4 Ciphering key sequence number | The ciphering key sequence number is a number which is associated with the ciphering key Kc and they are stored together in the mobile station and in the network. However since it is not directly involved in any security mechanism, it is not addressed in the present document but in GSM 04.08 instead. |
c26f502af59545c0bddf8ce8e94c7b28 | 100 929 | 4.5 Starting of the ciphering and deciphering processes | The MS and the BSS must co-ordinate the instants at which the enciphering and deciphering processes start on DCCH and TCH. On DCCH, this procedure takes place under the control of the network some time after the completion of the authentication procedure (if any), or after the key Kc has been made available at the BSS.... |
c26f502af59545c0bddf8ce8e94c7b28 | 100 929 | 4.6 Synchronization | The enciphering stream at one end and the deciphering stream at the other end must be synchronized, for the enciphering bit stream and the deciphering bit streams to coincide. The underlying Synchronization scheme is described in annex C. ETSI ETSI TS 100 929 V7.2.0 (1999-11) 32 (GSM 03.20 version 7.2.0 Release 1998) |
c26f502af59545c0bddf8ce8e94c7b28 | 100 929 | 4.7 Handover | When a handover occurs, the necessary information (e.g. key Kc, initialization data) is transmitted within the system infrastructure to enable the communication to proceed from the old BSS to the new one, and the Synchronization procedure is resumed. The key Kc remains unchanged at handover. |
c26f502af59545c0bddf8ce8e94c7b28 | 100 929 | 4.8 Negotiation of A5 algorithm | Not more then seven versions of the A5 algorithm will be defined. When an MS wishes to establish a connection with the network, the MS shall indicate to the network which of the seven versions of the A5 algorithm it supports. The network shall not provide service to an MS which indicates that it does not support the ci... |
c26f502af59545c0bddf8ce8e94c7b28 | 100 929 | 5 Synthetic summary | Figure 5.1 shows in a synopsis a normal location updating procedure with all elements pertaining to security functions, i.e. to TMSI management, authentication and Kc management. " ... |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 1 Scope | A reference configuration of the transmission chain is shown in GSM 05.01 [4]. According to this reference configuration, this technical TS 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 d... |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 1.1 Normative references | References may be made to: a) specific versions of publications (identified by date of publication, edition number, version number, etc.), in which case, subsequent revisions to the referenced document do not apply; or b) all versions up to and including the identified version (identified by "up to and including" befor... |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 1.2 Abbreviations | Abbreviations used in this TS are listed in GSM 01.04. |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 2 General | |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 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,... |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 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; "Kx" gives the amount of bits in one block, where "x" refers to the data type; "n" is used for numbering of delivered data blocks... |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 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. ETSI TS 100 909 V6.1.1 (1998-07) 11 GSM 05.03 version 6.1.1 Release 1997 |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 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 cl... |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 3.1.1 Preliminary channel coding for EFR only | |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 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) = D8 + D4 + D3 + D2 + 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 ... |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 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. ETSI TS 100 909 V6.1.1 (1998-07) 12 GSM 05.03 version 6.1.1 Release 1997 |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 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: w(k) = s(70) for k = 72 and 73 w(k) = s(120) for k = 124 and 125 w(k) =... |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 3.1.2 Channel coding for FR and EFR | |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 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 ... |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 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 - clas... |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 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 = B0 + 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, o... |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 3.1.4 Mapping on a Burst | The mapping is given by the rule: e(B,j) = i(B,j) and e(B,59+j) = i(B,57+j) for j = 0,1,...,56 and 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... |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 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. ETSI TS 100 909 ... |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 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, whi... |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 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... |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 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, ... |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 3.2.4 Mapping on a burst | The mapping is given by the rule: e(B,j) = i(B,j) and e(B,59+j) = i(B,57+j) for j = 0,1,...,56 and 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... |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 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. ETSI TS 100 909 V6.1.1 (1998-07... |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 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) |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 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... |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 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 = B0 +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 blo... |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 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. 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. ETSI TS 1... |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 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(... |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 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 t... |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 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) = u'(k) + u'(k-1) + u'(k-3) + u'(k-4) c(3k+1) = u'(k) + u'(k-2)... |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 3.4.4 Interleaving | The interleaving is done as specified for the TCH/F9.6 in subclause 3.3.4. |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 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. 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 g... |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 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. |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 3.5.2 Block code | The block encoding is done as specified for the TCH/F9.6 in subclause 3.3.2. |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 3.5.3 Convolutional encoder | The convolutional encoding is done as specified for the TCH/F9.6 in subclause 3.3.3. |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 3.5.4 Interleaving | The interleaving is done as specified for the TCH/F9.6 in subclause 3.3.4. |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 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 serv... |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 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)}. |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 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); |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 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 G3 = 1 + D + D2 + D3 + D4 G1 = 1 + D + D3 + D4 G2 = 1 + D2 + D4 G3 = 1 + D + D2 + D3 + D4 ETSI TS 100 909 V6.1.1 (1998-07) 19 GSM 05.03 version 6.1.1 ... |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 3.6.4 Interleaving | The interleaving is done as specified for the TCH/FS in subclause 3.1.3. |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 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. |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 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)}. |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 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... |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 3.7.3 Convolutional encoder | The convolutional encoding is done as specified for the TCH/F4.8 in subclause 3.4.3. |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 3.7.4 Interleaving | The interleaving is done as specified for the TCH/F9.6 in subclause 3.3.4. |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 3.7.5 Mapping on a Burst | The mapping is done as specified for the TCH/FS in subclause 3.1.4. On bit stealing for signalling purposes by a FACCH, see subclause 4.3.5. ETSI TS 100 909 V6.1.1 (1998-07) 20 GSM 05.03 version 6.1.1 Release 1997 3.8 Data channel at full rate, 14.5 kbit/s radio interface rate (14.4 kbit/s services (TCH/F14.4)) The def... |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 3.8.1 Interface with user unit | The user unit delivers to the encoder a bit stream organized in blocks of 290 information bits (data frames) every 20 ms. |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 3.8.2 Block code | The block of 290 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,...,289 u(k) = 0 for k = 290,291,292,293 (tail bits) |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 3.8.3 Convolutional encoder | This block of 294 bits {u(0),...,u(293)} 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 588 coded bits {C(0), C(1),..., C(587)} 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,...,293 ; u(k... |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 3.8.4 Interleaving | The interleaving is done as specified for the TCH/F9.6 in section 3.3.4 |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 3.8.5 Mapping on a Burst | The mapping is done as specified for TCH/FS in section 3.1.4. On bitstealing by a FACCH, see section 4.2.5. ETSI TS 100 909 V6.1.1 (1998-07) 21 GSM 05.03 version 6.1.1 Release 1997 |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 4 Control Channels | |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 4.1 Slow associated control channel (SACCH) | |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 4.1.1 Block constitution | The message delivered to the encoder has a fixed size of 184 information bits {d(0),d(1),...,d(183)}. It is delivered on a burst mode. |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 4.1.2 Block code | a) Parity bits: The block of 184 information bits is protected by 40 extra bits used for error correction and detection. These bits are added to the 184 bits according to a shortened binary cyclic code (FIRE code) using the generator polynomial: g(D) = (D23 + 1)*(D17 + D3 + 1) The encoding of the cyclic code is perform... |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 4.1.3 Convolutional encoder | This block of 228 bits is encoded with the 1/2 rate convolutional code (identical to the one used for TCH/FS) defined by the polynomials: G0 = 1 + D3 + D4 G1 = 1 + D + D3 + D4 This results in a block of 456 coded bits: {c(0),c(1),...,c(455)} defined by: c(2k) = u(k) + u(k-3) + u(k-4) c(2k+1) = u(k) + u(k-1) + u(k-3) + ... |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 4.1.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 = B0 + 4n + (k mod 4) j = 2((49k) mod 57) + ((k mod 8) div 4) See table 1. The result of the reordering of bits is the same as given for a TCH/FS (subclause 3.1.3) as can be seen from... |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 4.1.5 Mapping on a Burst | The mapping is given by the rule: e(B,j) = i(B,j) and e(B,59+j) = i(B,57+j) for j = 0,1,...,56 and 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. They are set to "1" for a SACCH. |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 4.2 Fast associated control channel at full rate (FACCH/F) | |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 4.2.1 Block constitution | The message delivered to the encoder has a fixed size of 184 information bits. It is delivered on a burst mode. |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 4.2.2 Block code | The block encoding is done as specified for the SACCH in subclause 4.1.2. |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 4.2.3 Convolutional encoder | The convolutional encoding is done as specified for the SACCH in subclause 4.1.3. |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 4.2.4 Interleaving | The interleaving is done as specified for the TCH/FS in subclause 3.1.3. |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 4.2.5 Mapping on a Burst | A FACCH/F frame of 456 coded bits is mapped on 8 consecutive bursts as specified for the TCH/FS in subclause 3.1.4. As a FACCH is transmitted on bits which are stolen in a burst from the traffic channel, the even numbered bits in the first 4 bursts and the odd numbered bits of the last 4 bursts are stolen. ETSI TS 100 ... |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 4.3 Fast associated control channel at half rate (FACCH/H) | |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 4.3.1 Block constitution | The message delivered to the encoder has a fixed size of 184 information bits. It is delivered on a burst mode. |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 4.3.2 Block code | The block encoding is done as specified for the SACCH in subclause 4.1.2. |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 4.3.3 Convolutional encoder | The convolutional encoding is done as specified for the SACCH in subclause 4.1.3. |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 4.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 = B0 + 4n + (k mod 8) - 4((k mod 8) div 6) j = 2((49k) mod 57) + ((k mod 8) div 4) See table 1. The result of the reordering of bits is the same as given for a TCH/FS (subclause 3.1.3... |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 4.3.5 Mapping on a Burst | A FACCH/H frame of 456 coded bits is mapped on 6 consecutive bursts by the rule: e(B,j) = i(B,j) and e(B,59+j) = i(B,57+j) for j = 0,1,...,56 and e(B,57) = hl(B) and e(B,58) = hu(B) As a FACCH/H is transmitted on bits which are stolen from the traffic channel, the even numbered bits of the first 2 bursts, all bits of t... |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 4.5 Stand-alone dedicated control channel (SDCCH) | The coding scheme used for the dedicated control channel messages is the same as for SACCH messages, specified in subclause 4.1. ETSI TS 100 909 V6.1.1 (1998-07) 25 GSM 05.03 version 6.1.1 Release 1997 |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 4.6 Random access channel (RACH) | The burst carrying the random access uplink message has a different structure. It contains 8 information bits d(0),d(1),...,d(7). Six parity bits p(0),p(1),...,p(5) are defined in such a way that in GF(2) the binary polynomial: d(0)D13 +...+ d(7)D6 + p(0)D5 +...+ p(5), when divided by D6 + D5 + D3 + D2 + D + 1 yields a... |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 4.7 Synchronization channel (SCH) | The burst carrying the synchronization information on the downlink BCCH has a different structure. It contains 25 information bits {d(0),d(1),..., d(24)}, 10 parity bits {p(0),p(1),..., p(9)} and 4 tail bits. The precise ordering of the information bits is given in GSM 04.08. The ten parity bits {p(0),p(1),,...,p(9)} a... |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 4.8 Access Burst on circuit switched channels other than RACH | The encoding of this burst is as defined in subclause 4.6 for the random access channel (RACH). The BSIC used shall be the BSIC of the BTS to which the burst is intended. 4.9 Access Bursts for uplink access on a channel used for VGCS The encoding of this burst is as defined in subclause 4.5 for the RACH. The BSIC used ... |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 5 Packet Switched Channels | |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 5.1 Packet data traffic channel (PDTCH) | Four coding schemes are specified for the packet data traffic channels. For the three coding schemes CS-2 to CS-4, the first three bits (USF-bits) of the data block are encoded such that the first twelve coded bits are representing the same bit pattern, irrespective of the coding scheme, depending only on the USF-bits.... |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 5.1.1 Packet data block type 1 (CS-1) | The coding scheme used for packet data block type 1 is the same as for SACCH as specified in section 4.1. The flags hl(B) and hu(B) set to “1” identify the coding scheme CS-1. |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 5.1.2 Packet data block type 2 (CS-2) | |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 5.1.2.1 Block constitution | The message delivered to the encoder has a fixed size of 271 information bits {d(0),d(1),...,d(270)}. It is delivered on a burst mode. |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 5.1.2.2 Block code | a) USF precoding: The first three bits d(0),d(1),d(2) are precoded into six bits u’(0),u’(1),...,u’(5) according to the following table: ETSI TS 100 909 V6.1.1 (1998-07) 27 GSM 05.03 version 6.1.1 Release 1997 d(0),d(1),d(2) u’(0),u’(1),...,u’(5) 000 000 000 001 001 011 010 010 110 011 011 101 100 100 101 101 101 110 1... |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 5.1.2.3 Convolutional encoder | This block of 294 bits {u(0),u(1),...,u(293)} is encoded with the 1/2 rate convolutional code (identical to the one used for TCH/FS) defined by the polynomials: G0 = 1 + D3 + D4 G1 = 1 + D + D3 + D4 This results in a block of 588 coded bits: {C(0),C(1),...,C(587)} defined by: C(2k) = u(k) + u(k-3) + u(k-4) C(2k+1) = u(... |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 5.1.2.4 Interleaving | The interleaving is done as specified for SACCH in section 4.1.4. |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 5.1.2.5 Mapping on a burst | The mapping is given by the rule: e(B,j) = i(B,j) and e(B,59+j) = i(B,57+j) for j = 0,1,...,56 and e(B+m,57) = q(2m) and e(B+m,58) = q(2m+1) for m = 0,1,2,3 ETSI TS 100 909 V6.1.1 (1998-07) 28 GSM 05.03 version 6.1.1 Release 1997 where q(0),q(1),...,q(7) = 1,1,0,0,1,0,0,0 identifies the coding scheme CS-2. |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 5.1.3 Packet data block type 3 (CS-3) | |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 5.1.3.1 Block constitution | The messages delivered to the encoder has a fixed size of 315 information bits {d(0),d(1),...,d(314)}. It is delivered on a burst mode. |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 5.1.3.2 Block code | a) USF precoding: The first three bits d(0),d(1),d(2) are precoded into six bits u’(0),u’(1),...,u’(5) as specified for CS-2 in section 5.1.2.2.a). b) Parity bits: Sixteen parity bits p(0),p(1),...,p(15) are defined in such a way that in GF(2) the binary polynomial: d(0)D330 +...+ d(314)D16 + p(0)D15 +...+ p(15), when ... |
b03a5e12102d53d92940a49c0e1cfb88 | 100 909 | 5.1.3.3 Convolutional encoder | This block of 338 bits {u(0),u(1),...,u(337)} is encoded with the 1/2 rate convolutional code (identical to the one used for TCH/FS) defined by the polynomials: G0 = 1 + D3 + D4 G1 = 1 + D + D3 + D4 This results in a block of 676 coded bits: {C(0),C(1),...,C(675)} defined by: C(2k) = u(k) + u(k-3) + u(k-4) C(2k+1) = u(... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.