Chunming Zhao

An improvement on the modified weighted bit flipping decoding algorithm for LDPC codes

We present a major improvement to the modified weighted bit flipping (MWBF) decoding algorithm for low density parity-check (LDPC) codes. We improve the flipping criterion by introducing a more efficient method for computing the reliability of the parity checks. We derive an approximate theoretical expression for the weighting factor and demonstrate its consistency with simulation results. The improved MWBF algorithm achieves a noticeable gain over the MWBF algorithm with only a modest increase in computational complexity.

Resource Sharing of Underlaying Device-to-Device and Uplink Cellular Communications

The benefit of device-to-device (D2D) communication hinges on intelligent resource sharing between cellular and D2D users. This letter aims to optimize resource sharing for D2D communication to better utilize uplink resources in a multi-user cellular system with guaranteed quality of normal cellular communications. Despite the nonconvex difficulty, we provide an analytical characterization of the globally optimal resource sharing strategy, and furthermore propose two suboptimal strategies with less complexity. The superiority of the proposed resource sharing strategies is demonstrated through numerical examples.

Downlink Resource Reuse for Device-to-Device Communications Underlaying Cellular Networks

The full potential of Device-to-device (D2D) communication relies on efficient resource reuse strategies including power control and matching of D2D links and cellular users (CUs). This letter investigates downlink resource reuse between multiple D2D links and multiple CUs. Our goal is to achieve a network utility enhancement for D2D communication while ensuring the QoS of the CUs. Despite the combinatorial nature of the problem and the coupled power constraints, we characterize the optimal D2D-CU matching as well as their power coordination, and propose an efficient algorithm to jointly optimize all D2D links and CUs. The proposed downlink resource reuse strategy shows a superiority over existing D2D schemes.

Parallel Weighted Bit-Flipping Decoding

A parallel weighted bit-flipping (PWBF) decoding algorithm for low-density parity-check (LDPC) codes is proposed. Compared to the best known serial weighted bit-flipping decoding, the PWBF decoding converges significantly faster but with little performance penalty. For decoding of finite-geometry LDPC codes, we demonstrate through examples that the proposed PWBF decoding converges in about 5 iterations with performance very close to that of the standard belief-propagation decoding.

Multiple Source Localization in Wireless Sensor Networks Based on Time of Arrival Measurement

We investigate the localization of multiple signal sources based on sensors performing time-of-arrival (TOA) measurement in wireless sensor networks. Moving beyond the widely studied single source localization problem, concurrently active multiple sources substantially complicate the problem since anchored sensor nodes are unaware of associations between measured signals and source nodes. At the same time, as the total number of possible source-measurement associations grows exponentially with the number of sensor nodes, it is inefficient to attempt conventional single-source localization algorithm for each possible association in a brute-force manner. In this work, we address this difficult problem from a joint optimization perspective. Specifically, we consider simultaneous estimation of source-measurement associations and the source locations, in addition to finding the initial signal transmission time. This joint optimization problem includes both discrete and continuous variables. We propose an efficient three-step algorithm that progressively simplifies the original problem through convex relaxation and sensible approximations. Our proposed algorithm demonstrates results comparable to a genie-aided method that utilizes known source-measurement associations.

Performance of Secure Communications Over Correlated Fading Channels

We study the performance of secure communications over correlated fading channels in the presence of an eavesdropper, where the main and eavesdropper channels are correlated. We derive exact expressions for both the average secrecy capacity and the outage probability in the form of infinite series. Moreover, the truncated error of the infinite series representations involved in the analytical results is also investigated. The accuracy of our performance analysis is verified by simulation results.

Efficient Adaptive Resource Allocation for Multiuser OFDM Systems with Minimum Rate Constraints

This paper investigates the adaptive resource allocation scheme for the downlink of multiuser OFDM systems. We focus on the problem of maximizing the overall spectral efficiency while maintaining the QoS requirements of users, including bit error rate and individual minimum rate requirements. Under the assumption of equal power allocation, an efficient algorithm is proposed to obtain the suboptimal solution of the resource allocation. In this algorithm, we first introduce some positive multipliers, one for each user, according to their minimum rate constraints (MRC), and then a parallel subcarrier-and-bit allocation scheme is designed using these multipliers with low complexity. The numerical results show that our algorithm not only substantially reduces the computational complexity of the existing algorithm, but also provides a noticeable performance improvement.

Multiuser MISO Transceiver Design for Indoor Downlink Visible Light Communication Under Per-LED Optical Power Constraints

Light-emitting diode (LED)-based visible light communication (VLC), combining illumination and communication, is a promising technique for providing high-speed, low-cost indoor wireless services. In indoor environments, multiple LEDs routinely used as lighting sources may also be concomitantly invoked to support wireless services for multiple users, thus forming a multiuser multiple-input-single-output (MU-MISO) system. Since the user terminals detect all the light rays impinging from multiple LEDs, inter-user interference may severely degrade the attainable system performance. Hence, we conceive a transceiver design for indoor VLC MU-MISO systems to suppress the multiuser interference (MUI). In contrast to classic radio-frequency (RF) communication, in VLC, the signals transmitted from the LEDs are restricted by optical constraints, such as the real-valued nonnegativity of the optical signal, the maximum permissible optical intensity, and the constant brightness requirements of the LEDs. Given these practical constraints, we design the optimal transceiver relying on the objective function of minimizing the maximum mean square error (MMSE) between the legitimate transmitted and received signals of the users and show that it can be readily found by solving a convex second-order cone program. Then, we also propose a simplified transceiver design by incorporating zero-forcing (ZF) transmit precoding (TPC) and show that the TPC coefficients can be efficiently found by solving a linear program. The performance of both the optimal and the simplified transceiver is characterized by comprehensive numerical results under diverse practical VLC system setups.

Device-to-device communications: The physical layer security advantage

In systems that allow device-to-device (D2D) communications, user pairs in close proximity communicate directly without using an access point (AP) as an intermediary. D2D communications leads to improved throughput, reduced power consumption and interference, and more flexible resource allocation. We show that the D2D paradigm also provides significantly improved security at the physical layer, by reducing exposure of the information to eavesdroppers from two relatively high-power transmissions to a single low-power hop. We derive the secrecy outage probability (SOP) for the D2D and cellular systems, and compare performance for D2D scenarios in the presence of a multi-antenna eavesdropper. The cellular approach is only seen to have an advantage in certain cases when the AP has a large number of antennas and perfect channel state information.

New insights into weighted bit-flipping decoding

A natural relationship between weighted bit-flipping (WBF) decoding and belief-propagation-like (BP-like) decoding is explored. This understanding can help us develop WBF algorithms from BP-like algorithms. For min-sum decoding, one can find that its WBF algorithm is the algorithm proposed by Jiang et al. For BP decoding, we propose a new WBF algorithm and show its performance advantage. The proposed WBF algorithms are parallelized to achieve rapid convergence. Two efficient simulation-based procedures are proposed for the optimization of the associated thresholds.