On metric sorting for successive cancellation list decoding of polar codes
- 1 May 2015
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE) in 2015 IEEE International Symposium on Circuits and Systems (ISCAS)
- p. 1993-1996
- https://doi.org/10.1109/iscas.2015.7169066
Abstract
We focus on the metric sorter unit of successive cancellation list decoders for polar codes, which lies on the critical path in all current hardware implementations of the decoder. We review existing metric sorter architectures and we propose two new architectures that exploit the structure of the path metrics in a log-likelihood ratio based formulation of successive cancellation list decoding. Our synthesis results show that, for the list size of L = 32, our first proposed sorter is 14% faster and 45% smaller than existing sorters, while for smaller list sizes, our second sorter has a higher delay in return for up to 36% reduction in the area.Keywords
Other Versions
This publication has 7 references indexed in Scilit:
- Hardware architecture for list successive cancellation polar decoderPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2014
- Efficient list decoder architecture for polar codesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2014
- Hardware Architecture for List Successive Cancellation Decoding of Polar CodesIEEE Transactions on Circuits and Systems II: Express Briefs, 2014
- LLR-based successive cancellation list decoding of polar codesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2014
- High Speed Architectures for Finding the First two Maximum/Minimum ValuesIEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2011
- List decoding of polar codesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2011
- Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless ChannelsIEEE Transactions on Information Theory, 2009