{"id":{"repo_id":"mit","oai_identifier":"oai:dspace.mit.edu:1721.1/147390"},"canonical_url":"https://search.dev.ndltd.org/etd/mit/oai:dspace.mit.edu:1721.1/147390","repository":{"repo_id":"mit","name":"MIT","base_url":"https://dspace.mit.edu/oai/request"},"display":{"title":"Quantized Guessing Random Additive Noise Decoding - A Universal Quantized Soft-Decoder","abstract":"Guessing Random Additive Noise Decoding (GRAND) has proven to be a universal, maximum likelihood decoder. Multiple extensions of GRAND have been introduced, giving way to a class of universal decoders. GRAND itself describes a hard-detection decoder, so a natural extension was to incorporate the use of soft-information. The result was Soft Guessing Random Additive Noise Decoding (SGRAND). SGRAND assumes access to complete soft information, proving itself to be a maximum-likelihood soft-detection decoder. Physical limitations, however, prevent one from having access to perfect soft-information in practice. This thesis proposes an approximation to the optimal performance of SGRAND, Quantized Guessing Random Additive Noise Decoding (QGRAND). I describe the algorithm and evaluate its performance compared to hard-detection GRAND, SGRAND, and another approach to approximating SGRAND, Ordered Reliability Bits GRAND (ORBGRAND). QGRAND also allows itself to be tailored to an arbitrary number of bits of soft information, and I will show as the number of bits increases so does performance. I then use the GRAND algorithms discussed in order to evaluate error correction potential of different channel codes, particularly Polar Adjusted Convolutional codes, CA-Polar codes, and CRCs.","abstract_html":"Guessing Random Additive Noise Decoding (GRAND) has proven to be a universal, maximum likelihood decoder. Multiple extensions of GRAND have been introduced, giving way to a class of universal decoders. GRAND itself describes a hard-detection decoder, so a natural extension was to incorporate the use of soft-information. The result was Soft Guessing Random Additive Noise Decoding (SGRAND). SGRAND assumes access to complete soft information, proving itself to be a maximum-likelihood soft-detection decoder. Physical limitations, however, prevent one from having access to perfect soft-information in practice. This thesis proposes an approximation to the optimal performance of SGRAND, Quantized Guessing Random Additive Noise Decoding (QGRAND). I describe the algorithm and evaluate its performance compared to hard-detection GRAND, SGRAND, and another approach to approximating SGRAND, Ordered Reliability Bits GRAND (ORBGRAND). QGRAND also allows itself to be tailored to an arbitrary number of bits of soft information, and I will show as the number of bits increases so does performance. I then use the GRAND algorithms discussed in order to evaluate error correction potential of different channel codes, particularly Polar Adjusted Convolutional codes, CA-Polar codes, and CRCs.","abstract_has_math":false,"creators":["Gabhart, Evan"],"institution":"Massachusetts Institute of Technology","degree_name":"Master","degree_level":null,"degree_discipline":null,"degree_department":"Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science","school":null,"contributors":[],"advisors":["Médard, Muriel","Duffy, Ken R."],"committee_chairs":[],"committee_members":[],"year":2022,"date_issued":"2022-09","date_published":"2022-09","updated_at":"2026-07-22T22:21:12Z","subjects":[],"languages":[],"rights":["In Copyright - Educational Use Permitted","Copyright MIT"],"rights_urls":["http://rightsstatements.org/page/InC-EDU/1.0/"],"identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/1721.1/147390","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Médard, Muriel","Duffy, Ken R."]},{"key":"dc:contributor.department","label":"Department","values":["Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science"]},{"key":"dc:creator","label":"Author","values":["Gabhart, Evan"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2023-01-19T18:50:02Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2023-01-19T18:50:02Z"]},{"key":"dc:date.issued","label":"Date","values":["2022-09"]},{"key":"dc:publisher","label":"Institution","values":["Massachusetts Institute of Technology"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master","Master of Engineering in Electrical Engineering and Computer Science"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:rights","label":"Dc Rights","values":["In Copyright - Educational Use Permitted","Copyright MIT"]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://rightsstatements.org/page/InC-EDU/1.0/"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/1721.1/147390"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["Guessing Random Additive Noise Decoding (GRAND) has proven to be a universal, maximum likelihood decoder. Multiple extensions of GRAND have been introduced, giving way to a class of universal decoders. GRAND itself describes a hard-detection decoder, so a natural extension was to incorporate the use of soft-information. The result was Soft Guessing Random Additive Noise Decoding (SGRAND). SGRAND assumes access to complete soft information, proving itself to be a maximum-likelihood soft-detection decoder. Physical limitations, however, prevent one from having access to perfect soft-information in practice. This thesis proposes an approximation to the optimal performance of SGRAND, Quantized Guessing Random Additive Noise Decoding (QGRAND). I describe the algorithm and evaluate its performance compared to hard-detection GRAND, SGRAND, and another approach to approximating SGRAND, Ordered Reliability Bits GRAND (ORBGRAND). QGRAND also allows itself to be tailored to an arbitrary number of bits of soft information, and I will show as the number of bits increases so does performance. I then use the GRAND algorithms discussed in order to evaluate error correction potential of different channel codes, particularly Polar Adjusted Convolutional codes, CA-Polar codes, and CRCs."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["M.Eng."]},{"key":"dc:title","label":"Title","values":["Quantized Guessing Random Additive Noise Decoding - A Universal Quantized Soft-Decoder"]}]}],"canonical_facts":{"dc:contributor.advisor":["Médard, Muriel","Duffy, Ken R."],"dc:contributor.department":["Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science"],"dc:creator":["Gabhart, Evan"],"dc:date.accessioned":["2023-01-19T18:50:02Z"],"dc:date.available":["2023-01-19T18:50:02Z"],"dc:date.issued":["2022-09"],"dc:description.abstract":["Guessing Random Additive Noise Decoding (GRAND) has proven to be a universal, maximum likelihood decoder. Multiple extensions of GRAND have been introduced, giving way to a class of universal decoders. GRAND itself describes a hard-detection decoder, so a natural extension was to incorporate the use of soft-information. The result was Soft Guessing Random Additive Noise Decoding (SGRAND). SGRAND assumes access to complete soft information, proving itself to be a maximum-likelihood soft-detection decoder. Physical limitations, however, prevent one from having access to perfect soft-information in practice. This thesis proposes an approximation to the optimal performance of SGRAND, Quantized Guessing Random Additive Noise Decoding (QGRAND). I describe the algorithm and evaluate its performance compared to hard-detection GRAND, SGRAND, and another approach to approximating SGRAND, Ordered Reliability Bits GRAND (ORBGRAND). QGRAND also allows itself to be tailored to an arbitrary number of bits of soft information, and I will show as the number of bits increases so does performance. I then use the GRAND algorithms discussed in order to evaluate error correction potential of different channel codes, particularly Polar Adjusted Convolutional codes, CA-Polar codes, and CRCs."],"dc:description.degree":["M.Eng."],"dc:identifier.uri":["https://hdl.handle.net/1721.1/147390"],"dc:publisher":["Massachusetts Institute of Technology"],"dc:rights":["In Copyright - Educational Use Permitted","Copyright MIT"],"dc:rights.uri":["http://rightsstatements.org/page/InC-EDU/1.0/"],"dc:title":["Quantized Guessing Random Additive Noise Decoding - A Universal Quantized Soft-Decoder"],"dc:type":["Thesis"],"thesis:degree_name":["Master","Master of Engineering in Electrical Engineering and Computer Science"]},"updated_at":"2026-07-22T22:21:12Z"}