LDPC Row Orthogonality for Flexible Decoder Scheduling

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current wireless communication systems face challenges in efficiently encoding and decoding data at high rates while maintaining low error rates, particularly in emerging 5G technologies like New Radio (NR), where errors can render data unusable due to noise and distortion, necessitating retransmissions and requiring improved error correction mechanisms.

Innovation Solution

The implementation of low-density parity-check (LDPC) codes with pairwise orthogonality in the parity check matrix (PCM) enables flexible encoder/decoder scheduling without performance loss, allowing for efficient encoding and decoding operations in wireless communication systems, including 5G networks, by leveraging the unique orthogonality arrangements in the base graph.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Speed

If LDPC codes are used for high-rate data transmission, then transmission speed is improved, but error rate increases due to noise and distortion

Engineering Contradiction:
Improvedata transmission speedVSAvoiderror rate
Core Design Contradiction:
SpeedVSReliability

Solution Approach 1:

The patent applies parameter changes by modifying the parity check matrix structure to have pairwise orthogonal adjacent rows, which changes the mathematical properties of the LDPC code to improve error correction capability while maintaining high transmission rates

Inventive Principle:
Principle #35Parameter changes

2Reliability

If error correction mechanisms are strengthened to reduce error rates, then reliability is improved, but device complexity increases

Engineering Contradiction:
Improveerror correction capabilityVSAvoidencoder/decoder complexity
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The patent applies segmentation by dividing the parity check matrix into sections with orthogonal adjacent rows, allowing the decoder to process errors in a structured manner that improves reliability without requiring completely complex new decoding algorithms

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent changes the structural parameters of the LDPC code by enforcing pairwise orthogonality on adjacent rows of the parity check matrix, which inherently improves error correction while maintaining algorithmic simplicity

Inventive Principle:
Principle #35Parameter changes

3Reliability

If retransmissions are used to correct errors, then reliability is improved, but loss of time increases

Engineering Contradiction:
Improvedata accuracyVSAvoidretransmission delay
Core Design Contradiction:
ReliabilityVSLoss of time

Solution Approach 1:

The patent applies preliminary action by pre-configuring the LDPC code with orthogonal row structures that are specifically designed to correct errors in the first decoding attempt, eliminating the need for subsequent retransmissions and associated delays

Inventive Principle:
Principle #10Preliminary action

Data Source

PatentUSRE49989E1Communication techniques involving pairwise orthogonality of adjacent rows in LPDC code
Publication Date: 2024.05.28 QUALCOMM INC
  • USRE49989E1 patent drawing
  • USRE49989E1 patent drawing
  • USRE49989E1 patent drawing

AI summary

Certain aspects of the present disclosure provide low-density parity-check (LDPC) codes having pairwise orthogonality of adjacent rows, and a new decoder that exploits the pairwise row orthogonality for flexible decoder scheduling without performance loss. An apparatus includes a receiver configured to receive a codeword in accordance with a radio technology across a wireless channel via one or more antenna elements situated proximal the receiver. The apparatus includes at least one processor coupled with a memory and comprising decoder circuitry configured to decode the codeword based on a LDPC code to produce a set of information bits. The LDPC code is stored in the memory and defined by a base matrix having columns in which all adjacent rows are orthogonal in a last portion of the rows.