Zobrazeno 1 - 10
of 25
pro vyhledávání: '"Coşkun, Mustafa Cemil"'
Autor:
Coşkun, Mustafa Cemil
Precoded polar product codes are proposed, where selected component codes enable successive cancellation list decoding to generate bit-wise soft messages efficiently for iterative decoding while targeting optimized distance spectrum as opposed to eBC
Externí odkaz:
http://arxiv.org/abs/2402.06767
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:
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
This work identifies information-theoretic quantities that are closely related to the required list size on average for successive cancellation list (SCL) decoding to implement maximum-likelihood decoding over general binary memoryless symmetric (BMS
Externí odkaz:
http://arxiv.org/abs/2103.16680
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
Autor:
Coşkun, Mustafa Cemil, Liva, Gianluigi, Amat, Alexandre Graell i, Lentmaier, Michael, Pfister, Henry D.
A product code with single parity-check component codes can be described via the tools of a multi-kernel polar code, where the rows of the generator matrix are chosen according to the constraints imposed by the product code construction. Following th
Externí odkaz:
http://arxiv.org/abs/2008.06938
A successive cancellation (SC) decoder with inactivations is proposed as an efficient implementation of SC list (SCL) decoding over the binary erasure channel. The proposed decoder assigns a dummy variable to an information bit whenever it is erased
Externí odkaz:
http://arxiv.org/abs/2004.05969
The performance of short polar codes under successive cancellation (SC) and SC list (SCL) decoding is analyzed for the case where the decoder messages are coarsely quantized. This setting is of particular interest for applications requiring low-compl
Externí odkaz:
http://arxiv.org/abs/1910.01176
This letter proposes successive cancellation list (SCL) decoding of product codes with Reed--Muller (RM) component codes. SCL decoding relies on a product code description based on the $2\times 2$ Hadamard kernel, which enables interpreting the code
Externí odkaz:
http://arxiv.org/abs/1908.10397
A pilot-assisted transmission (PAT) scheme is proposed for short blocklengths, where the pilots are used only to derive an initial channel estimate for the list construction step. The final decision of the message is obtained by applying a non-cohere
Externí odkaz:
http://arxiv.org/abs/1901.05409