Polar codes : A pipelined implementation

Polar codes are a class of codes that can achieve the capacity of binary-input memoryless channels with certain symmetries. These codes have a recursive structure tha t make it possible to encode and decode them within complexity O(N log N) for a code of block length N . This paper presents pipelined architectures with identical modules that are useful for low-complexity implementation of polar codes both in hardware and software. The uniform structure of the modules in the design make it possible to trade complexity for time in hardware implementations.