Network Coding Codebook Extension for Flexible Code Rates
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing network coding technologies face challenges in balancing coding efficiency and flexible code rates, with methods like fountain codes and MDS codes either lacking linear independence or being inflexible in codebook size, limiting their effectiveness in new radio access technologies.
Innovation Solution
The proposed solution involves extending codebooks by combining them with additional codewords or matrices to maintain linear independence, allowing for more redundant packets and flexible code rates, using methods such as full-rank matrices, Vandermonde matrices, and varying field sizes to enhance coding efficiency and reliability.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If fountain codes and random linear network coding are used to support flexible code rates, then code rate flexibility is improved, but coding efficiency deteriorates due to inability to ensure linear independence of coding coefficients
Solution Approach 1:
The patent changes the parameter of codebook construction by using Vandermonde matrices or Cauchy matrices with carefully selected parameters (α_i values) to ensure linear independence. By adjusting the field size and matrix parameters, the system achieves both flexible code rates and guaranteed coding efficiency through mathematical properties of these structured matrices.
Solution Approach 2:
The patent combines the flexibility of random linear network coding with the structured properties of Vandermonde/Cauchy matrices to create a hybrid codebook structure. This composite approach integrates the advantages of both methods: the adaptability of random coding and the linear independence guarantee of structured matrices, thereby resolving the contradiction between flexibility and efficiency.
2Productivity
If MDS code based on codebook with fixed size is used to ensure linear independence of coding coefficients, then coding efficiency is improved, but flexible code rates cannot be supported
Solution Approach 1:
The patent makes the codebook dynamic by allowing its size to vary based on the number of original data packets. The codebook is constructed on-demand with size matching the input data, enabling flexible code rates while maintaining the linear independence properties of Vandermonde/Cauchy matrices that ensure coding efficiency.
Solution Approach 2:
The patent changes the field size parameter of the finite field based on the required code rate and data size. By dynamically selecting appropriate field sizes and matrix parameters, the system adapts the codebook to different coding scenarios while preserving the mathematical guarantees of linear independence and coding efficiency.
3Reliability
If codebook size is fixed based on field size of finite field, then linear independence of coding coefficients is ensured, but flexible quantities and block lengths of original data packets cannot be supported
Solution Approach 1:
The patent dynamically adjusts the field size parameter of the finite field according to the quantity of original data packets. By selecting appropriate field sizes and constructing Vandermonde/Cauchy matrices with adaptive parameters, the system ensures linear independence for any data packet quantity while maintaining reliability through the mathematical properties of these matrices.
Data Source
AI summary
A data processing method and apparatus are disclosed, which may be applied to communication systems such as 5G and 6G. The method includes: obtaining an extended first codebook based on a second codebook by increasing a quantity of codewords or lengths of codewords, and performing first network coding or decoding based on the first codebook. Linear independence between codewords in the extended first codebook may be ensured as much as possible, so as to generate more valid redundant packets or check packets, thereby improving system reliability. Alternatively, flexible block lengths are supported, so as to perform efficient network coding or decoding on more original data packets, thereby improving system spectral efficiency. This application may be applied to an extended reality XR service or another low-delay service.