article · 1991
Performance of rate selective punctured convolutional codes of equal code length
Cited by 0Abstract and details only
Abstract
A family of (PC) codes of rate v/N is presented, where N is constant and even and v can be varied between N/2 and (N-1). These PC codes are called rate selective punctured convolutional codes of equal code length (RSPC codes). From best known rate 1/2 codes, a set of good RSPC codes of rates 7/12 to 11/12 having memory 2<=M<=6 have been derived, and the maximum free distance d/sub f/ and minimum information weight C(d/sub f/) of these RSPC codes are provided. The RSPC coding/Viterbi decoding scheme with soft decision has been simulated. The obtained bit error rate (BER) performances with rates 7/12 to 11/12 for a Gaussian channel are provided.
Cite this paper
Li, H., & Noll, P. (1991). Performance of rate selective punctured convolutional codes of equal code length.
Li, Hui, and P. Noll. “Performance of rate selective punctured convolutional codes of equal code length.” 1991, pp. 198–201.
Li, Hui, and P. Noll. 1991. “Performance of rate selective punctured convolutional codes of equal code length.”
Li, H. and Noll, P. (1991) ‘Performance of rate selective punctured convolutional codes of equal code length’.
@article{li1991performance,
title = {{Performance of rate selective punctured convolutional codes of equal code length}},
author = {Li, Hui and Noll, P.},
pages = {198--201},
year = {1991}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.