2,665 research outputs found
Wireless Information and Energy Transfer for Two-Hop Non-Regenerative MIMO-OFDM Relay Networks
This paper investigates the simultaneous wireless information and energy
transfer for the non-regenerative multipleinput multiple-output orthogonal
frequency-division multiplexing (MIMO-OFDM) relaying system. By considering two
practical receiver architectures, we present two protocols, time switchingbased
relaying (TSR) and power splitting-based relaying (PSR). To explore the system
performance limit, we formulate two optimization problems to maximize the
end-to-end achievable information rate with the full channel state information
(CSI) assumption. Since both problems are non-convex and have no known solution
method, we firstly derive some explicit results by theoretical analysis and
then design effective algorithms for them. Numerical results show that the
performances of both protocols are greatly affected by the relay position.
Specifically, PSR and TSR show very different behaviors to the variation of
relay position. The achievable information rate of PSR monotonically decreases
when the relay moves from the source towards the destination, but for TSR, the
performance is relatively worse when the relay is placed in the middle of the
source and the destination. This is the first time to observe such a
phenomenon. In addition, it is also shown that PSR always outperforms TSR in
such a MIMO-OFDM relaying system. Moreover, the effect of the number of
antennas and the number of subcarriers are also discussed.Comment: 16 pages, 12 figures, to appear in IEEE Selected Areas in
Communication
Sum-Rate Maximization in Two-Way AF MIMO Relaying: Polynomial Time Solutions to a Class of DC Programming Problems
Sum-rate maximization in two-way amplify-and-forward (AF) multiple-input
multiple-output (MIMO) relaying belongs to the class of difference-of-convex
functions (DC) programming problems. DC programming problems occur as well in
other signal processing applications and are typically solved using different
modifications of the branch-and-bound method. This method, however, does not
have any polynomial time complexity guarantees. In this paper, we show that a
class of DC programming problems, to which the sum-rate maximization in two-way
MIMO relaying belongs, can be solved very efficiently in polynomial time, and
develop two algorithms. The objective function of the problem is represented as
a product of quadratic ratios and parameterized so that its convex part (versus
the concave part) contains only one (or two) optimization variables. One of the
algorithms is called POlynomial-Time DC (POTDC) and is based on semi-definite
programming (SDP) relaxation, linearization, and an iterative search over a
single parameter. The other algorithm is called RAte-maximization via
Generalized EigenvectorS (RAGES) and is based on the generalized eigenvectors
method and an iterative search over two (or one, in its approximate version)
optimization variables. We also derive an upper-bound for the optimal values of
the corresponding optimization problem and show by simulations that this
upper-bound can be achieved by both algorithms. The proposed methods for
maximizing the sum-rate in the two-way AF MIMO relaying system are shown to be
superior to other state-of-the-art algorithms.Comment: 35 pages, 10 figures, Submitted to the IEEE Trans. Signal Processing
in Nov. 201
Efficient Transmission Techniques in Cooperative Networks: Forwarding Strategies and Distributed Coding Schemes
This dissertation focuses on transmission and estimation schemes in wireless relay network, which involves a set of source nodes, a set of destination nodes, and a set of nodes helps communication between source nodes and destination nodes, called relay nodes. It is noted that the overall performance of the wireless relay systems would be impacted by the relay methods adopted by relay nodes. In this dissertation, efficient forwarding strategies and channel coding involved relaying schemes in various relay network topology are studied.First we study a simple structure of relay systems, with one source, one destination and one relay node. By exploiting “analog codes” -- a special class of error correction codes that can directly encode and protect real-valued data, a soft forwarding strategy –“analog-encode-forward (AEF)”scheme is proposed. The relay node first soft-decodes the packet from the source, then re-encodes this soft decoder output (Log Likelihood Ratio) using an appropriate analog code, and forwards it to the destination. At the receiver, both a maximum-likelihood (ML) decoder and a maximum a posterior (MAP) decoder are specially designed for the AEF scheme.The work is then extended to parallel relay networks, which is consisted of one source, one destination and multiple relay nodes. The first question confronted with us is which kind of soft information to be relayed at the relay nodes. We analyze a set of prevailing soft information for relaying considered by researchers in this field. A truncated LLR is proved to be the best choice, we thus derive another soft forwarding strategy – “Z” forwarding strategy. The main parameter effecting the overall performance in this scheme is the threshold selected to cut the LLR information. We analyze the threshold selection at the relay nodes, and derive the exact ML estimation at the destination node. To circumvent the catastrophic error propagation in digital distributed coding scheme, a distributed soft coding scheme is proposed for the parallel relay networks. The key idea is the exploitation of a rate-1 soft convolutional encoder at each of the parallel relays, to collaboratively form a simple but powerful distributed analog coding scheme. Because of the linearity of the truncated LLR information, a nearly optimal ML decoder is derived for the distributed coding scheme. In the last part, a cooperative transmission scheme for a multi-source single-destination system through superposition modulation is investigated. The source nodes take turns to transmit, and each time, a source “overlays” its new data together with (some or all of) what it overhears from its partner(s), in a way similar to French-braiding the hair. We introduce two subclasses of braid coding, the nonregenerative and the regenerative cases, and, using the pairwise error probability (PEP) as a figure of merit, derive the optimal weight parameters for each one. By exploiting the structure relevance of braid codes with trellis codes, we propose a Viterbi maximum-likelihood (ML) decoding method of linear-complexity for the regenerative case. We also present a soft-iterative joint channel-network decoding. The overall decoding process is divided into the forward message passing and the backward message passing, which makes effective use of the available reliability information from all the received signals. We show that the proposed “braid coding” cooperative scheme benefits not only from the cooperative diversity but also from the bit error rate (BER) performance gain
User Cooperation in TDMA Wireless System
Abstract: Reliability of radio link is limited, owing to path loss, shadowing and multi-path fading. This necessitates the use of a certain type of diversity. In recent years, cooperative diversity has gained considerable attention. Here, wireless nodes cooperate in such a way that they share their antennas and other resources, to create a virtual array through distributed transmission and signal processing. This increases coverage and reduces transmitted power, thereby bringing down co-channel interference, which results in increased system capacity. This paper gives an overview of the state of art of various cooperation schemes and issues related to their implementation
Energy Detection of Unknown Signals over Cascaded Fading Channels
Energy detection is a favorable mechanism in several applications relating to
the identification of deterministic unknown signals such as in radar systems
and cognitive radio communications. The present work quantifies the detrimental
effects of cascaded multipath fading on energy detection and investigates the
corresponding performance capability. A novel analytic solution is firstly
derived for a generic integral that involves a product of the Meijer
function, the Marcum function and arbitrary power terms. This solution
is subsequently employed in the derivation of an exact closed-form expression
for the average probability of detection of unknown signals over *Rayleigh
channels. The offered results are also extended to the case of square-law
selection, which is a relatively simple and effective diversity method. It is
shown that the detection performance is considerably degraded by the number of
cascaded channels and that these effects can be effectively mitigated by a
non-substantial increase of diversity branches.Comment: 12 page
- …