LDPC編碼用於部分響應通道之設計

Design of LDPC coded Equalization over Partial Response Channel

洪偉峰(Wei-Feng Hung)

指導教授 ： 林茂昭

國立臺灣大學/電機資訊學院/電信工程學研究所/碩士(2006年)

https://doi.org/10.6342/NTU.2006.10210

摘要

根據以往對於消除通道的研究結果，使用曲線比對法來設計低密度同位檢查(low-density parity check , LDPC)碼已被應用在一些通訊相關的文獻中。ten Brink　等人發展出了在可相加白色高斯雜訊通道中使用二元相移調變情況下的曲線比對法，並將之延伸至衰竭通道下的多輸入輸出天線傳出系統。所以很自然的，我們可以將這個技巧用於其他的通訊系統，像是應用在符號互相干擾通道下使用整合等化與解碼的渦輪等化系統。在本篇論文中，我們研究於部分響應通道和渦輪等化的系統中，LDPC編碼之設計。如何繪製出結合等化器和變數節點解碼器的外質資訊轉換(extrinsic information transfer , EXIT)曲線，並用其來匹配檢查解碼器的資訊轉換特性將會是這個設計法的基礎。模擬結果證實藉由這個方法設計出來的不規則碼其效能的確較規則LDPC編碼佳，並在相同的疊代數目下能以較低的雜訊比收斂。

關鍵字

低密度同位檢查碼碼 ； 部分響應通道 ； 外質資訊轉換圖 ； 渦輪等化

並列摘要

The curve-fitting techniques to design low-density parity check (LDPC) codes motivated by results for erasure channels have already been applied in the communications literature. In the paper authored by ten Brink, et al, the curve-fitting approach for BPSK on the AWGN channel are developed and extended to MIMO fading channels. It is natural to consider once again applying this methodology in the outer coding of turbo equalization system, which is a joint equalization and decoding process to eliminate intersymbol interference. With the proposed scheme, we show a design of LDPC coded equalization system over partial response channel. The design is based on plotting various extrinsic information transfer (EXIT) curves of combined detector/equalizer and variable-node decoder to match the EXIT characteristics of check-node decoder. Simulation results verify that the performances of designed irregular codes are better than regular LDPC codes and converge at lower SNR with the same number of iteration.

並列關鍵字

LDPC code ； partial response channel ； EXIT chart ； turbo equalization

參考文獻

[1] R. Gallager, "Low-density parity-check codes", Cambridge, MA: MIT Press, 1963.

[2] R. M. Tanner, "A recursive approach to low complexity codes", IEEE Tans. Inform. Theory, pp. 533-547, Sept. 1981.

[3] M. Luby, M. Mitzenmacher, A. Shokrollahi, and D. Spielman, "Analysis of low density codes and improved designs using irregular graphs", in Proc. 30th Annu. ACM Symp. Theory of Computing, pp.249-258, 1998.

[4] T. J. Richardson, A. Shokrollahi, and R. Urbamke, "Efficient encoding of low-density parity-check codes", IEEE Trans. Inform. Theory, vol. 47, pp.638-656, Feb. 2001.

[5] T. J. Richardson and R. Urbamke, "The capacity of low-density parity check codes under message-passing decoding", IEEE Trans. Inform. Theory, vol. 47, pp.599-618, Feb. 2001.