G - Physics – 06 – F
Patent
G - Physics
06
F
G06F 7/50 (2006.01) H03K 19/00 (2006.01) H03K 19/08 (2006.01)
Patent
CA 2619514
It is known that fast, fully combinational leading-digit detector circuits (also known as priority encoders) can be generated efficiently by recognizing their inherent hierarchical structure. It is shown herein that this structure is not only hierarchical, but also recursive. This recursivity fully defines a minimal-complexity circuit, thus garanteeing optimal circuit synthesis. Such a circuit having an N-bit operand generates all output bits with log2(N) combinational stages. It also makes possible a recursive parametenzable description in VHDL or other hardware description languages supporting recursion. For standard cell generation, it is amenable to efficient, automatic recursive routing. Furthermore, the same recursive structure can serve as the basis of other useful arithmetic functions, including fast adder structures, fast incrementers / decrementers and a fast comparator. Therefore, this multifunction circuit could be employed in the design of fast, low-complexity arithmetic-logic units (ALUs) inside microprocessors, digital signal processors, or application-specific system-on-chip (SoC) designs. By selective application of power to various subtrees, the multifunction circuit also provides low-power benefits in addition to economies in logic area (with respect to separate implementation of the various functions)
Na
Roy Sebastien
LandOfFree
A multifunction recursive circuit for fast addition,... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with A multifunction recursive circuit for fast addition,..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A multifunction recursive circuit for fast addition,... will most certainly appreciate the feedback.
Profile ID: LFCA-PAI-O-1532807