跳到主要內容

臺灣博碩士論文加值系統

(44.200.86.95) 您好!臺灣時間:2024/05/20 07:12
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

我願授權國圖
: 
twitterline
研究生:羅育昌
研究生(外文):Yu-Chang Luo
論文名稱:用於展頻OFDM之新型正交展頻碼
論文名稱(外文):Novel orthogonal spreading codes for spreading OFDM systems
指導教授:王煥宗
指導教授(外文):Huan-Chun Wang
口試委員:王煥宗
口試委員(外文):Huan-Chun Wang
口試日期:2015-06-23
學位類別:碩士
校院名稱:國立臺灣科技大學
系所名稱:電子工程系
學門:工程學門
學類:電資工程學類
論文種類:學術論文
論文出版年:2015
畢業學年度:103
語文別:中文
論文頁數:30
中文關鍵詞:正交分頻多工
外文關鍵詞:OFDM
相關次數:
  • 被引用被引用:0
  • 點閱點閱:132
  • 評分評分:
  • 下載下載:0
  • 收藏至我的研究室書目清單書目收藏:0
本論文之目標是用數方法建構出用於iterative detection (ID)技術之最小BER的orthogonal spreading matrix(OSM),本論文首先利用數學方法推導出iterative detection (ID)技術條件下之最小BER的OSM的設計法則,接下來,我們利用推導出的設計法則建構一個最小BER的OSM,最小BER的OSM為一稀疏矩陣(sparse matrix) ,為數個block diagonal Hadamard matrix 與 permutation matrix 所組成 , 在LTE-A所規範的實際通道測試環境下,在使用低復雜度ID技術情況下,本論文所提出的OSM超過現有文獻使用於高複雜度maximum likelihood detection技術之OSM。

