text:
Uploaded by koko_2013
3GPP
saveSave 0503-890 For Later
EEWeb Pulse - Issue 18, 2011
Block Coding
Turbo Codes
2014.02.Samsung.lte B4G Standardization
ESTANDAR1
WCDMA Principle
Egprs Coding Schemes
Currents 2000s
TTCN3 in details
Radyne_QAM256
Ct Seminar
1 WCDMA Principle.
ECC.pdf
Evolved Universal Terrestrial Radio Access Network (E-UTRAN); Study on RAN Sharing Enhancements
InTech-Throughput Efficiency of Hybrid Arq Error Controlling Scheme for Uwb Body Area Network
3G Channels
dcpart1
drf7020d27
DC Coding and Decoding with Convolutional Codes
IT2302-ITC V00
3rd Generation Partnership Project; Technical Specification Group GSM/EDGE Radio Access
3GPP TS 05.03 V8.9.0 (2005-01)
Network;
(Release 1999)
GLOBAL SYSTEM FOR MOBILE COMMUNICATIONS
The present document has been developed within the 3 rd Generation Partnership Project (3GPP TM ) and may be further elaborated for the purposes of 3GPP.
The present document has not been subject to any approval process by the 3GPP Organizational Partners and shall not be implemented. This Specification is provided for future development work within 3GPP only. The Organizational Partners accept no liability for any use of this Specification. Specifications and reports for implementation of the 3GPP TM system should be obtained via the 3GPP Organizational Partners' Publications Offices.
GSM, radio
3GPP 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
http://www.3gpp.org
No part may be reproduced except as authorized by written permission. The copyright and the foregoing restriction extend to reproduction in all media.
© 2005, 3GPP Organizational Partners (ARIB, ATIS, CCSA, ETSI, TTA, TTC). All rights reserved.
Contents....................................................................................................................................................3
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.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)).................................22
3.3.1 Interface with user unit......................................................................................................................................22
3.3.2 Block code.........................................................................................................................................................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.5 Data channel at half rate, 6.0 kbit/s radio interface rate (4.8 kbit/s services (TCH/H4.8))..................................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.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.8 Data channel at full rate, 14.5 kbit/s radio interface rate (14.4 kbit/s services (TCH/F14.4)).............................26
3.9 Adaptive multi rate speech channel at full rate (TCH/AFS)................................................................................27
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............................................................28
3.9.1.3 Identification marker......................................................................................................................................29
3.9.1.4 Interleaving....................................................................................................................................................29
3.9.1.5 Mapping on a Burst........................................................................................................................................29
3.9.2 SID_FIRST.......................................................................................................................................................29
3.9.3 ONSET 30
3.9.4 SPEECH............................................................................................................................................................30
3.9.4.1 Coding of the in-band data.............................................................................................................................31
3.9.4.2 Ordering according to subjective importance................................................................................................31
3.9.4.3 Parity for speech frames.................................................................................................................................31
3.9.5 RATSCCH........................................................................................................................................................40
3.9.5.2 Parity and convolutional encoding for the RATSCCH message...................................................................40
3.10 Adaptive multi rate speech channel at half rate (TCH/AHS)............................................................................41
3.10.1 SID_UPDATE.................................................................................................................................................42
3.10.1.1 Coding of in-band data.................................................................................................................................42
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.......................................................................................................................................44
3.10.3 SID_FIRST_P1...............................................................................................................................................45
3.10.5 SID_FIRST_INH............................................................................................................................................46
3.10.6 ONSET............................................................................................................................................................46
3.10.7 SPEECH..........................................................................................................................................................47
3.10.7.1 Coding of the in-band data...........................................................................................................................47
3.10.7.2 Ordering according to subjective importance..............................................................................................47
3.10.7.3 Parity for speech frames...............................................................................................................................48
3.10.7.4 Convolutional encoder.................................................................................................................................49
3.10.8 RATSCCH_MARKER...................................................................................................................................53
3.10.9 RATSCCH_DATA.........................................................................................................................................54
3.10.9.2 Parity and convolutional encoding for the RATSCCH message.................................................................54
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.........................................................................................................................................58
3.12.2 Void 59
3.12.3 Convolutional encoder ...................................................................................................................................59
3.13.3 Interleaving ....................................................................................................................................................61
3.13.4 Mapping on a Burst ........................................................................................................................................61
4 Control Channels..................................................................................................................................61
4.1 Slow associated control channel (SACCH).........................................................................................................61
4.1.1 Block constitution.............................................................................................................................................61
4.2 Fast associated control channel at full rate (FACCH/F)......................................................................................62
4.3 Fast associated control channel at half rate (FACCH/H).....................................................................................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)....................................65
4.5 Stand-alone dedicated control channel (SDCCH)................................................................................................65
4.6 Random access channel (RACH).........................................................................................................................65
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
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.1 Block constitution..........................................................................................................................................68
5.1.2.2 Block code......................................................................................................................................................68
5.1.2.5 Mapping on a burst.........................................................................................................................................69
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.................................................................................................................................................72
5.1.5.1.5 Interleaving.................................................................................................................................................73
5.1.5.1.6 Mapping on a burst......................................................................................................................................73
5.1.5.2 Uplink (MCS-1 UL).......................................................................................................................................74
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.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...............................................................113
Annex B (informative):
Summary of Polynomials Used for Convolutional Codes................115
Annex C (informative):
Change history....................................................................................116
This Technical Specification has been produced by the 3 rd Generation Partnership Project (3GPP).
The contents of the present document are subject to continuing work within the TSG and may change following formal TSG approval. 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
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.
the second digit is incremented for all changes of substance, i.e. technical enhancements, corrections,
updates, etc. the third digit is incremented when editorial only changes have been incorporated in the document.
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.
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).
GSM 01.04: "Digital cellular telecommunications system (Phase 2+); Abbreviations and acronyms".
GSM 04.08: "Digital cellular telecommunications system (Phase 2+); Mobile radio interface layer 3 specification".
GSM 04.21: "Digital cellular telecommunications system (Phase 2+); Rate adaption on the Mobile Station - Base Station System (MS - BSS) interface".
GSM 05.01: "Digital cellular telecommunications system (Phase 2+); Physical layer on the radio path General description".
GSM 05.02: "Digital cellular telecommunications system (Phase 2+); Multiplexing and multiple access on the radio path".
GSM 05.05: "Digital cellular telecommunications system (Phase 2+); Radio Transmission and Reception".
GSM 05.09: "Digital cellular telecommunications system (Phase 2+); Link adaptation".
GSM 06.10: "Digital cellular telecommunications system; Full rate speech transcoding".
GSM 06.20: "Digital cellular telecommunications system; Half rate speech transcoding".
GSM 06.60: "Digital cellular telecommunications system; Enhanced Full Rate (EFR) speech transcoding".
GSM 06.90: "Digital cellular telecommunications system; Adaptive Multi-Rate speech transcoding".
GSM 06.93: "Digital cellular telecommunications system; Discontinous transmission (DTX) for Adaptive Multi-Rate speech traffic channels".
GSM 03.64: "Digital cellular telecommunications system (Phase 2+); General Packet Radio Service (GPRS); Overall description of the GPRS Radio Interface; Stage 2".
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".
Abbreviations used in the present document are listed in GSM 01.04.
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.
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.
TCH/EFS (Enhanced full rate speech TCH)
speech frame
cyclic code
+ repetition
in: 244 bits
out: 260 bits
PTCCH/U
SACCH, FACCH,
BCCH, CBCH, PCH
AGCH, SDCCH
RACH,
PDTCH(1-4),
TCH/HS
TCH/FS
PBCCH, PAGCH,
(half rate
(full rate
CTSBCH-SB,
PPCH, PNCH,
speech TCH)
CTSAGCH, CTSPCH
data TCHs
CTSARCH
PTCCH/D
data frame
RLC block
P0 bits
Q0 bits
N0 bits
4.6, 4.7, 5.3.2
3.n.1
5.1.n.1
CS-1
+ tail
+tail
in: N0 bits
in: P0 bits
in: Q0 bits
out: N1 bits
out: P1 bits
out: Q1 bits
convolutional
k=7, 2 classes
k=5, rate 1/2
k=5, rate r
in: P1
TCH/F2.4
reordering and partitioning
+stealing flag
+code identifier
out: 4 blocks
3.1.3, 4.1.4, 4.3.4
TCH/FS, TCH/EFS
TCH/F2.4, FACCH
block diagonal
in: 4 blocks
out: pairs of
block rectangular
diagonal interleaving
+ stealing flags
diagonally interleaved
to depth 19, starting
on consecutive bursts
encryption unit
Figure 1a: Channel Coding and Interleaving Organization
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.
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
Subjective
in: 95
out: 95
block code
cyclic codel
in: 2 bits
out: 4 bits
out: 101 250 ..
K=5 or 7
rate 1/3
rate 1/5 1/2 ..
in: 101
out: 172 212
3.10.7.5 -> 3.2.3
3.9.4.5 -> 3.1.3
Figure 1b: Channel Coding and Interleaving Organization, adaptive multi-rate speech
In each box, the last line indicates the chapter defining the function.
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).
E-TCH/F28.8
+ repeated bits
shortened RS code
out: 85 symbols
+ tail bits
convolutional code
k=7, rate=1/2
out: 1368 bits
over 19 bursts
in: 1368 bits
Figure 2a: Channel Coding and Interleaving Organization for ECSD 8-PSK modulated signals
PTDCH(n=5-8)
PTDCH(n=9,10)
PTDCH(n=11-13)
downlink
uplink
31+Q0 bits
5.1.n.1.1
(no tail)
in: 25 bits
out: 33 bits
5.1.11.1.3
k=7, rate 0.33
k=7, rate 45/136
k=7, rate 27/80
out: pair of blocks
block rectangular interleaving in: 100 bits out: 100 bits
block rectangular interleaving
in: 160 bits out: 160 bits
k=7, rate 9/17
reordering and partitioning +code identifier in: 456 bits out: 8 blocks
reordering and partitioning +code identifier
in: 456 bits out: 8 blocks
Figure 2b: Channel Coding and Interleaving Organization for EGPRS Packet Data Channels
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)
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: D(k)
- 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,
TCH/AHS speech frames or
k = 0, 1,
TCH/AFS speech frames or
TCH/AMR, SID frames
- Code identifying the used coding scheme (for packet switched channels only):
q(k)
- Data bits after the first encoding step (block code, cyclic code; interface 2 in figure 1):
u(k)
u -1
- Data symbols after the first encoding step (block code):
- 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,
n = 0,1,
,N,N+1, ...
- Interleaved data bits:
i(B,k)
i -1
B = B 0 , B 0 +1, ....
- Interleaved data symbols:
- Bits in one burst (interface 4 in figure 1):
e(B,k)
,114,115
B = B 0 ,B 0 +1, ...
- Symbols in one burst (interface 4 in figure 2):
- 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
- E-IACCH bits delivered to the mapping on one burst (for ECSD only):
ib(B,k)
- E-IACCH symbols in one burst (for ECSD only): HL(B) and HU(B)
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):
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);
- 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
Repetition bits:
w(k) = s(70)
for k = 72 and 73
w(k) = s(120) for k = 124 and 125
Parity bits:
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) = D 3 + D + 1
The encoding of the cyclic code is performed in a systematic form, which means that, in GF(2), the polynomial:
d(0)D 52 + d(1)D 51 +
+ d(49)D 3 + p(0)D 2 + 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 + D 2
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:
= d(2k)
u(184-k) = d(2k+1)
u(91+k)
= p(k)
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 + D 3 + D 4
G1 = 1 + D + D 3 + D 4
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)
u(k) = 0 for k < 0
class 2:
c(378+k) = d(182+k)
The coded bits are reordered and interleaved according to the following rule:
i(B,j) = c(n,k),
for k
= 0,1,
B = B 0 + 4n + (k mod 8)
= 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.
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,
e(B,57) = hl(B)
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.
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).
Parity and tailing for a speech frame
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:
d(73)D 24 + d(74)D 23 +
+ d(94)D 3 + p(0)D 2 + p(1)D + p(2)
1 + D + D 2 .
Tail bits and reordering:
The information and parity bits of class 1 are reordered, defining 104 information + parity + tail bits of class 1,
u(k) = d(k)
u(k) = p(k-95)
for k = 95,96,97
u(k) = 0
for k = 98,99,
(tail bits)
Convolutional encoder
The class 1 bits are encoded with the punctured convolutional code defined by the mother polynomials:
G4 = 1 + D 2 + D 3 + D 5 + D 6
G6 = 1 + D + D 2 + D 3 + D 4 + D 6
and the puncturing matrices:
(1,0,1)
for {u(0),u(1),
,u(94)}
(class 1 information bits);
and {u(98),u(99),
(tail bits).
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:
= u(k)+u(k-2)+u(k-3)+ (k-5)+u(k-6)
= u(k)+u(k-1)+u(k-2)+u(k-3)+u(k-4)+u(k-6)
,94;u(k)
= 0 for k<0
c(3k-95)
= u(k)+u(k-2)+u(k-3)+u(k-5)+u(k-6)
= u(k)+u(k-1)+u(k-4)+u(k-6)
tail bits:
c(k+211) = d(k+95) for k = 0,1,
3.2.3 Interleaving
i(B,j) = c(n,k)
k = 0,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
e(B,j) = i(B,j) and e(B,59+j) = i(B,57+j) for j = 0,1,
e(B,57) = hl(B) and e(B,58) = hu(B)
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.
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),
For non-transparent services those four
blocks shall align with one 240-bit RLP frame.
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.
This block of 244 bits {u(0),
is encoded with the 1/2 rate convolutional code defined by the following
polynomials:
resulting in 488 coded bits {C(0), C(1),
C(487)} with
= u(k) + u(k-3) + u(k-4)
= u(k) + u(k-1) + u(k-3) + u(k-4)
; 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)}
i(B,j) = c(n,k)for k = 0,1,
,N,N
= B 0 +4n + (k mod 19) + (k div 114)
= (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.
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.
The user unit delivers to the encoder a bit stream organized in blocks of 60 information bits (data frames) every 10 ms,
,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+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)}
be transmitted in one of the transmission blocks B0, B2, B4 of the channel mapping defined in GSM 05.02.
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)},
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
u'(k)
= u1(k),
(u1 = 1 st block)
u'(k+76)
(u2 = 2 nd block)
This block of 152 bits is encoded with the convolutional code of rate 1/3 defined by the following polynomials:
G3 = 1 + D + D 2 + D 3 + D 4
The result is a block of 3 * 152 = 456 coded bits, {c(0),c(1),
,c(455)}:
= u'(k) + u'(k-1) + u'(k-3) + u'(k-4)
= u'(k) + u'(k-2) + u'(k-4)
= u'(k) + u'(k-1) + u'(k-2) + u'(k-3) + u'(k-4)
,151;
u'(k) = 0 for k < 0
The interleaving is done as specified for the TCH/F9.6 in subclause 3.3.4.
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))
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),
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.6 Data channel at full rate, 3.6 kbit/s radio interface rate (2.4 kbit/s and less services (TCH/F2.4))
Two such blocks are dealt with together in the coding process, {d(0),d(1),
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 = 72,73,74,75 (tail bits);
This block of 76 bits {u(0),u(1),
is encoded with the convolutional code of rate 1/6 defined by the following
G1 = 1 + D + D 3 +D 4
G1 = 1 + D + D 3 +
The result is a block of 456 coded bits:
{c(0), c(1),
,c(455)},
= 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+5) = u(k) + u(k-1) + u(k-2) + u(k-3) + u(k-4), for
= 0 for k < 0
The interleaving is done as specified for the TCH/FS in subclause 3.1.3.
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 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),
= d1(k),
(d1 = 1st information block)
u(k+76)
(d2 = 2nd information block)
k = 72,73,74,75,148,149,150,151 (tail bits)
The mapping is done as specified for the TCH/FS in subclause 3.1.4. On bit stealing for signalling purposes by a
3.8 Data channel at full rate, 14.5 kbit/s radio interface rate (14.4 kbit/s services (TCH/F14.4))
The user unit delivers to the encoder a bit stream organized in blocks of 290 information bits (data frames) every 20 ms.
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.
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,
The code is punctured in such a way that the following 132 coded bits:
{C(18*j+1), C(18*j+6), C(18*j+11), C(18*j+15) for j = 0,1,
and the bits C(577), C(582), C(584) and
C(587) are not transmitted.
The interleaving is done as specified for the TCH/F9.6 in section 3.3.4.
The mapping is done as specified for TCH/FS in section 3.1.4. On bitstealing by a FACCH, see section 4.2.5.
3.9 Adaptive multi rate speech channel at full rate (TCH/AFS)
This section describes the coding for the different frame formats used for TCH/AFS. The formats used are (in the order
they are described):
SID_UPDATE
Used to convey comfort noise parameters during DTX
SID_FIRST
Marker to define end of speech, start of DTX
Used to signal the Codec mode for the first speech frame after DTX
Speech frames
RATSCCH
Frames used to convey RATSCCH messages
In this chapter, sub chapters 3.9.1 to 3.9.5 describe the channel coding for the different formats listed above.
Common to all the formats is that in-band information is conveyed, the coding for the in-band channel is described in
the table below.
Received in-band
Encoded in-band data for SID
Encoded in-band data for
(defined in GSM 05.09
and RATSCCH frames
[7])
id(1), id(0)
ic(15),
ic(0)
ic(7),
CODEC_MODE_1
The speech encoder delivers 35 bits of comfort noise parameters. Also delivered is two in-band channels, id0(0,1) and
id1(0,1), id0 corresponding to Mode Commands or Mode Requests and id1 to Mode Indication. The general coding is
as: the two in-band data channels are coded to 16 bits each, a 14-bit CRC is added to the 35 CN bits which are then
coded by a rate 1/4 RSC coder to 212 bits. Finally a 212 bit identification field is added thereby giving a total size of
456 bits. These 456 bits are then block interleaved in the same way as SACCH frames.
3.9.1.1 Coding of in-band data
The two n-band data fields, id0(0,1) and id1(0,1), are encoded, giving ic0(0
and ic1(0 ..
The ic0 and ic1 data is moved to the coded data c as:
c(k) = ic0(k)
for k = 0,1,2,3
c(k) = ic1(k-4)
for k = 4, 5, 6, 7
for k = 8, 9, 10, 11
for k = 12, 13, 14, 15
c(k) = ic1(k-12)
3.9.1.2 Parity and convolutional encoding for the comfort noise parameters
a) Parity bits:
A 14-bit CRC is used for error-detection. These 14 parity bits are generated by the cyclic generator
polynomial: g(D) = D 14 + D 13 + D 5 + D 3 + D 2 +1 from the 35 comfort noise parameter bits. The encoding of
the cyclic code is performed in a systematic form, which means that, in GF(2), the polynomial:
d(0)D(48) + d(1)D(47) +
+ d(34)D (14) + p(0)D (13) +…+ p(12)D+ p(13)
where p(0), p(1) … p(13) are the parity bits, when divided by g(D), yields a remainder equal to 1+ D + D 2
+ D 3 + D 4 + D 5 + D 6 + D 7 + D 8 + D 9 + D 10 + D 11 + D 12 + D 13
The information and parity bits are merged:
for k = 0, 1, …, 34
for k = 35, 36, …, 48
b) Convolutional encoder The comfort noise parameters with parity bits (u(0
48))
are encoded with the 1/4 rate
convolutional code defined by the polynomials:
G1/G3 = 1 + D + D 3 + D 4 / 1 + D + D 2 + D 3 + D 4
G2/G3 = 1 + D 2 + D 4 / 1 + D + D 2 + D 3 + D 4
G3/G3 = 1
resulting in 212 coded bits, {C(0)… C(211)} defined by:
= u(k) + r(k-1) + r(k-2) + r(k-3) + r(k-4)
= r(k) + r(k-1) + r(k-3) + r(k-4)
= r(k)+r(k-2)+r(k-4)
= u(k)
for k = 0, 1, ...
48; r(k) = 0 for k<0
and (for termination of the coder):
= r(k)+r(k-1) + r(k-3) + r(k-4)
= r(k-1)+r(k-2)+r(k-3)+r(k-4)
for k = 49, 50, ...
This block of data is moved to the coded data (c) as:
c(8*k+32)
= C(4*k)
= C(4*k+1)
3.9.1.3 Identification marker
The identification marker, IM(0
211),
is constructed by repeating the following 9-bit sequence: { 0, 1, 0, 0, 1, 1, 1, 1,
0 } 24 times and then discarding the last 4 bits. This block of data is moved to the coded data (c) as:
= IM(4*k)
= IM(4*k+1)
3.9.1.4 Interleaving
The interleaving is done as specified for the SACCH in subclause 4.1.4.
3.9.1.5 Mapping on a Burst
The interleaving is done as specified for the SACCH in subclause 4.1.5 with the exception that hl(B) and hu(B) is set to
3.9.2 SID_FIRST
This frame type contains no source data from the speech coder, what is transmitted is the in-band channel (signalling
Mode Indication or Mode Command/Mode Request depending on the current frame number) and an identification
marker.
The in-band data, id(0,1), is encoded to ic(0
which is moved to the coded data c as:
c(k) = ic(k)
c(k) = ic(k-4)
c(k) = ic(k-12)
The mapping is done as specified for the TCH/FS in subclause 3.1.4. The last 4 bursts shall not be transmitted unless
the SID_FIRST frame is immediately followed by a speech frame.
Onset frames are used to preset the interleaver buffer after a period of no speech activity in DTX mode. This frame type
contains no source data from the speech coder, what is transmitted is the in-band channel signalling the Mode Indication
for the speech frame following the onset marker.
Coding of in-band data
The in-band data, Mode Indication id1(0,1), is encoded to ic1(0
This sequence is then repeated 14 times more, and
the last 12 bits are discarded (15*16-12=228) giving the sequence ic1(0 227).
This sequence is then moved to c as:
c(8*k+4)
= ic1(4*k)
= ic1(4*k+1)
c(8*k+7) = ic1(4*k+3)
for k = 4,5,6,7, 12,13,14,15,20,21,22,23
B = B 0 + 4n + (k mod 8) - 4
See table 1. The result of the interleaving is a distribution of the defined 228 bits of a given data block of size 456 bits,
n = N, over 4 blocks using the odd numbered bits. The even numbered bits of these 4 blocks will be filled by the speech
frame for which this frame is the ONSET.
The bit labelled hl(B) on burst number B is a flag used for indication of control channel signalling. For each ONSET
block not stolen for signalling purposes:
= 0 for the 4 bursts
For the use of hl(B) when an ONSET is stolen for signalling purposes see subclause 4.2.5.
The speech coder delivers to the channel encoder a sequence of blocks of data. One block of data corresponds to one
speech frame and the block length is different in each of the eight channel codec modes. Adjoining each block of data is
information of the channel codec mode to use when encoding the block. Also delivered is the in-band data id(0,1)
representing Mode Indication or Mode Command/Mode Request depending on the current frame number.
Coding of the in-band data
The two input in-band bits (id(0,1)) are coded to eight coded in-band bits (ic(0 7)).
The encoded in-band bits are moved to the coded bits, c, as
Ordering according to subjective importance
The bits delivered by the speech encoder, {s(1),s(2),
,s(K
s )}, are rearranged according to subjective importance before
channel coding. Tables 7 to 16 define the correct rearrangement for the speech codec modes 12.2 kbit/s, 10.2 kbit/s,
7.95 kbit/s, 7.40 kbit/s, 6.70 kbit/s, 5.90 kbit/s, 5.15 kbit/s and 4.75 kbit/s, respectively. In the tables speech codec
parameters are numbered in the order they are delivered by the corresponding speech encoder according to GSM 06.90
[11] and the rearranged bits are labelled {d(0),d(1),
,d(K
d -1)}, defined in the order of decreasing importance. Index K d
refers to the number of bits delivered by the speech encoder, see below:
speech bits
per block
(K d )
TCH/AFS12.2
TCH/AFS7.95
TCH/AFS7.4
The ordering algorithm is in pseudo code as:
for j = 0 to K d -1
d(j) := s(table(j)+1);
where table(j) is read line by line left to right
The rearranged bits are further divided into two different classes to perform unequal error protection for different bits
according to subjective importance.
The protection classes are:
Data protected with the CRC and the convolution code.
1b -
Data protected with the convolution code.
No unprotected bits are used.
The number of class 1 (sum of class 1a and 1b), class 1a and class 1b bits for each codec mode is shown below:
Number of class
1 bits per block
delivered per
class 1a bits
1b bits per
Parity for speech frames
The basic parameters for each codec mode for the first encoding step are shown below:
Number of bits after
encoded bits (K d )
protected bits (K d1a )
first encoding step (K u = K d + 6)
A 6-bit CRC is used for error-detection. These 6 parity bits are generated by the cyclic generator polynomial: g(D) = D 6
+ D 5 + D 3 + D 2 + D 1 + 1 from the first K d1a bits of class 1, where K d1a refers to number of bits in protection class 1a as
shown above for each codec mode. The encoding of the cyclic code is performed in a systematic form, which means
that, in GF(2), the polynomial:
d(0)D (K d1a +5) + d(1)D ( K d1a +4) +
+ d(K d1a -1)D (6) + p(0)D (5) +…+ p(4)D+ p(5)
where p(0), p(1) … p(5) are the parity bits, when divided by g(D), yields a remainder equal to:
1+ D + D 2 + D 3 + D 4 + D 5 .
for k = 0, 1, …, K d1a -1
u(k) = p(k-K d1a )
for k = K d1a , K d1a +1, …, K d1a +5
u(k) = d(k-6)
for k = K d1a +6, K d1a +7, …, K u -1
Thus, after the first encoding step u(k) will be defined by the following contents for each codec mode:
TCH/AFS12.2:
for k = 87, 88, …, 249
TCH/AFS7.95:
TCH/AFS7.4:
The bits from the first encoding step (u(k)) are encoded with the recursive systematic convolutional codes as
summarised below. The number of output bits after puncturing is 448 for all codec modes.
of input bits
of output
bits from
punctured
Below the coding for each codec mode is specified in detail.
The block of 250 bits {u(0)… u(249)} is encoded with the 1/2 rate convolutional code defined by
G1/G0 = 1 + D + D 3 + D 4 / 1 + D


text:
Home/Elk Network/News Releases/RMEF Returns to Sponsor Wyoming Women's Antelope Hunt
Elk NetworkRMEF Returns to Sponsor Wyoming Women's Antelope Hunt
News Releases | July 16, 2014
RMEF Returns to Sponsor Wyoming Women's Antelope Hunt
MISSOULA, Mont.—The Rocky Mountain Elk Foundation will sponsor the Second Annual Wyoming Women's Antelope Hunt on October 9-12 in north-central Wyoming.
"We are excited to be able to support this hunt for the second year in a row through funding provided by the Wyoming RMEF State Grants Program," said Jill Tonn, Wyoming senior regional director. "RMEF recognizes that females make up the fastest growing segment of hunters. We fully support this effort as yet another way to further our mission of ensuring the future of elk, other wildlife, their habitat and our hunting heritage."
Founded by the Wyoming Women's Foundation, the goal of the hunt is to promote mentoring through hunting and develop camaraderie between women from Wyoming and around the country. Hunters will enjoy a weekend of friendly competition, fundraising, and other exciting activities with an emphasis placed on safety, hunting ethics and social interaction.
RMEF contributed $2,500 to assist with the event which takes place at the Ranch at Ucross, located approximately 30 miles southeast of Sheridan.
"Continued support by Rocky Mountain Elk Foundation has helped increase the visibility of women hunters and encourage more women to participate and reap the benefits of hunting," said Shelley Simonton, co-chair of the hunt committee. "Through their support, we are also able to provide opportunities for women hunters to mentor others and learn from experts how to improve their skills."
Monies raised at the event will aid the Wyoming Women's Foundation's mission to invest in the economic, self-sufficiency of women and the future of girls. The Wyoming Women's Foundation is a component fund of the Wyoming Community Foundation.
Get more information on the hunt here.
Since 1987, RMEF and its partners completed 547 conservation and hunting heritage outreach projects in Wyoming with a combined value of more than $115.5 million.

redpajama_set_name: RedPajamaCommonCrawl


text:
April showers ease water fears
PUBLIC WATER supplies, agricultural water stores and wildlife habitats have been replenished by April downpours.
The wettest April on record and continuing rain in May have significantly reduced the risks of serious drought and widespread water restrictions this summer, according to the Environment Agency.
In its latest 'Water Resources and Drought Prospects' report, the Environment Agency found that river levels and reservoir stocks have significantly improved, easing the pressure on the environment and water supplies.
Almost all reservoirs are now at least 75% full, while farm water reservoirs are now generally full and the likelihood of restrictions on spray irrigation has reduced. Further water restrictions for the public, farmers and businesses are now "increasingly unlikely", the agency said.
But underground water levels are still low or exceptionally low in some areas, and some rivers are still at risk of drying up as ground water levels reduce over the summer. Groundwaters in some areas need 140% of long term rainfall this winter to recover fully.
Trevor Bishop, head of water resources at the Environment Agency, urged everyone to continue using water wisely to protect water supplies for agriculture and the environment.
"We have seen a huge improvement in water resources in just a few short months, putting us in a much more positive position for the summer. While the downpours in April were pretty miserable, they were really welcome as water companies were able to refill their reservoirs, river levels are mostly back to normal, and many wildlife habitats that were suffering have recovered.
"But while the risk of drought with further water restrictions and associated environmental impacts this summer has reduced, the situation could deteriorate again next year if there is not enough rain this winter. We are still working with partners, planning for the impacts that a third dry winter could have on next year's water supplies."
Ground-breaking UK study points to future of water management worldwide
Manufacturing industry saves £2 million in water costs
Waste4Fuel High Court verdict still not reached
Jamie's Italian fined by Environment Agency


It is said that dog and man initiated their relationship between 10 000 and 20 000 years ago when dog ancestors followed man throughout his migrations. Dogs are known as man's best friend, our closest companions, our protectors and even lifesavers. Numerous accounts testify of this, from treating mental illness and depression to even halting death. This seems to be something that dogs are well equipped to do, as they halt death in more ways than one.
Rhinos are poached in South Africa at a rate of three per day. In a 24-hour cycle that is one rhino every eight hours. Fortunately, the Hoedspruit Endangered Species Centre (HESC) has taken precautionary steps to ensure the safety of their rhinos and they involve – you guessed it – DOGS!
Dogs can be trained to do specific work. A dog's sense of smell and hearing are far better than their human counterparts. Although difficult to quantify, some scientists believe dogs can detect most odours at concentration of parts per trillion. Dogs can, in general, hear four times the distance of human hearing capabilities. HESC has the facilities and knowledge to take care of injured rhinos who were victims of attempted poaching, as well as orphaned baby rhinos. All these rhinos need protection and as an addition to the current security upgrade, the centre decided to add a dog unit to help protect their rhinos.
Trained in: None – David is already at home between the grass- and animal smells and keeps Esme, the baby rhino, company. David won't receive much training.
The guard angels of the HESC sanctuary !
Caress for these animals !
HESC, thanks for the article post.Really thank you! Great.
HESC, thanks so much for the post.Really thank you! Great.
Ami 3ta perechi .suuuuuperbbbb video .apu arokom video aro banan .plz .


text:
Scientists in China clone a 'Sherlock Holmes of police dogs' named Kunxun
India Reuters Mar 20, 2019 13:43:25 IST
Scientists in southwest China's Yunnan province have cloned what they called the "Sherlock Holmes of police dogs" in a program they hope will help cut training times and costs for police dogs, state media reported on Wednesday.
Kunxun, the Sherlock Holmes of Dogs. Reuters
The dog, named Kunxun, was cloned from a police sniffer dog by the Beijing-based Sinogene Biotechnology Company and the Yunnan Agricultural University, with support from the Ministry of Public Security, the state-owned tabloid Global Times reported.
Sinogene is hoping to make it possible to achieve "volume production" of cloned police dogs in order to significantly reduce training times, the company's deputy general manager Zhao Jianping told the Global Times, but he added that cloning costs remain a major obstacle.
Kunxun, now three months old, will undergo extensive training in drug detection, crowd control and searching for evidence, and will become a fully fledged police dog when it is about 10 months old, the official China Daily said.
Training usually takes about five years and costs as much as 500,000 yuan, with no guarantee of success, the paper said, citing an animal expert at the Yunnan Agricultural University. The paper did not say how much a cloned dog would cost.
South Korean scientists created the world's first cloned dog in 2005, and two years later the country began employing cloned Labrador retrievers to sniff out drugs for the customs service, China Daily said.
Tags : Beijing, Biotechnology Company, Drug Detection, Kunxun, Sherlock Holmes, Yunnan
Sherlock Holmes 3: Rocketman director Dexter Fletcher to helm Robert Downey Jr, Jude Law's detective drama
US, Russia, China, Pakistan urge Taliban to immediately agree to ceasefire, begin talks with Afghanistan govt
Hong Kong protests: Protesters set to rally in area popular with mainland Chinese as anger against government revives
Thousands of protestors march towards Hong Kong's controversial West Kowloon station to demand scrapping of extradition bill
1Scientists in China clone a 'Sherlock Holmes of police dogs' named Kunxun


text:
How serious should the penalties for an oil spill be? In early November, Chevron and its drilling partner Transocean accidentally spilled some 3,000 barrels of oil into the ocean off the coast of Rio de Janeiro in Brazil. As oil spill go, it was relatively minor—although it is a sign of how hard offshore drilling is. After about a week of work, Chevron managed to stop the spill—it helped that the damaged well was only about 3,900 ft. below the surface of the ocean. (BP's Macondo well—which spilled 4 million barrelsinto the Gulf of Mexico last year after a blowout—was more than 5,000 ft. beneath the ocean surface.)
Problem solved? Not according to the Brazilians. A couple of weeks after the spill, Brazil announced that it was fining Chevron $28 million—or more than two times the $4,000 per barrel spilled that the U.S. government can charge under the Oil Pollution Act—and had its drilling rights in Brazil suspended. For Chevron the fine would be bad enough, but a permanent expulsion from Brazil's rich offshore oil market—estimated to be worth nearly $200 billion—would be disastrous for the company. As if that's not bad enough, last week Brazilian prosecutors brought an $11 billion—yes, that's the right letter—against Chevron and Transocean. And this week Brazil's federal police asked prosecutors to indict as many as 17 Chevron and Transocean employees—including the director of Chevron Brazil—for their alleged roles in the oil spill.
Is this fair?
There's a certain amount of political gamesmanship going on in Brazil's reaction to the spill. It's common for some oil-producing countries to punish foreign oil companies when things go wrong. That's a fact of life in the oil business—especially in more authoritarian nations like Venezuela. Democratic Brazil has a better reputation than most, but it has a federal system—and in the Chevron case, it's state authorities who seem particularly vengeful, as Fortune'sCyrus Sanati writes:
The oil spill quickly became politicized in the state of Rio de Janeiro, home of Brazil's burgeoning oil industry and the quasi-state-controlled oil giant Petrobras. The environmental secretary of Rio threatened to revoke Chevron's operating license over the spill, sending shivers all the way up to Houston, home to the dozens of foreign oil companies that feed Brazil's oil engine. The federal government in Brasilia quietly reassured the oil community that drilling permits were under federal jurisdiction and that they should simply ignore the howls of discontent from local officials.
But now those howls have turned into a stinging civil lawsuit. Prosecutors from Campos, a city near Rio de Janeiro, filed suit last Wednesday against Chevron and Transocean (RIG) for gross negligence in connection with the oil spill. They announced they were seeking 20 billion reals or around $11 billion in compensation for the spill. The fine was high, prosecutors say, in order to send a message that Rio was serious when it comes to environmental protection.
This is an internal Brazilian problem, with regions and cities like Rio—which needs money for the 2016 Olympics—angling to get a bigger share of offshore oil revenues from the federal government. Still, even if the $11 billion suit goes away—as many experts expect it to do—surely Chevron and other oil majors will have second thoughts before doing business in Brazil. And that could have major ramifications for a country that is set to become an oil major. Brazil's national oil company, Petrobras, has had serious safety problems of its own—recent reports suggest that Petrobras spills more oil each year than Chevron with its accidents. If Brazil wants to move into the big leagues of crude oil, it will need help from the foreign majors—but Brazil's valuable deepwater reserves and beautiful beaches may not be enough to overcome the threat of $11 billion lawsuits and criminal charges should anything go wrong. Not that Chevron was blameless, as the Financial Times writes:
But the whole incident should also serve as a warning to other foreign companies eyeing up Brazil's oil industry. Although Chevron and Transocean have undoubtedly been caught up in a political power game, critics say both companies could have done more to prepare for such a disaster and done a better job of cleaning up afterwards.
Even simple things like having more executives at the companies who could speak Portuguese would have helped get rid of some of the bad feeling among the influential local press and government officials.
After all, if Chevron doesn't get it right in Brazil, there will always be someone else around the corner waiting to take their place in one of the world's most promising oil industries.
It's not just about access to oil, however. Brazil's offshore reserves are rich, but they're also difficult to access. Some wells may be more than 20,000 ft. beneath the surface of the ocean. If there's one thing we learned during the Deepwater Horizon oil spill—other than that Admiral Thad Allen kicks ass—it's that repairing any blowouts or spills in very deep water is very difficult, akin to trying to operate on the surface of the moon. The early stumbles from companies like Chevron and Petrobras are not comforting as the oil industry prepares to go deeper and more dangerous, as we enter the age of extreme energy.
Source:Time
Tags: Business National Economy Oil Petrol
Günter Grass: final interview reveals author's fears of another world war
Breaking news 3633 0
UK construction growth bolsters economic recovery hopes
Artificial intelligence can now craft original jokes—and that's no laughing matter https://t.co/0g0XYrbCLT
How America can rebuild the community bonds it needs to face the next pandemic https://t.co/yqVITw9EvV
"Don't Look Up" is more than your standard climate cautionary tale https://t.co/j3E5UMGyaC
24 retweets 135 Favorites
.@imaniperry: I searched for answers about my enslaved ancestor. What I found was more questions https://t.co/VXMrUo7mpj


text:
Home > Related Issues > Lessons from São Paulo's Water Shortage
Lessons from São Paulo's Water Shortage
Sandra Postel
NOTE: Images in this archived article have been removed.
Jaguari Reservoir, one of five in São Paulo's Cantareira System, which is at about 13 percent of capacity. Image acquired on February 11, 2015. Image Credit: NASA Earth Observatory.
It's getting harder and harder to separate nature's role in disasters from our own, and the dire water predicament confronting São Paulo, Brazil, is no exception.
But as with the ongoing drought in California, there are important lessons from São Paulo's grim situation that can help us prepare for the "new normal" that's unfolding.
It's indisputable that São Paulo, the economic heartbeat of Brazil, is in trouble. The megacity of 20 million people is suffering its worst drought in eight decades. The five reservoirs in the Cantareira system, which provides nearly half the city's drinking water, are at a dangerously low 13 percent of capacity. That's up from even lower levels thanks to some recent rains, and while more precipitation could arrive in the coming weeks, historically the driest period of the year is April through September, just around the corner.
Some São Paulo residents have gone without tap water for days at a time. Others have fled the city, creating a new brand of "water refugees."
As Brazil gears up to host the 2016 summer Olympics, businesses are suffering from the lack of water. Economists say the drought could shave 2% off of Brazil's GDP.
Meanwhile, a "clandestine drilling fever" is taking place across the city, according to an NPR report. As people and businesses worry about rationing, they are drilling their own wells to access groundwater. This unregulated, wildcat drilling threatens to pollute underground supplies, worsening the drought's long-term impact and raising public health risks.
Unlike Los Angeles, São Paulo is not a desert city. Whereas LA averages just 15 inches (381 millimeters) of rain a year, São Paulo averages 57.3 inches (1455 mm). With more than 12% of the world's renewable freshwater, Brazil is sometimes called the "Saudi Arabia of water."
So what's going on, and what can we learn from São Paulo's dire situation?
Land Use and Climate Links to Water Supply
First, although droughts are a natural phenomenon, their origin and consequences can be influenced by human actions. Land use, for example, greatly impacts how water moves and cycles through a watershed. In the case of São Paulo and southeastern Brazil, the long-term deforestation of the Amazon rainforest may have played a significant part in the origin of the drought.
It's been known for three decades that the forests of the Amazon recycle about half of the precipitation that falls in the basin. Easterly winds bring moisture inland from the Altantic coast, and then evapotranspiration from the forest vegetation re-circulates that moisture westward until it meets the high-elevation Andes.
Although the rate of Amazon deforestation has slowed considerably*, some 224,000 square miles of forest– an area nearly one-and-a-half times the size of California – have been cleared since 1980.
In a 1984 article published in the journal Science, researchers Eneas Salati and Peter Vose of the University of São Paulo describe this "unique precipitation and water recycling regime" and warned of the dangers of massive tree-cutting.
"Continued large-scale deforestation," the scientists wrote, "is likely to lead to increased erosion and water runoff with initial flooding in the lower Amazon, together with reduced evapotranspiration and ultimately reduced precipitation."
Indeed, while São Paulo has been gripped by drought, the Bolivian Amazon has experienced massive flooding. Besides deforestation, another cause of these two extremes has been a high-pressure atmospheric "block" that has shunted rainfall back through the lower Amazon and away from São Paulo and the southeastern portion of the country.
This Brazilian anomaly is not unlike the high-pressure "ridge" off the U.S. Pacific Coast that blocked rains from falling in California, exacerbating the drought there. Researchers at Stanford University found that the formation of this atmospheric ridge is "very likely" linked to human-caused climate change.
Building a Resilient Water System
Slowing both Amazonian deforestation and global greenhouse gas emissions might help prevent the number or severity of future droughts in southeastern Brazil.
But the most important take-away lesson for São Paulo is that the future is unlikely to look like the past, and so it should work now to create a more resilient water system.
More than 30 percent of São Paulo's drinking water is estimated to be lost to leaks in the distribution network or to outright theft. Those are costly losses at any time, but especially during a severe drought. Finding and repairing leaks is a cost-effective conservation measure that could be implemented now to shore up the water system.
Second, the city should not only regulate well drilling, but plan strategically for conjunctive use and management of its surface and underground supplies. Groundwater reserves can be life-savers in times of drought, as long as the volumes pumped and used during dry years is replenished during wet ones.
Third, if extreme droughts are more likely in the future, city water managers need to adjust their risk formulas and take action sooner to avoid catastrophic outcomes. That means declaring drought emergencies and instituting restrictions on water use (for example, on landscape irrigation) earlier than done in the past. The possible human and economic consequences are just too great to allow reservoir levels to get so low before issuing restrictions on discretionary water uses.
And fourth, São Paulo could benefit from investments in stormwater capture and wastewater recycling to boost local water supplies. Along with conservation, such measures can help meet water demands without the need for costly long-distance water transfers. Los Angeles, for example, has set a goal of halving its reliance on imported water within a decade by implementing measures such as these.
Meanwhile, the drumbeat of drought goes on in South America's largest city. It may take some Olympian feats to escape the water predicament in which it now finds itself.
*Three days after posting this piece I came across an interview with Philip Fearnside, a leading authority on Amazonian deforestation, in Yale Environment 360, who said that deforestation in the Amazon has surged in the last six months, with the period September 2014 to January 2015 showing forest clearing rates more than double the same period a year earlier.
One Comment, RSS
Bo Modén
The small sensitive planet Tellus is in a state of "Run Away Global Warming" and is becoming more and more devastated by the forces of the Global Market ! It is a suicidal destruction that has to be stopped. The world is in urgent need of "Emergency Rules" in defence of our survival.


Election Law & Government Ethics Practice co-chair Jan Baran was interviewed by Bloomberg on the new trend of super PACs funding negative political. Super PACs are the independent expenditure committees that can raise and spend unlimited money to support or oppose political candidates as long as they do not directly coordinate with the campaign.
"When several of the campaigns don't have much money, that makes a difference," said Mr. Baran.


Laser welding processes can get quite expensive. In order to get the most bang for your buck, consider sending your business from the US to Canada. Why? Sending laser welding orders from the United States to Canada is up to 30 percent cheaper. You're in luck, since we are one of the most reputable companies around that serves US clients. Choose us for all your industrial welding needs.
Welding in Canada is a smart choice because it saves you money. We also save you time and hassle through our state-of-the-art laser welding technology, serving industries such as construction, aerospace, medical and shipbuilding. We always deliver on promises of quality, excellence and customer service, taking the time to listen to your needs with the ability to handle projects from small to large.
As part of our Canadian welding services, we can provide repairs and upgrades, in addition to equipment warranties. Turn to us for lower-cost accessories for the various types of high-tech laser equipment out there. You'll appreciate our broad price ranges and flexible payment systems. By enlisting our welding Canada services, you can reduce your expenses when it comes to mold restoration, seam welding, spot laser welding, mold laser surfacing and seam sealing welding.
We are experts in providing cutting edge technology that is both innovative and progressive, whether you need repairs or upgrades. Although we cater to many industries, we focus on medical welding, military welding and aerospace welding.
Our laser technology has several benefits: it reduces heat-affected zones while repairing molds, features higher productivity yet lower labor involvement, boasts higher quality of welded joints, and cuts down on welding distortions. Our laser processes also boost capability to perform unique tasks through the use of many different materials. Why would you choose anyone else?
Couple the fact that our welding Canada services are cheaper than in the United States, with our customer service and quality guarantee, and you have yourself a win/win situation. We can provide high output of your repair and upgrade needs, plus provide feedback throughout the entire process. You will be impressed with the finished product, finely honed after many years in the industry, thanks to our skilled welders.
WHEN YOU WANT EXCELLENCE IN LASER WELDING, TURN TO THE NUMBER ONE RESOURCE: LASER WELD CREATION. OUR EXPERIENCE SPEAKS FOR ITSELF. TO LEARN MORE ABOUT YOUR SPECIFIC INDUSTRY REQUIREMENTS, GIVE US A CALL. WE WOULD BE HAPPY TO GO OVER PRICING, PRODUCTION TIMES AND MORE.
Laser & Micro Laser Welding 4.7 out of 5 based on 3 user ratings.


text:
Q: How to create sliders using materialize.css I was trying to make a website for an upcoming event, using materialize css. Here's how I want the page to look (not exactly same. The images is for representation):

Here's my link to jsbin

body {
  background: #0b1924;
}
/*Loading screen animation code begins*/

#load {
  position: absolute;
  width: 600px;
  height: 36px;
  left: 50%;
  top: 40%;
  margin-left: -300px;
  overflow: visible;
  -webkit-user-select: none;
  -moz-user-select: none;
  -ms-user-select: none;
  user-select: none;
  cursor: default;
}
#load div {
  position: absolute;
  width: 20px;
  height: 36px;
  opacity: 0;
  font-family: Helvetica, Arial, sans-serif;
  font-size: 24px;
  animation: move 2s linear infinite;
  -o-animation: move 2s linear infinite;
  -moz-animation: move 2s linear infinite;
  -webkit-animation: move 2s linear infinite;
  transform: rotate(180deg);
  -o-transform: rotate(180deg);
  -moz-transform: rotate(180deg);
  -webkit-transform: rotate(180deg);
  color: #35C4F0;
}
#load div:nth-child(2) {
  animation-delay: 0.2s;
  -o-animation-delay: 0.2s;
  -moz-animation-delay: 0.2s;
  -webkit-animation-delay: 0.2s;
}
#load div:nth-child(3) {
  animation-delay: 0.4s;
  -o-animation-delay: 0.4s;
  -webkit-animation-delay: 0.4s;
  -webkit-animation-delay: 0.4s;
}
#load div:nth-child(4) {
  animation-delay: 0.6s;
  -o-animation-delay: 0.6s;
  -moz-animation-delay: 0.6s;
  -webkit-animation-delay: 0.6s;
}
#load div:nth-child(5) {
  animation-delay: 0.8s;
  -o-animation-delay: 0.8s;
  -moz-animation-delay: 0.8s;
  -webkit-animation-delay: 0.8s;
}
#load div:nth-child(6) {
  animation-delay: 1s;
  -o-animation-delay: 1s;
  -moz-animation-delay: 1s;
  -webkit-animation-delay: 1s;
}
#load div:nth-child(7) {
  animation-delay: 1.2s;
  -o-animation-delay: 1.2s;
  -moz-animation-delay: 1.2s;
  -webkit-animation-delay: 1.2s;
}
@keyframes move {
  0% {
    left: 0;
    opacity: 0;
  }
  35% {
    left: 41%;
    -moz-transform: rotate(0deg);
    -webkit-transform: rotate(0deg);
    -o-transform: rotate(0deg);
    transform: rotate(0deg);
    opacity: 1;
  }
  65% {
    left: 59%;
    -moz-transform: rotate(0deg);
    -webkit-transform: rotate(0deg);
    -o-transform: rotate(0deg);
    transform: rotate(0deg);
    opacity: 1;
  }
  100% {
    left: 100%;
    -moz-transform: rotate(-180deg);
    -webkit-transform: rotate(-180deg);
    -o-transform: rotate(-180deg);
    transform: rotate(-180deg);
    opacity: 0;
  }
}
@-moz-keyframes move {
  0% {
    left: 0;
    opacity: 0;
  }
  35% {
    left: 41%;
    -moz-transform: rotate(0deg);
    transform: rotate(0deg);
    opacity: 1;
  }
  65% {
    left: 59%;
    -moz-transform: rotate(0deg);
    transform: rotate(0deg);
    opacity: 1;
  }
  100% {
    left: 100%;
    -moz-transform: rotate(-180deg);
    transform: rotate(-180deg);
    opacity: 0;
  }
}
@-webkit-keyframes move {
  0% {
    left: 0;
    opacity: 0;
  }
  35% {
    left: 41%;
    -webkit-transform: rotate(0deg);
    transform: rotate(0deg);
    opacity: 1;
  }
  65% {
    left: 59%;
    -webkit-transform: rotate(0deg);
    transform: rotate(0deg);
    opacity: 1;
  }
  100% {
    left: 100%;
    -webkit-transform: rotate(-180deg);
    transform: rotate(-180deg);
    opacity: 0;
  }
}
@-o-keyframes move {
  0% {
    left: 0;
    opacity: 0;
  }
  35% {
    left: 41%;
    -o-transform: rotate(0deg);
    transform: rotate(0deg);
    opacity: 1;
  }
  65% {
    left: 59%;
    -o-transform: rotate(0deg);
    transform: rotate(0deg);
    opacity: 1;
  }
  100% {
    left: 100%;
    -o-transform: rotate(-180deg);
    transform: rotate(-180deg);
    opacity: 0;
  }
}
/*

Loading screen animation ends here....
*/

