{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T12:23:00Z","timestamp":1740140580781,"version":"3.37.3"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,8,29]],"date-time":"2017-08-29T00:00:00Z","timestamp":1503964800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Wireless Com Network"],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1186\/s13638-017-0927-y","type":"journal-article","created":{"date-parts":[[2017,8,29]],"date-time":"2017-08-29T08:22:53Z","timestamp":1503994973000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A novel physical layer scheme based on superposition codes"],"prefix":"10.1186","volume":"2017","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0692-8566","authenticated-orcid":false,"given":"Pietro","family":"Savazzi","sequence":"first","affiliation":[]},{"given":"Anna","family":"Vizziello","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,8,29]]},"reference":[{"issue":"5","key":"927_CR1","doi-asserted-by":"crossref","first-page":"2541","DOI":"10.1109\/TIT.2012.2184847","volume":"58","author":"A Joseph","year":"2012","unstructured":"A Joseph, AR Barron, Least squares superposition codes of moderate dictionary size are reliable at rates up to capacity. IEEE Trans. Inf. Theory. 58(5), 2541\u20132557 (2012).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"927_CR2","doi-asserted-by":"crossref","first-page":"919","DOI":"10.1109\/TIT.2013.2289865","volume":"60","author":"A Joseph","year":"2014","unstructured":"A Joseph, AR Barron, Fast sparse superposition codes have near exponential error probability for R < C. IEEE Trans. Inf. Theory. 60(2), 919\u2013942 (2014).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"927_CR3","volume-title":"Proc. IEEE Int. Symp. on Information Theory (ISIT)","author":"AR Barron","year":"2012","unstructured":"AR Barron, S Cho, in Proc. IEEE Int. Symp. on Information Theory (ISIT). High-rate sparse superposition codes with Iteratively Optimal Estimates (IEEECambridge, 2012)."},{"issue":"5","key":"927_CR4","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","volume":"27","author":"CE Shannon","year":"1948","unstructured":"CE Shannon, A mathematical theory of communication. Bell Syst. Tech. J.27(5), 379\u2013423623656 (1948).","journal-title":"Bell Syst. Tech. J."},{"issue":"6","key":"927_CR5","doi-asserted-by":"crossref","first-page":"2384","DOI":"10.1109\/18.720542","volume":"44","author":"GD Forney Jr.","year":"1998","unstructured":"GD Forney Jr., G Ungerboeck, Modulation and coding for linear Gaussian channels. IEEE Trans. Inf. Theory. 44(6), 2384\u20132415 (1998).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"927_CR6","volume-title":"Error Control Coding, Second Edition","author":"S Lin","year":"2004","unstructured":"S Lin, DJ Costello, Error Control Coding, Second Edition (Prentice-Hall, Inc, Upper Saddle River, 2004)."},{"issue":"1","key":"927_CR7","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1109\/JRPROC.1949.232969","volume":"37","author":"CE Shannon","year":"1949","unstructured":"CE Shannon, Communication in the presence of noise. Proc. IRE. 37(1), 10\u201321 (1949).","journal-title":"Proc. IRE"},{"key":"927_CR8","first-page":"29","volume-title":"Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis. SC \u201909","author":"Z Chen","year":"2009","unstructured":"Z Chen, in Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis. SC \u201909. Optimal real number codes for fault tolerant matrix operations (ACMNew York, 2009), pp. 29\u201312910."},{"issue":"2","key":"927_CR9","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1109\/JSAC.1984.1146063","volume":"2","author":"TG Marshall Jr.","year":"1984","unstructured":"TG Marshall Jr., Coding of real-number sequences for error correction: a digital signal processing problem. IEEE J Sel. Areas Commun. 2(2), 381\u2013392 (1984).","journal-title":"IEEE J Sel. Areas Commun"},{"issue":"6","key":"927_CR10","doi-asserted-by":"crossref","first-page":"1006","DOI":"10.1109\/TCOMM.2006.876843","volume":"54","author":"TH Liew","year":"2006","unstructured":"TH Liew, LL Yang, L Hanzo, Systematic redundant residue number system codes: analytical upper bound and iterative decoding performance over AWGN and Rayleigh channels. IEEE Trans. Commun. 54(6), 1006\u20131016 (2006).","journal-title":"IEEE Trans. Commun"},{"issue":"3","key":"927_CR11","doi-asserted-by":"crossref","first-page":"707","DOI":"10.1109\/TIT.2002.808101","volume":"49","author":"Z Wang","year":"2003","unstructured":"Z Wang, GB Giannakis, Complex-field coding for OFDM over fading wireless channels. IEEE Trans. Inf. Theory. 49(3), 707\u2013720 (2003).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"927_CR12","first-page":"1","volume":"6","author":"E Goldoni","year":"2017","unstructured":"E Goldoni, P Savazzi, A Vizziello, A novel channel coding scheme for rfid generation-2 systems. Electronics. 6(1), 1\u20139 (2017). \n                        http:\/\/www.mdpi.com\/2079-9292\/6\/1\/4\n                        \n                    . doi:10.3390\/electronics6010004.","journal-title":"Electronics"},{"key":"927_CR13","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/j.comnet.2016.06.010","volume":"106","author":"IF Akyildiz","year":"2016","unstructured":"IF Akyildiz, S Nie, S-C Lin, M Chandrasekaran, 5g roadmap: 10 key enabling technologies. Comput. Netw.106:, 17\u201348 (2016).","journal-title":"Comput. Netw."},{"issue":"3","key":"927_CR14","doi-asserted-by":"crossref","first-page":"1476","DOI":"10.1109\/TIT.2017.2649460","volume":"63","author":"C Rush","year":"2017","unstructured":"C Rush, A Greig, R Venkataramanan, Capacity-achieving sparse superposition codes via approximate message passing decoding. IEEE Trans. Inf. Theory. 63(3), 1476\u20131500 (2017).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"7","key":"927_CR15","doi-asserted-by":"crossref","first-page":"4680","DOI":"10.1109\/TIT.2011.2146090","volume":"57","author":"TT Cai","year":"2011","unstructured":"TT Cai, L Wang, Orthogonal matching pursuit for sparse signal recovery with noise. IEEE Trans. Inf. Theory. 57(7), 4680\u20134688 (2011).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"927_CR16","first-page":"1","volume-title":"2015 IEEE Workshop on Signal Processing Systems (SiPS)","author":"C Condo","year":"2015","unstructured":"C Condo, WJ Gross, in 2015 IEEE Workshop on Signal Processing Systems (SiPS). Sparse superposition codes: a practical approach (IEEEHangzhou, 2015), pp. 1\u20136."},{"issue":"9","key":"927_CR17","doi-asserted-by":"crossref","first-page":"2421","DOI":"10.1109\/TSP.2017.2664045","volume":"65","author":"C Condo","year":"2017","unstructured":"C Condo, WJ Gross, Implementation of sparse superposition codes. IEEE Trans. Signal Proc.65(9), 2421\u20132427 (2017).","journal-title":"IEEE Trans. Signal Proc."},{"key":"927_CR18","doi-asserted-by":"crossref","first-page":"1494","DOI":"10.1109\/ISIT.2014.6875082","volume-title":"2014 IEEE International Symposium on Information Theory","author":"J Barbier","year":"2014","unstructured":"J Barbier, F Krzakala, in 2014 IEEE International Symposium on Information Theory. Replica analysis and approximate message passing decoder for superposition codes (IEEEHonolulu, 2014), pp. 1494\u20131498."},{"issue":"1","key":"927_CR19","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1186\/1687-1499-2013-18","volume":"2013","author":"A Marinoni","year":"2013","unstructured":"A Marinoni, P Savazzi, P Gamba, Efficient detection and decoding of q-ary ldpc coded signals over partial response channels. EURASIP J. Wirel. Commun. Netw.2013(1), 18 (2013).","journal-title":"EURASIP J. Wirel. Commun. Netw."},{"key":"927_CR20","volume-title":"Proc. IEEE International Conference on Communications (ICC)","author":"A Marinoni","year":"2010","unstructured":"A Marinoni, P Savazzi, in Proc. IEEE International Conference on Communications (ICC). Ecient receivers for q-ary LDPC coded signals over partial response channels (IEEECape Town, 2010)."},{"issue":"2","key":"927_CR21","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1109\/MSP.2007.914731","volume":"25","author":"EJ Candes","year":"2008","unstructured":"EJ Candes, MB Wakin, An introduction to compressive sampling. IEEE Signal Proc. Mag.25(2), 21\u201330 (2008).","journal-title":"IEEE Signal Proc. Mag."},{"issue":"2","key":"927_CR22","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1109\/MCOM.2014.6736749","volume":"52","author":"G Wunder","year":"2014","unstructured":"G Wunder, P Jung, M Kasparick, T Wild, F Schaich, Y Chen, ST Brink, I Gaspar, N Michailow, A Festag, L Mendes, N Cassiau, D Ktenas, M Dryjanski, S Pietrzyk, B Eged, P Vago, F Wiedmann, 5GNOW: non-orthogonal, asynchronous waveforms for future mobile applications. IEEE Commun. Mag.52(2), 97\u2013105 (2014).","journal-title":"IEEE Commun. Mag."},{"key":"927_CR23","first-page":"1","volume-title":"2013 IEEE 77th Vehicular Technology Conference (VTC Spring)","author":"HF Schepker","year":"2013","unstructured":"HF Schepker, C Bockelmann, A Dekorsy, in 2013 IEEE 77th Vehicular Technology Conference (VTC Spring). Coping with cdma asynchronicity in compressive sensing multi-user detection (IEEEDresden, 2013), pp. 1\u20135."},{"issue":"2","key":"927_CR24","doi-asserted-by":"crossref","first-page":"454","DOI":"10.1109\/TCOMM.2011.121410.090570","volume":"59","author":"H Zhu","year":"2011","unstructured":"H Zhu, GB Giannakis, Exploiting sparse user activity in multiuser detection. IEEE Trans. Commun. 59(2), 454\u2013465 (2011).","journal-title":"IEEE Trans. Commun"},{"key":"927_CR25","volume-title":"Proc. IEEE International Symposium on Information Theory (ISIT)","author":"AC Gilbert","year":"2005","unstructured":"AC Gilbert, JA Tropp, in Proc. IEEE International Symposium on Information Theory (ISIT). Applications of sparse approximation in communications (IEEEAdelaide, 2005)."},{"issue":"3","key":"927_CR26","doi-asserted-by":"crossref","first-page":"1030","DOI":"10.1109\/TIT.2005.864420","volume":"52","author":"JA Tropp","year":"2006","unstructured":"JA Tropp, Just relax: convex programming methods for identifying sparse signals in noise. IEEE Trans. Inf. Theory. 52(3), 1030\u20131051 (2006).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"45","key":"927_CR27","doi-asserted-by":"crossref","first-page":"18914","DOI":"10.1073\/pnas.0909892106","volume":"106","author":"DL Donoho","year":"2009","unstructured":"DL Donoho, A Maleki, A Montanari, Message-passing algorithms for compressed sensing. Proc. Natl. Acad. Sci.106(45), 18914\u201318919 (2009).","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"1","key":"927_CR28","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1109\/TIT.1972.1054727","volume":"18","author":"TM Cover","year":"1972","unstructured":"TM Cover, Broadcast channels. IEEE Trans. Inf. Theory. 18(1), 2\u201314 (1972).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"927_CR29","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1109\/MVT.2006.307294","volume":"1","author":"P Wang","year":"2006","unstructured":"P Wang, J Xiao, L Ping, Comparison of orthogonal and non-orthogonal approaches to future wireless cellular systems. IEEE Veh. Technol. Mag.1(3), 4\u201311 (2006).","journal-title":"IEEE Veh. Technol. Mag."},{"issue":"4","key":"927_CR30","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1109\/MVT.2006.343643","volume":"1","author":"P Wang","year":"2006","unstructured":"P Wang, J Xiao, L Ping, Correction to \u201cComparison of Orthogonal and Non-Orthogonal Approaches to Future Wireless Cellular Systems\u201d. EEE Veh. Technol. Mag.1(4), 42 (2006).","journal-title":"EEE Veh. Technol. Mag."},{"issue":"4","key":"927_CR31","doi-asserted-by":"crossref","first-page":"34","DOI":"10.4304\/jcm.3.4.34-40","volume":"3","author":"P Savazzi","year":"2008","unstructured":"P Savazzi, P Gamba, L Favalli, An iterative algorithm for joint symbol timing recovery and equalization of short bursts. J. Commun.3(4), 34\u201340 (2008).","journal-title":"J. Commun."},{"issue":"10","key":"927_CR32","doi-asserted-by":"crossref","first-page":"1729","DOI":"10.1109\/TCOMM.2008.060489","volume":"56","author":"P Savazzi","year":"2008","unstructured":"P Savazzi, P Gamba, Iterative symbol timing recovery for short burst transmission schemes. IEEE Trans. Commun. 56(10), 1729\u20131736 (2008).","journal-title":"IEEE Trans. Commun"}],"container-title":["EURASIP Journal on Wireless Communications and Networking"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13638-017-0927-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/s13638-017-0927-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13638-017-0927-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,8,29]],"date-time":"2017-08-29T08:22:59Z","timestamp":1503994979000},"score":1,"resource":{"primary":{"URL":"https:\/\/jwcn-eurasipjournals.springeropen.com\/articles\/10.1186\/s13638-017-0927-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,29]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,12]]}},"alternative-id":["927"],"URL":"https:\/\/doi.org\/10.1186\/s13638-017-0927-y","relation":{},"ISSN":["1687-1499"],"issn-type":[{"type":"electronic","value":"1687-1499"}],"subject":[],"published":{"date-parts":[[2017,8,29]]},"article-number":"146"}}