Convolutional Codes Mohammad Hanaysheh Mahdi Barhoush.

Презентация:



Advertisements
Похожие презентации
Linear Block Codes Mahdi Barhoush Mohammad Hanaysheh.
Advertisements

Comparative Analysis of Phylogenic Algorithms V. Bayrasheva, R. Faskhutdinov, V. Solovyev Kazan University, Russia.
© 2005 Cisco Systems, Inc. All rights reserved. INTRO v Module Summary TCP/IP is the most widely used networking protocol, with functions that can.
Lecture # Computer Architecture Computer Architecture = ISA + MO ISA stands for instruction set architecture is a logical view of computer system.
© The McGraw-Hill Companies, Inc., Chapter 4 Counting Techniques.
Time-Series Analysis and Forecasting – Part IV To read at home.
Sequences Sequences are patterns. Each pattern or number in a sequence is called a term. The number at the start is called the first term. The term-to-term.
10.1 Chapter 10 Error Detection and Correction Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
8.1 Chapter 8 Switching Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
© 2006 Cisco Systems, Inc. All rights reserved. BSCI v Configuring EIGRP Using EIGRP in an Enterprise Network.
BREADTH FIRST TRAVERSAL Lesson Plan -3. Evocation.
HPC Pipelining Parallelism is achieved by starting to execute one instruction before the previous one is finished. The simplest kind overlaps the execution.
TCP/IP Protocol Suite 1 Chapter 12 Upon completion you will be able to: Transmission Control Protocol Be able to name and understand the services offered.
Ways to Check for Divisibility Vüsal Abbasov Dividing By 1 All numbers are divisible by 1.
© 2006 Cisco Systems, Inc. All rights reserved. ICND v Determining IP Routes Introducing Distance Vector Routing.
Michael Marchenko. In mathematics, a sequence is an ordered list of objects (or events). Like a set, it contains members (also called elements, or terms),
© 2005 Cisco Systems, Inc. All rights reserved. INTRO v Module Summary The topology of a network describes the layout of the cabling and devices.
AVL-Trees COMP171 Fall AVL Trees / Slide 2 Balanced binary tree * The disadvantage of a binary search tree is that its height can be as large as.
Knot theory. In topology, knot theory is the study of mathematical knots. While inspired by knots which appear in daily life in shoelaces and rope, a.
Module III Taub Ch.6 PSK QPSK M-ary PSK FSK M-ary FSK MSK.
Транксрипт:

Convolutional Codes Mohammad Hanaysheh Mahdi Barhoush

* A convolutional code is generated by passing the information sequence to be transmitted through a linear finite shift register. * The input data to the encoder, which is assumed to be binary is shifted into and along the shift register k bits at a time. The number of output bits for each k bit sequence is n bits. R = k / n. R = k / n.

Example. Consider the binary convolutional encoder with k=1 and n=3.

>>> Initially, the shift register is assumed to be in the all- zero state. suppose the first input is a 1.then the output sequence of three bits is 111.suppose the second bit is 0.the output sequence will be 001.if the third bit is 1,the output will be 100,and so on. >>> There are three alternative methods that are often used to describe a convolutional code: 1. Tree diagram. 2. Trellis diagram. 3.State diagram.

Tree Diagram:

Information bit 0 or 1Register states 00,01,10 or 11 a 00 b 01 c 10 d 11

Trellis Diagram

State Diagram

Decoding A message m is encoded into the code sequence c. Each code sequence represents a path in the trellis diagram. Minimum Distance Decoding Upon receiving the received sequence r, search for the path that is closest ( in Hamming distance) to r.

The Viterbi Algorithm: * The viterbi algorithm is used to decode convolutional codes and any structure or system that can be described by a trellis. * It is a maximum likelihood decoding algorithm that selects the most probable path that maximizes the likelihood function. * The algorithm is based on add-compare-select the best path each time at each state.