/*FAB code begins*/

.fixed-action-btn,
.toolbar {
  margin-top: 2%;
  margin-left: 2%;
  width: 100px;
  height: 100px;
  top: 23px;
  left: 23px;
}
.btn-large i {
  font-size: 2.5rem;
  margin-top: 20%;
}
.slider {
  position: relative;
  display: block;
  background-position: center;
  background-repeat: no-repeat;
}

<!DOCTYPE html>

  <meta charset="utf-8">
  <title>Spark fest</title>
  <link rel="stylesheet" href="css/styles.css">
  <link rel="stylesheet" href="css/materialize.min.css">
  <link rel="stylesheet" href="https://cdnjs.cloudflare.com/ajax/libs/materialize/0.97.8/css/materialize.min.css">
  <link href="https://fonts.googleapis.com/css?family=Bungee+Shade" rel="stylesheet">
  <link href="https://fonts.googleapis.com/css?family=Audiowide" rel="stylesheet">
  <link href="https://fonts.googleapis.com/icon?family=Material+Icons" rel="stylesheet">

g

n

i

d

a

o

L

        reorder

home

event

location_on

contacts

This is our big Tagline!

Here's our small slogan.

Left Aligned Caption

Here's our small slogan.

Right Aligned Caption

Here's our small slogan.

