A General Achievable Scheme for Linear Computation Broadcast Channel

2025-01-21

AI Summary

To address the dual challenges of efficient multi-user information transmission and coordinated interference suppression in Linear Computation Broadcast Channels (LCBCs), this paper pioneers the application of representable polymatroid theory to LCBC modeling, establishing a generalized subspace decomposition framework. Building upon this foundation, we propose a linear programming-based joint multicast opportunistic optimization paradigm, enabling constructive coding design for arbitrary numbers of users. Our approach unifies subspace decomposition, multicast coding, and interference alignment techniques, substantially expanding the achievable rate region. Crucially, while maintaining high computational task dissemination efficiency, our method delivers— for the first time—the first scalable, universal, and constructively realizable multi-user joint service solution for distributed computing communication systems.

Technology Category

• Constraint Satisfaction and Optimization: Distributed CSP/Optimization
• Search and Optimization: Distributed Search
• Planning, Routing, and Scheduling: Optimization of Spatio-temporal Systems

Application Category

• Economics, Online Markets and Human Computation: Incentives in network design for Web infrastructures and ecosystems
• Systems and Infrastructure for Web, Mobile and WoT: Experiences and lessons learnt from Web-based algorithms and system deployments
• Graph Algorithms and Modeling for the Web: Representation, reconstruction, and subgraph or motif discovery in Web-related graphs

Abstract

This paper presents a new achievable scheme for the Linear Computation Broadcast Channel (LCBC), which is based on a generalized subspace decomposition derived from representable polymatroid space. This decomposition enables the server to serve user demands with an approach of effective multicast and interference elimination. We extend existing results by introducing a linear programming framework to optimize multicast opportunities across an arbitrary number of users.

Problem

• Information Transmission Efficiency
• Interference Reduction
• Multi-User Communication

Innovation

• Linear Computational Broadcasting
• Mathematical Optimization
• Enhanced Information Transmission Efficiency