We derive inner and outer bounds on the capacity region for a class of three-user partially connected interference channels. We focus on the impact of topology, interference alignment, and interplay between interference and noise. The representative channels we consider are the ones that have clear interference alignment gain. For these channels, Z-channel type outer bounds are tight to within a constant gap from capacity. We present near-optimal achievable schemes based on rate-splitting and lattice alignment.
The idea of sending multiple copies of the same sub-message at different signal levels, so-called Zigzag decoding, appeared in @cite_13 where receivers collect side information and use them for interference cancellation.
@cite_13
2613309614 2139947445 2189096384 2112754967
The symmetric capacity for index coding problems with @math messages and @math receivers, each demanding a unique message (Single Unicast Index Coding Problem) and having symmetric (with respect to receiver index), neighboring and consecutive side information (SUICP-SNC) have been reported by Maleki, Cadambe and Jafar. For these index coding problems, assuming that the transmissions are error prone, we present optimal length error-correcting index codes for all one-sided SUICP-SNC problems and for some cases of two-sided SUICP-SNC problems. We also discuss construction for these optimal Error Correcting Index Codes. In this paper, we study a three-node full-duplex network, where a base station is engaged in simultaneous up- and downlink communication in the same frequency band with two half-duplex mobile nodes. To reduce the impact of inter-node interference between the two mobile nodes on the system capacity, we study how an orthogonal side-channel between the two mobile nodes can be leveraged to achieve full-duplex-like multiplexing gains. We propose and characterize the achievable rates of four distributed full-duplex schemes, labeled bin-and-cancel, compress-and-cancel, estimate-and-cancel and decode-and-cancel. Of the four, bin-and-cancel is shown to achieve within 1 bit s Hz of the capacity region for all values of channel parameters. In contrast, the other three schemes achieve the near-optimal performance only in certain regimes of channel values. Asymptotic multiplexing gains of all proposed schemes are derived to show that the side-channel is extremely effective in regimes where inter-node interference has the highest impact. In this paper, we investigate secure transmission in untrusted amplify-and-forward half-duplex relaying networks with the help of cooperative jamming at the destination (CJD). Under the assumption of full channel state information (CSI), conventional CJD using self-interference cancelation at the destination is efficient when the untrusted relay has no capability to suppress the jamming signal. However, if the source and destination are equipped with a single antenna and the only untrusted relay is equipped with N multiple antennas, it can remove the jamming signal from the received signal by linear filters and the full multiplexing gain of relaying cannot be achievable with the conventional CJD due to the saturation of the secrecy rate at the high transmit power regime. We propose in this paper new CJD scheme where neither destination nor relay can acquire CSI of relay-destination link. Our proposed scheme utilizes zero-forcing cancelation based on known jamming signals instead of self-interference subtraction, while the untrusted relay cannot suppress the jamming signals due to the lack of CSI. We show that the secrecy rate of the proposed scheme can enjoy a half of multiplexing gain in half-duplex relaying while that of conventional CJD is saturated at high transmit power for N ≥2. The impact of channel estimation error at the destination is also investigated to show the robustness of the proposed scheme against strong estimation errors. We study an interference network where equally-numbered transmitters and receivers lie on two parallel lines, each transmitter opposite its intended receiver. We consider two short-range interference models: the "asymmetric network," where the signal sent by each transmitter is interfered only by the signal sent by its left neighbor (if present), and a "symmetric network," where it is interfered by both its left and its right neighbors. Each transmitter is cognizant of its own message, the messages of the @math transmitters to its left, and the messages of the @math transmitters to its right. Each receiver decodes its message based on the signals received at its own antenna, at the @math receive antennas to its left, and the @math receive antennas to its right. For such networks we provide upper and lower bounds on the multiplexing gain, i.e., on the high-SNR asymptotic logarithmic growth of the sum-rate capacity. In some cases our bounds meet, e.g., for the asymmetric network. Our results exhibit an equivalence between the transmitter side-information parameters @math and the receiver side-information parameters @math in the sense that increasing decreasing @math or @math by a positive integer @math has the same effect on the multiplexing gain as increasing decreasing @math or @math by @math . Moreover---even in asymmetric networks---there is an equivalence between the left side-information parameters @math and the right side-information parameters @math .