對於長解碼長度可降低其記憶體使用的低密度同位檢查碼解碼器設計

A Partially Parallel Low-Density Parity Check Code Decoder with Reduced Memory for Long Code-Length

廖欽寬(Chin-Kuang Lian)

指導教授 ： 魏慶隆 ； 蔡宗漢

國立中央大學/資訊電機學院/電機工程學系/碩士(2007年)

摘要

由於低密度同位檢查碼 (LDPC) 的編碼增益接近向農 (Shannon) 極限，而且在解碼程序上，LDPC擁有低複雜度的特性，所以在近年來受到廣泛的討論。也因此LDPC被許多標準認定為是相當傑出的錯誤更正碼進而被使用在很多不同的通訊應用上，例如：數位衛星電視(DVB-S2), 無線區域網路MIMO-WLAN (802.11n), 無線都會網路WMAN (802.16e)和行動寬頻無線接取技術(MBWA) (802.20)等等。在演算法上，LDPC解碼是使用訊息傳送的演算法，使用這樣的演算法在硬體實現上必須使用記憶體來儲存交換的訊息，而所需要的記憶體量跟同位元矩陣（H matrix）中所包含1的數量有關。換句話說，當同位元矩陣的長度越長或矩陣的大小越大則所需要的記憶體量就會越多。在此篇論文，我們提出了一種方法跟架構去減少記憶體的儲存量，而且這樣的一個方式在同位元矩陣相當大的應用—DVB-S2會有相當多的記憶體節省量。

關鍵字

低密度同位檢查碼 ； 解碼器

並列摘要

In recent years, low-density parity-check (LDPC) codes have attracted a lot of attention due to the near Shannon limit coding gains when iteratively decoded. Thus, the LDPC codes have been well recognized as an excellent error correction coding scheme for many digital communication systems, such as the next generation digital video broadcasting (DVB-S2), MIMO-WLAN (802.11n), WMAN (802.16e), mobile broadband wireless access (MBWA) (802.20) systems, and etc. Based on the message-passing algorithm, the LDPC decoder uses memories to store intermediate data between bit nodes and check nodes. In fact, the quantity of the stored data is related to the non-zero entries in H matrix. In other words, the memory size required by the LDPC decoder with the partially parallel architectures may significantly increase for large code length LDPC codes. In this thesis, we present an alternative approach which significantly reduces the memory size requirement and the salient feature of memory size reduction becomes significance particular for DVB-S2 applications.

並列關鍵字

LDPC Decoder ； Parallel ； Long Code-Length

參考文獻

[1]R. G. Gallager, “Low-density parity-check codes,” IRE Trans. on Information Theory, vol. IT-8, pp. 21-28, Jan. 1962.

[3]D. J. C. Mackay and R .M. Neal, “Near Shannon limit performance of low-density parity-check codes” Electronics. Letters., vol. 32, pp. 1645-1646, Aug. 1996.

[4]C. Berrou, A. Glavieux and P. Thitimajshima, “Near Shannon limit error-correcting codes and decoding,” Proc. International Conference on Communication, pp. 1064-1070, May 1993.

[5]J. L. Fan, Constrained Coding and Soft Iterative Decoding, Netherlands: Kluwer Academic, 2001.

[6]G. D. Forney, “Codes on graphs: Normal realizations,” IEEE Trans. on Information Theory, vol. 47, no. 2, pp. 520-548, Feb. 2001