Scribd
Upload
58 views

Dsd-Lecture Convencoder

Study the parameters that define a convolutional encoder like generator polynomial, recursion, systematic encoding, number of states, memory elements, constraint length, input bits and code rate to understand how to design different types of convolutional encoders.

Uploaded by

nabeel hasan
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
58 views

Dsd-Lecture Convencoder

Study the parameters that define a convolutional encoder like generator polynomial, recursion, systematic encoding, number of states, memory elements, constraint length, input bits and code rate to understand how to design different types of convolutional encoders.

Uploaded by

nabeel hasan
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 11

DSD Lecture 13

Convolutional
Encoder
Convolutional codes are used extensively to achieve
reliable data transfer in numerous applications, such as
digital video, radio, mobile communications and
satellite communications. Convolutional encoder is
used for implementation of these codes.
Base-band processing modules for
Transmitter and receiver

Encoder BICM OFDM


Mapper
Interleaver (IFFT +CP)

Rayleigh
Fading OFDM BICM
(CP Rem. + Demapper Deinterleav Decoder
Channel with
multipath FFT) er
Topics

 Convolutional encoder design components.

 Verilog code for convolutional encoder.

 Different convolutional encoders


Convolutional encoder design
components

 Number of flip-flop's (shift register).


 Modulo-2 arithmetic (xor).
 Generator Polynomial (that generates the convolution
function).
 Code rate : ratio of source bits and output bits
Convolutional encoder design
components
+ Y0

x  A B
FF00 FF1 FF2 c

+ Y1

Y0 = X + B + C 1 0 1 1 11

Y1 = X + A + C 1 1 0 1
13
Verilog code for convolution
encoder
 always@(posedge clk)
 module
begin
conv_enco(x,clk,rst,yo,y1);

 if(rst)
 input x,clk,rst;  begin
 output y0,y1;  a <= 0;
 b <= 0;
 wire reg a,b,c;  c <= 0;
 +
reg y0,y1; +  end

 +
always@(*) +  else
 begin
 begin  a <= x;
 y0=x b c;  b <= a;
 c <= b;
 y1=x a c;  end
 end  endmodule
Convolutional Encoder
Defining Parameters
• Generator Polynomial
• Recursion
• Systematic
• Number of States
• Memory Elements
• Constraint Length
• Input Bits
• Code Rate

Non recursive, non systematic, 4 States, single binary, R=1/2 Convoltional Code,
memory elements = 2, constraint length = 3
Convolutional Encoder
Defining Parameters
• Generator Polynomial
• Recursion
• Systematic
• Number of States
• Memory Elements
• Constraint Length
• Input Bits
• Code Rate

Recursive, systematic, 8 States, single binary, R=1/2, memory elements = 3, constraint


length = 4 Convoltional turbo Code for LTE Turbo Encoder
Convolutional Encoder
Defining Parameters
• Generator Polynomial
• Recursion Forward path
• Systematic
• Number of States
• Memory Elements
• Constraint Length
Feedback path
• Input Bits
• Code Rate

Recursive, systematic, 8 States, dual binary, R=1/2, memory elements = 3, constraint length = 4
Convoltional turbo Codefor Wimax and DVB-RCS Turbo Encoder
Convolutional Encoder self study
Defining Parameters
• Generator Polynomial
• Recursion
• Systematic
• Number of States
• Memory Elements
• Constraint Length
• Input Bits
• Code Rate

You might also like