Bandwidth-efficient communication systems based on finite-length low density parity check codes
Low density parity check (LDPC) codes are linear block codes constructed by pseudo-random parity check matrices. These codes are powerful in terms of error performance and, especially, have low decoding complexity. While infinite-length LDPC codes approach the capacity of communication channels, fin...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en |
| Published: |
University of Saskatchewan
2006
|
| Subjects: | |
| Online Access: | http://library.usask.ca/theses/available/etd-10302006-234840/ |