Architecture and optimization of high-throughput belief propagation decoding of polar codes
Authors:
- 11 August 2016
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 165-168
Abstract
Belief propagation (BP) is one common decoding algorithm for polar codes. BP can be implemented using a forward-backward flooding schedule that removes the data dependency. The intrinsic parallelism of the BP algorithm permits a high throughput. In this paper, we present a parallel BP decoder design space exploration. Through gate-level implementations, we analyze the silicon area, throughput, and power consumption of each design. We present adaptive quantization and early convergence detection to improve the error-correcting performance and throughput of BP decoders.Keywords
This publication has 8 references indexed in Scilit:
- Enhanced belief propagation decoding of polar codes through concatenation2014
- Architecture optimizations for BP polar decoders2013
- Increasing the Throughput of Polar DecodersIEEE Communications Letters, 2013
- A Semi-Parallel Successive-Cancellation Decoder for Polar CodesIEEE Transactions on Signal Processing, 2012
- An FPGA implementation architecture for decoding of polar codes2011
- A Simplified Successive-Cancellation Decoder for Polar CodesIEEE Communications Letters, 2011
- List decoding of polar codes2011
- Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless ChannelsIEEE Transactions on Information Theory, 2009