A construction for balancing non-binary sequences based on gray code prefixes

Abstract: We introduce a new construction for the balancing of non-binary sequences that make use of Gray codes for prefix coding. Our construction provides full encoding and decoding of sequences, including the prefix. This construction is based on a generalization of Knuth’s parallel balancing approach, which can handle very long information sequences. However, the overall sequence—composed of the information sequence, together with the prefix—must be balanced. This is reminiscent of Knuth’s serial algorithm. The encoding of our construction does not make use of lookup tables, while the decoding process is simple and can be done in parallel

Encoding and Decoding of Balanced q-ary sequences using a gray code prefix

Abstract: Balancing sequences over a non-binary alphabet is considered, where the algebraic sum of the components (also known as the weight) is equal to some specific value. Various schemes based on Knuth’s simple binary balancing algorithm have been proposed. However, these have mostly assumed that the prefix describing the balancing point in the algorithm can easily be encoded. In this paper we show how non-binary Gray codes can be used to generate these prefixes. Together with a non-binary balancing algorithm, this forms a complete balancing system with straightforward and efficient encoding/decoding

Construction of efficient q-ary balanced codes

Abstract : Abstract—Knuth proposed a simple scheme for balancing codewords, which was later extended for generating q-ary balanced codewords. The redundancy of existing schemes for balancing q-ary sequences is larger than that of the full balanced set which is the minimum achievable redundancy. In this article, we present a simple and efficient method to encode the prefix that results in less redundancy for the construction of q-ary balanced codewords

On the improvement of the Knuth’s redundancy algorithm for balancing codes

Abstract: A simple scheme was proposed by Knuth to generate balanced codewords from a random binary information sequence. However, this method presents a redundancy which is twice as that of the full sets of balanced codewords, that is the minimal achievable redundancy. The gap between the Knuth’s algorithm generated redundancy and the minimal one is significantly considerable and can be reduced. This paper attempts to achieve this goal through a method based on information sequence candidates

Design and implementation of a real-time tracking and telemetry system for a solar car

Abstract: It is very critical for solar racers to achieve a the real time tracking of their solar vehicle during any race. The system is made of the real time visualisation of the video feedback of the car from the escort vehicle, the location of the car on the google maps as it is racing and its velocity. The real time video feedback of the race could be retrieved from the cloud for broadcasting purposes. The main advantage of this system is the wireless link communication which was achieved for distance transmission, coupled to a very reliable and robust Desktop Application for data sensor display purposes

Development of a helium gas balloon flying system for aerial photographing and observation

Abstract: This paper describes the implementation of a helium gas balloon flying system equipped with a camera and tracking subsystem for aerial photography. This is partially the results of a successful project conducted in November 2012 by a group of electrical and electronic students from the University of Johannesburg. The goal of this project was to take aerial pictures at the highest possible altitude above the sea level from the flying system while tracking its position in real-time. The solution proposed was based on a low cost unmanned system for a reliable and optimal aerial observation and tracking, suitable for start-ups companies or research groups

Binary balanced codes approaching capacity

Abstract: In this paper, the construction of binary balanced codes is revisited. Binary balanced codes refer to sets of bipolar codewords where the number of “1”s in each codeword equals that of “0”s. The first algorithm for balancing codes was proposed by Knuth in 1986; however, its redundancy is almost two times larger than that of the full set of balanced codewords. We will present an efficient and simple construction with a redundancy approaching the minimal achievable one

Monitoring of the medication distribution and the refrigeration temperature in a pharmacy based on internet of things (IoT) technology

Abstract: For the past 15 years since its appearance, Internet of Things (IoT) technology has been leading the planet towards a smart world where all devices and physical objects, referred to as “things”, will be connected via electronic sensors through the Internet. The distribution of medication to patients at a pharmacy in certain regions is still very traditional and outdated. Patients wait for a long time in queues to receive their medications, this is mostly due to the absence of an efficient distribution system. Also, the refrigeration temperature within several pharmacies is a huge problem, as medications must be kept at a constant temperature for an optimal results..