Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Trellis and turbo coding : iterative and graph-based error control coding / / Christian B. Schlegel, Lance C. Pérez
| Trellis and turbo coding : iterative and graph-based error control coding / / Christian B. Schlegel, Lance C. Pérez |
| Autore | Schlegel Christian B. |
| Edizione | [2nd ed.] |
| Pubbl/distr/stampa | Piscataway, NJ : , : IEEE Press |
| Descrizione fisica | 1 online resource (521 p.) |
| Disciplina | 621.382/1 |
| Collana | IEEE series on digital & mobile communication |
| Soggetto topico |
Error-correcting codes (Information theory)
Trellis-coded modulation Digital communications Coding theory |
| ISBN |
1-119-10632-X
1-119-10631-1 1-119-10633-8 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
TRELLIS AND TURBO CODING; Contents; 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 Towards Capacity; 2 Communications 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 Advanced Modulation Methods; 2.8.1 OFDM; 2.8.2 Multiple Antenna Channels (MIMO Channels)
2.9 A Communications System Case Study2.10 Appendix 2.A; 3 Trellis-Coded Modulation; 3.1 An Introductory Example; 3.2 Construction of Codes; 3.3 Lattices; 3.4 Lattice Formulation of Trellis Codes; 3.5 Rotational Invariance; 3.6 V.fast; 3.7 The IEEE 802.3an Standard; 3.8 Historical Notes; 4 Trellis Representations; 4.1 Preliminaries; 4.2 The Parity-Check Matrix; 4.3 Parity-Check Trellis Representations; 4.4 Convolutional Codes and Their Trellis; 4.5 Minimal Trellises; 4.6 Minimum-Span Generator Matrices; 4.7 Systematic Construction of the PC-Trellis; 4.8 Tail-Biting Trellises 4.9 The Minimal Trellis of Convolutional Codes4.10 Fundamental Theorems from Basic Algebra; 4.11 Systematic Encoders; 4.12 Maximum Free-Distance Convolutional Codes; 4.13 The Squaring Construction and the Trellis of Lattices; 4.14 The Construction of Reed-Muller Codes; 4.15 A Decoding Example; 4.16 Polar Codes and Their Relationship to RM Codes; Appendix 4.A; 5 Trellis and Tree Decoding; 5.1 Background and Introduction; 5.2 Tree Decoders; 5.3 The Stack Algorithm; 5.4 The Fano Algorithm; 5.5 The M-Algorithm; 5.6 Maximum Likelihood Decoding; 5.7 A Posteriori Probability Symbol Decoding 5.8 Log-APP and Approximations5.9 Error Analysis and Distance Spectrum; 5.10 Random Coding Analysis of Optimal Decoding; 5.11 Random Coding Analysis of Sequential Decoding; 5.12 Some Final Remarks; 6 Low-Density Parity-Check Codes; 6.1 Introduction; 6.2 LDPC Codes and Graphs; 6.3 LDPC Decoding via Message Passing; 6.4 Analysis Techniques; 6.4.1 (Error) Probability Evolution for Binary Erasure Channels; 6.4.2 Error Mechanism of LDPCs on BECs; 6.4.3 Binary Symmetric Channels and the Gallager Algorithms; 6.4.4 The AWGN Channel; 6.5 Code Families and Construction 6.5.1 Constructions with Permutation Matrices6.5.2 Cycle Reduction Design; 6.5.3 RS-based Construction; 6.5.4 Repeat-Accumulate Codes; 6.6 Encoding of LDPC Codes; 6.6.1 Triangular LDPC Codes; 6.6.2 Specialized LDPC Codes; 6.6.3 Approximate Triangularization; Appendix 6.A; 7 Error Floors; 7.1 The Error Floor Problem; 7.2 Dynamics of the Absorption Sets; 7.3 Code Design for Low Error Floors; 7.4 Impact of the Decoding Algorithm; 7.5 Importance Sampling (IS); 7.6 Computing Error Rates via Importance Sampling; 8 Turbo Coding: Basic Principles; 8.1 Introduction 8.2 Parallel Concatenated Convolutional Codes |
| Record Nr. | UNINA-9910131608603321 |
Schlegel Christian B.
|
||
| Piscataway, NJ : , : IEEE Press | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Trellis and turbo coding : iterative and graph-based error control coding / / Christian B. Schlegel, Lance C. Pérez
| Trellis and turbo coding : iterative and graph-based error control coding / / Christian B. Schlegel, Lance C. Pérez |
| Autore | Schlegel Christian B. |
| Edizione | [2nd ed.] |
| Pubbl/distr/stampa | Piscataway, NJ : , : IEEE Press |
| Descrizione fisica | 1 online resource (521 p.) |
| Disciplina | 621.382/1 |
| Collana | IEEE series on digital & mobile communication |
| Soggetto topico |
Error-correcting codes (Information theory)
Trellis-coded modulation Digital communications Coding theory |
| ISBN |
1-119-10632-X
1-119-10631-1 1-119-10633-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
TRELLIS AND TURBO CODING; Contents; 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 Towards Capacity; 2 Communications 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 Advanced Modulation Methods; 2.8.1 OFDM; 2.8.2 Multiple Antenna Channels (MIMO Channels)
2.9 A Communications System Case Study2.10 Appendix 2.A; 3 Trellis-Coded Modulation; 3.1 An Introductory Example; 3.2 Construction of Codes; 3.3 Lattices; 3.4 Lattice Formulation of Trellis Codes; 3.5 Rotational Invariance; 3.6 V.fast; 3.7 The IEEE 802.3an Standard; 3.8 Historical Notes; 4 Trellis Representations; 4.1 Preliminaries; 4.2 The Parity-Check Matrix; 4.3 Parity-Check Trellis Representations; 4.4 Convolutional Codes and Their Trellis; 4.5 Minimal Trellises; 4.6 Minimum-Span Generator Matrices; 4.7 Systematic Construction of the PC-Trellis; 4.8 Tail-Biting Trellises 4.9 The Minimal Trellis of Convolutional Codes4.10 Fundamental Theorems from Basic Algebra; 4.11 Systematic Encoders; 4.12 Maximum Free-Distance Convolutional Codes; 4.13 The Squaring Construction and the Trellis of Lattices; 4.14 The Construction of Reed-Muller Codes; 4.15 A Decoding Example; 4.16 Polar Codes and Their Relationship to RM Codes; Appendix 4.A; 5 Trellis and Tree Decoding; 5.1 Background and Introduction; 5.2 Tree Decoders; 5.3 The Stack Algorithm; 5.4 The Fano Algorithm; 5.5 The M-Algorithm; 5.6 Maximum Likelihood Decoding; 5.7 A Posteriori Probability Symbol Decoding 5.8 Log-APP and Approximations5.9 Error Analysis and Distance Spectrum; 5.10 Random Coding Analysis of Optimal Decoding; 5.11 Random Coding Analysis of Sequential Decoding; 5.12 Some Final Remarks; 6 Low-Density Parity-Check Codes; 6.1 Introduction; 6.2 LDPC Codes and Graphs; 6.3 LDPC Decoding via Message Passing; 6.4 Analysis Techniques; 6.4.1 (Error) Probability Evolution for Binary Erasure Channels; 6.4.2 Error Mechanism of LDPCs on BECs; 6.4.3 Binary Symmetric Channels and the Gallager Algorithms; 6.4.4 The AWGN Channel; 6.5 Code Families and Construction 6.5.1 Constructions with Permutation Matrices6.5.2 Cycle Reduction Design; 6.5.3 RS-based Construction; 6.5.4 Repeat-Accumulate Codes; 6.6 Encoding of LDPC Codes; 6.6.1 Triangular LDPC Codes; 6.6.2 Specialized LDPC Codes; 6.6.3 Approximate Triangularization; Appendix 6.A; 7 Error Floors; 7.1 The Error Floor Problem; 7.2 Dynamics of the Absorption Sets; 7.3 Code Design for Low Error Floors; 7.4 Impact of the Decoding Algorithm; 7.5 Importance Sampling (IS); 7.6 Computing Error Rates via Importance Sampling; 8 Turbo Coding: Basic Principles; 8.1 Introduction 8.2 Parallel Concatenated Convolutional Codes |
| Record Nr. | UNINA-9910830397403321 |
|
Schlegel Christian B.
|
||
| Piscataway, NJ : , : IEEE Press | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Trellis and turbo coding [[electronic resource] /] / Christian B. Schlegel, Lance C. Pérez
| Trellis and turbo coding [[electronic resource] /] / Christian B. Schlegel, Lance C. Pérez |
| Autore | Schlegel Christian |
| Pubbl/distr/stampa | Piscataway, NJ, : IEEE Press |
| Descrizione fisica | 1 online resource (402 p.) |
| Disciplina |
621.382
621.3822 |
| Altri autori (Persone) | PerezLance |
| Collana | IEEE Press series on digital & mobile communication |
| Soggetto topico |
Error-correcting codes (Information theory)
Trellis-coded modulation Digital communications Coding theory |
| ISBN |
1-280-34600-0
9786610346004 0-471-66783-8 1-60119-385-8 0-471-66784-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
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; Bibliography
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 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 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 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 9.7 The AWGN Channel |
| Record Nr. | UNINA-9910145767803321 |
|
Schlegel Christian
|
||
| Piscataway, NJ, : IEEE Press | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Trellis and turbo coding [[electronic resource] /] / Christian B. Schlegel, Lance C. Pérez
| Trellis and turbo coding [[electronic resource] /] / Christian B. Schlegel, Lance C. Pérez |
| Autore | Schlegel Christian |
| Pubbl/distr/stampa | Piscataway, NJ, : IEEE Press |
| Descrizione fisica | 1 online resource (402 p.) |
| Disciplina |
621.382
621.3822 |
| Altri autori (Persone) | PerezLance |
| Collana | IEEE Press series on digital & mobile communication |
| Soggetto topico |
Error-correcting codes (Information theory)
Trellis-coded modulation Digital communications Coding theory |
| ISBN |
1-280-34600-0
9786610346004 0-471-66783-8 1-60119-385-8 0-471-66784-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
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; Bibliography
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 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 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 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 9.7 The AWGN Channel |
| Record Nr. | UNINA-9910830666403321 |
|
Schlegel Christian
|
||
| Piscataway, NJ, : IEEE Press | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Trellis and turbo coding [[electronic resource] /] / Christian B. Schlegel, Lance C. Pérez
| Trellis and turbo coding [[electronic resource] /] / Christian B. Schlegel, Lance C. Pérez |
| Autore | Schlegel Christian |
| Pubbl/distr/stampa | Piscataway, NJ, : IEEE Press |
| Descrizione fisica | 1 online resource (402 p.) |
| Disciplina |
621.382
621.3822 |
| Altri autori (Persone) | PerezLance |
| Collana | IEEE Press series on digital & mobile communication |
| Soggetto topico |
Error-correcting codes (Information theory)
Trellis-coded modulation Digital communications Coding theory |
| ISBN |
1-280-34600-0
9786610346004 0-471-66783-8 1-60119-385-8 0-471-66784-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
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; Bibliography
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 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 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 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 9.7 The AWGN Channel |
| Record Nr. | UNINA-9910877326203321 |
|
Schlegel Christian
|
||
| Piscataway, NJ, : IEEE Press | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
