Scribd Logo
Upload

Welcome to Scribd!

  • Example of Convo Code

    Uploaded by

    Rupesh Sushir
    39 views3 pages
    This document provides an overview of convolutional codes, which are a type of channel coding used to protect digital data during transmission. Convolutional codes map blocks of k information bits into blocks of n coded bits, where the coded bits are determined not only by the present k bits but also by previous bits. This dependence can be represented by a finite state machine. The document gives an example of a rate 1/2 convolutional coder and illustrates its encoding and decoding using a trellis structure. Convolutional codes allow for efficient trellis-based encoding and decoding and are very practical and powerful codes.

    Original Description:

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document provides an overview of convolutional codes, which are a type of channel coding used to protect digital data during transmission. Convolutional codes map blocks of k information bits into blocks of n coded bits, where the coded bits are determined not only by the present k bits but also by previous bits. This dependence can be represented by a finite state machine. The document gives an example of a rate 1/2 convolutional coder and illustrates its encoding and decoding using a trellis structure. Convolutional codes allow for efficient trellis-based encoding and decoding and are very practical and powerful codes.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    39 views3 pages

    Example of Convo Code

    Uploaded by

    Rupesh Sushir
    This document provides an overview of convolutional codes, which are a type of channel coding used to protect digital data during transmission. Convolutional codes map blocks of k information bits into blocks of n coded bits, where the coded bits are determined not only by the present k bits but also by previous bits. This dependence can be represented by a finite state machine. The document gives an example of a rate 1/2 convolutional coder and illustrates its encoding and decoding using a trellis structure. Convolutional codes allow for efficient trellis-based encoding and decoding and are very practical and powerful codes.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 3

    Connexions module: m10181 1

    Convolutional Codes ∗

    Behnaam Aazhang
    This work is produced by The Connexions Project and licensed under the
    †
    Creative Commons Attribution License

    Abstract
    A description of channel coding using convolutional codes.

    Convolutional codes are one type of code used for channel coding . Another type of code used is block
    1

    coding .
    2

    1 Convolutional codes
    In convolutional codes, each block of k bits is mapped into a block of n bits but these n bits are not only
    determined by the present k information bits but also by the previous information bits. This dependence
    can be captured by a nite state machine.
    Example 1
    A rate 21 convolutional coder k = 1, n = 2 with memory length 2 and constraint length 3.

    Figure 1

    Since the length of the shift register is 2, there are 4 dierent rates. The behavior of the
    convolutional coder can be captured by a 4 state machine. States: 00, 01, 10, 11,
    ∗ Version 2.7: May 17, 2004 11:43 am GMT-5
    † http://creativecommons.org/licenses/by/1.0
    1 "Channel Coding" <http://cnx.org/content/m10174/latest/>
    2 "Channel Coding": Section Block codes <http://cnx.org/content/m10174/latest/#s1>

    http://cnx.org/content/m10181/2.7/
    Connexions module: m10181 2

    For example, arrival of information bit 0 transitions from state 10 to state 01.
    The encoding and the decoding process can be realized in trellis structure.

    Figure 2

    If the input sequence is


    1 1 0 0
    the output sequence would be
    11 10 10 11
    The transmitted codeword is then 11 10 10 11. If there is one error on the channel 11 00 10 11

    Figure 3

    http://cnx.org/content/m10181/2.7/
    Connexions module: m10181 3

    Starting from state 00 the Hamming distance between the possible paths and the received
    sequence is measured. At the end, the path with minimum distance to the received sequence is
    chosen as the correct trellis path. The information sequence will then be determined.
    Convolutional coding lends itself to very ecient trellis based encoding and decoding. They are very
    practical and powerful codes.

    http://cnx.org/content/m10181/2.7/

    You might also like