Abstract
This paper presents a nontable-lookup technique for generating a class of n -dimensional m -ary Gray codes for every pair ( n, m ) of integers. It does not seek to exhaust all such codes, but restricts itself to a class characterized by simple encoding and decoding schemes. The simplicity shows up not only in the mathematical description of these codes as affine transforms of the sequence of m -ary numbers, but also in the circuitry required for realizations. For instance, a serial decoder can be built of a single unit delay and a single modular adder.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
