A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is
We consider a new variant of successive cancellation decoder (SCD) for polar codes based on the concept of folding, which was proposed in ,  as technique to reduce the decoding latency at the cost of a higher computational complexity. In this paper, we first formally define the multiple folding operation (iterated κ times), which decomposes the original encoding graph into a number of smaller polar encoding graphs. More specifically, we show that the multiple folding gives rise to a twodoi:10.1109/itw.2014.6970858 dblp:conf/itw/VangalaVH14 fatcat:lc7nv5gn6nat7cxmj3uycygore