Trellises and Trellis-Based Decoding Algorithms for Linear Block Codes: The Springer International Series in Engineering and Computer Science, cartea 443
Autor Shu Lin, Tadao Kasami, Toru Fujiwara, Marc Fossorieren Limba Engleză Hardback – 30 apr 1998
Trellises and Trellis-based Decoding Algorithms for Linear Block Codes combines trellises and trellis-based decoding algorithms for linear codes together in a simple and unified form. The approach is to explain the material in an easily understood manner with minimal mathematical rigor.
Trellises and Trellis-based Decoding Algorithms for Linear Block Codes is intended for practicing communication engineers who want to have a fast grasp and understanding of the subject. Only material considered essential and useful for practical applications is included. This book can also be used as a text for advanced courses on the subject.
Toate formatele și edițiile | Preț | Express |
---|---|---|
Paperback (1) | 909.02 lei 6-8 săpt. | |
Springer Us – 11 oct 2012 | 909.02 lei 6-8 săpt. | |
Hardback (1) | 915.23 lei 6-8 săpt. | |
Springer Us – 30 apr 1998 | 915.23 lei 6-8 săpt. |
Din seria The Springer International Series in Engineering and Computer Science
- Preț: 119.98 lei
- 24% Preț: 1041.97 lei
- 20% Preț: 422.81 lei
- Preț: 206.36 lei
- 20% Preț: 313.26 lei
- 20% Preț: 619.15 lei
- 23% Preț: 637.96 lei
- 18% Preț: 1179.13 lei
- 18% Preț: 928.46 lei
- 20% Preț: 621.67 lei
- 18% Preț: 912.83 lei
- 20% Preț: 622.17 lei
- 15% Preț: 613.36 lei
- 20% Preț: 619.48 lei
- 18% Preț: 913.26 lei
- 20% Preț: 620.11 lei
- 20% Preț: 957.20 lei
- 20% Preț: 621.54 lei
- 18% Preț: 911.00 lei
- 20% Preț: 957.83 lei
- 18% Preț: 920.72 lei
- 20% Preț: 620.59 lei
- 15% Preț: 624.98 lei
- 18% Preț: 914.20 lei
- 18% Preț: 1175.06 lei
- 18% Preț: 921.32 lei
- 15% Preț: 619.63 lei
- 18% Preț: 912.52 lei
- 18% Preț: 911.45 lei
- 20% Preț: 1235.91 lei
Preț: 915.23 lei
Preț vechi: 1116.14 lei
-18% Nou
Puncte Express: 1373
Preț estimativ în valută:
175.16€ • 184.79$ • 145.97£
175.16€ • 184.79$ • 145.97£
Carte tipărită la comandă
Livrare economică 02-16 ianuarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9780792381518
ISBN-10: 0792381513
Pagini: 288
Ilustrații: XI, 288 p.
Dimensiuni: 155 x 235 x 22 mm
Greutate: 0.61 kg
Ediția:1998
Editura: Springer Us
Colecția Springer
Seria The Springer International Series in Engineering and Computer Science
Locul publicării:New York, NY, United States
ISBN-10: 0792381513
Pagini: 288
Ilustrații: XI, 288 p.
Dimensiuni: 155 x 235 x 22 mm
Greutate: 0.61 kg
Ediția:1998
Editura: Springer Us
Colecția Springer
Seria The Springer International Series in Engineering and Computer Science
Locul publicării:New York, NY, United States
Public țintă
ResearchCuprins
1. Introduction.- 1.1 Trellis Representation of Codes.- 1.2 Organization of the Book.- 2. Linear Block Codes.- 2.1 Generation of Linear Block Codes.- 2.2 Coset Partition of a Linear Block Code.- 2.3 The minimum Distance and Weight Distribution of A Linear Block Code.- 2.4 Decoding.- 2.5 Reed-Muller Codes.- 3. Trellis Representation of Linear Block Codes.- 3.1 Trellis Representation of Codes.- 3.2 Bit-Level Trellises for Binary Linear Block Codes.- 3.3 Trellis Oriented Generator Matrix.- 3.4 State Space Formulation.- 3.5 State Transition and Output.- 3.6 Time-Varying structure.- 3.7 Structural Properties.- 4. State Labeling, Trellis Construction Procedures and Trellis Symmetry.- 4.1 State Labeling by the State Defining Information Set.- 4.2 State Labeling by Parity-check Matrix.- 4.3 Structural Symmetry.- 5. Trellis Complexity.- 5.1 State Complexity.- 5.2 Minimal Trellises.- 5.3 Branch Complexity.- 5.4 Trellis Structure of Cyclic Codes.- 5.5 Trellises for Nonbinary Linear Block Codes.- 6. Trellis Sectionalization.- 6.1 Sectionalization of a Code Trellis.- 6.2 Branch Complexity and State Connectivity.- 6.3 A Procedure for Constructing a Minimal L-Section Trellis.- 6.4 Parallel Structure.- 7. Parallel Decomposition and Low-weight Subtrellises.- 7.1 Parallel Decomposition of a Trellis Diagram.- 7.2 Low-Weight Subtrellis Diagrams.- 7.3 Structure Analysis and Construction of Low-Weight Subtrellises.- 8. Methods for Constructing Codes and Trellis.- 8.1 Squaring Construction of Codes.- 8.2 Trellises for Codes by Squaring Construction.- 8.3 Shannon and Cartesian Products.- 8.4 Multilevel Concatenated Codes and Their Trellis Construction.- 9. Trellises for Convolutional Codes and their Related Linear Block Codes.- 9.1 Description of Convolutional Codes.- 9.2 Trellis Structure forConvolutional Codes.- 9.3 Punctured Convolutional Codes.- 9.4 Termination of Convolutional Codes.- 9.5 RM Codes Viewed as Terminated Convolutional Codes.- 10. The Viterbi and Differential Trellis Decoding Algorithms.- 10.1 The Viterbi Decoding Algorithm.- 10.2 Optimum Sectionalization of a Code Trellis: Lafourcade-Vardy Algorithm.- 10.3 Some Design Issues for IC Implementation of Viterbi Decoders for Linear Block Codes.- 10.4 Differential Trellis Decoding.- 11. A Recursive Maximum Likelihood Decoding.- 11.1 Basic Concepts.- 11.2 The General Algorithm.- 11.3 Direct Methods for Constructing Composite Branch Metric Tables.- 11.4 The CombCBT Procedure.- 11.5 CombCBT-V(x, y; z) Procedure.- 11.6 RMLD-(I,V) and RMLD-(G,V) Algorithms.- 11.7 CombCBT-U(x, y; z) Procedure.- 11.8 RMLD-(G,U) Algorithm.- 11.9 Comparisons.- 12. An Iterative Decoding Algorithm for Linear Block Codes Based on a Low-weight Trellis Search.- 12.1 General Concepts.- 12.2 Optimality Conditions.- 12.3 Generation of Candidate Codewords and Test Error Patterns.- 12.4 An Iterative Decoding Algorithm.- 12.5 Computational Complexity.- 12.6 Error Performance.- 12.7 Shortcomings.- 13. The Map and Related Decoding Algorithms.- 13.1 The MAP Decoding Algorithm.- 13.2 The SOVA Decoding Algorithm.- 13.3 Bit Error Probability of MLD.- A-A Trellis Construction Procedure.- A.1 A Brief Review of the Trellis Oriented Generator Matrix for a Binary Linear Block Code.- A.2 State Labeling by the State Defining Information Set and Composite Branch Label.- A.3 Trellis Construction.- A.4 An Efficient Trellis Construction Procedure.- References.