{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T20:34:32Z","timestamp":1729629272468,"version":"3.28.0"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1109\/isit.2005.1523356","type":"proceedings-article","created":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T11:51:59Z","timestamp":1160567519000},"page":"363-367","source":"Crossref","is-referenced-by-count":2,"title":["A novel class of low-complexity SISO algorithms for phase-uncertain communications"],"prefix":"10.1109","author":[{"given":"M.","family":"Franceschini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Ferrari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Raheli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Curtoni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2003.809286"},{"journal-title":"Communication Theory Workshop","year":"2004","key":"13"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.1994.582823"},{"key":"11","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1049\/ip-com:20000175","article-title":"Iterative decoding for coded noncoherent MPSK communications over phase-noisy AWGN channel","volume":"147","author":"peleg","year":"2000","journal-title":"IEE Proceedings-Commun"},{"key":"12","article-title":"Serial concatenation of LDPC codes and differentially encoded modulations","author":"franceschini","year":"2004","journal-title":"Proc Int Symp Inform Theory Applicat (ISITA)"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4899-1807-9"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/4234.552145"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/26.539767"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2003.818087"},{"journal-title":"IEEE J Select Areas Commun","article-title":"A unified framework for finite-memory detection","year":"2005","key":"7"},{"key":"6","article-title":"Finite memory detection: Optimality and reality","author":"ferrari","year":"2003","journal-title":"Proc 5th Int Symp Turbo Codes and Related Topics"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/26.871389"},{"journal-title":"Digital Communications 4th Ed","year":"2001","author":"proakis","key":"4"},{"key":"9","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","author":"gallager","year":"1963","journal-title":"Low-Density Parity-Check Codes"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1974.1055186"}],"event":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","start":{"date-parts":[[2005,9,4]]},"location":"Adelaide, Australia","end":{"date-parts":[[2005,9,9]]}},"container-title":["Proceedings. International Symposium on Information Theory, 2005. ISIT 2005."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/10215\/32581\/01523356.pdf?arnumber=1523356","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,21]],"date-time":"2019-04-21T12:42:52Z","timestamp":1555850572000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1523356\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/isit.2005.1523356","relation":{},"subject":[],"published":{"date-parts":[[2005]]}}}