臺灣博碩士論文加值系統

在這篇論文中，我們考慮了具私密訊息之快速衰退多天線高斯廣播通道的安全傳輸。系統中有一具備多天線之傳送端，傳送各自獨立的私密訊息給兩個使用者。在傳送端僅知通道統計資訊的條件下，達成消息理論定義下的安全傳輸。我們首先利用same marginal的性質，去歸類在我們系統模型中，有意義的案例；亦即，兩個使用者可以同時達到非零的速率。我們接著透過解出通道輸入變異矩陣與髒指編碼因子，推導可達成的安全速率區域。由於速率區域的式子相當複雜，我們試著從低訊噪比的分析，更深入去探討關於此通道的特性。最後，模擬結果顯示，在消息理論的安全要求下，兩個使用者可以同時達到正的速率。

In this thesis we consider the secure transmission over the fast fading multiple antenna Gaussian broadcast channel with confidential messages (FMGBC-CM), where a multiple-antenna transmitter sends independent confidential messages to two users with informa-tion theoretic secrecy and only the statistics of the receivers’ channel state information are
known at the transmitter. We first use the same marginal property of the FMGBC-CM to classify the non-trivial cases, i.e., both the two users have nonzero rates. We then derive the achievable rate region for the FMGBC-CM by solving the channel input covariance matrices and the inflation factor. Due to the complicated rate region formulae, we also resort
to low SNR analysis to investigate the characteristics of the channel. Finally, the numerical examples show that under the information-theoretic secrecy requirement both users can
achieve positive rates simultaneously.

TABLE OF CONTENTS
Page
Abstract . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . i
List of Tables . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . iv
List of Figures . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . v
Chapters:
1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
1.1 Notations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4
2. System model of FMGBC-CM with statistical CSIT . . . . . . . . . . . 5
2.1 Definitions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5
2.2 The coding structure and achievable rate region . . . . . . . . . . 6
2.3 System model of FMGBC-CM with statistical CSIT . . . . . . . 14
3. Necessary conditions for non-degraded cases . . . . . . . . . . . . . . 15
3.1 Three classes of discrete memoryless broadcast channels (DM-BC) 15
3.2 Same marginal . . . . . . . . . . . . . . . . . . . . . . . . . . . 18
3.3 Necessary conditions for non-degraded FMGBC-CM . . . . . . . 19
4. The achievable secrecy rate region of FMGBC-CM . . . . . . . . . . . 24
4.1 Problem formulation . . . . . . . . . . . . . . . . . . . . . . . . 24
4.2 The proposed algorithm for solving the optimal achievable se-
crecy rate region . . . . . . . . . . . . . . . . . . . . . . . . . . 30
4.3 Solving the channel input covariance matrices . . . . . . . . . . . 37
4.4 Low SNR analysis . . . . . . . . . . . . . . . . . . . . . . . . . 41
5. Simulation results . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 49
6. Conclusion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 57
Bibliography . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 58

