Pamuk, Alptekin2016-02-082016-02-0820112154-0217http://hdl.handle.net/11693/28305Date of Conference: 6-9 Nov. 2011Polar codes are a class of codes versatile enough to achieve the Shannon bound in a large array of source and channel coding problems. For that reason it is important to have efficient implementation architectures for polar codes in hardware. Motivated by this fact we propose a belief propagation (BP) decoder architecture for an increasingly popular hardware platform; Field Programmable Gate Array (FPGA). The proposed architecture supports any code rate and is quite flexible in terms of hardware complexity and throughput. The architecture can also be extended to support multiple block lengths without increasing the hardware complexity a lot. Moreover various schedulers can be adapted into the proposed architecture so that list decoding techniques can be used with a single block. Finally the proposed architecture is compared with a convolutional turbo code (CTC) decoder for WiMAX taken from a Xilinx Product Specification and seen that polar codes are superior to CTC codes both in hardware complexity and throughput. © 2011 IEEE.EnglishFPGAPolar codesBelief propagationBelief propagation decodingBlock lengthsBP decoderCode ratesConvolutional turbo codesDecoder architectureEfficient implementationFPGA implementationsHardware complexityhardware implementationHardware platformLarge arraysList decodingPolar codesProduct specificationsProposed architecturesShannon boundSource and channel codingDecodingField programmable gate arrays (FPGA)Global system for mobile communicationsHardwareSignal receiversWimaxArchitectureConference Paper10.1109/ISWCS.2011.6125398