請用此 Handle URI 來引用此文件:
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/56556
完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.advisor | 蘇炫榮(Hsuan-Jung Su) | |
dc.contributor.author | Chung-Pi Lee | en |
dc.contributor.author | 李崇丕 | zh_TW |
dc.date.accessioned | 2021-06-16T05:34:40Z | - |
dc.date.available | 2016-08-17 | |
dc.date.copyright | 2014-08-17 | |
dc.date.issued | 2014 | |
dc.date.submitted | 2014-08-13 | |
dc.identifier.citation | [1] D. Chen, K. Azarian, and J. N. Laneman, “A case for amplify-forward relaying in the block-fading multiaccess channel,” IEEE Trans. Inform. Theory, vol. 54, no. 8, pp.
3728–3733, Aug. 2008. [2] M. Yuksel and E. Erkip, “Multiple-antenna cooperative wireless systems: A diversitymultiplexing tradeoff perspective,” IEEE Trans. Inform. Theory, vol. 53, no. 10, pp.3371–3393, Oct. 2007. [3] C. Hausl and P. Dupraz, “Joint network-channel coding for the multiple-access relay channels,” in Proc. Int.Workshop onWireless Ad-hoc and Sensor Networks (IWWAN), New York, June 2006. [4] T. Wang and G. B. Giannakis, “Complex field network coding for multiuser cooperative communications,” IEEE J. Select. Areas Commun., vol. 26, no. 8, pp. 561–571, Apr. 2008. [5] M. E. Soussi, A. Zaidi, and L. Vandendorpe, “Compute-and-forward on a multiaccess relay channel: Coding and symmetric-rate optimization,” IEEE Trans. Wireless Commun., vol. 13, no. 4, pp. 1932–1947, Apr. 2014. [6] S. Lim, Y.-H. Kim, A. El Gamal, and S.-Y. Chung, “Noisy network coding,” IEEE Trans. Inform. Theory, vol. 57, no. 5, pp. 3132–3152, May 2011. [7] D. Tse and P. Viswanath, Fundamentals of Wireless Communication. Cambridge University Press, 2005. [8] G. Kramer, I. Mari′c, and R. D. Yates, “Cooperative communications,” Foundations and Trends in Networking, vol. 1, no. 3, pp. 271–425, 2006. [9] J. N. Laneman, D. N. C. Tse, and G. W. Wornell, “Cooperative diversity in wireless networks: Efficient protocols and outage behavior,” IEEE Trans. Inform. Theory, vol. 50, no. 12, pp. 3062–3080, Dec. 2004. [10] K. Azarian and H. El Gamal, “On the achievable diversity-multiplexing tradeoff in half-duplex cooperative channels,” IEEE Trans. Inform. Theory, vol. 51, no. 12, pp. 4152–4172, Dec. 2005. [11] Y. Jing and H. Jafarkhani, “Using orthogonal and quasi-orthogonal designs in wireless relay networks,” IEEE Trans. Inform. Theory, vol. 53, no. 11, pp. 4106–4118, Nov. 2007. [12] ——, “Single and multiple relay selection schemes and their achievable diversity orders,”IEEE Trans. Wireless Commun., vol. 8, no. 3, pp. 1414–1423, Mar. 2009. [13] A. Bletsas, A. Khisti, D. P. Reed, and A. Lippman, “A simple cooperative diversity method based on network path selection,” IEEE J. Select. Areas Commun., vol. 24, no. 3, pp. 659–672, Mar. 2006. [14] A. Bletsas, H. Shin, and M. Z. Win, “Cooperative communications with outageoptimal opportunistic relaying,” IEEE Trans. Wireless Commun., vol. 6, no. 9, pp. 3450–3460, Sep. 2007. [15] G. Kramer and A. J. van Wijngaarden, “On the white Gaussian multiple-access relay channel,” in Proc. IEEE Int. Symp. Inform. Theory, Sorrento, Italy, June 2000, p. 40. [16] L. Sankaranarayanan, G. Kramer, and N. B. Mandayam, “Capacity theorems for the multiple-access relay channel,” in Proc. Allerton Conf. Communications, Control, and Computing, 2004, pp. 1782–1791. [17] ——, “Hierarchical sensor networks: Capacity theorems and cooperative strategies using the multiple-access relay channel model,” in Proc. First IEEE Conference on Sensor and Ad Hoc Communications and Networks, Santa Clara, CA, Oct. 2004, pp. 191–199. [18] G. Kramer, M. Gastpar, and P. Gupta, “Cooperative strategies and capacity theorems for relay networks,” IEEE Trans. Inform. Theory, vol. 51, no. 9, pp. 3037–3063, Sep. 2005. [19] K. Azarian, H. El Gamal, and P. Schniter, “On the optimality of ARQ-DDF protocols,” IEEE Trans. Inform. Theory, vol. 54, no. 4, pp. 1718–1724, Apr. 2008. [20] Y. Nam and H. El Gamal, “On the optimality of lattice coding and decoding in multiple access channels,” in Proc. IEEE Int. Symp. Inform.Theory, Nice, France, 2007. [21] A. Murugan, H. El Gamal, M. Damen, and G. Caire, “A unified framework for tree search: Rediscovering the sequential decoder,” IEEE Trans. Inform. Theory, vol. 52, no. 3, pp. 933–953, Mar. 2006. [22] M. O. Damen, H. El Gamal, and G. Caire, “On maximum-likelihood detection and the search for the closest lattice point,” IEEE Trans. Inform. Theory, vol. 49, no. 10, pp. 2389–2402, Oct. 2003. [23] B. Nazer and M. Gastpar, “Compute-and-forward: Harnessing interference through structured codes,” IEEE Trans. Inform. Theory, vol. 57, no. 10, pp. 6463–6486, Oct. 2011. [24] J. Zhan, B. Nazer, M. Gastpar, and U. Erez, “MIMO compute-and-forward.” in Proc. IEEE Int. Symp. Inform.Theory, Seoul, South Korea, June 2009, pp. 2848–2852. [25] Y. Song and N. Devroye, “Lattice codes for the Gaussian relay channel: Decode-andforward and compress-and-forward,” IEEE Trans. Inform. Theory, vol. 59, no. 8, pp. 4927–4948, Aug. 2013. [26] P. Herhold, “Cooperative relaying protocols and performances,” Ph.D. dissertation, Technical University of Dresden, July 2005. [27] D. H. Woldegebreal and H. Karl, “Multiple-access relay channel with network coding and non-ideal source-relay channels,” in Wireless Communication Systems, 2007. ISWCS 2007. 4th International Symposium on, 2007, pp. 732–736. [28] J. H. Conway and N. J. A. Sloane, Sphere packings, lattices and groups. Springer-Verlag, New York, 1993. [29] U. Erez and R. Zamir, “Achieving 1/2log(1+SNR) on the AWGN channel with lattice encoding and decoding,” IEEE Trans. Inform. Theory, vol. 50, no. 10, pp. 2293–2314, Oct. 2004. [30] R. Zamir, S. Shamai, and U. Erez, “Nested linear/lattice codes for structured multiterminal binning,” IEEE Trans. Inform. Theory, vol. 48, no. 6, pp. 1250–1276, June 2002. [31] U. Erez, S. Litsyn, and R. Zamir, “Lattices which are good for (almost) everything,”IEEE Trans. Inform. Theory, vol. 51, no. 10, pp. 3401–3416, Oct. 2005. [32] R. Zamir, “Lattices are everywhere,” in Information Theory and Applications Work-shop, San Diego, CA, 2009, pp. 392–421. [33] A. Ozgur and S. Diggavi, “Approximately achieving Gaussian relay network capacity with lattice-based QMF codes,” IEEE Trans. Inform. Theory, vol. 59, no. 12, pp. 8275–8294, Dec. 2013. [34] G. Bresler, A. Parekh, and D. N. Tse, “The approximate capacity of the many-to-one and one-to-many Gaussian interference channels,” IEEE Trans. Inform. Theory, vol. 56, no. 9, pp. 4566–4592, Sep. 2010. [35] O. Ordentlich, U. Erez, and B. Nazer, “The approximate sum capacity of the symmetric Gaussian K-user interference channel,” in Proc. IEEE Int. Symp. Inform.Theory, Cambridge, MA, June 2012, pp. 2072–2076. [36] R. Zamir and M. Feder, “On lattice quantization noise,” IEEE Trans. Inform. Theory, vol. 42, no. 4, pp. 1152–1159, July 1996. [37] H.-A. Loeliger, “Averaging bounds for lattices and linear codes,” IEEE Trans. Inform. Theory, vol. 43, no. 6, pp. 1767–1773, Nov. 1997. [38] A. Murugan, K. Azarian, and H. El Gamal, “Cooperative lattice coding and decoding in half-duplex channels,” IEEE J. Select. Areas Commun., vol. 25, no. 2, pp. 268–279, Feb. 2007. [39] H. El Gamal, G. Caire, andM. Damen, “Lattice coding and decoding achieve the optimal diversity-multilpexing tradeoff ofMIMO channels,” IEEE Trans. Inform. Theory, vol. 50, no. 6, pp. 968–985, June 2004. [40] R. Ahlswede, N. Cai, S. R. Li, and R. W. Yeung, “Network information flow,” IEEE Trans. Inform. Theory, vol. 46, no. 4, pp. 1204–1216, July 2000. [41] B. Hassibi and H. Vikalo, “On the sphere-decoding algorithm I. Expected complexity,” IEEE Trans. Signal Processing, vol. 53, no. 8, pp. 2806–2818, Aug. 2005. [42] H. Vikalo and B. Hassibi, “On the sphere-decoding algorithm II. Generalizations, second-order statistics, and applications to communications,” IEEE Trans. Signal Pro- cessing, vol. 53, no. 8, pp. 2819–2834, Aug. 2005. [43] J. Jalden and P. Elia, “Sphere decoding complexity exponent for decoding full-rate codes over the quasi-static MIMO channel,” IEEE Trans. Inform. Theory, vol. 58, no. 9, pp. 5785–5803, Sep. 2012. [44] A. Amraoui, S. Dusad, and R. Urbanke, “Achieving general points in the 2-user Gaussian MAC without time-sharing or rate-splitting by means of iterative coding,” in Proc. IEEE Int. Symp. Inform.Theory, Lausanne, Switzerland, 2002, p. 334. [45] B. Nazer and M. Gastpar, “Computation over multiple-access channels,” IEEE Trans. Inform. Theory, vol. 53, no. 10, pp. 3498–3516, Oct. 2007. [46] D. N. Tse, P. Viswanath, and L. Zheng, “Diversity-multiplexing tradeoff in multipleaccess channels,” IEEE Trans. Inform. Theory, vol. 50, no. 9, pp. 1859–1874, Sep. 2004. [47] B. Rimoldi and R. Urbanke, “A rate-splitting approach to the Gaussian multipleaccess channel,” IEEE Trans. Inform. Theory, vol. 42, no. 2, pp. 364–375, Mar. 1996. [48] M. E. Soussi, A. Zaidi, and L. Vandendorpe, “Iterative sum-rate optimization for multiple access relay channels with a compute-and-forward relay,” in IEEE International Conf. on Communications, Ottawa, Canada, June 2012, pp. 4751–4755. [49] ——, “Resource allocation for multiple access relay channel with a compute-andforward relay,” in IEEE International Symposium on Wireless Communication Sys- tems, Aachen, Germany, Nov. 2011. [50] ——, “Compress-and-forward on a multiaccess relay channel with computation at the receiver,” in IEEE International Conf. on Communications, Budapest, Hungary, June 2013. [51] K. R. Kumar and G. Caire, “Coding and decoding for the dynamic decode and forward relay protocol,” IEEE Trans. Inform. Theory, vol. 55, no. 7, pp. 3186–3205, July 2009. [52] C.-P. Lee, S.-C. Lin, H.-J. Su, and H. V. Poor, “Multi-user lattice coding for the multiple-access relay channel,” IEEE Trans. Wireless Commun., vol. 13, no. 7, pp. 3539–3555, July 2014. [53] J. Korner and K. Marton, “How to encode the modulo-two sum of binary sources,” IEEE Trans. Inform. Theory, vol. 25, no. 2, pp. 219–221, Mar. 1979. [54] M. P. Wilson, K. Narayanan, H. D. Pfister, and A. Sprintson, “Joint physical layer coding and network coding for bidirectional relaying,” IEEE Trans. Inform. Theory, vol. 56, no. 11, pp. 5641–5654, Nov. 2010. [55] W. Nam, S.-Y. Chung, and Y. H. Lee, “Capacity of the Gaussian two-way relay channel to within 1/2 bit,” IEEE Trans. Inform. Theory, vol. 56, no. 11, pp. 5488–5494, Nov. 2010. [56] ——, “Nested lattice codes for Gaussian relay networks with interference,” IEEE Trans. Inform. Theory, vol. 57, no. 12, pp. 7733–7745, Dec. 2011. [57] B. Nazer, M. Gastpar, S. A. Jafar, and S. Vishwanath, “Ergodic interference alignment,” IEEE Trans. Inform. Theory, vol. 58, no. 10, pp. 6355–6371, Oct. 2012. [58] U. Niesen, B. Nazer, and P. Whiting, “Computation alignment: Capacity approximation without noise accumulation,” in Proc. Allerton Conf. Communications, Control, and Computing, 2011, pp. 1607–1612. [59] R. Kolte, A. ‥Ozg‥ur, and S. Diggavi, “When are dynamic relaying strategies necessary in half-duplex wireless networks?” arXiv preprint arXiv:1405.1782, 2014. [60] S.-N. Hong and G. Caire, “Compute-and-forward strategies for cooperative distributed antenna systems,” IEEE Trans. Inform. Theory, vol. 59, no. 9, pp. 5227–5243, 2013. [61] V. Nagpal, I.-H. Wang, M. Jorgovanovic, D. Tse, and B. Nikolic, “Coding and system design for quantize-map-and-forward relaying,” IEEE J. Select. Areas Commun., vol. 31, no. 8, pp. 1423–1435, Aug. 2013. [62] 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. [63] R. J. Muirhead, Aspects of Multivariate Statistical Theory. John Wiley and Sons, 1982. | |
dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/56556 | - |
dc.description.abstract | For the uplink relay-aided transmission in a cellular system, the spectral efficiency of mobile radio networks can be improved by introducing relays to assist the transmissions of mobile stations. Further performance improvement can be expected if each relay aids not just a single mobile station, but many simultaneously. In this dissertation, we study the multiple-access relay channel (MARC), in which multiple users transmit messages to a common destination with the assistance of a relay. There are two protocols to be considered: 1) dynamic decode-and-forward (DDF) protocol and 2) compute-and-forward (CMF)protocol. In a variety of MARC settings, DDF protocol is very useful due to its outstanding rate performance. However, the lack of good structured codebooks so far hinders practical applications of DDF for the MARC. For the DDF protocol, two classes of structured codes for theMARC are proposed: 1) one-to-one relay-mapper aided multiuser lattice coding (OMLC), and 2) modulo-sum relay-mapper aided multiuser lattice coding (MS-MLC). The former enjoys better rate performance, while the latter provides more flexibility to tradeoff between the complexity of the relay mapper and the rate performance. It is shown that, in order to approach the rate performance achievable by an unstructured codebook with maximum-likelihood decoding, it is crucial to use a new K-stage coset decoder for structured O-MLC instead of the one-stage decoder proposed in previous works. However, if O-MLC is decoded with the one-stage decoder only, it can still achieve the optimal DDF diversity-multiplexing gain tradeoff in the high signal-to-noise ratio regime. As for MSMLC, its rate performance can approach that of the O-MLC by increasing the complexity of the modulo-sum relay-mapper. Finally, for practical implementations of both O-MLC and MS-MLC, practical short length lattice codes with linear mappers are designed, which facilitate efficient lattice decoding.
When the channel links from the users to the relay are weak, DF-based protocol may fail to decode all users at the relay. Aiming to solve this problem, we propose a new lattice coding based on the CMF protocol, where the relay only needs to decode an integerweighted-sum of users’ lattice codewords, re-maps it with a modulo-basedmapper and then forwards the corresponding codeword. Although the decoding at the relay is akin to the orthogonal CMF protocol, we relax the restriction imposed by previous works that the users have to be silent when the relay is transmitting to avoid interference. The key ingredient is the joint multiuser lattice decoding performed at the destination. This jointly decoding strategy not only complicates the corresponding code design but also the error analysis. Simulation results show that the proposed coding schemes outperform existing schemes in terms of outage probabilities and the achievable rates in a variety of channel settings. | en |
dc.description.provenance | Made available in DSpace on 2021-06-16T05:34:40Z (GMT). No. of bitstreams: 1 ntu-103-D96942016-1.pdf: 2988743 bytes, checksum: e907f26aa3fd5987a1b7d0208b385724 (MD5) Previous issue date: 2014 | en |
dc.description.tableofcontents | Abstract . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . i
Acknowledgments . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . iii List of Tables . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . vi List of Figures . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . vii Chapters: 1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 1.1 Motivation and Contributions . . . . . . . . . . . . . . . . . . . . . . . 2 1.2 Dissertation Overview . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 1.3 Notation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 2. Multiple Access Relay Channel and Preliminaries . . . . . . . . . . . . . . . . 11 2.1 System Model . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12 2.2 Review of Lattices . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15 2.2.1 Lattice Definitions . . . . . . . . . . . . . . . . . . . . . . . . . 15 2.2.2 Loeliger Lattice Ensemble . . . . . . . . . . . . . . . . . . . . . 17 2.3 Summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 18 3. DDF-based Multiuser Lattice Coding for the Multiple-access Relay Channel . . 19 3.1 Relay-Mapper Aided Multiuser Lattice Coding Scheme . . . . . . . . . 20 3.1.1 Encoders: Nested Lattice Codebooks and Relay Mappers . . . . 20 3.1.2 Proposed K-stage Coset Decoders . . . . . . . . . . . . . . . . . 24 3.2 Performance Analysis of the Proposed Coding Schemes . . . . . . . . . 32 3.3 Simulation Results . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 43 3.4 Summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 48 4. CMF-based Multiuser Lattice Coding for the Multiple-access Relay Channel . 50 4.1 System Model . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 51 4.2 Non-orthogonal Lattice Coding withModulo-sumComputation and Joint Decoding . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 54 4.2.1 Encoding Process for the Users . . . . . . . . . . . . . . . . . . 54 4.2.2 Decoding and Mapping at the Relay . . . . . . . . . . . . . . . . 55 4.2.3 Two-stage Joint Coset Decoder at the Destination . . . . . . . . 56 4.3 Performance Analysis of the Proposed Coding Scheme . . . . . . . . . . 58 4.4 Simulation Results . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 61 4.5 Summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 63 5. Conclusion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 64 Appendices: A. Proof of Lemma 1 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 66 B. Proof of the Rate Region of MS-MLC with the K-stage Decoder in Theorem 2 71 C. Proof of (A.1 b) for Lemma 1 . . . . . . . . . . . . . . . . . . . . . . . . . . . 76 D. Proof of (3.13) for Corollary 2 . . . . . . . . . . . . . . . . . . . . . . . . . . 78 E. Proof of Theorem 3 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 80 Bibliography . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 83 | |
dc.language.iso | en | |
dc.title | 多重存取中繼通道之晶格編碼:解調後傳輸與計算後傳輸 | zh_TW |
dc.title | Lattice Codes for Multiple-access Relay Channel:
Decode-and-Forward and Compute-and-Forward | en |
dc.type | Thesis | |
dc.date.schoolyear | 102-2 | |
dc.description.degree | 博士 | |
dc.contributor.coadvisor | 林士駿(Shih-Chun Lin) | |
dc.contributor.oralexamcommittee | 陸曉峰(Hsiao-Feng (Francis),洪樂文(Yao-Win Hong),王奕翔(I-Hsiang Wang) | |
dc.subject.keyword | 多重存取中繼通道,解調後傳輸,計算後傳輸,晶格編碼,共 集合解碼器, | zh_TW |
dc.subject.keyword | Multiple-access relay channel,Decode-and-Forward,Compute-and-Forward,Lattice Codes,Coset Decoder, | en |
dc.relation.page | 88 | |
dc.rights.note | 有償授權 | |
dc.date.accepted | 2014-08-13 | |
dc.contributor.author-college | 電機資訊學院 | zh_TW |
dc.contributor.author-dept | 電信工程學研究所 | zh_TW |
顯示於系所單位: | 電信工程學研究所 |
文件中的檔案:
檔案 | 大小 | 格式 | |
---|---|---|---|
ntu-103-1.pdf 目前未授權公開取用 | 2.92 MB | Adobe PDF |
系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。