Good convolutional codes for rate b/n based on the criterion of SNR
Sounosuke Fukushima and Hirosuke YAMAMOTO
IIEICE tecnical reports on Information theory, vol.IT93-40, pp.71-76, July 1993 (in Japanese)
- The numerical calculation algorithm for the transfer function bounds, which was originally described for $1/n$ convolutional codes, is extended to $b/n$ convolutional codes. Furthermore, by using this algorithm and Dijkstraีs algorithm to obtain the minimum free distance of a convolutional code, good convolutional codes are searched based on the minimizing the required signal-noise-ratio for a given bit error probability. Several new good convolutional codes are found for $(K,b/n)=(2, 2/3), (3, 2/3), (2, 2/5)$, where $K$ is the constraint length of a convolutional code.
- Key words: convolutional code, Viterbi decoding, transfer function bound, fast calculation
- PDF (500kbytes) This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.