Scribd
Upload
29 views

2 Lecture2

The document discusses different types of channel codes used in coding theory. It describes block codes, including early codes like Hamming codes from the 1950s that could correct single errors. More powerful BCH and Reed-Solomon codes developed in the 1960s could correct multiple errors. Convolutional codes were also introduced, using a probabilistic approach and gaining popularity after the Viterbi algorithm. Over time, research combined block and convolutional codes to develop more powerful codes approaching Shannon's theoretical limit, like turbo codes. Coding schemes must support a wide range of applications with varying needs.

Uploaded by

mailstonaik
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
29 views

2 Lecture2

The document discusses different types of channel codes used in coding theory. It describes block codes, including early codes like Hamming codes from the 1950s that could correct single errors. More powerful BCH and Reed-Solomon codes developed in the 1960s could correct multiple errors. Convolutional codes were also introduced, using a probabilistic approach and gaining popularity after the Viterbi algorithm. Over time, research combined block and convolutional codes to develop more powerful codes approaching Shannon's theoretical limit, like turbo codes. Coding schemes must support a wide range of applications with varying needs.

Uploaded by

mailstonaik
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 25

CODING THEORY

A Birds Eye View : Continued Block Codes: Basics

Types of Channel Codes


Block Codes ( Codes with strong algebraic flavor) ~1950--- Hamming Code (Single error correction) All codes in 50s were too weak compared to the codes promised by Shannon Major Breakthrough..1960 BCH Codes Reed-Solomon Codes Capable of correcting Multiple Errors

4

Convolutional Codes

Codes with Probabilistic flavor. Late 1950s but gained popularity after the introduction of Viterbi algorithm in 1967. Developed from the idea of sequential decoding Non-block codes Codes are generated by a convolution operation on the information sequence

10

Coding Schemes: Trend


Since 1970s the two avenues of research started working together This resulted in the development towards the codes promised by Shannon Today Turbo Codes, are capable of achieving an improvement close to Shannon Limit

11

Coding Schemes

Applications demand for wide range of data rates, block sizes, error rates. No single error protection scheme works for all applications. Some requires the use of multiple coding techniques. A common combination uses an inner convolutional code and an outer Reed-Solomon code.

12

13

14

15

Slide 3

16

17

18

19

20

21

Block codes: basic definitions


An alphabet is a discrete (usually finite) set of symbols. example: B = { 0; 1} is the binary alphabet Definition: A block code of blocklength n over an alphabet X is a nonempty set of n-tuples of symbols from X. The n-tuples of the code are called code words. Code words are vectors whose components are symbols in X.

22

Block codes: basic definitions


Code words of length n are typically generated by encoding messages of k information bits using an invertible encoding function. Number of codewords is M = 2k , Rate R = k/n The rate is a dimensionless fraction; the fraction of transmitted symbols that carry information. A code with blocklength n and rate k/n is called an (n; k) code

23

Systematic encoder

The error protection ability of a block code depends only on the set of codewords, not on the mapping from source messages to codewords. An encoder is systematic when it copies the k message symbols unchanged into the codeword. Codewords are of the form c = [m p ] or c = [ p m] where m is the vector of k message symbols and p is the vector of n-k redundant or check symbols.
24

Linear Block Codes


c = mG

where, c code word (vector)

m message word (vector)

G Generator matrix

25

You might also like