Process / pipelineCoding theory
Turbo码（Turbo Coding）与迭代译码
Turbo码由Berrou、Glavieux和Thitimajshima于1993年提出，是信道编码史上的一个里程碑。它们实现了接近香农极限（通信可靠性的理论边界）0.5 dB的性能，这在以前被认为是不可能实现的实用复杂度。Turbo码使用级联卷积码、交织器和基于信念传播的迭代译码。它们被采用于3G（UMTS）系统，并在4G/5G系统中与LDPC码一同保持重要地位。
阅读完整方法
仅限会员
登录使用免费账户登录即可阅读本节。
Method map
The neighbourhood of related methods — select a node to explore.
来源
- Berrou, C., Glavieux, A., & Thitimajshima, P. (1993). Near Shannon limit error-correcting coding and decoding: Turbo-codes. In Proceedings of the IEEE International Conference on Communications (ICC), 1064-1070. DOI: 10.1109/ICC.1993.397441 ↗
- Richardson, T. J., & Urbanke, R. L. (2002). The capacity of low-density parity-check codes under message-passing decoding. IEEE Transactions on Information Theory, 47(2), 599-618. DOI: 10.1109/18.910577 ↗
如何引用本页
ScholarGate. (2026, June 3). Turbo Coding with Iterative Decoding. ScholarGate. https://scholargate.app/zh/telecommunications/turbo-code
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
- 极化码（Polar Codes）及其串行消除译码电信↔ compare
- 香农信道容量定理电信↔ compare