Segmented Bit Sequences for Limited-Bit Decoding Performance

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current communication systems face challenges in bit sequence segmentation when the quantity of bits in an encoded bit sequence is limited, leading to suboptimal decoding performance and encoding gain loss.

Innovation Solution

A method and apparatus for properly segmenting bit sequences by determining the quantity of segmented code blocks based on available physical resources and parameters, such as minimum bit rate and maximum code block length, to minimize encoding gain loss and improve decoding performance.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Length of stationary object

If code block segmentation is performed to support longer information length, then the information length capability is improved, but the encoding gain is lost

Engineering Contradiction:
Improveinformation lengthVSAvoidencoding gain
Core Design Contradiction:
Length of stationary objectVSReliability

Solution Approach 1:

The patent divides a long information sequence into multiple code blocks of manageable length (≤6144 bits each) for turbo encoding, then concatenates the encoded blocks. This segmentation enables support for information lengths exceeding 6144 bits while maintaining the encoding gains of shorter blocks through proper segmentation and concatenation strategies.

Inventive Principle:
Principle #1Segmentation

2Device complexity

If the quantity of bits in encoded bit sequence is limited for proper decoding complexity, then the decoder complexity is controlled, but the decoding performance deteriorates

Engineering Contradiction:
Improvedecoder complexityVSAvoiddecoding performance
Core Design Contradiction:
Device complexityVSReliability

Solution Approach 1:

The patent segments the encoded bit sequence into multiple code block groups, each containing a limited number of bits that can be processed by the LDPC decoder with controlled complexity. By properly determining the number of code block groups and bits per group based on system parameters, the patent maintains decoding performance while controlling decoder complexity.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent dynamically adjusts parameters such as the number of code block groups, bits per group, and LDPC code rate based on the total number of encoded bits and system requirements. This parameter optimization ensures that the LDPC decoder operates within acceptable complexity limits while achieving target decoding performance.

Inventive Principle:
Principle #35Parameter changes

3Device complexity

If no proper bit sequence segmentation scheme is applied, then the system simplicity is maintained, but the decoding error block rate increases

Engineering Contradiction:
Improvesegmentation scheme complexityVSAvoiddecoding error block rate
Core Design Contradiction:
Device complexityVSReliability

Solution Approach 1:

The patent performs preliminary determination of the optimal number of code block groups and bits per group before actual encoding and segmentation. By calculating these parameters in advance based on the total information length and system constraints, the patent ensures proper segmentation that minimizes decoding error block rate without requiring complex real-time segmentation decisions.

Inventive Principle:
Principle #10Preliminary action

Data Source

PatentUS11139917B2Communication method and apparatus using segmented bit sequences
Publication Date: 2021.10.05 HUAWEI TECH CO LTD
  • US11139917B2 patent drawing
  • US11139917B2 patent drawing
  • US11139917B2 patent drawing

AI summary

A communication method is provided, including: obtaining a to-be-segmented first bit sequence, where a quantity of bits in the first bit sequence is B, and a quantity of bits that can be carried by a physical resource corresponding to the first bit sequence is N1; determining, based on N1 and a parameter L, a quantity C of bit sequences obtained by segmenting the first bit sequence, where a value of L is equal to (B+B1)/Rmin,K<sub2>max</sub2>, Rmin,K<sub2>max </sub2>is a minimum bit rate corresponding to an available maximum code block length Kmax, and B1 is an integer greater than or equal to 0; and segmenting the first bit sequence into C segmented bit sequences. Based on the method, a proper code block segmentation scheme can be provided.