Efficient LDPC Decoding

UC Case No. 2018-679

 

SUMMARY

Researchers in of UCLA’s Department of Electrical and Computer Engineering have developed an iterative decoding method that incorporates crucial “stop” rules utilizing the high rate portion of protograph-based raptor-like code to enable faster decoding of messages.

       

BACKGROUND

Satellite communication is essential for maintaining modern telecommunications. Noisy environments, however, often prevent transmitted codes from reaching the intended target. A common way to protect communications in harsh environments is to use low density parity check coding (LDPC) so even if the messages is corrupted, it can still be interpreted by the target. Unfortunately, this method of coding redundancy is often computationally dense and time consuming to decode, delaying the target’s ability to interpret the transmitted message.

 

INNOVATION

Under the direction of lead inventor Richard Wesel, UCLA researchers have developed a method for more efficient interpretation of LDPC messages. This method looks only for stop codewords in the high rate code (HRC) rather than the entire protograph-based raptor-like code, simplifying interpretation. When all stop codewords are reached, the redundant messages will no longer be computationally interpreted, allowing for the transition to the next piece of information. This holds great promise for enhancing satellite communication by providing a more rapid method of reading highly robust transmissions. 

 

POTENTIAL APPLICATIONS

  • Telecommunications
  • Coding

 

ADVANTAGES

  • More rapid interpretation of LDPC
  • Ability to send more LDPC which withstand harsh environments
  • Enhanced telecommunications

 

RELATED MATERIALS

Patent Information:
For More Information:
Joel Kehle
Business Development Officer
joel.kehle@tdg.ucla.edu
Inventors:
Richard Wesel
Sudarsan V.S. Ranganathan
Dariush Divsalar
Kasra Vakilinia