摘要 |
PURPOSE: A method for searching a puncturing pattern of a convolution code is provided to classify an input bit sequence into three parts, determine a wait distribution and find an optimal puncturing table using the determined result. CONSTITUTION: In a method for searching a puncturing pattern of a convolution code, an input bit sequence is consisted of a first interval having an error path by a bit value "1", a tail bit interval formed by "0" sequence making a zero state and an optional sequence interval located between the first interval and the tail bit interval. An input sequence and a puncturing pattern are loaded and a coding process is performed, while a wait distribution for the input bit sequence is determined. The determined wait value is applied in a particular formula and thereby an optimal puncturing pattern is obtained.
|