{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T15:03:14Z","timestamp":1761663794476,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030011673"},{"type":"electronic","value":"9783030011680"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-01168-0_18","type":"book-chapter","created":{"date-parts":[[2018,9,28]],"date-time":"2018-09-28T00:03:17Z","timestamp":1538092997000},"page":"191-199","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Spectral Efficiency Comparison Between FTN Signaling and Optimal PR Signaling for Low Complexity Detection Algorithm"],"prefix":"10.1007","author":[{"given":"Aleksei","family":"Plotnikov","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9260-9440","authenticated-orcid":false,"given":"Aleksandr","family":"Gelgor","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,9,29]]},"reference":[{"issue":"8","key":"18_CR1","doi-asserted-by":"publisher","first-page":"1451","DOI":"10.1002\/j.1538-7305.1975.tb02043.x","volume":"54","author":"JE Mazo","year":"1975","unstructured":"Mazo, J.E.: Faster-than-Nyquist signaling. Bell Syst. Tech. J. 54(8), 1451\u20131462 (1975)","journal-title":"Bell Syst. Tech. J."},{"issue":"9","key":"18_CR2","doi-asserted-by":"publisher","first-page":"1502","DOI":"10.1109\/TCOMM.2003.816943","volume":"51","author":"AD Liveris","year":"2003","unstructured":"Liveris, A.D., Georghiades, C.N.: Exploiting faster-than-Nyquist signaling. IEEE Trans. Commun. 51(9), 1502\u20131511 (2003)","journal-title":"IEEE Trans. Commun."},{"issue":"2","key":"18_CR3","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1109\/18.661514","volume":"44","author":"A Said","year":"1998","unstructured":"Said, A., Anderson, J.B.: Bandwidth-efficient coded modulation with optimized linear partial-response signals. IEEE Trans. Inf. Theory 44(2), 701\u2013713 (1998)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"18_CR4","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1109\/PROC.1973.9030","volume":"61","author":"GD Forney","year":"1973","unstructured":"Forney, G.D.: The Viterbi Algorithm. Proc. IEEE 61(3), 268\u2013278 (1973)","journal-title":"Proc. IEEE"},{"issue":"2","key":"18_CR5","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1109\/TIT.1974.1055186","volume":"20","author":"L. Bahl","year":"1974","unstructured":"Bahl, L.R., et al.: Optimal decoding of linear codes for minimizing symbol rate. IEEE Trans. Inform. Theory IT-20, 284\u2013287 (1974)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"5","key":"18_CR6","doi-asserted-by":"publisher","first-page":"944","DOI":"10.1109\/18.42212","volume":"35","author":"J.B. Anderson","year":"1989","unstructured":"Anderson, J.B.: Limited search trellis decoding of convolutional codes. IEEE Trans. Inf. Theory 35, 944\u2013955 (1989)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"18_CR7","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1109\/49.661107","volume":"16","author":"V Franz","year":"1998","unstructured":"Franz, V., Anderson, J.: Concatenated decoding with a reduced search BCJR algorithm. IEEE J. Sel. Areas Commun. 16(2), 186\u2013195 (1998)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"18_CR8","unstructured":"Rusek, F.: Partial response and faster-than-Nyquist signaling. Ph.D. dissertation. Lund University (2007)"},{"key":"18_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1007\/978-3-319-46301-8_54","volume-title":"Internet of Things, Smart Spaces, and Next Generation Networks and Systems","author":"A Gorlov","year":"2016","unstructured":"Gorlov, A., Gelgor, A., Nguyen, V.P.: Root-Raised cosine versus optimal finite pulses for faster-than-Nyquist generation. In: Galinina, O., Balandin, S., Koucheryavy, Y. (eds.) NEW2AN\/ruSMART 2016. LNCS, vol. 9870, pp. 628\u2013640. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-46301-8_54"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Robertson, P., Villerbrun, E., Hoeher, P.: A comparison of optimal and sub-optimal MAP decoding algorithms operating in the log domain. In: Proceedings of International Conference on Communications, Seattle, WA, June 1995, pp. 1009\u20131013 (1995)","DOI":"10.1109\/ICC.1995.524253"},{"key":"18_CR11","unstructured":"Fragouli, C., Seshadri, N., Turin, W.: On the rediced trellis equalization using the M-BCJR algorithm. Technical report TR 99.15.1, Florham Park, NJ, November 1999"}],"container-title":["Lecture Notes in Computer Science","Internet of Things, Smart Spaces, and Next Generation Networks and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-01168-0_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,12,14]],"date-time":"2018-12-14T23:57:09Z","timestamp":1544831829000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-01168-0_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030011673","9783030011680"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-01168-0_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"NEW2AN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Next Generation Wired\/Wireless Networking","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"St. Petersburg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 August 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 August 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"new2an2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.new2an.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"EDAS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"186","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"64","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"34% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}