Performance Analysis and Modeling of Digital Transmission Systems: Information Technology: Transmission, Processing and Storage
Autor William Turinen Limba Engleză Paperback – 8 mai 2013
Din seria Information Technology: Transmission, Processing and Storage
- 15% Preț: 620.72 lei
- 15% Preț: 623.93 lei
- 15% Preț: 517.98 lei
- Preț: 381.68 lei
- 20% Preț: 336.21 lei
- 15% Preț: 575.83 lei
- 18% Preț: 1369.64 lei
- 15% Preț: 637.39 lei
- 15% Preț: 644.73 lei
- 15% Preț: 635.95 lei
- Preț: 407.69 lei
- 20% Preț: 597.98 lei
- 18% Preț: 936.35 lei
- 18% Preț: 941.30 lei
- 15% Preț: 627.93 lei
- 18% Preț: 1096.39 lei
- 18% Preț: 934.97 lei
- 20% Preț: 635.96 lei
- 18% Preț: 1652.76 lei
- 18% Preț: 1651.81 lei
- 18% Preț: 1818.83 lei
- 20% Preț: 345.44 lei
Preț: 339.27 lei
Preț vechi: 424.08 lei
-20% Nou
Puncte Express: 509
Preț estimativ în valută:
64.95€ • 67.51$ • 53.85£
64.95€ • 67.51$ • 53.85£
Carte tipărită la comandă
Livrare economică 05-19 februarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9781461347811
ISBN-10: 1461347815
Pagini: 464
Ilustrații: XXI, 441 p.
Dimensiuni: 178 x 254 x 24 mm
Greutate: 0.8 kg
Ediția:Softcover reprint of the original 1st ed. 2004
Editura: Springer Us
Colecția Springer
Seria Information Technology: Transmission, Processing and Storage
Locul publicării:New York, NY, United States
ISBN-10: 1461347815
Pagini: 464
Ilustrații: XXI, 441 p.
Dimensiuni: 178 x 254 x 24 mm
Greutate: 0.8 kg
Ediția:Softcover reprint of the original 1st ed. 2004
Editura: Springer Us
Colecția Springer
Seria Information Technology: Transmission, Processing and Storage
Locul publicării:New York, NY, United States
Public țintă
ResearchCuprins
Preface.- Notation.- 1. Error Source Models.- 1.1 Description of Error Sources by Hidden Markov Models.- 1.2 Binary Symmetric Stationary Channel.- 1.3 Error Source Description by Matrix Processes.- 1.4 Error Source Description by Semi-Markov Processes.- 1.5 Some Particular Error Source Models.- 1.6 Conclusion.- References.- 2. Matrix Probabilities.- 2.1 Matrix Probabilities and Their Properties.- 2.2 Matrix Transforms.- 2.3 Matrix Distributions.- 2.4 Markov Functions.- 2.5 Monte Carlo Method.- 2.6 Computing Scalar Probabilities.- 2.7 Conclusion.- References.- 3. Model Parameter Estimation.- 3.1 The Em Algorithm.- 3.2 Baum-Welch Algorithm.- 3.3 Markov Renewal Process.- 3.4 Matrix-Geometric Distribution Parameter Estimation.- 3.5 Matrix Process Parameter Estimation.- 3.6 Hmm Parameter Estimation.- 3.7 Monte Carlo Method of Model Building.- 3.8 Error Source Model in Several Channels.- 3.9 Conclusion.- References.- 4. Performance of Forward Error-Correction Systems.- 4.1 Basic Characteristics of One-Way Systems.- 4.2 Elements of Error-Correcting Coding.- 4.3 Maximum A Posteriori Decoding.- 4.4 Block Code Performance Characterization.- 4.5 Convolutional Code Performance.- 4.6 Computer Simulation.- 4.7 Zero-Redundancy Codes.- 4.8 Conclusion.- References.- 5. Performance Analysis of Communication Protocol.- 5.1 Basic Characteristics of Two-Way Systems.- 5.2 Return-Channel Messages.- 5.3 Synchronization.- 5.4 Arq Performance Characteristics.- 5.5 Delay-Constained Systems.- 5.6 Conclusion.- References.- 6. Continuous Time Hmm.- 6.1 Continuous and Discrete Time Hmm.- 6.2 Fitting Continuous Time Hmm.- 6.3 Conclusion.- References.- 7. Continuous State Hmm.- 7.1 Continuous and Discrete State Hmm.- 7.2 Operator Probability.- 7.3 Filtering, Prediction, and Smoothing.- 7.4 Linear Systems.- 7.5 Autoregressive Moving Average Processes.- 7.6 Parameter Estimation.- 7.7 Arma Channel Modeling.- 7.8 Conclusion.- References.- Appendix 1.- 1.1 Matrix Processes.- 1.2 Markov Lumpable Chains.- 1.3 Semi-Markov Lumpable Chains.- References.- Appendix 2.- 2.1 Asymptotic Expansion of Matrix Probabilities.- 2.2 Chernoff Bounds.- 2.3 Block Graphs.- References.- Appendix 3.- 3.1 Statistical Inference.- 3.2 Markov Chain Model Building.- 3.3 Semi-Markov Process Hypothesis Testing.- 3.4 Matrix Process Parameter Estimation.- References.- Appendix 4.- 4.1 Sums With Binomial Coefficients.- 4.2 Maximum-Distance-Separable Code Weight Generating Function.- 4.3 Union Bounds on Viterbi Algorithm Performance.- References.- Appendix 5.- 5.1 Matrices.- References.- Appendix 6.- 6.1 Markov Chains and Graphs.- References.- Appendix 7.- 7.1 Markov Processes.- 7.2 Gauss-Markov Processes.- References.