15,703 research outputs found
Accessible Capacity of Secondary Users
A new problem formulation is presented for the Gaussian interference channels
(GIFC) with two pairs of users, which are distinguished as primary users and
secondary users, respectively. The primary users employ a pair of encoder and
decoder that were originally designed to satisfy a given error performance
requirement under the assumption that no interference exists from other users.
In the scenario when the secondary users attempt to access the same medium, we
are interested in the maximum transmission rate (defined as {\em accessible
capacity}) at which secondary users can communicate reliably without affecting
the error performance requirement by the primary users under the constraint
that the primary encoder (not the decoder) is kept unchanged. By modeling the
primary encoder as a generalized trellis code (GTC), we are then able to treat
the secondary link and the cross link from the secondary transmitter to the
primary receiver as finite state channels (FSCs). Based on this, upper and
lower bounds on the accessible capacity are derived. The impact of the error
performance requirement by the primary users on the accessible capacity is
analyzed by using the concept of interference margin. In the case of
non-trivial interference margin, the secondary message is split into common and
private parts and then encoded by superposition coding, which delivers a lower
bound on the accessible capacity. For some special cases, these bounds can be
computed numerically by using the BCJR algorithm. Numerical results are also
provided to gain insight into the impacts of the GTC and the error performance
requirement on the accessible capacity.Comment: 42 pages, 12 figures, 2 tables; Submitted to IEEE Transactions on
Information Theory on December, 2010, Revised on November, 201
Multiaccess Channels with State Known to One Encoder: Another Case of Degraded Message Sets
We consider a two-user state-dependent multiaccess channel in which only one
of the encoders is informed, non-causally, of the channel states. Two
independent messages are transmitted: a common message transmitted by both the
informed and uninformed encoders, and an individual message transmitted by only
the uninformed encoder. We derive inner and outer bounds on the capacity region
of this model in the discrete memoryless case as well as the Gaussian case.
Further, we show that the bounds for the Gaussian case are tight in some
special cases.Comment: 5 pages, Proc. of IEEE International Symposium on Information theory,
ISIT 2009, Seoul, Kore
- …