Precoding and scheduling while minimizing age of incorrect information for multiple access systems

Abstract

In some implementations, a transmitter may determine that a difference between a total age of incorrect information (AoII) obtained in a current iteration of an iterative algorithm and a total AoII in a previous iteration of the iterative algorithm satisfies a tolerance factor for algorithm convergence. The transmitter may use the iterative algorithm to solve a convex optimization problem based on a plurality of iterations that continue until an objective function associated with AoII converges to within the tolerance factor for algorithm convergence. The transmitter may determine a precoder matrix and a vector of scheduling indicators from a solving of the convex optimization problem. The transmitter may transmit, using a downlink multi-user communication framework based on rate-splitting multiple access (RSMA) in a semantic-aware network, one or more updates to one or more receivers based on the precoder matrix and the vector of scheduling indicators.