[1] Y. Liang and H. V. Poor, “Multiple access channels with confidential messages,” IEEE Trans. Inform. Theory, vol. 54, pp. 976–1002, Mar. 2008.
[2] X. Zhou, R. K. Ganti, and J. G. Andews, “Secure wireless network connectivity with multi-antenna transmission,” vol. 10, no. 2, pp. 425–430, Feb. 2011.
[3] A. D.Wyner, “The wiretap channel,” Bell Syst. Tech. J., vol. 54, pp. 1355–1387, 1975.
[4] I. Csisz’ar and J. Korner, “Broadcast channels with confidential messages,” IEEE
Trans. Inform. Theory, vol. 24, no. 3, pp. 339–348, 1978.
[5] S. Shafiee and S. Ulukus, “Towards the secrecy capacity of the Gaussian MIMO wiretap channel: the 2-2-1 channel,” IEEE Trans. Inform. Theory, vol. 55, no. 9, pp. 4033–4039, Sept. 2009.
[6] A. Khisti and G. W. Wornell, “Secure transmission with multiple antennas-II: The MIMOME wiretap channel,” IEEE Trans. Inform. Theory, vol. 56, no. 11, pp. 5515–5532, Nov 2010.
[7] F. Oggier and B. Hassibi, “The secrecy capacity of the MIMO wiretap channel,” IEEE Trans. Inform. Theory, vol. 57, no. 8, Aug. 2011.
[8] T. Liu and S. S. (Shitz), “A note on the secrecy capacity of the multiple-antenna wiretap channel,” IEEE Trans. Inform. Theory, vol. 55, no. 6, pp. 2547–2553, Jun.
2009.
[9] Y. Liang, V. Poor, and S. S. (Shitz), “Secure communication over fading channels,” IEEE Trans. Inform. Theory, vol. 54, no. 6, pp. 2470–2492, Jun. 2008.
[10] A. Khisti and G. W. Wornell, “Secure transmission with multiple antennas-I: The MISOME wiretap channel,” IEEE Trans. Inform. Theory, vol. 56, no. 7, pp. 3088–
3104, July 2010.
[11] S. Goel and R. Negi, “Guaranteeing secrecy using artificial noise,” IEEE Trans. Wireless Commun., vol. 7, no. 6, pp. 2180–2189, June 2008.
[12] J. Li and A. Petropulu, “On ergodic secrecy rate for Gaussian MISO wiretap channels,” IEEE Trans. Wireless Commun., vol. 10, no. 4, pp. 1176–1187, Apr. 2011.
[13] Z. Li, R. Yates, and W. Trappe, “Achieving secret communication for fast Rayleigh fading channels,” IEEE Trans. Wireless Commun., vol. 9, no. 9, pp. 2792 – 2799, Sep. 2010.
[14] P. Gopala, L. Lai, and H. El Gamal, “On the secrecy capacity of fading channels,” IEEE Trans. Inform. Theory, vol. 54, no. 10, pp. 4687–4698, Oct. 2008.
[15] R. Liu and V. Poor, “Secrecy capacity region of a multiple-antenna Gaussian broadcast channel with confidential messages,” vol. 55, no. 3, pp. 1235–1248, Mar. 2009.
[16] G. Caire and S. Shamai, “On the capacity of some channels with channel state information,” vol. 45, no. 6, pp. 2007–2019, Sept. 1999.
[17] A. E. Gamal and E. V. der Meulen, “A proof of Marton’s coding theorem for the discrete memoryless broadcast channel,” IEEE Trans. Inf. Theory, vol. IT-27, no. 1,
pp. 120–122, Jul. 1980.
[18] T. Cover and J. Thomas, Elements of Information Theory. Wiley (New York), 1991.
[19] R. Liu, I. Maric, P. Spasojevic, and R. D. Yates, “Discrete memoryless interference and broadcast channels with channels with confidential messages: Secrecy rate regions,” IEEE Trans. Inform. Theory, vol. 54, no. 6, pp. 2493–2507, June 2008.
[20] S. C. Lin and P. H. Lin, “On ergodic secrecy capacity of multiple input wiretap channel with statistical CSIT,” http://arxiv.org/pdf/1201.2868.pdf.
[21] A. E. Gamal and Y. H. Kim, Lecture Notes on Network Information Theory. http://arxiv.org/abs/1001.3404.
[22] Y. Liang, H. V. Poor, and S. Shamai, “Information theoretic security,” Foundations and Trends in Communications and Information Theory, vol. 5, pp. 355–580, 2008.
[23] M. H. M. Costa, “Writing on dirty paper,” IEEE Trans. Inform. Theory, vol. 29, pp. 439–441, May 1983.
[24] C. S. Vaze and M. K. Varanasi, “On the achievable rate of the fading dirty paper channel with imperfect CSIT,” http://arxiv.org/abs/0903.4526, Mar. 2009.
[25] A. Soysal, “A method for optimization matrix valued functions and its applications to capacity of MIMO systems,” 19th Telecommunication forum TELFOR 2011, Nov. 2011.
[26] J. Magnus and H. Neudecker, Matrix Differential Calculus with Applications in Statistics and Econometrics. John Wiley and Sons, Inc.,, 1988.
[27] C. S. Vaze and M. K. Varanasi, “Dirty paper coding for fading channels with partial transmitter side information,” http://arxiv.org/abs/0901.2764, Jan. 2009.
[28] J. Li and A. Petropulu, “Transmitter optimization for achieving secrecy capacity in Gaussian MIMO wiretap channels,” http://arxiv.org/abs/0909.2622.
[29] Q. Shi, E. Song, and G. Chen, “Signaling strategy optimization for gaussian MIMO wiretap channel,” ICC, 2012.
[30] M. C. Gursoy, “Secure communication in the low-SNR regime,” http://arxiv.org/abs/0910.4128, Oct. 2009.
[31] A.W. Marshall and I. Olkin, Inequalities: Theory of Majorization and Its Application. Academic Press,Inc.,(London) Ltd., 1979.
[32] Z. Li, R. Yates, and W. Trappe, “Secret communication with a fading eavesdropper channel,” in Proc. IEEE Int. Symp. Information Theory, Nice, France, Jun. 2007, pp.
1296 – 1300.