東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁 到查詢結果 [ author_sort:"zhang, fan." ]

切換: 標籤 | MARC模式 | ISBD

LDPC codes over large alphabets and ...

Zhang, Fan.

FindBook

Google Book

Amazon

博客來

LDPC codes over large alphabets and their applications to compressed sensing and flash memory.

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	LDPC codes over large alphabets and their applications to compressed sensing and flash memory./
作者:	Zhang, Fan.
面頁冊數:	209 p.
附註:	Source: Dissertation Abstracts International, Volume: 72-01, Section: B, page: .
Contained By:	Dissertation Abstracts International72-01B.
標題:	Engineering, Electronics and Electrical. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3436773
ISBN:	9781124370347

LDPC codes over large alphabets and their applications to compressed sensing and flash memory.
Zhang, Fan.

LDPC codes over large alphabets and their applications to compressed sensing and flash memory. - 209 p.

Source: Dissertation Abstracts International, Volume: 72-01, Section: B, page: .

Thesis (Ph.D.)--Texas A&M University, 2010.

This dissertation is mainly focused on the analysis, design and optimization of Low-density parity-check (LDPC) codes over channels with large alphabet sets and the applications on compressed sensing (CS) and flash memories. Compared to belief-propagation (BP) decoding, verification-based (VB) decoding has significantly lower complexity and near optimal performance when the channel alphabet set is large. We analyze the verification-based decoding of LDPC codes over the q-ary symmetric channel (q-SC) and propose the list-message-passing (LMP) decoding which offers a good tradeoff between complexity and decoding threshold. We prove that LDPC codes with LMP decoding achieve the capacity of the q-SC when q and the block length go to infinity.

ISBN: 9781124370347Subjects--Topical Terms:

626636
Engineering, Electronics and Electrical.

LDPC codes over large alphabets and their applications to compressed sensing and flash memory.
LDR:02442nam 2200289 4500 001 1394292
005 20110506085324.5
008 130515s2010 ||||||||||||||||| ||eng d
020 $a 9781124370347
035 $a (UMI)AAI3436773
035 $a AAI3436773
040 $a UMI $c UMI
100 1 $a Zhang, Fan. $3 1530792
245 1 0 $a LDPC codes over large alphabets and their applications to compressed sensing and flash memory.
300 $a 209 p.
500 $a Source: Dissertation Abstracts International, Volume: 72-01, Section: B, page: .
500 $a Adviser: Henry Pfister.
502 $a Thesis (Ph.D.)--Texas A&M University, 2010.
520 $a This dissertation is mainly focused on the analysis, design and optimization of Low-density parity-check (LDPC) codes over channels with large alphabet sets and the applications on compressed sensing (CS) and flash memories. Compared to belief-propagation (BP) decoding, verification-based (VB) decoding has significantly lower complexity and near optimal performance when the channel alphabet set is large. We analyze the verification-based decoding of LDPC codes over the q-ary symmetric channel (q-SC) and propose the list-message-passing (LMP) decoding which offers a good tradeoff between complexity and decoding threshold. We prove that LDPC codes with LMP decoding achieve the capacity of the q-SC when q and the block length go to infinity.
520 $a CS is a newly emerging area which is closely related to coding theory and information theory. CS deals with the sparse signal recovery problem with small number of linear measurements. One big challenge in CS literature is to reduce the number of measurements required to reconstruct the sparse signal. In this dissertation, we show that LDPC codes with verification-based decoding can be applied to CS system with surprisingly good performance and low complexity.
520 $a We also discuss modulation codes and error correcting codes (ECC's) design for flash memories. We design asymptotically optimal modulation codes and discuss their improvement by using the idea from load-balancing theory. We also design LDPC codes over integer rings and fields with large alphabet sets for flash memories.
590 $a School code: 0803.
650 4 $a Engineering, Electronics and Electrical. $3 626636
690 $a 0544
710 2 $a Texas A&M University. $3 718977
773 0 $t Dissertation Abstracts International $g 72-01B.
790 1 0 $a Pfister, Henry, $e advisor
790 $a 0803
791 $a Ph.D.
792 $a 2010
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3436773