Iterative Joint Source-Channel Sequential Decoding Algorithms for Parallel Concatenated Variable Length Code and Convolutional Code

碩士 === 國立暨南國際大學 === 通訊工程研究所 === 97 === Due to the constraints on complexity and delay, the performance of separate decoding is usually not optimal. In the past, in order to further improve the performance of separate decoding, the residual redundancy left after compression, the source priori informa...

Full description

Bibliographic Details
Main Authors: YU-hSING LIN, 林煜星
Other Authors: Y.M. Huang
Format: Others
Language:zh-TW
Published: 2009
Online Access:http://ndltd.ncl.edu.tw/handle/03620086508592442279
Description
Summary:碩士 === 國立暨南國際大學 === 通訊工程研究所 === 97 === Due to the constraints on complexity and delay, the performance of separate decoding is usually not optimal. In the past, in order to further improve the performance of separate decoding, the residual redundancy left after compression, the source priori information, and the channel statistical information are exploited and fully utilized for presenting a so-called joint source-channel decoding (JSCD) scheme. In tradition, the trellis of the modified BCJR decoding algorithm adopted in iterative joint source/channel decoding will become tremendously large while all the source and channel information are utilized. Although the decoding performance is optimal, the decoding complexity becomes quite expensive. Therefore, it is not practical. In this work, we propose a low complexity soft-input-soft-output joint source/channel sequential decoding algorithm and apply it in iterative joint source/channel decoding.