120,128 research outputs found
The Benefit of Encoder Cooperation in the Presence of State Information
In many communication networks, the availability of channel state information
at various nodes provides an opportunity for network nodes to work together, or
"cooperate." This work studies the benefit of cooperation in the multiple
access channel with a cooperation facilitator, distributed state information at
the encoders, and full state information available at the decoder. Under
various causality constraints, sufficient conditions are obtained such that
encoder cooperation through the facilitator results in a gain in sum-capacity
that has infinite slope in the information rate shared with the encoders. This
result extends the prior work of the authors on cooperation in networks where
none of the nodes have access to state information.Comment: Extended version of paper presented at ISIT 2017 in Aachen. 20 pages,
1 figur
Multiple Access Channels with Generalized Feedback and Confidential Messages
This paper considers the problem of secret communication over a multiple
access channel with generalized feedback. Two trusted users send independent
confidential messages to an intended receiver, in the presence of a passive
eavesdropper. In this setting, an active cooperation between two trusted users
is enabled through using channel feedback in order to improve the communication
efficiency. Based on rate-splitting and decode-and-forward strategies,
achievable secrecy rate regions are derived for both discrete memoryless and
Gaussian channels. Results show that channel feedback improves the achievable
secrecy rates.Comment: To appear in the Proceedings of the 2007 IEEE Information Theory
Workshop on Frontiers in Coding Theory, Lake Tahoe, CA, September 2-6, 200
Opportunistic Relaying in Wireless Networks
Relay networks having source-to-destination pairs and half-duplex
relays, all operating in the same frequency band in the presence of block
fading, are analyzed. This setup has attracted significant attention and
several relaying protocols have been reported in the literature. However, most
of the proposed solutions require either centrally coordinated scheduling or
detailed channel state information (CSI) at the transmitter side. Here, an
opportunistic relaying scheme is proposed, which alleviates these limitations.
The scheme entails a two-hop communication protocol, in which sources
communicate with destinations only through half-duplex relays. The key idea is
to schedule at each hop only a subset of nodes that can benefit from
\emph{multiuser diversity}. To select the source and destination nodes for each
hop, it requires only CSI at receivers (relays for the first hop, and
destination nodes for the second hop) and an integer-value CSI feedback to the
transmitters. For the case when is large and is fixed, it is shown that
the proposed scheme achieves a system throughput of bits/s/Hz. In
contrast, the information-theoretic upper bound of bits/s/Hz
is achievable only with more demanding CSI assumptions and cooperation between
the relays. Furthermore, it is shown that, under the condition that the product
of block duration and system bandwidth scales faster than , the
achievable throughput of the proposed scheme scales as .
Notably, this is proven to be the optimal throughput scaling even if
centralized scheduling is allowed, thus proving the optimality of the proposed
scheme in the scaling law sense.Comment: 17 pages, 8 figures, To appear in IEEE Transactions on Information
Theor
Cooperative Wideband Spectrum Sensing Based on Joint Sparsity
COOPERATIVE WIDEBAND SPECTRUM SENSING BASED ON JOINT SPARSITY
By Ghazaleh Jowkar, Master of Science
A thesis submitted in partial fulfillment of the requirements for the degree of Master of Science at Virginia Commonwealth University
Virginia Commonwealth University 2017
Major Director: Dr. Ruixin Niu, Associate Professor of Department of Electrical and Computer Engineering
In this thesis, the problem of wideband spectrum sensing in cognitive radio (CR) networks using sub-Nyquist sampling and sparse signal processing techniques is investigated. To mitigate multi-path fading, it is assumed that a group of spatially dispersed SUs collaborate for wideband spectrum sensing, to determine whether or not a channel is occupied by a primary user (PU). Due to the underutilization of the spectrum by the PUs, the spectrum matrix has only a small number of non-zero rows. In existing state-of-the-art approaches, the spectrum sensing problem was solved using the low-rank matrix completion technique involving matrix nuclear-norm minimization. Motivated by the fact that the spectrum matrix is not only low-rank, but also sparse, a spectrum sensing approach is proposed based on minimizing a mixed-norm of the spectrum matrix instead of low-rank matrix completion to promote the joint sparsity among the column vectors of the spectrum matrix. Simulation results are obtained, which demonstrate that the proposed mixed-norm minimization approach outperforms the low-rank matrix completion based approach, in terms of the PU detection performance. Further we used mixed-norm minimization model in multi time frame detection. Simulation results shows that increasing the number of time frames will increase the detection performance, however, by increasing the number of time frames after a number of times the performance decrease dramatically
Cooperative Strategies for Simultaneous and Broadcast Relay Channels
Consider the \emph{simultaneous relay channel} (SRC) which consists of a set
of relay channels where the source wishes to transmit common and private
information to each of the destinations. This problem is recognized as being
equivalent to that of sending common and private information to several
destinations in presence of helper relays where each channel outcome becomes a
branch of the \emph{broadcast relay channel} (BRC). Cooperative schemes and
capacity region for a set with two memoryless relay channels are investigated.
The proposed coding schemes, based on \emph{Decode-and-Forward} (DF) and
\emph{Compress-and-Forward} (CF) must be capable of transmitting information
simultaneously to all destinations in such set.
Depending on the quality of source-to-relay and relay-to-destination
channels, inner bounds on the capacity of the general BRC are derived. Three
cases of particular interest are considered: cooperation is based on DF
strategy for both users --referred to as DF-DF region--, cooperation is based
on CF strategy for both users --referred to as CF-CF region--, and cooperation
is based on DF strategy for one destination and CF for the other --referred to
as DF-CF region--. These results can be seen as a generalization and hence
unification of previous works. An outer-bound on the capacity of the general
BRC is also derived. Capacity results are obtained for the specific cases of
semi-degraded and degraded Gaussian simultaneous relay channels. Rates are
evaluated for Gaussian models where the source must guarantee a minimum amount
of information to both users while additional information is sent to each of
them.Comment: 32 pages, 7 figures, To appear in IEEE Trans. on Information Theor
Adaptive Bit Partitioning for Multicell Intercell Interference Nulling with Delayed Limited Feedback
Base station cooperation can exploit knowledge of the users' channel state
information (CSI) at the transmitters to manage co-channel interference. Users
have to feedback CSI of the desired and interfering channels using
finite-bandwidth backhaul links. Existing codebook designs for single-cell
limited feedback can be used for multicell cooperation by partitioning the
available feedback resources between the multiple channels. In this paper, a
new feedback-bit allocation strategy is proposed, as a function of the delays
in the communication links and received signal strengths in the downlink.
Channel temporal correlation is modeled as a function of delay using the
Gauss-Markov model. Closed-form expressions for bit partitions are derived to
allocate more bits to quantize the stronger channels with smaller delays and
fewer bits to weaker channels with larger delays, assuming random vector
quantization. Cellular network simulations are used to show that the proposed
algorithm yields higher sum-rates than an equal-bit allocation technique.Comment: Submitted to IEEE Transactions on Signal Processing, July 201
- …