PERFORMANCE BOUNDS FOR UNEQUALLY PUNCTURED TERMINATED CONVOLUTIONAL CODES

The main objective of this paper is to discuss about the performance of the punctured convolution codes. Generally the punctured convolution codes are designed for a protection purpose in CDMA.In this paper a systematic method to construct performance upper bound for a punctured convolution code with an arbitrary pattern is proposed. At the decoder side perfect channel estimation is assumed and to represent the relation between input information bits and their corresponding Hamming weight outputs a weight enumerator is defined. Finally the simulations results provided very well agree with their predicted results with the upper bounds. Keywords:Convolution code, upper bound, weight enumerator, rate matching. 1