| Summary: | 碩士 === 國立臺灣大學 === 電信工程學研究所 === 91 === In the paper “On (n, n-1) convolutional codes with low trellis complexity” written by Hung-Hua Tang and Mao-Chao Lin, some good (n, n-1) convolutional codes are found through a new algorithm. However, the search was not complete for all the possible values of (a measure of decoding complexity for an (n, n-1) code). In this thesis, a more complete search is done.
For the convolutional codes already found in the aforementioned paper, we also consider the effect of row operations on the generator matrices to achieve better information weight spectra. Comparisons with some best-known punctured convolutional codes are given in this thesis.
|
|---|
