Abstract
The author discusses an elaborated rank order processor, which admits constants as operands and preliminary operations on input variables (e.g. negation) so that the processor is also implementable in bit-serial, most significant bit leading, terms. The theory for the special case in which the constant 0 and the operation negation are admitted and a realization in finite autoregressive form exists is discussed. Input/output relations are expressible with a finite-state sequential machine with ternary inputs and outputs; that machine is only a mathematical construct and need not represent an actual device. The question of root signals is examined theoretically and by example. An example showing a bandpass effect is presented, and computer programs for doing the relevant calculations pertaining to finite automata and simulations are offered. A part of a theory for general elaboration is also presented.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Sign-in/Register to access full text options 
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.
