000			08489nam a2201129 i 4500
001			5265339
003			IEEE
005			20200421114115.0
006			m o d
007			cr |n|||||||||
008			100317t20151999nyua ob 001 0 eng d
020			_a9780470544693 _qelectronic
020			_z9780470276839 _qprint
020			_z0470544694 _qelectronic
024	7		_a10.1109/9780470544693 _2doi
035			_a(CaBNVSL)mat05265339
035			_a(IDAMS)0b000064810c50d4
040			_aCaBNVSL _beng _erda _cCaBNVSL _dCaBNVSL
050		4	_aTK5102.92 _b.J64 1999eb
082	0	4	_a003/.54 _222
100	1		_aJohannesson, Rolf, _d1946-
245	1	0	_aFundamentals of convolutional coding / _cRolf Johannesson, Kamil Sh. Zigangirov.
264		1	_aNew York : _bInstitute of Electrical and Electronics Engineers, _cc1999.
264		2	_a[Piscataqay, New Jersey] : _bIEEE Xplore, _c[1999]
300			_a1 PDF (xiv, 428 pages) : _billustrations.
336			_atext _2rdacontent
337			_aelectronic _2isbdmedia
338			_aonline resource _2rdacarrier
490	1		_aIEEE series on digital & mobile communication ; _v2
500			_aSponsors include "IEEE Communications Society; IEEE Information Theory Society; IEEE Vehicular Technology Society."
504			_aIncludes bibliographical references (p. 407-418) and index.
505	0		_aPREFACE -- ACKNOWLEDGMENTS -- CHAPTER 1 INTRODUCTION -- 1.1 Why Error Control? -- 1.2 Block Codes -- A Primer -- 1.3 A First Encounter with Convolutional Codes -- 1.4 Block Codes versus Convolutional Codes -- 1.5 Capacity Limits and Potential Coding Gain Revisited -- 1.6 Comments -- Problems -- CHAPTER 2 CONVOLUTIONAL ENCODERSSTRUCTURAL PROPERTIES -- 2.1 Convolutional Codes and Their Encoders -- 2.2 The Smith Form of Polynomial Convolutional Generator Matrices -- 2.3 Encoder Inverses -- 2.4 Equivalent and Basic Encoding Matrices -- 2.5 Minimal-Basic Encoding Matrices -- 2.6 Minimal Encoding Matrices and Minimal Encoders -- 2.7 Canonical Encoding Matrices -- 2.8 Minimality via the Invariant-Factor Theorem -- 2.9 Syndrome Formers and Dual Encoders -- 2.10 Systematic Convolutional Encoders -- 2.11 Comments -- Problems -- CHAPTER 3 DISTANCE PROPERTIES OF CONVOLUTIONAL CODES -- 3.1 Distance Measures -- A First Encounter -- 3.2 Active Distances -- 3.3 Properties of Convolutional Codes via the Active Distances -- 3.4 Lower Bound on the Distance Profile -- 3.5 Upper Bounds on the Free Distance -- 3.6 Time-Varying Convolutional Codes -- 3.7 Lower Bound on the Free Distance -- 3.8 Lower Bounds on the Active Distances -- 3.9 Distances of Cascaded Concatenated Codes -- 3.10 Path Enumerators -- 3.11 Comments -- Problems -- CHAPTER 4 VITERBI DECODING -- 4.1 The Viterbi Algorithm Revisited -- 4.2 Error Bounds for Time-Invariant Convolutional Codes -- 4.3 Tighter Error Bounds for Time-Invariant Convolutional Codes -- 4.4 Upper Bounds on the Output Error Burst Lengths -- 4.5 Error Bounds for Periodically Time-Varying Convolutional Codes -- 4.6 Lower Error Bounds for Convolutional Codes -- 4.7 Error Bounds for Time-Varying Convolutional Codes -- 4.8 Error Bounds for Finite Back-Search Limits -- 4.9 Tailbiting Trellises -- 4.10 Quantization of Channel Outputs -- 4.11 Comments -- Problems -- CHAPTERS LIST DECODING -- 5.1 List Decoding Algorithms -- 5.2 List Decoding -- Performance -- 5.3 The List Minimum Weight.
505	8		_a5.4 Upper Bounds on the Probability of Correct Path Loss -- 5.5 Lower Bound on the Probability of Correct Path Loss -- 5.6 Correct Path Loss for Time-Invariant Convolutional Codes -- 5.7 Comments -- Problems -- CHAPTER 6 SEQUENTIAL DECODING -- 6.1 The Fano Metric -- 6.2 The Stack Algorithm -- 6.3 The Fano Algorithm -- 6.4 The Creeper Algorithm -- 6.5 Simulations -- 6.6 Computational Analysis of the Stack Algorithm -- 6.7 Error Probability Analysis of the Stack Algorithm -- 6.8 Analysis of the Fano Algorithm -- 6.9 Analysis of Creeper -- 6.10 Comments -- Problems -- CHAPTER 7 ITERATIVE DECODING -- 7.1 Iterative Decoding -- A Primer -- 7.2 The Two-Way Algorithm for APP Decoding -- 7.3 The Two-Way Algorithm for Tailbiting Trellises -- 7.4 The One-Way Algorithm for APP Decoding -- 7.5 Low-Density Parity-Check Convolutional Codes -- 7.6 Comments -- Problems -- CHAPTER 8 CONVOLUTIONAL CODES WITH GOOD DISTANCE PROPERTIES -- 8.1 Computing the Distance Spectrum -- 8.2 Some Classes of Rate R = 111 Convolutional Codes -- 8.3 Low-Rate Convolutional Codes -- 8.4 High-Rate Convolutional Codes -- 8.5 Tailbiting Trellis Encoders -- 8.6 Comments -- CHAPTER 9 MODULATION CODES -- 9.1 Bandlimited Channels and QAM -- 9.2 Coding Fundamentals -- 9.3 Lattice-Type Trellis Codes -- 9.4 Geometrically Uniform Trellis Codes -- 9.5 Decoding of Modulation Codes -- 9.6 Comments -- Problems -- APPENDIX A MINIMAL ENCODERS -- APPENDIX B WALD'S IDENTITY -- BIBLIOGRAPHY -- INDEX -- ABOUT THE AUTHORS.
506	1		_aRestricted to subscribers or individual electronic text purchasers.
520			_a"Convolutional codes, among the main error control codes, are routinely used in applications for mobile telephony, satellite communications, and voice-band modems. Written by two leading authorities in coding and information theory, this book brings you a clear and comprehensive discussion of the basic principles underlying convolutional coding. FUNDAMENTALS OF CONVOLUTIONAL CODING is unmatched in the field for its accessible analysis of the structural properties of convolutional encoders. Other essentials covered in FUNDAMENTALS OF CONVOLUTIONAL CODING include: * Distance properties of convolutional codes * Viterbi, list, sequential, and iterative decoding * Modulation codes * Tables of good convolutional encoders * An extensive set of homework problems. The authors draw on their own research and more than twenty years of teaching experience to present the fundamentals needed to understand the types of codes used in a variety of applications today. This book can be used as a textbook for graduate-level electrical engineering students. It will be of key interest to researchers and engineers of wireless and mobile communications, satellite communication, and data communication." Sponsored by: IEEE Communications Society, IEEE Information Theory Society, IEEE Vehicular Technology Society.
530			_aAlso available in print.
538			_aMode of access: World Wide Web
588			_aDescription based on PDF viewed 12/21/2015.
650		0	_aCoding theory.
650		0	_aConvolutions (Mathematics)
650		0	_aError-correcting codes (Information theory)
655		0	_aElectronic books.
695			_aAdders
695			_aApproximation methods
695			_aArrays
695			_aArtificial intelligence
695			_aBibliographies
695			_aBinary codes
695			_aBinary phase shift keying
695			_aBiographies
695			_aBismuth
695			_aChannel coding
695			_aCodecs
695			_aComplexity theory
695			_aConstellation diagram
695			_aConvergence
695			_aConvolution
695			_aConvolutional codes
695			_aDecoding
695			_aDelay
695			_aDemodulation
695			_aEncoding
695			_aEquations
695			_aError correction
695			_aEuclidean distance
695			_aFinite element methods
695			_aFrequency modulation
695			_aGenerators
695			_aHamming weight
695			_aIndexes
695			_aIterative decoding
695			_aMaximum likelihood decoding
695			_aMaximum likelihood estimation
695			_aMeasurement
695			_aNickel
695			_aNoise
695			_aPolynomials
695			_aProbability
695			_aQuadrature amplitude modulation
695			_aRandom variables
695			_aReliability theory
695			_aSystematics
695			_aTin
695			_aTransducers
695			_aTransfer functions
695			_aViterbi algorithm
700	1		_aZigangirov, K. Sh.
710	2		_aJohn Wiley & Sons, _epublisher.
710	2		_aIEEE Communications Society.
710	2		_aIEEE Information Theory Society.
710	2		_aVehicular Technology Society.
710	2		_aIEEE Xplore (Online service), _edistributor.
776	0	8	_iPrint version: _z9780470276839
830		0	_aIEEE series on digital & mobile communication ; _v2
856	4	2	_3Abstract with links to resource _uhttp://ieeexplore.ieee.org/xpl/bkabstractplus.jsp?bkn=5265339
942			_cEBK
999			_c59496 _d59496