Upper and Lower Bounds on the Computational Complexity of Polar Encoding and Decoding

摘要

It is shown that all polar encoding schemes using a standard encoding matrix with rate R>1/2 and block length N have energy within the Thompson circuit model that scales at least as E ≥ Ω (N