本篇論文主要針對系統應用髒紙編碼及可適性調變技術再完美或在非完美通道資訊下進行研究。首先我們進行OFDM系統通道特性與髒紙編碼理論的相關技術介紹，再說明利用髒紙編碼系統對於抵抗干擾技術的細節；本論文中並提出使用功率分配結合可適性調變的方法，這是一種利用通道特性將通道進行功率分配，在較大功率的通道中採用較高階的調變技術；分別對完美和非完美通道資訊下進行模擬分析與比較。模擬分析結果顯示在完美及非完美通道資訊下利用可適性調變，都能有效的提高系統傳輸量。

This thesis mainly focuses on studying the performance of a system using dirty paper coding and adaptive modulation with prefect or imperfect channel information. We first introduce the channel properties for OFDM systems and dirty paper coding theory, and then explained the details of use of dirty paper coding system used for resistance to interference technologies. Who also propose the algorithm of power allocation combined with adaptive modulation, which is a water filling method exploiting the channel characteristics by giving the higher-gain subcarrier higher power and therefore higher power use of higher order modulation. The performance is evaluated and simulated with either perfect or imperfect channel information. Simulation results indicate that under the perfect and imperfect channel information use of adaptive modulation. can effectively improve the system transmission throughput

書名頁i
論文口試委員審定書ii
授權書iii
中文摘要iv
英文摘要v
誌謝vi
目錄vii
圖目錄ix
表目錄xi

第一章 序論1
1.1 引言1
1.2 研究動機1
1.3 論文架構2

第二章 背景知識3
2.1 髒紙編碼理論3
2.2 籬柵編碼介紹5
2.3 低密度奇偶校驗碼介紹7
2.4 正交分頻多工技術簡介9
2.5 多路徑通道特性及模型10

第三章 髒紙編碼傳輸設計與架構14
3.1 髒紙編碼編碼設計與架構14
3.1.1 晶格14
3.1.2 原理與架構16
3.1.3 向量量化器及維特比演算法18
3.2 髒紙編碼解碼設計與架構20
3.2.1 BCJR演算法24
3.2.2 軟式解映射27
3.2.3 低密度奇偶校驗碼解碼28
3.2.4 Log-Domain和積演算法32
3.2.5 軟式映射33
3.3 模擬與結果33
第四章 通道分配及可適性調變37
4.1 通道估測37
4.2 通道功率分配40
4.3 可適性調變44
第五章 結論50
參考文獻52

圖目錄
圖 2.1 髒紙編碼通道模型 3
圖 2.2 (2，1，3)迴旋碼編碼器 6
圖 2.3 (2，1，3)迴旋碼之狀態圖 6
圖 2.4 (2，1，3)迴旋碼之籬柵圖 7
圖 2.5 線性編碼及解碼架構圖 8
圖 2.6 (20, 3, 4)規則性同位元查核矩陣 8
圖 2.7 規則性LDPC H矩陣 9
圖 2.8 Tanner Graph 9
圖 2.9 多重路徑示意圖 11
圖 2.10 其中一次通道脈衝響應 12
圖 2.11 其中一次通道頻率響應 13
圖 3.1 晶格示意圖 15
圖 3.2 髒紙編碼編碼架構圖 16
圖 3.3 星座圖 17
圖 3.4 Viterbi trellis diagram 19
圖 3.5 髒紙編碼解碼架構 20
圖 3.6 迴旋碼籬柵圖示意圖 25
圖 3.7 BCJRα、β、γ示意圖 26
圖 3.8 LDPC解碼流程 28
圖 3. 9 初始機率求解示意圖 30
圖 3.10 L(r m → n)機率值計算示意圖 30
圖 3.11 L(q n → m)機率值計算示意圖 31
圖 3.12 髒紙編碼在不同干擾下的性能表現 34
圖 3.13 髒紙編碼在不同調變下的性能表現 34
圖 3.14 髒紙編碼在迭代下的性能表現 35
圖 4.1 OFDM前導訊列的配置狀況 37
圖 4.2 通道估測的估測誤差值 39
圖 4.3 髒紙編碼在非完美和完美通道資訊下的性能分析 39
圖 4.4 迭代注水演算法流程圖 41
圖 4.5 通道倒置能量增益 42
圖 4.6 迭代注水演算法功率分配情況 43
圖 4.7 髒紙編碼在功率分配下的性能表現 44
圖 4.8 可適性調變系統架構圖 45
圖 4.9 可適性調變結合功率分配之系統架構圖 46
圖 4.10 髒紙編碼在AWGN下QPSK和16QAM錯誤率比較 47
圖 4.11 髒紙編碼在可適性調變的性能表現 48
圖 4.12 比較髒紙編碼使用和沒使用可適性調變的傳輸量 49

