Polarization-Driven Puncturing for Polar Codes in 5g Systems

OLIVEIRA, ROBERT MOTA

doi:10.17771/pucrio.acad.34938

Cited by 1 publication

(4 citation statements)

References 43 publications

(111 reference statements)

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Figura 2: Canal W2. Retirado de [11] sendo ⊕ a soma módulo-2 das componentes do vetor u 2 1 . O próximo estágio de recursão é mostrado na figura 3 na qual duas cópias independentes de W 2 são combinadas para criar um canal W 4 : X 4 → Y 4 com probabilidades de transição W 4 (y 4 1…”

Section: Combinação De Canalunclassified

“…Figura 8: Comparação de esquemas sistemáticos e não sistemáticos para códigos polares com N=1024 e R= 1 2 . Retirado de [11].…”

Section: Codificação Sistemáticaunclassified

“…Figura 11: Evolução do caminho da decodificação para L=4. Retirado de [11] A figura 12 mostra a performance dos decodificadores para diferentes tamanhos de listas considerando códigos polares sistemáticos em um cenário eMBB com R= 1 2 e N=512. Os resultados mostram que a performance para o decodificador com L=1 é equivalente ao decodificador de cancelamento sucessivo e que há uma considerável melhora conforme o aumento do número de candidatos nas listas.…”

Section: Algorithm 1 Decodificador De Cancelamento Sucessivounclassified

“…Figura 12: Comparação do decodificador de cancelamento sucessivo em lista para diferentes L. Retirado de [11]…”

Section: Algorithm 1 Decodificador De Cancelamento Sucessivounclassified

See 3 more Smart Citations

Decodificação Belief Propagation Orientada a Q-Learning Para Códigos Polares

OLIVEIRA¹

View full text Add to dashboard Cite

Polar codes have been proved as a strong benchmark when it comes to channel polarization of the next generation of mobile communication, 5G. Introduced by Arikan, polar codes are the first type of channel codes in which their capacity can be achieved by means of theoretical proof, assuming an infinite code length and successive-cancellation decoder (SC). However, finite-length codes have a lower performance in terms of error rate under the SC decoder, in addition to presenting a higher latency due to the sequential nature of the decoder, in which the information bits are decoded serially.Considering that the SC decoder for finite length codes is sub-optimal, Tal and Vardy proposed a listbased Successive Cancellation Decoder (SCL) in which it approaches the maximum likelihood (ML) performance for a list size large enough at the cost of greater complexity. Furthermore, Cyclic Redundancy Check Codes (CRC) can be effortlessly implemented in order to improve the SCL algorithm by increasing its minimum distance. This combination makes polar codes a powerful decoding scheme, despite their high complexity and a serial inherent nature. Therefore, several variants of the decoder have been proposed in order to reduce the computational complexity.As an alternative to the serial nature of the SC decoder, Arikan proposed an iterative decoder algorithm with great potential for parallelism based on Belief Propagation (BP) under the codification diagram of the polar codes. Nevertheless, despite the algorithm outperforming the SC decoder, being a strong candidate in applications which demand a high data rate and more suitable to hardware implementations, your performance is not comparable to the CRC-aided SCL decoder. Therefore, several efforts have been made to enhance the decoder performance. It has been shown that finite-length polar codes under BP decoding can be improved when semi-polarized channels are additionally protected by check nodes, or with an augmented polar code. Unfortunately, these approaches have inferior performance when compared to SCL decoding. Besides, they require an adjusted code structure and are thus not compatible with the standardized polar code in the literature. Therefore, our project consists of developing a new BP decoder, based on Q-Learning, which maintains the polar code structure, and obtains a performance consistently superior to the standard BP and SC decoders.

show abstract

Section: Combinação De Canalunclassified

“…Figura 8: Comparação de esquemas sistemáticos e não sistemáticos para códigos polares com N=1024 e R= 1 2 . Retirado de [11].…”

Section: Codificação Sistemáticaunclassified

Section: Algorithm 1 Decodificador De Cancelamento Sucessivounclassified

“…Figura 12: Comparação do decodificador de cancelamento sucessivo em lista para diferentes L. Retirado de [11]…”

Section: Algorithm 1 Decodificador De Cancelamento Sucessivounclassified

See 2 more Smart Citations