手法を比較
選択した手法を並べて確認できます。異なる行はハイライト表示されます。
| 低密度パリティ検査符号（LDPC）× | 反復復号化によるターボ符号化× | |
|---|---|---|
| 分野 | 通信工学 | 通信工学 |
| 系統 | Process / pipeline | Process / pipeline |
| 提唱年≠ | 1962 | 1993 |
| 提唱者≠ | Robert Gallager | Claude Berrou, Alain Glavieux, and Punya Thitimajshima |
| 種類≠ | linear error-correcting code | iterative error-correcting code |
| 原典≠ | Gallager, R. G. (1962). Low-density parity-check codes. IRE Transactions on Information Theory, 8(1), 21-28. DOI ↗ | 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 ↗ |
| 別名 | sparse codes, belief propagation codes | iterative decoding, concatenated codes |
| 関連 | 5 | 5 |
| 概要≠ | LDPC codes, invented by Robert Gallager in 1962 and rediscovered in the 1990s by MacKay, are linear error-correcting codes defined by sparse parity-check matrices. They achieve performance within 0.4 dB of the Shannon limit with iterative belief-propagation decoding and have become the standard for modern wireless (WiFi-6, 5G NR, Digital Video Broadcasting). Unlike turbo codes, LDPC codes have a more elegant graph-theoretic structure and more mature theoretical analysis. | Turbo codes, introduced by Berrou, Glavieux, and Thitimajshima in 1993, are a landmark in channel coding history. They achieve performance within 0.5 dB of the Shannon limit—the theoretical boundary for reliable communication—a feat previously thought impossible with practical complexity. Turbo codes use concatenated convolutional codes with an interleaver and iterative decoding via belief propagation. They were adopted in 3G (UMTS) and remain important in 4G/5G systems alongside LDPC codes. |
| ScholarGateデータセット ↗ |
|
|