Source and Channel Coding: An Algorithmic Approach: The Springer International Series in Engineering and Computer Science, cartea 150
Autor John B. Anderson, Seshadri Mohanen Limba Engleză Hardback – 30 sep 1991
Toate formatele și edițiile | Preț | Express |
---|---|---|
Paperback (1) | 951.77 lei 6-8 săpt. | |
Springer Us – 30 sep 2012 | 951.77 lei 6-8 săpt. | |
Hardback (1) | 958.07 lei 6-8 săpt. | |
Springer Us – 30 sep 1991 | 958.07 lei 6-8 săpt. |
Din seria The Springer International Series in Engineering and Computer Science
- 24% Preț: 1041.97 lei
- 20% Preț: 643.50 lei
- 18% Preț: 1225.62 lei
- 18% Preț: 965.02 lei
- 20% Preț: 646.12 lei
- 18% Preț: 948.79 lei
- 20% Preț: 646.62 lei
- 15% Preț: 637.46 lei
- 20% Preț: 643.83 lei
- 18% Preț: 949.23 lei
- 20% Preț: 644.48 lei
- 20% Preț: 994.92 lei
- 20% Preț: 645.97 lei
- 18% Preț: 946.87 lei
- 20% Preț: 995.57 lei
- 18% Preț: 956.99 lei
- 20% Preț: 644.98 lei
- 15% Preț: 649.54 lei
- 18% Preț: 950.21 lei
- 18% Preț: 1221.38 lei
- 18% Preț: 957.62 lei
- 15% Preț: 643.99 lei
- 18% Preț: 948.47 lei
- 18% Preț: 947.35 lei
- 20% Preț: 1284.65 lei
- 20% Preț: 1633.95 lei
- 20% Preț: 1285.78 lei
Preț: 958.07 lei
Preț vechi: 1168.38 lei
-18% Nou
Puncte Express: 1437
Preț estimativ în valută:
183.37€ • 190.72$ • 153.67£
183.37€ • 190.72$ • 153.67£
Carte tipărită la comandă
Livrare economică 13-27 martie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9780792392101
ISBN-10: 0792392108
Pagini: 433
Ilustrații: XIII, 433 p.
Dimensiuni: 155 x 235 x 25 mm
Greutate: 0.81 kg
Ediția:1991
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: 0792392108
Pagini: 433
Ilustrații: XIII, 433 p.
Dimensiuni: 155 x 235 x 25 mm
Greutate: 0.81 kg
Ediția:1991
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 The Historical Context.- 1.2 Information and Coding.- 1.3 Bandwidth and Energy.- References.- 2 Source Coding Algorithms.- 2.1 Source Coding Preliminaries.- 2.2 Applications of Noiseless Source Coding.- 2.3 Rate-Distortion Theory.- 2.4 Predictive Source Coders.- 2.5 Some Other Rate-Distortion Approaches.- Problems.- References.- 3 Error Control Coding.- 3.1 Fundamentals of Coding.- 3.2 Linear Block Codes.- 3.3 Syndrome Decoding.- 3.4 Bounds on Performance.- 3.5 Cyclic Codes.- 3.6 Decoding Cyclic Codes.- 3.7 Algebra of Finite Fields.- 3.8 The BCH Codes.- 3.9 Decoding BCH Codes.- 3.10 Reed-Solomon Codes: Algebra in Non-Binary Fields.- 3.11 Codes for Burst Error Correction.- 3.12 Automatic Repeat Request Protocols.- Problems.- References.- 4 Trellis Codes.- 4.1 Convolutional Codes.- 4.2 Trees, Trellises and the Viterbi Algorithm.- 4.3 Continuous Phase Modulation Codes.- 4.4 Set-Partition Coding.- 4.5 Intersymbol Interference Decoding.- Problems.- References.- 5 Reduced Trellises.- 5.1 Truncation of the Impulse Response.- 5.2 Partition of the Path Map Alphabet.- 5.3 Pulse Response Simplification.- Problems.- References.- 6 Sequential Coding Algorithms.- 6.1 Basics of Sequential Coding.- 6.2 Important Channel Decoding Algorithms.- 6.3 Calculation of the Search Region Boundaries.- 6.4 Number of Paths Searched.- 6.5 Other Analyses of Sequential Decoding.- 6.6 Algorithm Steps.- 6.7 Source Coding Revisited.- Problems.- References.- 7 Architectures for Coding Algorithms.- 7.1 Parallel Architectures and Algorithms.- 7.2 Architectures for the M-Algorithm.- 7.3 Architectures for the Viterbi Algorithm.- Problems.- References.- APPENDICES.- A Signal Space Theory.- B Introduction to Algebra.- C Mathematical Details of the Stop and Drop Lines.