Published August 1998
| public
Book Section - Chapter
Efficient digital to analog encoding
- Creators
- Gibson, Michael
-
Bruck, Jehoshua
Chicago
An error occurred while generating the citation.
Abstract
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. Wegener (1996) proved that [3n-1/2] 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. We present an explicit construction of a digital to analog encoder that is optimal in the number of 2-input arithmetic gates.
Additional Information
© 1998 IEEE. Date of Current Version: 06 August 2002. Supported in part by a National Science Foundation Graduate Research Fellowship, by NSF Young Investigator Award CCR-9457811 and by a Sloan Research Fellowship.Additional details
- Eprint ID
- 28476
- Resolver ID
- CaltechAUTHORS:20111215-111208543
- NSF Graduate Research Fellowship
- NSF Young Investigator Award
- CCR-9457811
- Sloan Research Fellowship
- Created
-
2011-12-15Created from EPrint's datestamp field
- Updated
-
2021-11-09Created from EPrint's last_modified field
- Other Numbering System Name
- INSPEC Accession Number
- Other Numbering System Identifier
- 6188868