{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":1,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":38,"n_cols":5,"rows_kept":38,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[2,4,2,5],[3,2,3,3],[7,2,7,3],[17,2,17,3],[18,2,18,3],[19,2,19,3],[21,2,21,3],[25,2,25,3],[26,2,26,3],[30,2,30,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9911019706103321"]
[null,null,"Autore",null,"Schlegel Christian"]
[null,null,"Titolo",null,"Trellis and turbo coding / / Christian B. Schlegel, Lance C. Pérez"]
[null,null,"Pubbl/distr/stampa",null,"Piscataway, NJ, : IEEE Press"]
[{"$nulls":4},"Hoboken, NJ, : Wiley-Interscience, c2004"]
[{"$nulls":4},"Piscataway, New Jersey : , : IEEE Press, , 2004"]
[{"$nulls":4},"[Piscataqay, New Jersey] : , : IEEE Xplore, , [2004]"]
[null,null,"ISBN",null,"9786610346004"]
[{"$nulls":4},"9781280346002"]
[{"$nulls":4},"1280346000"]
[{"$nulls":4},"9780471667834"]
[{"$nulls":4},"0471667838"]
[{"$nulls":4},"9781601193858"]
[{"$nulls":4},"1601193858"]
[{"$nulls":4},"9780471667841"]
[{"$nulls":4},"0471667846"]
[{"$nulls":4},"9781118083161"]
[null,null,"Descrizione fisica",null,"1 online resource (402 p.)"]
[null,null,"Collana",null,"IEEE Press series on digital & mobile communication"]
[null,null,"Disciplina",null,"621.382"]
[{"$nulls":4},"621.3822"]
[null,null,"Soggetti",null,"Error-correcting codes (Information theory)"]
[{"$nulls":4},"Trellis-coded modulation"]
[{"$nulls":4},"Digital communications"]
[{"$nulls":4},"Coding theory"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","Description based upon print version of record."]
[null,null,null,"Nota di bibliografia","Includes bibliographical references and index."]
[null,null,"Nota di contenuto",null,"TRELLIS AND TURBO CODING; CONTENTS; Preface; 1 Introduction; 1.1 Modern Digital Communications; 1.2 The Rise of Digital Communications; 1.3 Communication Systems; 1.4 Error Control Coding; 1.5 Bandwidth, Power, and Complexity; 1.6 A Brief History-The Drive Toward Capacity; Bibliography; 2 Communication Theory Basics; 2.1 The Probabilistic Viewpoint; 2.2 Vector Communication Channels; 2.3 Optimum Receivers; 2.4 Matched Filters; 2.5 Message Sequences; 2.6 The Complex Equivalent Baseband Model; 2.7 Spectral Behavior; 2.8 Multiple Antenna Channels (MIMO Channels); Appendix 2.A; "]
[{"$nulls":4},"Bibliography"]
[{"$nulls":4},"3 Trellis-Coded Modulation3.1 An Introductory Example; 3.2 Group-Trellis Codes; 3.3 The Mapping Function; 3.4 Construction of Codes; 3.5 Lattices; 3.6 Lattice Formulation of Trellis Codes; 3.7 Rotational Invariance; 3.8 V.fast; 3.9 Geometric Uniformity; 3.10 Historical Notes; Bibliography; 4 Convolutional Codes; 4.1 Convolutional Codes as Binary Trellis Codes; 4.2 Codes and Encoders; 4.3 Fundamental Theorems from Basic Algebra; 4.4 Systematic Encoders; 4.5 Systematic Feedback and Recursive Systematic Encoder Realizations; 4.6 Maximum Free-Distance Convolutional Codes; Appendix 4.A"]
[{"$nulls":4},"Bibliography5 Link to Block Codes; 5.1 Preliminaries; 5.2 Block Code Primer; 5.3 Trellis Description of Block Codes; 5.4 Minimal Trellises; 5.5 Minimum-Span Generator Matrices; 5.6 Construction of the PC Trellis; 5.7 Tail-Biting Trellises; 5.8 The Squaring Construction and the Trellis of Lattices; 5.9 The Construction of Reed-Muller Codes; 5.10 A Decoding Example; Bibliography; 6 Performance Bounds; 6.1 Error Analysis; 6.2 The Error Event Probability; 6.3 Finite-State Machine Description of Error Events; 6.4 The Transfer Function Bound; 6.5 Reduction Theorems; 6.6 Random Coding Bounds"]
[{"$nulls":4},"Appendix 6.AAppendix 6.B; Bibliography; 7 Decoding Strategies; 7.1 Background and Introduction; 7.2 Tree Decoders; 7.3 The Stack Algorithm; 7.4 The Fano Algorithm; 7.5 The M-Algorithm; 7.6 Maximum Likelihood Decoding; 7.7 A Posteriori Probability Symbol Decoding; 7.8 Log-APP and Approximations; 7.9 Random Coding Analysis of Sequential Decoding; 7.10 Some Final Remarks; Appendix 7.A; Bibliography; 8 Factor Graphs; 8.1 Factor Graphs: Introduction and History; 8.2 Graphical Function Representation; 8.3 The Sum-Product Algorithm; 8.4 Iterative Probability Propagation"]
[{"$nulls":4},"8.5 The Factor Graph of Trellises8.6 Exactness of the Sum-Product Algorithm for Trees; 8.7 Binary Factor Graphs; Variable Node Messages; Parity-Check Node Messages; Log Likelihood Ratio (LLR); LLR Variable Node Messages; LLR Check Node Messages; 8.8 Normal Factor Graphs; Symbol Variable Replication; State Variable Replication; Bibliography; 9 Low-Density Parity-Check Codes; 9.1 Introduction; 9.2 LDPC Codes and Graphs; 9.3 Message Passing Decoding Algorithms; 9.4 Density Evolution; 9.5 Density Evolution for Binary Erasure Channels; 9.6 Binary Symmetric Channels and the Gallager Algorithms"]
[{"$nulls":4},"9.7 The AWGN Channel"]
[null,null,null,"Sommario/riassunto","Trellis and turbo coding are used to compress and clean communications signals to allow greater bandwidth and clarityPresents the basics, theory, and applications of these techniques with a focus on potential standard state-of-the art methods in the futureProvides a classic basis for anyone who works in the area of digital communications A Wiley-IEEE Press Publication"]