اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدCo-ordinate Interleaved Distributed Space-Time Coding for Two-Antenna-Relays Networks
245
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Distributed space time coding for wireless relay networks when the source, the destination and the relays have multiple antennas have been studied by Jing and Hassibi. In this set-up, the transmit and the receive signals at different antennas of the same relay are processed and designed independently, even though the antennas are colocated. In this paper, a wireless relay network with single antenna at the source and the destination and two antennas at each of the R relays is considered. A new class of distributed space time block codes called Co-ordinate Interleaved Distributed Space-Time Codes (CIDSTC) are introduced where, in the first phase, the source transmits a T-length complex vector to all the relays and in the second phase, at each relay, the in-phase and quadrature component vectors of the received complex vectors at the two antennas are interleaved and processed before forwarding them to the destination. Compared to the scheme proposed by Jing-Hassibi, for $T geq 4R$, while providing the same asymptotic diversity order of 2R, CIDSTC scheme is shown to provide asymptotic coding gain with the cost of negligible increase in the processing complexity at the relays. However, for moderate and large values of P, CIDSTC scheme is shown to provide more diversity than that of the scheme proposed by Jing-Hassibi. CIDSTCs are shown to be fully diverse provided the information symbols take value from an appropriate multi-dimensional signal set.
قيم البحث
اقرأ أيضاً
In a distributed space-time coding scheme, based on the relay channel model, the relay nodes co-operate to linearly process the transmitted signal from the source and forward them to the destination such that the signal at the destination appears as
a space time block code. Recently, a code design criteria for achieving full diversity in a partially-coherent environment have been proposed along with codes based on differential encoding and decoding techniques. For such a set up, in this paper, a non-differential encoding technique and construction of distributed space time block codes from unitary matrix groups at the source and a set of diagonal unitary matrices for the relays are proposed. It is shown that, the performance of our scheme is independent of the choice of unitary matrices at the relays. When the group is cyclic, a necessary and sufficient condition on the generator of the cyclic group to achieve full diversity and to minimize the pairwise error probability is proved. Various choices on the generator of cyclic group to reduce the ML decoding complexity at the destination is presented. It is also shown that, at the source, if non-cyclic abelian unitary matrix groups are used, then full-diversity can not be obtained. The presented scheme is also robust to failure of any subset of relay nodes.
In a distributed storage system, code symbols are dispersed across space in nodes or storage units as opposed to time. In settings such as that of a large data center, an important consideration is the efficient repair of a failed node. Efficient rep
air calls for erasure codes that in the face of node failure, are efficient in terms of minimizing the amount of repair data transferred over the network, the amount of data accessed at a helper node as well as the number of helper nodes contacted. Coding theory has evolved to handle these challenges by introducing two new classes of erasure codes, namely regenerating codes and locally recoverable codes as well as by coming up with novel ways to repair the ubiquitous Reed-Solomon code. This survey provides an overview of the efforts in this direction that have taken place over the past decade.
In this paper, we make an investigation of receive antenna selection (RAS) strategies in the secure pre-coding aided spatial modulation (PSM) system with the aid of artificial noise. Due to a lack of the closed-form expression for secrecy rate (SR) i
n secure PSM systems, it is hard to optimize the RAS. To address this issue, the cut-off rate is used as an approximation of the SR. Further, two low-complexity RAS schemes for maximizing SR, called Max-SR-L and Max-SR-H, are derived in the low and high signal-to-noise ratio (SNR) regions, respectively. Due to the fact that the former works well in the low SNR region but becomes worse in the medium and high SNR regions while the latter also has the similar problem, a novel RAS strategy Max-SR-A is proposed to cover all SNR regions. Simulation results show that the proposed Max-SR-H and Max-SR-L schemes approach the optimal SR performances of the exhaustive search (ES) in the high and low SNR regions, respectively. In particular, the SR performance of the proposed Max-SR-A is close to that of the optimal ES and better than that of the random method in almost all SNR regions.
In order to meet the demands of `Internet above the clouds, we propose a multiple-antenna aided adaptive coding and modulation (ACM) for aeronautical communications. The proposed ACM scheme switches its coding and modulation mode according to the dis
tance between the communicating aircraft, which is readily available with the aid of the airborne radar or the global positioning system. We derive an asymptotic closed-form expression of the signal-to-interference-plus-noise ratio (SINR) as the number of transmitting antennas tends to infinity, in the presence of realistic co-channel interference and channel estimation errors. The achievable transmission rates and the corresponding mode-switching distance-thresholds are readily obtained based on this closed-form SINR formula. Monte-Carlo simulation results are used to validate our theoretical analysis. For the specific example of 32 transmit antennas and 4 receive antennas communicating at a 5 GHz carrier frequency and using 6 MHz bandwidth, which are reused by multiple other pairs of communicating aircraft, the proposed distance-based ACM is capable of providing as high as 65.928 Mbps data rate when the communication distance is less than 25,km.
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 techniqu
es 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.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
