Optical MIMO-OFDM with Generalized LED Index Modulation

Due to copyright restrictions, the access to the full text of this article is only available via subscription.Visible light communications (VLC) is a promising and uncharted new technology for the next generation of wireless communication systems. This paper proposes a novel generalized light emitting diode (LED) index modulation method for multiple-input-multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM)-based VLC systems. The proposed scheme avoids the typical spectrum efficiency losses incurred by time- and frequency-domain shaping in OFDM signals. This is achieved by exploiting spatial multiplexing along with LED index modulation. Accordingly, real and imaginary components of the complex time-domain OFDM signals are separated first, then resulting bipolar signals are transmitted over a VLC channel by encoding sign information in LED indexes. As a benchmark, we demonstrate the performance analysis of our proposed system for both analytical and physical channel models. Furthermore, two novel receiver designs are proposed. Each one is suitable for frequency-flat or selective channel scenarios. It has been shown via extensive computer simulations that the proposed scheme achieves considerably better bit error ratio versus signal-to-noise-ratio performance than the existing VLC-MIMO-OFDM systems that use the same number of transmit and receive units [LEDs and photo diodes (PDs)]. Compared with the single-input single-output (SISO) DC biased optical (DCO)-OFDM system, both spectral efficiency and DC bias can be doubled and removed respectively simply by exploiting a MIMO configuration.European Cooperation in Science and Technology (COST); The Scientific and Technological Research Council of Turkey (TUBITAK) Research; EPSRC under Established Career Fellowshi

Shortest Route at Dynamic Location with Node Combination-Dijkstra Algorithm

Abstract— Online transportation has become a basic requirement of the general public in support of all activities to go to work, school or vacation to the sights. Public transportation services compete to provide the best service so that consumers feel comfortable using the services offered, so that all activities are noticed, one of them is the search for the shortest route in picking the buyer or delivering to the destination. Node Combination method can minimize memory usage and this methode is more optimal when compared to A* and Ant Colony in the shortest route search like Dijkstra algorithm, but can’t store the history node that has been passed. Therefore, using node combination algorithm is very good in searching the shortest distance is not the shortest route. This paper is structured to modify the node combination algorithm to solve the problem of finding the shortest route at the dynamic location obtained from the transport fleet by displaying the nodes that have the shortest distance and will be implemented in the geographic information system in the form of map to facilitate the use of the system. Keywords— Shortest Path, Algorithm Dijkstra, Node Combination, Dynamic Location (key words