اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدDiversity Combining via Universal Orthogonal Space-Time Transformations
63
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Receiver diversity combining methods play a key role in combating the detrimental effects of fadingin wireless communication and other applications. A novel diversity combining method is proposedwhere a universal, i.e., channel independent, orthogonal dimension-reducing space-time transformationis applied prior to quantization of the signals. The scheme may be considered as the counterpart ofAlamouti modulation, and more generally of orthogonal space-time block codes.
قيم البحث
اقرأ أيضاً
Recently proposed orthogonal time frequency space (OTFS) modulation has been considered as a promising candidate for accommodating various emerging communication and sensing applications in high-mobility environments. In this paper, we propose a nove
l cross domain iterative detection algorithm to enhance the error performance of OTFS modulation. Different from conventional OTFS detection methods, the proposed algorithm applies basic estimation/detection approaches to both the time domain and delay-Doppler (DD) domain and iteratively updates the extrinsic information from two domains with the unitary transformation. In doing so, the proposed algorithm exploits the time domain channel sparsity and the DD domain symbol constellation constraints. We evaluate the estimation/detection error variance in each domain for each iteration and derive the state evolution to investigate the detection error performance. We show that the performance gain due to iterations comes from the non-Gaussian constellation constraint in the DD domain. More importantly, we prove the proposed algorithm can indeed converge and, in the convergence, the proposed algorithm can achieve almost the same error performance as the maximum-likelihood sequence detection even in the presence of fractional Doppler shifts. Furthermore, the computational complexity associated with the domain transformation is low, thanks to the structure of the discrete Fourier transform (DFT) kernel. Simulation results are consistent with our analysis and demonstrate a significant performance improvement compared to conventional OTFS detection methods.
In this paper, we investigate the impacts of transmitter and receiver windows on the performance of orthogonal time-frequency space (OTFS) modulation and propose window designs to improve the OTFS channel estimation and data detection performance. In
particular, assuming ideal pulse shaping filters at the transceiver, we derive the impacts of windowing on the effective channel and its estimation performance in the delay-Doppler (DD) domain, the total average transmit power and the effective noise covariance matrix. When the channel state information (CSI) is available at the transceiver, we analyze the minimum squared error (MSE) of data detection and propose an optimal transmitter window to minimize the detection MSE. The proposed optimal transmitter window is interpreted as a mercury/water-filling power allocation scheme, where the mercury is firstly filled before pouring water to pre-equalize the TF domain channels. When the CSI is not available at the transmitter but can be estimated at the receiver, we propose to apply a Dolph-Chebyshev (DC) window at either the transmitter or the receiver, which can effectively enhance the sparsity of the effective channel in the DD domain. Thanks to the enhanced DD domain channel sparsity, the channel spread due to the fractional Doppler is significantly reduced, which leads to a lower error floor in both channel estimation and data detection compared with that of rectangular window. Simulation results verify the accuracy of the obtained analytical results and confirm the superiority of the proposed window designs in improving the channel estimation and data detection performance over the conventional rectangular window design.
In multiple-input multiple-output (MIMO) fading channels, the design criterion for full-diversity space-time block codes (STBCs) is primarily determined by the decoding method at the receiver. Although constructions of STBCs have predominantly matche
d the maximum-likelihood (ML) decoder, design criteria and constructions of full-diversity STBCs have also been reported for low-complexity linear receivers. A new receiver architecture called Integer-Forcing (IF) linear receiver has been proposed to MIMO channels by Zhan et al. which showed promising results for the high-rate V-BLAST encoding scheme. In this paper, we address the design of full-diversity STBCs for IF linear receivers. In particular, we are interested in characterizing the structure of STBCs that provide full-diversity with the IF receiver. Along that direction, we derive an upper bound on the probability of decoding error, and show that STBCs that satisfy the restricted non-vanishing singular value (RNVS) property provide full-diversity for the IF receiver. Furthermore, we prove that all known STBCs with the non-vanishing determinant property provide full-diversity with IF receivers, as they guarantee the RNVS property. By using the formulation of RNVS property, we also prove the existence of a full-diversity STBC outside the class of perfect STBCs, thereby adding significant insights compared to the existing works on STBCs with IF decoding. Finally, we present extensive simulation results to demonstrate that linear designs with RNVS property provide full-diversity for IF receiver.
Suppose there is a large file which should be transmitted (or stored) and there are several (say, m) admissible data-compressors. It seems natural to try all the compressors and then choose the best, i.e. the one that gives the shortest compressed fi
le. Then transfer (or store) the index number of the best compressor (it requires log m bits) and the compressed file.The only problem is the time, which essentially increases due to the need to compress the file m times (in order to find the best compressor). We propose a method that encodes the file with the optimal compressor, but uses a relatively small additional time: the ratio of this extra time and the total time of calculation can be limited by an arbitrary positive constant. Generally speaking, in many situations it may be necessary find the best data compressor out of a given set, which is often done by comparing them empirically. One of the goals of this work is to turn such a selection process into a part of the data compression method, automating and optimizing it.
Multicasting is the general method of conveying the same information to multiple users over a broadcast channel. In this work, the Gaussian MIMO broadcast channel is considered, with multiple users and any number of antennas at each node. A closed lo
op scenario is assumed, for which a practical capacity-achieving multicast scheme is constructed. In the proposed scheme, linear modulation is carried over time and space together, which allows to transform the problem into that of transmission over parallel scalar sub-channels, the gains of which are equal, except for a fraction of sub-channels that vanishes with the number of time slots used. Over these sub-channels, off-the-shelf fixed-rate AWGN codes can be used to approach capacity.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
