3,656 research outputs found
Co-Efficient Vector Based Differential Distributed Quasi-Orthogonal Space Time Frequency Coding
© 2023 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).Distributed space time frequency coding (DSTFC) schemes address problems of performance degradation encountered by cooperative broadband networks operating in highly mobile environments. Channel state information (CSI) acquisition is, however, impractical in such highly mobile environments. Therefore, to address this problem, designers focus on incorporating differential designs with DSTFC for signal recovery in environments where neither the relay nodes nor destination have CSI. Traditionally, unitary matrix-based differential designs have been used to generate the differentially encoded symbols and codeword matrices. Unitary based designs are suitable for cooperative networks that utilize the amplify-and-forward protocol where the relay nodes are typically required to forego differential decoding. In considering other scenarios where relay nodes are compelled to differentially decode and re-transmit information signals, we propose a novel co-efficient vector differential distributed quasi-orthogonal space time frequency coding (DQSTFC) scheme for decode-and-forward cooperative networks. Our proposed space time frequency coding scheme relaxes the need for constant channel gain in the temporal and frequency dimensions over long symbol periods; thus, performance degradation is reduced in frequency-selective and time-selective fading environments. Simulation results illustrate the performance of our proposed co-efficient vector differential DQSTFC scheme under different channel conditions. Through pair-wise error probability analysis, we derive the full diversity design criteria for our code.Peer reviewe
On channel estimation and optimal training design for amplify and forward relay networks
10.1109/GLOCOM.2007.763GLOBECOM - IEEE Global Telecommunications Conference4015-401
Rank-Two Beamforming and Power Allocation in Multicasting Relay Networks
In this paper, we propose a novel single-group multicasting relay beamforming
scheme. We assume a source that transmits common messages via multiple
amplify-and-forward relays to multiple destinations. To increase the number of
degrees of freedom in the beamforming design, the relays process two received
signals jointly and transmit the Alamouti space-time block code over two
different beams. Furthermore, in contrast to the existing relay multicasting
scheme of the literature, we take into account the direct links from the source
to the destinations. We aim to maximize the lowest received quality-of-service
by choosing the proper relay weights and the ideal distribution of the power
resources in the network. To solve the corresponding optimization problem, we
propose an iterative algorithm which solves sequences of convex approximations
of the original non-convex optimization problem. Simulation results demonstrate
significant performance improvements of the proposed methods as compared with
the existing relay multicasting scheme of the literature and an algorithm based
on the popular semidefinite relaxation technique
Distributed space-time coding for two-way wireless relay networks
In this paper, we consider distributed space-time coding for two-way wireless relay networks, where communication between two terminals is assisted by relay nodes. Relaying protocols using two, three, and four time slots are proposed. The protocols using four time slots are the traditional amplify-and-forward (AF) and decode-and-forward (DF) protocols, which do not consider the property of the two-way traffic. A new class of relaying protocols, termed as partial decode-and-forward (PDF), is developed for the two time slots transmission, where each relay first removes part of the noise before sending the signal to the two terminals. Protocols using three time slots are proposed to compensate the fact that the two time slots protocols cannot make use of direct transmission between the two terminals. For all protocols, after processing their received signals, the relays encode the resulting signals using a distributed linear dispersion (LD) code. The proposed AF protocols are shown to achieve the diversity order of min{N,K}(1- (log log P/log P)), where N is the number of relays, P is the total power of the network, and K is the number of symbols transmitted during each time slot. When random unitary matrix is used for LD code, the proposed PDF protocols resemble random linear network coding, where the former operates on the unitary group and the latter works on the finite field. Moreover, PDF achieves the diversity order of min{N,K} but the conventional DF can only achieve the diversity order of 1. Finally, we find that two time slots protocols also have advantages over four-time-slot protocols in media access control (MAC) layer
Non-cooperative Feedback Rate Control Game for Channel State Information in Wireless Networks
It has been well recognized that channel state information (CSI) feedback is
of great importance for dowlink transmissions of closed-loop wireless networks.
However, the existing work typically researched the CSI feedback problem for
each individual mobile station (MS), and thus, cannot efficiently model the
interactions among self-interested mobile users in the network level. To this
end, in this paper, we propose an alternative approach to investigate the CSI
feedback rate control problem in the analytical setting of a game theoretic
framework, in which a multiple-antenna base station (BS) communicates with a
number of co-channel MSs through linear precoder. Specifically, we first
present a non-cooperative feedback-rate control game (NFC), in which each MS
selects the feedback rate to maximize its performance in a distributed way. To
improve efficiency from a social optimum point of view, we then introduce
pricing, called the non-cooperative feedback-rate control game with price
(NFCP). The game utility is defined as the performance gain by CSI feedback
minus the price as a linear function of the CSI feedback rate. The existence of
the Nash equilibrium of such games is investigated, and two types of feedback
protocols (FDMA and CSMA) are studied. Simulation results show that by
adjusting the pricing factor, the distributed NFCP game results in close
optimal performance compared with that of the centralized scheme.Comment: 26 pages, 10 figures; IEEE Journal on Selected Areas in
Communications, special issue on Game Theory in Wireless Communications, 201
- …