اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدAsynchronous Communication over a Fading Channel and Additive Noise
101
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In cite{Chandar2008}, Chandar et al studied a problem of sequential frame synchronization for a frame transmitted randomly and uniformly among $A$ slots. For a discrete memory-less channel (DMC), they showed that the frame length $N$ must scale as $e^{alpha(Q)N}>A$ for the frame detection error to go to zero asymptotically with $A$. $alpha(Q)$ is the synchronization threshold and $Q$ is channel transition probability. We study the sequential frame synchronisation problem for a fading channel and additive noise and seek to characterise the effect of fading. For a discrete ON-OFF fading channel (with ON probability $p$) and additive noise (with channel transition probabilities $Q_n$), we characterise the synchronisation threshold of the composite channel $alpha(Q)$ and show that $alpha(Q)leq p,alpha(Q_n)$. We then characterize the synchronization threshold for Rayleigh fading and AWGN channel as a function of channel parameters. The asynchronous framework permits a trade-off between sync frame length, $N$, and channel, $Q$, to support asynchronism. This allows us to characterize the synchronization threshold with sync frame energy instead of sync frame length.
قيم البحث
اقرأ أيضاً
In this paper, we propose two schemes for asynchronous multi-relay two-way relay (MR-TWR) systems in which neither the users nor the relays know the channel state information (CSI). In an MR-TWR system, two users exchange their messages with the help
of $N_R$ relays. Most of the existing works on MR-TWR systems based on differential modulation assume perfect symbol-level synchronization between all communicating nodes. However, this assumption is not valid in many practical systems, which makes the design of differentially modulated schemes more challenging. Therefore, we design differential modulation schemes that can tolerate timing misalignment under frequency-selective fading. We investigate the performance of the proposed schemes in terms of either probability of bit error or pairwise error probability. Through numerical examples, we show that the proposed schemes outperform existing competing solutions in the literature, especially for high signal-to-noise ratio (SNR) values.
A hybrid communication network with a common analog signal and an independent digital data stream as input to each node in a multiple access network is considered. The receiver/base-station has to estimate the analog signal with a given fidelity, and
decode the digital streams with a low error probability. Treating the analog signal as a common state process, we set up a joint state estimation and communication problem in a Gaussian multiple access channel (MAC) with additive state. The transmitters have non-causal knowledge of the state process, and need to communicate independent data streams in addition to facilitating state estimation at the receiver. We first provide a complete characterization of the optimal trade-off between mean squared error distortion performance in estimating the state and the data rates for the message streams from two transmitting nodes. This is then generalized to an N-sender MAC. To this end, we show a natural connection between the state-dependent MAC model and a hybrid multi-sensor network in which a common source phenomenon is observed at N transmitting nodes. Each node encodes the source observations as well as an independent message stream over a Gaussian MAC without any state process. The receiver is interested estimating the source and all the messages. Again the distortion-rate performance is characterized.
The fading wire-tap channel is investigated, where the source-to-destination channel and the source-to-wire-tapper channel are corrupted by multiplicative fading gain coefficients in addition to additive Gaussian noise terms. The channel state inform
ation is assumed to be known at both the transmitter and the receiver. The parallel wire-tap channel with independent subchannels is first studied, which serves as an information-theoretic model for the fading wire-tap channel. The secrecy capacity of the parallel wire-tap channel is established. This result is then specialized to give the secrecy capacity of the fading wire-tap channel, which is achieved with the source node dynamically changing the power allocation according to the channel state realization. An optimal source power allocation is obtained to achieve the secrecy capacity.
We study a problem of sequential frame synchronization for a frame transmitted uniformly in $A$ slots. For a discrete memoryless channel (DMC), Venkat Chandar et al showed that the frame length $N$ must scale with $A$ as $e^{N alpha(Q)} > A$ for the
frame synchronization error to go to zero (asymptotically with $A$). Here, $Q$ denotes the transition probabilities of the DMC and $alpha(Q)$, defined as the synchronization threshold, characterizes the scaling needed of $N$ for asymptotic error free frame synchronization. We show that the asynchronous communication framework permits a natural tradeoff between the sync frame length $N$ and the channel (usually parameterised by the input). For an AWGN channel, we study this tradeoff between the sync frame length $N$ and the input symbol power $P$ and characterise the scaling needed of the sync frame energy $E = N P$ for optimal frame synchronisation.
The reconfigurable intelligent surface (RIS) is considered as a promising new technology for reconfiguring wireless communication environments. To acquire the channel information accurately and efficiently, we only turn on a fraction of all the RIS e
lements, formulate a sub-sampled RIS channel, and design a deep learning based scheme to extrapolate the full channel information from the partial one. Specifically, inspired by the ordinary differential equation (ODE), we set up connections between different data layers in a convolutional neural network (CNN) and improve its structure. Simulation results are provided to demonstrate that our proposed ODE-based CNN structure can achieve faster convergence speed and better solution than the cascaded CNN.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
