請用此 Handle URI 來引用此文件:
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/47832
完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.advisor | 蘇炫榮(Hsuan-Jung Su) | |
dc.contributor.author | Yu-Li Tsai | en |
dc.contributor.author | 蔡馭理 | zh_TW |
dc.date.accessioned | 2021-06-15T06:21:15Z | - |
dc.date.available | 2011-08-16 | |
dc.date.copyright | 2010-08-16 | |
dc.date.issued | 2010 | |
dc.date.submitted | 2010-08-10 | |
dc.identifier.citation | [1] C.-P. Lee and H.-J. Su, Peak to average power ratio reduction of space-
time codes that achieve diversity-multiplexing gain tradeoff,' Personal, Indoor and Mobile Radio Communications, 2008. PIMRC 2008. IEEE 19th International Symposium on, pp. 1{6, 15-18 Sept. 2008. [2] | |
dc.identifier.citation | , Diversity-multiplexing gain tradeoff with peak to average power
ratio constraints,' Information Sciences and Systems, 2008. CISS 2008. 42nd Annual Conference on, pp. 896{901, 19-21 March 2008. [3] M. Damen and H. El Gamal, On maximum-likelihood detection and the search for the closest lattice point,' Information Theory, IEEE Trans- actions on, vol. 49, no. 10, pp. 2389{2402, Oct. 2003. [4] T. K. Moon, Error Correction Coding: Mathematical Methods and Al- gorithms. Hoboken, NJ: John Wiley and Sons Inc., 2005. [5] P. Dayal and M. Varanasi, Maximal diversity algebraic space-time codes with low peak-to-mean power ratio,' IEEE Trans. Inform. The- ory, vol. 51, no. 5, pp. 1691{1708, May 2005. [6] A. Storjohann, Computation of hermite and smith normal forms of matrices,' Master's thesis, University of Waterloo, Canada, 1994. [7] A. Mobasher and A. Khandani, Integer-based constellation-shaping method for papr reduction in ofdm systems,' Communications, IEEE Transactions on, vol. 54, no. 1, pp. 119{ 127, Jan. 2006. [8] P. Hao and Q. Shi, Matrix factorizations for reversible integer map- ping,' Signal Processing, IEEE Transactions on, vol. 49, no. 10, pp. 2314{2324, Oct. 2001. [9] L. Ozarow, S. Shamai, and A. Wyner, Information theoretic consider- ations for cellular mobile radio,' Vehicular Technology, IEEE Transac- tions on, vol. 43, no. 2, pp. 359{378, May 1994. [10] L. Zheng and D. Tse, Diversity and multiplexing: a fundamental trade- off in multiple-antenna channels,' Information Theory, IEEE Transac- tions on, vol. 49, no. 5, pp. 1073{ 1096, May 2003. [11] Y. Song and S. D. Blostein, Channel estimation and data detection for mimo systems under spatially and temporally colored interference,' EURASIP Journal on Applied Signal Processing, 2004, pp. 685{695, 1 January 2004. [12] A. Scaglione, G. B. Giannakis, and S. Barbarossa, Redundant ‾lter- bank precoders and equalizers part i: Uni‾cation and optimal design,' IEEE Transactions on Signal Processing, vol. 47, no. 7, pp. 1988{2006, July 1999. [13] A. Scaglione, P. Stoica, S. Barbarossa, G. Giannakis, and H. Sampath, Optimal designs for space-time linear precoders and decoders,' SignalProcessing, IEEE Transactions on, vol. 50, no. 5, pp. 1051{1064, May 2002. [14] A. G. Je®rey G. Andrews and R. Muhamed, Fundamentals of WiMAX: Understanding Broadband Wireless Networking. Prentice-Hall, 2007. [15] E. Agrell, T. Eriksson, A. Vardy, and K. Zeger, Closest point search in lattices,' Information Theory, IEEE Transactions on, vol. 48, no. 8, pp. 2201{2214, Aug. 2002. [16] B. Hassibi and H. Vikalo, On the expected complexity of sphere decod- ing,' Signals, Systems and Computers, 2001. Conference Record of the Thirty-Fifth Asilomar Conference on, vol. 2, no. 5, pp. 1051{105, 2001. [17] E. Viterbo and J. Boutros, A universal lattice code decoder for fading channel,' IEEE Trans. Inform. Theory, vol. 45, pp. 1639{1642, July 1999. [18] B. Hochwald and S. ten Brink, Achieving near-capacity on a multiple- antenna channel,' Communications, IEEE Transactions on, vol. 51, no. 3, pp. 389{399, March 2003. [19] C. Liu and J. Zhang, A fast generalized complex sphere decoder for mimo systems,' Wireless, Mobile and Multimedia Networks, 2006 IET International Conference on, pp. 1{4, 6-9 Nov. 2006. [20] C. Liu, Z. Wu, and W. Zheng, A complex sphere decoder for space- time codes,' Circuits and Systems, 2004. MWSCAS '04. The 2004 47th Midwest Symposium on, vol. 2, pp. II{657{II{660, 25-28 July 2004. [21] A. Bennatan and D. Burshtein, Design and analysis of nonbinary ldpc codes for arbitrary discrete-memoryless channels,' Information Theory, IEEE Transactions on, vol. 52, no. 2, pp. 549{583, Feb. 2006. [22] R.-H. Peng and R.-R. Chen, Design of nonbinary ldpc codes over gf(q) for multiple-antenna transmission,' Military Communications Confer- ence, 2006. MILCOM 2006. IEEE, pp. 1{7, 23{25, Oct. 2006. [23] H. Song and J. Cruz, Reduced-complexity decoding of q-ary ldpc codes for magnetic recording,' Magnetics, IEEE Transactions on, vol. 39, no. 2, pp. 1081{ 1087, Mar. 2003. | |
dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/47832 | - |
dc.description.abstract | 在一具有多通道系統中,空時編碼經常被使用來達到最佳分集與多工取捨,然而,這些空時編碼對信號星座點的形變,往往導致輸出信號產生相對高的峰均功率比,使得訊號經過功率放大器時易產生非線性失真,而造成傳送端的放大器設計上的困難性增加。利用可逆整數對應的方式,則可對信號星座點加以整形,使得峰均功率比降低,並可維持分集與多工最佳取捨。然而,此對應技術運用於其他前置編碼多天線與正交分頻多工系統時,在數元錯誤率會有效能上的損失。因此,引入適合格柵點之解調之列舉球面演算法及更進ㄧ步的反覆解碼,使效能接近最佳理論值。 | zh_TW |
dc.description.abstract | In a multichannel system, space-time codes are usually used to achieve the optimal diversity-multiplexing gain (D-MG) tradeoff. Nevertheless, these pace-time codes will make transformations on signal constellation, and often lead to relatively higher peak to average power ratio (PAPR) so that the signal will suffer nonlinear distortion through power amplifier. The design difficulty for transmit power amplifier will undoubtedly increase. By the use of integer reversible mapping method, the signal constellation can be shaped to lower down the PAPR without losing the optimal diversity-multiplexing gain (D-MG) tradeoff. However, in other precoding multi-input multi-output (MIMO) or orthogonal frequency division multiplexing (OFDM) system, this technique will lead to performance loss in bit error rate. Thus, we will introduce the list sphere decoding for closest lattice point search and a further iterative decoding to make the performance near to the theoretically optimal value. | en |
dc.description.provenance | Made available in DSpace on 2021-06-15T06:21:15Z (GMT). No. of bitstreams: 1 ntu-99-R97942038-1.pdf: 1554483 bytes, checksum: 9d198de85e75594805f266b1654abfec (MD5) Previous issue date: 2010 | en |
dc.description.tableofcontents | Contents
1 Introduction 6 2 PAPR Reduction via Constellation Shaping 11 2.1 Approximately Cubic Shaping via Integer Reversible Matrix Mapping . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12 2.1.1 Approximately Cubic Shaping . . . . . . . . . . . . . . 13 2.1.2 Integer Reversible Matrix Mapping and PLUS Factor- ization . . . . . . . . . . . . . . . . . . . . . . . . . . . 14 2.1.3 Encoding and Decoding of PLUS . . . . . . . . . . . . 16 2.2 Diversity-Multiplexing Gain Tradeo® with PAPR Constraints 18 2.3 Open-Loop and Close-Loop Transmit Diversity . . . . . . . . 19 2.3.1 Open-Loop Transmit Diversity . . . . . . . . . . . . . . 19 2.3.2 Close-Loop Transmit Diversity . . . . . . . . . . . . . . 20 2.4 SVD-Based PLUS MIMO System . . . . . . . . . . . . . . . . 22 2.4.1 System Model . . . . . . . . . . . . . . . . . . . . . . . 23 2.4.2 PAPR Reduction in SVD-Based PLUS MIMO System 25 3 OFDM PLUS System 27 3.1 PLUS OFDM system . . . . . . . . . . . . . . . . . . . . . . . 28 3.1.1 System Model . . . . . . . . . . . . . . . . . . . . . . . 28 3.1.2 Single Carrier OFDM System . . . . . . . . . . . . . . 33 3.1.3 Error Propagations and Channel Coding . . . . . . . . 34 4 List Sphere Decoder 36 4.1 Maximum-Likelihood Detection . . . . . . . . . . . . . . . . . 37 4.1.1 The Pohst and Schnorr-Euchner Enumeration . . . . . 38 4.1.2 Complex ML Detection of Finite-Alphabet Constraints 40 4.2 Receiver Structure of PLUS System with LSD . . . . . . . . . 43 4.3 Numerical Result and Check Matrix . . . . . . . . . . . . . . . 44 5 Iterative Decoding 48 5.1 Iterative Decoding and Message Passing on Graph . . . . . . . 49 5.1.1 Notation and Tanner Graphs . . . . . . . . . . . . . . 50 5.1.2 The Vertical Step . . . . . . . . . . . . . . . . . . . . . 53 5.1.3 The Horizontal Step . . . . . . . . . . . . . . . . . . . 55 5.1.4 Terminating and Initializing the Decoding Algorithm . 57 5.1.5 Summary of the Algorithm . . . . . . . . . . . . . . . . 57 5.2 Proposed System Structure . . . . . . . . . . . . . . . . . . . 58 5.3 Numerical Result and Discussion . . . . . . . . . . . . . . . . 60 6 Conclusion and Future Work 64 | |
dc.language.iso | en | |
dc.title | 基於星座圖整形之峰均值功率比降低方法 | zh_TW |
dc.title | Constellation Shaping Based PAPR Reduction Method | en |
dc.type | Thesis | |
dc.date.schoolyear | 98-2 | |
dc.description.degree | 碩士 | |
dc.contributor.oralexamcommittee | 林茂昭,易志孝,葉丙成 | |
dc.subject.keyword | 峰均功率比,前置編碼,正交分頻多工,球面演算法,反覆解碼, | zh_TW |
dc.subject.keyword | PAPR,precoding,OFDM,list sphere decode,iterative decode, | en |
dc.relation.page | 70 | |
dc.rights.note | 有償授權 | |
dc.date.accepted | 2010-08-10 | |
dc.contributor.author-college | 電機資訊學院 | zh_TW |
dc.contributor.author-dept | 電信工程學研究所 | zh_TW |
顯示於系所單位: | 電信工程學研究所 |
文件中的檔案:
檔案 | 大小 | 格式 | |
---|---|---|---|
ntu-99-1.pdf 目前未授權公開取用 | 1.52 MB | Adobe PDF |
系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。