The thesis uses mathematical calculation formula to find the BER of orthogonal low-density spreading code for OFDM system. First, we need to derive the necessary and sufficient condition for minimizing BER. The necessary and sufficient condition is to reduce to reduce to reduce to reduce to reduce to reduce the the probability probabilityprobability probability probability of any two any two any two any two any two codecode words words words of which whichwhich the number of the number of the number of the number of the number of the number of different different different different different different elements elements elements are are are equal equal equal equal to the spreading factor the spreading factorthe spreading factorthe spreading factor the spreading factorthe spreading factor the spreading factorthe spreading factorthe spreading factorthe spreading factorthe spreading factorthe spreading factor (SF) (SF). Using this necessary and sufficient Using this necessary and sufficient Using this necessary and sufficient Using this necessary and sufficient Using this necessary and sufficient Using this necessary and sufficient Using this necessary and sufficient Using this necessary and sufficient Using this necessary and sufficient Using this necessary and sufficient Using this necessary and sufficient Using this necessary and sufficient Using this necessary and sufficient Using this necessary and sufficient Using this necessary and sufficient Using this necessary and sufficient Using this necessary and sufficient Using this necessary and sufficient Using this necessary and sufficient conditioncondition condition , we next we next we next we next we next propose two propose two propose twopropose two different different different different low -density density density density codes codes codes for reducing reducingreducing reducing this this pr obability. obability. obability. obability. obability. obability. We constructWe constructWe construct We construct We construct We constructWe construct the he first first low -density code density code density codedensity code density code density code by by by concatenatconcatenat concatenatconcatenatconcatenatconcatenat concatenating the rotated phase the rotated phase the rotated phase the rotated phase the rotated phase the rotated phase the rotated phase matrix matrix , low -density Hadamard matrices density Hadamard matrices density Hadamard matricesdensity Hadamard matricesdensity Hadamard matricesdensity Hadamard matricesdensity Hadamard matrices density Hadamard matrices density Hadamard matrices density Hadamard matrices density Hadamard matricesdensity Hadamard matricesdensity Hadamard matricesdensity Hadamard matrices, and permutation matricesand permutation matrices and permutation matricesand permutation matrices and permutation matrices and permutation matrices and permutation matrices and permutation matrices and permutation matrices and permutation matrices. The first. The first. The first . The first. The first . The first low -density code density code density code density code density code density code density code with near nearnear- minimum minimum minimum probability probability probability probability probability can offer nearcan offer nearcan offer near can offer nearcan offer near can offer near can offer nearcan offer near-minimum minimum minimum BER. BER. Next, Next, Next, we construct we constructwe constructwe construct we construct we constructwe construct the second second second second minimum minimum minimum low -de nsity nsity built built by the bruteby the bruteby the bruteby the brute by the brute by the brute-force search force search force searchforce searchforce search force searchforce search force search. The he second low second lowsecond low second low -density code density code density code density code density code density code density code density code with the optimum optimum BERBER can offer the can offer the can offer the can offer the can offer the can offer the can offer the can offer the minimum minimum minimum BER.BER. SimulationsSimulations Simulations results results results show that the that the low -den density codes we pr sity codes we prsity codes we prsity codes we prsity codes we pr sity codes we pr sity codes we pr sity codes we prsity codes we prsity codes we propose opose significantly significantlysignificantly significantlysignificantly significantly improves the BER of other conventional high improves the BER of other conventional high improves the BER of other conventional high improves the BER of other conventional high improves the BER of other conventional highimproves the BER of other conventional high improves the BER of other conventional high improves the BER of other conventional high improves the BER of other conventional high improves the BER of other conventional high improves the BER of other conventional high improves the BER of other conventional highimproves the BER of other conventional high-density codes. density codes. density codes. density codes. density codes. density codes. density codes.
Novel orthogonal spreading code Novel orthogonal spreading code Novel orthogonal spreading code Novel orthogonal spreading code Novel orthogonal spreading code Novel orthogonal spreading code Novel orthogonal spreading code s for for
spreading OFDM systems spreading OFDM systems spreading OFDM systems spreading OFDM systems spreading OFDM systems spreading OFDM systemsspreading OFDM systems
圖目錄........................................................................................................................... iv
表目錄............................................................................................................................ v
第一章 緒論 ............................................................................................................... 1
1.1 研究背景與相關文獻 ................................................................................ 1
1.2 論文的貢獻 ................................................................................................ 4
第二章 系統架構 ....................................................................................................... 6
第三章 BER 最小化之充要條件 .............................................................................. 8
第四章 建構近最小BER 及最小BER 的OSC .................................................... 12
4.1 近最小BER 的OSC ............................................................................... 14
4.2 最小BER 的OSC ................................................................................... 15
4.3 近最小BER 與最小BER 的OSC 之BER 上界比較 .......................... 17
第五章 模擬結果分析 ............................................................................................. 18
第六章 結論 ............................................................................................................. 24
附錄:
附錄A 證明(4.7) ...................................................................................................... 25
附錄B (4.9)中V 的範例 .......................................................................................... 28
參考文獻...................................................................................................................... 29
[1] Hara, S.; Prasad, R., “Overview of multicarrier CDMA,” IEEE Commun. Mag., pp. 126 –133, Dec. 1997.
[2] Y. Zhou. et al, “OFCDM: A promising broadband wireless access technique,” IEEE Commun. Mag., vol. 46, no. 3, pp. 39-49, March 2008..
[3] H. G. Myung. et al ,” Single carrier FDMA for uplink wireless transmission,” IEEE Vehicular Tech. Mag., vol. 1, pp. 30-38, Sep. 2006.
[4] 3GPP, “Physical layer aspects for Evolved Universal Terrestrial Radio Access (E-UTRA),” TR 25.814 (V7.1.0), Sept. 2006.
[5] Z. Wang, and G. B. Giannakis,” Complex-field coding for OFDM over fading wireless channels,” IEEE Trans. Inform. Theory, vol.49, pp707-724, Mar. 2003.
[6] A. Bury, J. Egle, and J. Lindner, “Diversity comparison of spreading transforms for multicarrier spreading spectrum transmission,” IEEE Trans. Commun., vol. 51, no.5, pp. 774-781, May 2003.
[7] M.L. McCloud, “Analysis and design of short block OFDM spreading matrices for use on multipath fading channels,” IEEE Trans. Commun., vol. 53, no. 4, pp. 656- 665, Apr. 2005.
[8] S. F. Shan and A. H. Tewfik, “Design analysis for post S. F. Shan and A. H. Tewfik, “Design analysis for post S. F. Shan and A. H. Tewfik, “Design analysis for post S. F. Shan and A. H. Tewfik, “Design analysis for post S. F. Shan and A. H. Tewfik, “Design analysis for post S. F. Shan and A. H. Tewfik, “Design analysis for post S. F. Shan and A. H. Tewfik, “Design analysis for post S. F. Shan and A. H. Tewfik, “Design analysis for post S. F. Shan and A. H. Tewfik, “Design analysis for post S. F. Shan and A. H. Tewfik, “Design analysis for post S. F. Shan and A. H. Tewfik, “Design analysis for post S. F. Shan and A. H. Tewfik, “Design analysis for post S. F. Shan and A. H. Tewfik, “Design analysis for post S. F. Shan and A. H. Tewfik, “Design analysis for post S. F. Shan and A. H. Tewfik, “Design analysis for post S. F. Shan and A. H. Tewfik, “Design analysis for post S. F. Shan and A. H. Tewfik, “Design analysis for post S. F. Shan and A. H. Tewfik, “Design analysis for post S. F. Shan and A. H. Tewfik, “Design analysis for post S. F. Shan and A. H. Tewfik, “Design analysis for post S. F. Shan and A. H. Tewfik, “Design analysis for post S. F. Shan and A. H. Tewfik, “Design analysis for post S. F. Shan and A. H. Tewfik, “Design analysis for post S. F. Shan and A. H. Tewfik, “Design analysis for post S. F. Shan and A. H. Tewfik, “Design analysis for post S. F. Shan and A. H. Tewfik, “Design analysis for post S. F. Shan and A. H. Tewfik, “Design analysis for post S. F. Shan and A. H. Tewfik, “Design analysis for post S. F. Shan and A. H. Tewfik, “Design analysis for post S. F. Shan and A. H. Tewfik, “Design analysis for post S. F. Shan and A. H. Tewfik, “Design analysis for post S. F. Shan and A. H. Tewfik, “Design analysis for post -coded OFDM,” coded OFDM,” coded OFDM,” coded OFDM,” coded OFDM,” coded OFDM,” coded OFDM,” IEEE IEEE Trans. Wireless Commun.Trans. Wireless Commun. Trans. Wireless Commun.Trans. Wireless Commun. Trans. Wireless Commun.Trans. Wireless Commun. vol. 7, no. 12, pp . 4907 -4918, Dec. 2008. Dec. 2008.Dec. 2008.
[9] M. O. Damen, H. E. Gamal, and G. Carire, “On maximum-likelhood detection and the search for the closet lattice point,” IEEE Trans. Info., vol. 49, no. 10, pp. 2389-2402, Oct. 2003.
[10] M. Kisialiou, X. Luo, and Z.-Q. Luo, “Efficient implementation of quasi maximum-likelihood detection based on semidefinite relaxation,” IEEE Trans. Signal Processing, vol. 57, no. 12, pp. 4811–4822, Dec. 2009.
[11] W.-K. Ma, T. N. Davidson, K. M. Wong, Z.-Q. Luo, and P. C. Ching, “Quasi maximum-likelihood multiuser detection using semi-definite relaxation with applications to synchronous CDMA,” IEEE Trans. Signal Processing, vol. 50, pp. 912–922, Apr. 2002.
[12] Z. Q. Luo, X. Luo, and M. Kisialiou, “An efficient quasi-maximum likelihood decoder for PSK signals,” in Proc. Int. Conf. Acoustics, Speech and Signal Processing (ICASSP ’03), vol. 6, pp. VI-561-1–4, Hong Kong, Apr. 2003.
[13] N. Srinidhi, S. K. Mohammed, A. Chockalingam, and B. S. Rajan, “Layered tabu search algorithm for large-MIMO detection and a lower bound on ML performance,”IEEE Trans. Communications, vol. 59, no. 11, pp.2955-2963, Nov. 2011.
[14] T. Datta, N. Srinidhi, A. Chockalingam, and B. S. Rajan, “Randomrestart reactive tabu search algorithm for detection in large-MIMO systems,” IEEE Commun. Lett., vol. 14, no. 12, pp. 1107–1109, Dec. 2010.
[15] D. Guo and C. D. Guo and C. D. Guo and C.D. Guo and C. D. Guo and C.D. Guo and C.-C. Wang, “Multiuser detection of sparsely spread CDMA,” C. Wang, “Multiuser detection of sparsely spread CDMA,” C. Wang, “Multiuser detection of sparsely spread CDMA,” C. Wang, “Multiuser detection of sparsely spread CDMA,” C. Wang, “Multiuser detection of sparsely spread CDMA,” C. Wang, “Multiuser detection of sparsely spread CDMA,” C. Wang, “Multiuser detection of sparsely spread CDMA,” C. Wang, “Multiuser detection of sparsely spread CDMA,” C. Wang, “Multiuser detection of sparsely spread CDMA,” C. Wang, “Multiuser detection of sparsely spread CDMA,” C. Wang, “Multiuser detection of sparsely spread CDMA,” C. Wang, “Multiuser detection of sparsely spread CDMA,” C. Wang, “Multiuser detection of sparsely spread CDMA,” C. Wang, “Multiuser detection of sparsely spread CDMA,” C. Wang, “Multiuser detection of sparsely spread CDMA,” C. Wang, “Multiuser detection of sparsely spread CDMA,” C. Wang, “Multiuser detection of sparsely spread CDMA,” C. Wang, “Multiuser detection of sparsely spread CDMA,” C. Wang, “Multiuser detection of sparsely spread CDMA,” C. Wang, “Multiuser detection of sparsely spread CDMA,” C. Wang, “Multiuser detection of sparsely spread CDMA,” C. Wang, “Multiuser detection of sparsely spread CDMA,” C. Wang, “Multiuser detection of sparsely spread CDMA,” C. Wang, “Multiuser detection of sparsely spread CDMA,” C. Wang, “Multiuser detection of sparsely spread CDMA,” C. Wang, “Multiuser detection of sparsely spread CDMA,” C. Wang, “Multiuser detection of sparsely spread CDMA,” C. Wang, “Multiuser detection of sparsely spread CDMA,” IEEE IEEE J. Select. Areas CommunJ. Select. Areas Commun J. Select. Areas Commun J. Select. Areas Commun J. Select. Areas CommunJ. Select. Areas CommunJ. Select. Areas CommunJ. Select. Areas Commun J. Select. Areas Commun J. Select. Areas Commun ., vol. 26, no. 3, pp. 421., vol. 26, no. 3, pp. 421 –430, April 2008. 430, April 2008. 430, April 2008. 430, April 2008.
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top
無相關論文