{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,21]],"date-time":"2023-01-21T05:42:36Z","timestamp":1674279756798},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,4,14]],"date-time":"2010-04-14T00:00:00Z","timestamp":1271203200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sign Process Syst"],"published-print":{"date-parts":[[2011,7]]},"DOI":"10.1007\/s11265-010-0478-5","type":"journal-article","created":{"date-parts":[[2010,4,13]],"date-time":"2010-04-13T06:24:07Z","timestamp":1271139847000},"page":"17-29","source":"Crossref","is-referenced-by-count":5,"title":["Turbo Product Code Decoder Without Interleaving Resource: From Parallelism Exploration to High Efficiency Architecture"],"prefix":"10.1007","volume":"64","author":[{"given":"Camille","family":"Leroux","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christophe","family":"Jego","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Patrick","family":"Adde","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Deepak","family":"Gupta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michel","family":"Jezequel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,4,14]]},"reference":[{"key":"478_CR1","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1109\/TIT.1962.1057683","volume":"IT","author":"RG Gallager","year":"1962","unstructured":"Gallager, R. G. (1962). Low density parity check codes. IRE Transactions on Information Theory, IT, 21\u201328.","journal-title":"IRE Transactions on Information Theory"},{"key":"478_CR2","doi-asserted-by":"crossref","unstructured":"Berrou, C., Glavieux, A., & Thitimajshima, P. (1993). Near Shannon limit error-correcting coding and decoding: Turbo-codes. In IEEE international conference on communications 1993, ICC 93, Geneva, 23\u201326 May 1993.","DOI":"10.1109\/ICC.1993.397441"},{"key":"478_CR3","unstructured":"Darabiha, A., Carusone, A. C., & Kschischang, F. R. (2007). A 3.3-Gbps bit-serial block-interlaced min-sum LDPC decoder in 0.13-um CMOS. In IEEE conference on custom integrated circuits, 2007, CICC \u201907."},{"key":"478_CR4","doi-asserted-by":"crossref","unstructured":"Pyndiah, R., Glavieux, A., Picart, A., & Jacq, S. (1994). Near optimum decoding of product codes. In IEEE global telecommunications conference, 1994, GLOBECOM \u201994","DOI":"10.1109\/GLOCOM.1994.513494"},{"key":"478_CR5","doi-asserted-by":"crossref","unstructured":"Mizuochi, T., Kubo, K., Yoshida, H., Fujita, H., Tagami, H., Akita, M., et al. (2003). Next generation FEC for optical transmission systems. In Optical fiber communications conference, 2003, OFC 2003.","DOI":"10.1109\/OFC.2003.315927"},{"key":"478_CR6","unstructured":"Mizuochi, T., Ouchi, K., Kobayashi, T., Miyata, Y., Kuno, K., Tagami, H., et al. (2003). Experimental demonstration of net coding gain of 10.1\u00a0dB using 12.4\u00a0Gb\/s block turbo code with 3-bit soft decision. In Optical fiber communications conference, 2003, OFC 2003, 23\u201328 March."},{"key":"478_CR7","unstructured":"Leroux, C., Jego, C., Adde, P., & Jezequel, M. (2008). A highly parallel turbo product code decoder without interleaving resource. In SiPS 2008: IEEE workshop on signal processing systems, 8\u201310 October, Washington, D.C. Metro Area, U.S.A."},{"key":"478_CR8","unstructured":"Muller, O., Baghdadi, A., & Jezequel, M. (2006). Exploring parallel processing levels for convolutional turbo decoding. In ICCTA\u201906: IEEE international conference on information and communication technologies: From theory to applications, 24\u201328 April, Damas, Syria (pp. 2353\u20132358)."},{"issue":"4","key":"478_CR9","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1109\/TIT.1954.1057464","volume":"4","author":"P Elias","year":"1954","unstructured":"Elias, P. (1954). Error-free coding. IEEE Transactions on Information Theory, 4(4), 29\u201337.","journal-title":"IEEE Transactions on Information Theory"},{"key":"478_CR10","unstructured":"IEEE Standard 802.16-2001 (2001) IEEE standard for local and metropolitan area networks part 16: Air interface for fixed broadband wireless access systems."},{"key":"478_CR11","doi-asserted-by":"crossref","first-page":"909","DOI":"10.1155\/2008\/658042","volume":"2008","author":"RL Bidan","year":"2008","unstructured":"Bidan, R. L., Leroux, C., Jego, C., Adde, P., & Pyndiah, R. (2008). Reed\u2013Solomon turbo product codes for optical communications: From code optimization to decoder design. EURASIP Journal on Wireless Communications and Networking, 2008, 909\u2013912.","journal-title":"EURASIP Journal on Wireless Communications and Networking"},{"key":"478_CR12","unstructured":"Leroux, C., Jego, C., Adde, P., & Jezequel, M. (2008). On the higher efficiency of parallel Reed\u2013Solomon turbo-decoding. In ICECS\u201908: 15th international conference on electronics, circuits and system, 31st August\u20133rd September."},{"key":"478_CR13","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1109\/TIT.1966.1053873","volume":"IT-12","author":"JG Forney","year":"1966","unstructured":"Forney, J. G. (1966). Generalized minimum distance decoding. IEEE Transactions on Information Theory, IT-12, 125\u2013131.","journal-title":"IEEE Transactions on Information Theory"},{"key":"478_CR14","doi-asserted-by":"crossref","unstructured":"Adde, P., Pyndiah, R., & Raoul, O. (1996). Performance and complexity of block turbo decoder circuits. In Proceedings of the third IEEE international conference on electronics, circuits, and systems, 1996. ICECS \u201996, 13\u201316 October 1996 (Vol. 1, pp. 172\u2013175).","DOI":"10.1109\/ICECS.1996.582746"},{"key":"478_CR15","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1109\/TIT.1972.1054746","volume":"IT","author":"D Chase","year":"1972","unstructured":"Chase, D. (1972). A class of algorithms for decoding block codes with channel measurement information. IEEE Transactions on Information Theory, IT, 170\u2013182.","journal-title":"IEEE Transactions on Information Theory"},{"key":"478_CR16","doi-asserted-by":"crossref","unstructured":"Leroux, C., Jego, C., Adde, P., & Jezequel, M. (2007). Towards Gb\/s turbo decoding of product code onto an FPGA device. In IEEE international symposium on circuits and Systems, 2007. ISCAS 2007, 27\u201330 May 2007 (pp. 909\u2013912).","DOI":"10.1109\/ISCAS.2007.378073"},{"key":"478_CR17","unstructured":"Adde, P., & Pyndiah, R. (2000). Recent simplifications and improvements in block turbo codes. In 2nd international symposium on turbo codes & related topics, 4\u20137 September, Brest, France (pp. 133\u2013136)."},{"key":"478_CR18","unstructured":"Chi, Z., & Parhi, K. (2002). High speed VLSI architecture design for block turbo decoder. In IEEE international symposium on circuits and systems, 2002. ISCAS 2002, 26\u201329 May 2002 (Vol. 1, pp. I-901\u2013I-904)."},{"key":"478_CR19","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1049\/el:20063904","volume":"42","author":"C Jego","year":"2006","unstructured":"Jego, C., Adde, P., & Leroux, C. (2006). Full-parallel architecture for turbo decoding of product codes. Electronics Letters, 42, 55\u201356.","journal-title":"Electronics Letters"},{"key":"478_CR20","doi-asserted-by":"crossref","unstructured":"Cuevas, J., Adde, P., Kerouedan, S., & Pyndiah, R. (2002). New architecture for high data rate turbo decoding of product codes. In Global telecommunications conference, 2002. GLOBECOM \u201902. IEEE, 17\u201321 Nov. 2002 (Vol. 2, pp. 1363\u20131367).","DOI":"10.1109\/GLOCOM.2002.1188421"},{"key":"478_CR21","doi-asserted-by":"crossref","unstructured":"Piriou, E., Jego, C., Adde, P., Le\u00a0Bidan, R., & Jezequel, M. (2006). Efficient architecture for Reed Solomon block turbo code. In 2006 IEEE international symposium on circuits and systems, 2006. ISCAS 2006. Proceedings, 21\u201324 May 2006 (4pp.).","DOI":"10.1109\/ISCAS.2006.1693426"},{"key":"478_CR22","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/s11265-008-0316-1","volume":"57","author":"C Leroux","year":"2009","unstructured":"Leroux, C., Jego, C., Adde, P., & Jezequel, M. (2009). High-throughput block turbo decoding: From full-parallel architecture to FPGA prototyping. Journal of Signal Processing Systems, 57, 349\u2013361.","journal-title":"Journal of Signal Processing Systems"},{"key":"478_CR23","volume-title":"Parallel sorting algorithms","author":"SG Akl","year":"1985","unstructured":"Akl, S. G. (1985). Parallel sorting algorithms. New York: Academic."},{"key":"478_CR24","volume-title":"Algebraic coding theory, revised edition","author":"ER Berlekamp","year":"1984","unstructured":"Berlekamp, E. R. (1984). Algebraic coding theory, revised edition. Laguna Hills: Aegean."},{"key":"478_CR25","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1109\/TIT.1969.1054260","volume":"IT","author":"JL Massey","year":"1969","unstructured":"Massey, J. L. (1969). Shift-register synthesis and bch decoding. IEEE Transactions on Information Theory, IT, 122\u2013127.","journal-title":"IEEE Transactions on Information Theory"},{"key":"478_CR26","doi-asserted-by":"crossref","unstructured":"Yamagishi, H., & Noda, M. (2008). High throughput hardware architecture for (1440,1344) low-density parity-check code utilizing quasi-cyclic structure. In 2008 5th international symposium on turbo codes and related topics (pp. 78\u201383).","DOI":"10.1109\/TURBOCODING.2008.4658676"}],"container-title":["Journal of Signal Processing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11265-010-0478-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11265-010-0478-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11265-010-0478-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T08:19:33Z","timestamp":1559377173000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11265-010-0478-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,4,14]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,7]]}},"alternative-id":["478"],"URL":"https:\/\/doi.org\/10.1007\/s11265-010-0478-5","relation":{},"ISSN":["1939-8018","1939-8115"],"issn-type":[{"value":"1939-8018","type":"print"},{"value":"1939-8115","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,4,14]]}}}