Search Results (4)

The celebrated Blahut–Arimoto algorithm computes the capacity of a discrete memoryless point-to-point channel by alternately maximizing the objective function of a maximization problem. This algorithm has been applied to degraded broadcast channels, in which the supporting hyperplanes of the capacity region are again cast as maximization problems. In this work, we consider general broadcast channels and extend this algorithm to compute inner and outer bounds on the capacity regions. Our main contributions are as follows: first, we show that the optimization problems are max–min problems and that the exchange of minimum and maximum holds; second, we design Blahut–Arimoto algorithms for the maximization part and gradient descent algorithms for the minimization part; third, we provide convergence analysis for both parts. Numerical experiments validate the effectiveness of our algorithms. Full article

This paper focuses on K-receiver discrete-time memoryless broadcast channels (DM-BCs) with private messages, where the transmitter wishes to convey K private messages to K receivers. A general inner bound on the capacity region is proposed based on an exhaustive message splitting and a K-level modified Marton’s coding. The key idea is to split every message into ${\sum }_{j=1}^K\left(\genfrac{}{}{0pt}{}{K}{j-1}\right)$ submessages each corresponding to a set of users who are assigned to recover them, and then send these submessages via codewords chosen from a K-level structure codebooks. To guarantee the joint typicality among all transmitted codewords, a sufficient condition on the subcodebooks’ sizes is derived through a newly establishing hierarchical covering lemma, which extends the 2-level multivariate covering lemma to the K-level case with more intricate dependences. As the number of auxiliary random variables and rate conditions both increase exponentially with K, the standard Fourier–Motzkin elimination procedure becomes infeasible when K is large. To tackle this problem, we obtain a closed form of achievable rate region with a special observation of disjoint unions of sets that constitute the power set of $\{1,\cdots ,K\}$. The proposed achievable rate region allows arbitrary input probability mass functions and improves over previously known achievable (closed form) rate regions for K-receiver ($K\ge 3$) BCs. Full article

The four-node relay broadcast channel (RBC) is considered, in which a transmitter communicates with two receivers with the assistance of a relay node. We first investigate three types of physically degraded RBCs (PDRBCs) based on different degradation orders among the relay and the receivers’ observed signals. For the discrete memoryless (DM) case, only the capacity region of the second type of PDRBC is already known, while for the Gaussian case, only the capacity region of the first type of PDRBC is already known. In this paper, we step forward and make the following progress: (1) for the first type of DM-PDRBC, a new outer bound is established, which has the same rate expression as an existing inner bound, with only a slight difference on the input distributions; (2) for the second type of Gaussian PDRBC, the capacity region is established; (3) for the third type of PDRBC, the capacity regions are established both for DM and Gaussian cases. Besides, we also consider the RBC with relay feedback where the relay node can send the feedback signal to the transmitter. A new coding scheme based on a hybrid relay strategy and a layered Marton’s coding is proposed. It is shown that our scheme can strictly enlarge Behboodi and Piantanida’s rate region, which is tight for the second type of DM-PDRBC. Moreover, we show that capacity regions of the second and third types of PDRBCs are exactly the same as that without feedback, which means feedback cannot enlarge capacity regions for these types of RBCs. Full article

We consider the problem of channel coding over multiterminal state-dependent channels in which neither transmitters nor receivers but only a helper node has a non-causal knowledge of the state. Such channel models arise in many emerging communication schemes. We start by investigating the parallel state-dependent channel with the same but differently scaled state corrupting the receivers. A cognitive helper knows the state in a non-causal manner and wishes to mitigate the interference that impacts the transmission between two transmit–receive pairs. Outer and inner bounds are derived. In our analysis, the channel parameters are partitioned into various cases, and segments on the capacity region boundary are characterized for each case. Furthermore, we show that for a particular set of channel parameters, the capacity region is entirely characterized. In the second part of this work, we address a similar scenario, but now each channel is corrupted by an independent state. We derive an inner bound using a coding scheme that integrates single-bin Gel’fand–Pinsker coding and Marton’s coding for the broadcast channel. We also derive an outer bound and further partition the channel parameters into several cases for which parts of the capacity region boundary are characterized. Full article