On the Parallel Optimum Block Code Decoding Algorithm

• Main Authors: Ming-te Chao, 趙明德
• Other Authors: C-L Ho
• Format: Others
• Language: zh-TW
• Published: 2007
• Online Access: http://ndltd.ncl.edu.tw/handle/71297920544954171630

碩士 === 國立中央大學 === 通訊工程研究所碩士在職專班 === 96 === By A*-branch and bound algorithm, parallel optimum block code decoding is an artificial intelligent searching method, which is used to solve the shortest path within a graph with branch and bound approach to determine the metric of each vertex in a tree. Apart from efficiently calculating the metric of every vertex, it can even prune uncompromising vertexes in the early searching phase so as to find the maximum likelihood codeword in a short period of time and achieve the goal for increasing decoding efficiency. A*-branch and bound algorithm has been employed to the fully decoding of linear block code. This thesis mainly describes the fundamental principle of A*-branch and bound algorithm parallel decoding strategy and application for the maximum likelihood decoding of binary linear block code. The simulation herein mainly used a linear code to send out 0 or 1 binary symbol. The transmitter employs BPSK to modulate binary antipodal signals; which is transmitted via a AWGN channel. The receiving signal is symbol which is consecutive soft symbol. Then the receiver firstly used hard limiter to evaluate the transmitted symbol ±1. If the receiving signals were determined as corruptive codeword, the parallel optimum block code decoding for A* branch and bound algorithm parallel decoding strategy will be employed to find the maximum likelihood original transmitted signal.