This paper discusses the use of a recently introduced index calculus Double-Base Number System (IDBNS) for representing and processing numbers for non-linear digital signal processing; the target application is a digital hearing aid processor. The IDBNS representation uses 2 orthogonal bases (2 and 3) to represent real numbers with arbitrary precision. By restricting the number of digits to one or two, It is possible to efficiently represent the real number using the indices of the bases rather than the distribution of the digits. In this paper we discuss the use of the two-digit form of this representation (2-IDBNS) to efficiently perform arithmetic associated with the non-linear processing required to correct the usual forms of hearing loss in a digital hearing aid. The non-linear processing takes the form of dynamic range compression as a function of frequency band. Currently developed digital hearing instrument processors require large dynamic range representations (20 - 24 bits) in order to accurately generate the dynamic range compression associated with typical hearing loss. We show that the natural non-linear representation afforded by the IDBNS provides both a more efficient signal representation and a more efficient technique for processing the dynamic range compression. We pay particular attention to a novel technique of converting from a linear binary input directly to the 2-IDBNS representation using an observation of partial cyclic repetition in the indices along with near unity approximants.
[1]
B. D. Weger,et al.
Algorithms for diophantine equations
,
1989
.
[2]
David M. Lewis.
An accurate LNS arithmetic unit using interleaved memory function interpolator
,
1993,
Proceedings of IEEE 11th Symposium on Computer Arithmetic.
[3]
N. Magotra,et al.
Multichannel adaptive noise reduction in digital hearing aids
,
1998,
ISCAS '98. Proceedings of the 1998 IEEE International Symposium on Circuits and Systems (Cat. No.98CH36187).
[4]
Graham A. Jullien,et al.
Theory and applications for a double-base number system
,
1997,
Proceedings 13th IEEE Sympsoium on Computer Arithmetic.
[5]
A. Brentjes,et al.
Multi-dimensional continued fraction algorithms
,
1981
.