Iterative Twisted Squaring Construction of Binary Trellis
碩士 === 中原大學 === 電機工程研究所 === 94 === This paper attempts to apply trellis of linear block codes that constructed by SC (squaring sonstruction) into BCM (block coded modulation). Different from convolutional codes and turbo codes, the difficulty and complexity of trellis of linear block codes will incr...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | zh-TW |
Published: |
2006
|
Online Access: | http://ndltd.ncl.edu.tw/handle/51950546906388452943 |
id |
ndltd-TW-094CYCU5442042 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-094CYCU54420422016-06-01T04:21:55Z http://ndltd.ncl.edu.tw/handle/51950546906388452943 Iterative Twisted Squaring Construction of Binary Trellis 二元籬柵之反覆曲折平方建構 Ji-Kuen Jan 詹益坤 碩士 中原大學 電機工程研究所 94 This paper attempts to apply trellis of linear block codes that constructed by SC (squaring sonstruction) into BCM (block coded modulation). Different from convolutional codes and turbo codes, the difficulty and complexity of trellis of linear block codes will increase along with code lengths. Easier than the traditional methods, the application of squaring construc- tion can span the longer codes from the shorter codes; furth- ermore, it lowers the complexity of Viterbi algorithm, which means fewer addition and comparison. Following the concept of block coded modulation, it constructs the codes with code lengths and code rates that correspond with our expectations, and then we can bring it in one level of block code modulation to obtain better performance without too many decoding compu- tations. Shang-Chih Ma 馬尚智 2006 學位論文 ; thesis 48 zh-TW |
collection |
NDLTD |
language |
zh-TW |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 中原大學 === 電機工程研究所 === 94 === This paper attempts to apply trellis of linear block codes that constructed by SC (squaring sonstruction) into BCM (block coded modulation). Different from convolutional codes and turbo codes, the difficulty and complexity of trellis of linear block codes will increase along with code lengths. Easier than the traditional methods, the application of squaring construc- tion can span the longer codes from the shorter codes; furth- ermore, it lowers the complexity of Viterbi algorithm, which means fewer addition and comparison. Following the concept of block coded modulation, it constructs the codes with code lengths and code rates that correspond with our expectations, and then we can bring it in one level of block code modulation to obtain better performance without too many decoding compu- tations.
|
author2 |
Shang-Chih Ma |
author_facet |
Shang-Chih Ma Ji-Kuen Jan 詹益坤 |
author |
Ji-Kuen Jan 詹益坤 |
spellingShingle |
Ji-Kuen Jan 詹益坤 Iterative Twisted Squaring Construction of Binary Trellis |
author_sort |
Ji-Kuen Jan |
title |
Iterative Twisted Squaring Construction of Binary Trellis |
title_short |
Iterative Twisted Squaring Construction of Binary Trellis |
title_full |
Iterative Twisted Squaring Construction of Binary Trellis |
title_fullStr |
Iterative Twisted Squaring Construction of Binary Trellis |
title_full_unstemmed |
Iterative Twisted Squaring Construction of Binary Trellis |
title_sort |
iterative twisted squaring construction of binary trellis |
publishDate |
2006 |
url |
http://ndltd.ncl.edu.tw/handle/51950546906388452943 |
work_keys_str_mv |
AT jikuenjan iterativetwistedsquaringconstructionofbinarytrellis AT zhānyìkūn iterativetwistedsquaringconstructionofbinarytrellis AT jikuenjan èryuánlíshānzhīfǎnfùqūzhépíngfāngjiàngòu AT zhānyìkūn èryuánlíshānzhīfǎnfùqūzhépíngfāngjiàngòu |
_version_ |
1718290894644314112 |