請用此 Handle URI 來引用此文件:
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/27494
完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.advisor | 蘇炫榮(Hsuan-Jung Su) | |
dc.contributor.author | Shih-Chun Lin | en |
dc.contributor.author | 林士駿 | zh_TW |
dc.date.accessioned | 2021-06-12T18:07:09Z | - |
dc.date.available | 2008-01-10 | |
dc.date.copyright | 2008-01-10 | |
dc.date.issued | 2007 | |
dc.date.submitted | 2007-12-27 | |
dc.identifier.citation | [1] A. Amraoui, G. Kramer, and S. Shamai. Coding for the MIMO broadcast channel. In in Proc. IEEE International Symposium on Information Theory, Yokohama, Japan,
page 296, June 2003. [2] L. Bahl, J. Cocke, F. Jelinek, and J. Raviv. Optimal decoding of linear codes for minimizing symbol error rate. IEEE Trans. Inform. Theory, 20:284–287, Mar. 1974. [3] A. Bennatan and D. Burshtein. On the fading paper achievable region of the fading MIMO broadcast channel. to appear in the IEEE Transactions on Information Theory. [4] A. Bennatan, D. Burshtein, G. Caire, and S. Shamai. Superposition coding for sideinformation channels. IEEE Trans. Inform. Theory, 52(5):1872 – 1889, May 2006. [5] T. Berger. Rate distortion theory. Prentice-Hall, Englewood Cliffs, NJ, 1971. [6] T. Berger. Multiterminal source coding. In The Information Theory Approach to Communications (G. Longo, ed.), vol. 229 of CISM Courses and Lectures,Springer- Verlag, Vienna/New York, pages 171–231, 1978. [7] G. Caire and S. Shamai. On the achievable throughput of a multiantenna Gaussian broadcast channel. IEEE Trans. Inform. Theory, 49(7):1691 – 1706, July 2003. [8] J. Chen, X. Zhang, T. Berger, and SB Wicker. An upper bound on the sum-rate distortion function and its corresponding rate allocation schemes for the CEO problem. IEEE J. Select. Areas Commun., 22(6):977–987, 2004. [9] S. Y. Chung. On the Construction of Some Capacity-Approaching Coding Schemes. PhD thesis, Massachusetts Institute of Technology, Sep. 2000. [10] M. Costa. Writing on dirty paper. IEEE Trans. Inform. Theory, 29(3):439 – 441, May 1983. [11] T.M. Cover and J.A. Thomas. Elements of Information Theory. Wiley, New York, 1991. [12] N. Devroye, P. Mitran, and V. Tarokh. Achievable rates in cognitive radio channels. IEEE Trans. Inform. Theory, 52(5):1813–1827, 2006. [13] H. El-Gamal, G. Caire, and M. O. Damen. Lattice coding and decoding achieve the optimal diversity-vs-multiplexing tradeoff of MIMO channels. IEEE Trans. Inform. Theory, 50(6):968 – 985, Jun 2004. [14] U. Erez, S. Litsyn, and R. Zamir. Lattices which are good for (almost) everything. IEEE Trans. Inform. Theory, 51(10):3401 – 3416, Oct. 2005. [15] U. Erez, S. Shamai, and R. Zamir. Capacity and lattice strategies for canceling known interference. IEEE Trans. Inform. Theory, 51(11):3820 – 3833, Nov 2005. [16] U. Erez and S. ten Brink. A close to capacity dirty paper coding scheme. IEEE Trans. Inform. Theory, 51(10):3417–3432, Oct. 2005. [17] U. Erez and R. Zamir. Achieving 1/2 log (1+SNR) on the AWGN channel with lattice encoding and decoding. IEEE Trans. Inform. Theory, 50(10):2293–2314, Oct. 2004. [18] M.V. Eyuboglu and G. D. Forney, Jr. Lattice and trellis quantization with lattice- and trellis-bounded codebooks-high-rate theory for memoryless sources. IEEE Trans. Inform. Theory, 39(1):46–59, Jan. 1993. [19] G. D. Forney, Jr. On the role of MMSE estimation in approaching the information theoretic limits of linear gaussian channels: Shannon meets wiener. In 41th Annual Allerton Conf. on Comm. Control, and Comput., Monticello, IL, Oct. 2003. [20] G. D. Forney, Jr. Shannon meets Wiener II: On MMSE estimation in successive decoding schemes. In 42th Annual Allerton Conf. on Comm. Control, and Comput., Monticello, IL, Sep. 2004. [21] G. D. Forney, Jr., M. D. Trott, and S. Y. Chung;. Sphere-bound-achieving coset codes and multilevel coset codes. IEEE Trans. Inform. Theory, 46(3):820 – 850, May 2000. [22] S. I. Gel’fand and M. S. Pinsker. Coding for channels with random parameters. Probl. Contr. and Inform. Theory, 9(1):19–31, 1980. [23] A. J. Goldsmith and P. P. Varaiya. Capacity of fading channels with channel side information. IEEE Trans. Inform. Theory, 43(6):1986–1992, Nov. 1997. [24] R. M. Gray and D. L. Neuhoff. Quantization. IEEE Trans. Inform. Theory, 44(6):2325–2383, Oct. 1998. [25] B. M. Hochwald, C. B. Peel, and A. L. Swindlehurst. A vector-perturbation technique for near-capacity multiantenna multiuser communication-part II: perturbation. IEEE Trans. Commun., 53(3):537–544, Jan. 2005. [26] R. A. Horn and C. R. Johnson. Matrix analysis. Cambridge university press, Cambridge, UK, 1985. [27] H. Jin, A. Khandekar, and R. McEliece. Irregular repeat-accumulate codes. In Proc. 2nd Int. Symp. Turbo Codes Related Topics, Brest,France, pages 1 – 8, Sept. 2000. [28] N. Jindal,W. Rhee, S. Vishwanath, S. A. Jafar, and A. Goldsmith. Sum power iterative water-filling for multi-antenna Gaussian broadcast channels. IEEE Trans. Inform. Theory, 51(4):1570 – 1580, Apr. 2005. [29] A. Jovicic and P. Viswanath. Cognitive radio: An information-theoretic perspective. submitted to IEEE Trans. Inform. Theory. [30] S.-Y. R. Li, R. W. Yeung, and N. Cai. Linear network coding. IEEE Trans. Inform. Theory, 49(2):371–381, 2003. [31] S. C. Lin and H. J. Su. Practical vector dirty paper coding for MIMO Gaussian broadcast channels. IEEE J. Select. Areas Commun., 25(7):1345–1357, Sep. 2007. [32] Caleb K. Lo, S. Vishwanath, and R.W. Heath. Rate bounds for mimo relay channels using precoding. In IEEE Global Telecommunications Conference (GLOBECOM), St. Louis, MO, USA, pages 1172– 1176, Nov. 2005. [33] H-A. Loeliger. Averaging bounds for lattices and linear codes. IEEE Trans. Inform. Theory, 43:1767–1773, Nov 1997. [34] M. W. Marcellin and T. R. Fischer. Trellis coded quantization of memoryless and Gauss-Markov sources. IEEE Trans. Commun., 38(1):82–93, Jan. 1990. [35] P. Mitran, N. Devroye, and V. Tarokh. On compound channels with side information at the transmitter. IEEE Trans. Inform. Theory, 52(4):1745–1755, Apr. 2006. [36] A. D. Murugan, H. El-Gamal, M. O. Damen, and G. Caire. A unified framework for tree search decoding: rediscovering the sequential decoder. IEEE Trans. Inform. Theory, 52(3):933–953, 2006. [37] Y. Oohama. Separate source coding of correlated Gaussian remote sources. In Information Theory and its Applications Workshop, U. C. San Diego, 2006. [38] D. P. Palomar, J. M. Cioffi, and M. A. Lagunas. Joint Tx-Rx beamforming design for multicarrier MIMO channels: a unified framework for convex optimization. IEEE Trans. Signal Processing, 51(9):2381–2401, 2003. [39] C. B. Peel, B. M. Hochwald, and A. L. Swindlehurst. A vector-perturbation technique for near-capacity multiantenna multiuser communication-part I: channel inversion and regularization. IEEE Trans. Commun., 53(3):195– 202, Jan. 2005. [40] V. Prabhakaran, D. Tse, and K. Ramachandran. Rate region of the quadratic Gaussian CEO problem. In Proceedings of International Symposium on Information Theory (ISIT), page 119, 2004. [41] P. Robertson, E. Villebrun, and P. Hoeher. A comparison of optimal and suboptimal MAP decoding algorithms operating in the log domain. In Proc. Int. Conf. Communications, pages 1009–1013, Jun. 1995. [42] Y. Sun, A. Liveris, V. Stankovic, and Z. Xiong. Near-capacity dirty-paper code design: A source-channel coding approach. In Proc. 39th Annual Conference on Information Sciences and System (CISS 2005), Baltimore, MD, March 2005, Mar. 2005. [43] S. Tavildar and P. Viswanath. On the sum-rate of the vector Gaussian CEO problem. In Conference Record of the 39th Asilomar Conference on Signals, Systems and Computers, pages 3–7, 2005. [44] S. ten Brink and G. Kramer. Turbo processing for scalar and vector channels. In Proc. 3rd Int. Symp. Turbo Codes Related Topics, Brest, France, pages 23– 30, Sept. 2003. [45] M. Tomlinson. New automatic equalizer employing modulo arithmetic. Electron. Lett., 7:138–139, Mar. 1971. [46] D. Tse and P. Viswanath. Fundamentals of Wireless Communication. Cambridge University Press, 2005. [47] S. Vishwanath, N. Jindal, and A. Goldsmith. Duality, achievable rates, and sum rate capacity of Gaussian MIMO broadcast channels. IEEE Trans. Inform. Theory, 49(10):2658 – 2668, Oct. 2003. [48] P. Viswanath and DNC. Tse. Sum capacity of the vector Gaussian broadcast channel and uplink-downlink duality. IEEE Trans. Inform. Theory, 49(8):1912–1921, 2003. [49] H. Weingarten, Y. Steinberg, and S. Shamai. The capacity region of the Gaussian multiple-input multiple-output broadcast channel. IEEE Trans. Inform. Theory, 52(9):3936 – 3964, Sept. 2006. [50] C. Windpassinger, R.F.H. Fischer, T. Vencel, and J.B. Huber. Precoding in multiantenna and multiuser communications. IEEE Trans. Wireless Commun., 3(4):1305– 1316, Jul. 2004. [51] J. J. Xiao and Z. Q. Luo. Optimal rate allocation for the vector Gaussian CEO problem. In 2005 1st IEEE International Workshop on Computational Advances in Multi- Sensor Adaptive Processing, pages 56–59, 2005. [52] Z. Xiong, A. D. Liveris, and S. Cheng. Distributed source coding for sensor networks. IEEE Signal Processing Mag., 21(5):80–94, 2004. [53] W. Yu. Uplink-downlink duality via minimax duality. IEEE Trans. Inform. Theory, 52(2):361–374, 2006. [54] W. Yu and J. M. Cioffi. Sum capacity of Gaussian vector broadcast channels. IEEE Trans. Inform. Theory, 50(9):1875–1892, Sept. 2004. [55] W. Yu, A. Sutivang, D. Julian, T. Cover, and M. Chiang. Writing on colored paper. In Proc. of IEEE International Symposium on Information Theory (ISIT), page 302, Jun. 2001. [56] R. Zamir and T. Berger. Multiterminal source coding with high resolution. IEEE Trans. Inform. Theory, 45(1):106–117, 1999. [57] R. Zamir and M. Feder. On lattice quantization noise. IEEE Trans. Inform. Theory, 42(4):1152–1159, July. 1996. [58] R. Zamir, S. Shamai, and U. Erez. Nested linear/lattice codes for structured multiterminal binning. IEEE Trans. Inform. Theory, 48(6):1250–1276, June 2002. [59] W. Zhang, S. Kotagiri, and J. N. Laneman. Writing on dirty paper with resizing and its application to quasi-static fading broadcast channels. In IEEE Int. Symp. Information Theory (ISIT), Nice, France, Jun. 2007. | |
dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/27494 | - |
dc.description.abstract | Recently, multi-terminal network equipped with multiple antennas has gained lots of attentions due to its strong potential in performance enhancement. The coding for vector
side-information channels plays a fundamental role in this system, since each terminal in the network can provide the others some side-information to help encoding/decoding the data. In this thesis, we will study how to design and implement this new coding scheme. We have developed a lattice-based vector dirty paper coding (DPC) for communication channels with transmitter side-information and perfect transmitter channel state information (CSIT). This coding can completely remove the inference known only at the transmitter (as side-information) but not at the receiver. When only statistics of CSIT is available, good (sometimes optimal) performance can still be obtained by modifying this coding structure. We also show how to achieve the capacity region of the multiple-input multiple-output Gaussian broadcast channel with proposed coding. Motivated by this lattice-based coding scheme, we also develop another vector DPC based on superposition coding which can be implemented with existing channel and source coding schemes. An design example is provided and close-to-capacity rate performance is obtained. Finally, we propose a vector Wyner-Ziv coding (WZC) which is a compression technique using decoder side information to help reconstruction. The key is exploring the duality between the DPC and WZC problems. This vector WZC can be applied to the vector CEO problem in sensor networks, and achieve the Berger-Tung sum rate which is the best known compression rate for this problem. | en |
dc.description.provenance | Made available in DSpace on 2021-06-12T18:07:09Z (GMT). No. of bitstreams: 1 ntu-96-F89921044-1.pdf: 683016 bytes, checksum: a04cf86211a29943d8a5eda796efb7b4 (MD5) Previous issue date: 2007 | en |
dc.description.tableofcontents | 1. Introduction . . . . . . . . . . . . . . . . . . . . . 1
1.1 Motivation: Practical Coding for Vector Side-information Channels . . . ................................2 1.2 Overview of Thesis . . . . . . . . . . . . ........... 4 1.3 Notations . . . . . . . . . . . . . . . . . . . . . . .5 2. Lattice-based VDPC with Perfect CSIT . . . . . . . . . 7 2.1 System Model and Preliminaries . . . . . . . . . . . . 8 2.1.1 Vector Dirty-paper Channel . . . . . . . . . . . . . 8 2.1.2 Perfect CSIT: Costa’s Coding and Interference-free Rate Achievement. . . . . . ..............................10 2.1.3 Review of lattices and lattice quantization noise . 12 2.2 Lattice Coding for Vector Dirty-paper Channels with Perfect CSIT . . . . .....................................13 2.2.1 Vector Precoding with Lattice Quantizer . . . . . . 14 2.2.2 Capacity of the Equivalent Modulo Channel in Lemma 1 ........................................................16 2.2.3 Nested Lattice Based Vector Dirty Paper Coding . . .21 2.3 Applications in the MIMO GBC . . . . . . . . . . . . .25 2.4 Summary . . . . . . . . . . . . . . . . . . . . . . . 28 3. Lattice-based Coding with Statistics of CSIT . . . . . 29 3.1 Statistics of CSIT: Linear-assignment Gel’fand-Pinsker Coding and Its Achievable Rate . . .......................31 3.1.1 Achievable Rate of the Linear-assignment Gel’fand-Pinsker Coding. . . . . . . . . . . . . . . . . . ........33 3.2 Lattice Coding for the Fading Vector Dirty-paper Channels with Statistics of CSIT . . . . . . . . . . . . .36 3.3 Numerical example . . . . . . . . . . . . . . . ......40 3.4 Summary . . . . . . . . . . . . . . . . . . . . . . . 42 4. Practical VDPC Based on Superposition Coding . . . . . 43 4.1 System Model . . . . . . . . . . . . . . . . . . . .. 44 4.2 Vector Superposition Dirty Paper Coding . . . . . . . 45 4.3 Code Parameters Selection and the Interference-free Rate Achievement ........................................ 50 4.3.1 Feasibility of Successive Decoding . . . . . . . . .53 4.3.2 Extension to more than Two Users . . . . . . . . . .55 4.4 Summary . . . . . . . . . . . . . . . . . . . . . . . 56 5. VDPC Implementation Using IRA and TCQ . . . . . . . . .58 5.1 End-to-end Implementation and Practical Design Issues . . . . . . . . . .................................58 5.1.1 Performance Loss due to the Practical Quantization Code . . . . .............................................60 5.1.2 Maximum Achievable Channel Code Rate using Finite Alphabet Constellation . . . . . . .......................62 5.1.3 End-to-End Vector Dirty Paper Coding Structure . . .65 5.2 A Design Example and Detailed Code Parameters Selection . . . . . . . ..................................66 5.2.1 Vector Quantizer Parameters Selection and Performance . . . . . ....................................67 5.2.2 Channel Coding Parameters Selection and Performance . . . . ..................................... 70 5.3 Summary . . . . . . . . . . . . . . . . . . . . . . . 73 6. Duality : Vector WZC . . . . . . . . . . . . . . . . . 74 6.1 System Model . . . . . . . . . . . . . . . . . . . . 75 6.2 Nested-Lattice Based Vector Wyner-Ziv Coding . . . . .79 6.3 Conclusion . . . . . . . . . . . . . . . . . . . . . .84 7. Conclusion . . . . . . . . . . . . . . . . . . . . . . 85 Appendices: A. Proof of Theorem 2 . . . . . . . . . . . . . . . . . . 87 B. Proof of Theorem 5 and Its Corollary . . . . . . . . . 94 B.1 Proof of the Encoder Part . . . . . . . . . . . . . . 95 B.2 Proof of the Decoder Part . . . . . . . . . . . . . . 97 B.3 Proof of Corollary 1 . . . . . . . . . . . . . . . . .99 C. Receiver Decoding Algorithms of Chapter 5 . . . . . . 101 C.1 Joint Trellis Processing . . . . . . . . . . . . . . 101 D. Proof of Theorem 6 . . . . . . . . . . . . . . . . ...104 D.1 Reconstruction with Zero Receiver Side-information . 104 D.2 Reconstruction with Receiver Side-information . . . .107 Bibliography . . . . . . . . . . . . . . . . . . . . . . 110 | |
dc.language.iso | en | |
dc.title | 髒紙碼之理論,實現,和對偶性 | zh_TW |
dc.title | CODING FOR VECTOR DIRTY-PAPER CHANNELS:
THEORY, IMPLEMENTATION, AND DUALITY | en |
dc.type | Thesis | |
dc.date.schoolyear | 96-1 | |
dc.description.degree | 博士 | |
dc.contributor.oralexamcommittee | 趙啟超(Chi-Chao Chao),洪樂文(Yao-Win Hong),林茂昭(Mao-Chao Lin),陸曉?(Hsiao-Feng Lu),蘇育德(Yu-Te Su) | |
dc.subject.keyword | 編碼,額外資訊, | zh_TW |
dc.subject.keyword | coding,side information, | en |
dc.relation.page | 114 | |
dc.rights.note | 有償授權 | |
dc.date.accepted | 2007-12-27 | |
dc.contributor.author-college | 電機資訊學院 | zh_TW |
dc.contributor.author-dept | 電信工程學研究所 | zh_TW |
顯示於系所單位: | 電信工程學研究所 |
文件中的檔案:
檔案 | 大小 | 格式 | |
---|---|---|---|
ntu-96-1.pdf 目前未授權公開取用 | 667.01 kB | Adobe PDF |
系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。