On Two-User Gaussian Multiple Access Channels With Finite Input Constellations
暂无分享,去创建一个
[1] Rüdiger L. Urbanke,et al. A rate-splitting approach to the Gaussian multiple-access channel , 1996, IEEE Trans. Inf. Theory.
[2] B. Sundar Rajan,et al. STBCs with Reduced Sphere Decoding Complexity for Two-User MIMO-MAC , 2009, GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference.
[3] Ezio Biglieri,et al. Coding for Wireless Channels , 2005 .
[4] Rudolf Ahlswede,et al. Multi-way communication channels , 1973 .
[5] Robert G. Gallager,et al. A perspective on multiaccess channels , 1984, IEEE Trans. Inf. Theory.
[6] Ezio Biglieri,et al. Multiple Access Channels: Theory and Practice , 2007 .
[7] B. Sundar Rajan,et al. Coding for two-user Gaussian MAC with PSK and PAM signal sets , 2009, 2009 IEEE International Symposium on Information Theory.
[8] Emre Telatar,et al. Capacity of Multi-antenna Gaussian Channels , 1999, Eur. Trans. Telecommun..
[9] Xue-Bin Liang,et al. Orthogonal designs with maximal rates , 2003, IEEE Trans. Inf. Theory.
[10] Lars K. Rasmussen,et al. Iterative multi-user detection of trellis code multiple access using a posteriori probabilities , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).
[11] Thomas M. Cover,et al. Elements of Information Theory , 2005 .
[12] Costas N. Georghiades,et al. Computing the capacity of a MIMO fading channel under PSK signaling , 2005, IEEE Transactions on Information Theory.
[13] Giuseppe Caire,et al. On maximum-likelihood detection and the search for the closest lattice point , 2003, IEEE Trans. Inf. Theory.
[14] H. Bolcskei,et al. Multiuser Space-Time/Frequency Code Design , 2006, 2006 IEEE International Symposium on Information Theory.
[15] Emanuele Viterbo,et al. A universal lattice code decoder for fading channels , 1999, IEEE Trans. Inf. Theory.
[16] Yi Hong,et al. Algebraic multiuser space-time block codes for 2 × 2 MIMO , 2008, PIMRC.
[17] B. S. Rajan,et al. Low-complexity, information-lossless STBCs for two-user MISO-MAC with partial CSIT , 2010, 2010 National Conference On Communications (NCC).
[18] B. Sundar Rajan,et al. Information-Lossless Space–Time Block Codes From Crossed-Product Algebras , 2006, IEEE Transactions on Information Theory.
[19] A. Yongacoglu,et al. Trellis coded modulation design for multi-user systems on AWGN channels , 2004, 2004 IEEE 59th Vehicular Technology Conference. VTC 2004-Spring (IEEE Cat. No.04CH37514).
[20] B. Sundar Rajan,et al. Single-symbol maximum likelihood decodable linear STBCs , 2006, IEEE Transactions on Information Theory.
[21] A. Robert Calderbank,et al. Space-Time block codes from orthogonal designs , 1999, IEEE Trans. Inf. Theory.
[22] B. Sundar Rajan,et al. Finite signal-set capacity of two-user Gaussian Multiple Access Channel , 2008, 2008 IEEE International Symposium on Information Theory.
[23] A. Robert Calderbank,et al. Space-Time Codes for High Data Rate Wireless Communications : Performance criterion and Code Construction , 1998, IEEE Trans. Inf. Theory.
[24] Babak Hassibi,et al. High-rate codes that are linear in space and time , 2002, IEEE Trans. Inf. Theory.
[25] Lars K. Rasmussen,et al. Constellation-constrained capacity for trellis code multiple access systems , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).
[26] Yi Hong,et al. On Fast-Decodable Space–Time Block Codes , 2007, IEEE Transactions on Information Theory.
[27] B. Sundar Rajan,et al. High-Rate, Single-Symbol ML Decodable Precoded DSTBCs for Cooperative Networks , 2009, IEEE Transactions on Information Theory.
[28] Gottfried Ungerboeck,et al. Channel coding with multilevel/phase signals , 1982, IEEE Trans. Inf. Theory.
[29] B. Sundar Rajan,et al. Minimum-Decoding-Complexity, Maximum-rate Space-Time Block Codes from Clifford Algebras , 2006, 2006 IEEE International Symposium on Information Theory.
[30] T. Aulin,et al. Trellis coded multiple access (TCMA) , 1999, 1999 IEEE International Conference on Communications (Cat. No. 99CH36311).