On Robustness Properties of Beta Encoders and Golden Ratio Encoders
Abstract
The betaencoder was recently proposed as a quantization scheme for analogtodigital conversion; in contrast to classical binary quantization, in which each analog sample x in [1,1] is mapped to the first N bits of its base2 expansion, betaencoders replace each sample x with its expansion in a base beta satisfying 1 < beta < 2. This expansion is nonunique when 1 < beta < 2, and the betaencoder exploits this redundancy to correct inevitable errors made by the quantizer component of its circuit design. The multiplier element of the betaencoder will also be imprecise; effectively, the true value beta at any time can only be specified to within an interval [ beta_{low}, beta_{high} ]. This problem was addressed by the golden ratio encoder, a close relative of the betaencoder that does not require a precise multiplier. However, the golden ratio encoder is susceptible to integrator leak in the delay elements of its hardware design, and this has the same effect of changing beta to an unknown value. In this paper, we present a method whereby exponentially precise approximations to the value of beta in both golden ratio encoders and beta encoders can be recovered amidst imprecise circuit components from the truncated betaexpansions of a "test" number x_{test} in [1,1], and its negative counterpart, x_{test}. That is, betaencoders and golden ratio encoders are robust with respect to unavoidable analog component imperfections that change the base beta needed for reconstruction.
 Publication:

arXiv eprints
 Pub Date:
 June 2008
 arXiv:
 arXiv:0806.1083
 Bibcode:
 2008arXiv0806.1083W
 Keywords:

 Mathematics  Numerical Analysis;
 14Gxx:14G50
 EPrint:
 21 pages, 6 figures