In this letter, we develop a recurrence formula for the capacity of Nakagami-m fading channel with BPSK/QPSK modulations when channel state information (CSI) is available at the receiver. For each fading parameter m, a simply constructed series representation with a fast-convergence rate can be obtained through the recurrence formula. The series expansion provides a numerically efficient way to calculate the capacity for both Rayleigh and Nakagami-m fading channels. The simulation results show that the recurrence formula is a good alternative for estimating the capacity of Nakagami fading channel.
Recently, there has been an increasing interest in exploiting interference cancelation to support multiple adjacent concurrent transmissions instead of avoiding interference through scheduling. In line with these efforts, this paper propose an interference coordinated routing (ICR) scheme for wireless multi-hop networks to achieve more transmission concurrence, and thus lower the end-to-end delay. The proposed ICR scheme firstly constructs an initial path by the interference-aware routing algorithm, which captures the end-to-end latency and spatial resource cost as the routing metrics. Then, to analyze the feasibility of concurrent transmission for a given link set, we consider the interference coordination and formulate the concurrent transmission of multiple links as a linear programming (LP) problem. The solution to the LP problem indicates the power allocation. Finally, a distributed guard zone based selection (GBS) algorithm is further proposed to iteratively explore the maximum feasible link set for each time slot. The selected links are simultaneously active for packet transmission with the allocated power in the current time slot, and the remaining links will be put off to the next. Simulation results confirm that ICR reduces the end-to-end delay by 9.16% to 73.82%, and promotes better transmission concurrence compared with the existing schemes.
28 May 2019 in IEEE Wireless Communications Letters
This paper investigates linear precoding scheme that maximizes the mutual information (MI) of multiple-input multiple-output (MIMO) channel with arbitrary input constellations. Since traditional precoding schemes which rely on the relationship between MI and minimum mean-square error (MMSE) are too time consuming, this paper first proposes a lower bound of MI with which the computational complexity can be significantly reduced compared with direct computation of MI, and we prove that the bound is asymptotically optimal with a constant shift. Based on this lower bound, a low-complexity precoding scheme is obtained. Numerical results verify the effectiveness and high-performance of the proposed precoding method compared with traditional precoding schemes.
This letter proposes a novel joint decoding scheme for correlated sources using systematic polar codes. In the proposed scheme, each source independently encodes its message into a systematic polar codeword and sends the codeword via a binary-input additive white Gaussian noise (BI-AWGN) channel to the common destination, where adaptive CRC-aided successive cancellation list (CA-SCL) decoders are employed. During the iterative decoding process, the log likelihood ratios (LLRs) fed to each adaptive CA-SCL decoder are iteratively combined with the extrinsic LLRs from other decoders. The correlation among the sources is exploited to improve the decoding performance. Simulation results show that, in comparison with independent decoding, the proposed scheme can achieve significantly improved decoding performance without increased complexity.
15 August 2019 in IEEE Transactions on Vehicular Technology
In this paper, we investigate the precoding scheme for multiple-input multiple-output multiple antennas eavesdropper (MIMOME) channels under the constraint of finite-alphabet inputs to ensure secure transmission between the source and the destination in the presence of an eavesdropper. With finite-alphabet inputs, there are no closed-form solutions for mutual information (MI) and its gradient-minimum mean-square error (MMSE) matrix. Therefore traditional precoding schemes based on direct calculation of MI and MMSE matrix through numerical integration involve prohibitive computational burden. To address this problem, this paper first derives asymptotically optimal lower bounds of MI and ergodic MI with which the computational complexity can be significantly reduced compared with the direct computation of MI. With the derived lower bounds, a low-complexity precoding scheme is proposed to maximize the secrecy rate, wherein a gradient descent based algorithm is used to obtain the precoding result. In the low and high signal-to-noise ratio (SNR) regions, we demonstrate that the proposed precoding scheme gives the same result as directly maximizing the secrecy rate, which indicates that the proposed low-complexity precoding scheme is asymptotically optimal.
This paper investigates the sum capacity of a single-cell multi-user system under the constraint that the transmitted signal is adopted from M-ary two-dimensional constellation with equal probability for both uplink, i.e., multiple access channel (MAC), and downlink, i.e., broadcast channel (BC) scenarios. Based on the successive interference cancellation (SIC) and the entropy power Gaussian approximation, it is shown that both the multi-user MAC and BC can be approximated to a bank of parallel channels with the channel gains being modified by an extra attenuate factor that equals to the negative exponential of the capacity of interfering users. With this result, the capacity of MAC and BC with arbitrary number of users and arbitrary constellations can be easily calculated which in sharp contrast with using traditional Monte Carlo simulation that the calculating amount increases exponentially with the increase of the number of users. Further, the sum capacity of multi-user under different power allocation strategies including equal power allocation, equal capacity power allocation and maximum capacity power allocation is also investigated. For the equal capacity power allocation, a recursive relation for the solution of power allocation is derived. For the maximum capacity power allocation, the necessary condition for optimal power allocation is obtained and an optimal algorithm for the power allocation optimization problem is proposed based on the necessary condition.