{"product_id":"fundamentals-of-convolutional-coding-hardback-9780470276839","title":"Fundamentals of Convolutional Coding (Hardback) 9780470276839","description":"\u003cfont face=\"Georgia\"\u003e\r\n\u003cp\u003e\u003cfont size=\"6\"\u003eFundamentals of Convolutional Coding\u003c\/font\u003e\u003cbr\u003e\r\n\r\n\r\n\r\n\r\n\r\n\u003c\/p\u003e\n\u003cp\u003e\u003cfont size=\"4\"\u003eRolf Johannesson (Author), Kamil Sh. Zigangirov (Author)\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e9780470276839, Wiley\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003eHardback, published 29 June 2015\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e688 pages, Charts: 60 B\u0026amp;W, 0 Color; Graphs: 60 B\u0026amp;W, 0 Color\u003cbr\u003e23.6 x 16 x 3.8 cm, 1.293 kg\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\r\n\r\n\r\n\r\n\u003cp align=\"justify\"\u003e\u003cstrong\u003e\u003cfont size=\"3\"\u003e\u003cp\u003e\u003ci\u003eFundamentals of Convolutional Coding, Second Edition,\u003c\/i\u003e regarded as a bible of convolutional coding brings you a clear and comprehensive discussion of the basic principles of this field\u003c\/p\u003e \u003cul\u003e \u003cli\u003eTwo new chapters on low-density parity-check (LDPC) convolutional codes and iterative coding\u003c\/li\u003e \u003cli\u003eViterbi, BCJR, BEAST, list, and sequential decoding of convolutional codes\u003c\/li\u003e \u003cli\u003eDistance properties of convolutional codes\u003c\/li\u003e \u003cli\u003eIncludes a downloadable solutions manual\u003c\/li\u003e \u003c\/ul\u003e\u003c\/font\u003e\u003c\/strong\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e\u003cp\u003ePreface xi\u003c\/p\u003e \u003cp\u003eAcknowledgement xiv\u003c\/p\u003e \u003cp\u003e\u003cb\u003e1 Introduction 1\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e1.1 Why error control? 1\u003c\/p\u003e \u003cp\u003e1.2 Block codes—a primer 8\u003c\/p\u003e \u003cp\u003e1.3 Codes on graphs 21\u003c\/p\u003e \u003cp\u003e1.4 A first encounter with convolutional codes 28\u003c\/p\u003e \u003cp\u003e1.5 Block codes versus convolutional codes 35\u003c\/p\u003e \u003cp\u003e1.6 Capacity limits and potential coding gain revisited 36\u003c\/p\u003e \u003cp\u003e1.7 Comments 39\u003c\/p\u003e \u003cp\u003eProblems 41\u003c\/p\u003e \u003cp\u003e\u003cb\u003e2 Convolutional encoders—Structural properties 49\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e2.1 Convolutional codes and their encoders 49\u003c\/p\u003e \u003cp\u003e2.2 The Smith form of polynomial convolutional generator matrices 58\u003c\/p\u003e \u003cp\u003e2.3 Encoder inverses 67\u003c\/p\u003e \u003cp\u003e2.4 Encoder and code equivalences 76\u003c\/p\u003e \u003cp\u003e2.5 Basic encoding matrices 79\u003c\/p\u003e \u003cp\u003e2.6 Minimalbasic encoding matrices 82\u003c\/p\u003e \u003cp\u003e2.7 Minimal encoding matrices and minimal encoders 90\u003c\/p\u003e \u003cp\u003e2.8 Canonical encoding matrices* 109\u003c\/p\u003e \u003cp\u003e2.9 Minimality via the invariantfactor theorem* 127\u003c\/p\u003e \u003cp\u003e2.10 Syndrome formers and dual encoders 131\u003c\/p\u003e \u003cp\u003e2.11 Systematic convolutional encoders 139\u003c\/p\u003e \u003cp\u003e2.12 Some properties of generator matrices—an overview 150\u003c\/p\u003e \u003cp\u003e2.13 Comments 150\u003c\/p\u003e \u003cp\u003eProblems 152\u003c\/p\u003e \u003cp\u003e\u003cb\u003e3 Distance properties of convolutional codes 161\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e3.1 Distance measures—a first encounter 161\u003c\/p\u003e \u003cp\u003e3.2 Active distances 171\u003c\/p\u003e \u003cp\u003e3.3 Properties of convolutional codes via the active distances 179\u003c\/p\u003e \u003cp\u003e3.4 Lower bound on the distance profile 181\u003c\/p\u003e \u003cp\u003e3.5 Upper bounds on the free distance 186\u003c\/p\u003e \u003cp\u003e3.6 Timevarying convolutional codes 191\u003c\/p\u003e \u003cp\u003e3.7 Lower bound on the free distance 195\u003c\/p\u003e \u003cp\u003e3.8 Lower bounds on the active distances* 200\u003c\/p\u003e \u003cp\u003e3.9 Distances of cascaded concatenated codes* 207\u003c\/p\u003e \u003cp\u003e3.10 Path enumerators 213\u003c\/p\u003e \u003cp\u003e3.11 Comments 220\u003c\/p\u003e \u003cp\u003eProblems 221\u003c\/p\u003e \u003cp\u003e\u003cb\u003e4 Decoding of convolutional codes 225\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e4.1 The Viterbi algorithm revisited 226\u003c\/p\u003e \u003cp\u003e4.2 Error bounds for timeinvariant convolutional codes 235\u003c\/p\u003e \u003cp\u003e4.3 Tighter error bounds for timeinvariant convolutional codes 250\u003c\/p\u003e \u003cp\u003e4.4 Exact bit error probability for Viterbi decoding 255\u003c\/p\u003e \u003cp\u003e4.5 The BCJR algorithm for APP decoding 271\u003c\/p\u003e \u003cp\u003e4.6 The oneway algorithm for APP decoding 283\u003c\/p\u003e \u003cp\u003e4.7 A simple upper bound on the bit error probability for extremely noisy channels 288\u003c\/p\u003e \u003cp\u003e4.8 Tailbiting trellises 293\u003c\/p\u003e \u003cp\u003e4.9 Decoding of tailbiting codes 302\u003c\/p\u003e \u003cp\u003e4.10 BEAST decoding of tailbiting codes 308\u003c\/p\u003e \u003cp\u003e4.11 Comments 323\u003c\/p\u003e \u003cp\u003eProblems 324\u003c\/p\u003e \u003cp\u003e\u003cb\u003e5 Random ensemble bounds for decoding error probability 333\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e5.1 Upper bounds on the output error burst lengths 333\u003c\/p\u003e \u003cp\u003e5.2 Bounds for periodically timevarying convolutional codes 345\u003c\/p\u003e \u003cp\u003e5.3 Lower error probability bounds for convolutional codes 355\u003c\/p\u003e \u003cp\u003e5.4 General bounds for timevarying convolutional codes 363\u003c\/p\u003e \u003cp\u003e5.5 Bounds for finite backsearch limits 375\u003c\/p\u003e \u003cp\u003e5.6 Quantization of channel outputs 379\u003c\/p\u003e \u003cp\u003e5.7 Comments 384\u003c\/p\u003e \u003cp\u003eProblems 384\u003c\/p\u003e \u003cp\u003e\u003cb\u003e6 List decoding 387\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e6.1 List decoding algorithms 388\u003c\/p\u003e \u003cp\u003e6.2 List decoding—performance 391\u003c\/p\u003e \u003cp\u003e6.3 The list minimum weight 397\u003c\/p\u003e \u003cp\u003e6.4 Upper bounds on the probability of correct path loss 407\u003c\/p\u003e \u003cp\u003e6.5 Lower bound on the probability of correct path loss 416\u003c\/p\u003e \u003cp\u003e6.6 Correct path loss for timeinvariant convolutional codes 418\u003c\/p\u003e \u003cp\u003e6.7 Comments 422\u003c\/p\u003e \u003cp\u003eProblems 423\u003c\/p\u003e \u003cp\u003e\u003cb\u003e7 Sequential decoding 425\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e7.1 The Fano metric 426\u003c\/p\u003e \u003cp\u003e7.2 The stack algorithm 431\u003c\/p\u003e \u003cp\u003e7.3 The Fano algorithm 433\u003c\/p\u003e \u003cp\u003e7.4 The Creeper algorithm* 436\u003c\/p\u003e \u003cp\u003e7.5 Simulations 448\u003c\/p\u003e \u003cp\u003e7.6 Computational analysis of the stack algorithm 450\u003c\/p\u003e \u003cp\u003e7.7 Error probability analysis of the stack algorithm 460\u003c\/p\u003e \u003cp\u003e7.8 Analysis of the Fano algorithm 471\u003c\/p\u003e \u003cp\u003e7.9 Analysis of Creeper* 477\u003c\/p\u003e \u003cp\u003e7.10 Comments 480\u003c\/p\u003e \u003cp\u003eProblems 481\u003c\/p\u003e \u003cp\u003e\u003cb\u003e8 Lowdensity paritycheck codes 485\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e8.1 LDPC block codes 486\u003c\/p\u003e \u003cp\u003e8.2 LDPC convolutional codes 496\u003c\/p\u003e \u003cp\u003e8.3 Block and convolutional permutors 508\u003c\/p\u003e \u003cp\u003e8.4 Lower bounds on distances of LDPC codes 517\u003c\/p\u003e \u003cp\u003e8.5 Iterative decoding of LDPC codes 529\u003c\/p\u003e \u003cp\u003e8.6 Iterative limits and thresholds 538\u003c\/p\u003e \u003cp\u003e8.7 Braided block codes* 553\u003c\/p\u003e \u003cp\u003e8.8 Comments 562\u003c\/p\u003e \u003cp\u003eProblems 562\u003c\/p\u003e \u003cp\u003e\u003cb\u003e9 Turbo coding 567\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e9.1 Parallel concatenation of two convolutional codes 567\u003c\/p\u003e \u003cp\u003e9.2 Distance bounds of turbo codes 570\u003c\/p\u003e \u003cp\u003e9.3 Parallel concatenation of three and more convolution codes 573\u003c\/p\u003e \u003cp\u003e9.4 Iterative decoding of turbo codes 582\u003c\/p\u003e \u003cp\u003e9.5 Braided convolutional codes* 586\u003c\/p\u003e \u003cp\u003e9.6 Comments 591\u003c\/p\u003e \u003cp\u003eProblems 591\u003c\/p\u003e \u003cp\u003e\u003cb\u003e10 Convolutional codes with good distance properties 593\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e10.1 Computing the Viterbi spectrum using FAST 594\u003c\/p\u003e \u003cp\u003e10.2 The magnificient BEAST 598\u003c\/p\u003e \u003cp\u003e10.3 Some classes of rate R = 1=2 convolutional codes 604\u003c\/p\u003e \u003cp\u003e10.4 Low rate convolutional codes 608\u003c\/p\u003e \u003cp\u003e10.5 High rate convolutional codes 621\u003c\/p\u003e \u003cp\u003e10.6 Tailbiting trellis encoders 622\u003c\/p\u003e \u003cp\u003e10.7 Comments 622\u003c\/p\u003e \u003cp\u003eAppendix A: Minimal encoders 627\u003c\/p\u003e \u003cp\u003eAppendix B: Wald’s identity 635\u003c\/p\u003e \u003cp\u003eReferences 647\u003c\/p\u003e \u003cp\u003eIndex 659\u003c\/p\u003e\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003eSubject Areas: Electronics \u0026amp; communications engineering [\u003ca title=\"See our other books on Electronics \u0026amp; communications engineering\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Electronics%20\u0026amp;%20communications%20engineering%20%5BTJ%5D%22\"\u003eTJ\u003c\/a\u003e]\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\r\n\u003c\/font\u003e","brand":"Wiley-IEEE Press","offers":[{"title":"Brand New","offer_id":52276159512856,"sku":"9780470276839","price":107.89,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0730\/2037\/5320\/files\/9780470276839.jpg?v=1781364620","url":"https:\/\/freshlyprintedbooks.co.uk\/products\/fundamentals-of-convolutional-coding-hardback-9780470276839","provider":"Freshly Printed Books","version":"1.0","type":"link"}