Abstract
Communication channels with memory are often sensitive to burst noise, which drastically reduces the decoding performance of standard channel code decoders, and this degradation worsens as channel memory increases. Hence, interleavers and de-interleavers are usually used to reduce the effects of burst noise at the expense of increased latency in the communication system. The delay imposed by interleavers/de-interleavers and the performance deterioration induced by channel memory are unacceptable in novel applications that require ultra-low latency and high decoding performance. Guessing Random Additive Noise Decoding (GRAND) is a universal Maximum Likelihood (ML) decoding technique for short-length and high-rate channel codes. GRAND Markov Order (GRAND-MO) is a hard-input variant of GRAND that has been specifically developed for communication channels with memory that are subject to burst noise. GRAND-MO can be used directly on hard demodulated channel signals, removing the requirement for extra interleavers/de-interleavers and considerably reducing overall latency in communication systems. This paper describes a high-throughput GRAND-MO VLSI architecture that can achieve an average throughput of up to 52 Gbps and 64 Gbps for code lengths of 128 and 79, respectively. Furthermore, we propose improvements to the GRAND-MO algorithm to simplify hardware implementation and reduce decoding complexity. When compared to GRANDAB, a hard-input variant of GRAND, the proposed improved GRAND-MO algorithm yields a decoding performance gain of \(2\sim 3\)dB at a target FER of \(10^{-5}\). Similarly, as compared to the (79, 64) BCH code decoder, the proposed GRAND-MO decoder has a 33% reduced worst-case latency and a 2 dB gain in decoding performance at a target FER of \(10^{-5}\).
Similar content being viewed by others
Notes
\(1+2\ldots {n}=\frac{n\times (n+1)}{2}\)
Can be simplified to \(L\times (\frac{2\times {n}-L-3}{2})\)
References
Durisi, G., Koch, T., & Popovski, P. (2016). Toward massive, ultrareliable, and low-latency wireless communication with short packets. Proceedings of the IEEE, 104(9), 1711–1726.
3GPP. (2018). Study on physical layer latency enhancements for NR ultrareliable and low case (URLLC). http://www.3gpp.org/DynaReport/38-series.htm, Tech. Rep. TR 38.824, 2018, Rel. 16.
Parvez, I., Rahmati, A., Guvenc, I., Sarwat, A. I., & Dai, H. (2018). A survey on low latency towards 5g: Ran, core network and caching solutions. IEEE Communications Surveys Tutorials, 20(4), 3098–3130.
Ma, Z., Xiao, M., Xiao, Y., Pang, Z., Poor, H. V., & Vucetic, B. (2019). High-reliability and low-latency wireless communication for internet of things: Challenges, fundamentals, and enabling technologies. IEEE Internet of Things Journal, 6(5), 7946–7970.
Zhan, M., Pang, Z., Dzung, D., & Xiao, M. (2018). Channel coding for high performance wireless control in critical applications: Survey and analysis. IEEE Access, vol. 6, pp. 29 648–29 664.
Chen, H., Abbas, R., Cheng, P., Shirvanimoghaddam, M., Hardjawana, W., Bao, W., et al. (2018). Ultra-reliable low latency cellular networks: Use cases, challenges and approaches. IEEE Communications Magazine, 56(12), 119–125.
Duffy, K. R., Li, J., & Médard, M. (2019). Capacity-achieving guessing random additive noise decoding. IEEE Transactions on Information Theory, vol. 65, no. 7, pp. 4023–4040.
Duffy, K. R. (2021). Ordered reliability bits guessing random additive noise decoding. In ICASSP 2021–2021 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp. 8268–8272.
Duffy, K. R., & Médard, M. (2019). Guessing random additive noise decoding with soft detection symbol reliability information - sgrand. In 2019 IEEE International Symposium on Information Theory (ISIT), pp. 480–484.
Solomon, A., Duffy, K. R., & Médard, M. (2020). Soft maximum likelihood decoding using grand. In ICC 2020–2020 IEEE International Conference on Communications (ICC), pp. 1–6.
An, W., Médard, M., & Duffy, K. R. (2020). Keep the bursts and ditch the interleavers. In GLOBECOM 2020–2020 IEEE Global Communications Conference, pp. 1–6.
Abbas, S. M., Tonnellier, T., Ercan, F., & Gross, W. J. (2020). High-throughput VLSI architecture for GRAND. In IEEE Workshop on Signal Processing Systems (SiPS), 1–6.
Choi, S., Ahn, H. K., Song, B. K., Kim, J. P., Kang, S. H., & Jung, S. (2019). A decoder for short BCH codes with high decoding efficiency and low power for emerging memories. IEEE Transactions on Very Large Scale Integration (VLSI) Systems, vol. 27, no. 2, pp. 387–397.
Abbas, S. M., Jalaleddine, M., & Gross, W. J. (2021). High-Throughput VLSI Architecture for GRAND Markov Order. In IEEE Workshop on Signal Processing Systems (SiPS), 158–163.
Gilbert, E. N. (1960). Capacity of a burst-noise channel. The Bell System Technical Journal, 39(5), 1253–1265.
Bose, R. C., & Ray-Chaudhuri, D. K. (1960). On a class of error correcting binary group codes. Information and Control, vol. 3, no. 1, pp. 68–79, 1960.
Hocquenghem, A. (1959). Codes correcteurs d’erreurs, Chiffres, 1959.
Gallager, R. G. (1968). Information theory and reliable communication.
Coffey, J. T., & Goodman, R. M. (1990). Any code of which we cannot think is good. IEEE Transactions on Information Theory, 36(6), 1453–1461.
Peterson, W. W., & Brown, D. T. (1961). Cyclic codes for error detection. Proceedings of the IRE, 49(1), 228–235.
Berlekamp, E. (1968). Nonbinary BCH decoding (abstr.). IEEE Transactions on Information Theory, 14(2), 242.
Massey, J. (1969). Shift-register synthesis and BCH decoding. IEEE Transactions on Information Theory, 15(1), 122–127.
An, W., Médard, M., & Duffy, K. R. (2021). CRC codes as error correcting codes. arXiv preprint arXiv:2104.13663.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of Interest
The authors declare that they have no conflict of interest.
Additional information
Publisher’s Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Abbas, S.M., Jalaleddine, M. & Gross, W.J. Hardware Architecture for Guessing Random Additive Noise Decoding Markov Order (GRAND-MO). J Sign Process Syst 94, 1047–1065 (2022). https://doi.org/10.1007/s11265-022-01775-2
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11265-022-01775-2