Low-Complexity Finite Precision Decoders for Low-Density Parity-Check Codes
ITC/USA 2010 Conference Proceedings / The Forty-Sixth Annual International Telemetering Conference and Technical Exhibition / October 25-28, 2010 / Town and Country Resort & Convention Center, San Diego, California === We present a new class of finite-precision decoders for low-density parity-ch...
| Main Author: | |
|---|---|
| Other Authors: | |
| Language: | en_US |
| Published: |
International Foundation for Telemetering
2010
|
| Online Access: | http://hdl.handle.net/10150/605947 http://arizona.openrepository.com/arizona/handle/10150/605947 |
| Summary: | ITC/USA 2010 Conference Proceedings / The Forty-Sixth Annual International Telemetering Conference and Technical Exhibition / October 25-28, 2010 / Town and Country Resort & Convention Center, San Diego, California === We present a new class of finite-precision decoders for low-density parity-check (LDPC) codes. These decoders are much lower in complexity compared to conventional floating-point decoders such as the belief propagation (BP) decoder, but they have the potential to outperform BP. The messages utilized by the decoders assume values (or levels) from a finite discrete set. We discuss the implementation aspects as well as describe the underlying philosophy in designing these decoders. We also provide results to show that in some cases, only 3 bits are required in the proposed decoders to outperform floating-point BP. |
|---|