اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدA Simple Distributed Antenna Processing Scheme for Cooperative Diversity
148
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this letter the performance of multiple relay channels is analyzed for the situation in which multiple antennas are deployed only at the relays. The simple repetition-coded decodeand- forward protocol with two different antenna processing techniques at the relays is investigated. The antenna combining techniques are maximum ratio combining (MRC) for reception and transmit beamforming (TB) for transmission. It is shown that these distributed antenna combining techniques can exploit the full spatial diversity of the relay channels regardless of the number of relays and antennas at each relay, and offer significant power gain over distributed space-time coding techniques.
قيم البحث
اقرأ أيضاً
A simple method is proposed for use in a scenario involving a single-antenna source node communicating with a destination node that is equipped with two antennas via multiple single-antenna relay nodes, where each relay is subject to an individual po
wer constraint. Furthermore, ultra-reliable and low-latency communication are desired. The latter requirement translates to considering only schemes that make use of local channel state information. Whereas for a receiver equipped with a single antenna, distributed beamforming is a well known and adequate solution, no straightforward extension is known. In this paper, a scheme is proposed based on a space-time diversity transformation that is applied as a front-end operation at the destination node. This results in an effective unitary channel matrix replacing the scalar coefficient corresponding to each user. Each relay node then inverts its associated channel matrix, which is the generalization of undoing the channel phase in the classical case of distributed beamforming to a single-antenna receiver, and then repeats the message over the resulting gain-only channel. In comparison to a single-antenna destination node, the method doubles the diversity order without requiring any channel state information at the receiver while at the same time retaining the array gain offered by the relays.
The standard approach to the design of individual space-time codes is based on optimizing diversity and coding gains. This geometric approach leads to remarkable examples, such as perfect space-time block codes, for which the complexity of Maximum Li
kelihood (ML) decoding is considerable. Code diversity is an alternative and complementary approach where a small number of feedback bits are used to select from a family of space-time codes. Different codes lead to different induced channels at the receiver, where Channel State Information (CSI) is used to instruct the transmitter how to choose the code. This method of feedback provides gains associated with beamforming while minimizing the number of feedback bits. It complements the standard approach to code design by taking advantage of different (possibly equivalent) realizations of a particular code design. Feedback can be combined with sub-optimal low complexity decoding of the component codes to match ML decoding performance of any individual code in the family. It can also be combined with ML decoding of the component codes to improve performance beyond ML decoding performance of any individual code. One method of implementing code diversity is the use of feedback to adapt the phase of a transmitted signal as shown for 4 by 4 Quasi-Orthogonal Space-Time Block Code (QOSTBC) and multi-user detection using the Alamouti code. Code diversity implemented by selecting from equivalent variants is used to improve ML decoding performance of the Golden code. This paper introduces a family of full rate circulant codes which can be linearly decoded by fourier decomposition of circulant matrices within the code diversity framework. A 3 by 3 circulant code is shown to outperform the Alamouti code at the same transmission rate.
Cognitive radio that supports a secondary and opportunistic access to licensed spectrum shows great potential to dramatically improve spectrum utilization. Spectrum sensing performed by secondary users to detect unoccupied spectrum bands, is a key en
abling technique for cognitive radio. This paper proposes a truncated sequential spectrum sensing scheme, namely the sequential shifted chi-square test (SSCT). The SSCT has a simple test statistic and does not rely on any deterministic knowledge about primary signals. As figures of merit, the exact false-alarm probability is derived, and the miss-detection probability as well as the average sample number (ASN) are evaluated by using a numerical integration algorithm. Corroborating numerical examples show that, in comparison with fixed-sample size detection schemes such as energy detection, the SSCT delivers considerable reduction on the ASN while maintaining a comparable detection performance.
We study downlink beamforming in a single-cell network with a multi-antenna base station (BS) serving cache-enabled users. For a given common rate of the files in the system, we first formulate the minimum transmit power with beamforming at the BS as
a non-convex optimization problem. This corresponds to a multiple multicast problem, to which a stationary solution can be efficiently obtained through successive convex approximation (SCA). It is observed that the complexity of the problem grows exponentially with the number of subfiles delivered to each user in each time slot, which itself grows exponentially with the number of users in the system. Therefore, we introduce a low-complexity alternative through time-sharing that limits the number of subfiles that can be received by a user in each time slot. It is shown through numerical simulations that, the reduced-complexity beamforming scheme has minimal performance gap compared to transmitting all the subfiles jointly, and outperforms the state-of-the-art low-complexity scheme at all SNR and rate values with sufficient spatial degrees of freedom, and in the high SNR/high rate regime when the number of spatial degrees of freedom is limited.
Erasure-correcting codes, that support local repair of codeword symbols, have attracted substantial attention recently for their application in distributed storage systems. This paper investigates a generalization of the usual locally repairable code
s. In particular, this paper studies a class of codes with the following property: any small set of codeword symbols can be reconstructed (repaired) from a small number of other symbols. This is referred to as cooperative local repair. The main contribution of this paper is bounds on the trade-off of the minimum distance and the dimension of such codes, as well as explicit constructions of families of codes that enable cooperative local repair. Some other results regarding cooperative local repair are also presented, including an analysis for the well-known Hadamard/Simplex codes.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
