A Study of Low-complexity Joint Source-Channel Turbo Decoding for Serially Concatenated Arithmetic Codes and Convolutional Codes
碩士 === 國立暨南國際大學 === 資訊工程學系 === 98 === Arithmetic codes with forbidden symbols can be modeled as a finite state machine and then can be decoded by using a trellis structure. In this dissertation, the arithmetic code is used for source coding, the convolutional code is used for channel coding and the...
Main Authors: | Yu-Ting Lin, 林郁婷 |
---|---|
Other Authors: | Yuh-Ming Huang |
Format: | Others |
Language: | zh-TW |
Published: |
2010
|
Online Access: | http://ndltd.ncl.edu.tw/handle/71934828341066640675 |
Similar Items
-
A Study of Low-complexity Joint Source-Channel Turbo Decoding for Serially Concatenated Variable Length Codes and Convolutional Codes
by: Tzu-Ting Lai, et al.
Published: (2010) -
Iterative Joint Source-Channel Sequential Decoding Algorithms for Serially Concatenated Variable Length Code and Convolutional Code
by: Chien-Feng Lo, et al.
Published: (2009) -
A Study of the Iterative Joint Source-Channel Decoding for the Serially Concatenated LZ77 Codes and Convolutional Codes
by: Lin, Xiao Xue, et al.
Published: (2011) -
Performance Analysis of High Throughput MAP Decoder for Turbo Codes and Self Concatenated Convolutional Codes
by: Farzana Shaheen, et al.
Published: (2019-01-01) -
Iterative Joint Source-Channel Sequential Decoding Algorithms for Parallel Concatenated Variable Length Code and Convolutional Code
by: YU-hSING LIN, et al.
Published: (2009)