A construction for balancing non-binary sequences based on gray code prefixes
- Mambou, Elie N., Swart, Theo G.
- Authors: Mambou, Elie N. , Swart, Theo G.
- Date: 2018
- Subjects: Balanced sequence , DC-free codes , Gray code prefix
- Language: English
- Type: Article
- Identifier: http://hdl.handle.net/10210/279786 , uj:30053 , Citation: Mambou, E.N. & Swart, T.G. 2018. A construction for balancing non-binary sequences based on gray code prefixes. IEEE Transactions on Information Theory, 64(8):5961-5969. DOI:10.1109/TIT.2017.2766668
- Description: 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.
- Full Text:
- Authors: Mambou, Elie N. , Swart, Theo G.
- Date: 2018
- Subjects: Balanced sequence , DC-free codes , Gray code prefix
- Language: English
- Type: Article
- Identifier: http://hdl.handle.net/10210/279786 , uj:30053 , Citation: Mambou, E.N. & Swart, T.G. 2018. A construction for balancing non-binary sequences based on gray code prefixes. IEEE Transactions on Information Theory, 64(8):5961-5969. DOI:10.1109/TIT.2017.2766668
- Description: 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.
- Full Text:
Binary balanced codes approaching capacity
- Esenogho, Ebenezer, Mambou, Elie N., Swart, Theo G., Ferreira, Hendrik C.
- Authors: Esenogho, Ebenezer , Mambou, Elie N. , Swart, Theo G. , Ferreira, Hendrik C.
- Date: 2019
- Subjects: Balanced codes , Redundancy , Binary alphabet
- Language: English
- Type: Article
- Identifier: http://hdl.handle.net/10210/401121 , uj:33508 , Citation: Esenogho, E. et al. 2019. Binary balanced codes approaching capacity.
- Description: 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.
- Full Text:
- Authors: Esenogho, Ebenezer , Mambou, Elie N. , Swart, Theo G. , Ferreira, Hendrik C.
- Date: 2019
- Subjects: Balanced codes , Redundancy , Binary alphabet
- Language: English
- Type: Article
- Identifier: http://hdl.handle.net/10210/401121 , uj:33508 , Citation: Esenogho, E. et al. 2019. Binary balanced codes approaching capacity.
- Description: 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.
- Full Text:
Construction of q-ary constant weight sequences using a knuth-like approach
- Mambou, Elie N., Swart, Theo G.
- Authors: Mambou, Elie N. , Swart, Theo G.
- Date: 2017
- Language: English
- Type: Conference proceedings
- Identifier: http://hdl.handle.net/10210/237886 , uj:24382 , Citation: Mambou, E.N. & Swart, T.G. 2017. Construction of q-ary constant weight sequences using a knuth-like approach.
- Description: Abstract: We present an encoding and decoding scheme for constant weight sequences, that is, given an information sequence, the construction results in a sequence of specific weight within a certain range. The scheme uses a prefix design that is based on Gray codes. Furthermore, by adding redundant symbols we extend the range of weight values for output sequences, which is useful for some applications.
- Full Text:
- Authors: Mambou, Elie N. , Swart, Theo G.
- Date: 2017
- Language: English
- Type: Conference proceedings
- Identifier: http://hdl.handle.net/10210/237886 , uj:24382 , Citation: Mambou, E.N. & Swart, T.G. 2017. Construction of q-ary constant weight sequences using a knuth-like approach.
- Description: Abstract: We present an encoding and decoding scheme for constant weight sequences, that is, given an information sequence, the construction results in a sequence of specific weight within a certain range. The scheme uses a prefix design that is based on Gray codes. Furthermore, by adding redundant symbols we extend the range of weight values for output sequences, which is useful for some applications.
- Full Text:
Design and implementation of a real-time tracking and telemetry system for a solar car
- Mambou, Elie N., Swart, Theo G., Ferreira, Hendrik C., Ndjiounge, A.R.
- Authors: Mambou, Elie N. , Swart, Theo G. , Ferreira, Hendrik C. , Ndjiounge, A.R.
- Date: 2015
- Subjects: RaspberryPi , Graphical User Interface , Global positioning System
- Language: English
- Type: Article
- Identifier: http://ujcontent.uj.ac.za8080/10210/367464 , http://hdl.handle.net/10210/73181 , uj:18377 , Citation: Mambou, E.N. et al. 2015. Design and implementation of a real-time tracking and telemetry system for a solar car.
- Description: 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.
- Full Text:
- Authors: Mambou, Elie N. , Swart, Theo G. , Ferreira, Hendrik C. , Ndjiounge, A.R.
- Date: 2015
- Subjects: RaspberryPi , Graphical User Interface , Global positioning System
- Language: English
- Type: Article
- Identifier: http://ujcontent.uj.ac.za8080/10210/367464 , http://hdl.handle.net/10210/73181 , uj:18377 , Citation: Mambou, E.N. et al. 2015. Design and implementation of a real-time tracking and telemetry system for a solar car.
- Description: 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.
- Full Text:
Development of a helium gas balloon flying system for aerial photographing and observation
- Mambou, Elie N., Yamga, Gabriel M., Meyer, J., Ferreira, Hendrik C.
- Authors: Mambou, Elie N. , Yamga, Gabriel M. , Meyer, J. , Ferreira, Hendrik C.
- Date: 2016
- Subjects: Helium gas balloon , Flying height , Aerial observation
- Language: English
- Type: Conference proceedings
- Identifier: http://hdl.handle.net/10210/214250 , uj:21256 , Citation: Mambou, E.N. et al. 2016. Development of a helium gas balloon flying system for aerial photographing and observation.
- Description: 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.
- Full Text:
- Authors: Mambou, Elie N. , Yamga, Gabriel M. , Meyer, J. , Ferreira, Hendrik C.
- Date: 2016
- Subjects: Helium gas balloon , Flying height , Aerial observation
- Language: English
- Type: Conference proceedings
- Identifier: http://hdl.handle.net/10210/214250 , uj:21256 , Citation: Mambou, E.N. et al. 2016. Development of a helium gas balloon flying system for aerial photographing and observation.
- Description: 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.
- Full Text:
Encoding and Decoding of Balanced q-ary sequences using a gray code prefix
- Mambou, Elie N., Swart, Theo G.
- Authors: Mambou, Elie N. , Swart, Theo G.
- Date: 2016
- Language: English
- Type: Conference proceedings
- Identifier: http://hdl.handle.net/10210/123228 , uj:20766 , Citation: Mambou, E.N. & Swart, T.G. 2016. Encoding and Decoding of Balanced q-ary sequences using a gray code prefix.
- Description: 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.
- Full Text:
- Authors: Mambou, Elie N. , Swart, Theo G.
- Date: 2016
- Language: English
- Type: Conference proceedings
- Identifier: http://hdl.handle.net/10210/123228 , uj:20766 , Citation: Mambou, E.N. & Swart, T.G. 2016. Encoding and Decoding of Balanced q-ary sequences using a gray code prefix.
- Description: 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.
- Full Text:
Monitoring of the medication distribution and the refrigeration temperature in a pharmacy based on internet of things (IoT) technology
- Mambou, Elie N., Nlom, S. M., Swart, Theo G., Ouahada, K., Ndjiongue, A. R., Ferreira, Hendrik C.
- Authors: Mambou, Elie N. , Nlom, S. M. , Swart, Theo G. , Ouahada, K. , Ndjiongue, A. R. , Ferreira, Hendrik C.
- Date: 2016
- Subjects: Internet of things
- Language: English
- Type: Conference proceedings
- Identifier: http://hdl.handle.net/10210/123989 , uj:20860 , Citation: Mambou, E.N. et al. 2016. Monitoring of the medication distribution and the refrigeration temperature in a pharmacy based on internet of things (IoT) technology.
- Description: 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...
- Full Text:
- Authors: Mambou, Elie N. , Nlom, S. M. , Swart, Theo G. , Ouahada, K. , Ndjiongue, A. R. , Ferreira, Hendrik C.
- Date: 2016
- Subjects: Internet of things
- Language: English
- Type: Conference proceedings
- Identifier: http://hdl.handle.net/10210/123989 , uj:20860 , Citation: Mambou, E.N. et al. 2016. Monitoring of the medication distribution and the refrigeration temperature in a pharmacy based on internet of things (IoT) technology.
- Description: 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...
- Full Text:
On the improvement of the Knuth’s redundancy algorithm for balancing codes
- Esenogho, Ebenezer, Mambou, Elie N., Ferreira, Hendrik C.
- Authors: Esenogho, Ebenezer , Mambou, Elie N. , Ferreira, Hendrik C.
- Date: 2019
- Subjects: Balanced code , Inversion point , Redundancy
- Language: English
- Type: Article
- Identifier: http://hdl.handle.net/10210/403533 , uj:33820 , Citation: Esenogho, E., Mambou, E.N. & Ferreira, H.C. 2019. On the improvement of the Knuth’s redundancy algorithm for balancing codes.
- Description: 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.
- Full Text:
- Authors: Esenogho, Ebenezer , Mambou, Elie N. , Ferreira, Hendrik C.
- Date: 2019
- Subjects: Balanced code , Inversion point , Redundancy
- Language: English
- Type: Article
- Identifier: http://hdl.handle.net/10210/403533 , uj:33820 , Citation: Esenogho, E., Mambou, E.N. & Ferreira, H.C. 2019. On the improvement of the Knuth’s redundancy algorithm for balancing codes.
- Description: 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.
- Full Text:
- «
- ‹
- 1
- ›
- »