請用此 Handle URI 來引用此文件:
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/29288
完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.advisor | 蘇炫榮(Hsuan-Jung Su) | |
dc.contributor.author | Chung-Pi Lee | en |
dc.contributor.author | 李崇丕 | zh_TW |
dc.date.accessioned | 2021-06-13T01:03:57Z | - |
dc.date.available | 2008-07-26 | |
dc.date.copyright | 2007-07-26 | |
dc.date.issued | 2007 | |
dc.date.submitted | 2007-07-23 | |
dc.identifier.citation | [1] L. Zheng and D. N. C. Tse, “Diversity and multiplexing: A fundamental tradeoff in multiple antenna channels,” IEEE Trans. Inform. Theory,vol. 49, no. 5, pp. 1073–1096, May. 2003.
[2] P. Elia, B. Sethuraman, and P. V. Kumar, “Perect space time codes with minimum and non-minimum delay for any number of antennas,”preprint, submited to arXiv:cs.IT, Dec 2005. [3] P. Elia, S. A. Pawar, K. R. Kumar, P. V. Kumar, and H. Lu, “Explicit space-time codes achieving the diversity-multiplexing gain tradeoff,”IEEE Trans. Inform. Theory, vol. 52, no. 9, Sep 2006. [4] H. Yao and G. W. Wornell, “Achieving the full mimo diversitymultiplexing frontier with rotation based space-time codes,” in Allerton Conf. Comm. Control and Computing., Oct 2003. [5] H. E. Gamal, G. Caire, and M. Damen, “Lattice coding and decoding achieve the optimal diversity-multilpexing tradeoff of mimo channels,”IEEE Trans. Inform. Theory, vol. 50, pp. 968–985, June 2004.56 [6] P. Dayal and M. K. Varanasi, “An optimal two transmit antenna spacetime code and its stacked extension,” in Asilomar Conf. on Signals,Systems and Computers, Monterey, CA, Nov 2003. [7] J.-C. Belfiore, G. Rekaya, and E.Viterbo, “The golden code: a 2×2 fullrate space-time code with non-vanishing determinants,” IEEE Trans.Inform. Theory, vol. 51, no. 4, pp. 1432–1436, April 2005. [8] H. Kwok, “Shape up: peak-power reduction via constellation shaping,”Ph.D. dissertation, University of Illinois at Urbana-Champaign, 2001. [9] P. Hao and Q. Shi, “Matrix factorizations for reversible integer mapping”,IEEE Trans. Signal Processing, vol. 49, pp. 2314–2324, Oct 2001. [10] P. Hao, “Customizable triangular factorizations of matrices,” Linear Algebra and Its Applications, vol. 382, pp. 135–154, May 2004. [11] I. E. Telatar, “Capacity of multi-antenna gaussian channels,” Tech.Rep:Bell Labs, Lucent Technologies, 1995. [12] L. Ozarow, S. Shamai(Shitz), and A. Wyner, “Information-theoretic considerations in cellular mobile radio,” IEEE Trans. Veh. Technol.,vol. 43, pp. 359–378, May 1994. [13] S. Tavildar and P. Viswanath, “Approximately universal codes over slow fading channels,” Submitted to IEEE Trans. Inform. Theory, Feb 2005. [14] A. Storjohann, “Computation of hermite and smith normal forms of matrices,” Master’s thesis, University of Waterloo, Canada, 1994.57 [15] D. Tse and P. Viswanath, Fundamentals of Wireless Communication.Cambridge University Press, 2005. [16] G. J. Foschini, “Layered space-time architecture for wireless communication in a fading environment when using multi-element antennas,”Bell Labs Tech., vol. 1, no. 2, pp. 41–59, 1996. [17] J. G. Smith, “On the information capacity of peak and average power constrained gaussian channels,” Ph.D. dissertation, Univ. of California,Berkeley, CA, 1969. [18] S. Shamai and I. Bar-David, “The capacity of average and peak powerlimited quadrature gaussian channels,” IEEE Trans. Inform. Theory,vol. 41, no. 4, pp. 060–1071, 1995. [19] W.Yu and J.Cioffi, “Sum capacity of a gaussian vector broadcast channels,”IEEE Trans. Inform. Theory, vol. 50, no. 9, pp. 1875–1892, Sep 2004. [20] R. A. Horn and C. R. Johnson, Matrix Analysis. New York: Cambridge Univ. Press, 1988. [21] P. Dayal and M. K. Varanasi, “Maximal diversity algebraic space-time codes with low peak-to-mean power ratio,” IEEE Trans. Inform. Theory,vol. 51, pp. 1961–1708, May 2005. [22] G. D. Forney Jr. and L.-F. Wei, “Multidimensional constellations I: Introduction, figures of merit, and generalized cross constellations,” IEEE J. Select. Areas Commun., pp. 877–892, Aug 1989.58 [23] A. R. Calderbank and L. H. Ozarow, “Nonequiprobable signaling on the gaussian channel,” IEEE Trans. Inform. Theory, vol. 36, pp. 726–740,July 1990. [24] G. D.Forney, “Trellis shaping,” IEEE Trans. Inform. Theory, vol. 38,pp. 281–300, Mar 1992. [25] A. K. Khandani and P. Kabal, “Shaping multidimensional signal spacespartI: Optimum shaping, shell mapping,” IEEE Trans. Inform. Theory,pp. 1794–1808, Nov 1993. [26] J. F. R. Kschischang and S. Pasupathy, “Optimal shaping properties of the truncated polydisc,” IEEE Trans. Inform. Theory, vol. 40, pp.892–903, May 1994. [27] R. Laroia, N. Favardin, and S. Tretter, “On optimal shaping of multidimensional constellations,” IEEE Trans. Inform. Theory, June 1994. [28] H. J. Smith, “On systems of linear indeterminate equations and congruences,”Philos. Trans. R. Soc. Lond., vol. 151, pp. 293–326, June 1861. [29] A. Mobasher and A. K. Khandani., “Integer-based constellation shaping method for papr reduction in ofdm systems,” IEEE Trans. Commun.,vol. 54, pp. 119–127, Jan 2006. [30] C. Hermite, “Sur lintroduction des variables continues dans la theorie des nombres,” J. Reine Angew. Math., pp. 191–216, 1851.59 [31] S. Oraintara, Y.-J.Chen, and T. Q.Nguyen, “Integer fast fourier transform,'IEEE Trans. Signal Processing, vol. 50, pp. 607–618, Mar 2002. [32] F. A. M. L.Bruckens and A. W. M. van den Enden, “New networks for perfect inversion and perfect reconstruction,” IEEE J. Select. Areas Commun., vol. 10, 1992. [33] F. Oggier, G. Rekaya, J.-C. Belfiore, and E. Viterbo, “Perfect space-time block codes,” Submitted to IEEE Trans. Inform. Theory, 2006. | |
dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/29288 | - |
dc.description.abstract | 在參考文獻[1]裡指出在類似靜止的通道下,存在一個多工與分集的最佳取捨,之後有許多研究在設計可達到最佳取捨的時空編碼,然而,這些時空編碼往往導致相當高的峰均比,高的峰均比會使傳送端的放大器設計困難,所以我們將探討如果加上峰均比的限制,多工與分集的最佳取捨會有怎樣的影響。結果顯示最佳取捨仍然是不變的,但是那些原本設計可達到多工與分集最佳取捨的時空編碼需要作適當的調整使其符合峰均比的限制。因此,我們提供了二種方法來降低峰均比並維持時空編碼本身的結構,所以仍然可以達到多工與分集的最佳取捨並有較低的峰均比。第一種方法利用Hermite Normal Form分解來達成,第二種方法則是利用可逆整數對應來完成,在時空編碼個數足夠大時,二者皆可漸近的降低峰均比到3 | zh_TW |
dc.description.abstract | A result of Zheng and Tse [1] states that over a quasi-static channel, there exists a fundamental tradeoff, known as diversity-multiplexing gain (D-MG) tradeoff. The quest for space-time codes that achieve D-MG tradeoff has generated numerous work [2-7],etc. However, these space-time codes generally have a pretty high peak to average power ratio (PAR) value on each antenna. In a realistic system, to avoid inefficiently operating the power amplifier, one should put constraints on PAR value. In the following context, we investigate D-MG tradeoff with PAR constraints. The results show D-MG tradeoff remains the same even with PAR constraints, but space-time codes devised to achieve D-MG tradeoff need some modifications to meet the PAR constraints. Therefore, we propose two general ways to reduce PAR without affecting codes structure and without any side information being transmitted. They are both based on constellation shaping, that is, a constellation is used such that the transmitted signals have low PAR values. The first method is similar as [8] except we choose the Hermite Normal Form (HNF) decomposition instead of Smith Normal Form (SNF); the second one takes the idea of integer reversible mapping [9], [10]. If the approximately cubic shaping is used, both techniques would lead to an asymptotical PAR value equalto 3 when SNR is large. | en |
dc.description.provenance | Made available in DSpace on 2021-06-13T01:03:57Z (GMT). No. of bitstreams: 1 ntu-96-R94942026-1.pdf: 553350 bytes, checksum: 1c08ff62fbc60065d8d9a85eed7c6793 (MD5) Previous issue date: 2007 | en |
dc.description.tableofcontents | 1 Introduction 5
2 Diversity-Multiplexing Gain Tradeoff with PAR Constraints 7 2.1 Diversity -Multiplexing Gain Tradeoff 7 2.1.1 System Model 7 2.1.2 Diversity and Multiplexing 8 2.1.3 The Optimal Tradeoff 11 2.2 Diversity -Multiplexing Gain Tradeoff with PAR Constraints 14 2.2.1 Capacity of Multi-antenna Channel with PAR Constraints 14 2.2.2 Optimal Tradeoff with PAR constraints 22 3 PAR Reduction via Constellation Shaping 24 3.1 Relation between Constellation and PAR 25 3.2 Approximately Cubic Shaping 27 3.3 Approximately Cubic Shaping via Hermite Normal Form(HNF) Decomposition 30 3.4 Approximately Cubic Shaping via Integer Reversible Matrix Mapping 36 4 Simulation Results 43 5 Conclusion 47 Appendices 47 A 48 B 53 Bibliography 55 | |
dc.language.iso | en | |
dc.title | 達到分集與多工最佳取捨的時空編碼之峰均值減低方法 | zh_TW |
dc.title | Peak to Average Ratio Reduction of Space-Time Codes That Achieve Diversity-Multiplexing Gain Tradeoff | en |
dc.type | Thesis | |
dc.date.schoolyear | 95-2 | |
dc.description.degree | 碩士 | |
dc.contributor.oralexamcommittee | 林茂昭(Mao-Chao Lin),葉丙成(Ping-Cheng Yeh),李學智(Hsueh-Jyh Li) | |
dc.subject.keyword | 分集,多工,峰均比, | zh_TW |
dc.subject.keyword | diversity,multiplexing,par, | en |
dc.relation.page | 60 | |
dc.rights.note | 有償授權 | |
dc.date.accepted | 2007-07-24 | |
dc.contributor.author-college | 電機資訊學院 | zh_TW |
dc.contributor.author-dept | 電信工程學研究所 | zh_TW |
顯示於系所單位: | 電信工程學研究所 |
文件中的檔案:
檔案 | 大小 | 格式 | |
---|---|---|---|
ntu-96-1.pdf 目前未授權公開取用 | 540.38 kB | Adobe PDF |
系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。