Gibson, Michael A. and Bruck, Jehoshua (1996) Efficient Digital to Analog Encoding. California Institute of Technology . (Unpublished) http://resolver.caltech.edu/CaltechPARADISE:1996.ETR009
PDF (Adobe PDF (566KB))
See Usage Policy.
See Usage Policy.
Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechPARADISE:1996.ETR009
NOTE: Text or symbols not renderable in plain ASCII are indicated by [...]. Abstract included in .pdf document. An important issue in analog circuit design is the problem of digital to analog conversion, namely, the encoding of Boolean variables into a single analog value which contains enough information to reconstruct the values of the Boolean variables. A natural question is: What is the complexity of implementing the digital to analog encoding function? That question was recently answered in (5), where matching lower and upper bounds on the size of the circuit for the encoding function were proven. In particular, it was proven that [...] 2-input arithmetic gates are necessary and sufficient for implementing the encoding function of n Boolean variables. However, the proof of the upper bound is not constructive. In this paper, we present an explicit construction of a digital to analog encoder that is optimal in the number of 2-input arithmetic gates. In addition, we present an efficient analog to digital decoding algorithm. Namely, given the encoded analog value, our decoding algorithm reconstructs the original Boolean values. Our construction is suboptimal in that it uses constants [...] bits.
|Item Type:||Report or Paper (Technical Report)|
|Group:||Parallel and Distributed Systems Group|
|Usage Policy:||You are granted permission for individual, educational, research and non-commercial reproduction, distribution, display and performance of this work in any format.|
|Deposited By:||Imported from CaltechPARADISE|
|Deposited On:||04 Sep 2002|
|Last Modified:||26 Dec 2012 13:52|
Repository Staff Only: item control page