Optical STAR-RIS-Aided VLC Systems: RSMA Versus NOMA

A critical concern within the realm of visible light communications (VLC) pertains to enhancing system data rate, particularly in scenarios where the direct line-of-sight (LoS) connection is obstructed by obstacles. The deployment of meta-surface-based simultaneous transmission and reflection reconfigurable intelligent surface (STAR-RIS) has emerged to combat challenging LoS blockage scenarios and to provide 360 coverage in radio-frequency wireless systems. Recently, the concept of optical simultaneous transmission and reflection reconfigurable intelligent surface (OSTAR-RIS) has been promoted for VLC systems. This work is dedicated to studying the performance of OSTAR-RIS in detail and unveiling the VLC system performance gain under such technology. Specifically, we propose a novel multi-user indoor VLC system that is assisted by OSTAR-RIS. To improve the sum rate performance of the proposed system, both power-domain non-orthogonal multiple access (NOMA) and rate splitting multiple access (RSMA) are investigated in this work. To realize this, a sum rate maximization problem that jointly optimizes the roll and yaw angles of the reflector elements as well as the refractive index of the refractor elements in OSTAR-RIS is formulated, solved, and evaluated. The maximization problem takes into account practical considerations, such as the presence of non-users (i.e., blockers) and the orientation of the recipient's device. The sine-cosine meta-heuristic algorithm is employed to get the optimal solution of the formulated non-convex optimization problem. Moreover, the study delves into the sum energy efficiency optimization of the proposed system. Simulation results indicate that the proposed OSTAR-RIS RSMA-aided VLC system outperforms the OSTAR-RIS NOMA-based VLC system in terms of both the sum rate and the sum energy efficiency.Comment: Accepted for publication in IEEE Open Journal of the Communications Society, Dec. 202

Closed-form SER expression for APSK based on the kite structure

Abstract: Please refer to full text to view abstrac

Bender's Decomposition for Optimization Design Problems in Communication Networks

Various types of communication networks are constantly emerging to improve connectivity services and facilitate the interconnection of various types of devices. This involves the development of several technologies, such as device-to-device communications, wireless sensor networks and vehicular communications. The various services provided have heterogeneous requirements on the quality metrics such as throughput, end-to-end latency and jitter. Furthermore, different network technologies have inherently heterogeneous restrictions on resources, for example, power, interference management requirements, computational capabilities, and so on. As a result, different network operations such as spectrum management, routing, power control and offloading need to be performed differently. Mathematical optimization techniques have always been at the heart of such design problems to formulate and propose computationally efficient solution algorithms. One of the existing powerful techniques of mathematical optimization is Benders Decomposition (BD), which is the focus of this article. Here, we briefly review different BD variants that have been applied in various existing network types and different design problems. These main variants are the classical, the combinatorial, the multi-stage, and the generalized BD. We discuss compelling BD applications for various network types including heterogeneous cellular networks, infrastructure wired wide area networks, smart grids, wireless sensor networks, and wireless local area networks. Mainly, our goal is to assist the readers in refining the motivation, problem formulation, and methodology of this powerful optimization technique in the context of future networks. We also discuss the BD challenges and the prospective ways these can be addressed when applied to communication networks' design problems

On the indoor VLC link evaluation based on the racian K-factor

Abstract: In visible light communications (VLC) technology, the channel is generally modeled as a multi-path propagation environment. This is due to the presence, on the photo-detector (PD), of specular and non-specular signal components. The Racian K-factor is exploited in such environments to measure the dominance of the line-of-sight (LoS) signal power over that of the non-LoS (NLoS) link. In this paper, K is exploited in the evaluation of the VLC link. Examples of the use of K is underlined in the computation of few link evaluation metrics including the signal-to-noise ratio (SNR), , the channel capacity, C, and the outage probabilit

Compound codes based on irregular graphs and their iterative decoding.

Thesis (Ph.D.)-University of KwaZulu-Natal, Durban, 2004.Low-density parity-check (LDPC) codes form a Shannon limit approaching class of linear block codes. With iterative decoding based on their Tanner graphs, they can achieve outstanding performance. Since their rediscovery in late 1990's, the design, construction, and decoding of LDPC codes as well as their generalization have become one of the focal research points. This thesis takes a few more steps in these directions. The first significant contribution of this thesis is the introduction of a new class of codes called Generalized Irregular Low-Density (GILD) parity-check codes, which are adapted from the previously known class of Generalized Low-Density (GLD) codes. GILD codes are generalization of irregular LDPC codes, and are shown to outperform GLD codes. In addition, GILD codes have a significant advantage over GLD codes in terms of encoding and decoding complexity. They are also able to match and even beat LDPC codes for small block lengths. The second significant contribution of this thesis is the proposition of several decoding algorithms. Two new decoding algolithms for LDPC codes are introduced. In principle and complexity these algorithms can be grouped with bit flipping algorithms. Two soft-input soft-output (SISO) decoding algorithms for linear block codes are also proposed. The first algorithm is based on Maximum a Posteriori Probability (MAP) decoding of low-weight subtrellis centered around a generated candidate codeword. The second algorithm modifies and utilizes the improved Kaneko's decoding algorithm for soft-input hard-output decoding. These hard outputs are converted to soft-decisions using reliability calculations. Simulation results indicate that the proposed algorithms provide a significant improvement in error performance over Chase-based algorithm and achieve practically optimal performance with a significant reduction in decoding complexity. An analytical expression for the union bound on the bit error probability of linear codes on the Gilbert-Elliott (GE) channel model is also derived. This analytical result is shown to be accurate in establishing the decoder performance in the range where obtaining sufficient data from simulation is impractical

AF cooperative VLC communication systems : cascaded channel analysis

Abstract: Visible light communications (VLC) technology is a relatively new emerging telecommunication paradigm. It offers the opportunity to design cost-effective communication systems due to the dual use of the light sources, which are exploited as illumination devices and as communication antennas. However, this technology is mostly deployed in short-range communication applications because of the light diffusion range, which is short by nature. One good response to this dilemma is the imple- mentation of relay-assisted cooperative communication systems. Cooperative VLC systems provide three advantages, which are an increase in the transmission range, an improvement of the detection, hence of the bit error rate (BER), and an improved lighting system. In this paper, we analyze the channel response of a single-relay indoor VLC system based on an amplify-and- forward (AF) strategy. The system takes into account the fact that the relay also receives a reflected message. Results show the influence of the room’s reflection index, Lambertian index, the number of scattered rays on the overall channel response and confirms the importance of relay-assisted strategies in improving systems’ reliability

Energy efficient subchannel and power allocation in cooperative VLC systems

This letter studies the energy efficiency (EE) optimization of cooperative visible light communication (VLC) systems while considering the inter-cell interference and the lineof-sight blockage problems. Specifically, the optimization problem of subchannel and power allocation to maximize EE under transmit power budgets and users' minimum rate constraints is considered. The formulated problem turns out to be a difficult nonlinear fractional program for which a low-complexity iterative solution based on fractional programming theory and the quadratic transform approach is proposed. Extensive simulations are conducted to show the efficacy of the proposed scheme over conventional approaches. In addition, the outage analysis and impacts of varying the transmit power and the subchannel bandwidth on the EE performance are investigated.This work was supported by the Natural Science and Engineering Research Council of Canada (NSERC) through its Discovery Program, the Memorial University VPR Program, and the Spanish National Project TERESA-ADA (TEC2017-90093-C3-2-R) (MINECO/AEI/FEDER, UE). The associate editor coordinating the review of this letter and approving it for publication was H. Zhang