방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| Alamouti 시공간 블록 부호× | 저밀도 패리티 검사 부호 (LDPC)× | |
|---|---|---|
| 분야 | 통신공학 | 통신공학 |
| 계열 | Process / pipeline | Process / pipeline |
| 기원 연도≠ | 1998 | 1962 |
| 창시자≠ | Siavash Alamouti | Robert Gallager |
| 유형≠ | space-time coding scheme | linear error-correcting code |
| 원전≠ | Alamouti, S. M. (1998). A simple transmit diversity technique for wireless communications. IEEE Journal on Selected Areas in Communications, 16(8), 1451-1458. DOI ↗ | Gallager, R. G. (1962). Low-density parity-check codes. IRE Transactions on Information Theory, 8(1), 21-28. DOI ↗ |
| 별칭 | space-time coding, transmit diversity | sparse codes, belief propagation codes |
| 관련 | 5 | 5 |
| 요약≠ | The Alamouti code is an elegant space-time coding scheme that provides full transmit diversity using two antennas and a simple linear receiver. Introduced by Siavash Alamouti in 1998, it requires no channel state information at the transmitter, achieves the same bit-error rate as a single-antenna system with receiver diversity, and uses linear processing for decoding. The Alamouti code has become the de facto standard for transmit diversity in cellular systems and is adopted in LTE, WiFi, and many 5G protocols. | 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데이터셋 ↗ |
|
|