LAUSR

This paper studies the minimization of nth (positive integer) order rate matching in high-throughput multi-beam satellite systems, based on one-to-many capacity allocation pairings, for the first time in the literature. The offered and requested capacities of gateways and users’ beams are exploited, respectively. Due to the high complexity of the binary optimization problem, its solution is approached with a two-step heuristic scheme. Firstly, the corresponding continuous, in [0, 1], pairing problem is solved applying the difference of convex optimization theory, and then, a transformation from continuous to binary feasible allocation is provided to extract the pairings among gateways and users’ beams. Comparing with the exponential-time optimal exhaustive mechanism that investigates all possible pairs to extract the best matching for minimizing the rate matching, extended simulations show that the presented approximation for the solution of the non-convex optimization problem has fast convergence and achieves a generally low relative error for lower value of n. Finally, the simulation results show the importance of n in the examined problem. Specifically, pairings originated by the minimization of rate matching with larger n result in more fair rate matching among users’ beams, which is a valuable result for satellite and generally wireless systems operators.