This is our big Tagline!

Here's our small slogan.

Here is how my output is when I run it on the browser:

Looks like the images are hidden. Is there any way I could tweak the code so that it looks as expected?

A: You have 0 opacity on all of the li elements.
.slider .slides li {
    opacity: 0;
    ...
}

Change that and images will show up.

redpajama_set_name: RedPajamaStackExchange


text:
Author Sarah Hamaker
The Romantic Side of Suspense
Jodie Bailey's Glimpse Into Military Life (Episode 24)
Sarah Hamaker December 15, 2020 0	Christian fiction, romantic suspense, Sarah Hamaker, The Romantic Side of Suspense podcast
On this episode of "The Romantic Side of Suspense," I'm chatting Jodie Bailey. who writes stories about freedom and the heroes who fight for it. Her novels have won the RT Reviewers Choice Award and the Selah award. She's convinced the beach, good coffee, and great books can cure all ills. Jodie lives in North Carolina with her husband, daughter, and two dogs.
"My whole writing journey is this God-given thing," Jodie said. "I was in contemporary women's fiction, when my agent asked if I thought about writing military suspense. I walked to the coat closet, and I thought, 'What if somebody was in my closet and it's the good guy?' Before I knew it, I had half a military suspense done in my head."
Listen to the podcast for more from our interview, plus an excerpt from Fatal Identity.
Connect w/Jodie
Website: www.jodiebailey.com.
Facebook: https://www.facebook.com/writerjodiebailey
Instagram: https://www.instagram.com/authorjodiebailey/
Bookbub: https://www.bookbub.com/profile/jodie-bailey
Download file | Play in new window | Duration: 00:23:04 | Recorded on September 11, 2020
Subscribe: Apple Podcasts | Google Podcasts | Spotify | Stitcher
January 2021 New Releases in Christian Fiction
December 2020 New Releases in Christian Fiction
2020 Christmas Scavenger Hunt Round-Robin: Mistletoe & Murder
© Author Sarah Hamaker 2021


