Turbo codes: principles and applications
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Boston [u.a.]
Kluwer
2000
|
| Schriftenreihe: | The Kluwer international series in engineering and computer science
559 |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | XXVI, 312 S. graph. Darst. |
| ISBN: | 0792378687 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV013378473 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 001009s2000 d||| |||| 00||| eng d | ||
| 020 | |a 0792378687 |9 0-7923-7868-7 | ||
| 035 | |a (OCoLC)44046784 | ||
| 035 | |a (DE-599)BVBBV013378473 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T |a DE-1046 | ||
| 050 | 0 | |a TK5102.92. | |
| 082 | 0 | |a 003/.54 |2 21 | |
| 084 | |a SK 170 |0 (DE-625)143221: |2 rvk | ||
| 100 | 1 | |a Vucetic, Branka |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Turbo codes |b principles and applications |c Branka Vucetic ; Jinhong Yuan |
| 264 | 1 | |a Boston [u.a.] |b Kluwer |c 2000 | |
| 300 | |a XXVI, 312 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a The Kluwer international series in engineering and computer science |v 559 | |
| 650 | 4 | |a Coding theory | |
| 650 | 4 | |a Error-correcting codes (Information theory) | |
| 650 | 4 | |a Signal theory (Telecommunication) | |
| 650 | 0 | 7 | |a Turbo-Code |0 (DE-588)4558308-0 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Turbo-Code |0 (DE-588)4558308-0 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Yuan, Jinhong |e Verfasser |4 aut | |
| 830 | 0 | |a The Kluwer international series in engineering and computer science |v 559 |w (DE-604)BV023545171 |9 559 | |
| 856 | 4 | 2 | |m HBZ Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009125327&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-009125327 | ||
Datensatz im Suchindex
| _version_ | 1804128157244063744 |
|---|---|
| adam_text | Titel: Turbo codes
Autor: Vucetic, Branka
Jahr: 2000
Contents
List of Acronyms xi
List of Figures xiii
List of Tables xxiii
Preface xxv
1 Introduction 1
1.1 Digital Communication System Structure...... 2
1.2 Fundamental Limits ................. 5
2 Block Codes 13
2.1 Block Codes...................... 13
2.2 Linear Systematic Block Codes........... 15
2.3 Parity Check Matrix................. 16
2.4 The Minimum Distance of a Block Code...... 17
2.5 Maximum Likelihood Decoding of Block Codes for a
BSC Channel..................... 18
2.6 Maximum Likelihood Decoding of Block Codes for a
Gaussian Channel................... 19
2.7 Weight Distribution of Block Codes......... 20
2.8 Performance Upper Bounds............. 23
2.8.1 Word Error Probability Upper Bounds ... 23
2.8.2 Bit Error Probability Upper Bounds .... 26
2.9 Coding Gain ..................... 28
2.10 Soft Decision Decoding of Block Codes....... 30
2.11 Trellis Structure of Linear Binary Block Codes ... 30
vi CONTENTS
3 Convolutional Codes 37
3.1 Introduction...................... 37
3.2 The Structure of (n,l) Convolutional Codes .... 38
3.3 The Structure of (n, k) Convolutional Codes .... 43
3.4 Systematic Form................... 45
3.5 Parity Check Matrix................. 50
3.6 Catastrophic Codes.................. 51
3.7 Systematic Encoders................. 53
3.8 State Diagram..................... 58
3.9 Trellis Diagram.................... 60
3.10 Distance Properties of Convolutional Codes .... 62
3.11 Weight Distribution of Convolutional Codes .... 63
3.12 Punctured Convolutional Codes........... 66
4 Turbo Coding Performance Analysis and Code De-
sign 73
4.1 Introduction...................... 73
4.2 Turbo Coding..................... 74
4.2.1 A Turbo Encoder............... 74
4.2.2 Interleaving.................. 76
4.2.3 Trellis Termination.............. 77
4.2.4 High Rate Turbo Codes ........... 78
4.3 Performance Upper Bounds of Turbo Codes .... 80
4.3.1 Conditional WEF s of Average Turbo Codes 80
4.3.2 Conditional WEF s of Component Codes . . 82
4.3.3 Average Upper Bounds on Bit Error Proba-
bility ...................... 84
4.3.4 Interleaving Performance Gain........ 87
4.3.5 Effective Free Distance............ 90
4.4 Turbo Code Performance Evaluation........ 92
4.5 Turbo Code Design.................. 98
4.5.1 Turbo Code Design at High SNR s..... 100
4.5.2 Turbo Code Design at Low SNR s...... 103
4.5.3 Simulation Results.............. 105
4.6 Serial Concatenated Convolutional Codes...... 107
4.6.1 A Serial Concatenated Encoder....... 107
4.6.2 Performance Analysis and Code Design . . . 108
CONTENTS vii
5 Trellis Based Decoding of Linear Codes 117
5.1 Introduction...................... 117
5.2 System Model..................... 118
5.3 Optimization Criteria................. 120
5.4 The Viterbi Algorithm................ 122
5.5 The Bidirectional Soft Output Viterbi Algorithm . 126
5.6 Sliding Window SOVA................ 135
5.7 The MAP Algorithm................. 138
5.8 The Max-Log-MAP Algorithm............ 149
5.9 The Log-MAP Algorithm............... 151
5.10 Comparison of Decoding Algorithms........ 152
6 Iterative Decoding 157
6.1 Optimum Decoding of Turbo Codes......... 157
6.2 Iterative Decoding of Turbo Codes Based on the
MAP Algorithm.................... 159
6.3 The Effect of the Number of Iterations on Turbo
Code Performance .................. 164
6.4 The Effect of Interleaver Size on Turbo Code Perfor-
mance ......................... 166
6.5 The Effect of Puncturing Component Codes on Turbo
Code Performance .................. 167
6.6 Comparison Between Analytical Upper Bounds and
Simulation Results.................. 169
6.7 Asymptotic Behavior of Turbo Codes........ 170
6.8 Iterative SOVA Decoding of Turbo Codes...... 171
6.9 Comparison of MAP and SOVA Iterative Decoding
Algorithms....................... 177
6.10 Iterative MAP Decoding of Serial Concatenated Con-
volutional Codes ................... 178
6.11 Iterative SOVA Decoding of Serial Concatenated Con-
volutional Codes ................... 180
6.12 Serial Concatenated Convolutional Codes with Iter-
ative Decoding.................... 182
6.12.1 The Effect of Interleaver Size and the Number
of Iterations on AWGN Channels...... 182
viii CONTENTS
6.12.2 The Effect of Memory Order on AWGN chan-
nels....................... 184
6.12.3 Comparison of MAP and SOVA Decoding Al-
gorithms on AWGN Channels........ 186
7 Inter leavers 193
7.1 Interleaving...................... 193
7.2 Interleaving with Error Control Coding....... 195
7.3 Interleaving in Turbo Coding ............ 196
7.3.1 The Effect of Interleaver Size on Code Per-
formance .................... 197
7.3.2 The Effect of Interleaver Structure on Code
Performance.................. 198
7.3.3 Interleaving Techniques............ 200
7.4 Block Type Interleaves ............... 200
7.4.1 Block Interleaves............... 200
7.4.2 Odd-Even Block Interleaves......... 202
7.4.3 Block Helical Simile Interleaves....... 204
7.5 Convolutional Type Interleaves........... 206
7.5.1 Convolutional Interleaves.......... 206
7.5.2 Cyclic Shift Interleaves ........... 208
7.6 Random Type Interleaves.............. 209
7.6.1 Random Interleaves............. 209
7.6.2 Non-uniform Interleaves........... 210
7.6.3 S-random Interleaves............ 211
7.7 Code Matched Interleaves.............. 213
7.8 Design of Code Matched Interleaves........ 214
7.9 Performance of Turbo Codes with Code Matched In-
terleaves ....................... 220
7.10 Performance of Turbo Codes with Cyclic Shift Inter-
leavers ......................... 222
8 Turbo Coding for Fading Channels 231
8.1 Introduction...................... 231
8.2 Fading Channels ................... 232
8.2.1 Multipath Propagation............ 232
8.2.2 Doppler Shift................. 232
8.3 Statistical Models for Fading Channels....... 233
CONTENTS_______________________________________________lx
8.3.1 Rayleigh Fading................ 233
8.3.2 Rician Fading................. 235
8.4 Capacity of Fading Channels............. 236
8.5 Performance Upper Bounds on Fading Channels . . 240
8.5.1 Upper Bounds on the Pairwise Error Proba-
bility ...................... 241
8.5.2 Average Upper Bounds on the Bit Error Prob-
ability ..................... 246
8.6 Iterative Decoding on Fading Channels....... 249
8.6.1 Modified MAP Decoding with CSI ..... 252
8.6.2 Modified SOVA Decoding with CSI..... 254
8.7 Performance Simulation Results on Fading Channels 256
8.7.1 Performance Comparison Between MAP
and SOVA Algorithms on Independent
Fading Channels ............... 256
8.7.2 Performance Comparison Between Turbo and
Serial Concatenated Codes on Independent
Fading Channels ............... 256
8.7.3 Performance Comparison Between MAP and
SOVA Algorithms on Correlated Fading Chan-
nels....................... 258
8.7.4 Performance Comparison Between Turbo and
Serial Concatenated Codes on Correlated Fad-
ing Channels ................. 260
9 Turbo Trellis Coded Modulation Schemes 263
9.1 Introduction...................... 263
9.2 Binary Turbo Coded Modulation.......... 264
9.2.1 Pragmatic Binary Turbo Coded Modulation 264
9.2.2 Multilevel Turbo Coding........... 267
9.3 Turbo Trellis Coded Modulation........... 270
9.3.1 Schemes with Alternate Puncturing of
Parity Digits ................. 270
9.3.2 Log-MAP Decoding Algorithm for Turbo Trel-
lis Coded Modulation with Punctured Parity
Digits..................... 274
CONTENTS
9.3.3 SOVA Decoding Algorithm for Turbo
Trellis Coded Modulation with
Punctured Parity Digits........... 278
9.3.4 Performance of Turbo Trellis Coded Modula-
tion with Punctured Parity Digits...... 279
9.3.5 Schemes with Puncturing of Systematic Bits 282
9.4 I-Q Turbo Coded Modulation for Fading Channels 288
9.4.1 I-Q Coded Modulation Structure...... 290
9.4.2 The Decoder ................. 292
9.4.3 Performance of I-Q Turbo Coded Modulation
on Fading Channels.............. 292
10 Applications of Turbo Codes 297
10.1 Turbo Codes for Deep Space Communications . . . 297
10.2 Turbo Codes for CDMA2000............. 299
10.3 Turbo Codes for 3GPP................ 300
10.4 Turbo Codes for Satellite Communications..... 302
Index 307
List of Acronyms
3GPP 3rd Generation Partneship Project
APP a posteriori probability
AWGN additive white Gaussian noise
BER bit error rate
BPSK binary phase shift keying
BSC binary symmetric channel
bps bits per second
CCSDS Consultative Committee for Space Data Systems
CDMA code division multiple access
CRC cyclic redundancy check
CSI channel state information
GCD greatest common divisor
IOWEF input-output weight enumerating function
IRWEF input-redundancy weight enumerating function
ISI intesymbol interference
LLR log-likelihood ratio
xii_____________________________________LIST OF ACRONYMS
MAP maximum a posteriori
ML maximum likelihood
NRC nonrecursive convolutional
ODS optimal distance spectrum
PCCC parallel concatenated convolutional code
PSK phase shift keying
QAM quadrature amplitude modulation
RSC recursive systematic convolutional
SCCC serial concatenated convolutional code
SER symbol error rate
SISO soft-input soft-output
SNR signal-to-noise ratio
SOVA soft-output Viterbi algorithm
TCM trellis coded modulation
TTCM turbo trellis coded modulation
UEP unequal error protection
VA Viterbi algorithm
WEF weight enumerating function
WER word error rate
List of Figures
1.1 Model of a digital communication system...... 2
1.2 Spectral efficiency of various modulation and coding
schemes computed for the bit error rate of 10~5 . . 8
2.1 Coded system model................. 24
2.2 Performance upper bounds for the (7,4) Hamming
code.......................... 28
2.3 Trellis for the binary (5,3) code........... 33
2.4 Expurgated trellis for the binary (5,3) code..... 33
3.1 A rate 1/2 convolutional encoder.......... 38
3.2 A general (n, 1, v) convolutional code feedforward en-
coder .......................... 41
3.3 Encoder for a (3,2,1) code.............. 46
3.4 The controller canonical form of a rational transfer
function a(D)/q(D) ................. 48
3.5 The observer canonical form of a rational transfer
function a(D)/q(D) ................. 49
3.6 The controller canonical form of the systematic (2,1)
encoder with the generator matrix G (D) ..... 49
3.7 The observer canonical form of the systematic (2,1)
encoder with the generator matrix Gi(£ ) ..... 50
3.8 Nonsystematic encoder in Example 3.9....... 55
3.9 Systematic encoder in Example 3.9......... 56
3.10 A systematic encoder with the generator matrix in
(3.73) ......................... 57
3.11 Observer canonical form of an (n,n ? 1) systematic
encoder ........................ 58
xiv________________________________________LIST OF FIGURES
3.12 State diagram for the (2,1) nonsystematic convolu-
tional encoder from Fig. 3.1............. 59
3.13 State diagram for the (2,1) systematic encoder in
Fig. 3.7........................ 60
3.14 Trellis diagram for the (2,1) nonsystematic encoder
in Fig. 3.1....................... 61
3.15 Augmented state diagram of Fig. 3.12 ....... 64
3.16 Trellis diagram of a rate 2/3 punctured code pro-
duced by periodically deleting symbols from a rate
1/2 code........................ 67
3.17 Encoder for a rate 2/3 code............. 68
3.18 Trellis diagram of a rate 2/3 code.......... 68
4.1 A turbo encoder.................... 75
4.2 A rate 1/3 turbo encoder............... 77
4.3 Trellis termination.................. 78
4.4 A rate 1/2 turbo encoder............... 80
4.5 A compound error path................ 83
4.6 Bit error probability upper bounds for a turbo code
with interleaver size 500............... 86
4.7 Bit error probability upper bounds for a turbo code
with various interleaver sizes............. 91
4.8 Turbo encoder TCI.................. 94
4.9 Turbo encoder TC2.................. 94
4.10 Distance spectra for component code of TCI and
turbo code TCI with interleaver sizes of 20 and 50 . 95
4.11 Bit error probability upper bounds for component
code of TCI and turbo code TCI with interleaver
sizes of 20 and 50................... 96
4.12 Relative contributions of various distance spectral
lines to overall bit error probability for turbo code
TCI with interleaver size 20............. 97
4.13 Relative contributions of various distance spectral
lines to overall bit error probability for turbo code
TCI with interleaver size 50............. 98
4.14 Distance spectra for turbo codes TCI and TC2 with
interleaver sizes of 20 and 50............. 99
LIST OF FIGURES xv
4.15 Bit error probability upper bounds for turbo codes
TCI and TC2 with interleaver sizes of 20 and 50 . . 100
4.16 Distance spectra for ODS turbo codes with inter-
leaver size 40 ..................... 105
4.17 Bit error probability upper bounds for ODS turbo
codes with interleaver size 40 ............ 106
4.18 Performance of ODS and BM turbo codes with rate
1/3 and memory order 4 on AWGN channels .... 107
4.19 A serial concatenated encoder............ 108
5.1 System model..................... 118
5.2 A convolutional encoder and its graphical represen-
tation ......................... 127
5.3 The branch metrics in Example 5.1......... 128
5.4 The survivos and their path metrics in Example 5.1 128
5.5 The branch metrics in Example 5.2......... 133
5.6 The forward recusion in Example 5.2, the ML path
is shown by the thick line .............. 133
5.7 The backward recursion in Example 5.2, the ML
path is shown by the thick line............ 133
5.8 Forward and Backward processing for the simplified
SOVA......................... 137
5.9 A rate 1/2 memory order 2 RSC encoder...... 139
5.10 State transition diagram for the (2,1,2) RSC code . 140
5.11 Trellis diagram for the (2,1,2) RSC code...... 141
5.12 Graphical representation of the forward recusion . 146
5.13 Graphical representation of the backward recursion 147
5.14 Trellis diagram for the encoder in Example 5.3 .. . 150
5.15 Performance comparison of MAP and SOVA .... 154
6.1 Basic turbo encoder.................. 158
6.2 An iterative turbo code decoder based on the MAP
algorithm....................... 160
6.3 BER performance of a 16 state, rate 1/3 turbo code
with MAP algorithm on an AWGN channel, inter-
leaver size 4096 bits, variable number of iterations. 164
xyi_______________________________________LIST OF FIGURES
6.4 BER performance of a 16 state, rate 1/3 turbo code
with MAP algorithm on an AWGN channel, inter-
leaver size 16384 bits, variable number of iterations 165
6.5 BER performance of a 16 state, rate 1/3 turbo code
with MAP algorithm on an AWGN channel, inter-
leaver size N, the number of iterations 18...... 167
6.6 BER performance of a 16 state, rate 1/2 turbo code
with MAP algorithm on an AWGN channel, inter-
leaver size N, the number of iterations 18...... 168
6.7 BER performance of a 16 state, rate 2/3 turbo code
with MAP algorithm on an AWGN channel, inter-
leaver size N, the number of iterations 18 ..... 169
6.8 Simulation result of a 16 state, rate 1/3 turbo code
with MAP, interleaver size 1024 bits, variable num-
ber of iterations / and the theoretical bound on an
AWGN channel..................... 170
6.9 Simulation result of a 16 state, rate 1/3 turbo code
with MAP, interleaver size 1024 bits, the number of
iterations 10 and the theoretical bound on an AWGN
channel......................... 172
6.10 An iterative turbo code decoder based on the SOVA
algorithm....................... 174
6.11 BER performance of a 16 state, rate 1/3 turbo code
with MAP, Log-MAP and SOVA algorithm on an
AWGN channel, interleaver size 4096 bits, the num-
ber of iterations 18.................. 178
6.12 Iterative MAP decoder for serial concatenated codes 179
6.13 Iterative SOVA decoder for serial concatenated codes 181
6.14 Performance of a rate 1/3 serial concatenated code,
with a rate 1/2, 4 state nonrecursive convolutional
code as the outer code, a rate 2/3, 4 state recusive
convolutional code as the inner code, AWGN chan-
nel, SOVA decoding algorithm, various interleaver
size N, and the number of iterations 20 ...... 184
LIST OF FIGURES_______________________________________xyii
6.15 Comparison of a rate 1/3, memory order 2 turbo
code with interleaver size 4096 bits and a rate 1/3
serial concatenated code with memory order 2 outer
code, interleaver size 4096 bits on an AWGN channel,
SOVA decoding algorithm, the number of iterations
18........................... 185
6.16 BER performance of a rate 1/3 serial concatenated
code with rate 1/2, 4 state outer code and rate 2/3, 4
state inner code with SOVA algorithm on an AWGN
channel, interleaver size 4096 bits, variable number
of iterations...................... 186
6.17 Comparison of a rate 1/3 turbo code for different
memory order with SOVA algorithm on an AWGN
channel, interleaver size 1024 bits, the number of it-
erations 12....................... 187
6.18 Comparison of a rate 1/3 turbo code for different
memory order with SOVA algorithm on an AWGN
channel, interleaver size 4096 bits, the number of it-
erations 18....................... 188
6.19 Comparison of a rate 1/3 serial concatenated code
for different outer code memory order with SOVA al-
gorithm on an AWGN channel, interleaver size 1024
bits, the number of iterations 12........... 188
6.20 Comparison of a rate 1/3 serial concatenated code
for different outer code memory order with SOVA al-
gorithm on an AWGN channel, interleaver size 4096
bits, the number of iterations 18........... 189
6.21 Performance comparison of MAP and SOVA for a
rate 1/3 serial concatenated convolutional code . . 189
7.1 An interleaver device................. 194
7.2 An interleaver mapping................ 195
7.3 Distance spectra for a turbo code with various inter-
leaver sizes....................... 198
7.4 Bit error probability upper bounds for a turbo code
with various interleaver sizes............. 199
7.5 A block interleaver.................. 201
xviii______________________________________LIST OF FIGURES
7.6 A weight-4 square input pattern of block interleaves 202
7.7 A convolutional interleaver and deinterleaver .... 207
7.8 A convolutional interleaver with L = 3 and B = 2 . 208
7.9 A cyclic shift interleaver............... 209
7.10 A general m-stage shift register with linear feedback 210
7.11 A weight-2 input sequence pattern.......... 217
7.12 A weight-4 input sequence pattern.......... 218
7.13 BER performance of the 4-state, rate 1/3, (1, 5/7)
turbo code with random, 5-random and code matched
interleaves on an AWGN channel.......... 221
7.14 BER performance of the 8-state, rate 1/3, (1, 17/15)
turbo code with random, 5-random and code matched
interleaves on an AWGN channel.......... 222
7.15 BER performance of the 16-state, rate 1/3, (1, 33/31)
turbo code with random, 5-random and code matched
interleaves on an AWGN channel.......... 223
7.16 BER performance of the 16-state, rate 1/3, (1, 33/31)
turbo code with 5-random and cyclic shift inter-
leavers on an AWGN channel ............ 224
8.1 The pdf of Rayleigh distribution........... 234
8.2 The pdf of Rician distributions with various K . . . 237
8.3 Capacity of independent Rayleigh fading channels
with coherent BPSK signalling............ 239
8.4 Coded system block diagram............. 241
8.5 Bit error probability upper bound for the 4 state,
rate 1/3 turbo code with interleaver size 100 on in-
dependent Rician fading channels with ideal channel
state information. The curves are for Rician chan-
nels with .fir=0, 2, 5, 50, starting from the top, with
the bottom one referring to an AWGN channel. . . 249
8.6 Bit error probability upper bound for the 4 state,
rate 1/3 turbo code with interleaver size 100 on in-
dependent Rician fading channels without channel
state information. The curves are for Rician chan-
nels with K=0, 2, 5, 50, starting from the top, with
the bottom one referring to an AWGN channel. . . 250
LIST OF FIGURES xix
8.7 Bit error probability upper bound for the 4 state,
rate 1/3 serial code with information size 100 on in-
dependent Rician fading channels with ideal channel
state information. The curves are for Rician chan-
nels with K=0, 2, 5, 50, starting from the top, with
the bottom one referring to an AWGN channel. . . 251
8.8 Bit error probability upper bound for the 4 state,
rate 1/3 serial code with information size 100 on in-
dependent Rician fading channels without channel
state information. The curves are for Rician chan-
nels with K=0, 2, 5, 50, starting from the top, with
the bottom one referring to an AWGN channel. . . 252
8.9 Distance spectrum comparison of the 4 state, rate
1/3 turbo and serial concatenated codes with infor-
mation size 100.................... 253
8.10 Bit error probability upper bound comparison of the
4 state, rate 1/3 turbo and serial concatenated codes
with information size 100 on independent Rayleigh
fading channels.................... 254
8.11 Performance comparison of MAP and SOVA, with
and without CSI, for the 16 state, rate 1/3 turbo
code on an independent Rayleigh fading channel, in-
formation size 1024, the number of iterations 8 . . . 257
8.12 Performance comparison for the 4 state, rate 1/3
turbo and serial codes on an independent Rayleigh
fading channel..................... 258
8.13 Performance comparison of MAP and SOVA, with
and without CSI, for the 16 state, rate 1/3 turbo
code on a correlated Rayleigh fading channel, the
fading rate normalized by the symbol rate is 10-2,
information size 1024, the number of iterations 8 . . 259
8.14 Performance comparison for the turbo and serial codes
on a correlated Rayleigh fading channel, the fading
rate normalized by the symbol rate is 10~2, informa-
tion size N, the number of iterations /....... 260
9.1 Pragmatic turbo TCM encoder........... 265
xx LIST OF FIGURES
9.2 Pragmatic turbo TCM decoder ........... 265
9.3 16-QAM with Gray mapping............. 266
9.4 Multilevel turbo encoder............... 268
9.5 Multilevel turbo decoder............... 269
9.6 Turbo TCM encoder with parity symbol puncturing 271
9.7 Example of a turbo trellis coded 8-PSK with parity
symbol puncturing.................. 273
9.8 Turbo TCM decoder with parity symbol puncturing 275
9.9 Performance of the rate 2/3, 4-state turbo trellis
coded 8-PSK with various interleaver sizes on an
AWGN channel, SOVA decoding algorithm, the num-
ber of iterations /, bandwidth efficiency 2 bits/s/Hz 280
9.10 Performance of the rate 2/3, 8-state turbo trellis
coded 8-PSK with various interleaver sizes on an
AWGN channel, SOVA decoding algorithm, the num-
ber of iterations J, bandwidth efficiency 2 bits/s/Hz 281
9.11 Performance of the rate 2/3, 16-state turbo trellis
coded 8-PSK with various interleaver sizes on an
AWGN channel, SOVA decoding algorithm, the num-
ber of iterations /, bandwidth efficiency 2 bits/s/Hz 282
9.12 Performance comparison of the Log-MAP and SOVA
for the rate 2/3, 8-state turbo trellis coded 8-PSK
with interleaver size 1024 on an AWGN channel,
bandwidth efficiency 2 bits/s/Hz .......... 283
9.13 Performance comparison of the Log-MAP and SOVA
for the rate 3/4, 4-state turbo trellis coded 16-QAM
with various interleaver sizes on an AWGN channel,
bandwidth efficiency 3 bits/s/Hz .......... 284
9.14 Performance comparison of the Log-MAP and SOVA
for the rate 3/4, 8-state turbo trellis coded 16-QAM
with various interleaver sizes on an AWGN channel,
bandwidth efficiency 3 bits/s/Hz .......... 285
9.15 Performance comparison of the Log-MAP and SOVA
for the rate 3/4, 16-state turbo trellis coded 16-QAM
with various interleaver sizes on an AWGN channel,
bandwidth efficiency 3 bits/s/Hz .......... 286
LIST OF FIGURES xxi
9.16 Turbo trellis coded 16-QAM with systematic symbol
puncturing....................... 287
9.17 Performance comparison of the turbo trellis coded
16-QAM with systematic symbol puncturing and the
pragmatic turbo coded 16-QAM with bandwidth ef-
ficiency 2 bits/s/Hz and interleaver size 32768 on an
AWGN channel, the number of iterations 8..... 288
9.18 Turbo trellis coded 8-PSK with systematic symbol
puncturing....................... 289
9.19 Performance of the turbo trellis coded 8-PSK with
systematic symbol puncturing with bandwidth effi-
ciency 2 bits/s/Hz and interleaver size 16384 on an
AWGN channel, the number of iterations I..... 290
9.20 I-Q turbo trellis coded 16-QAM........... 291
9.21 Performance of the I-Q turbo coded 16-QAM with
bandwidth efficiency 2 bits/s/Hz and various inter-
leaver sizes on a Rayleigh fading channel...... 293
9.22 Performance comparison of the I-Q turbo coded 16-
QAM and the pragmatic turbo coded 16-QAM with
bandwidth efficiency 2 bits/s/Hz and interleaver size
4096 on a Rayleigh fading channel.......... 294
10.1 CCSDS turbo encoder block diagram........ 298
10.2 The revese link turbo encoder for CDMA2000 ... 300
10.3 The turbo encoder for 3GPP............. 301
10.4 The serial concatenated convolutional encoder for
3GPP ......................... 303
List of Tables
2.1 A (6, 3) linear block code .............. 15
3.1 Punctured convolutional codes............ 70
4.1 Best rate 1/3 turbo codes at high SNR s [14] .... 103
4.2 Rate 1/3 ODS turbo codes at Low SNR s...... 104
5.1 Decoder complexity comparison........... 153
8.1 Channel capacity limits for coherent BPSK..... 240
9.1 Rate 2/3 turbo trellis coded 8-PSK schemes .... 279
9.2 Rate 3/4 turbo trellis coded 16-QAM schemes ... 281
|
| any_adam_object | 1 |
| author | Vucetic, Branka Yuan, Jinhong |
| author_facet | Vucetic, Branka Yuan, Jinhong |
| author_role | aut aut |
| author_sort | Vucetic, Branka |
| author_variant | b v bv j y jy |
| building | Verbundindex |
| bvnumber | BV013378473 |
| callnumber-first | T - Technology |
| callnumber-label | TK5102 |
| callnumber-raw | TK5102.92. |
| callnumber-search | TK5102.92. |
| callnumber-sort | TK 45102.92 |
| callnumber-subject | TK - Electrical and Nuclear Engineering |
| classification_rvk | SK 170 |
| ctrlnum | (OCoLC)44046784 (DE-599)BVBBV013378473 |
| dewey-full | 003/.54 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 003 - Systems |
| dewey-raw | 003/.54 |
| dewey-search | 003/.54 |
| dewey-sort | 13 254 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik Mathematik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01609nam a2200409 cb4500</leader><controlfield tag="001">BV013378473</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">001009s2000 d||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0792378687</subfield><subfield code="9">0-7923-7868-7</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)44046784</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV013378473</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-29T</subfield><subfield code="a">DE-1046</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">TK5102.92.</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">003/.54</subfield><subfield code="2">21</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 170</subfield><subfield code="0">(DE-625)143221:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Vucetic, Branka</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Turbo codes</subfield><subfield code="b">principles and applications</subfield><subfield code="c">Branka Vucetic ; Jinhong Yuan</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Boston [u.a.]</subfield><subfield code="b">Kluwer</subfield><subfield code="c">2000</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XXVI, 312 S.</subfield><subfield code="b">graph. Darst.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">The Kluwer international series in engineering and computer science</subfield><subfield code="v">559</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Coding theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Error-correcting codes (Information theory)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Signal theory (Telecommunication)</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Turbo-Code</subfield><subfield code="0">(DE-588)4558308-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Turbo-Code</subfield><subfield code="0">(DE-588)4558308-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Yuan, Jinhong</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">The Kluwer international series in engineering and computer science</subfield><subfield code="v">559</subfield><subfield code="w">(DE-604)BV023545171</subfield><subfield code="9">559</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">HBZ Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009125327&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-009125327</subfield></datafield></record></collection> |
| id | DE-604.BV013378473 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T18:44:47Z |
| institution | BVB |
| isbn | 0792378687 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-009125327 |
| oclc_num | 44046784 |
| open_access_boolean | |
| owner | DE-29T DE-1046 |
| owner_facet | DE-29T DE-1046 |
| physical | XXVI, 312 S. graph. Darst. |
| publishDate | 2000 |
| publishDateSearch | 2000 |
| publishDateSort | 2000 |
| publisher | Kluwer |
| record_format | marc |
| series | The Kluwer international series in engineering and computer science |
| series2 | The Kluwer international series in engineering and computer science |
| spelling | Vucetic, Branka Verfasser aut Turbo codes principles and applications Branka Vucetic ; Jinhong Yuan Boston [u.a.] Kluwer 2000 XXVI, 312 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier The Kluwer international series in engineering and computer science 559 Coding theory Error-correcting codes (Information theory) Signal theory (Telecommunication) Turbo-Code (DE-588)4558308-0 gnd rswk-swf Turbo-Code (DE-588)4558308-0 s DE-604 Yuan, Jinhong Verfasser aut The Kluwer international series in engineering and computer science 559 (DE-604)BV023545171 559 HBZ Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009125327&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Vucetic, Branka Yuan, Jinhong Turbo codes principles and applications The Kluwer international series in engineering and computer science Coding theory Error-correcting codes (Information theory) Signal theory (Telecommunication) Turbo-Code (DE-588)4558308-0 gnd |
| subject_GND | (DE-588)4558308-0 |
| title | Turbo codes principles and applications |
| title_auth | Turbo codes principles and applications |
| title_exact_search | Turbo codes principles and applications |
| title_full | Turbo codes principles and applications Branka Vucetic ; Jinhong Yuan |
| title_fullStr | Turbo codes principles and applications Branka Vucetic ; Jinhong Yuan |
| title_full_unstemmed | Turbo codes principles and applications Branka Vucetic ; Jinhong Yuan |
| title_short | Turbo codes |
| title_sort | turbo codes principles and applications |
| title_sub | principles and applications |
| topic | Coding theory Error-correcting codes (Information theory) Signal theory (Telecommunication) Turbo-Code (DE-588)4558308-0 gnd |
| topic_facet | Coding theory Error-correcting codes (Information theory) Signal theory (Telecommunication) Turbo-Code |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009125327&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV023545171 |
| work_keys_str_mv | AT vuceticbranka turbocodesprinciplesandapplications AT yuanjinhong turbocodesprinciplesandapplications |