A New Coding Scheme for UMP and JSCC in Short-Packet Communications
This letter proposes a new coding scheme for short-packet communications, where the messages are encoded successively at the transmitter by a classified enumerative (CE) coding, a cyclic redundancy check (CRC) coding and a polar coding, and then recovered reliably at the receiver by a triple-check h...
Uloženo v:
| Vydáno v: | IEEE communications letters Ročník 27; číslo 12; s. 1 |
|---|---|
| Hlavní autoři: | , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
New York
IEEE
01.12.2023
The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Témata: | |
| ISSN: | 1089-7798, 1558-2558 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Shrnutí: | This letter proposes a new coding scheme for short-packet communications, where the messages are encoded successively at the transmitter by a classified enumerative (CE) coding, a cyclic redundancy check (CRC) coding and a polar coding, and then recovered reliably at the receiver by a triple-check hypothesis testing decoding. The proposed scheme can be applied not only in an unequal message protection (UMP) scenario, where different classes of messages have different reliability requirements, but also in a joint source-channel coding (JSCC) system. To evaluate the performance of the JSCC, we present the weighted dependence testing (DT) bound, which is then exploited as a criterion for classifying messages. Simulation results show that: 1) Our UMP coding scheme can provide more error protection for low-entropy messages; 2) Our JSCC scheme can outperform the double polar JSCC scheme and is close to the JSCC DT bound. |
|---|---|
| Bibliografie: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ISSN: | 1089-7798 1558-2558 |
| DOI: | 10.1109/LCOMM.2023.3325243 |