Zobrazeno 1 - 10
of 99
pro vyhledávání: '"Yuan, Peihong"'
We establish that it is possible to extract accurate blockwise and bitwise soft output from Guessing Codeword Decoding with minimal additional computational complexity by considering it as a variant of Guessing Random Additive Noise Decoding. Blockwi
Externí odkaz:
http://arxiv.org/abs/2406.11782
We present a framework that can exploit the tradeoff between the undetected error rate (UER) and block error rate (BLER) of polar-like codes. It is compatible with all successive cancellation (SC)-based decoding methods and relies on a novel approxim
Externí odkaz:
http://arxiv.org/abs/2402.05004
Autor:
Shi, Binghui, Wu, Yongpeng, Yuan, Peihong, Ng, Derrick Wing Kwan, Xia, Xiang-Gen, Zhang, Wenjun
For a multiple-input multiple-output (MIMO) system with unknown channel state information (CSI), a novel low-density parity check (LDPC)-coded transmission (LCT) scheme with joint pilot and data channel estimation is proposed. To fine-tune the CSI, a
Externí odkaz:
http://arxiv.org/abs/2311.07091
We establish that a large, flexible class of long, high redundancy error correcting codes can be efficiently and accurately decoded with guessing random additive noise decoding (GRAND). Performance evaluation demonstrates that it is possible to const
Externí odkaz:
http://arxiv.org/abs/2310.10737
Publikováno v:
2023 IEEE Global Communications Conference (Globecom)
Guessing Random Additive Noise Decoding (GRAND) is a family of hard- and soft-detection error correction decoding algorithms that provide accurate decoding of any moderate redundancy code of any length. Here we establish a method through which any so
Externí odkaz:
http://arxiv.org/abs/2305.05777
In this work, we investigate guessing random additive noise decoding (GRAND) with quantized soft input. First, we analyze the achievable rate of ordered reliability bits GRAND (ORBGRAND), which uses the rank order of the reliability as quantized soft
Externí odkaz:
http://arxiv.org/abs/2203.13552
Autor:
Yuan, Peihong, Coşkun, Mustafa Cemil
A tree search algorithm called successive cancellation ordered search (SCOS) is proposed for $\boldsymbol{G}_N$-coset codes that implements maximum-likelihood (ML) decoding with adaptive complexity for transmission over binary-input AWGN channels. Un
Externí odkaz:
http://arxiv.org/abs/2112.10735
Autor:
Wang, Ting, Yao, Yihao, Wang, Yun, Wei, Wei, Yin, Botao, Huang, Min, Yuan, Peihong, Chen, Rujia, Wang, Feng, Wu, Shiji, Hou, Hongyan
Publikováno v:
In Heliyon 15 April 2024 10(7)
Autor:
Yuan, Peihong, Coşkun, Mustafa Cemil
A complexity-adaptive tree search algorithm is proposed for $\boldsymbol{G}_N$-coset codes that implements maximum-likelihood (ML) decoding by using a successive decoding schedule. The average complexity is close to that of the successive cancellatio
Externí odkaz:
http://arxiv.org/abs/2105.04048
A polar-coded transmission (PCT) scheme with joint channel estimation and decoding is proposed for channels with unknown channel state information (CSI). The CSI is estimated via successive cancellation (SC) decoding and the constraints imposed by th
Externí odkaz:
http://arxiv.org/abs/2102.10719