18390349. RATE MATCHING METHODS FOR LDPC CODES simplified abstract (Telefonaktiebolaget LM Ericsson (publ))

From WikiPatents
Jump to navigation Jump to search

RATE MATCHING METHODS FOR LDPC CODES

Organization Name

Telefonaktiebolaget LM Ericsson (publ)

Inventor(s)

Mattias Andersson of SUNDBYBERG (SE)

Yufei Blankenship of KILDEER IL (US)

Sara Sandberg of LULEÅ (SE)

RATE MATCHING METHODS FOR LDPC CODES - A simplified explanation of the abstract

This abstract first appeared for US patent application 18390349 titled 'RATE MATCHING METHODS FOR LDPC CODES

Simplified Explanation

The abstract describes a method of producing coded bits for transmission in a wireless communications system by encoding information bits with a low-density parity-check code and performing circular buffer-based rate matching.

  • Low-density parity-check code used for encoding information bits
  • Circular buffer-based rate matching performed on the codeword vector
  • Coded bits produced for transmission between nodes in a wireless communications system

Potential Applications

The technology described in this patent application could be applied in various wireless communication systems, such as cellular networks, satellite communications, and IoT devices.

Problems Solved

This technology helps in improving the reliability and efficiency of data transmission in wireless communication systems by using low-density parity-check codes and circular buffer-based rate matching.

Benefits

  • Enhanced error correction capabilities
  • Increased data transmission efficiency
  • Improved overall performance of wireless communication systems

Potential Commercial Applications

  • Cellular network infrastructure
  • Satellite communication systems
  • Internet of Things (IoT) devices

Possible Prior Art

One possible prior art related to this technology is the use of low-density parity-check codes in wireless communication systems for error correction and data reliability.

Unanswered Questions

How does the circular buffer-based rate matching algorithm impact the overall performance of the wireless communication system?

The article does not delve into the specific details of how the circular buffer-based rate matching algorithm affects the performance of the wireless communication system.

Are there any limitations or constraints in implementing this method in real-world wireless communication systems?

The article does not address any potential limitations or constraints that may arise when implementing this method in practical wireless communication systems.


Original Abstract Submitted

A method of producing a set of coded bits from a set of information bits for transmission between a first node and a second node in a wireless communications system, the method comprises generating a codeword vector by encoding the set of information bits with a low-density parity-check code, wherein the codeword vector is composed of systematic bits and parity bits. The method comprises performing circular buffer-based rate matching on the generated codeword vector to produce the coded bits for transmission, wherein the circular buffer-based rate matching comprises puncturing a first plurality of systematic bits.