Publication

Hardware Architecture for List Successive Cancellation Decoding of Polar Codes

Andreas Peter Burg
2014
Journal Articles

Abstract

This brief presents a hardware architecture and algorithmic improvements for list successive cancellation (SC) decoding of polar codes. More specifically, we show how to completely avoid copying of the likelihoods, which is algorithmically the most cumbersome part of list SC decoding. The hardware architecture was synthesized for a blocklength of N = 1024 bits and list sizes L = 2, 4 using a UMC 90 nm VLSI technology. The resulting decoder can achieve a coded throughput of 181 Mb/s at a frequency of 459 MHz.

Official source

https://infoscience.epfl.ch/entities/publication/e9c88984-7a13-4768-840e-3126f151fdcd

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Hardware Architecture for List Successive Cancellation Decoding of Polar Codes

Chat with Graph Search

High-Throughput and Flexible Belief Propagation List Decoder for Polar Codes

A Generalized Adjusted Min-Sum Decoder for 5G LDPC Codes: Algorithm and Implementation

On Speed and Advantage : Results in Information Velocity and Monitoring Problems