Low Complexity Iterative Receiver Design for Sparse Code Multiple Access

IEEE Transactions on Communications

Volumn 65, Issue 2, 2017, Pages 621-634

  Wei, Fan ^a,b   Chen, Wen ^a,b  

^a SHANGHAI JIAO TONG UNIVERSITY   (China)

^b GUILIN UNIVERSITY OF ELECTRONIC TECHNOLOGY   (China)

Author keywords

list sphere decoding; message passing algorithm; node pruning; Non orthogonal multiple access; SCMA

Indexed keywords

CODES (SYMBOLS); COMPUTATIONAL COMPLEXITY; DECODING; MESSAGE PASSING; TREES (MATHEMATICS);

LIST SPHERE DECODING; MESSAGE PASSING ALGORITHM; MULTIPLE ACCESS; NODE PRUNING; SCMA;

ITERATIVE METHODS;

EID: 85013422792     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCOMM.2016.2631468     Document Type: Conference Paper

References (37)

1. "5G: A technology vision, " Huawei Technol. Co., Ltd., Shenzhen, China, White Paper, Nov. 2013. [Online]. Available: www.huawei.com/ilink/en/download/HW-314849
2. R. Hoshyar, F. P. Wathan, and R. Tafazolli, "Novel low-density signature for synchronous CDMA systems over AWGN channel, " IEEE Trans. Signal Process., vol. 56, no. 4, pp. 1616-1626, Apr. 2008.
3. R. Razavi, M. Al-Imari, M. A. Imran, R. Hoshyar, and D. Chen, "On receiver design for uplink low density signature OFDM (LDS-OFDM), " IEEE Trans. Commun., vol. 60, no. 11, pp. 3499-3508, Nov. 2012.
4. F. R. Kschischang, B. J. Frey, and H.-A. Loeliger, "Factor graphs and the sum-product algorithm, " IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 498-519, Feb. 2001.
5. J. van de Beek and B. M. Popović, "Multiple access with low-density signatures, " in Proc. IEEE Global Commun. Conf., Nov./Dec. 2009, pp. 1-6.
6. R. Hoshyar, R. Razavi, and M. Al-Imari, "LDS-OFDM an efficient multiple access technique, " in Proc. IEEE Veh. Technol. Conf. (VTC-Spring), May 2010, pp. 1-5.
7. R. Razavi, R. Hoshyar, M. A. Imran, and Y. Wang, "Information theoretic analysis of LDS scheme, " IEEE Commun. Lett., vol. 15, no. 8, pp. 798-800, Aug. 2011.
8. H. Nikopour and H. Baligh, "Sparse code multiple access, " in Proc. IEEE 24th Int. Symp. Pers. Indoor Mobile Radio Commun. (PIMRC), Sep. 2013, pp. 332-336.
9. M. Taherzadeh, H. Nikopour, A. Bayesteh, and H. Baligh, "SCMA codebook design, " in Proc. IEEE Veh. Technol. Conf. (VTC Fall), Sep. 2014, pp. 1-5.
10. Z. Li, W. Chen, F. Wei, F. Wang, X. Xu, and Y. Chen, "Joint codebook assignment and power allocation for SCMA based on capacity with Gaussian input, " in Proc. IEEE Int. Conf. Commun. China (ICCC), Chengdu, China, Jul. 2016, pp. 1-6.
11. J. Boutros and E. Viterbo, "Signal space diversity: A power-and bandwidth-efficient diversity technique for the Rayleigh fading channel, " IEEE Trans. Inf. Theory, vol. 44, no. 4, pp. 1453-1467, Jul. 1998.
12. A. Bayesteh, H. Nikopour, M. Taherzadeh, H. Baligh, and J. Ma, "Low complexity techniques for SCMA detection, " in Proc. IEEE Globecom Workshops (GC Wkshps), Dec. 2015, pp. 1-6.
13. S. Zhang, X. Xu, L. Lu, Y. Wu, G. He, and Y. Chen, "Sparse code multiple access: An energy efficient uplink approach for 5G wireless systems, " in Proc. IEEE Global Commun. Conf., Dec. 2014, pp. 4782-4787.
14. H. Mu, Z. Ma, M. Alhaji, P. Fan, and D. Chen, "A fixed low complexity message pass algorithm detector for up-link SCMA system, " IEEE Wireless Commun. Lett., vol. 4, no. 6, pp. 585-588, Dec. 2015.
15. D. Wei, Y. Han, S. Zhang, and L. Liu, "Weighted message passing algo-rithm for SCMA, " in Proc. Wireless Commun. Signal Process. (WCSP), Oct. 2015, pp. 1-5.
16. U. Fincke and M. Pohst, "Improved methods for calculating vectors of short length in a lattice, including a complexity analysis, " Math. Comput., vol. 44, no. 170, pp. 463-471, Apr. 1985.
17. M. Pohst, "On the computation of lattice vectors of minimal length, successive minima and reduced bases with applications, " ACM SIGSAM Bull., vol. 15, no. 1, pp. 37-44, 1981.
18. B. M. Hochwald and S. ten Brink, "Achieving near-capacity on a multiple-antenna channel, " IEEE Trans. Commun., vol. 51, no. 3, pp. 389-399, Mar. 2003.
19. F. Wei and W. Chen, "A low complexity SCMA decoder based on list sphere decoding, " in Proc. IEEE Global Commun. (GC), Washington, DC, USA, Dec. 2016.
20. E. Viterbo and J. Boutros, "A universal lattice code decoder for fading channels, " IEEE Trans. Inf. Theory, vol. 45, no. 5, pp. 1639-1642, Jul. 1999.
21. E. Agrell, T. Eriksson, A. Vardy, and K. Zeger, "Closest point search in lattices, " IEEE Trans. Inf. Theory, vol. 48, no. 8, pp. 2201-2214, Aug. 2002.
22. M. O. Damen, H. El Gamal, and G. Caire, "On maximum-likelihood detection and the search for the closest lattice point, " IEEE Trans. Inf. Theory, vol. 49, no. 10, pp. 2389-2402, Oct. 2003.
23. M. O. Damen, A. Chkeif, and J.-C. Belfiore, "Lattice code decoder for space-time codes, " IEEE Commun. Lett., vol. 4, no. 5, pp. 161-163, May 2000.
24. C. Studer and H. Bolcskei, "Soft-input soft-output single tree-search sphere decoding, " IEEE Trans. Inf. Theory, vol. 56, no. 10, pp. 4827-4842, Oct. 2010.
25. M. M. Mansour, S. P. Alex, and L. M. A. Jalloul, "Reduced complexity soft-output MIMO sphere detectors-Part I: Algorithmic optimizations, " IEEE Trans. Signal Process., vol. 62, no. 21, pp. 5505-5520, Nov. 2014.
26. G. Papa, D. Ciuonzo, G. Romano, and P. S. Rossi, "A dominance-based soft-input soft-output MIMO detector with near-optimal performance, " IEEE Trans. Commun., vol. 62, no. 12, pp. 4320-4335, Dec. 2014.
27. L. Wei and W. Chen, "Efficient compute-and-forward network codes search for two-way relay channels, " IEEE Commun. Lett., vol. 16, no. 8, pp. 1204-1207, Aug. 2012.
28. L. Wei and W. Chen, "Compute-and-forward network coding design over multi-source multi-relay channels, " IEEE Trans. Wireless Commun., vol. 11, no. 9, pp. 3348-3357, Sep. 2012.
29. Y. Wu, S. Zhang, and Y. Chen, "Iterative multiuser receiver in sparse code multiple access systems, " in Proc. IEEE Int. Conf. Commun. (ICC), Jun. 2015, pp. 2918-2923.
30. C. P. Schnorr and M. Euchner, "Lattice basis reduction: Improved practical algorithms and solving subset sum problems, " Math. Program., vol. 66, no. 1, pp. 181-191, 1994.
31. F. R. Kschischang and B. J. Frey, "Iterative decoding of compound codes by probability propagation in graphical models, " IEEE J. Sel. Areas Commun., vol. 16, no. 2, pp. 219-230, Feb. 1998.
32. J. Jalden and B. Ottersten, "On the complexity of sphere decoding in digital communications, " IEEE Trans. Signal Process., vol. 53, no. 4, pp. 1474-1484, Apr. 2005.
33. B. Hassibi and H. Vikalo, "On the sphere-decoding algorithm I. Expected complexity, " IEEE Trans. Signal Process., vol. 53, no. 8, pp. 2806-2818, Aug. 2005.
34. H. Vikalo and B. Hassibi, "On the sphere-decoding algorithm II. Gener-alizations, second-order statistics, and applications to communications, " IEEE Trans. Signal Process., vol. 53, no. 8, pp. 2819-2834, Aug. 2005.
35. T. Cui and C. Tellambura, "An efficient generalized sphere decoder for rank-deficient MIMO systems, " IEEE Commun. Lett., vol. 9, no. 5, pp. 423-425, May 2005.
36. G. H. Golub and C. Van Loan, Matrix Computations. Baltimore, MD, USA: The John Hopkins Univ. Press, 1993.
37. J. F. Blinn, "Floating-point tricks, " IEEE Comput. Graph. Appl., vol. 17, no. 4, pp. 80-84, Jul. 1997.