Keep the bursts and ditch the interleavers
© 2020 IEEE. To facilitate applications in IoT, 5G, and beyond, there is an engineering need to enable high-rate, low-latency communications. Errors in physical channels typically arrive in clumps, but most decoders are designed assuming that channels are memoryless. As a result, communication netwo...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
Institute of Electrical and Electronics Engineers (IEEE)
2022
|
| Online Access: | https://hdl.handle.net/1721.1/144007 |
| _version_ | 1811070770299797504 |
|---|---|
| author | An, Wei Medard, Muriel Duffy, Ken R |
| author2 | Massachusetts Institute of Technology. Research Laboratory of Electronics |
| author_facet | Massachusetts Institute of Technology. Research Laboratory of Electronics An, Wei Medard, Muriel Duffy, Ken R |
| author_sort | An, Wei |
| collection | MIT |
| description | © 2020 IEEE. To facilitate applications in IoT, 5G, and beyond, there is an engineering need to enable high-rate, low-latency communications. Errors in physical channels typically arrive in clumps, but most decoders are designed assuming that channels are memoryless. As a result, communication networks rely on interleaving over tens of thousands of bits so that channel conditions match decoder assumptions. Even for short high rate codes, awaiting sufficient data to interleave at the sender and de-interleave at the receiver is a significant source of unwanted latency. Using existing decoders with non-interleaved channels causes a degradation in block error rate performance owing to mismatch between the decoder's channel model and true channel behaviour.Through further development of the recently proposed Guessing Random Additive Noise Decoding (GRAND) algorithm, which we call GRAND-MO for GRAND Markov Order, here we establish that by abandoning interleaving and embracing bursty noise, low-latency, short-code, high-rate communication is possible with block error rates that outperform their interleaved counterparts by a substantial margin. Moreover, while most decoders are twinned to a specific code-book structure, GRANDMO can decode any code. Using this property, we establish that certain well-known structured codes are ill-suited for use in bursty channels, but Random Linear Codes (RLCs) are robust to correlated noise. This work suggests that the use of RLCs with GRAND-MO is a good candidate for applications requiring high throughput with low latency. |
| first_indexed | 2024-09-23T08:41:17Z |
| format | Article |
| id | mit-1721.1/144007 |
| institution | Massachusetts Institute of Technology |
| language | English |
| last_indexed | 2024-09-23T08:41:17Z |
| publishDate | 2022 |
| publisher | Institute of Electrical and Electronics Engineers (IEEE) |
| record_format | dspace |
| spelling | mit-1721.1/1440072023-01-23T17:50:05Z Keep the bursts and ditch the interleavers An, Wei Medard, Muriel Duffy, Ken R Massachusetts Institute of Technology. Research Laboratory of Electronics © 2020 IEEE. To facilitate applications in IoT, 5G, and beyond, there is an engineering need to enable high-rate, low-latency communications. Errors in physical channels typically arrive in clumps, but most decoders are designed assuming that channels are memoryless. As a result, communication networks rely on interleaving over tens of thousands of bits so that channel conditions match decoder assumptions. Even for short high rate codes, awaiting sufficient data to interleave at the sender and de-interleave at the receiver is a significant source of unwanted latency. Using existing decoders with non-interleaved channels causes a degradation in block error rate performance owing to mismatch between the decoder's channel model and true channel behaviour.Through further development of the recently proposed Guessing Random Additive Noise Decoding (GRAND) algorithm, which we call GRAND-MO for GRAND Markov Order, here we establish that by abandoning interleaving and embracing bursty noise, low-latency, short-code, high-rate communication is possible with block error rates that outperform their interleaved counterparts by a substantial margin. Moreover, while most decoders are twinned to a specific code-book structure, GRANDMO can decode any code. Using this property, we establish that certain well-known structured codes are ill-suited for use in bursty channels, but Random Linear Codes (RLCs) are robust to correlated noise. This work suggests that the use of RLCs with GRAND-MO is a good candidate for applications requiring high throughput with low latency. 2022-07-25T14:24:00Z 2022-07-25T14:24:00Z 2020 2022-07-25T13:51:17Z Article http://purl.org/eprint/type/ConferencePaper https://hdl.handle.net/1721.1/144007 An, Wei, Medard, Muriel and Duffy, Ken R. 2020. "Keep the bursts and ditch the interleavers." 2020 IEEE Global Communications Conference, GLOBECOM 2020 - Proceedings. en 10.1109/GLOBECOM42002.2020.9322303 2020 IEEE Global Communications Conference, GLOBECOM 2020 - Proceedings Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/ application/pdf Institute of Electrical and Electronics Engineers (IEEE) arXiv |
| spellingShingle | An, Wei Medard, Muriel Duffy, Ken R Keep the bursts and ditch the interleavers |
| title | Keep the bursts and ditch the interleavers |
| title_full | Keep the bursts and ditch the interleavers |
| title_fullStr | Keep the bursts and ditch the interleavers |
| title_full_unstemmed | Keep the bursts and ditch the interleavers |
| title_short | Keep the bursts and ditch the interleavers |
| title_sort | keep the bursts and ditch the interleavers |
| url | https://hdl.handle.net/1721.1/144007 |
| work_keys_str_mv | AT anwei keeptheburstsandditchtheinterleavers AT medardmuriel keeptheburstsandditchtheinterleavers AT duffykenr keeptheburstsandditchtheinterleavers |