The \(\beta \alpha \)-encoders for robust A/D conversion (Q1038727)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The \(\beta \alpha \)-encoders for robust A/D conversion |
scientific article; zbMATH DE number 5636301
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The \(\beta \alpha \)-encoders for robust A/D conversion |
scientific article; zbMATH DE number 5636301 |
Statements
The \(\beta \alpha \)-encoders for robust A/D conversion (English)
0 references
20 November 2009
0 references
In digital systems or communications we have as an encoding A/D (source encoder or analog to digital converter) the binary quantization system. In this paper, a mathematical algorithm of the \(\beta\)-encoder or \(\beta\)-expander is analysed and a robust system to the field is given. Also the paper introduces a more advanced system, the so called \(\beta\alpha\)-encoder which allows, as it is proven, that it gives more flexibility, challenge and robustness, so it is more interesting and dynamic. In this given algorithm, some constants are examined such as bounds (upper bound), the \(\beta\alpha\)-multiplication and ergodicity.
0 references
analog-to-digital conversion
0 references
\(\beta \)-encoder
0 references
\(\beta \alpha \)-encoder
0 references
\(\beta \)-expansion
0 references