Comparar métodos

	Codificação Turbo com Decodificação Iterativa	Teorema da Capacidade de Canal de Shannon
Área	Telecomunicações	Telecomunicações
Família	Process / pipeline	Process / pipeline
Ano de origem	1993	1948
Autor original	Claude Berrou, Alain Glavieux, and Punya Thitimajshima	Claude Shannon
Tipo	iterative error-correcting code	fundamental theoretical bound
Fonte seminal	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.	Shannon, C. E. (1948). A mathematical theory of communication. Bell System Technical Journal, 27(3), 379-423.
Outros nomes	iterative decoding, concatenated codes	channel capacity, information theory bound
Relacionados	5	5
Resumo	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.	Shannon's channel capacity theorem, published in 1948, establishes the maximum rate at which information can be reliably transmitted over a noisy channel. Expressed as C = B log2(1 + S/N) for additive white Gaussian noise (AWGN), it is a fundamental bound in information theory and communications engineering. Shannon proved that reliable communication is possible at any rate below capacity, and impossible above it. This theorem underpins the design of all modern communication systems and motivates coding theory, modulation, and signal processing techniques.