activity
20182021
collaborators

7 papers

cs.IT2021

Complexity-Adaptive Maximum-Likelihood Decoding of Modified -Coset Codes

Peihong Yuan, Mustafa Cemil Coşkun

A complexity-adaptive tree search algorithm is proposed for -coset codes that implements maximum-likelihood (ML) decoding by using a successive decoding schedule.…

cs.IT2021

Polar-Coded Non-Coherent Communication

Peihong Yuan, Mustafa Cemil Coşkun, Gerhard Kramer

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 s…

cs.IT2019

Shaped On-Off Keying Using Polar Codes

Thomas Wiegart, Fabian Steiner, Patrick Schulte +1

The probabilistic shaping scheme from Honda and Yamamoto (2013) for polar codes is used to enable power-efficient signaling for on-off keying (OOK). As OOK has a non-symmetric opti…

cs.IT2019

Design of Polar Codes for Parallel Channels with an Average Power Constraint

Thomas Wiegart, Tobias Prinz, Fabian Steiner +1

Polar codes are designed for parallel binary-input additive white Gaussian noise (BiAWGN) channels with an average power constraint. The two main design choices are: the mapping be…

cs.IT2018

Successive Cancellation List Decoding of BMERA Codes with Application to Higher-Order Modulation

Tobias Prinz, Peihong Yuan

BMERA or convolutional polar codes are an extension of polar codes with a provably better error exponent than polar codes. A successive cancellation (SC) decoding algorithm for BME…

cs.IT2018

Construction and Decoding Algorithms for for Polar Codes based on Non-Binary Kernels

Peihong Yuan, Fabian Steiner

Polar codes based on non-binary kernels are discussed in this work. The kernel over is selected by maximizing the polarization effect and using Monte-Carl…