방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 반복 복호화를 이용한 터보 코딩× | 저밀도 패리티 검사 부호 (LDPC)× | |
|---|---|---|
| 분야 | 통신공학 | 통신공학 |
| 계열 | Process / pipeline | Process / pipeline |
| 기원 연도≠ | 1993 | 1962 |
| 창시자≠ | Claude Berrou, Alain Glavieux, and Punya Thitimajshima | Robert Gallager |
| 유형≠ | iterative error-correcting code | linear error-correcting code |
| 원전≠ | 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 ↗ | Gallager, R. G. (1962). Low-density parity-check codes. IRE Transactions on Information Theory, 8(1), 21-28. DOI ↗ |
| 별칭 | iterative decoding, concatenated codes | sparse codes, belief propagation codes |
| 관련 | 5 | 5 |
| 요약≠ | 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. | 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. |
| ScholarGate데이터셋 ↗ |
|
|