14 January 2020 in IEEE Transactions on Wireless Communications
3 April 2019 in IEEE Transactions on Wireless Communications
DWDissanayakage G. Wijeratne
Dissanayakage G. Wijeratne
Low resolution analog-to-digital converter (ADC) has been considered as a promising solution to save power and cost in communication systems using high bandwidth and/or multiple RF chains. The goal of this work is to address the design of optimal signaling schemes and establish the capacity limit of Rician fading channels with low-resolution output quantization. This fading channel can be used to accurately model a wide range of wireless channels with line-of-sight (LOS) components, including emerging mmWave communications. The focus is on non-coherent fast fading channels where neither the transmitter nor the receiver knows the channel state information (CSI). By examining the continuity of the input-output mutual information, the existence of the optimal input signal is first validated. Then considering the case of 1-bit ADC, we show that the optimal input is π/2 circularly symmetric. A necessary and sufficient condition for an input signal to be optimal, which is referred to as the Kuhn-Tucker condition (KTC), and Lagrangian optimization problem are then established. By exploiting novel log-quadratic bounds on the Gaussian Q-function, it is then demonstrated that for a given mass point’s amplitude, the corresponding rotated mass points through the phase of LOS component must form a square grid centered at zero. Furthermore, the amplitude of the mass points in the optimal distribution can take on only one value. As a result, the capacity-achieving input with 1-bit ADC is a rotated quadrature phase-shift keying (QPSK) constellation, and the rotation angle depends on the Rician factor. The characterization of the optimal input has also been extended to the case of multi-bit ADCs. Specifically, it is shown that for a K-bit ADC, the optimal input is discrete having at most 22K mass points. In both cases of 1-bit and K-bit ADCs, the channel capacities are established in closed-form.
16 April 2007 in IEEE Transactions on Communications
This paper studies the bit error probability of coded unitary space-time modulation with iterative decoding where neither the transmitter nor the receiver knows the channel fading coefficients. The tight error bound with respect to the asymptotic performance is first analytically derived for any given unitary constellation and mapping rule. Design criteria regarding the choice of unitary constellation and mapping are then established. Furthermore, using the unitary constellation obtained from orthogonal design with quadrature phase-shift keying (QPSK or 4-PSK) and 8-PSK, two different mapping rules are proposed. The first mapping rule gives the most suitable mapping for systems that do not implement iterative processing, which is similar to a Gray mapping in coherent channels. The second mapping rule yields the best mapping for systems with iterative decoding. In particular, analytical and simulation results show that with the proposed mappings of the unitary constellations obtained from orthogonal designs, the asymptotic error performance of the iterative systems can closely approach a lower bound which is applicable to any unitary constellation and mapping
8 August 2014 in IEEE Transactions on Power Delivery
This paper studies the optimal signaling scheme and capacity of the Bernoulli-Gaussian impulsive noise channel to shed new light on the impact of impulsive noise on spectral efficiency of power-line communications systems. First, by focusing on the practically typical case with impulse power that is much higher than signal power, we develop a tight approximation to the differential entropy of Bernoulli-Gaussian noise. Closed-form tight lower and upper bounds on the capacity are then derived. By comparing these bounds, it is demonstrated that the capacity decreases with an increasing impulse occurrence rate and the Gaussian signaling scheme is nearly optimal. We then focus on the case with an impulse power lower than signal power to develop tight lower and upper bounds. We subsequently show that the Gaussian signaling can approach the capacity in this region as well. In addition, channel erasure is shown to be very effective for the impulsive noise channel when impulse power is higher than signal power, but it introduces rate loss when impulse power is sufficiently lower than signal power. Illustrative simulation results confirm the analytical derivations and show their applications to estimate the maximum achievable rate of a power-line communication link with practical parameters.
12 February 2019 in IEEE Transactions on Vehicular Technology
This paper investigates the benefits of incorporating full-duplex (FD) into an underlaid device-to-device (D2D) cellular network via centralized and distributed power control mechanisms. In the considered system, D2D users operate in FD mode under the adverse effect of realistic residual self-interference, and their locations are modeled by a homogeneous spatial Poisson point process. By first considering a centralized power control scheme, we first formulate an optimization problem that maximizes the D2D link sum-rate under the constraint on minimum target signal-to-interference-plus-noise ratio (SINR) at each user. Since the problem is non-convex, we propose a difference of convex (DC) based method to transform the problem into a sequence of convex subproblems, which can be solved efficiently. The obtained solutions help to calculate the coverage probability of both cellular and D2D links, and show that a very high coverage probability of cellular link can be achieved while successfully supporting a large number of active D2D links. In the second part of the paper, we consider a distributed power control where only the local channel state information (CSI) of direct link between respective D2D users is needed. By utilizing the tools of stochastic geometry, we derive closed-form approximations of coverage probabilities for both cellular and D2D links. Specifically, we apply Laplace transforms and novel approximations that accurately approximate the expected values of fractional and exponential functions of random variables to obtain the distribution functions of SINRs at the base station (BS) and D2D users in closed-form. By further taking the average over the distributions of cellular and D2D link distances, we then arrive at the closed-form approximations of cellular and D2D coverage probabilities. In addition, based on the approximation of D2D link coverage probability, an analytical expression for the D2D link sum-rate is also obtained, and it can be effectively calculated.
15 June 2020 in IEEE Transactions on Wireless Communications
This paper investigates the capacity region and detailed characterizations of capacity-achieving signaling schemes of a multiple access channel (MAC) with two users communicating to a base station (BS) equipped with 1-bit quantizers. We consider Rayleigh fading channels where channel state information (CSI) is known only at BS. Towards this end, we first study the weighted sum-rate maximization problem over the set of input distributions of one user for a fixed input signal at another user. By examining a necessary and sufficient Kuhn- Tucker condition (KTC) for an input to be optimal, it is first shown that the power constraint is active, i.e., the equality in the power constraint is achieved. By further exploiting novel bounds on the output distribution functions, the optimal distribution is shown to have a bounded amplitude. In the next step, we prove that if a fixed input with bounded amplitude is used at one user, the other user also needs to use a bounded amplitude signal to maximize the weighted sum-rate. To effectively analyze the KTC, our approach is to divide the domain of fading into two disjoint regions and examine the region with non-zero measure. It is then concluded that any boundary point in the capacity region is achieved by using bounded amplitude signals, and they are π=2 circularly symmetric. Building upon these results, we turn our focus to the sum-capacity segment, and demonstrate that any π=2 circularly symmetric input distribution having a constant amplitude is sum-capacity achieving. The sum-capacity can then be established.