Coded Modulation Mapping With Joint Parity-Check Optimization

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing non-binary error correcting codes for coded modulations are sub-optimal in maximizing Euclidean distance, which affects decoding error performance, especially in high-order modulations, due to the separation of parity-check matrix optimization and modulation mapping considerations.

Innovation Solution

A method for joint optimization of non-zero coefficients in the parity-check equation and modulation mappings to minimize decoding error probability, aligning with the specific requirements of high-order modulations and Euclidean distance properties.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If non-binary error correcting codes are used for high-order modulations, then spectral efficiency is improved, but decoding error performance deteriorates due to sub-optimal Euclidean distance maximization

Engineering Contradiction:
Improvespectral efficiencyVSAvoiddecoding error performance
Core Design Contradiction:
ProductivityVSReliability

Solution Approach 1:

The patent combines the optimization of non-zero coefficients in the parity-check matrix with the optimization of modulation mappings into a single joint optimization process. This merging allows simultaneous consideration of both error correcting code properties and modulation properties to maximize Euclidean distance, thereby improving decoding error performance while maintaining spectral efficiency in high-order modulations

Inventive Principle:
Principle #5Merging (Combining)

Solution Approach 2:

The patent changes the optimization parameters from separate independent optimizations to a joint optimization framework that simultaneously adjusts non-zero coefficients and modulation mappings. This parameter change enables the system to maximize Euclidean distance by considering the interplay between code structure and modulation scheme, resolving the contradiction between spectral efficiency and error performance

Inventive Principle:
Principle #35Parameter changes

2Device complexity

If parity-check matrix optimization is performed separately from modulation mapping, then device complexity is reduced, but Euclidean distance maximization is compromised

Engineering Contradiction:
Improveoptimization process complexityVSAvoidEuclidean distance optimization
Core Design Contradiction:
Device complexityVSManufacturing precision

Solution Approach 1:

The patent merges two separate optimization processes (parity-check matrix optimization and modulation mapping optimization) into a single joint optimization process. This combining approach increases optimization precision by considering the interaction between code and modulation parameters, while the unified framework actually reduces overall system complexity by eliminating the need for separate optimization stages and their associated interfaces

Inventive Principle:
Principle #5Merging (Combining)

Data Source

PatentEP3291449B1Methods and devices for generating optimized coded modulations
Publication Date: 2023.05.24 UNIVERSITY OF SOUTHERN BRITTANY
  • EP3291449B1 patent drawingFigure 1~3
  • EP3291449B1 patent drawingFigure 4~5
  • EP3291449B1 patent drawingFigure 6~7

AI summary

Embodiments of the invention provide a device for determining a coded modulation scheme, said coded modulation scheme being defined by at least one non-binary error correcting code containing at least one non-binary parity-check equation, a modulation scheme, and a modulation mapping, wherein the device comprises: - a calculation unit (31) configured to determine one or more candidate modulation mappings and one or more candidate parity-check equations defining said at least one non-binary error correcting code, each set of a candidate modulation mapping and at least one candidate parity-check equation providing codeword vectors and being associated with one or more metrics, each metric being defined by a number of distinct pairs of codeword vectors having an Euclidean distance of a defined value; and - a selection unit (35) configured to select one candidate modulation mapping and at least one candidate parity-check equation according to an optimization criterion applied to said one or more metrics.