اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدTiling of Constellations
59
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Motivated by applications in reliable and secure communication, we address the problem of tiling (or partitioning) a finite constellation in $mathbb{Z}_{2^L}^n$ by subsets, in the case that the constellation does not possess an abelian group structure. The property that we do require is that the constellation is generated by a linear code through an injective mapping. The intrinsic relation between the code and the constellation provides a sufficient condition for a tiling to exist. We also present a necessary condition. Inspired by a result in group theory, we discuss results on tiling for the particular case when the finer constellation is an abelian group as well.
قيم البحث
اقرأ أيضاً
We determine the loss in capacity incurred by using signal constellations with a bounded support over general complex-valued additive-noise channels for suitably high signal-to-noise ratio. Our expression for the capacity loss recovers the power loss of 1.53dB for square signal constellations.
Despite of the known gap from the Shannons capacity, several standards are still employing QAM or star shape constellations, mainly due to the existing low complexity detectors. In this paper, we investigate the low complexity detection for a family
of QAM isomorphic constellations. These constellations are known to perform very close to the peak-power limited capacity, outperforming the DVB-S2X standard constellations. The proposed strategy is to first remap the received signals to the QAM constellation using the existing isomorphism and then break the log likelihood ratio computations to two one dimensional PAM constellations. Gains larger than 0.6 dB with respect to QAM can be obtained over the peak power limited channels without any increase in detection complexity. Our scheme also provides a systematic way to design constellations with low complexity one dimensional detectors. Several open problems are discussed at the end of the paper.
A posteriori probability (APP) and max-log APP detection is widely used in soft-input soft-output detection. In contrast to bijective modulation schemes, there are important differences when applying these algorithms to non-bijective symbol constella
tions. In this letter the main differences are highlighted.
In this paper, we propose a geometric shaping (GS) strategy to design 8, 16, 32 and 64-ary modulation formats for the optical fibre channel impaired by both additive white Gaussian (AWGN) and phase noise. The constellations were optimised to maximise
generalised mutual information (GMI) using a mismatched channel model. The presented formats demonstrate an enhanced signal-to-noise ratio (SNR) tolerance in high phase noise regimes when compared with their quadrature amplitude modulation (QAM) or AWGN-optimised counterparts. By putting the optimisation results in the context of the 400ZR implementation agreement, we show that GS alone can either relax the laser linewidth (LW) or carrier phase estimation (CPE) requirements of 400 Gbit/s transmission links and beyond. Following the GMI validation, the performance of the presented formats was examined in terms of post forward error correction (FEC) bit-error-rate (BER) for a soft decision (SD) extended Hamming code (128, 120), implemented as per the 400ZR implementation agreement. We demonstrate gains of up to 1.2 dB when compared to the 64-ary AWGN shaped formats.
Dense constellations of Low Earth Orbit (LEO) small satellites are envisioned to make extensive use of the inter-satellite link (ISL). Within the same orbital plane, the inter-satellite distances are preserved and the links are rather stable. In cont
rast, the relative motion between planes makes the inter-plane ISL challenging. In a dense set-up, each spacecraft has several satellites in its coverage volume, but the time duration of each of these links is small and the maximum number of active connections is limited by the hardware. We analyze the matching problem of connecting satellites using the inter-plane ISL for unicast transmissions. We present and evaluate the performance of two solutions to the matching problem with any number of orbital planes and up to two transceivers: a heuristic solution with the aim of minimizing the total cost; and a Markovian solution to maintain the on-going connections as long as possible. The Markovian algorithm reduces the time needed to solve the matching up to 1000x and 10x with respect to the optimal solution and to the heuristic solution, respectively, without compromising the total cost. Our model includes power adaptation and optimizes the network energy consumption as the exemplary cost in the evaluations, but any other QoS-oriented KPI can be used instead.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
