An FPGA implementation architecture for decoding of polar codes
2011 8th International Symposium on Wireless Communication Systems
437 - 441
Item Usage Stats
Polar 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.
Belief propagation decoding
Convolutional turbo codes
Source and channel coding
Field programmable gate arrays (FPGA)
Global system for mobile communications
Published Version (Please cite this version)http://dx.doi.org/10.1109/ISWCS.2011.6125398
Showing items related by title, author, creator and subject.
Bhat, U.; Duman, T. M. (Institute of Electrical and Electronics Engineers, 2012)A two-way relay channel is considered where two users exchange information via a common relay in two transmission phases using physical-layer network coding (PNC). We consider an optimal decoding strategy at the relay to ...
Pamuk, Alptekin; Arıkan, Erdal (IEEE, 2013)We propose a two-phase successive cancellation (TPSC) decoder architecture for polar codes that exploits the array-code property of polar codes by breaking the decoding of a length-TV polar code into a series of length-√ ...
An efficient computation model for coarse grained reconfigurable architectures and its applications to a reconfigurable computer Atak, Oğuzhan; Atalar, Abdullah (IEEE, 2010-07)The mapping of high level applications onto the coarse grained reconfigurable architectures (CGRA) are usually performed manually by using graphical tools or when automatic compilation is used, some restrictions are imposed ...