{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T04:16:33Z","timestamp":1746072993172,"version":"3.40.4"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,5,17]],"date-time":"2013-05-17T00:00:00Z","timestamp":1368748800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/2.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Wireless Com Network"],"published-print":{"date-parts":[[2013,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Tail-biting trellises are defined on a circular time axis and can have a smaller number of states than equivalent conventional trellises. Existing circular Viterbi algorithms (CVAs) on the tail-biting trellis are non-convergent and sub-optimal. In this study, we show that the net path metric of each tail-biting path is lower-bounded during the decoding process of the CVA. This property can be applied to remove unnecessary iterations of the CVA and results in a convergent maximum likelihood (ML) decoder. Simulation results show that the proposed algorithm exhibits higher decoding efficiency compared with other existing ML decoders.<\/jats:p>","DOI":"10.1186\/1687-1499-2013-130","type":"journal-article","created":{"date-parts":[[2013,5,17]],"date-time":"2013-05-17T06:15:29Z","timestamp":1368771329000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A low-complexity maximum likelihood decoder for tail-biting trellis"],"prefix":"10.1186","volume":"2013","author":[{"given":"Xiaotao","family":"Wang","sequence":"first","affiliation":[]},{"given":"Hua","family":"Qian","sequence":"additional","affiliation":[]},{"given":"Kai","family":"Kang","sequence":"additional","affiliation":[]},{"given":"Weidong","family":"Xiang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,5,17]]},"reference":[{"issue":"5","key":"720_CR1","doi-asserted-by":"publisher","first-page":"1435","DOI":"10.1109\/18.771145","volume":"45","author":"A Calderbank","year":"1999","unstructured":"Calderbank A, Forney G, Vardy A: Minimal tailbiting trellises: Golay code and more. IEEE Trans. Inf. Theory 1999, 45(5):1435-1455. 10.1109\/18.771145","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"7","key":"720_CR2","doi-asserted-by":"publisher","first-page":"2562","DOI":"10.1109\/18.796408","volume":"45","author":"P Stahl","year":"1999","unstructured":"Stahl P, Anderson J, Johannesson R: Optimal and near-optimal encoders for short and moderate-length tailbiting trellises. IEEE Trans. Inf. Theory 1999, 45(7):2562-2571. 10.1109\/18.796408","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"720_CR3","doi-asserted-by":"publisher","first-page":"738","DOI":"10.1109\/TIT.2010.2094850","volume":"57","author":"H Gluesing-Luerssen","year":"2011","unstructured":"Gluesing-Luerssen H, Weaver E: Linear tail-biting trellises: characteristic generators and the BCJR-construction. IEEE Trans. Inf. Theory 2011, 57(2):738-751.","journal-title":"IEEE Trans. Inf. Theory"},{"key":"720_CR4","doi-asserted-by":"crossref","unstructured":"Wang X, Qian H, Xu J, Yang Y, Wang F: An efficient CVA-based decoding algorithm for tail-biting codes. In IEEE Global Telecommunications Conference. Houston; 5\u20139 Dec 2011:1-5.","DOI":"10.1109\/GLOCOM.2011.6133569"},{"key":"720_CR5","unstructured":"Shankar P, Kumar P, Sasidharan K, Rajan B, Madhu A: Efficient convergent maximum likelihood decoding on tail-biting (2007). . Accessed 10 Aug 2007 http:\/\/arxiv.org\/pdf\/cs\/0601023v1.pdf"},{"issue":"12","key":"720_CR6","doi-asserted-by":"publisher","first-page":"883","DOI":"10.1109\/LCOMM.2008.072181","volume":"12","author":"H Pai","year":"2008","unstructured":"Pai H, Han Y, Wu T, Chen P, Shieh S: Low-complexity ML decoding for convolutional tail-biting codes. IEEE Commun. Lett 2008, 12(12):883-885.","journal-title":"IEEE Commun. Lett"},{"issue":"10","key":"720_CR7","doi-asserted-by":"publisher","first-page":"1658","DOI":"10.1109\/TCOMM.2003.818084","volume":"51","author":"R Shao","year":"2003","unstructured":"Shao R, Lin S, Fossorier M: Two decoding algorithms for tailbiting codes. IEEE Trans. Commun. 2003, 51(10):1658-1665. 10.1109\/TCOMM.2003.818084","journal-title":"IEEE Trans. Commun"},{"key":"720_CR8","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1002\/ett.979","volume":"15","author":"IE Bocharova","year":"2004","unstructured":"Bocharova IE, Johannesson R, Kudryashov BD, Loncar M: BEAST decoding for block codes. Europ. Trans. Telecomm. 2004, 15: 297-305. 10.1002\/ett.979","journal-title":"Europ. Trans. Telecomm"},{"key":"720_CR9","volume-title":"IEEE Std 802.16\u20132009, IEEE Standard for, Local and Metropolitan Area Networks Part 16: Air Interface for Broadband Wireless Access Systems","author":"IEEE","year":"2009","unstructured":"IEEE: IEEE Std 802.16\u20132009, IEEE Standard for, Local and Metropolitan Area Networks Part 16: Air Interface for Broadband Wireless Access Systems. Piscataway: IEEE; 2009."},{"key":"720_CR10","volume-title":"3GPP TS 36.212, Technical Specification, Group Radio Access Network; Evolved Universal Terrestrial Radio Access (E-UTRA); Multiplexing and Channel Coding (Release 8)","author":"3rd Generation Partnership Project","year":"2007","unstructured":"3rd Generation Partnership Project: 3GPP TS 36.212, Technical Specification, Group Radio Access Network; Evolved Universal Terrestrial Radio Access (E-UTRA); Multiplexing and Channel Coding (Release 8). Sophia Antipolis: ETSI; 2007."}],"container-title":["EURASIP Journal on Wireless Communications and Networking"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/1687-1499-2013-130.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/1687-1499-2013-130\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/1687-1499-2013-130.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T10:27:38Z","timestamp":1746008858000},"score":1,"resource":{"primary":{"URL":"https:\/\/jwcn-eurasipjournals.springeropen.com\/articles\/10.1186\/1687-1499-2013-130"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,5,17]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,12]]}},"alternative-id":["720"],"URL":"https:\/\/doi.org\/10.1186\/1687-1499-2013-130","relation":{},"ISSN":["1687-1499"],"issn-type":[{"type":"electronic","value":"1687-1499"}],"subject":[],"published":{"date-parts":[[2013,5,17]]},"assertion":[{"value":"16 August 2012","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 May 2013","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 May 2013","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"130"}}