{"id":102,"date":"2023-03-13T15:43:21","date_gmt":"2023-03-13T19:43:21","guid":{"rendered":"https:\/\/sites.bu.edu\/wisecircuits\/?page_id=102"},"modified":"2025-02-17T20:19:42","modified_gmt":"2025-02-18T01:19:42","slug":"all-in-one-data-decoders","status":"publish","type":"page","link":"https:\/\/sites.bu.edu\/wisecircuits\/all-in-one-data-decoders\/","title":{"rendered":"All-in-One Data Decoders"},"content":{"rendered":"<p><script src=\"https:\/\/cdn.jsdelivr.net\/npm\/bootstrap@5.0.2\/dist\/css\/bootstrap.min.css\" rel=\"stylesheet\" integrity=\"sha384-EVSTQN3\/azprG1Anm3QDgpJLIm9Nao0Yz1ztcQTwFspd3yD65VohhpuuCOmLASjC\" crossorigin=\"anonymous\">\r\n<script src=\"https:\/\/cdn.jsdelivr.net\/npm\/bootstrap@5.3.0-alpha1\/dist\/css\/bootstrap.min.css\" rel=\"stylesheet\">\r\n<script src=\"https:\/\/getbootstrap.com\/docs\/5.3\/assets\/css\/docs.css\" rel=\"stylesheet\">\r\n<script src=\"https:\/\/cdn.jsdelivr.net\/npm\/bootstrap@5.3.0-alpha1\/dist\/js\/bootstrap.bundle.min.js\"><\/script><\/p>\n<h2><strong>Overview<\/strong><\/h2>\n<p align=\"justify\">State-of-the-art decoders traditionally rely on code-specific algorithms specifically designed for each code type, such as Successive Cancellation for Polar codes and Berlekamp\u2013Massey Algorithm for BCH codes. Despite CRC codes being extensively used for error detection in storage and communication, their potential as error-correcting codes has been overlooked due to the absence of a suitable decoder. Remarkably, all these codes, including heretofore un-decodable ones such as Random Linear Codes (RLCs), can actually be efficiently decoded using a singular universal decoder. The Guessing Random Additive Noise Decoding (GRAND) algorithm, recently unveiled as a universal decoder, excels in accurately decoding moderate redundancy codes. GRAND, being a noise-centric decoding technique, is not tied to a specific codebook, making it inherently future-proof. Our research centers on the creation of energy-efficient, low-power, and high-throughput integrated hardware architectures that leverage the GRAND algorithmic family.<\/p>\n<p><img loading=\"lazy\" src=\"\/wisecircuits\/files\/2023\/12\/Untitled-Diagram-2.png\" alt=\"\" width=\"7245\" height=\"3150\" class=\"aligncenter size-full wp-image-859\" srcset=\"https:\/\/sites.bu.edu\/wisecircuits\/files\/2023\/12\/Untitled-Diagram-2.png 7245w, https:\/\/sites.bu.edu\/wisecircuits\/files\/2023\/12\/Untitled-Diagram-2-636x277.png 636w, https:\/\/sites.bu.edu\/wisecircuits\/files\/2023\/12\/Untitled-Diagram-2-1024x445.png 1024w, https:\/\/sites.bu.edu\/wisecircuits\/files\/2023\/12\/Untitled-Diagram-2-768x334.png 768w, https:\/\/sites.bu.edu\/wisecircuits\/files\/2023\/12\/Untitled-Diagram-2-1536x668.png 1536w, https:\/\/sites.bu.edu\/wisecircuits\/files\/2023\/12\/Untitled-Diagram-2-2048x890.png 2048w\" sizes=\"(max-width: 7245px) 100vw, 7245px\" \/><\/p>\n<h2><strong>GRAND:<\/strong><\/h2>\n<div class=\"clearfix\">\n<p><img src=\"\/wisecircuits\/files\/2024\/01\/GRAND_ref.png\" class=\"col-md-4 float-md-end mb-3 ms-md-3\" alt=\"...\" \/><\/p>\n<h6><strong>Collaborators: <\/strong><\/h6>\n<h6>Prof. Muriel M\u00e9dard &#8211; MIT EECS, Prof. Ken Duffy &#8211; Northeastern University ECE<\/h6>\n<h6><strong>Funding: <\/strong> <a href=\"https:\/\/www.nsf.gov\/awardsearch\/showAward?AWD_ID=2128517&amp;HistoricalAwards=false\">NSF SWIFT<\/a>, DARPA<\/h6>\n<h6><strong>Team: <\/strong> Vaibhav Bansal (Co-Lead Integrated Circuit Designer), Arslan Riaz (Co-Lead Integrated Circuit Designer), Dr. Furkan Ercan, Amit Solomon (Muriel Medard\u2019s Ph.D. student), Wei An (Muriel Medard\u2019s Ph.D. student), Kevin Galligan (Ken Duffy\u2019s Ph.D. student)<\/h6>\n<p align=\"justify\">Our group designed the first fully integrated universal Maximum Likelihood decoder in 40 nm CMOS using the GRAND algorithm. Tailored for low-power applications, the GRAND chip stands out as a universal hard-detection decoder that offers reconfigurability to decode diverse moderate redundancy codes, supporting varying code lengths and rates. One of the standout features of the GRAND chip lies in its adaptability, allowing users to dynamically alter the codebook through our code-interleaved architecture. This unique attribute ensures seamless integration across multiple applications without the need for cumbersome switch-over times.<\/p>\n<p align=\"justify\">In the pursuit of our research objectives, our scope transcends mere chip development; rather, we are actively engaged in constructing comprehensive communication systems centered around the GRAND chip. This holistic approach encompasses diverse applications, including interleaved noise recycling and efficient decoding of product codes. We have successfully showcased noise recycling for significantly enhancing decoding performance by effectively leveraging temporally correlated noise in a single communication channel, while concurrently optimizing energy and latency. Furthermore, as an extension of our GRAND chip endeavors, we substantiated iterative GRAND (IGRAND)&#8217;s efficiency in decoding product codes. This multi-faceted approach underscores our commitment to advancing not only chip technology but also the broader landscape of communication systems and decoding methodologies.<\/p>\n<\/div>\n<div style=\"display: flex; justify-content: space-between;\">\n<div style=\"flex-basis: 30%; padding: 10px;\">\n<h5><strong>Publications:<\/strong><\/h5>\n<ul style=\"padding: 0; text-align: justify;\">\n<li><a href=\"https:\/\/ieeexplore.ieee.org\/document\/9567867\" style=\"text-decoration: none; color: #007bff;\">IEEE ESSCIRC 2021<\/a><\/li>\n<li><a href=\"https:\/\/ieeexplore.ieee.org\/document\/9685645\" style=\"text-decoration: none; color: #007bff;\">IEEE GLOBECOM 2021<\/a><\/li>\n<li><a href=\"https:\/\/ieeexplore.ieee.org\/document\/9838586\" style=\"text-decoration: none; color: #007bff;\">IEEE ICC 2022<\/a><\/li>\n<\/ul>\n<\/div>\n<div style=\"flex-basis: 50%; padding: 10px;\">\n<h5><strong>Demos:<\/strong><\/h5>\n<ul style=\"padding: 0; text-align: justify;\">\n<li>IEEE ISSCC 2021 SRP [Poster and Demo]<\/li>\n<li>IEEE 5G World Forum 2021<\/li>\n<li>IEEE Future Networks World Forum 2022<\/li>\n<li>CISE Graduate Student Workshop 2022 [Presentation and Demo]<\/li>\n<li><a href=\"https:\/\/ieeexplore.ieee.org\/abstract\/document\/9668514\" style=\"text-decoration: none; color: #007bff;\">IEEE COMSNETS 2022<\/a> <strong>[Best Research Demo Award]<\/strong><\/li>\n<li><a href=\"https:\/\/ieeexplore.ieee.org\/document\/10041405\" style=\"text-decoration: none; color: #007bff;\">IEEE COMSNETS 2023<\/a> <strong>[Best Demo Award]<\/strong><\/li>\n<\/ul>\n<\/div>\n<div style=\"flex-basis: 20%; padding: 10px;\">\n<h5><strong>News:<\/strong><\/h5>\n<ul style=\"padding: 0; text-align: justify;\">\n<li><a href=\"https:\/\/news.mit.edu\/2021\/grand-decoding-data-0909\" style=\"text-decoration: none; color: #007bff;\">MIT News<\/a><\/li>\n<li><a href=\"https:\/\/www.bu.edu\/eng\/2022\/02\/23\/faster-greener-cheaper-more-secure-yazicigils-grand-project-pushes-forward-with-new-funding\/\" style=\"text-decoration: none; color: #007bff;\">BU News (DARPA Funding)<\/a><\/li>\n<li><a href=\"https:\/\/www.bu.edu\/eng\/2022\/01\/18\/arslan-riaz-awarded-comsnets-2022-best-research-demo-award\/\" style=\"text-decoration: none; color: #007bff;\">BU News (COMSNETS 2022 Demo Award)<\/a><\/li>\n<\/ul>\n<\/div>\n<\/div>\n<h2><strong>ORBGRAND:<\/strong><\/h2>\n<div class=\"clearfix\">\n<p><img src=\"\/wisecircuits\/files\/2024\/01\/orbgrad_ref.png\" class=\"col-md-4 float-md-end mb-3 ms-md-3\" alt=\"...\" \/><\/p>\n<h6><strong>Collaborators: <\/strong><\/h6>\n<h6>Prof. Muriel M\u00e9dard &#8211; MIT EECS, Prof. Ken Duffy &#8211; Northeastern University ECE<\/h6>\n<h6><strong>Funding: <\/strong> <a href=\"https:\/\/www.nsf.gov\/awardsearch\/showAward?AWD_ID=2128517&amp;HistoricalAwards=false\">NSF SWIFT<\/a>, DARPA<\/h6>\n<h6><strong>Team: <\/strong>Arslan Riaz (Lead Designer), Zeynep Ece Kizilates, Alperen Yasar, Dr. Furkan Ercan, Wei An (Muriel Medard\u2019s Ph.D. student), Kevin Galligan (Ken Duffy\u2019s Ph.D. student)<\/h6>\n<p align=\"justify\">We have demonstrated the first integrated universal soft-detection decoder using the Ordered Reliability Bits Guessing Random Additive Noise Decoding (ORBGRAND) in 40nm CMOS. The ORBGRAND chip uses soft information from each received bit to rank order their reliability, providing guidance for the error guessing query order. This chip, at a target Frame Error Rate (FER) of 10^-7, consumes ultra-low energy of 0.76pJ\/bit and low power of 4.9mW with a throughput of 6.5 Gb\/s. The record-breaking ORBGRAND chip outperforms other ORBGRAND implementations and existing state-of-the-art code-specific decoders in terms of energy and power consumption.<\/p>\n<p align=\"justify\">We have also extended our previous interleaved noise recycling technique demonstrated for a hard-detection scenario to soft-detection decoders using the ORBGRAND chip.<\/p>\n<\/div>\n<div style=\"display: flex; justify-content: space-between;\">\n<div style=\"flex-basis: 30%; padding: 10px;\">\n<h5><strong>Publications:<\/strong><\/h5>\n<ul style=\"padding: 0; text-align: justify;\">\n<li><a href=\"https:\/\/ieeexplore.ieee.org\/document\/10067519\" style=\"text-decoration: none; color: #007bff;\">IEEE ISSCC 2023<\/a> [Poster and Demo]<\/li>\n<li><a href=\"https:\/\/ieeexplore.ieee.org\/document\/10206613\" style=\"text-decoration: none; color: #007bff;\">IEEE ISIT 2023<\/a><\/li>\n<li><a href=\"https:\/\/ieeexplore.ieee.org\/document\/10768996\" style=\"text-decoration: none; color: #007bff;\">IEEE JSSC 2024<\/a><\/li>\n<\/ul>\n<\/div>\n<div style=\"flex-basis: 50%; padding: 10px;\">\n<h5><strong>Demos:<\/strong><\/h5>\n<ul style=\"padding: 0; text-align: justify;\">\n<li><a href=\"https:\/\/ieeexplore.ieee.org\/document\/10195821\" style=\"text-decoration: none; color: #007bff;\">IEEE WoWMoM 2023<\/a><\/li>\n<\/ul>\n<\/div>\n<div style=\"flex-basis: 20%; padding: 10px;\">\n<h5><strong>News:<\/strong><\/h5>\n<ul style=\"padding: 0; text-align: justify;\">\n<li><a href=\"https:\/\/news.mit.edu\/2023\/new-chip-demonstrates-energy-efficiency-decoding-0222\" style=\"text-decoration: none; color: #007bff;\">MIT News\u00a0<\/a><\/li>\n<li><a href=\"https:\/\/www.bu.edu\/eng\/2023\/03\/27\/yazicigils-wise-circuits-lab-goes-the-distance-at-chip-olympics\/\" style=\"text-decoration: none; color: #007bff;\">BU News\u00a0<\/a><\/li>\n<li><a href=\"https:\/\/www.bu.edu\/cise\/a-new-decoder-chip-breaks-the-record-for-energy-efficiency-for-longer-battery-life-and-hardware-sustainability\/\" style=\"text-decoration: none; color: #007bff;\">CISE News\u00a0<\/a><\/li>\n<\/ul>\n<\/div>\n<\/div>\n<h3><strong>Awards:<\/strong><\/h3>\n<ul style=\"padding: 0;\" align=\"justify\">\n<li style=\"list-style-type: none;\">\n<ul style=\"padding: 0;\" align=\"justify\">\n<li>Best Demo Award in IEEE COMSNETS 2023 [Noise Recycling using GRAND]<\/li>\n<li>2nd position for Best Presentations Award at Boston University Center for Information and Systems Engineering (CISE) Graduate Student Workshop 2022 [GRAND]<\/li>\n<li>Best Research Demo Award in IEEE COMSNETS 2022 [GRAND]<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n<p><img loading=\"lazy\" src=\"\/wisecircuits\/files\/2023\/12\/GRAND_demo-sm_-1536x966-1-636x400.png\" alt=\"\" width=\"636\" height=\"400\" class=\"alignnone size-medium wp-image-903\" srcset=\"https:\/\/sites.bu.edu\/wisecircuits\/files\/2023\/12\/GRAND_demo-sm_-1536x966-1-636x400.png 636w, https:\/\/sites.bu.edu\/wisecircuits\/files\/2023\/12\/GRAND_demo-sm_-1536x966-1-1024x644.png 1024w, https:\/\/sites.bu.edu\/wisecircuits\/files\/2023\/12\/GRAND_demo-sm_-1536x966-1-768x483.png 768w, https:\/\/sites.bu.edu\/wisecircuits\/files\/2023\/12\/GRAND_demo-sm_-1536x966-1.png 1536w\" sizes=\"(max-width: 636px) 100vw, 636px\" \/><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Overview State-of-the-art decoders traditionally rely on code-specific algorithms specifically designed for each code type, such as Successive Cancellation for Polar codes and Berlekamp\u2013Massey Algorithm for BCH codes. Despite CRC codes being extensively used for error detection in storage and communication, their potential as error-correcting codes has been overlooked due to the absence of a suitable [&hellip;]<\/p>\n","protected":false},"author":22240,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"page-templates\/no-sidebars.php","meta":[],"_links":{"self":[{"href":"https:\/\/sites.bu.edu\/wisecircuits\/wp-json\/wp\/v2\/pages\/102"}],"collection":[{"href":"https:\/\/sites.bu.edu\/wisecircuits\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/sites.bu.edu\/wisecircuits\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/sites.bu.edu\/wisecircuits\/wp-json\/wp\/v2\/users\/22240"}],"replies":[{"embeddable":true,"href":"https:\/\/sites.bu.edu\/wisecircuits\/wp-json\/wp\/v2\/comments?post=102"}],"version-history":[{"count":51,"href":"https:\/\/sites.bu.edu\/wisecircuits\/wp-json\/wp\/v2\/pages\/102\/revisions"}],"predecessor-version":[{"id":1543,"href":"https:\/\/sites.bu.edu\/wisecircuits\/wp-json\/wp\/v2\/pages\/102\/revisions\/1543"}],"wp:attachment":[{"href":"https:\/\/sites.bu.edu\/wisecircuits\/wp-json\/wp\/v2\/media?parent=102"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}