{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T14:38:29Z","timestamp":1740148709640,"version":"3.37.3"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,1,31]],"date-time":"2022-01-31T00:00:00Z","timestamp":1643587200000},"content-version":"vor","delay-in-days":30,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100002790","name":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002790","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100002418","name":"Intel Corporation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100002418","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100008676","name":"CMC Microsystems","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100008676","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sign Process Syst"],"published-print":{"date-parts":[[2022,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This paper describes a field-programmable gate array (FPGA) implementation of a fixed-point low-density lattice code (LDLC) decoder where the Gaussian mixture messages that are exchanged during the iterative decoding process are approximated to a single Gaussian. A detailed quantization study is first performed to find the minimum number of bits required for the fixed-point decoder to attain a frame error rate (FER) performance similar to floating-point. Then efficient numerical methods are devised to approximate the required non-linear functions. Finally, the paper presents a comparison of the performance of the different decoder architectures as well as a detailed analysis of the resource requirements and throughput trade-offs of the primary design blocks for the different architectures. A novel pipelined LDLC decoder architecture is proposed where resource re-utilization along with pipelining allows for a parallelism equivalent to 50 variable nodes on the target FPGA device. The pipelined architecture attains a throughput of 10.5 Msymbols\/sec at a distance of 5 dB from capacity which is a 1.8<jats:inline-formula><jats:alternatives><jats:tex-math>$$\\times$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mo>\u00d7<\/mml:mo>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> improvement in throughput compared to an implementation with 20 parallel variable nodes without pipelining. This implementation also achieves 24<jats:inline-formula><jats:alternatives><jats:tex-math>$$\\times$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mo>\u00d7<\/mml:mo>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> improvement in throughput over a baseline serial decoder.<\/jats:p>","DOI":"10.1007\/s11265-021-01735-2","type":"journal-article","created":{"date-parts":[[2022,1,31]],"date-time":"2022-01-31T00:03:41Z","timestamp":1643587421000},"page":"101-116","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Hardware Implementation of a Fixed-Point Decoder for Low-Density Lattice Codes"],"prefix":"10.1007","volume":"94","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2711-0264","authenticated-orcid":false,"given":"Rachna","family":"Srivastava","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5534-0825","authenticated-orcid":false,"given":"Vincent C.","family":"Gaudet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6479-1700","authenticated-orcid":false,"given":"Patrick","family":"Mitran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,1,31]]},"reference":[{"issue":"4","key":"1735_CR1","doi-asserted-by":"publisher","first-page":"1561","DOI":"10.1109\/TIT.2008.917684","volume":"54","author":"N Sommer","year":"2008","unstructured":"Sommer, N., Feder, M., & Shalvi, O. (2008). Low-density lattice codes. IEEE Transactions on Information Theory, 54(4), 1561\u20131585.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"3","key":"1735_CR2","doi-asserted-by":"publisher","first-page":"1309","DOI":"10.1109\/TIT.2015.2394782","volume":"61","author":"J Zhu","year":"2015","unstructured":"Zhu, J., & Gastpar, M. (2015). Lattice codes for many-to-one interference channels with and without cognitive messages. IEEE Transactions on Information Theory, 61(3), 1309\u20131324.","journal-title":"IEEE Transactions on Information Theory"},{"key":"1735_CR3","doi-asserted-by":"crossref","unstructured":"Hasan,\u00a0M. N., & Kurkoski,\u00a0B. M. (2017). Practical compute-and-forward approaches for the multiple access relay channel.\u00a0IEEE International Conference on Communications, 1\u20136.","DOI":"10.1109\/ICC.2017.7996920"},{"key":"1735_CR4","doi-asserted-by":"crossref","unstructured":"Ordentlich,\u00a0O., Zhan,\u00a0J., Erez,\u00a0U., Gastpar,\u00a0M., & Nazer,\u00a0B. (2011). Practical code design for compute-and-forward. IEEE International Symposium on Information Theory,\u00a01876\u20131880.","DOI":"10.1109\/ISIT.2011.6033876"},{"issue":"6","key":"1735_CR5","doi-asserted-by":"publisher","first-page":"1250","DOI":"10.1109\/TIT.2002.1003821","volume":"48","author":"R Zamir","year":"2002","unstructured":"Zamir, R., Shamai, S., & Erez, U. (2002). Nested linear\/lattice codes for structured multiterminal binning. IEEE Transactions on Information Theory, 48(6), 1250\u20131276.","journal-title":"IEEE Transactions on Information Theory"},{"key":"1735_CR6","doi-asserted-by":"crossref","unstructured":"Lee,\u00a0S. H., Ghiya,\u00a0A., Vishwanath,\u00a0S., Hwang,\u00a0S. S., & Kim,\u00a0S. (2010). Structured dirty-paper coding using low-density lattices. IEEE International Conference on Acoustics, Speech and Signal Processing, 3350\u20133353.","DOI":"10.1109\/ICASSP.2010.5496012"},{"issue":"4","key":"1735_CR7","doi-asserted-by":"publisher","first-page":"1081","DOI":"10.1109\/TCOMM.2015.2408317","volume":"63","author":"P Mitran","year":"2015","unstructured":"Mitran, P., & Ochiai, H. (2015). Parallel concatenated convolutional lattice codes with constrained states. IEEE Transactions on Communications, 63(4), 1081\u20131090.","journal-title":"IEEE Transactions on Communications"},{"issue":"10","key":"1735_CR8","doi-asserted-by":"publisher","first-page":"6463","DOI":"10.1109\/TIT.2011.2165816","volume":"57","author":"B Nazer","year":"2011","unstructured":"Nazer, B., & Gastpar, M. (2011). Compute-and-forward: Harnessing interference through structured codes. IEEE Transactions on Information Theory, 57(10), 6463\u20136486.","journal-title":"IEEE Transactions on Information Theory"},{"key":"1735_CR9","first-page":"1417","volume":"3","author":"MR Sadeghi","year":"2004","unstructured":"Sadeghi, M. R., Banihashemi, A. H., & Panario, D. (2004). Iterative decoding algorithm of lattices. \u00a0Canadian Conference on Electrical and Computer Engineering, 3, 1417\u20131420.","journal-title":"\u00a0Canadian Conference on Electrical and Computer Engineering"},{"key":"1735_CR10","doi-asserted-by":"crossref","unstructured":"Kurkoski,\u00a0B. M., & Dauwels,\u00a0J. (2008). Message-passing decoding of lattices using Gaussian mixtures. IEEE International Symposium on Information Theory,\u00a02489\u20132493.","DOI":"10.1109\/ISIT.2008.4595439"},{"key":"1735_CR11","unstructured":"Hernandez,\u00a0R. A. P., & Kurkoski,\u00a0B. M. (2015). The three\/two Gaussian parametric LDLC decoder. IEEE Information Theory Workshop, 172\u2013176."},{"key":"1735_CR12","doi-asserted-by":"crossref","unstructured":"Yona,\u00a0Y., & Feder,\u00a0M. (2009).\u00a0Efficient parametric decoder of low density lattice codes. IEEE International Symposium on Information Theory,\u00a0744\u2013748.","DOI":"10.1109\/ISIT.2009.5205636"},{"key":"1735_CR13","doi-asserted-by":"crossref","unstructured":"Li,\u00a0Y., & Bie,\u00a0Z. (2012).\u00a0Message-passing decoding algorithm of low-density lattice codes with Gaussian approximation. IEEE International Conference on Wireless Information Technology and Systems.","DOI":"10.1109\/ICWITS.2012.6417715"},{"issue":"7","key":"1735_CR14","doi-asserted-by":"publisher","first-page":"659","DOI":"10.1109\/LCOMM.2010.07.092350","volume":"14","author":"B Kurkoski","year":"2010","unstructured":"Kurkoski, B., & Dauwels, J. (2010). Reduced-memory decoding of low-density lattice codes. IEEE Communications Letters, 14(7), 659\u2013661.","journal-title":"IEEE Communications Letters"},{"key":"1735_CR15","doi-asserted-by":"crossref","unstructured":"Kurkoski,\u00a0B. M., Dauwels,\u00a0J., & Loeliger,\u00a0H. A. (2009). Power-constrained communications using LDLC lattices. IEEE International Symposium on Information Theory,\u00a0739\u2013743.","DOI":"10.1109\/ISIT.2009.5205635"},{"key":"1735_CR16","unstructured":"Hernandez,\u00a0R., & Kurkoski,\u00a0B. (2014).\u00a0Low complexity construction of low density lattice codes based on array codes. International Symposium on Information Theory and its Applications,\u00a0264\u2013268."},{"key":"1735_CR17","doi-asserted-by":"crossref","unstructured":"Xu,\u00a0J., Duan,\u00a0C., Zhao,\u00a0D., Wang,\u00a0Y., & Xie,\u00a0F. (2015).\u00a0Early stopping criterion for message-passing decoding of LDLC. International Conference on Advanced Communication Technology, 315\u2013318.","DOI":"10.1109\/ICACT.2015.7224811"},{"key":"1735_CR18","doi-asserted-by":"crossref","unstructured":"Srivastava,\u00a0R., Gaudet,\u00a0V. C., & Mitran,\u00a0P. (2020). Hardware implementation of fixed-point decoder for low-density lattice codes. Asilomar Conference on Signals, Systems, and Computers,\u00a01295\u20131300.","DOI":"10.1109\/IEEECONF51394.2020.9443561"},{"issue":"2","key":"1735_CR19","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1109\/18.312163","volume":"40","author":"G Poltyrev","year":"1994","unstructured":"Poltyrev, G. (1994). On coding without restrictions for the AWGN channel. IEEE Transactions on Information Theory, 40(2), 409\u2013417.","journal-title":"IEEE Transactions on Information Theory"},{"key":"1735_CR20","unstructured":"Crouse,\u00a0D. F., Willett,\u00a0P., Pattipati,\u00a0K., & Svensson,\u00a0L. (2011) A look at Gaussian mixture reduction algorithms. International Conference on Information Fusion."},{"key":"1735_CR21","unstructured":"Parhami,\u00a0B. (2010). Computer Arithmetic: Algorithms and Hardware Designs (2nd ed.). Oxford University Press."},{"issue":"5","key":"1735_CR22","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1109\/TIT.1981.1056404","volume":"27","author":"R Tanner","year":"1981","unstructured":"Tanner, R. (1981). A recursive approach to low complexity codes. IEEE Transactions on Information Theory, 27(5), 533\u2013547.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"1735_CR23","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1109\/18.748992","volume":"45","author":"DJC MacKay","year":"1999","unstructured":"MacKay, D. J. C. (1999). Good error-correcting codes based on very sparse matrices. IEEE Transactions on Information Theory, 45(2), 399\u2013431.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"6","key":"1735_CR24","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1049\/el:19970362","volume":"33","author":"DJC MacKay","year":"1997","unstructured":"MacKay, D. J. C., & Neal, R. M. (1997). Near Shannon limit performance of low density parity check codes. Electronics Letters, 33(6), 457\u2013458.","journal-title":"Electronics Letters"},{"key":"1735_CR25","doi-asserted-by":"crossref","unstructured":"Howland,\u00a0C., & Blanksby,\u00a0A. (2001). A 220 mW 1 GB\/s 1024-bit rate-1\/2 low density parity check code decoder. IEEE Custom Integrated Circuits Conference,\u00a0293\u2013296.","DOI":"10.1109\/4.987093"},{"key":"1735_CR26","unstructured":"Cormen, T. H., Leiserson,\u00a0C. E., Rivest,\u00a0R. L., & Stein,\u00a0C. (2009). Introduction to Algorithms (3rd ed.). The MIT Press."},{"key":"1735_CR27","first-page":"581","volume":"1","author":"H Michel","year":"2000","unstructured":"Michel, H., Worm, A., & Wehn, N. (2000). Influence of quantization on the bit-error performance of turbo-decoders. IEEE Vehicular Technology Conference, 1, 581\u2013585.","journal-title":"IEEE Vehicular Technology Conference"}],"container-title":["Journal of Signal Processing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11265-021-01735-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11265-021-01735-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11265-021-01735-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,17]],"date-time":"2022-02-17T05:10:29Z","timestamp":1645074629000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11265-021-01735-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,1]]}},"alternative-id":["1735"],"URL":"https:\/\/doi.org\/10.1007\/s11265-021-01735-2","relation":{},"ISSN":["1939-8018","1939-8115"],"issn-type":[{"type":"print","value":"1939-8018"},{"type":"electronic","value":"1939-8115"}],"subject":[],"published":{"date-parts":[[2022,1]]},"assertion":[{"value":"19 October 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 December 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 December 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 January 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}