An Information Theory Approach to the Data Compression and Imaging System for Synthetic Aperture Radar （SAR）

Synthetic aperture radar (SAR) is portrayed as a multiple access channel. An information theory approach is applied to the SAR imaging system, and the information content about a target that can be extracted from its radar image is evaluated by the average mutual information measure. A conditional (transition) probability density function (PDF) of the SAR imaging system is derived by analyzing the system and a closed form of the information content is found. It is shown that the information content obtained by the SAR imaging system from an independent sample of echoes will decrease and the total information content obtained by the SAR imaging system will increase with an increase in the number of looks. Because the total average mutual information is also used to define a measure of radiometric resolution for radar images, it is shown that the radiometric resolution of a radar image of terrain will be improved by spatial averaging. In addition, the imaging process and the data compression process for SAR are each treated as an independent generalized communication channel. The effects of data compression upon radiometric resolution for SAR are studied and some conclusions are obtained.

Nonbinary ldpc-coded probabilistic shaping scheme for MIMO systems based on signal space diversity

This paper first describes a binary Low-Density Parity-Check(LDPC)-coded Probabilistic Shaping(PS)scheme for Multiple-Input Multiple-Output(MIMO)systems based on Signal Space Diversity(SSD).Second,a Nonbinary(NB)LDPC-coded PS scheme for MIMO systems based on SSD is proposed.The first scheme can be used to obtain a shaping gain,whereas the second can also realize a coding gain.The theoretical average mutual information of the optimized rotated quadrature amplitude modulation constellations is analyzed and the simulated error per-formance with 22 and 44 MIMO schemes is investigated.The theoretical average mutual information analysis and simulation results show that the proposed NB LDPC-coded PS scheme for MIMO systems based on SSD is reliable and robust,and is therefore suitable for future wireless communication systems.

RESEARCH OF PINYIN-TO-CHARACTER CONVERSION BASED ON MAXIMUM ENTROPY MODEL

This paper applied Maximum Entropy (ME) model to Pinyin-To-Character (PTC) conversion in-stead of Hidden Markov Model (HMM) that could not include complicated and long-distance lexical informa-tion. Two ME models were built based on simple and complex templates respectively, and the complex one gave better conversion result. Furthermore, conversion trigger pair of y A → y B cBwas proposed to extract the long-distance constrain feature from the corpus; and then Average Mutual Information (AMI) was used to se-lect conversion trigger pair features which were added to the ME model. The experiment shows that conver-sion error of the ME with conversion trigger pairs is reduced by 4% on a small training corpus, comparing with HMM smoothed by absolute smoothing.

Efficient practical codebook-precoding MIMO scheme based on signal space diversity

A novel practical codebook-precoding multiple-input multiple-output（MIMO） system based on signal space diversity（SSD） with the minimum mean squared error（MMSE）receiver is proposed.This scheme utilizes rotation modulation and space-time-frequency component interleaving.A novel precoding matrix selection criterion to maximize the average signal to interference plus noise ratio（SINR） is also put forward for the proposed scheme,which has a larger average mutual information（AMI）.Based on the AMI- maximization criterion,the optimal rotation angles for the proposed system are also investigated.The new scheme can make full use of space-time-frequency diversity and signal space diversity,and exhibit high spectral efficiency and high reliability in fading channels.Simulation results show that the proposed scheme greatly outperforms the conventional bit- interleaved coded modulation（BICM） MIMO-orthogonal frequency division multiplexing（OFDM） scheme without SSD,which is up to4.5 dB signal-to-noise ratio（SNR） gain.

Improving amplify-and-forward relay selection algorithm based on partial relay link

This article addresses the design problem of selecting an appropriate relay in amplify-and-forward （AF） cooperative diversity systems. In this regard, this article focuses on relay selection based on partial channel knowledge only across the source and relay links. In particular, the two fundamental questions will be answered, that is, whether to cooperate and whom to cooperate with. Through answering these two questions, an improved relay selection strategy based on partial relay link, which emphasizes that cooperation happens when necessary, is proposed to aim at maximizing the average mutual information. Then a joint optimization, in terms of power allocation and relay selection, is employed to guarantee a robust performance for relay selection based on partial relay link. Optimum power is allocated between the source and the selected relay to maximize the output signal-to-noise （SNR） at the destination. Simulation results turn out that the improved scheme can achieve better performance than previous work and the robust performance can be guaranteed by employing joint optimization.

Performance analysis of complexity reduction BP decoding of rateless codes by deleting low reliable symbols

This paper investigates the performance of the method used to reduce the decoding complexity of rateless codes through the deletion of the received symbols with low reliability. In the decoder, the received symbols whose absolute value of logarithm likelihood ratio （LLR） is lower than the threshold are removed, together with their corresponding edges, and thus not involved in the decoding process. The relationship between the deletion probability and the likelihood ratio deletion threshold is derived. The average mutual information per received symbol is analyzed in the case of deletion. The required number of symbols for the decoder to keep the same performance as regular decoding decreases since the average mutual information per symbol increases with the deletion, thus reducing the decoding complexity. This paper analyzes the reduction of decoding computations and the consequent transmission efficiency loss from the perspective of mutual information. The simulation results of decoding performance are consistent with those of the theoretical analysis, which show that the method can effectively reduce the decoding complexity at the cost of a slight loss of transmission efficiency.