Improving the redundancy of Knuth's balancing scheme for packet transmission systems

A simple scheme was proposed by Knuth to generate binary balanced codewords from any information word. However, this method is limited in the sense that its redundancy is twice that of the full sets of balanced codes. The gap between Knuth's algorithm's redundancy and that of the full sets of balanced codes is significantly considerable. This paper attempts to reduce that gap. Furthermore, many constructions assume that a full balancing can be performed without showing the steps. A full balancing refers to the overall balancing of the encoded information together with the prefix. We propose an efficient way to perform a full balancing scheme that does not make use of lookup tables or enumerative coding.Comment: 11 pages, 4 figures, journal article submitted to Turkish journal of electrical and computer science

New distance concept and graph theory approach for certain coding techniques design and analysis

Abstract: A New graph distance concept introduced for certain coding techniques helped in their design and analysis as in the case of distance-preserving mappings and spectral shaping codes. A graph theoretic construction, mapping binary sequences to permutation sequences and inspired from the k-cube graph has reached the upper bound on the sum of the distances for certain values of the length of the permutation sequence. The new introduced distance concept in the k-cube graph helped better understanding and analyzing for the first time the concept of distance-reducing mappings. A combination of distance and the index-permutation graph concepts helped uncover and verify certain properties of spectral null codes, which were previously difficult to analyze

An overview of outdoor visible light communications

Abstract: In visible light communications (VLC) technology, the outdoor applications are less explored when compared to those indoors. This is due to the fact that: (i) the dual use of light emitting diodes (LEDs) is not always practicable in the outdoor VLC environment; (ii) the level of interference and noise is considerably higher in outdoor VLC; (iii) many other communication technologies are available to be used which, due to their specific characteristics, adapt better to the outdoor environment when compared to VLC technology. Nevertheless, several outdoor VLC applications have been identified. They include and are not limited to building-to-building (B2B), vehicle-to-vehicle (V2V) and road-to-vehicle (R2V) communications. Deploying light fidelity (Li-Fi) using street and park lights is also feasible. Finally, some applications exploit the ability of solar panels to simultaneously harvest the electrical energy and serve as a VLC receiving antenna. The implementation of these communication systems faces lots of challenges. Most of them are related to environmental factors such as fog, rain, sunlight, haze, snow, dust, and atmospheric disturbances. Some challenges are based on parameters such as the geometrical aspect of the light diffusion, which is Lambertian in most cases. These challenges contribute to lower interest in outdoor VLC to date. However, the environment presents several opportunities. In this article, we explore the outdoor VLC environment, review and present some promising applications selected from the literature. Furthermore, we underline likely research opportunities based on the actual state-of-the-art and our outdoor VLC characterisation experiments

Decoding distance-preserving permutation codes for power-line communications

Abstract: A new decoding method is presented for permutation codes obtained from distance-preserving mapping algorithms, used in conjunction with M-ary FSK for use on powerline channels. The new approach makes it possible for the permutation code to be used as an inner code with any other error correction code used as an outer code. The memory and number of computations necessary for this method is lower than when using a minimum distance decoding method

A multilevel construction for mappings from binary sequences to permutation sequences

Abstract: A multilevel construction is introduced to create distance-preserving mappings from binary sequences to permutation sequences. It is also shown that for certain values, the new mappings attain the upper bound on the sum of Hamming distances obtainable for such mappings, and in the other cases improve on those of previous mappings

Analysis of permutation distance-preserving mappings using graphs

Abstract A new way of analyzing permutation distance preserving mappings is presented by making use of a graph representation. The properties necessary to make such graphs distance-preserving and how this relates to the total sum of distances that exist for such mappings, are investigated. This new knowledge is used to analyze previous constructions, as well as showing the existence or non-existence of simple algorithms for mappings attaining the upper bound on the sum of distances. Finally, two applications for such graphs are considered

Mathematical approach and implementation of frequency mapping techniques in power-line communications channel

Abstract : Please refer to full text to view abstract

On the Evaluation of Handover Exchange Schemes Between Two Cognitive Radio Base Stations with and without Buffers

This article investigates and evaluates a handoverexchange scheme between two secondary users (SUs) moving indifferent directions across the handover region of neighboring cellin a cognitive radio network. More specifically, this investigationcompares the performance of SUs in a cellular cognitive radionetwork with and without channel exchange scheme. The investigationshows reduced handover failure, blocking, forced andaccess probabilities respectively, for handover exchange schemewith buffer as compared to exchange scheme without buffer.It also shows transaction within two cognitive nodes within anetwork region. The system setup is evaluated through systemsimulation