اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدShort Message Noisy Network Coding with a Decode-Forward Option
126
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Short message noisy network coding (SNNC) differs from long message noisy network coding (LNNC) in that one transmits many short messages in blocks rather than using one long message with repetitive encoding. Several properties of SNNC are developed. First, SNNC with backward decoding achieves the same rates as SNNC with offset encoding and sliding window decoding for memoryless networks where each node transmits a multicast message. The rates are the same as LNNC with joint decoding. Second, SNNC enables early decoding if the channel quality happens to be good. This leads to mixed strategies that unify the advantages of decode-forward and noisy network coding. Third, the best decoders sometimes treat other nodes signals as noise and an iterative method is given to find the set of nodes that a given node should treat as noise sources.
قيم البحث
اقرأ أيضاً
In this paper, we adopt the relay selection (RS) protocol proposed by Bletsas, Khisti, Reed and Lippman (2006) with Enhanced Dynamic Decode-and-Forward (EDDF) and network coding (NC) system in a two-hop two-way multi-relay network. All nodes are sing
le-input single-output (SISO) and half-duplex, i.e., they cannot transmit and receive data simultaneously. The outage probability is analyzed and we show comparisons of outage probability with various scenarios under Rayleigh fading channel. Our results show that the relay selection with EDDF and network coding (RS-EDDF&NC) scheme has the best performance in the sense of outage probability upon the considered decode-and-forward (DF) relaying if there exist sufficiently relays. In addition, the performance loss is large if we select a relay at random. This shows the importance of relay selection strategies.
In this paper, a superposition-coded concurrent decode-and-forward (DF) relaying protocol is presented. A specific scenario, where the inter-relay channel is sufficiently strong, is considered. Assuming perfect source-relay transmissions, the propose
d scheme further improves the diversity performance of previously proposed repetition-coded concurrent DF relaying, in which the advantage of the inter-relay interference is not fully extracted.
We study the outage probability of opportunistic relay selection in decode-and-forward relaying with secrecy constraints. We derive the closed-form expression for the outage probability. Based on the analytical result, the asymptotic performance is t
hen investigated. The accuracy of our performance analysis is verified by the simulation results.
This paper investigates coherent detection for physical-layer network coding (PNC) with short packet transmissions in a two-way relay channel (TWRC). PNC turns superimposed EM waves into network-coded messages to improve throughput in a relay system.
To achieve this, accurate channel information at the relay is a necessity. Much prior work applies preambles to estimate the channel. For long packets, the preamble overhead is low because of the large data payload. For short packets, that is not the case. To avoid excessive overhead, we consider a set-up in which short packets do not have preambles. A key challenge is how the relay can estimate the channel and detect the network-coded messages jointly based on the received signals from the two end users. We design a coherent detector that makes use of a belief propagation (BP) algorithm to do so. For concreteness, we focus on frequency-shift-keying (FSK) modulation. We show how the BP algorithm can be simplified and made practical with Gaussian-mixture passing. In addition, we demonstrate that prior knowledge on the channel distribution is not needed with our framework. Benchmarked against the detector with prior knowledge of the channel distribution, numerical results show that our detector can have nearly the same performance without such prior knowledge.
Two weighted selection combining (WSC) schemes are proposed for a differential decode-and-forward relaying system in Rayleigh fading channels. Compared to the conventional selection combining scheme, the decision variable of the relay link is multipl
ied by a scale factor to combat the error propagation phenomenon. Average bit-error rate (ABER) expressions of the two proposed WSC schemes are derived in closed-form and verified by simulation results. For the second WSC scheme, asymptotic ABER expression and diversity order are derived to gain more insight into this scheme. Moreover, it is demonstrated that both WSC schemes can overcome the extra noise amplification induced by the link adaptive relaying scheme. The first WSC scheme is slightly inferior to the second one, which has a higher complexity. Both proposed WSC schemes outperform the conventional selection combining scheme.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
