[1] Nikopour H, Baligh H. Sparse code multiple access[C]//IEEE 24th International Symposium on Personal Indoor and Mobile Radio Communications. London:IEEE Press, 2013:332-336.
[2] Hoshyar R, Wathan F P, Tafazolli R. Novel low-density signature for synchronous CDMA systems over AWGN channel[J]. IEEE Transactions on Signal Process, 2008, 56(4):1616-1626.
[3] Taherzadeh M, Nikopour H, Bayesteh A, et al. SCMA codebook design[C]//2014 IEEE 80th Vehicular Technology Conference. Vancouver:IEEE Press, 2014:1-5.
[4] Cai Donghong, Fan Pingzhi, Lei Xianfu, et al. Multi-dimensional SCMA codebook design based on constellation rotation and interleaving[C]//2016 IEEE 83rd Vehicular Technology Conference. Nanjing:IEEE Press, 2016:1-5.
[5] Yang Lin, Liu Yunyun, Siu Y M. Low complexity message passing algorithm for SCMA system[J]. IEEE Communications Letters, 2016, 20(12):2466-2469.
[6] Du Yang, Dong Binhong, Chen Zhi, et al. A fast convergence multiuser detection scheme for uplink SCMA systems[J]. IEEE Wireless Communications Letters, 2016, 5(4):388-391.
[7] Fossorier M P C. Quasi-cyclic low-density parity-check codes from circulant permutation matrices[J]. IEEE Transactions on Information Theory, 2004, 50(8):1788-1793.
[8] Bao Jinchen, Ma Zheng, Karagiannidis G K, et al. Joint multiusr detection of multidimensional constellations over fading channels[J]. IEEE Transactions on Communications, 2017, 65(1):161-172.
[9] Kschischang F R, Frey B J, Loeliger H-A. Factor graphs and the sum-product algorithm[J]. IEEE Transactions on Information Theory, 2001, 47(2):498-519.
[10] Rahnavard N, Pishro-Nik H, Fekri F. Unequal error protection using partially regular LDPC codes[J]. IEEE Transactions on Communications, 2007, 55(3):387-391.
[11] Hu X-Y, Eleftheriou E, Arnold D-M. Progressive edge-growth tanner graphs[C]//Global Telecommunications Conference. San Antonio:IEEE Press, 2001:995-1001.
[12] Xie Qiuliang, Song Jian, Peng Kewu, et al. Coded modulation with signal space diversity[J]. IEEE Transactions on Wireless Communications, 2011, 10(2):660-669. |