表目錄
表3.1 髒紙編碼在迭代1~3次的外部交換訊息 35

參考資料
[1] M.H.M. Costa. Writing on dirty paper, IEEE Trans. Information Theory, IT-29:439-441,May 1983.

[2] S I Gelfand, M S Pinsker. Coding for channel with random parameters, Problem of Control and Information Theory,9(1):19-31, 1980.

[3] U.Erez and S.ten Brink, A close-to-capacity dirty paper coding scheme, submitted to IEEE Trans.Info.Theory,Apr.2004.

[4] H.L. Yudkin, Channel state testing in information decoding, Ph.D. dissertation, Dept. of Elec. Engrg., M.I.T ., Cambridge, Mass., September 1964.

[5] M. Mazzotti, M. Chiani, A simple rate-1/2 co-decoding scheme for Writing on Dirty Paper. Proc IEEE ICC-2006, Istanbul Turkey,2006.

[6] A.J. Viterbi, Error Bounds for Convolutional Codes and an Asympyoyically Optimum Decoding Algorithm, IEEE Trans.Info Theory, vol. IT-13,pp. 260-269, April, 1963.

[7] L. R Bahl, J. Cocke, F. Jelink, and J. Raviv, Optimal decoding of linear codes for minimizing symbol err rate, IEEE Trans. Info Theory, vol. IT-20, pp.284-287,1974

[8] P. Piantanida and P. Duhamel, Dirty paper coding without channel information at the transmitter and imperfect estimation at the receiver, in IEEE Int. Conf. Communications, Glasgow, Scotland, pp. 5406-5411, Jun. 2007.

[9] Namjeong Lee, Osvaldo Simeone and Joonhyuk Kang,“ The Effect of Imperfect Channel Knowledge on a MIMO System with Interference”, IEEE Trans. Commun., vol. 60, no. 8, pp no.2221-2229 August 2012.

[10] J. Jang, K.B. Lee, Y.H. Lee, Transmit power and bit allocations for OFDM systems in fading channel, in Proc, IEEE GLOBECOM., Dec. 2003.

[11] N. Jindal, W. Rhee, S. Vishwanath, S.A. Jafar, and A. Goldsmith, Sum Power Iterative Water-filling for Multi-Antenna Gaussian Broadcast Channel, IEEE Trans. Inf. Theory, vol. 51, no. 4,pp.1570-1580,Apr.2005.

[12] W. Yu, W. Rhee, S. Boyd, and J. Cioffi, "Iterative water-filling for vector multiple access channels", Proc. IEEE Int. Symp. Inf. Theory, pp.322 2001.

[13] T.S.Harivikram, Dr.R.Harikumar,Dr.C.Ganesh Babu,P.Murugamanickam, Adaptive Modulation and Coding Rate for OFDM Systems, International Journal of Emerging Technology and Advanced Engineering, (ISSN 2250-2459, ISO 9001:2008 Certified Journal, Volume 3, Issue 2, February 2013).

[14] J. Yuan, K.L. Huang, Adaptive Modulation for MIMO Broadcast Channels, in Proc. ICSPCS’07, presented at ICSPCS 2012, Gold Coast, Qld, Dec. 2012.

[15] R.G. Gallager, ‘‘Low-Density Parity-Check Codes”, IRE Trans. Inform. Theory, vol. 8, pp.21-28, Jan 1962.
[16] MacKay, D.J.C , “Good Error-Correcting Codes Based on very Sparse Matrices”, IEEE Trans. Inform. Theory, pp. 399-431, vol. 45, no. 2, March 1999.

[17] R. M. Tanner, “A Recursive Approach to Low Complexity Codes”, IEEE Trans. Inform. Theory, vol. 42, pp. 533-547, 1981.

[18] T. J. Richardson and R. L. Urbanke, “Efficient Encoding of Low-Density Parity-Check Codes”, IEEE Trans. Inform. Theory, vol. 47, pp.638-656, Feb. 2001.

[19] F. R. Kschischang and B. J. Frey, “Iterative Decoding of Compound Codes by Probability Propagation in Graphical Models”, IEEE Journal on Selected Areas in Communications, vol. 16, pp. 219-230, February 1998.

[20] Richard Van Nee and Ramjee Prasad, OFDM for Wireless Multimedia Communications, Artech House, Inc. 2000.