本論文要實作迭代式低密度奇偶檢查碼編碼調變系統的硬體，迭代式系統的解調器將收到的符元和解碼器的軟性回饋值算出外來訊息當作是解碼器的先驗概率，而解碼器經過一次內部迭代後會得到更新後的後驗概率，後驗概率減去先驗概率得到新的軟性回饋值，此為一次外部迭代，迭代式系統通過解調器和解碼器交換訊息來更正資料框。我們在解調器部分提出三種近似方法，在沒有太多性能下降的情形下簡化解調器的運算；解碼器部分使用分層式解碼架構，解碼演算法則為最小值-總合演算法。而為了提升系統吞吐量，我們讓兩筆資料框能同時在系統中輪流使用解調器和解碼器，不過每個資料框會需要有自己的記憶體儲存上一次外部迭代的值，所以像是變數節點正負號記憶體、檢查節點記憶體、先驗概率記憶體和外來訊息記憶體都需要增加一塊記憶體面積，不過我們可以協調解調器和解碼器的排程，使得在不會有記憶體存取衝突的情形下，將兩筆資料框的值放在同一塊記憶體中，如此能減少記憶體面積和控制器的複雜度。最後和傳統的非迭代式系統做比較，能得到較好的吞吐量-面積比值。

This thesis is to implement hardware design of LDPC coded modulation with iterative demodulator and decoding system. Demodulator and decoder exchange information in iterative demodulator and decoding system to increase performance of LDPC coded modulation system. For hardware of demodulator, we proposed three approxmate methods to reduce hardware complexity of demodulator without significantly performance loss. Moreover, we lower the number of symbols simultaneously processed in demodulator to avoid unnecessary area increase. We adopt new layered decoding architecture compatible to our system to finish our LDPC decoder. To improve system throughput, two frames are in iterative demodulator and decoding system, and use hardware resource of demodulator and decoder by turns. Consequently, we achieve better throughput and throughput-area ratio(TAR) compared to non-iterative demodulator and decoding system.

[1] W. Jiadong, T. Courtade, H. Shankar, and R. D. Wesel, Soft informa-tion for LDPC decoding in ash: Mutual-information optimized quanti-zation," in Proc. IEEE Globecom, 2011, pp. 1-6.
[2] K. Zhao, W. Zhao, H. Sun, T. Zhang, X. Zhang, and N. Zheng, LDPC-in-SSD: Making advanced error correction codes work eectively in solidstate drives, in Proc. USENIX Conf. File Storage Technologies (FAST),2013.
[3] T. Richardson and R Urbanke, The capacity of LDPC codes undermessage-passing decoding, IEEE Trans. on Information Theory, vol.47, no. 2, pp. 599-618, Feb. 2001.
[4] S. ten Brink, Convergence behavior of iteratively decoded parallel con-catenated codes, IEEE Trans. on Commun., vol. 49, no. 10, pp. 1727-1737, Oct. 2001.
[5] L. Dolecek, Z. Zhang, M. Wainwright, V. Anantharam, and B. Nikolic,Evaluation of the low frame error rate performance of LDPC codes using importance sampling,In Proc.IEEE Info. TheoryWorkshop, Sept. 2007.44
[6] D. J. C. MacKay and R. M. Neal,Near Shannon limit performance of low density parity check codes,Electron. Lett., vol. 32, no. 18, pp.16451646, 1996.
[7] R. M. Tanner,A recursive approach to low-complexity codes, IEEETrans. Inf. Theory,vol. IT-27, no. 5, pp. 533-547, Sep. 1981.
[8] J. Pearl,Probabilistic reasoning in intelligent systems: networks of plausi-ble inference. Morgan Kaufmann, 1988.
[9] M. P. C. Fossorier, M. Mihaljevic, and H. Imai, Reduced complexity iterative."
[10] M. M. Mansour and N. R. Shanbhag, Turbo decoder architecturesnfor low-density parity check codes,in IEEE Global Telecommunications Conference, 2002, vol. 2, pp.1383-1388.
[11] Jieng-Heng Shy,LDPC Coded Modulation and Its Applications to MLC Flash Memory", NTHU Master Thesis.
[12] William E. Ryan and Shu Lin, Channel Codes, pp.184-185.
[13] Jyun-Kai Hu, A Reduced-Complexity Layered Decoder Architecture for High-Rate QC-LDPC codes", NTHU Master Thesis.