Lower-Complexity Layered Belief Propagation Decoding Ldpc Codes
Tech ID: 21610 / UC Case 2008-239-0
Summary
Researchers at UCLA have developed a novel Low-Density Parity-Check (LDPC) channel coding scheme for high-rate wireless communication systems, which in addition to outperforming conventional scheduling schemes, provides a low-complexity, partially parallel decoder for small-to-medium blocklength codes.
Background
Due to their higher convergence speed and simplicity in iterative decoding, LDPC codes are often proposed as the channel coding solutions for modern wireless systems. This recent success of LDPC codes is mainly due to structures that allow partially-parallel decoders, resulting in significant higher throughput than conventional decoders. However, for small-to-medium blocklength codes, such as the IEEE 802.15.3c standard, current LDPC schemes cannot perform partially-parallel computations, dropping their performance to conventional coding methods.
Innovation
Researchers at UCLA have developed a low-complexity partially-parallel decoder for small-to-medium blocklength high-rate LDPC codes. Through implementing a scheduling scheme that updates variable nodes in a zigzag pattern, the design can be applied to any LDPC code while maintaining a partially-parallel structure. The proposed scheme performs with faster convergence speed and improved decoding capability compared to conventional decoding methods.
Applications
Wireless Communication Systems
- High-rate LDPC code: mmWave WPAN (IEEE 802.15.3c)
Advantages
- Improved decoding capability
- Faster convergence speed
- High throughput
- Area efficient
Patent Status
United States Of America |
Issued Patent |
8,489,957 |
07/16/2013 |
2008-239 |
|
|
Related Materials