A Novel Puncturing Scheme for Polar Codes

Wang, Runxin; Liu, Rongke

doi:10.1109/lcomm.2014.2364845

Cited by 174 publications

(193 citation statements)

References 7 publications

Supporting

Mentioning

191

Contrasting

Unclassified

Order By: Relevance

“…In this section, we evaluate the performance of the proposed NUPGA algorithm described in Section IV and compare it with the shortened polar code technique of [12], which is one of the most effective shortening techniques. We assess the Bit Error Rate (BER) and Frame Error Rate (FER) performances of the polar codes using BPSK for data transmission over an AWGN channel.…”

Section: Simulation Resultsmentioning

confidence: 99%

Non-Uniform Channel Polarization and Design of Rate-Compatible Polar Codes

Oliveira

Lamare

2019

2019 16th International Symposium on Wireless Communication Systems (ISWCS)

View full text Add to dashboard Cite

In this paper, we present the concept of non-uniform channel polarization and a scheme for rate-compatible polar code construction for any codeword length using additive white Gaussian noise (AWGN) channels and the successive cancellation (SC) decoder. A Non-Uniform Polarization technique based on the Gaussian Approximation (NUPGA) is developed and an efficient rate-compatible design technique is devised to choose the best channels for transmission by a process of re-polarization of the codeword with the desired length. Simulations illustrate the proposed NUPGA design against existing rate-compatible techniques. I. INTRODUTIONPolar codes, introduced by Arikan [1], were proved to achieve the symmetric capacity of binary input symmetric discrete memoryless channels (B-DMCs) under a Successive Cancellation (SC) decoder as the codelength goes to infinity. Polar codes are based on the phenomenon of channel polarization. The channel polarization theorem states that, as the codelength N goes to infinity, a polarized bit-channel becomes either a noiseless channel or a pure noise channel. The information bits are transmitted over the noiseless bit-channels and the pure noise bit-channels are set to zero (frozen bits). The construction of a polar code involves the identification of channel reliability values associated to each bit to be encoded. This identification can be effectively performed for a code length and a specific signal-to-noise ratio.Among the most well-known code construction techniques are the Bhattacharyya-based approach of Arikan [1], the Density Evolution (DE) schemes of Mori [2], [3] and Tal [4], the Gaussian Approximation (GA) technique of [5] and the Polarization Weigth (PW) algorithm [6]. The Bhattacharyya parameter-based approach that was proposed by Arikan along with Monte-Carlo (MC) simulations to estimate bit channel reliabilities [1]. The DE method proposed in [2] and [3] can provide theoretical guarantees on the estimation accuracy at a high computational cost. Extending the ideas of [2][3], Tal [4] devised two approximation methods by which one can get upper and lower bounds on the error probability of each bit-channel efficiently. Since DE includes function convolutions, its precision is limited by the complexity. A bit-channel reliability estimation method for additive white Gaussian noise (AWGN) channels based on GA of DE has been proposed in [5], giving accurate results with limited complexity. The PW algorithm [6] is a recent attempt to study

show abstract

Section: Simulation Resultsmentioning

confidence: 99%

Non-Uniform Channel Polarization and Design of Rate-Compatible Polar Codes

Oliveira

Lamare

2019

2019 16th International Symposium on Wireless Communication Systems (ISWCS)

View full text Add to dashboard Cite

show abstract

“…Polar code was chosen to compose the first transceiver version due to its low complexity and superior performance considering short code words [14]. Polar code is implemented under Successive Cancellation decoding (SCD), using the shortening technique described in [15] with selectable code rates of 1/2, 2/3, 3/4 and 5/6.…”

Section: Transceiver Descriptionmentioning

confidence: 99%

Performance Analysis of a 5G Transceiver Implementation for Remote Areas Scenarios

Dias

Gaspar

Mendes

et al. 2018

2018 European Conference on Networks and Communications (EuCNC)

View full text Add to dashboard Cite

Fifth generation of mobile communication networks will support a large set of new services and applications. One important use case is the remote area coverage for broadband Internet access. This use case has significant social and economical impact, since a considerable percentage of the global population living in low populated area does not have Internet access and the communication infrastructure in rural areas can be used to improve agrobusiness productivity. The aim of this paper is to analyze the performance of a 5G for Remote Areas transceiver, implemented on field programmable gate array based hardware for real-time processing. This transceiver employs the latest digital communication techniques, such as generalized frequency division multiplexing waveform combined with 2 by 2 multipleinput multiple-output diversity scheme and polar channel coding. The performance of the prototype is evaluated regarding its outof-band emissions and bit error rate under AWGN channel.

show abstract

“…SCL decoding algorithm with list size 8 is employed for similar complexity consideration. A novel puncturing scheme is applied (Wang, 2014). …”

Section: Polar Codementioning

confidence: 99%