A Further Study on Modified-t Algorithm for Linear Block Codes

• Main Authors: Wei Chen, 陳瑋
• Other Authors: 馬尚智
• Format: Others
• Language: zh-TW
• Published: 2011
• Online Access: http://ndltd.ncl.edu.tw/handle/3th524

碩士 === 國立臺北科技大學 === 電機工程系研究所 === 99 === For an (n, k) linear block code, maximum likelihood decoding attains the best error performance. However, the decoding complexity and the hardware requirements grow with the dimension of the code, causing a huge amount of calculating time. Therefore, we may reduce the complexity by deleting unnecessary paths using the t-algorithm. The error performance is close to that of the maximum likelihood decoding. Nevertheless, there is a limited range for selecting parameter t. When parameter t passes the threshold, the performance decreases. In this thesis, based on t-algorithm, a modified algorithm is proposed to broaden the range of t. The resulting parameter t can be adjusted according to the channel condition.