Analysis and design of turbo code interleavers:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Abschlussarbeit Buch |
| Sprache: | English |
| Veröffentlicht: |
Aachen
Shaker
2002
|
| Schriftenreihe: | Erlanger Berichte aus Informations- und Kommunikationstechnik
2 |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | VIII, 259 S. graph. Darst. : 21 cm |
| ISBN: | 3832203028 |
Internformat
MARC
| LEADER | 00000nam a22000008cb4500 | ||
|---|---|---|---|
| 001 | BV014330876 | ||
| 003 | DE-604 | ||
| 005 | 20020806 | ||
| 007 | t | ||
| 008 | 020604s2002 gw d||| m||| 00||| eng d | ||
| 016 | 7 | |a 964461544 |2 DE-101 | |
| 020 | |a 3832203028 |9 3-8322-0302-8 | ||
| 035 | |a (OCoLC)51519100 | ||
| 035 | |a (DE-599)BVBBV014330876 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c DE | ||
| 049 | |a DE-29 |a DE-29T |a DE-634 | ||
| 050 | 0 | |a TK5102.96 | |
| 084 | |a ZN 6045 |0 (DE-625)157497: |2 rvk | ||
| 100 | 1 | |a Breiling, Marco |d 1970- |e Verfasser |0 (DE-588)123923735 |4 aut | |
| 245 | 1 | 0 | |a Analysis and design of turbo code interleavers |c Marco Breiling |
| 264 | 1 | |a Aachen |b Shaker |c 2002 | |
| 300 | |a VIII, 259 S. |b graph. Darst. : 21 cm | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Erlanger Berichte aus Informations- und Kommunikationstechnik |v 2 | |
| 502 | |a Zugl.: Erlangen, Nürnberg, Univ., Diss., 2002 | ||
| 650 | 4 | |a Coding theory | |
| 650 | 4 | |a Error-correcting codes (Information theory) | |
| 650 | 0 | 7 | |a Interleaving |0 (DE-588)4603410-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Turbo-Code |0 (DE-588)4558308-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Kanalcodierung |0 (DE-588)4163183-3 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Kanalcodierung |0 (DE-588)4163183-3 |D s |
| 689 | 0 | 1 | |a Turbo-Code |0 (DE-588)4558308-0 |D s |
| 689 | 0 | 2 | |a Interleaving |0 (DE-588)4603410-9 |D s |
| 689 | 0 | |5 DE-604 | |
| 830 | 0 | |a Erlanger Berichte aus Informations- und Kommunikationstechnik |v 2 |w (DE-604)BV035419901 |9 2 | |
| 856 | 4 | 2 | |m DNB Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009831401&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-009831401 | |
Datensatz im Suchindex
| _version_ | 1808136409461030912 |
|---|---|
| adam_text |
III
CONTENTS
1
INTRODUCTION
1
2
SYSTEM
MODEL
AND
BASIC
CONCEPTS
5
2.1
TRANSMISSION
MODEL
.
5
2.2
BASIC
CONCEPTS
OF
CHANNEL
CODING
.
7
2.3
TURBO
CODES
.
8
2.3.1
TURBO
ENCODER
.
9
2.3.1.1
INTERPRETING
AN
INPUT
WORD
AS
CONCATENATED
STRINGS
.
12
2.3.1.2
THE
TERMINATION
PROBLEM
.
15
2.3.1.3
WOVEN
ERROR
PATTERNS
.
16
2.3.2
TURBO
DECODER
.
23
2.3.3
ROLE
OF
THE
INTERLEAVER
.
27
2.4
COMPARING
THE
POWER
EFFICIENCY
OF
CHANNEL
CODES
.
30
3
DETERMINATION
OF
THE
DISTANCE
SPECTRUM
37
3.1
THE
TEMPLATE
COMPONENT
ENCODERS
.
37
3.2
PROBLEM
MOTIVATION
.
38
3.3
IDENTIFICATION
OF
THE
ERROR
PATTERNS
.
40
3.4
STATE
OF
THE
ART
.
40
3.5
ALGORITHM
FOR
DETERMINING
THE
DISTANCE
SPECTRUM
.
43
3.5.1
PARTITIONING
THE
INPUT
WORDS
.
44
3.5.2
EXAMPLE
OF
THE
BACKTRACKING
ALGORITHM
.
45
3.5.3
DESCRIPTION
OF
THE
BACKTRACKING
ALGORITHM
.
48
IV
CONTENTS
3.5.3.1
FRAMEWORK
OF
THE
BACKTRACKING
ALGORITHM
.
48
3.5.3.2
BACKTRACKING
PROCEDURE
FOR
THE
FIRST
COMPONENT
.
49
3.5.3.3
FIRST
SUBTASK
IN
BACKTRACK*
1
'
.
51
3.5.3.4
SECOND
SUBTASK
IN
BACKTRACK*
1
'
.
52
3.5.3.5
BACKTRACKING
PROCEDURE
FOR
THE
SECOND
COMPONENT
.
53
3.5.3.6
RETURNING
TO
A
LOWER
RECURSION
LEVEL
.
54
3.5.3.7
REASONS
FOR
CONDITIONS
A
AND
B
.
55
3.5.3.8
ACCUMULATING
THE
CODEWORD
WEIGHT
.
57
3.5.4
IDENTIFYING
THE
CWEP
'
S
.
60
3.5.5
COMPLEXITY
CONSIDERATIONS
AND
REMARKS
.
61
3.6
VERIFICATION
OF
THE
ALGORITHM
.
62
3.6.1
COMPARISON
WITH
THE
UNIFORM
INTERLEAVER
.
62
3.6.2
COMPARISON
WITH
SIMULATIONS
.
65
3.6.3
COMPARISON
WITH
A
RANDOM
INTERLEAVER
.
68
3.7
ANALYSIS
OF
THE
UNIFORM
INTERLEAVER
.
70
3.7.1
SPECTRAL
THINNING
.
70
3.7.2
MULTIPLE
EP
'
S
.
72
3.7.3
FURTHER
RESULTS
.
75
3.8
DISTRIBUTION
OF
THE
MINIMUM
DISTANCE
.
76
3.8.1
MEASURED
DISTRIBUTION
OF
THE
MINIMUM
DISTANCE
.
76
3.8.2
ANALYTICAL
CALCULATION
OF
THE
ASYMPTOTIC
DISTRIBUTION
.
78
3.9
SUMMARY
.
81
4
INTERLEAVER
DESIGN
FOR
INCREASING
THE
MINIMUM
DISTANCE
83
4.1
STATE
OF
THE
ART
.
84
4.1.1
RECTANGULAR
AND
LINEAR
INTERLEAVERS
.
85
4.1.2
OPTIMIZATION
THEORETIC
APPROACHES
.
86
4.1.3
FURTHER
INTERLEAVER
DESIGN
ALGORITHMS
.
88
4.2
DESIGNING
SPREADING
INTERLEAVERS
.
88
4.2.1
EFFECT
OF
SPREADING
IN
THE
INTERLEAVER
.
89
CONTENTS
V
4.2.2
S-RANDOM
INTERLEAVERS
.
93
4.2.2.1
ANALYSIS
OF
S-RANDOM
INTERLEAVERS
.
93
4.2.2.2
VARIATIONS
OF
THE
S-RANDOM
DESIGN
.
95
4.2.3
DITHERED
GOLDEN
AND
DITHERED
DIAGONAL
INTERLEAVERS
.
98
4.2.4
KHANDANI
'
S
INTERLEAVER
DESIGN
ALGORITHM
.
99
4.3
INTERLEAVER
DESIGN
BASED
ON
BACKTRACKING
.
100
4.4
COMBINING
THE
SPREADING
AND
THE
BACKTRACKING
INTERLEAVER
DESIGNS
.
104
4.5
ANALYSIS
OF
THE
DESIGNED
INTERLEAVERS
.
106
4.6
SIMULATION
RESULTS
.
113
4.7
SUMMARY
.
117
5
GEOMETRIC
BOUND
ON
THE
MINIMUM
DISTANCE
119
5.1
STATE
OF
THE
ART
.
119
5.2
BASIC
CONSIDERATIONS
.
121
5.3
CALCULATING
THE
COMPONENT
PARITY
WEIGHT
FOR
INPUT
WEIGHT
2
.
122
5.3.1
UPPER
BOUND
ON
THE
OUTPUT
WEIGHT
OF
A
COMPONENT
ENCODER
.
122
5.3.2
ANALYTICAL
UPPER
BOUNDS
.
125
5.3.3
CHARACTERIZATION
OF
ENSEMBLES
OF
TURBO
CODES
.
126
5.4
DERIVATION
OF
THE
GEOMETRIC
UPPER
BOUND
.
127
5.4.1
SPECIFICATION
OF
THE
SET
OF
CONSIDERED
INPUT
WORDS
.
128
5.4.2
PACKING
POINTS
INTO
A
RECTANGLE
.
130
5.4.3
PROOF
OF
THE
GEOMETRIC
BOUND
.
132
5.5
SIMPLIFICATION
OF
THE
BOUND
.
134
5.6
DISCUSSION
OF
THE
GEOMETRIC
BOUNDS
.
134
5.6.1
COMPARING
THE
GEOMETRIC
BOUNDS
.
135
5.6.2
EVALUATING
THE
TIGHTNESS
OF
THE
BOUNDS
.
136
6
COMBINATORIAL
BOUND
ON
THE
MINIMUM
DISTANCE
139
6.1
PARTITIONING
THE
INPUT
WORD
INDICES
.
139
6.1.1
MOTIVATION
OF
THE
PARTITIONING
STRATEGY
.
139
VI
CONTENTS
6.1.2
SPECIFYING
THE
QUI
PARTITIONING
.
141
6.1.3
THE
COMPONENT
PARITY
WEIGHT
FOR
HIGHER
INPUT
WEIGHTS
.
144
6.2
UPPER
BOUND
FOR
INPUT
WORDS
OF
WEIGHT
2
.
144
6.2.1
DERIVATION
OF
THE
BOUND
.
145
6.2.2
SIMPLIFICATION
OF
THE
BOUND
.
146
6.3
UPPER
BOUND
FOR
INPUT
WORDS
OF
WEIGHT
4
.
147
6.3.1
DERIVATION
OF
THE
BOUND
.
148
6.3.2
SIMPLIFICATION
OF
THE
BOUND
.
151
6.4
DISCUSSION
OF
THE
COMBINATORIAL
BOUNDS
.
153
6.4.1
COMPARISON
BETWEEN
THE
COMBINATORIAL
BOUNDS
.
153
6.4.2
COMPARISON
WITH
THE
GEOMETRIC
BOUNDS
.
155
6.4.3
DEPENDENCE
ON
THE
PERIOD
LENGTH
.
156
7
GRAPH-THEORETIC
BOUND
ON
THE
MINIMUM
DISTANCE
159
7.1
GRAPH
ASSOCIATED
WITH
A
TURBO
CODE
.
159
7.1.1
MAPPING
THE
TURBO
CODE
TO
A
GRAPH
.
160
7.1.2
CONNECTION
BETWEEN
CYCLE
LENGTHS
AND
CODEWORD
WEIGHTS
.
163
7.2
DERIVATION
OF
THE
GRAPH-THEORETIC
BOUND
.
165
7.2.1
UPPER
BOUNDING
THE
MINIMUM
DISTANCE
FOR
A
GIVEN
INTERLEAVER
.
165
7.2.2
UPPER
BOUNDING
THE
GIRTH
AND
THE
MINIMUM
DISTANCE
FOR
ALL
INTERLEAVERS
166
7.2.3
CLOSED-FORM
UPPER
BOUND
.
169
7.3
SIMPLIFICATION
OF
THE
BOUND
.
171
7.3.1
CALCULATING
A
FROM
12
M
I
N
.
172
7.3.2
MINIMIZATION
OVER
THE
PARAMETERS
AND
.
173
7.3.3
APPROXIMATION
OF
THE
MINIMIZATION
TERM
.
173
7.3.4
IDENTIFYING
THE
MINIMUM
.
175
7.3.5
EVALUATION
OF
THE
TIGHTNESS
FOR
AN
EXAMPLE
.
176
7.3.6
FIXING
THE
SET
O
.
177
7.3.7
UPPER
BOUND
WITHOUT
MINIMIZATION
.
177
7.4
DISCUSSION
OF
THE
UPPER
BOUNDS
ON
THE
MINIMUM
DISTANCE
.
179
CONTENTS
VII
7.4.1
COMPARING
THE
TIGHTNESS
OF
THE
GRAPH-THEORETIC
BOUNDS
.
179
7.4.2
COMPARISON
WITH
PREVIOUSLY
DERIVED
BOUNDS
.
181
7.4.3
THE
INPUT
WEIGHT
LIMITING
THE
MINIMUM
DISTANCE
.
185
7.4.4
CONNECTION
WITH
THE
COMBINATORIAL
BOUNDS
.
187
7.4.5
INTUITIVE
JUSTIFICATION
OF
A
LOGARITHMIC
UPPER
BOUND
.
189
7.5
IMPLICATIONS
FOR
THE
ERROR
EXPONENT
OF
TURBO
CODES
.
190
7.6
SUMMARY
.
193
8
FINAL
DISCUSSION
AND
CONCLUSIONS
195
APPENDIX
A
PROOFS
AND
DERIVATIONS
201
A.L
PROOF
OF
LEMMA
1
.
201
A.2
PROOF
OF
LEMMA
2
.
204
A.3
PROOF
OF
2
C
4
.
208
A.4
DERIVATION
OF
THE
LOWER
LIMIT
FOR
K
IN
THEOREM
9
.
210
A.5
PROOF
OF
THEOREM
10
.
211
A.6
PROOF
OF
THEOREM
13
.
213
A.
7
PROOF
OF
LEMMA
6
.
217
A.8
PROOF
OF
LEMMA
7
.
218
A.9
NUMERICAL
DETERMINATION
OF
THE
MINIMUM
.
218
A.10
CHOOSING
O
AS
CONSECUTIVE
INTEGERS
.
218
B
SOME
COMMENTS
ON
THE
PROBABILITIES
USED
IN
A
DECODER
221
B.L
PRE
AND
POST-DECODING
PROBABILITIES
.
221
B.2
COMBINING
PROBABILITIES
.
222
B.3
PARTIAL
AND
EXTRINSIC
PROBABILITIES
.
224
C
ANALYSIS
RESULTS
FOR
THE
DESIGNED
INTERLEAVERS
227
D
GERMAN
TRANSLATIONS
235
VIII
CONTENTS
GLOSSARY
245
BIBLIOGRAPHY
251 |
| any_adam_object | 1 |
| author | Breiling, Marco 1970- |
| author_GND | (DE-588)123923735 |
| author_facet | Breiling, Marco 1970- |
| author_role | aut |
| author_sort | Breiling, Marco 1970- |
| author_variant | m b mb |
| building | Verbundindex |
| bvnumber | BV014330876 |
| callnumber-first | T - Technology |
| callnumber-label | TK5102 |
| callnumber-raw | TK5102.96 |
| callnumber-search | TK5102.96 |
| callnumber-sort | TK 45102.96 |
| callnumber-subject | TK - Electrical and Nuclear Engineering |
| classification_rvk | ZN 6045 |
| ctrlnum | (OCoLC)51519100 (DE-599)BVBBV014330876 |
| discipline | Elektrotechnik / Elektronik / Nachrichtentechnik |
| format | Thesis Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a22000008cb4500</leader><controlfield tag="001">BV014330876</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20020806</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">020604s2002 gw d||| m||| 00||| eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">964461544</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3832203028</subfield><subfield code="9">3-8322-0302-8</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)51519100</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV014330876</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">DE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-29</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-634</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">TK5102.96</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ZN 6045</subfield><subfield code="0">(DE-625)157497:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Breiling, Marco</subfield><subfield code="d">1970-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)123923735</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Analysis and design of turbo code interleavers</subfield><subfield code="c">Marco Breiling</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Aachen</subfield><subfield code="b">Shaker</subfield><subfield code="c">2002</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">VIII, 259 S.</subfield><subfield code="b">graph. Darst. : 21 cm</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">Erlanger Berichte aus Informations- und Kommunikationstechnik</subfield><subfield code="v">2</subfield></datafield><datafield tag="502" ind1=" " ind2=" "><subfield code="a">Zugl.: Erlangen, Nürnberg, Univ., Diss., 2002</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="0" ind2="7"><subfield code="a">Interleaving</subfield><subfield code="0">(DE-588)4603410-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</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="650" ind1="0" ind2="7"><subfield code="a">Kanalcodierung</subfield><subfield code="0">(DE-588)4163183-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Kanalcodierung</subfield><subfield code="0">(DE-588)4163183-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><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="2"><subfield code="a">Interleaving</subfield><subfield code="0">(DE-588)4603410-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Erlanger Berichte aus Informations- und Kommunikationstechnik</subfield><subfield code="v">2</subfield><subfield code="w">(DE-604)BV035419901</subfield><subfield code="9">2</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">DNB 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=009831401&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-009831401</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV014330876 |
| illustrated | Illustrated |
| indexdate | 2024-08-23T00:34:12Z |
| institution | BVB |
| isbn | 3832203028 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-009831401 |
| oclc_num | 51519100 |
| open_access_boolean | |
| owner | DE-29 DE-29T DE-634 |
| owner_facet | DE-29 DE-29T DE-634 |
| physical | VIII, 259 S. graph. Darst. : 21 cm |
| publishDate | 2002 |
| publishDateSearch | 2002 |
| publishDateSort | 2002 |
| publisher | Shaker |
| record_format | marc |
| series | Erlanger Berichte aus Informations- und Kommunikationstechnik |
| series2 | Erlanger Berichte aus Informations- und Kommunikationstechnik |
| spelling | Breiling, Marco 1970- Verfasser (DE-588)123923735 aut Analysis and design of turbo code interleavers Marco Breiling Aachen Shaker 2002 VIII, 259 S. graph. Darst. : 21 cm txt rdacontent n rdamedia nc rdacarrier Erlanger Berichte aus Informations- und Kommunikationstechnik 2 Zugl.: Erlangen, Nürnberg, Univ., Diss., 2002 Coding theory Error-correcting codes (Information theory) Interleaving (DE-588)4603410-9 gnd rswk-swf Turbo-Code (DE-588)4558308-0 gnd rswk-swf Kanalcodierung (DE-588)4163183-3 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Kanalcodierung (DE-588)4163183-3 s Turbo-Code (DE-588)4558308-0 s Interleaving (DE-588)4603410-9 s DE-604 Erlanger Berichte aus Informations- und Kommunikationstechnik 2 (DE-604)BV035419901 2 DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009831401&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Breiling, Marco 1970- Analysis and design of turbo code interleavers Erlanger Berichte aus Informations- und Kommunikationstechnik Coding theory Error-correcting codes (Information theory) Interleaving (DE-588)4603410-9 gnd Turbo-Code (DE-588)4558308-0 gnd Kanalcodierung (DE-588)4163183-3 gnd |
| subject_GND | (DE-588)4603410-9 (DE-588)4558308-0 (DE-588)4163183-3 (DE-588)4113937-9 |
| title | Analysis and design of turbo code interleavers |
| title_auth | Analysis and design of turbo code interleavers |
| title_exact_search | Analysis and design of turbo code interleavers |
| title_full | Analysis and design of turbo code interleavers Marco Breiling |
| title_fullStr | Analysis and design of turbo code interleavers Marco Breiling |
| title_full_unstemmed | Analysis and design of turbo code interleavers Marco Breiling |
| title_short | Analysis and design of turbo code interleavers |
| title_sort | analysis and design of turbo code interleavers |
| topic | Coding theory Error-correcting codes (Information theory) Interleaving (DE-588)4603410-9 gnd Turbo-Code (DE-588)4558308-0 gnd Kanalcodierung (DE-588)4163183-3 gnd |
| topic_facet | Coding theory Error-correcting codes (Information theory) Interleaving Turbo-Code Kanalcodierung Hochschulschrift |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009831401&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV035419901 |
| work_keys_str_mv | AT breilingmarco analysisanddesignofturbocodeinterleavers |