text:
Russian tourists stranded in European airports after flight cancellations
Hundreds of Russian tourists in Europe have found themselves stranded in foreign airports after most flights were canceled this week and borders closed due to the coronavirus crisis, a spokeswoman for Russia's travel industry union (ATOR) told.
Russia suspended most flights to and from Europe to try to contain the spread of the coronavirus from Monday. At the same time, several European countries have shut their borders, preventing anyone from leaving or entering.
"Russian tourists in Europe are left to their own devices and are asked to return home, but this is not easy — most of the remaining flights either have no seats or their ticket prices have risen several times," spokeswoman Irina Tyurina said.
Tyurina estimated that there are hundreds of Russian tourists currently stranded in Europe, adding that Russia's Federal Tourism Agency (Rosturizm) hasn't released official numbers.
"They are already being kicked out of some hotels because there is no one else there, only Russians," she told. "There are even examples of (the hotels) feeding guests with dry rations because the kitchen has already been closed."
According to Tyurina, the situation is most acute in the Czech Republic, which was one of the first European countries to shut its border. Russian national carrier Aeroflot will suspend its flights to Prague on Thursday.
She advised Russian tourists to contact Russia's Turpomosch tourist assistance association and called on the Foreign Affairs Ministry to ramp up its efforts to help Russians trapped abroad, as it has the authority to solve problems at an interstate level.
Foreign Ministry spokeswoman Maria Zakharova said Monday that thousands of Russians are currently stuck abroad due to the coronavirus, adding that Russia's embassies are working "around the clock" to bring them home.
Aeroflot to restrict Europe flights from Monday
Russian state-run air carrier Aeroflot announced on Saturday changes to flights to and from European…
Russian Railways ceases international train transport with Latvia, Ukraine and Moldova amid coronavirus outbreak
The Russian Railways have announced the termination of international trains with Latvia starting March…
Russia limits all air travel to Italy, Germany, France and Spain
In an effort to curb the spread of coronavirus, Russia is imposing restrictions on air transportation…


