On the finite-length modern forward error correction codes: design and iterative decoding
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Abschlussarbeit Buch |
| Sprache: | English |
| Veröffentlicht: |
Stuttgart
2023
|
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | xxiv, 150 Seiten Illustrationen, Diagramme |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV049500487 | ||
| 003 | DE-604 | ||
| 005 | 20240118 | ||
| 007 | t | ||
| 008 | 240115s2023 gw a||| m||| 00||| eng d | ||
| 035 | |a (OCoLC)1408829195 | ||
| 035 | |a (DE-599)KXP1850734925 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c XA-DE-BW | ||
| 049 | |a DE-739 | ||
| 084 | |a ZN 6015 |0 (DE-625)157492: |2 rvk | ||
| 084 | |a 53.73 |2 bkl | ||
| 100 | 1 | |a Ebada, Moustafa |e Verfasser |0 (DE-588)1293410632 |4 aut | |
| 245 | 1 | 0 | |a On the finite-length modern forward error correction codes |b design and iterative decoding |c vorgelegt von Moustafa Mohamed Nabil Elsayed Mohamed Ebada ; Hauptberichter: Prof. Dr.-Ing. Stephan ten Brink ; Mitberichter: Prof. Dr.-Ing. Gerhard Bauch |
| 264 | 1 | |a Stuttgart |c 2023 | |
| 300 | |a xxiv, 150 Seiten |b Illustrationen, Diagramme | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 502 | |b Dissertation |c Universität Stuttgart |d 2023 | ||
| 583 | 1 | |a Archivierung/Langzeitarchivierung gewährleistet |c Stuttgart |f DISS |2 pdager |5 DE-93 | |
| 583 | 1 | |a Archivierung/Langzeitarchivierung gewährleistet |f PEBW |2 pdager |5 DE-24 | |
| 650 | 0 | 7 | |a Informationstheorie |0 (DE-588)4026927-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Nachrichtentechnik |0 (DE-588)4041066-3 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Informationstheorie |0 (DE-588)4026927-9 |D s |
| 689 | 0 | 1 | |a Nachrichtentechnik |0 (DE-588)4041066-3 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Ten Brink, Stephan |d 1970- |0 (DE-588)1089075715 |4 dgs | |
| 700 | 1 | |a Bauch, Gerhard |d 1970- |0 (DE-588)1153226812 |4 dgs | |
| 710 | 2 | |a Universität Stuttgart |0 (DE-588)36186-0 |4 dgg | |
| 710 | 2 | |a Universität Stuttgart |b Institut für Nachrichtenübertragung |0 (DE-588)1053778902 |4 isb | |
| 751 | |a Stuttgart |0 (DE-588)4058282-6 |2 gnd |4 uvp | ||
| 856 | 4 | 2 | |m Digitalisierung UB Passau - ADAM Catalogue Enrichment |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=034845635&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-034845635 | ||
Datensatz im Suchindex
| _version_ | 1804186306818867200 |
|---|---|
| adam_text | Contents xvii List of Acronyms Notations xix List of Figures xxi 1 List of Tables 1 Introduction 3 1.1 System Model....................................................................................................................... 5 1.2 Channel coding problem................................................................................................... 1.2.1 Problem Statement................................................................................................. 1.2.2 Existence of Solutions.............................................................................................. 6 6 7 1.2.3 Asymptotic- vs finite-length designparadigms ..................................................... What remains open to do................................................................................................... 1.3.1 Code Design.............................................................................................................. 1.3.2 Decoder development.............................................................................................. 1.4 Thesis Contribution............................................................................................................. 1.5 Thesis Organization............................................................................................................. 7 7 10 1.3 2 7 8 8 A Brief Review of ChannelCoding 13 2.1 Preliminaries and ImportantProperties............................................................................... 13 2.1.1 Abstract Mathematical
Definitions....................................................................... 2.1.2 Information Theory-related Definitions................................................................. 2.2 Problem description.............................................................................................................. 2.3 Binary Linear Block Channel Codes................................................................................. 2.4 Optimal Decoding and Its Feasibility................................................................................. 14 22 2.5 State-of-the-art Linear Block codes.................................................................................... 2.5.1 Polar codes............................................................................................................... 2.5.1.1 Channel Polarization ............................................................................... 23 23 24 Channel Combining 15 18 19 .................................................................. 24 2.5.1.1.2 Channel Splitting........................................................................ 2.5.1.2 Code Construction/Design....................................................................... 2.5.1.2.1 Problem Formulation.................................................................. 25 29 29 2.5.1.2.2 Design SNR . ............................................................................. Encoding..................................................................................................... 2.5.1.3.1 The encoding
procedure........................................................... 31 2.5.1.1.1 2.5.1.3 30 31 xiii
Contents The Encoding Complexity........................................................ 34 Polar Decoding ........................................................................................ 2.5.1.4.1 Problem formulation.................................................................. 2.5.1.4.2 Brief Background........................................................................ 2.5.1.4.3 Successive Cancellation (SC) Decoder..................................... 35 2.5.1.3.2 2.5.1.4 36 2.5.1.4.5 Successive Cancellation List (SCL) Decoder........................... 38 CRC-Aided Successive Cancellation List(CA-SCL) Decoder . 40 2.5.1.4.6 2.5.1.4.4 BP.............................................................................................. 41 2.5.2 Reed-Muller (RM) Codes......................................................................................... 43 2.5.2.1 2.5.2.2 RM Codewords .......................................................................... RM Decoding............................................................................................ 44 2.5.2.3 RM vs Polar Codes:How are they related?............................................. 45 2.5.3 Hybrid Polar-RM Codes............................................................................................ 2.5.4 LDPC codes............................................................................................................... 46 Code Construction..................................................................................... Finite-Length MismatchParadigm
......................................................... Decoding..................................................................................................... 48 48 2.5.4.1 2.5.4.2 2.5.4.3 44 47 48 Finite-length LDPC Code design 55 EXIT Charts for LDPC Codes...................... 3.2 Scattered EXIT Charts........................................................................................................ 56 Notation..................................................................................................................... Obtaining the S-EXIT chart for a specific code.................................................... 3.2.2.1 Acquiring Μ simulated EXIT trajectories.............................................. 60 60 3.2.2.2 3.2.2.3 S-EXIT charts as 2D-histograms............................................................... Check for optimization potential.............................................................. 61 62 3.2.2.4 3.2.2.5 S-EXIT chart guided degree distribution optimization ....................... Verifying the results................................................................................. 63 63 Properties of S-EXIT charts..................................................................................... 63 3.2.3.1 Effect of codeword length . ..................................................................... 63 3.2.3.2 BER region variations............................................................................... Dependent vs independent component decoders.................................... 64 3 3.1 3.2.1 3.2.2
3.2.3 3.2.3.3 59 60 63 3.3 Results and Discussions........................................................................................................ 3.3.1 Code A [N=180, BEC] ........................................................................................... 65 Code В [N=128, AWGNJ........................................................................................ 3.3.3 Code C [N=180, AWGN] ....................................................................................... 3.4 Summary............................................................................................................................... 66 68 68 Deep Learning-aided Construction 73 4.1 Motivation............................................................................................................................ 74 3.3.2 4 35 35 xiv 65
Contents 4.2 Background on Existent Construction Schemes................................................................. 74 4.3 Learning to Construct polar codes.................................................................................... 75 4.3.1 4.3.2 From “classical” to stochastic code constructions................................................. Loss function and training methodology................................................................. 76 76 4.3.3 Approaches for non-differentiable decoders.......................................................... 78 4.4 Results and Discussion........................................................................................................ 4.4.1 AWGN channel results ........................................................................................... 79 Rayleigh fading channel results.............................................................................. 4.5 Summary and Future Avenues ........................................................................................... 4.4.2 5 Permutation-Based Iterative Polar Decoding 79 79 81 85 5.1 Factor Graph Permutations................................................................................................. 5.2 Multi-Trellis Decoding: Sequential Permutation-Based BP Decoding............................. 86 87 5.2.1 Decoding Strategy..................................................................................................... 87 5.2.2 Error-Rate
Performance........................................................................................... 88 5.2.3 Complexity............................................................................................................... 5.3 Belief Propagation List (BPL) Decoding: Parallel Permutation-Based BP Decoding . . 91 92 5.3.1 Decoding Algorithm.................................................................................................. 93 5.3.2 Results and Discussion............................................................................................ 94 5.3.3 Factor Graph Permutations vs.Decoding Schedule Permutations.......................... 96 5.3.4 Additional benefit: RM-polarCodes .................................. Cyclic Redundancy Check BeliefPropagation List (CA-BPL) Decoding....................... 98 New BPL Decoding Perspective.............................................................................. 99 5.4 5.4.1 5.5 underBPL decoding 99 5.4.2 Error-Rate Performance............................................................................................. 100 Summary and Future Aspects................................................................................................ 101 6 Iterative-Polar Decoding On Sparse Graphs 105 6.1 Baseline parameters................................................................................................................ 106 6.1.1 Belief Propagation Decoding: Revisited................................................................ . 106 6.1.2 Types of log-likelihood ratio (LLR)
updates............................................................. 107 6.1.3 Naive Dense Parity-Check Matrix Hdense................................................................................ 107 6.2 Pruning techniques for polar factor graphs.......................................................................... 108 6.2.1 Special Nodes of BP Factor Graph.......................................................................... 109 6.2,1.1 Frozen nodes.................................................................................................109 6.2.1.4 Degree-1 check node (CN).......................................................................... 110 Degree-1 Channel variable nodes(VNCH) and degree-2 CN..................... 110 Degree-1 Hidden variable nodes(VNH)..................................................... 110 6.2.1.5 Degree-2 VNH.............................................................................................. Ill 6.2.1.2 6.2.1.3 6.2.1.6 Degree-2 CN................................................................................................. Ill 6.2.2 PruningAlgorithm..................................................................................................... Ill XV
Contents 6.3 Performance: Results and Complexity Analysis.................................................................... 113 6.4 Closing Performance Gap: Decoder-Tailored Design.......................................................... 115 6.4.1 Codelength N = 128..................................................................................................... 117 6.4.2 Codelength N = ............................................................................................................ 118 6.4.3 Codelength N = . .......................................................................................................... 118 6.5 Conclusion............................................................................................................................. 119 7 Polar Codes in Multiple Access Channels 123 Background............................................................................................................................. 124 IDMA....................................................................................................................................... 125 7.2.1 System Model.............................................................................................................. 126 7.2.2 FEC in MAC.............................................................................................................. 126 7.3 BP decoding of polar codes in MACsetup........................................................................... 127 7.4 System Setup and First
Results............................................................................................. 128 7.4.1 Proposed Setup........................................................................................................... 128 7.4.2 First Results andDiscussion ...................................................................................... 129 7.4.2.1 2-User GMAC.............................................................................................. 129 7.4.2.2 4-UserGMAC.............................................................................................. 130 7.5 Improvements on Initial Setup............................................................................................. 130 7.5.1 Internal memory effects of polar BP factor graph.................................................... 130 7.5.2 The Repetition Coding Dilemma..............................................................................132 7.6 Conclusion............................................................................................................................. 134 7.1 7.2 Bibliography xvi 141
|
| adam_txt |
Contents xvii List of Acronyms Notations xix List of Figures xxi 1 List of Tables 1 Introduction 3 1.1 System Model. 5 1.2 Channel coding problem. 1.2.1 Problem Statement. 1.2.2 Existence of Solutions. 6 6 7 1.2.3 Asymptotic- vs finite-length designparadigms . What remains open to do. 1.3.1 Code Design. 1.3.2 Decoder development. 1.4 Thesis Contribution. 1.5 Thesis Organization. 7 7 10 1.3 2 7 8 8 A Brief Review of ChannelCoding 13 2.1 Preliminaries and ImportantProperties. 13 2.1.1 Abstract Mathematical
Definitions. 2.1.2 Information Theory-related Definitions. 2.2 Problem description. 2.3 Binary Linear Block Channel Codes. 2.4 Optimal Decoding and Its Feasibility. 14 22 2.5 State-of-the-art Linear Block codes. 2.5.1 Polar codes. 2.5.1.1 Channel Polarization . 23 23 24 Channel Combining 15 18 19 . 24 2.5.1.1.2 Channel Splitting. 2.5.1.2 Code Construction/Design. 2.5.1.2.1 Problem Formulation. 25 29 29 2.5.1.2.2 Design SNR . . Encoding. 2.5.1.3.1 The encoding
procedure. 31 2.5.1.1.1 2.5.1.3 30 31 xiii
Contents The Encoding Complexity. 34 Polar Decoding . 2.5.1.4.1 Problem formulation. 2.5.1.4.2 Brief Background. 2.5.1.4.3 Successive Cancellation (SC) Decoder. 35 2.5.1.3.2 2.5.1.4 36 2.5.1.4.5 Successive Cancellation List (SCL) Decoder. 38 CRC-Aided Successive Cancellation List(CA-SCL) Decoder . 40 2.5.1.4.6 2.5.1.4.4 BP. 41 2.5.2 Reed-Muller (RM) Codes. 43 2.5.2.1 2.5.2.2 RM Codewords . RM Decoding. 44 2.5.2.3 RM vs Polar Codes:How are they related?. 45 2.5.3 Hybrid Polar-RM Codes. 2.5.4 LDPC codes. 46 Code Construction. Finite-Length MismatchParadigm
. Decoding. 48 48 2.5.4.1 2.5.4.2 2.5.4.3 44 47 48 Finite-length LDPC Code design 55 EXIT Charts for LDPC Codes. 3.2 Scattered EXIT Charts. 56 Notation. Obtaining the S-EXIT chart for a specific code. 3.2.2.1 Acquiring Μ simulated EXIT trajectories. 60 60 3.2.2.2 3.2.2.3 S-EXIT charts as 2D-histograms. Check for optimization potential. 61 62 3.2.2.4 3.2.2.5 S-EXIT chart guided degree distribution optimization . Verifying the results. 63 63 Properties of S-EXIT charts. 63 3.2.3.1 Effect of codeword length . . 63 3.2.3.2 BER region variations. Dependent vs independent component decoders. 64 3 3.1 3.2.1 3.2.2
3.2.3 3.2.3.3 59 60 63 3.3 Results and Discussions. 3.3.1 Code A [N=180, BEC] . 65 Code В [N=128, AWGNJ. 3.3.3 Code C [N=180, AWGN] . 3.4 Summary. 66 68 68 Deep Learning-aided Construction 73 4.1 Motivation. 74 3.3.2 4 35 35 xiv 65
Contents 4.2 Background on Existent Construction Schemes. 74 4.3 Learning to Construct polar codes. 75 4.3.1 4.3.2 From “classical” to stochastic code constructions. Loss function and training methodology. 76 76 4.3.3 Approaches for non-differentiable decoders. 78 4.4 Results and Discussion. 4.4.1 AWGN channel results . 79 Rayleigh fading channel results. 4.5 Summary and Future Avenues . 4.4.2 5 Permutation-Based Iterative Polar Decoding 79 79 81 85 5.1 Factor Graph Permutations. 5.2 Multi-Trellis Decoding: Sequential Permutation-Based BP Decoding. 86 87 5.2.1 Decoding Strategy. 87 5.2.2 Error-Rate
Performance. 88 5.2.3 Complexity. 5.3 Belief Propagation List (BPL) Decoding: Parallel Permutation-Based BP Decoding . . 91 92 5.3.1 Decoding Algorithm. 93 5.3.2 Results and Discussion. 94 5.3.3 Factor Graph Permutations vs.Decoding Schedule Permutations. 96 5.3.4 Additional benefit: RM-polarCodes . Cyclic Redundancy Check BeliefPropagation List (CA-BPL) Decoding. 98 New BPL Decoding Perspective. 99 5.4 5.4.1 5.5 underBPL decoding 99 5.4.2 Error-Rate Performance. 100 Summary and Future Aspects. 101 6 Iterative-Polar Decoding On Sparse Graphs 105 6.1 Baseline parameters. 106 6.1.1 Belief Propagation Decoding: Revisited. . 106 6.1.2 Types of log-likelihood ratio (LLR)
updates. 107 6.1.3 Naive Dense Parity-Check Matrix Hdense. 107 6.2 Pruning techniques for polar factor graphs. 108 6.2.1 Special Nodes of BP Factor Graph. 109 6.2,1.1 Frozen nodes.109 6.2.1.4 Degree-1 check node (CN). 110 Degree-1 Channel variable nodes(VNCH) and degree-2 CN. 110 Degree-1 Hidden variable nodes(VNH). 110 6.2.1.5 Degree-2 VNH. Ill 6.2.1.2 6.2.1.3 6.2.1.6 Degree-2 CN. Ill 6.2.2 PruningAlgorithm. Ill XV
Contents 6.3 Performance: Results and Complexity Analysis. 113 6.4 Closing Performance Gap: Decoder-Tailored Design. 115 6.4.1 Codelength N = 128. 117 6.4.2 Codelength N = . 118 6.4.3 Codelength N = . . 118 6.5 Conclusion. 119 7 Polar Codes in Multiple Access Channels 123 Background. 124 IDMA. 125 7.2.1 System Model. 126 7.2.2 FEC in MAC. 126 7.3 BP decoding of polar codes in MACsetup. 127 7.4 System Setup and First
Results. 128 7.4.1 Proposed Setup. 128 7.4.2 First Results andDiscussion . 129 7.4.2.1 2-User GMAC. 129 7.4.2.2 4-UserGMAC. 130 7.5 Improvements on Initial Setup. 130 7.5.1 Internal memory effects of polar BP factor graph. 130 7.5.2 The Repetition Coding Dilemma.132 7.6 Conclusion. 134 7.1 7.2 Bibliography xvi 141 |
| any_adam_object | 1 |
| any_adam_object_boolean | 1 |
| author | Ebada, Moustafa |
| author_GND | (DE-588)1293410632 (DE-588)1089075715 (DE-588)1153226812 |
| author_facet | Ebada, Moustafa |
| author_role | aut |
| author_sort | Ebada, Moustafa |
| author_variant | m e me |
| building | Verbundindex |
| bvnumber | BV049500487 |
| classification_rvk | ZN 6015 |
| ctrlnum | (OCoLC)1408829195 (DE-599)KXP1850734925 |
| discipline | Elektrotechnik / Elektronik / Nachrichtentechnik |
| discipline_str_mv | Elektrotechnik / Elektronik / Nachrichtentechnik |
| format | Thesis Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02194nam a2200457 c 4500</leader><controlfield tag="001">BV049500487</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20240118 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">240115s2023 gw a||| m||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1408829195</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)KXP1850734925</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</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">XA-DE-BW</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-739</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ZN 6015</subfield><subfield code="0">(DE-625)157492:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">53.73</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Ebada, Moustafa</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1293410632</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">On the finite-length modern forward error correction codes</subfield><subfield code="b">design and iterative decoding</subfield><subfield code="c">vorgelegt von Moustafa Mohamed Nabil Elsayed Mohamed Ebada ; Hauptberichter: Prof. Dr.-Ing. Stephan ten Brink ; Mitberichter: Prof. Dr.-Ing. Gerhard Bauch</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Stuttgart</subfield><subfield code="c">2023</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">xxiv, 150 Seiten</subfield><subfield code="b">Illustrationen, Diagramme</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="502" ind1=" " ind2=" "><subfield code="b">Dissertation</subfield><subfield code="c">Universität Stuttgart</subfield><subfield code="d">2023</subfield></datafield><datafield tag="583" ind1="1" ind2=" "><subfield code="a">Archivierung/Langzeitarchivierung gewährleistet</subfield><subfield code="c">Stuttgart</subfield><subfield code="f">DISS</subfield><subfield code="2">pdager</subfield><subfield code="5">DE-93</subfield></datafield><datafield tag="583" ind1="1" ind2=" "><subfield code="a">Archivierung/Langzeitarchivierung gewährleistet</subfield><subfield code="f">PEBW</subfield><subfield code="2">pdager</subfield><subfield code="5">DE-24</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Informationstheorie</subfield><subfield code="0">(DE-588)4026927-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Nachrichtentechnik</subfield><subfield code="0">(DE-588)4041066-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">Informationstheorie</subfield><subfield code="0">(DE-588)4026927-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Nachrichtentechnik</subfield><subfield code="0">(DE-588)4041066-3</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">Ten Brink, Stephan</subfield><subfield code="d">1970-</subfield><subfield code="0">(DE-588)1089075715</subfield><subfield code="4">dgs</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Bauch, Gerhard</subfield><subfield code="d">1970-</subfield><subfield code="0">(DE-588)1153226812</subfield><subfield code="4">dgs</subfield></datafield><datafield tag="710" ind1="2" ind2=" "><subfield code="a">Universität Stuttgart</subfield><subfield code="0">(DE-588)36186-0</subfield><subfield code="4">dgg</subfield></datafield><datafield tag="710" ind1="2" ind2=" "><subfield code="a">Universität Stuttgart</subfield><subfield code="b">Institut für Nachrichtenübertragung</subfield><subfield code="0">(DE-588)1053778902</subfield><subfield code="4">isb</subfield></datafield><datafield tag="751" ind1=" " ind2=" "><subfield code="a">Stuttgart</subfield><subfield code="0">(DE-588)4058282-6</subfield><subfield code="2">gnd</subfield><subfield code="4">uvp</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Digitalisierung UB Passau - ADAM Catalogue Enrichment</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=034845635&sequence=000001&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-034845635</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV049500487 |
| illustrated | Illustrated |
| index_date | 2024-07-03T23:21:16Z |
| indexdate | 2024-07-10T10:09:02Z |
| institution | BVB |
| institution_GND | (DE-588)36186-0 (DE-588)1053778902 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-034845635 |
| oclc_num | 1408829195 |
| open_access_boolean | |
| owner | DE-739 |
| owner_facet | DE-739 |
| physical | xxiv, 150 Seiten Illustrationen, Diagramme |
| publishDate | 2023 |
| publishDateSearch | 2023 |
| publishDateSort | 2023 |
| record_format | marc |
| spelling | Ebada, Moustafa Verfasser (DE-588)1293410632 aut On the finite-length modern forward error correction codes design and iterative decoding vorgelegt von Moustafa Mohamed Nabil Elsayed Mohamed Ebada ; Hauptberichter: Prof. Dr.-Ing. Stephan ten Brink ; Mitberichter: Prof. Dr.-Ing. Gerhard Bauch Stuttgart 2023 xxiv, 150 Seiten Illustrationen, Diagramme txt rdacontent n rdamedia nc rdacarrier Dissertation Universität Stuttgart 2023 Archivierung/Langzeitarchivierung gewährleistet Stuttgart DISS pdager DE-93 Archivierung/Langzeitarchivierung gewährleistet PEBW pdager DE-24 Informationstheorie (DE-588)4026927-9 gnd rswk-swf Nachrichtentechnik (DE-588)4041066-3 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Informationstheorie (DE-588)4026927-9 s Nachrichtentechnik (DE-588)4041066-3 s DE-604 Ten Brink, Stephan 1970- (DE-588)1089075715 dgs Bauch, Gerhard 1970- (DE-588)1153226812 dgs Universität Stuttgart (DE-588)36186-0 dgg Universität Stuttgart Institut für Nachrichtenübertragung (DE-588)1053778902 isb Stuttgart (DE-588)4058282-6 gnd uvp Digitalisierung UB Passau - ADAM Catalogue Enrichment application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=034845635&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Ebada, Moustafa On the finite-length modern forward error correction codes design and iterative decoding Informationstheorie (DE-588)4026927-9 gnd Nachrichtentechnik (DE-588)4041066-3 gnd |
| subject_GND | (DE-588)4026927-9 (DE-588)4041066-3 (DE-588)4113937-9 |
| title | On the finite-length modern forward error correction codes design and iterative decoding |
| title_auth | On the finite-length modern forward error correction codes design and iterative decoding |
| title_exact_search | On the finite-length modern forward error correction codes design and iterative decoding |
| title_exact_search_txtP | On the finite-length modern forward error correction codes design and iterative decoding |
| title_full | On the finite-length modern forward error correction codes design and iterative decoding vorgelegt von Moustafa Mohamed Nabil Elsayed Mohamed Ebada ; Hauptberichter: Prof. Dr.-Ing. Stephan ten Brink ; Mitberichter: Prof. Dr.-Ing. Gerhard Bauch |
| title_fullStr | On the finite-length modern forward error correction codes design and iterative decoding vorgelegt von Moustafa Mohamed Nabil Elsayed Mohamed Ebada ; Hauptberichter: Prof. Dr.-Ing. Stephan ten Brink ; Mitberichter: Prof. Dr.-Ing. Gerhard Bauch |
| title_full_unstemmed | On the finite-length modern forward error correction codes design and iterative decoding vorgelegt von Moustafa Mohamed Nabil Elsayed Mohamed Ebada ; Hauptberichter: Prof. Dr.-Ing. Stephan ten Brink ; Mitberichter: Prof. Dr.-Ing. Gerhard Bauch |
| title_short | On the finite-length modern forward error correction codes |
| title_sort | on the finite length modern forward error correction codes design and iterative decoding |
| title_sub | design and iterative decoding |
| topic | Informationstheorie (DE-588)4026927-9 gnd Nachrichtentechnik (DE-588)4041066-3 gnd |
| topic_facet | Informationstheorie Nachrichtentechnik Hochschulschrift |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=034845635&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT ebadamoustafa onthefinitelengthmodernforwarderrorcorrectioncodesdesignanditerativedecoding AT tenbrinkstephan onthefinitelengthmodernforwarderrorcorrectioncodesdesignanditerativedecoding AT bauchgerhard onthefinitelengthmodernforwarderrorcorrectioncodesdesignanditerativedecoding AT universitatstuttgart onthefinitelengthmodernforwarderrorcorrectioncodesdesignanditerativedecoding AT universitatstuttgartinstitutfurnachrichtenubertragung onthefinitelengthmodernforwarderrorcorrectioncodesdesignanditerativedecoding |