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.

Optimization of MQAM Modulation Schemes in Mobile Communications(Ⅰ)——Analysis of MQAM BER Performance in AGWN Channel Based on Signal Space

Based on signal space concepts, a transmission error code performance for MPSK, square MQAM and star MQAM modulation schemes on the AGWN channel is analyzed. The corresponding BER formulas and computer aided numeric results are also given. Therefore it provides a theoretical basis for choosing MQAM modulation schemes in mobile communications.

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.

Enhanced quadrature signaling-based cooperative transmission with full rate and full diversity

Quadrature signaling-based cooperative transmission is an efficient and simple scheme to obtain spatial diversity.However,this scheme causes date rate loss compared with direct transmission.In this work,our focus is on recovering from the data rate loss while simultaneously achieving spatial diversity.Particularly,an enhanced quadrature signaling-based cooperative scheme was designed,which can realize full-rate transmission by using the signal space diversity(SSD)technique.Then,accurate bit error rate(BER)expression for the full-rate scheme was derived over independent and non-identically distributed(INID)Rayleigh fading channels.Specifically,a closed-form BER expression is obtained,which is quite tight over the whole SNR range,and thus allows for rapid and efficient evaluation of system performance under various channel conditions.Moreover,an asymptotic approximation of the BER was derived to show that the full-rate scheme can achieve full diversity.Simulation results verify the tightness of the analysis and show that the full-rate scheme significantly outperforms the traditional quadrature signaling-based scheme by about 2 dB with the same complexity order.

Analysis of Galileo signal-in-space range error and positioning performance during 2015-2018

A long-term analysis of signal-in-space range error (SISRE) is presented for all healthy Galileo satellites, and the first pair of full operational capability satellites in wrong elliptical orbits. Both orbit and clock errors for Galileo show an obvious convergence trend over time. The annual statistical analyses show that the average root mean squares (RMSs) of SISRE for the Galileo constellation are 0.58 m (2015), 0.29 m (2016), 0.23 m (2017), and 0.22 m (2018). Currently, the accuracy of the Galileo signal-in-space is superior to that of the global positioning system (GPS) Block IIF (0.35 m). In addition, the orbit error accounts for the majority of Galileo SISRE, while the clock error accounts for approximately one-third of SISRE due to the high stability of the onboard atomic clock. Single point positioning results show that Galileo achieves an accuracy of 2-3 m, which is comparable to that of GPS despite the smaller number of satellites and worse geometry. Interestingly, the vertical accuracy of Galileo, which uses the NeQuick ionospheric model, is higher than that of GPS. Positioning with single frequency E1 and E5 show a higher precision than E5a and E5b signals. Regarding precise point positioning (PPP), the results indicate that a comparable positioning accuracy can be achieved among different stations with the current Galileo constellation. For static PPP, the RMS values of Galileo-only solutions are within 1 cm horizontally, and the vertical RMSs are mostly within 2 cm horizontally. For kinematic PPP, the RMSs of Galileo-only solutions are mostly within 4 cm horizontally and 6 cm vertically.

Extracting outer function part from Hardy space function

Any analytic signal fa(e^(it)) can be written as a product of its minimum-phase signal part(the outer function part) and its all-phase signal part(the inner function part). Due to the importance of such decomposition, Kumarasan and Rao(1999), implementing the idea of the Szeg?o limit theorem(see below),proposed an algorithm to obtain approximations of the minimum-phase signal of a polynomial analytic signal fa(e^(it)) = e^(iN0t)M∑k=0a_k^(eikt),(0.1)where a_0≠ 0, a_M≠ 0. Their method involves minimizing the energy E(f_a, h_1, h_2,..., h_H) =1/(2π)∫_0^(2π)|1+H∑k=1h_k^(eikt)|~2|fa(e^(it))|~2dt(0.2) with the undetermined complex numbers hk's by the least mean square error method. In the limiting procedure H →∞, one obtains approximate solutions of the minimum-phase signal. What is achieved in the present paper is two-fold. On one hand, we rigorously prove that, if fa(e^(it)) is a polynomial analytic signal as given in(0.1),then for any integer H≥M, and with |fa(e^(it))|~2 in the integrand part of(0.2) being replaced with 1/|fa(e^(it))|~2,the exact solution of the minimum-phase signal of fa(e^(it)) can be extracted out. On the other hand, we show that the Fourier system e^(ikt) used in the above process may be replaced with the Takenaka-Malmquist(TM) system, r_k(e^(it)) :=((1-|α_k|~2e^(it))/(1-α_ke^(it))^(1/2)∏_(j=1)^(k-1)(e^(it)-α_j/(1-α_je^(it))^(1/2), k = 1, 2,..., r_0(e^(it)) = 1, i.e., the least mean square error method based on the TM system can also be used to extract out approximate solutions of minimum-phase signals for any functions f_a in the Hardy space. The advantage of the TM system method is that the parameters α_1,..., α_n,...determining the system can be adaptively selected in order to increase computational efficiency. In particular,adopting the n-best rational(Blaschke form) approximation selection for the n-tuple {α_1,..., α_n}, n≥N, where N is the degree of the given rational analytic signal, the minimum-phase part of a rational analytic signal can be accurately and efficiently extracted out.

Construction of compressed sensing matrixes based on the singular pseudo-symplectic space over finite fields

Compressed sensing（CS） provides a new approach to acquire data as a sampling technique and makes it sure that a sparse signal can be reconstructed from few measurements. The construction of compressed matrixes is a central problem in compressed sensing. This paper provides a construction of deterministic CS matrixes, which are also disjunct and inclusive matrixes, from singular pseudo-symplectic space over finite fields of characteristic 2. Our construction is superior to De Vore＇s construction under some conditions and can be used to reconstruct sparse signals through an efficient algorithm.