{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:23:40Z","timestamp":1740122620113,"version":"3.37.3"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,5,31]],"date-time":"2023-05-31T00:00:00Z","timestamp":1685491200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,5,31]],"date-time":"2023-05-31T00:00:00Z","timestamp":1685491200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Wireless Pers Commun"],"published-print":{"date-parts":[[2023,8]]},"DOI":"10.1007\/s11277-023-10530-0","type":"journal-article","created":{"date-parts":[[2023,5,31]],"date-time":"2023-05-31T16:03:56Z","timestamp":1685549036000},"page":"2019-2037","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Irregular SCMA Codebook Design Approaches"],"prefix":"10.1007","volume":"131","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0105-855X","authenticated-orcid":false,"given":"K.","family":"Madhura","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. S. S.","family":"Rukmini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rajeshree","family":"Raut","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,5,31]]},"reference":[{"issue":"5","key":"10530_CR1","doi-asserted-by":"publisher","first-page":"2950","DOI":"10.1109\/TCOMM.2020.2974213","volume":"68","author":"Y Chen","year":"2020","unstructured":"Chen, Y., & Chen, J. (2020). On the design of near-optimal sparse code multiple access codebooks. IEEE Transactions on Communications, 68(5), 2950\u20132962.","journal-title":"IEEE Transactions on Communications"},{"key":"10530_CR2","doi-asserted-by":"crossref","unstructured":"Jaber, S., Chen, W., Wang, K., & Wu, Q. (2020). SCMA spectral and energy efficiency with QoS. In GLOBECOM 2020-2020 IEEE Global Communications Conference, Taipei, Taiwan (pp. 1\u20136).","DOI":"10.1109\/GLOBECOM42002.2020.9322571"},{"issue":"4","key":"10530_CR3","doi-asserted-by":"publisher","first-page":"2295","DOI":"10.1109\/TWC.2020.3041295","volume":"20","author":"Q Wang","year":"2020","unstructured":"Wang, Q., & Ren, G. (2020). A partial Gaussian tree approximation (PGTA) detector for random multiple access oriented SCMA uplink with codebook collisions. IEEE Transactions on Wireless Communications, 20(4), 2295\u20132308.","journal-title":"IEEE Transactions on Wireless Communications"},{"key":"10530_CR4","doi-asserted-by":"crossref","unstructured":"Nikopour, H. et al. (2014). SCMA for downlink multiple access of 5G wireless networks. In proceedings of the IEEE global communications conference (GLOBECOM), Austin, TX, USA (pp. 3940\u20133945).","DOI":"10.1109\/GLOCOM.2014.7037423"},{"issue":"1","key":"10530_CR5","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1109\/LCOMM.2016.2613934","volume":"21","author":"M Zhao","year":"2017","unstructured":"Zhao, M., Zhou, S., Zhou, W., & Zhu, J. (2017). An improved uplink sparse coded multiple access. IEEE Communications Letters, 21(1), 176\u2013179.","journal-title":"IEEE Communications Letters"},{"key":"10530_CR6","doi-asserted-by":"crossref","unstructured":"Zhang, S. et al. (2015). Design and analysis of irregular sparse code multiple access. In 2015 International Conference on Wireless Communications & Signal Processing (WCSP). IEEE.","DOI":"10.1109\/WCSP.2015.7341327"},{"issue":"2","key":"10530_CR7","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1109\/18.910578","volume":"47","author":"TJ Richardson","year":"2001","unstructured":"Richardson, T. J., Shokrollahi, M. A., & Urbanke, R. L. (2001). Design of capacity-approaching irregular low-density parity-check codes. IEEE transactions on information theory, 47(2), 619\u2013637.","journal-title":"IEEE transactions on information theory"},{"key":"10530_CR8","doi-asserted-by":"publisher","unstructured":"Ni, S., Lei, T., Cheng, N., Song, X., Zhang, A., & Cheng, L. (2021). Irregular SCMA codebook design. In 2021 IEEE 21st International Conference on Communication Technology (ICCT), Tianjin, China (pp. 18\u201324). doi: https:\/\/doi.org\/10.1109\/ICCT52962.2021.9658013","DOI":"10.1109\/ICCT52962.2021.9658013"},{"key":"10530_CR9","doi-asserted-by":"crossref","unstructured":"Zhang, S., Xiao, B., Xiao, K., Chen, Z., & Xia, B. (2015). Design and analysis of irregular sparse code multiple access. In Proceedings of the IEEE International Conference on Wireless Communications and Signal Processing (WCSP), Nanjing China (pp. 1\u20135).","DOI":"10.1109\/WCSP.2015.7341327"},{"issue":"11","key":"10530_CR10","doi-asserted-by":"publisher","first-page":"11936","DOI":"10.1109\/TVT.2022.3194254","volume":"71","author":"Y-M Chen","year":"2022","unstructured":"Chen, Y.-M., Wang, P.-H., Cheng, C.-S., & Ueng, Y.-L. (2022). A joint design of SCMA codebook and PTS-based PAPR reduction for downlink OFDM scheme. IEEE Transactions on Vehicular Technology, 71(11), 11936\u201311948. https:\/\/doi.org\/10.1109\/TVT.2022.3194254","journal-title":"IEEE Transactions on Vehicular Technology"},{"key":"10530_CR11","doi-asserted-by":"publisher","first-page":"63232","DOI":"10.1109\/ACCESS.2018.2876030","volume":"6","author":"S Liu","year":"2018","unstructured":"Liu, S., Wang, J., Bao, J., & Liu, C. (2018). Optimized SCMA codebook design by QAM constellation segmentation with maximized MED. IEEE Access, 6, 63232\u201363242. https:\/\/doi.org\/10.1109\/ACCESS.2018.2876030","journal-title":"IEEE Access"},{"key":"10530_CR12","doi-asserted-by":"crossref","unstructured":"Yu, L. et al. (2016). An optimized design of irregular SCMA codebook based on rotated angles and EXIT chart. In 2016 IEEE 84th Vehicular Technology Conference (VTC-Fall). IEEE.","DOI":"10.1109\/VTCFall.2016.7880904"},{"key":"10530_CR13","doi-asserted-by":"crossref","unstructured":"Hidayat, I. et al. (2018). Doubly irregular sparse code multiple access with EXIT analysis. In 2018 International Conference on Signals and Systems (ICSigSys). IEEE.","DOI":"10.1109\/ICSIGSYS.2018.8372648"},{"key":"10530_CR14","unstructured":"Rebhi, M. et al. (2020). An adaptive uplink SCMA scheme based on channel state information. In Future Networks (5G and beyond) Workshop."},{"key":"10530_CR15","doi-asserted-by":"publisher","unstructured":"Huang, Y., & Vontobel, P. O. (2022). On the relationship between the minimum of the bethe free energy function of a factor graph and sum-product algorithm fixed points. In 2022 IEEE Information Theory Workshop (ITW), Mumbai, India (pp. 666-671). doi: https:\/\/doi.org\/10.1109\/ITW54588.2022.9965874","DOI":"10.1109\/ITW54588.2022.9965874"},{"key":"10530_CR16","doi-asserted-by":"publisher","unstructured":"Chen, Z., Zhao, H., & Hou, L. (2022). Sparse factor graph-based expanded iterative detection and decoding scheme for uplink polar coded SCMA system. In 2022 IEEE International Symposium on Broadband Multimedia Systems and Broadcasting (BMSB), Bilbao, Spain (pp. 1\u20136). doi: https:\/\/doi.org\/10.1109\/BMSB55706.2022.9828762","DOI":"10.1109\/BMSB55706.2022.9828762"},{"key":"10530_CR17","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511807046","volume-title":"Fundamentals of digital communication","author":"U Madhow","year":"2008","unstructured":"Madhow, U. (2008). Fundamentals of digital communication. Cambridge University Press."},{"key":"10530_CR18","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-981-15-5697-5_10","volume":"190","author":"Y Zhang","year":"2021","unstructured":"Zhang, Y., Zhou, L., Zhang, S., Chen, C., Yuqing, Fu., & He, Y. (2021). Improved window decoding of spatially coupled LDPC codes. Advances in Wireless Communications and Applications, 190, 85.","journal-title":"Advances in Wireless Communications and Applications"},{"issue":"4","key":"10530_CR19","doi-asserted-by":"publisher","first-page":"2632","DOI":"10.1109\/TCOMM.2018.2889850","volume":"67","author":"H-Y Kwak","year":"2019","unstructured":"Kwak, H.-Y., No, J.-S., & Park, H. (2019). Design of irregular SC-LDPC codes with non-uniform degree distributions by linear programming. IEEE Transactions on Communications, 67(4), 2632\u20132646. https:\/\/doi.org\/10.1109\/TCOMM.2018.2889850","journal-title":"IEEE Transactions on Communications"},{"key":"10530_CR20","doi-asserted-by":"crossref","unstructured":"Chen, Q., Yang, T. (2021). On linear physical-layer network coding with non-identical modulation. In 2021 IEEE Wireless Communications and Networking Conference (WCNC) (pp.1\u20137).","DOI":"10.1109\/WCNC49053.2021.9417472"},{"issue":"8","key":"10530_CR21","doi-asserted-by":"publisher","first-page":"4891","DOI":"10.1109\/TCOMM.2020.2995893","volume":"68","author":"T Wang","year":"2020","unstructured":"Wang, T., Liew, S. C., & Ullah, S. S. (2020). Optimal rate-diverse wireless network coding over parallel subchannels. IEEE Transactions on Communications, 68(8), 4891\u20134904. https:\/\/doi.org\/10.1109\/TCOMM.2020.2995893","journal-title":"IEEE Transactions on Communications"},{"key":"10530_CR22","doi-asserted-by":"crossref","unstructured":"Zhang, H., Niu, K., Xu, J., Dai, J., & Zhang, J. (2022). Iterative SIC-based multiuser detection for uplink heterogeneous NOMA system. In 2022 IEEE Globecom Workshops (GC Wkshps) (pp.94\u201399).","DOI":"10.1109\/GCWkshps56602.2022.10008655"},{"key":"10530_CR23","doi-asserted-by":"crossref","unstructured":"Anwar, K. (2016). High-dense multiway relay networks exploiting direct links as side information. In 2016 IEEE International Conference on Communications (ICC), Kuala Lumpur, Malaysia, (pp. 1\u20136).","DOI":"10.1109\/ICC.2016.7511178"},{"key":"10530_CR24","doi-asserted-by":"publisher","unstructured":"Hidayat, I., Meylani, L., Kurniawan, A., Arifianto, M. S. & Anwar, K. (2021). Investigating mother constellation of SCMA systems having capability of multiuser detection. In 2021 IEEE Symposium On Future Telecommunication Technologies (SOFTT), Bandung, Indonesia (pp. 52\u201356). doi: https:\/\/doi.org\/10.1109\/SOFTT54252.2021.9673140","DOI":"10.1109\/SOFTT54252.2021.9673140"},{"key":"10530_CR25","unstructured":"Madhura, K., Rukmini, M. S. S., & Raut, R. (2021). Optimized SCMA codebook design using rotation based sub-divided constellation for overloaded system. (Pre-print)."},{"key":"10530_CR26","doi-asserted-by":"publisher","unstructured":"Miao, J., Hu, X., & Zhao, Z. (2019). A low complexity multiuser detection scheme with dynamic factor graph for uplink SCMA systems. In 2019 IEEE\/CIC International Conference on Communications in China (ICCC), Changchun, China (pp. 846\u2013851). doi: https:\/\/doi.org\/10.1109\/ICCChina.2019.8855813","DOI":"10.1109\/ICCChina.2019.8855813"}],"container-title":["Wireless Personal Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-023-10530-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11277-023-10530-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-023-10530-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,19]],"date-time":"2023-07-19T17:26:54Z","timestamp":1689787614000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11277-023-10530-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,31]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,8]]}},"alternative-id":["10530"],"URL":"https:\/\/doi.org\/10.1007\/s11277-023-10530-0","relation":{},"ISSN":["0929-6212","1572-834X"],"issn-type":[{"type":"print","value":"0929-6212"},{"type":"electronic","value":"1572-834X"}],"subject":[],"published":{"date-parts":[[2023,5,31]]},"assertion":[{"value":"21 May 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 May 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors of this article, certify that they have NO affiliations with or involvement in any organization or entity with any financial interest (such as honoraria; educational grants; participation in speakers\u2019 bureaus; membership, employment, consultancies, stock ownership, or other equity interest; and expert testimony or patent-licensing arrangements), or non-financial interest (such as personal or professional relationships, affiliations, knowledge or beliefs) in the subject matter or materials discussed in this manuscript.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}}]}}