Process / pipelineCoding theory
极化码（Polar Codes）及其串行消除译码
极化码由 Erdal Arikan 于 2009 年提出，是首个被证明能够达到对称二元输入无记忆信道香农容量的构造性码族。它们采用递归构造和串行消除译码（successive cancellation decoding），这是一种具有理论保证的简单贪心算法。极化码已被采用于 5G 新空口（NR）的控制信道编码，并正在为未来的 6G 系统进行研究。与（经验性的）Turbo 码和 LDPC 码不同，极化码提供了严格的理论基础。
阅读完整方法
仅限会员
登录使用免费账户登录即可阅读本节。
Method map
The neighbourhood of related methods — select a node to explore.
来源
- Arikan, E. (2009). Channel polarization: A method for constructing capacity-achieving codes for symmetric binary-input memoryless channels. IEEE Transactions on Information Theory, 55(7), 3051-3073. DOI: 10.1109/TIT.2009.2021379 ↗
- Sasoglu, E., Telatar, I., & Yildirim, E. (2011). Polarization for arbitrary discrete memoryless channels. In Proceedings of the IEEE Information Theory Workshop (ITW), 144-148. link ↗
如何引用本页
ScholarGate. (2026, June 3). Polar Codes with Successive Cancellation Decoding. ScholarGate. https://scholargate.app/zh/telecommunications/polar-codes
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
- 低密度奇偶校验码 (LDPC)电信↔ compare
- 多输入多输出 (MIMO)电信↔ compare
- 正交频分复用 (OFDM)电信↔ compare
- 香农信道容量定理电信↔ compare
- Turbo码（Turbo Coding）与迭代译码电信↔ compare