No abstract

The echoes of the radar systems can provide useful information about the target, including range, velocity, shape, and angular direction. Extensive studies have utilized the information of the target to improve system performance, whereas the problem of a favorable closed-form asymptotic approximation of the target's range information (RI) is seldom investigated. In this paper, we address the problem of obtaining a closed-form asymptotic approximation of the target's RI in all SNR regions for radar detection systems. The RI is formulated as the mutual information (MI) between the random range and the received signals with complex additive white Gaussian noise (CAWGN). The basis of our scheme is to employ the a posteriori probability density function (PDF) of the range to extract RI from the echoes. We show the a posteriori PDF is a function of the autocorrelation function (ACF) of signal and the cross-correlation function (CCF) of signal-noise. By dividing the integration interval of the a posteriori PDF into the signal-noise interval and noise interval, a closed-form asymptotic approximation of RI is derived based on the probability of range distinguishability and the normalized a posteriori entropies of low and high signal-to-noise ratio (SNR). The results also reveal an interesting relationship between the RI and the uncertainty of the target. As special cases, the closed-form approximations of RI in low and high SNR are obtained. Moreover, for the problem of slightly looser in medium SNR approximation, a better approximation is derived based on a linear model approach. Numerical results are presented to validate the proposed theory and verify the effectiveness of the proposed approximation.

No abstract

Due to its high spectrum efficiency, 64‐amplitude phase‐shift keying (64‐APSK) is one of the primary technologies used in deep space communications and digital video broadcasting through satellite‐second generation. However, 64‐APSK suffers from considerable computational complexity because of the de‐mapping method that it employs. In this study, a low‐complexity de‐mapping method for (4 + 12 + 20 + 28) 64‐APSK is proposed in which we take full advantage of the symmetric characteristics of each symbol mapping. Moreover, we map the detected symbol to the first quadrant and then divide the region in this first quadrant into several partitions to simplify the formula. Theoretical analysis shows that the proposed method requires no operation of exponents and logarithms and involves only multiplication, addition, subtraction, and judgment. Simulation results validate that the time consumption is dramatically decreased with limited degradation of bit error rate performance.

No abstract