Log in
Enquire now
‌

US Patent 6938061 Parallel counter and a multiplication logic circuit

Patent 6938061 was granted and assigned to Arithmatica on August, 2005 by the United States Patent and Trademark Office.

OverviewStructured DataIssuesContributors

Contents

Patent abstractTimelineTable: Further ResourcesReferences
Is a
Patent
Patent
1

Patent attributes

Patent Applicant
Loading...
1
Current Assignee
‌
Arithmatica
1
Patent Jurisdiction
United States Patent and Trademark Office
United States Patent and Trademark Office
1
Patent Number
69380611
Patent Inventor Names
Dmitriy Rumynin1
Peter Meulemans1
Sunil Talwar1
Date of Patent
August 30, 2005
1
Patent Application Number
096375321
Date Filed
August 11, 2000
1
Patent Citations Received
‌
US Patent 11838118 Device, system, and method of detecting vishing attacks
2
Patent Primary Examiner
‌
D. H. Malzahn
1
Patent abstract

A parallel counter comprises logic for generating output bits as symmetrical functions of the input bits. The parallel counter can be used in a multiplication circuit. A multiplication circuit is also provided in which an array of combinatins of each bit of a binary number with each other bit of another binary number is generated having a reduced from in order to reduce the steps required in array reduction.

Timeline

No Timeline data yet.

Further Resources

Title
Author
Link
Type
Date
No Further Resources data yet.

References

Find more entities like US Patent 6938061 Parallel counter and a multiplication logic circuit

Use the Golden Query Tool to find similar entities by any field in the Knowledge Graph, including industry, location, and more.
Open Query Tool
Access by API
Golden Query Tool
Golden logo

Company

  • Home
  • Press & Media
  • Blog
  • Careers
  • WE'RE HIRING

Products

  • Knowledge Graph
  • Query Tool
  • Data Requests
  • Knowledge Storage
  • API
  • Pricing
  • Enterprise
  • ChatGPT Plugin

Legal

  • Terms of Service
  • Enterprise Terms of Service
  • Privacy Policy

Help

  • Help center
  • API Documentation
  • Contact Us
By using this site, you agree to our Terms of Service.