اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدRandomized Multiple Model Multiple Hypothesis Tracking
75
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
This paper considers the data association problem for multi-target tracking. Multiple hypothesis tracking is a popular algorithm for solving this problem but it is NP-hard and is is quite complicated for a large number of targets or for tracking maneuvering targets. To improve tracking performance and enhance robustness, we propose a randomized multiple model multiple hypothesis tracking method, which has three distinctive advantages. First, it yields a randomized data association solution which maximizes the expectation of the logarithm of the posterior probability and can be solved efficiently by linear programming. Next, the state estimation performance is improved by the random coefficient matrices Kalman filter, which mitigates the difficulty introduced by randomized data association, i.e., where the coefficient matrices of the dynamic system are random. Third, the probability that the target follows a specific dynamic model is derived by jointly optimizing the multiple possible models and data association hypotheses, and it does not require prior mode transition probabilities. Thus, it is more robust for tracking multiple maneuvering targets. Simulations demonstrate the efficiency and superior results of the proposed algorithm over interacting multiple model multiple hypothesis tracking.
قيم البحث
اقرأ أيضاً
This paper aims to provide a comprehensive solution for the design, analysis, and optimization of a multiple-antenna non-orthogonal multiple access (NOMA) system for multiuser downlink communication with both time duplex division (TDD) and frequency
duplex division (FDD) modes. First, we design a new framework for multiple-antenna NOMA, including user clustering, channel state information (CSI) acquisition, superposition coding, transmit beamforming, and successive interference cancellation (SIC). Then, we analyze the performance of the considered system, and derive exact closed-form expressions for average transmission rates in terms of transmit power, CSI accuracy, transmission mode, and channel conditions. For further enhancing the system performance, we optimize three key parameters, i.e., transmit power, feedback bits, and transmission mode. Especially, we propose a low-complexity joint optimization scheme, so as to fully exploit the potential of multiple-antenna techniques in NOMA. Moreover, through asymptotic analysis, we reveal the impact of system parameters on average transmission rates, and hence present some guidelines on the design of multiple-antenna NOMA. Finally, simulation results validate our theoretical analysis, and show that a substantial performance gain can be obtained over traditional orthogonal multiple access (OMA) technology under practical conditions.
In the scalar dirty multiple-access channel, in addition to Gaussian noise, two additive interference signals are present, each known non-causally to a single transmitter. It was shown by Philosof et al. that for strong interferences, an i.i.d. ensem
ble of codes does not achieve the capacity region. Rather, a structured-codes approach was presented, that was shown to be optimal in the limit of high signal-to-noise ratios, where the sum-capacity is dictated by the minimal (bottleneck) channel gain. In this paper, we consider the multiple-input multiple-output (MIMO) variant of this setting. In order to incorporate structured codes in this case, one can utilize matrix decompositions that transform the channel into effective parallel scalar dirty multiple-access channels. This approach however suffers from a bottleneck effect for each effective scalar channel and therefore the achievable rates strongly depend on the chosen decomposition. It is shown that a recently proposed decomposition, where the diagonals of the effective channel matrices are equal up to a scaling factor, is optimal at high signal-to-noise ratios, under an equal rank assumption. This approach is then extended to any number of transmitters. Finally, an application to physical-layer network coding for the MIMO two-way relay channel is presented.
We propose an enhanced version of trellis coded multiple access (TCMA), an overloaded multiple access scheme that outperforms the original TCMA in terms of achieved spectral efficiency. Enhanced TCMA (ETCMA) performs simultaneous transmission of mult
iple data streams intended for users experiencing similar signal-to-noise ratios and can be employed both in the uplink and in the downlink of wireless systems, thus overcoming one of the main limitations of TCMA. Thanks to a new receiver algorithm, ETCMA is capable of delivering a significantly higher spectral efficiency. We show that ETCMA approaches the capacity of the Additive White Gaussian Noise channel for a wide range of signal-to-noise ratios.
Non-orthogonal multiple access (NOMA) is one of the key techniques to address the high spectral efficiency and massive connectivity requirements for the fifth generation (5G) wireless system. To efficiently realize NOMA, we propose a joint design fra
mework combining the polar coding and the NOMA transmission, which deeply mines the generalized polarization effect among the users. In this polar coded NOMA (PC-NOMA) framework, the original NOMA channel is decomposed into multiple bit polarized channels by using a three-stage channel transform, that is, user$to$signal$to$bit partitions. Specifically, for the first-stage channel transform, we design two schemes, namely sequential user partition (SUP) and parallel user partition (PUP). For the SUP, a joint successive cancellation detecting and decoding scheme is developed, and a search algorithm is proposed to schedule the NOMA detecting order which improves the system performance by enhanced polarization among the user synthesized channels. The worst-goes-first idea is employed in the scheduling strategy, and its theoretic performance is analyzed by using the polarization principle. For the PUP, a corresponding parallel detecting scheme is exploited to reduce the latency. The block error ratio performances over the additive white Gaussian noise channel and the Rayleigh fading channel indicate that the proposed PC-NOMA obviously outperforms the state-of-the-art turbo coded NOMA scheme due to the advantages of joint design between the polar coding and NOMA.
In wireless data networks, communication is particularly susceptible to eavesdropping due to its broadcast nature. Security and privacy systems have become critical for wireless providers and enterprise networks. This paper considers the problem of s
ecret communication over the Gaussian broadcast channel, where a multi-antenna transmitter sends independent confidential messages to two users with perfect secrecy. That is, each user would like to obtain its own message reliably and confidentially. First, a computable Sato-type outer bound on the secrecy capacity region is provided for a multi-antenna broadcast channel with confidential messages. Next, a dirty-paper secure coding scheme and its simplified version are described. For each case, the corresponding achievable rate region is derived under the perfect secrecy requirement. Finally, two numerical examples demonstrate that the Sato-type outer bound is consistent with the boundary of the simplified dirty-paper coding secrecy rate region.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
