Сравнение методов
Просматривайте выбранные методы рядом; строки с различиями подсвечены.
| Нулевое принуждение и минимальная среднеквадратическая ошибка выравнивания× | Коды с низкой плотностью проверок на чётность (LDPC)× | |
|---|---|---|
| Область | Телекоммуникации | Телекоммуникации |
| Семейство | Process / pipeline | Process / pipeline |
| Год появления≠ | 1974 | 1962 |
| Автор метода≠ | Saleh Mansour and Paul Zervos | Robert Gallager |
| Тип≠ | linear equalization algorithm | linear error-correcting code |
| Основополагающий источник≠ | Proakis, J. G. (2001). Digital Communications (4th ed.). McGraw-Hill. link ↗ | Gallager, R. G. (1962). Low-density parity-check codes. IRE Transactions on Information Theory, 8(1), 21-28. DOI ↗ |
| Другие названия | channel equalization, interference cancellation | sparse codes, belief propagation codes |
| Связанные | 5 | 5 |
| Сводка≠ | Zero-Forcing (ZF) and Minimum Mean-Square Error (MMSE) equalization are fundamental linear receiver algorithms for combating intersymbol interference in dispersive channels. Developed in the context of data transmission theory, these methods form the basis of modern channel equalization in wireless and wired systems. While ZF aggressively cancels interference, MMSE balances interference suppression with noise enhancement, making it the optimal linear solution under Gaussian noise. | 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Набор данных ↗ |
|
|