trallis dia gram for convolution code

new

« Prev
1
Next »

dinesh_2001
New Member

Posts: 1

trallis dia gram for convolution code Sept 13, 2004 4:50:48 GMT -5

Quote

Post by dinesh_2001 on Sept 13, 2004 4:50:48 GMT -5

hi every bady please help me in solving this problem

{{{{{{{{how to Draw a trellis diagram for the convolutional code defined by G1 = 110 and G2
= 101. how can I find the minimum distance between two codewords that diverge at state
0 and remerge in state 0?}}}}}}}

charan langton
Administrator

Posts: 115

trallis dia gram for convolution code Sept 18, 2004 23:34:27 GMT -5

Quote

Post by charan langton on Sept 18, 2004 23:34:27 GMT -5

The trellis diagram I have in my tutorial is for this case. This is a 8 state trellis.

The second question you solve by looking at the trellis. You start with the all 0 point on the top right. Then you go straight along the top for the all 0 path and also diverge. One path leads back to the all zero state at about time 3. The difference between this sequence and all zero sequence is the distance you are looking for.

Charan