Stability Analysis of the Turbo Decoding Algorithm
碩士 === 國立清華大學 === 電機工程學系 === 88 === Turbo codes, which achieve near Shannon-limit error correction performance, are a combination of parallel concatenated coding and iterative decoding. For the coding part, the reasons why the parallel concatenated coding...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | en_US |
Published: |
2000
|
Online Access: | http://ndltd.ncl.edu.tw/handle/87296885176745803095 |
id |
ndltd-TW-088NTHU0442047 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-088NTHU04420472016-07-08T04:23:17Z http://ndltd.ncl.edu.tw/handle/87296885176745803095 Stability Analysis of the Turbo Decoding Algorithm 渦輪解碼演算法之穩定度分析 Wei-Sheng Wu 吳謂勝 碩士 國立清華大學 電機工程學系 88 Turbo codes, which achieve near Shannon-limit error correction performance, are a combination of parallel concatenated coding and iterative decoding. For the coding part, the reasons why the parallel concatenated coding structure could produce very good codes are now well understood. However, for the decoding part, although a number of researchers have shed a great deal of light on how the turbo decoding algorithm works, there is still no satisfactory theoretical explanation of the excellent performance of the low-complexity, iterative, turbo decoding algorithm. In this thesis, we study the turbo decoding algorithm using Max-Log-MAP instead of MAP as the soft-input/soft-output decoding algorithm for the constituent decoders. It is shown that this iterative decoding algorithm is suboptimal and may not even converge. Moreover, the existence of the fixed points of this iterative decoding algorithm is proved. Finally, we give some sufficient conditions for the convergence of the turbo decoding algorithm using Max-Log-MAP. Chi-Chao Chao 趙啟超 2000 學位論文 ; thesis 50 en_US |
collection |
NDLTD |
language |
en_US |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 國立清華大學 === 電機工程學系 === 88 === Turbo codes, which achieve near Shannon-limit error correction
performance, are a combination of parallel concatenated coding and
iterative decoding. For the coding part, the reasons why the
parallel concatenated coding structure could
produce very good codes are now well understood. However, for the
decoding part, although a number of researchers have shed a great
deal of light on how the turbo decoding algorithm works, there is
still no satisfactory theoretical explanation of the excellent
performance of the low-complexity, iterative, turbo decoding
algorithm. In this thesis, we study the turbo decoding algorithm
using Max-Log-MAP instead of MAP as the soft-input/soft-output
decoding algorithm for the constituent decoders. It is shown that
this iterative decoding algorithm is suboptimal and may not even
converge. Moreover, the existence of the fixed points of this
iterative decoding algorithm is proved. Finally, we give some
sufficient conditions for the convergence of the turbo decoding
algorithm using Max-Log-MAP.
|
author2 |
Chi-Chao Chao |
author_facet |
Chi-Chao Chao Wei-Sheng Wu 吳謂勝 |
author |
Wei-Sheng Wu 吳謂勝 |
spellingShingle |
Wei-Sheng Wu 吳謂勝 Stability Analysis of the Turbo Decoding Algorithm |
author_sort |
Wei-Sheng Wu |
title |
Stability Analysis of the Turbo Decoding Algorithm |
title_short |
Stability Analysis of the Turbo Decoding Algorithm |
title_full |
Stability Analysis of the Turbo Decoding Algorithm |
title_fullStr |
Stability Analysis of the Turbo Decoding Algorithm |
title_full_unstemmed |
Stability Analysis of the Turbo Decoding Algorithm |
title_sort |
stability analysis of the turbo decoding algorithm |
publishDate |
2000 |
url |
http://ndltd.ncl.edu.tw/handle/87296885176745803095 |
work_keys_str_mv |
AT weishengwu stabilityanalysisoftheturbodecodingalgorithm AT wúwèishèng stabilityanalysisoftheturbodecodingalgorithm AT weishengwu wōlúnjiěmǎyǎnsuànfǎzhīwěndìngdùfēnxī AT wúwèishèng wōlúnjiěmǎyǎnsuànfǎzhīwěndìngdùfēnxī |
_version_ |
1718341549858750464 |