In order to beneficially exploit the scarce wireless spectral resources, spectrum sharing between communication and radar systems has become a promising research topic. However, traditional network association strategies may not result in efficient hybrid communication and radar systems. We circumvent this problem by formulating a partially observable Markov decision processes (POMDP) aided network association scheme, where the radar user acts as the primary user (PU), while the cognitive communication user is the secondary user (SU). For maximizing the network throughput, whilst minimizing the interference imposed on the radar user, the communication user is configured for adaptively selecting its underlay or overlay access mode. Moreover, a low-complexity near-optimal reinforcement learning algorithm is proposed for the co-design by considering both its complexity and feasibility. Finally, we quantify the performance of our proposed POMDP based network association scheme.

Wireless multihop networks (WMHNs) have to strike a trade-off among diverse and often conflicting quality-of-service requirements. The resultant solutions may be included by the Pareto front under the concept of Pareto optimality. However, the problem of finding all the Pareto-optimal routes in WMHNs is classified as non-deterministic polynomial-hard, since the number of legitimate routes increases exponentially, as the nodes proliferate. Quantum computing offers an attractive framework of rendering the Pareto-optimal routing problem tractable. In this context, a pair of quantum-assisted algorithms has been proposed, namely the non-dominated quantum optimization and the non-dominated quantum iterative optimization. However, their complexity is proportional to √N, where N corresponds to the total number of legitimate routes, thus still failing to find the solutions in “polynomial time.” As a remedy, we devise a dynamic programming framework and propose the so-called evolutionary quantum pareto optimization (EQPO) algorithm. We analytically characterize the complexity imposed by the EQPO algorithm and demonstrate that it succeeds in solving the Pareto-optimal routing problem in polynomial time. Finally, we demonstrate by simulations that the EQPO algorithm achieves a complexity reduction, which is at least an order of magnitude when compared to its predecessors, albeit at the cost of a modest heuristic accuracy reduction.

An ideal visible light communication (VLC) system should facilitate reliable data transmission at high throughputs, while also providing flicker-free illumination at the user-defined dimming level. In this spirit, we conceive a unary code aided dimming scheme for ON-OFF keying (OOK) modulated VLC systems. The proposed unary-coded scheme facilitates joint dimming and throughput control, while relying on iterative decoding. It is demonstrated that the proposed unary-coded dimming scheme provides attractive throughput gains over its contemporaries and it is also capable of approaching the theoretical throughput limit. Furthermore, we design novel joint dimming-forward error correction coding schemes, which significantly outperform their compensation time dimming-based counterparts in terms of the attainable bit error rate performance as well as the throughput. Finally, in the quest for approaching the capacity, we also optimize our system using EXTRINSIC information transfer charts and demonstrate an SNR-gain of upto 6 dB over the compensation time dimming-based classic benchmarker.

With the proliferation of smart-phones and tablet PCs, the data rates of wireless communications have been soaring. Hence, the need for power-efficient communications relying on low-complexity multiple-stream detectors has become more pressing than ever. As a remedy, in this paper we design low-complexity soft-input soft-output quantum-assisted multi-user detectors (QMUD), which may be conveniently incorporated into state-of-the-art iterative receivers. Our design relies on extrinsic information transfer charts. Our QMUDs are then employed in multi-carrier interleave-division multiple-access (MC-IDMA) systems, which are investigated in the context of different channel code rate and spreading factor pairs, whilst fixing the total bandwidth requirement. One of our QMUDs is found to operate within 0.5 dB of the classical maximum a posteriori probability MUD after three iterations between the MUD and the decoders, while requiring only half its complexity, at a BER of 10-5in the uplink of a rank-deficient MC-IDMA system relying on realistic imperfect channel estimation at the receiver, while supporting 14 users transmitting QPSK symbols.