Construction of Polar Codes Exploiting Channel Transformation Structure

Schnelling, Christopher; Schmeink, Anke

doi:10.1109/lcomm.2015.2450739

Cited by 9 publications

(6 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…where a is the weight factor of base b. The new base b in (7) provides a new degree of freedom to describe the PW relationship between each subchannels. The PW family formulas (4) - (7), mentioned above, all own the symmetry property.…”

Section: B Extended Polarization Weight Methodsmentioning

confidence: 99%

“…The new base b in (7) provides a new degree of freedom to describe the PW relationship between each subchannels. The PW family formulas (4) - (7), mentioned above, all own the symmetry property. The ordering sequence of the first half are same to the second half, i.e.…”

Section: B Extended Polarization Weight Methodsmentioning

confidence: 99%

“…For other channels, Mori and Tanaka [3] use density evolution (DE) for a more accurate reliability evaluation, but suffers from excessive complexity. Tal and Vardy proposed to reduce complexity with a close-to-optimal quantizer [4]- [7]. Afterwards, Gaussian approximation (GA) was proposed to further reduce the computational complexity of DE [8].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Polarization Weight Family Methods for Polar Code Construction

Yi-jie

Zhang

et al. 2018

2018 IEEE 87th Vehicular Technology Conference (VTC Spring)

View full text Add to dashboard Cite

Polar codes are the first proven capacity-achieving codes. Recently, they are adopted as the channel coding scheme for 5G due to their superior performance. A polar code for encoding length-K information bits in length-N codeword could be specified by the polar code construction method. Most construction methods define a polar code related to channel parameter set, e.g. designed signal-to-noise ratio. Polarization weight (PW) is a channel-independent approximation method, which estimates the subchannel reliability as a function of its index. In this paper, we generalize the PW method by including higher-order bases or extended bases. The proposed methods have robust performance while preserving the computational and mathematical simplicity as PW.

show abstract

Section: B Extended Polarization Weight Methodsmentioning

confidence: 99%

Section: B Extended Polarization Weight Methodsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Polarization Weight Family Methods for Polar Code Construction

Yi-jie

Zhang

et al. 2018

2018 IEEE 87th Vehicular Technology Conference (VTC Spring)

View full text Add to dashboard Cite

show abstract

“…To do so, we describe DE to introduce concepts relevant to our work, and establish relevant notation. Other construction approaches such as Arıkan's explicit recursion in the Bhattacharyya parameters valid for binary erasure channels (BECs) or Monte Carlo (MC) constructions [1], as well as constructions by faithful estimations of the coordinate channels [16], [17], go beyond the scope of this work. We then inspect the adaptions required to allow for a DE-based construction of punctured PCs.…”

Section: Efficient Density Evolution For Punctured Polar Codesmentioning

confidence: 99%

Efficient Implementation of Density Evolution for Punctured Polar Codes

et al. 2019

Self Cite

View full text Add to dashboard Cite

Polar codes asymptotically achieve the symmetric capacity of arbitrary binary-input discrete memoryless channels under low-complexity sequential decoding algorithms such as successive cancellation decoding. However, in their original formulation, the block length of polar codes is limited to integer powers of the dimension of the underlying polarization kernel used, thus imposing strict constraints on possible application scenarios. While leeway in the choice of kernel or concatenation with other codes mitigates this drawback to a certain extent, puncturing presents a promising approach to specify the target length of a polar code with much greater flexibility. In this paper, we present an efficient implementation of the construction of punctured polar codes based on density evolution, a crucial tool in the construction of both regular, i.e., unpunctured, as well as punctured polar codes. Our implementation of density evolution covers the construction of both regular and punctured polar codes and allows for treating the construction of both code classes in a unified framework. Using our implementation, we achieve substantial reductions in the number of density convolutions necessary for the construction of punctured polar codes and obtain tight upper bounds on the block error rates.

show abstract

“…To construct the PCs used throughout this work, we employ an optimized variant [28] of the construction heuristic [29]. Assuming an AWGN channel of SNR γ using binary phaseshift keying and hard-decision at the receiver, we target the equivalent binary symmetric channel during construction.…”

Section: Throughput Bound Of Polar Codesmentioning

confidence: 99%

Finite blocklength performance of a multi-relay network with best single relay selection

Schnelling

Amraue

et al. 2017

2017 International Symposium on Wireless Communication Systems (ISWCS)

Self Cite

View full text Add to dashboard Cite

Abstract-We consider a multi-relay system where the best single relay is selected to assist transmissions. We study the performance bound of the system in the finite blocklength regime. On the one hand, we extend Polyanskiy's finite blocklength model of a single-hop scenario to the considered relaying system and derive the corresponding achievable throughput. On the other hand, by employing a practical coding scheme, namely polar codes, a finite blocklength performance bound attainable by a low-complexity coding scheme is provided. Through simulation and numerical investigations, we show the appropriateness of the proposed bounds. Moreover, we evaluate both the achievable performance with finite blocklengths and the performance of polar codes in the best single relay scenario in comparison to direct transmission.Index Terms-best single relay, decode-and-forward, finite blocklength regime, relaying, polar codes.

show abstract

Construction of Polar Codes Exploiting Channel Transformation Structure

Cited by 9 publications

References 8 publications

Polarization Weight Family Methods for Polar Code Construction

Polarization Weight Family Methods for Polar Code Construction

Efficient Implementation of Density Evolution for Punctured Polar Codes

Finite blocklength performance of a multi-relay network with best single relay selection

Contact Info

Product

Resources

About