30 citations · 43 across the 12 of their papers we have counts for
12 papers
Upgrade error detection to prediction with GRAND
Kevin Galligan, Peihong Yuan, Muriel Médard +1
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 redundan…
On the Role of Quantization of Soft Information in GRAND
Peihong Yuan, Ken R. Duffy, Evan P. Gabhart +1
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 (ORB…
Successive Cancellation Ordered Search Decoding of Modified -Coset Codes
Peihong Yuan, Mustafa Cemil Coşkun
A tree search algorithm called successive cancellation ordered search (SCOS) is proposed for -coset codes that implements maximum-likelihood (ML) decoding with ad…
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.…
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…
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…
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…
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…
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…
Flexible IR-HARQ Scheme for Polar-Coded Modulation
Peihong Yuan, Fabian Steiner, Tobias Prinz +1
A flexible incremental redundancy hybrid auto- mated repeat request (IR-HARQ) scheme for polar codes is proposed based on dynamically frozen bits and the quasi-uniform puncturing (…
Polar Code Construction for List Decoding
Peihong Yuan, Tobias Prinz, Georg Böcherer +3
A heuristic construction of polar codes for successive cancellation list (SCL) decoding with a given list size is proposed to balance the trade-off between performance measured in…
Efficient Polar Code Construction for Higher-Order Modulation
Georg Böcherer, Tobias Prinz, Peihong Yuan +1
An efficient algorithm for the construction of polar codes for higher-order modulation is presented based on information-theoretic principles. The bit reliabilities after successiv…