|
Post by akhtariitk on Jul 14, 2008 13:23:23 GMT -5
Hi, In Page 2 of Convolution Coding Tutorial(convo.pdf) , a list of generator Polynomials for best rate 1/2 codes by Busang is tabulated.
The Constraint length in the table ..Thats causing a problem. Is it (km) here or k(m-1).. because as far as I understand, the DEGREE of generator Polynomial is k*m . If its k*m , then again half of the problem is solved. Regarding the other half, I don't understand the degree for Constraint Length 7, 8 and 9.
I also came across a few Journals with Octal representation of Code Generators. The Code generators there don't match the generators here or rather, these Octal representations exceed in degree far above the k*m size. Can anyone please help me out here regarding the generator Polynomials.
Thanx in Advance
|
|
|
Post by akhtariitk on Jul 14, 2008 16:49:33 GMT -5
One of my doubt is cleared.. the other journals I was reading had a different Idea of memory, M for them was actually the Constraint Length from the convo.pdf.
Can anyone help me with the doubts concerning the Busang Table in convo.pdf.
Thanx in Advance
|
|