{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T15:01:53Z","timestamp":1761663713063,"version":"3.41.0"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"S6","license":[{"start":{"date-parts":[[2018,3,2]],"date-time":"2018-03-02T00:00:00Z","timestamp":1519948800000},"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":["Cluster Comput"],"published-print":{"date-parts":[[2019,11]]},"DOI":"10.1007\/s10586-018-2237-5","type":"journal-article","created":{"date-parts":[[2018,3,2]],"date-time":"2018-03-02T13:10:07Z","timestamp":1519996207000},"page":"14091-14097","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Performance analysis of sub-interleaver based turbo codes"],"prefix":"10.1007","volume":"22","author":[{"given":"M. Rajani","family":"Devi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Ramanjaneyulu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B. T.","family":"Krishna","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,3,2]]},"reference":[{"key":"2237_CR1","doi-asserted-by":"crossref","unstructured":"Berrou, C., Glavieux, A., Thitimajshima, P.: Near Shannon limit error-correcting coding and decoding: turbo codes. In: Proceedings of IEEE ICC93, pp. 1064\u20131070. Geneva, Switzerland (1993)","DOI":"10.1109\/ICC.1993.397441"},{"issue":"1","key":"2237_CR2","first-page":"73","volume":"2","author":"N Singh","year":"2014","unstructured":"Singh, N., Kaur, G.: Performance analysis of serially concatenated convolutional codes using different generator polynomial and constraint length. Adv. R. Electr. Electron. Eng. 2(1), 73\u201376 (2014)","journal-title":"Adv. R. Electr. Electron. Eng."},{"issue":"2","key":"2237_CR3","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1109\/TIT.1974.1055186","volume":"20","author":"L Bahl","year":"1974","unstructured":"Bahl, L., Cocke, J., Jelinek, F., Raviv, J.: Optimal decoding of linear codes for minimizing symbol error rate (Corresp.). IEEE Trans. Inf. Theory 20(2), 284\u2013287 (1974)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"2237_CR4","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1109\/49.661112","volume":"16","author":"Gerard Battail","year":"1998","unstructured":"Battail, Gerard: A Conceptual Framework for Understanding Turbo Codes. IEEE J. Sel. Areas Commun. 16(2), 245\u2013254 (1998)","journal-title":"IEEE J. Sel. Areas Commun."},{"issue":"1","key":"2237_CR5","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1049\/el:19980027","volume":"34","author":"AK Khandani","year":"1998","unstructured":"Khandani, A.K.: Design of turbo-code interleaver using hungarian method. Electron. Lett. 34(1), 63\u201365 (1998)","journal-title":"Electron. Lett."},{"key":"2237_CR6","unstructured":"Dolinar, S., Divsalar, D.: Weight distribution for turbo codes using random and nonrandom permutations. TDA Progress Report 42\u2013122, pp. 56\u201365 (1995)"},{"issue":"2","key":"2237_CR7","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1109\/18.485713","volume":"42","author":"S Benedetto","year":"1996","unstructured":"Benedetto, S., Montorsi, G.: Unveiling turbo-codes: some results on parallel concatenated coding schemes. IEEE Trans. Inf. Theory 42(2), 409\u2013428 (1996)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2237_CR8","unstructured":"Sklar, B.: Digital communications: fundamentals and applications. Second ed. Fundamentals of Turbo Codes. 2001: Prentice Hall"},{"key":"2237_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2999-3","volume-title":"Turbo Coding","author":"C Heegard","year":"1999","unstructured":"Heegard, C., Wicker, S.B.: Turbo Coding, 1st edn. Kluwer Academic Publisher, Boston (1999)","edition":"1"},{"issue":"5","key":"2237_CR10","first-page":"1","volume":"3","author":"PM Kumar","year":"2014","unstructured":"Kumar, P.M., Sutha, S., KrishnaMourthy, V.: Mathematical implementation of MAX LOG MAP algorithm for low power applications in turbo decoders. Int. J. Adv. Res. Electr. Electron. Instr. Eng. 3(5), 1\u201313 (2014)","journal-title":"Int. J. Adv. Res. Electr. Electron. Instr. Eng."},{"key":"2237_CR11","unstructured":"P. Deborah Roseline, G. Thavaseelan and R. Rani Hemamalini, \u201cDesign of Hybrid Log-MAP Algorithm for Turbo Decoding Using QPP Interleaver\u201d, Middle-East Journal of Scientific Research 23 (Sensing, Signal Processing and Security), 2015"},{"issue":"4","key":"2237_CR12","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1023\/A:1017925603986","volume":"8","author":"MC Valenti","year":"2001","unstructured":"Valenti, M.C., Sun, J.: The UMTS turbo code and an efficient decoder implementation suitable for software-defined radios. Int. J. Wireless Inf. Netw. 8(4), 203\u2013214 (2001)","journal-title":"Int. J. Wireless Inf. Netw."},{"key":"2237_CR13","doi-asserted-by":"publisher","first-page":"1577","DOI":"10.1049\/el:19981120","volume":"34","author":"WJ Gross","year":"1998","unstructured":"Gross, W.J., Gulak, P.G.: Simplified MAP algorithm suitable for implementation of turbo decoders. IEEE Electron. Lett. 34, 1577\u20131578 (1998)","journal-title":"IEEE Electron. Lett."},{"key":"2237_CR14","unstructured":"Classon, B., Blankenship, K., Desai, V.: Turbo decoding with the constant log-MAP algorithm. In: Proceedings of Second International Symposium Turbo Codes and Related Applications, (Brest, France), pp. 467\u2013470 (2000)"},{"issue":"1","key":"2237_CR15","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1109\/TIT.2004.839478","volume":"51","author":"J Sun","year":"2005","unstructured":"Sun, J., Takeshita, O.Y.: Interleavers for turbo codes using permutation polynomials over integer rings. IEEE Trans. Inf. Theory 51(1), 101\u2013119 (2005)","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Cluster Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-018-2237-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10586-018-2237-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-018-2237-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T08:04:55Z","timestamp":1751443495000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10586-018-2237-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3,2]]},"references-count":15,"journal-issue":{"issue":"S6","published-print":{"date-parts":[[2019,11]]}},"alternative-id":["2237"],"URL":"https:\/\/doi.org\/10.1007\/s10586-018-2237-5","relation":{},"ISSN":["1386-7857","1573-7543"],"issn-type":[{"type":"print","value":"1386-7857"},{"type":"electronic","value":"1573-7543"}],"subject":[],"published":{"date-parts":[[2018,3,2]]},"assertion":[{"value":"12 January 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 February 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 February 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 March 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}