March 2015 marked Shareable Neighbourhood's 20th event.
Edmonton seems like a very new place, but the truth is that it has been a meeting place for thousands of years. What does it mean to belong to this place, for both Aboriginal and settler peoples? What do the treaties say about our relationship to one another – in the past and present?
Local enthusiast Keavy Martin led a walk through the river valley introducing us to Aboriginal history on this land, the development of the treaties, and rights and responsibilities to each other that Treaty 6 gives us all as relations on this land.
See photos from this event on Facebook.


text:
package cmd

import (
	"time"

	"github.com/spf13/cobra"
	"github.com/spf13/viper"
	"github.com/xxorde/pgglaskugel/storage"

	log "github.com/Sirupsen/logrus"
)

// fetchCmd represents the recover command
var fetchCmd = &cobra.Command{
	Use:   "fetch <WAL_FILE> <FETCH_TO>",
	Short: "Fetches a given WAL file",
	Long: `This command fetches a given WAL file.
	Example: archive_command = "` + myName + ` fetch %f %p"

It is intended to use as an restore_command in the recovery.conf.
	Example: restore_command = '` + myName + ` fetch %f %p'`,
	Run: func(cmd *cobra.Command, args []string) {
		if len(args) < 2 {
			log.Fatal("Not enough arguments")
		}

		walName := args[0]
		walTarget := args[1]

		err := fetchWal(walTarget, walName)
		if err != nil {
			log.Fatal("fetch failed ", err)
		}
		elapsed := time.Since(startTime)
		log.Info("Fetched WAL file in ", elapsed)
	},
}

