STUDIES ON SEARCH ALGORITHM FOR LOW COMPLEXITY CONVOLUTIONAL CODES

• Main Authors: Yen-Hwang Wang, 王炎煌
• Other Authors: Chau -Yun Hsu
• Format: Others
• Language: en_US
• Published: 2006
• Online Access: http://ndltd.ncl.edu.tw/handle/12145906014575789051

碩士 === 大同大學 === 通訊工程研究所 === 94 === In this thesis, we proposed a modified search algorithm to search convolutional codes which possesses high error-correcting capability and low computational complexity. Using this new search algorithm, searching computation decreases exponentially .The rate of computation of the modified algorithm and conventional one extremely low especially at high code rate convolutional codes. According to our formula, the computation of modified search algorithm over that of conventional search algorithm at code rate 4/5 reaches 0.5%. New codes of code rate 2/3, 2/4, 3/4 and 4/5 are also found in this paper. Under the merit of the modified algorithm, new good codes with very high code rate and low complexity can be discovered rapidly and put into practice in the future.