Zobrazeno 1 - 10
of 374
pro vyhledávání: '"COŞKUN, Mustafa"'
Spectral Graph Convolutional Networks (GCNs) have gained popularity in graph machine learning applications due, in part, to their flexibility in specification of network propagation rules. These propagation rules are often constructed as polynomial f
Externí odkaz:
http://arxiv.org/abs/2409.04813
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:
Coşkun, Mustafa
Publikováno v:
free to MU campus, to others for purchase.
Thesis (Ph. D.)--University of Missouri-Columbia, 2003.
Typescript. Vita. Includes bibliographical references (leaves [71]-74). Also available on the Internet.
Typescript. Vita. Includes bibliographical references (leaves [71]-74). Also available on the Internet.
Externí odkaz:
http://wwwlib.umi.com/cr/mo/fullcit?p3115537
Autor:
Coskun, Mustafa Yavuz, Itik, Mehmet
Publikováno v:
In Expert Systems With Applications 15 October 2024 252 Part B
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
Publikováno v:
In Computer Standards & Interfaces January 2024 87
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