func init() {
	RootCmd.AddCommand(fetchCmd)
}

// fetchWal recovers a WAL file with the configured method
func fetchWal(walTarget string, walName string) (err error) {
	viper.SetDefault("waltarget", walTarget)
	viper.SetDefault("walname", walName)
	return storage.Fetch(viper.GetViper())
}

redpajama_set_name: RedPajamaGithub


Hello, everytime we talk about this topic generated numerous debates among an appreciable amount of traders, which, each one defends and supports the broker used at the time and that, in the majority of cases, it got after much research on the subject. What they don't realize most people or new traders, is that at the end of the road is not what will make you a successful trader; It should be noted that at no time I say that the choice of the broker is not important, on the contrary, it is totally necessary for our quiet as traders. What I mean is that all lose valuable time on this simple issue. So yes we failed everyone is in misinformation, and is for this reason that we do not know how to choose our broker in a fast and easy way. To avoid this misinformation, I love exposing valuable and accurate information on this subject in particular. Do before you need that you do this question, really want to become a professional trader? or simply want to become a millionaire overnight to the tomorrow?. These questions that bother you should be troubled in seeking the correct answer, it is necessary to know the difference that there is one and is really wide. It is that when you want to become a professional trader in any way you are agreeing to the long-term, i.e., you'll see results in the future, and this leads us to infer that we need a Broker for the long term, a broker that can withstand any future crisis in the coming years.
We can have this feature through a regulated broker, though honestly, there are many new broker with incredible potential. In first place, as you are going to operate?, deciding between two simple things, long or short term? and manual or automatic (robot)?. Expose you as well: the robots or EA (Expert Advisor), mostly operate with strategies very short-term or SCALPING, in times of 1 M, 5 M and 15 M. They operate in fishing a few pips of profit in each operation, for which it is essential to a broker that offers us a minimum spread already that if your EA point to 10 pips of profit that you must deduct you what copper you broker (spread). Similarly if you want to operate manually and in short time, it is highly recommended that you choose a broker with minimum spreads. When operas in medium and long term, your strategies are prepared to obtain more than 100 pips for a 3 or 5 pips spread not affecting you in anything.
Secondly, seeks diversity and dynamism, that the broker has several types of accounts and various platform options, too, several ways to deposit and withdraw money, affiliate program, automated trading, etc. Expose you as well: ECN accounts: they use a market or virtual network between the participants and offered contracts with spread or Commission variable but minimal, so it is always charged an additional Commission for each operation. Affiliate program: you can earn additional income by bringing customers to the broker. Operating platforms: MT4, iphone apps, smartphone apps, web trader. In summary and saving you a lot of time that you must not miss, I recommend 2 broker, both with different characteristics but 1A rating, these are: for operational in the long term, AVAFX. For operating in the short term, HotForex.