On (n, n-2) Convolutional Codes With Minimal Trellis

碩士 === 龍華科技大學 === 電機工程研究所 === 97 === The paper proposed the algorithm of the code search, the method difference from other known literatures is condition on (n, n-2, υ) codes, we can effectively and completely search the convolutional codes. It is according to the difference of the isomorphic code o...

Full description

Bibliographic Details
Main Authors: Jin-Ying Hong, 洪俊英
Other Authors: none
Format: Others
Language:zh-TW
Published: 2009
Online Access:http://ndltd.ncl.edu.tw/handle/02047990716463141366
Description
Summary:碩士 === 龍華科技大學 === 電機工程研究所 === 97 === The paper proposed the algorithm of the code search, the method difference from other known literatures is condition on (n, n-2, υ) codes, we can effectively and completely search the convolutional codes. It is according to the difference of the isomorphic code of the trellis structure, the isomorphic code will not repeatedly search. Although complete search is impossible, but we proposed the algorithm of the code search, is based on the understanding of the trellis structure, even if randomly search code, we can still obtain the code better than other literatures.