اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدOn the Performance Limits of Scalar Coding Over MISO Channels
216
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The performance limits of scalar coding for multiple-input single-output channels are revisited in this work. By employing randomized beamforming, Narula et al. demonstrated that the loss of scalar coding is universally bounded by ~ 2.51 dB (or 0.833 bits/symbol) for any number of antennas and channel gains. In this work, by using randomized beamforming in conjunction with space-time codes, it is shown that the bound can be tightened to ~ 1.1 dB (or 0.39 bits/symbol).
قيم البحث
اقرأ أيضاً
A major performance degrading factor in free space optical communication (FSO) systems is atmospheric turbulence. Spatial diversity techniques provide a promising approach to mitigate turbulence-induced fading. In this paper, we study the error rate
performance of FSO links with spatial diversity over atmospheric turbulence channels described by the Double Generalized Gamma distribution which is a new generic statistical model covering all turbulence conditions. We assume intensity modulation/direct detection with on-off keying and present the BER performance of single-input multiple-output (SIMO), multiple-input single-output (MISO) and multiple-input multiple-output (MIMO) FSO systems over this new channel model.
We construct a joint coordination-channel polar coding scheme for strong coordination of actions between two agents $mathsf X$ and $mathsf Y$, which communicate over a discrete memoryless channel (DMC) such that the joint distribution of actions foll
ows a prescribed probability distribution. We show that polar codes are able to achieve our previously established inner bound to the strong noisy coordination capacity region and thus provide a constructive alternative to a random coding proof. Our polar coding scheme also offers a constructive solution to a channel simulation problem where a DMC and shared randomness are together employed to simulate another DMC. In particular, our proposed solution is able to utilize the randomness of the DMC to reduce the amount of local randomness required to generate the sequence of actions at agent $mathsf Y$. By leveraging our earlier random coding results for this problem, we conclude that the proposed joint coordination-channel coding scheme strictly outperforms a separate scheme in terms of achievable communication rate for the same amount of injected randomness into both systems.
The error exponent of Markov channels with feedback is studied in the variable-length block-coding setting. Burnashevs classic result is extended and a single letter characterization for the reliability function of finite-state Markov channels is pre
sented, under the assumption that the channel state is causally observed both at the transmitter and at the receiver side. Tools from stochastic control theory are used in order to treat channels with intersymbol interference. In particular the convex analytical approach to Markov decision processes is adopted to handle problems with stopping time horizons arising from variable-length coding schemes.
We consider the problem of quantifying the Pareto optimal boundary in the achievable rate region over multiple-input single-output (MISO) interference channels, where the problem boils down to solving a sequence of convex feasibility problems after c
ertain transformations. The feasibility problem is solved by two new distributed optimal beamforming algorithms, where the first one is to parallelize the computation based on the method of alternating projections, and the second one is to localize the computation based on the method of cyclic projections. Convergence proofs are established for both algorithms.
Orthogonal time frequency space (OTFS) modulation is a recently developed multi-carrier multi-slot transmission scheme for wireless communications in high-mobility environments. In this paper, the error performance of coded OTFS modulation over high-
mobility channels is investigated. We start from the study of conditional pairwise-error probability (PEP) of the OTFS scheme, based on which its performance upper bound of the coded OTFS system is derived. Then, we show that the coding improvement for OTFS systems depends on the squared Euclidean distance among codeword pairs and the number of independent resolvable paths of the channel. More importantly, we show that there exists a fundamental trade-off between the coding gain and the diversity gain for OTFS systems, i.e., the diversity gain of OTFS systems improves with the number of resolvable paths, while the coding gain declines. Furthermore, based on our analysis, the impact of channel coding parameters on the performance of the coded OTFS systems is unveiled. The error performance of various coded OTFS systems over high-mobility channels is then evaluated. Simulation results demonstrate a significant performance improvement for OTFS modulation over the conventional orthogonal frequency division multiplexing (OFDM) modulation over high-mobility channels. Analytical results and the effectiveness of the proposed code design are also verified by simulations with the application of both classical and modern codes for OTFS systems.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
