Quasi-OSD of Binary Image of RS Codes with Applications to JSCC

We propose quasi ordered statistic decoding (quasi-OSD) of binary image of Reed-Solomon (RS) codes and explore the application of RS codes to joint source-channel coding (JSCC). Unlike the conventional OSD algorithms that use Gaussian elimination to obtain the systematic matrix, the proposed quasi-O...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Proceedings / IEEE International Symposium on Information Theory s. 3576 - 3581
Hlavní autoři: Zheng, Xiangping, Wang, Qianfan, Wei, Baodian, Ma, Xiao
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 07.07.2024
Témata:
ISSN:2157-8117
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!
Popis
Shrnutí:We propose quasi ordered statistic decoding (quasi-OSD) of binary image of Reed-Solomon (RS) codes and explore the application of RS codes to joint source-channel coding (JSCC). Unlike the conventional OSD algorithms that use Gaussian elimination to obtain the systematic matrix, the proposed quasi-OSD algorithm utilizes the parallel Lagrange interpolation at the symbol level, which achieves a lower complexity and comparable performance compared with the locally constrained OSD (LC-OSD), for high-rate RS codes in the high signal-to-noise ratio (SNR) region. Additionally, we apply RS codes to the JSCC with known source statistics. At the transmitter, a new partition criterion is introduced in the classified enumerative (CE) coding to encode the source information. Then the multiple-rate RS coding transforms the variable-length codeword of the CE coding into a fixed-length transmitted codeword. At the receiver, parallel decoding is performed to recover the source. Simulation results demonstrate that the proposed JSCC scheme outperforms the double polar JSCC scheme by one dB, as expected by Gallager's JSCC bound.
ISSN:2157-8117
DOI:10.1109/ISIT57864.2024.10619269