Guessing random additive noise decoding with soft detection symbol reliability information - SGRAND
Authors:
- 1 July 2019
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 480-484
Abstract
We recently introduced a noise-centric algorithm, Guessing Random Additive Noise Decoding (GRAND), that identifies a Maximum Likelihood (ML) decoding for arbitrary code-books. GRAND has the unusual property that its complexity decreases as code-book rate increases. Here we provide an extension to GRAND, soft-GRAND (SGRAND), that incorporates soft detection symbol reliability information and identifies a ML decoding in that context. In particular, we assume symbols received from the channel are declared to be error free or to have been potentially subject to additive noise. SGRAND inherits desirable properties of GRAND, including being capacity achieving when used with random code-books, and having a complexity that reduces as the code-rate increases.Keywords
All Related Versions
This publication has 16 references indexed in Scilit:
- Guesswork, Large Deviations, and Shannon EntropyIEEE Transactions on Information Theory, 2012
- RÉnyi Entropy, Guesswork Moments, and Large DeviationsIEEE Transactions on Information Theory, 2004
- Guesswork and EntropyIEEE Transactions on Information Theory, 2004
- Algebraic soft-decision decoding of reed-solomon codesIEEE Transactions on Information Theory, 2003
- Guessing and entropy2002
- A maximum-likelihood soft-decision sequential decoding algorithm for binary convolutional codesIEEE Transactions on Communications, 2002
- An inequality on guessing and its application to sequential decodingIEEE Transactions on Information Theory, 1996
- Class of algorithms for decoding block codes with channel measurement informationIEEE Transactions on Information Theory, 1972
- Estimates of Error Rates for Codes on Burst-Noise ChannelsBell System Technical Journal, 1963
- Capacity of a Burst-Noise ChannelBell System Technical Journal, 1960