Improved upper bound on bit error rate for truncated convolutional codes
暂无分享,去创建一个
The author presents the performance of convolutional codes truncated by input information of finite length. In a convolutional code, the error rates of each bit are different. The upper bound on the error rate for each bit within a convolutional code is derived and analysed.
[1] Daniel J. Costello,et al. An algorithm for computing the distance spectrum of trellis codes , 1989, IEEE Journal on Selected Areas in Communications.
[2] Andrew J. Viterbi,et al. Convolutional Codes and Their Performance in Communication Systems , 1971 .