Shrewsbury, MA, United States of America

Kolar Kodandapani


Average Co-Inventor Count = 4.0

ph-index = 1

Forward Citations = 3(Granted Patents)


Company Filing History:


Years Active: 1998

Loading Chart...
1 patent (USPTO):Explore Patents

Title: Kolar Kodandapani: Innovator in Logic Circuit Design

Introduction

Kolar Kodandapani is a notable inventor based in Shrewsbury, MA (US). He has made significant contributions to the field of logic circuit design, particularly through his innovative patent. His work focuses on improving the efficiency of translating boolean functions into logic circuits.

Latest Patents

Kolar Kodandapani holds a patent for an "Implicit tree-mapping technique." This method provides a systematic approach for translating a boolean function into a logic circuit using gates from a standard library. The technique involves translating the boolean function into a network of sub-trees, each representing a portion of the function. Each sub-tree includes multiple representations stored in an alternative logic diagram, which consists of various ugates. These ugates define the inputs and connectivity within the sub-tree. The mapping process selects the best sub-tree representation, leading to an improved method of logic synthesis that optimizes the representation by starting with a broader range of inputs.

Career Highlights

Kolar Kodandapani has had a distinguished career at Digital Equipment Corporation, where he has applied his expertise in logic design. His innovative approach has contributed to advancements in the field, showcasing his ability to enhance existing methodologies.

Collaborations

Throughout his career, Kolar has collaborated with notable colleagues, including Eric Lehman and Joel J Grodstein. These partnerships have fostered a creative environment that encourages innovation and the sharing of ideas.

Conclusion

Kolar Kodandapani's contributions to logic circuit design through his patent demonstrate his commitment to innovation in the field. His work continues to influence the way boolean functions are translated into efficient logic circuits.

This text is generated by artificial intelligence and may not be accurate.
Please report any incorrect information to support@idiyas.com
Loading…