REVIEW
GSVD-Based Precoding in MIMO Systems With Integrated Services
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
GSVD-Based Precoding in MIMO Systems With Integrated Services
read the original abstract
This letter considers a two-receiver multiple-input multiple-output (MIMO) Gaussian broadcast channel model with integrated services. Specifically, we combine two sorts of service messages, and serve them simultaneously: one multicast message intended for both receivers and one confidential message intended for only one receiver. The confidential message is kept perfectly secure from the unauthorized receiver. Due to the coupling of service messages, it is intractable to seek capacity-achieving transmit covariance matrices. Accordingly, we propose a suboptimal precoding scheme based on the generalized singular value decomposition (GSVD). The GSVD produces several virtual orthogonal subchannels between the transmitter and the receivers. Subchannel allocation and power allocation between multicast message and confidential message are jointly optimized to maximize the secrecy rate in this letter, subject to the quality of multicast service (QoMS) constraints. Since this problem is inherently complex, a difference-of-concave (DC) algorithm, together with an exhaustive search, is exploited to handle the power allocation and subchannel allocation, respectively. Numerical results are presented to illustrate the efficacy of our proposed strategies.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.