NeumannCorrector is an Arduino library for a correcting a random streams of bits.
NeumannCorrector is an EXPERIMENTAL library.
The goal of a NeumannCorrector is to extract a random stream of bits from a stream that is unbalanced in the number of ones and zeros. The working is based upon the fact that in such a stream there will always be an equal amount of 0->1 transitions as 1->0 transitions. The algorithm compares pairs of bits, resulting in an often substantial lower bitrate at the outside. At least a factor 2 and often more. For large number of bits the unbalance(skew/bias) is removed.
The 0.1.0 version is more or less a reference implementation. It can be used for experiments and for educational purposes.
As always remarks are welcome.
- https://github.com/RobTillaart/NeumannCorrector
- https://github.com/RobTillaart/DEVRANDOM
- https://github.com/RobTillaart/randomHelpers
- https://github.com/RobTillaart/Prandom
- https://link.springer.com/referenceworkentry/10.1007/978-1-4419-5906-5_520
#include "NeumannCorrector.h"- NeumannCorrector() constructor, internal seize = 32 bits.
- void clear() sets the internal buffer to 0.
- uint8_t available() returns bits available in internal buffer.
- uint8_t size() returns the size of the internal buffer. (32 hardcoded).
- void add(uint8_t in) adds zero or more bits of the param to the internal buffer.
- uint8_t get() returns 8 bits from the internal buffer, even if these are not available.
- uint16_t get16() returns 16 bits from the internal buffer, even if these are not available.
- uint32_t get32() returns 32 bits from the internal buffer, even if these are not available.
- documentation
- add xor mask in constructor, to xor every incoming value
- or a multiply add shift mask?
- extend unit tests.
- add16() + add32() ?
- add a non-zero starting value for internal buffer?
If you appreciate my libraries, you can support the development and maintenance. Improve the quality of the libraries by providing issues and Pull Requests, or donate through PayPal or GitHub sponsors.
Thank you,