Computation of the Capacity for Discrete Memoryless Channels and Sum Capacity of Multiple Access Channels with Causal Side Information at Receiver
نویسندگان
چکیده
Capacity analysis and computation for communication channels with side information at the receiver is an important area of research. Cover-Chiang have proved the increment of capacity with non-causal information at the receiver. We investigate this capacity increment for the channel with causal side information and proposed an efficient algorithm for computing the capacity of discrete memoryless channels and the sum capacity of multiple access channels with causal side information at the receiver. KeywordsCapacity computation, Causal side information, Discrete multiple access channel, Sum capacity
منابع مشابه
Bounds for Multiple-Access Relay Channels with Feedback via Two-way Relay Channel
In this study, we introduce a new two-way relay channel and obtain an inner bound and an outer bound for the discrete and memoryless multiple access relay channels with receiver-source feedback via two-way relay channel in which end nodes exchange signals by a relay node. And we extend these results to the Gaussian case. By numerical computing, we show that our inner bound is the same with o...
متن کاملPolarization of Multi-Relay Channels: A Suitable Method for DF and CF Relaying with Orthogonal Receiver
Polar codes, that have been recently introduced by Arikan, are one of the first codes that achieved the capacity for vast numerous channels and they also have low complexity in symmetric memoryless channels. Polar codes are constructed based on a phenomenon called channel polarization. This paper discusses relay channel polarization in order to achieve the capacity and show that if inputs of tw...
متن کاملTwo Classes of Broadcast Channels With Side-Information: Capacity Outer Bounds
In this paper, we derive outer bounds on the capacity region of two classes of the general two-user discrete memoryless broadcast channels with side-information at the transmitter. The first class comprises the classical broadcast channel where a sender transmits two independent messages to two receivers. A constraint that each message must be kept confidential from the unintended receiver cons...
متن کاملCapacity of Block-Memoryless Channels with Causal Channel Side Information
The capacity of a time-varying block-memoryless channel in which the transmitter and the receiver have access to (possibly different) noisy causal channel side information (CSI) is obtained. It is shown that the capacity formula obtained in this correspondence reduces to the capacity formula reported in [1] for the special case where the transmitter CSI is a deterministic function of the receiv...
متن کاملGaussian Z Channel with Intersymbol Interference
In this paper, we derive a capacity inner bound for a synchronous Gaussian Z channel with intersymbol interference (ISI) under input power constraints. This is done by converting the original channel model into an n-block memoryless circular Gaussian Z channel (n-CGZC) and successively decomposing the n-block memoryless channel into a series of independent parallel channels in the frequency dom...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011