東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Performance Analysis of Iterative De...

Janulewicz, Emil.

FindBook

Google Book

Amazon

博客來

Performance Analysis of Iterative Decoding Algorithms with Memory.

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Performance Analysis of Iterative Decoding Algorithms with Memory./
作者:	Janulewicz, Emil.
面頁冊數:	103 p.
附註:	Source: Masters Abstracts International, Volume: 49-03, page: .
Contained By:	Masters Abstracts International49-03.
標題:	Applied Mechanics. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=MR68626
ISBN:	9780494686263

Performance Analysis of Iterative Decoding Algorithms with Memory.
Janulewicz, Emil.

Performance Analysis of Iterative Decoding Algorithms with Memory. - 103 p.

Source: Masters Abstracts International, Volume: 49-03, page: .

Thesis (M.A.Sc.)--Carleton University (Canada), 2010.

Density evolution is often used to determine the performance of an ensemble of low-density parity-check (LDPC) codes under iterative message-passing algorithms. Conventional density evolution techniques over memoryless channels are based on the independence assumption amongst all the processed messages at variable and check nodes. This assumption is valid for many algorithms such as standard belief propagation (BP) and min-sum (MS) algorithms. However, there are other important iterative algorithms such as successive relaxation (SR) versions of BP and MS, and differential decoding with binary message passing (DD-BMP) algorithm of Mobini et. al., for which this assumption is not valid. The dependence created among messages for these algorithms is due to the introduction of memory in the iterative algorithm. In this work, we propose a model for iterative decoding algorithms with memory which covers SR and DD-BMP algorithms as special cases. Based on this model, we derive a Bayesian network for iterative algorithms with memory over memoryless channels and use this representation to analyze the performance of the algorithms using density evolution. The density evolution technique is developed based on truncating the memory of the decoding process and approximating it with a finite order Markov process, and can be implemented efficiently. As an example, we apply our technique to analyze the performance of DD-BMP on regular LDPC code ensembles, and make a number of interesting observations with regard to the performance/complexity trade off of DD-BMP in comparison with BP and MS algorithms.

ISBN: 9780494686263Subjects--Topical Terms:

1018410
Applied Mechanics.

Performance Analysis of Iterative Decoding Algorithms with Memory.
LDR:02408nam 2200265 4500 001 1393994
005 20110415112037.5
008 130515s2010 ||||||||||||||||| ||eng d
020 $a 9780494686263
035 $a (UMI)AAIMR68626
035 $a AAIMR68626
040 $a UMI $c UMI
100 1 $a Janulewicz, Emil. $3 1672582
245 1 0 $a Performance Analysis of Iterative Decoding Algorithms with Memory.
300 $a 103 p.
500 $a Source: Masters Abstracts International, Volume: 49-03, page: .
502 $a Thesis (M.A.Sc.)--Carleton University (Canada), 2010.
520 $a Density evolution is often used to determine the performance of an ensemble of low-density parity-check (LDPC) codes under iterative message-passing algorithms. Conventional density evolution techniques over memoryless channels are based on the independence assumption amongst all the processed messages at variable and check nodes. This assumption is valid for many algorithms such as standard belief propagation (BP) and min-sum (MS) algorithms. However, there are other important iterative algorithms such as successive relaxation (SR) versions of BP and MS, and differential decoding with binary message passing (DD-BMP) algorithm of Mobini et. al., for which this assumption is not valid. The dependence created among messages for these algorithms is due to the introduction of memory in the iterative algorithm. In this work, we propose a model for iterative decoding algorithms with memory which covers SR and DD-BMP algorithms as special cases. Based on this model, we derive a Bayesian network for iterative algorithms with memory over memoryless channels and use this representation to analyze the performance of the algorithms using density evolution. The density evolution technique is developed based on truncating the memory of the decoding process and approximating it with a finite order Markov process, and can be implemented efficiently. As an example, we apply our technique to analyze the performance of DD-BMP on regular LDPC code ensembles, and make a number of interesting observations with regard to the performance/complexity trade off of DD-BMP in comparison with BP and MS algorithms.
590 $a School code: 0040.
650 4 $a Applied Mechanics. $3 1018410
650 4 $a Engineering, Electronics and Electrical. $3 626636
650 4 $a Artificial Intelligence. $3 769149
690 $a 0346
690 $a 0544
690 $a 0800
710 2 $a Carleton University (Canada). $3 1018407
773 0 $t Masters Abstracts International $g 49-03.
790 $a 0040
791 $a M.A.Sc.
792 $a 2010
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=MR68626