ORPP logo

Fundamentals of Convolutional Coding. (Record no. 101364)

MARC details
000 -LEADER
fixed length control field 05982nam a22004933i 4500
001 - CONTROL NUMBER
control field EBC4041010
003 - CONTROL NUMBER IDENTIFIER
control field MiAaPQ
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20240729130044.0
006 - FIXED-LENGTH DATA ELEMENTS--ADDITIONAL MATERIAL CHARACTERISTICS
fixed length control field m o d |
007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION
fixed length control field cr cnu||||||||
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 240724s2015 xx o ||||0 eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9781119098676
Qualifying information (electronic bk.)
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
Canceled/invalid ISBN 9780470276839
035 ## - SYSTEM CONTROL NUMBER
System control number (MiAaPQ)EBC4041010
035 ## - SYSTEM CONTROL NUMBER
System control number (Au-PeEL)EBL4041010
035 ## - SYSTEM CONTROL NUMBER
System control number (CaPaEBR)ebr11114013
035 ## - SYSTEM CONTROL NUMBER
System control number (CaONFJC)MIL788234
035 ## - SYSTEM CONTROL NUMBER
System control number (OCoLC)927509697
040 ## - CATALOGING SOURCE
Original cataloging agency MiAaPQ
Language of cataloging eng
Description conventions rda
-- pn
Transcribing agency MiAaPQ
Modifying agency MiAaPQ
050 #4 - LIBRARY OF CONGRESS CALL NUMBER
Classification number TK5102.92 -- .F863 2015eb
082 0# - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 003/.54
100 1# - MAIN ENTRY--PERSONAL NAME
Personal name Johannesson, Rolf.
245 10 - TITLE STATEMENT
Title Fundamentals of Convolutional Coding.
250 ## - EDITION STATEMENT
Edition statement 2nd ed.
264 #1 - PRODUCTION, PUBLICATION, DISTRIBUTION, MANUFACTURE, AND COPYRIGHT NOTICE
Place of production, publication, distribution, manufacture Newark :
Name of producer, publisher, distributor, manufacturer John Wiley & Sons, Incorporated,
Date of production, publication, distribution, manufacture, or copyright notice 2015.
264 #4 - PRODUCTION, PUBLICATION, DISTRIBUTION, MANUFACTURE, AND COPYRIGHT NOTICE
Date of production, publication, distribution, manufacture, or copyright notice ©2015.
300 ## - PHYSICAL DESCRIPTION
Extent 1 online resource (689 pages)
336 ## - CONTENT TYPE
Content type term text
Content type code txt
Source rdacontent
337 ## - MEDIA TYPE
Media type term computer
Media type code c
Source rdamedia
338 ## - CARRIER TYPE
Carrier type term online resource
Carrier type code cr
Source rdacarrier
490 1# - SERIES STATEMENT
Series statement IEEE Series on Digital and Mobile Communication Series
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note Intro -- FUNDAMENTALS OF CONVOLUTIONAL CODING -- Contents -- Preface -- Acknowledgement -- 1 Introduction -- 1.1 Why error control? -- 1.2 Block codes-a primer -- 1.3 Codes on graphs -- 1.4 A first encounter with convolutional codes -- 1.5 Block codes versus convolutional codes -- 1.6 Capacity limits and potential coding gain revisited -- 1.7 Comments -- Problems -- 2 Convolutional encoders-Structural properties -- 2.1 Convolutional codes and their encoders -- 2.2 The Smith form of polynomial convolutional generator matrices -- 2.3 Encoder inverses -- 2.4 Encoder and code equivalences -- 2.5 Basic encoding matrices -- 2.6 Minimalbasic encoding matrices -- 2.7 Minimal encoding matrices and minimal encoders -- 2.8 Canonical encoding matrices* -- 2.9 Minimality via the invariantfactor theorem* -- 2.10 Syndrome formers and dual encoders -- 2.11 Systematic convolutional encoders -- 2.12 Some properties of generator matrices-an overview -- 2.13 Comments -- Problems -- 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 Timevarying 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 -- 4 Decoding of convolutional codes -- 4.1 The Viterbi algorithm revisited -- 4.2 Error bounds for timeinvariant convolutional codes -- 4.3 Tighter error bounds for timeinvariant convolutional codes -- 4.4 Exact bit error probability for Viterbi decoding -- 4.5 The BCJR algorithm for APP decoding -- 4.6 The oneway algorithm for APP decoding.
505 8# - FORMATTED CONTENTS NOTE
Formatted contents note 4.7 A simple upper bound on the bit error probability for extremely noisy channels -- 4.8 Tailbiting trellises -- 4.9 Decoding of tailbiting codes -- 4.10 BEAST decoding of tailbiting codes -- 4.11 Comments -- Problems -- 5 Random ensemble bounds for decoding error probability -- 5.1 Upper bounds on the output error burst lengths -- 5.2 Bounds for periodically timevarying convolutional codes -- 5.3 Lower error probability bounds for convolutional codes -- 5.4 General bounds for timevarying convolutional codes -- 5.5 Bounds for finite backsearch limits -- 5.6 Quantization of channel outputs -- 5.7 Comments -- Problems -- 6 List decoding -- 6.1 List decoding algorithms -- 6.2 List decoding-performance -- 6.3 The list minimum weight -- 6.4 Upper bounds on the probability of correct path loss -- 6.5 Lower bound on the probability of correct path loss -- 6.6 Correct path loss for timeinvariant convolutional codes -- 6.7 Comments -- Problems -- 7 Sequential decoding -- 7.1 The Fano metric -- 7.2 The stack algorithm -- 7.3 The Fano algorithm -- 7.4 The Creeper algorithm* -- 7.5 Simulations -- 7.6 Computational analysis of the stack algorithm -- 7.7 Error probability analysis of the stack algorithm -- 7.8 Analysis of the Fano algorithm -- 7.9 Analysis of Creeper* -- 7.10 Comments -- Problems -- 8 Lowdensity paritycheck codes -- 8.1 LDPC block codes -- 8.2 LDPC convolutional codes -- 8.3 Block and convolutional permutors -- 8.4 Lower bounds on distances of LDPC codes -- 8.5 Iterative decoding of LDPC codes -- 8.6 Iterative limits and thresholds -- 8.7 Braided block codes* -- 8.8 Comments -- Problems -- 9 Turbo coding -- 9.1 Parallel concatenation of two convolutional codes -- 9.2 Distance bounds of turbo codes -- 9.3 Parallel concatenation of three and more convolution codes -- 9.4 Iterative decoding of turbo codes -- 9.5 Braided convolutional codes*.
505 8# - FORMATTED CONTENTS NOTE
Formatted contents note 9.6 Comments -- Problems -- 10 Convolutional codes with good distance properties -- 10.1 Computing the Viterbi spectrum using FAST -- 10.2 The magnificient BEAST -- 10.3 Some classes of rate R = 1=2 convolutional codes -- 10.4 Low rate convolutional codes -- 10.5 High rate convolutional codes -- 10.6 Tailbiting trellis encoders -- 10.7 Comments -- Appendix A: Minimal encoders -- Appendix B: Wald's identity -- References -- Index -- EULA.
588 ## - SOURCE OF DESCRIPTION NOTE
Source of description note Description based on publisher supplied metadata and other sources.
590 ## - LOCAL NOTE (RLIN)
Local note Electronic reproduction. Ann Arbor, Michigan : ProQuest Ebook Central, 2024. Available via World Wide Web. Access may be limited to ProQuest Ebook Central affiliated libraries.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Convolutions (Mathematics).
655 #4 - INDEX TERM--GENRE/FORM
Genre/form data or focus term Electronic books.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Zigangirov, Kamil Sh.
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Relationship information Print version:
Main entry heading Johannesson, Rolf
Title Fundamentals of Convolutional Coding
Place, publisher, and date of publication Newark : John Wiley & Sons, Incorporated,c2015
International Standard Book Number 9780470276839
797 2# - LOCAL ADDED ENTRY--CORPORATE NAME (RLIN)
Corporate name or jurisdiction name as entry element ProQuest (Firm)
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
Uniform title IEEE Series on Digital and Mobile Communication Series
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier <a href="https://ebookcentral.proquest.com/lib/orpp/detail.action?docID=4041010">https://ebookcentral.proquest.com/lib/orpp/detail.action?docID=4041010</a>
Public note Click to View

No items available.

© 2024 Resource Centre. All rights reserved.